data
dict |
|---|
{
"issue": {
"id": "12OmNAPBbfp",
"title": "November",
"year": "1986",
"issueNum": "11",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "6",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgzc6",
"doi": "10.1109/MCG.1986.276658",
"abstract": "Various techniques have been developed that employ projections of the world as seen from a particular viewpoint. Blinn and Newell introduced reflection mapping for simulating mirror reflections on curved surfaces. Miller and Hoffman have presented a general illumination model based on environment mapping. World projections have also been used to model distant objects and to produce pictures with the fish-eye distortion required for Omnimax frames. This article proposes a uniform framework for representing and using world projections and argues that the best general-purpose representation is the is projection onto a cube. Surface shading and texture filtering are discussed in the context of environment mapping, and methods are presented for obtaining diffuse and specular surface illumination from prefiltered environment maps. Comparisons are made with ray tracing, noting that two problems with ray tracing-obtaining diffuse reflection and antialiasing specular reflection-can be handled effectively by environment mapping.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Various techniques have been developed that employ projections of the world as seen from a particular viewpoint. Blinn and Newell introduced reflection mapping for simulating mirror reflections on curved surfaces. Miller and Hoffman have presented a general illumination model based on environment mapping. World projections have also been used to model distant objects and to produce pictures with the fish-eye distortion required for Omnimax frames. This article proposes a uniform framework for representing and using world projections and argues that the best general-purpose representation is the is projection onto a cube. Surface shading and texture filtering are discussed in the context of environment mapping, and methods are presented for obtaining diffuse and specular surface illumination from prefiltered environment maps. Comparisons are made with ray tracing, noting that two problems with ray tracing-obtaining diffuse reflection and antialiasing specular reflection-can be handled effectively by environment mapping.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Various techniques have been developed that employ projections of the world as seen from a particular viewpoint. Blinn and Newell introduced reflection mapping for simulating mirror reflections on curved surfaces. Miller and Hoffman have presented a general illumination model based on environment mapping. World projections have also been used to model distant objects and to produce pictures with the fish-eye distortion required for Omnimax frames. This article proposes a uniform framework for representing and using world projections and argues that the best general-purpose representation is the is projection onto a cube. Surface shading and texture filtering are discussed in the context of environment mapping, and methods are presented for obtaining diffuse and specular surface illumination from prefiltered environment maps. Comparisons are made with ray tracing, noting that two problems with ray tracing-obtaining diffuse reflection and antialiasing specular reflection-can be handled effectively by environment mapping.",
"title": "Environment Mapping and Other Applications of World Projections",
"normalizedTitle": "Environment Mapping and Other Applications of World Projections",
"fno": "mcg1986110021",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Reflection",
"Lighting",
"Ray Tracing",
"Surface Treatment",
"Solid Modeling",
"Filtering",
"Graphics",
"Tree Graphs",
"Terrain Mapping",
"Surface Texture"
],
"authors": [
{
"givenName": "Ned",
"surname": "Greene",
"fullName": "Ned Greene",
"affiliation": "New York Institute of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "11",
"pubDate": "1986-11-01 00:00:00",
"pubType": "mags",
"pages": "21-29",
"year": "1986",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660003",
"title": "Illuminated Lines Revisited",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660003/12OmNBO3KdZ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1989/1952/0/00037873",
"title": "Using polarization to separate reflection components",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1989/00037873/12OmNBlFR1K",
"parentPublication": {
"id": "proceedings/cvpr/1989/1952/0",
"title": "1989 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/1993/3492/0/00397135",
"title": "Mapping arbitrary projections for volume rendering onto an array processor",
"doi": null,
"abstractUrl": "/proceedings-article/asap/1993/00397135/12OmNrJ11Io",
"parentPublication": {
"id": "proceedings/asap/1993/3492/0",
"title": "Proceedings of International Conference on Application Specific Array Processors (ASAP '93)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1993/3880/0/00341071",
"title": "Removal of specularities using color and polarization",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341071/12OmNyaGeEq",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iitaw/2008/3505/0/3505a487",
"title": "Image-Based Fitting Diffuse and Specular Reflectance of Object",
"doi": null,
"abstractUrl": "/proceedings-article/iitaw/2008/3505a487/12OmNyqiaO0",
"parentPublication": {
"id": "proceedings/iitaw/2008/3505/0",
"title": "2008 International Symposium on Intelligent Information Technology Application Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761299",
"title": "Specularity removal and relighting of 3D object model for virtual exhibition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761299/12OmNyuPKTC",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/03/v0253",
"title": "Perturbation Methods for Interactive Specular Reflections",
"doi": null,
"abstractUrl": "/journal/tg/2000/03/v0253/13rRUwj7coZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2014/04/mcg2014040042",
"title": "The Colloidal Metamorphosis: Time Division Multiplexing of the Reflectance State",
"doi": null,
"abstractUrl": "/magazine/cg/2014/04/mcg2014040042/13rRUxBrGju",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/11/09523836",
"title": "Foveated Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09523836/1wpquR1qr1S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800b075",
"title": "Recovering Real-World Reflectance Properties and Shading From HDR Imagery",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800b075/1zWEfggzOaA",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "MCG-v6-n11-20",
"articleId": "13rRUwInvLJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg19861100c2",
"articleId": "13rRUwbJCZ3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyp9Mqp",
"title": "September/October",
"year": "2010",
"issueNum": "05",
"idPrefix": "dt",
"pubType": "magazine",
"volume": "27",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPAw",
"doi": "10.1109/MDT.2010.106",
"abstract": "Multiprocessor-system-on-a-chip (MPSoC) applications can consist of a varying number of simultaneous tasks and can change even after system design, enforcing a scenario that requires the use of dynamic task mapping. This article investigates dynamic task-mapping heuristics targeting reduction of network congestion in network-on-chip (NoC)-based MPSoCs. The proposed heuristics achieve up to 31% smaller channel load and up to 22% smaller packet latency than other heuristics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multiprocessor-system-on-a-chip (MPSoC) applications can consist of a varying number of simultaneous tasks and can change even after system design, enforcing a scenario that requires the use of dynamic task mapping. This article investigates dynamic task-mapping heuristics targeting reduction of network congestion in network-on-chip (NoC)-based MPSoCs. The proposed heuristics achieve up to 31% smaller channel load and up to 22% smaller packet latency than other heuristics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multiprocessor-system-on-a-chip (MPSoC) applications can consist of a varying number of simultaneous tasks and can change even after system design, enforcing a scenario that requires the use of dynamic task mapping. This article investigates dynamic task-mapping heuristics targeting reduction of network congestion in network-on-chip (NoC)-based MPSoCs. The proposed heuristics achieve up to 31% smaller channel load and up to 22% smaller packet latency than other heuristics.",
"title": "Dynamic Task Mapping for MPSoCs",
"normalizedTitle": "Dynamic Task Mapping for MPSoCs",
"fno": "mdt2010050026",
"hasPdf": true,
"idPrefix": "dt",
"keywords": [
"Design And Test",
"Dynamic Task Mapping",
"MP So C",
"So C",
"No C"
],
"authors": [
{
"givenName": "Ewerson Luiz de Souza",
"surname": "Carvalho",
"fullName": "Ewerson Luiz de Souza Carvalho",
"affiliation": "Pontifícia Universidade Católica do Rio Grande do Sul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ney Laert Vilar",
"surname": "Calazans",
"fullName": "Ney Laert Vilar Calazans",
"affiliation": "Pontifícia Universidade Católica do Rio Grande do Sul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fernando Gehm",
"surname": "Moraes",
"fullName": "Fernando Gehm Moraes",
"affiliation": "Pontifícia Universidade Católica do Rio Grande do Sul",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2010-09-01 00:00:00",
"pubType": "mags",
"pages": "26-35",
"year": "2010",
"issn": "0740-7475",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isvlsid/2010/4076/0/4076a345",
"title": "A Homogeneous MPSoC with Dynamic Task Mapping for Software Defined Radio",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsid/2010/4076a345/12OmNA1mbfd",
"parentPublication": {
"id": "proceedings/isvlsid/2010/4076/0",
"title": "2010 IEEE Computer Society Annual Symposium on VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iceccs/2008/3139/0/3139a056",
"title": "Task Mapping in Heterogeneous MPSoCs for System Level Design",
"doi": null,
"abstractUrl": "/proceedings-article/iceccs/2008/3139a056/12OmNvjQ8Fh",
"parentPublication": {
"id": "proceedings/iceccs/2008/3139/0",
"title": "Engineering of Complex Computer Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsid/2011/4447/0/4447a337",
"title": "Preprocessing-Based Run-Time Mapping of Applications on NoC-based MPSoCs",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsid/2011/4447a337/12OmNwCJOKi",
"parentPublication": {
"id": "proceedings/isvlsid/2011/4447/0",
"title": "2011 IEEE Computer Society Annual Symposium on VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/prdc/2011/4590/0/4590a053",
"title": "A Dependability Solution for Homogeneous MPSoCs",
"doi": null,
"abstractUrl": "/proceedings-article/prdc/2011/4590a053/12OmNwdtwlo",
"parentPublication": {
"id": "proceedings/prdc/2011/4590/0",
"title": "Pacific Rim International Symposium on Dependable Computing, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2012/2145/0/06176571",
"title": "Design of streaming applications on MPSoCs using abstract clocks",
"doi": null,
"abstractUrl": "/proceedings-article/date/2012/06176571/12OmNxHryju",
"parentPublication": {
"id": "proceedings/date/2012/2145/0",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paap/2011/4575/0/4575a203",
"title": "Run-Time Computation and Communication Aware Mapping Heuristic for NoC-Based Heterogeneous MPSoC Platforms",
"doi": null,
"abstractUrl": "/proceedings-article/paap/2011/4575a203/12OmNywfKHk",
"parentPublication": {
"id": "proceedings/paap/2011/4575/0",
"title": "Parallel Architectures, Algorithms and Programming, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsid/2007/2896/0/04208961",
"title": "Congestion-Aware Task Mapping in NoC-based MPSoCs with Dynamic Workload",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsid/2007/04208961/12OmNzYeALK",
"parentPublication": {
"id": "proceedings/isvlsid/2007/2896/0",
"title": "IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rsp/2007/2834/0/04228482",
"title": "Heuristics for Dynamic Task Mapping in NoC-based Heterogeneous MPSoCs",
"doi": null,
"abstractUrl": "/proceedings-article/rsp/2007/04228482/12OmNzcxZ2r",
"parentPublication": {
"id": "proceedings/rsp/2007/2834/0",
"title": "18th IEEE/IFIP International Workshop on Rapid System Prototyping, RSP 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rsp/2009/3690/0/3690a055",
"title": "Efficient Heuristics for Minimizing Communication Overhead in NoC-based Heterogeneous MPSoC Platforms",
"doi": null,
"abstractUrl": "/proceedings-article/rsp/2009/3690a055/12OmNzn38R6",
"parentPublication": {
"id": "proceedings/rsp/2009/3690/0",
"title": "Rapid System Prototyping, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/dt/2011/02/mdt2011020016",
"title": "Exploring NoC-Based MPSoC Design Space with Power Estimation Models",
"doi": null,
"abstractUrl": "/magazine/dt/2011/02/mdt2011020016/13rRUyuvRsZ",
"parentPublication": {
"id": "mags/dt",
"title": "IEEE Design & Test of Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mdt2010050014",
"articleId": "13rRUyuvRsY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mdt2010050036",
"articleId": "13rRUILLkKw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFix",
"title": "June",
"year": "1993",
"issueNum": "06",
"idPrefix": "tc",
"pubType": "journal",
"volume": "42",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD1E",
"doi": "10.1109/12.277294",
"abstract": "A systematic approach for mapping application tasks to hypercubes is proposed. This method is based on a partitioning algorithm in which the final mapping is rendered as a task-node tuple assignment for an n-cube system. For this method, a single-tasking environment in which each task is assigned to a unique processor is assumed. Dilation-bound and expansion-ratio parameters are used to evaluate the efficacy of this mapping algorithm. An algorithm that minimizes the expansion-ratio parameter is introduced. In addition, an algorithm that reduces the dilaton bound is proposed. Because of the structured formation of the algorithms, they can be applied to any given task structure. As an illustration of the effectiveness of this method, the proposed algorithms are applied to mapping complete binary and d-ary tree task structures to hypercubes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A systematic approach for mapping application tasks to hypercubes is proposed. This method is based on a partitioning algorithm in which the final mapping is rendered as a task-node tuple assignment for an n-cube system. For this method, a single-tasking environment in which each task is assigned to a unique processor is assumed. Dilation-bound and expansion-ratio parameters are used to evaluate the efficacy of this mapping algorithm. An algorithm that minimizes the expansion-ratio parameter is introduced. In addition, an algorithm that reduces the dilaton bound is proposed. Because of the structured formation of the algorithms, they can be applied to any given task structure. As an illustration of the effectiveness of this method, the proposed algorithms are applied to mapping complete binary and d-ary tree task structures to hypercubes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A systematic approach for mapping application tasks to hypercubes is proposed. This method is based on a partitioning algorithm in which the final mapping is rendered as a task-node tuple assignment for an n-cube system. For this method, a single-tasking environment in which each task is assigned to a unique processor is assumed. Dilation-bound and expansion-ratio parameters are used to evaluate the efficacy of this mapping algorithm. An algorithm that minimizes the expansion-ratio parameter is introduced. In addition, an algorithm that reduces the dilaton bound is proposed. Because of the structured formation of the algorithms, they can be applied to any given task structure. As an illustration of the effectiveness of this method, the proposed algorithms are applied to mapping complete binary and d-ary tree task structures to hypercubes.",
"title": "A Systematic Approach for Mapping Application Tasks in Hypercubes",
"normalizedTitle": "A Systematic Approach for Mapping Application Tasks in Hypercubes",
"fno": "t0742",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Dilaton Bound Mapping Application Tasks Hypercubes Partitioning Algorithm N Cube System Expansion Ratio Tree Task Structures Hypercube Networks Resource Allocation"
],
"authors": [
{
"givenName": "A.",
"surname": "Kavianpour",
"fullName": "A. Kavianpour",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "N.",
"surname": "Bagherzadeh",
"fullName": "N. Bagherzadeh",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1993-06-01 00:00:00",
"pubType": "trans",
"pages": "742-746",
"year": "1993",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "t0738",
"articleId": "13rRUxZ0o0m",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "t0746",
"articleId": "13rRUwbs1ZW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzvhvFQ",
"title": "January",
"year": "2012",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInv4m",
"doi": "10.1109/TVCG.2011.47",
"abstract": "We present a method for constructing 3D feature flow from video and its application to video stylization. Our method extracts smoothly aligned 3D vectors that describe the smallest variation of colors within a spatiotemporal video cube, and thus effectively preserves both spatial and temporal coherence in a relatively inexpensive manner. As an application of this flow field we present a particle-based video stylization technique to rerender the video in a feature enhancing, painterly style. Our method consists of per-pixel operations and is suitable for GPU implementation, which enables real-time video stylization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a method for constructing 3D feature flow from video and its application to video stylization. Our method extracts smoothly aligned 3D vectors that describe the smallest variation of colors within a spatiotemporal video cube, and thus effectively preserves both spatial and temporal coherence in a relatively inexpensive manner. As an application of this flow field we present a particle-based video stylization technique to rerender the video in a feature enhancing, painterly style. Our method consists of per-pixel operations and is suitable for GPU implementation, which enables real-time video stylization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a method for constructing 3D feature flow from video and its application to video stylization. Our method extracts smoothly aligned 3D vectors that describe the smallest variation of colors within a spatiotemporal video cube, and thus effectively preserves both spatial and temporal coherence in a relatively inexpensive manner. As an application of this flow field we present a particle-based video stylization technique to rerender the video in a feature enhancing, painterly style. Our method consists of per-pixel operations and is suitable for GPU implementation, which enables real-time video stylization.",
"title": "Video Painting Based on a Stabilized Time-Varying Flow Field",
"normalizedTitle": "Video Painting Based on a Stabilized Time-Varying Flow Field",
"fno": "ttg2012010058",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Video Signal Processing",
"Computer Graphic Equipment",
"Coprocessors",
"Image Colour Analysis",
"Rendering Computer Graphics",
"Nonphotorealistic Rendering",
"Video Painting",
"Stabilized Time Varying Flow Field",
"3 D Feature Flow Construction",
"Video Stylization",
"3 D Vectors",
"Spatiotemporal Video Cube",
"Color Variation",
"Particle Based Video Stylization Technique",
"GPU Implementation",
"Three Dimensional Displays",
"Pixel",
"Painting",
"Image Color Analysis",
"Rendering Computer Graphics",
"Color",
"Coherence",
"Painterly Rendering",
"Nonphotorealistic Rendering",
"Flow Based Filtering",
"Video Abstraction"
],
"authors": [
{
"givenName": null,
"surname": "Jong-Chul Yoon",
"fullName": "Jong-Chul Yoon",
"affiliation": "Dept. of Broadcasting Visual Art Technol. & Entertainment, Kangwon Nat. Univ. at Samcheuk, Samcheuk, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "In-Kwon Lee",
"fullName": "In-Kwon Lee",
"affiliation": "Dept. of Comput. Sci., Yonsei Univ., Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "H.",
"surname": "Kang",
"fullName": "H. Kang",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2012-01-01 00:00:00",
"pubType": "trans",
"pages": "58-67",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880099",
"title": "Rendering Implicit Flow Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880099/12OmNC3XhuI",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2012/4836/0/4836a013",
"title": "An Automatic Rendering Method of Line Strokes for Chinese Landscape Painting",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2012/4836a013/12OmNy3RRF5",
"parentPublication": {
"id": "proceedings/icvrv/2012/4836/0",
"title": "2012 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a079",
"title": "Importance-Driven Composition of Multiple Rendering Styles",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a079/12OmNyPQ4MH",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/02/ttg2014020316",
"title": "Erratum to \"Video Painting Based on a Stabilized Time-Varying Flow Field\"",
"doi": null,
"abstractUrl": "/journal/tg/2014/02/ttg2014020316/13rRUwd9CLO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/01/ttg2011010074",
"title": "Video Painting with Space-Time-Varying Style Parameters",
"doi": null,
"abstractUrl": "/journal/tg/2011/01/ttg2011010074/13rRUxAAT0N",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050866",
"title": "State of the \"Art”: A Taxonomy of Artistic Stylization Techniques for Images and Video",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050866/13rRUxBa561",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/06/07920337",
"title": "Real-Time Video Stylization Using Object Flows",
"doi": null,
"abstractUrl": "/journal/tg/2018/06/07920337/13rRUxC0SEl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/03/v0266",
"title": "Efficient Example-Based Painting and Synthesis of 2D Directional Texture",
"doi": null,
"abstractUrl": "/journal/tg/2004/03/v0266/13rRUxcbnH1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030475",
"title": "AniPaint: Interactive Painterly Animation from Video",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030475/13rRUygT7sB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900m2191",
"title": "Rethinking Style Transfer: From Pixels to Parameterized Brushstrokes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900m2191/1yeKcTehYzu",
"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": "ttg2012010047",
"articleId": "13rRUwwaKt5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012010068",
"articleId": "13rRUx0gefk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgEF",
"name": "ttg2012010058s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012010058s.zip",
"extension": "zip",
"size": "261 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtc6",
"title": "November/December",
"year": "2010",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5U2C",
"doi": "10.1109/TVCG.2010.152",
"abstract": "We develop an interactive analysis and visualization tool for probabilistic segmentation in medical imaging. The originality of our approach is that the data exploration is guided by shape and appearance knowledge learned from expert-segmented images of a training population. We introduce a set of multidimensional transfer function widgets to analyze the multivariate probabilistic field data. These widgets furnish the user with contextual information about conformance or deviation from the population statistics. We demonstrate the user's ability to identify suspicious regions (e.g. tumors) and to correct the misclassification results. We evaluate our system and demonstrate its usefulness in the context of static anatomical and time-varying functional imaging datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We develop an interactive analysis and visualization tool for probabilistic segmentation in medical imaging. The originality of our approach is that the data exploration is guided by shape and appearance knowledge learned from expert-segmented images of a training population. We introduce a set of multidimensional transfer function widgets to analyze the multivariate probabilistic field data. These widgets furnish the user with contextual information about conformance or deviation from the population statistics. We demonstrate the user's ability to identify suspicious regions (e.g. tumors) and to correct the misclassification results. We evaluate our system and demonstrate its usefulness in the context of static anatomical and time-varying functional imaging datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We develop an interactive analysis and visualization tool for probabilistic segmentation in medical imaging. The originality of our approach is that the data exploration is guided by shape and appearance knowledge learned from expert-segmented images of a training population. We introduce a set of multidimensional transfer function widgets to analyze the multivariate probabilistic field data. These widgets furnish the user with contextual information about conformance or deviation from the population statistics. We demonstrate the user's ability to identify suspicious regions (e.g. tumors) and to correct the misclassification results. We evaluate our system and demonstrate its usefulness in the context of static anatomical and time-varying functional imaging datasets.",
"title": "Exploration and Visualization of Segmentation Uncertainty using Shape and Appearance Prior Information",
"normalizedTitle": "Exploration and Visualization of Segmentation Uncertainty using Shape and Appearance Prior Information",
"fno": "ttg2010061366",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Uncertainty Visualization",
"Medical Imaging",
"Probabilistic Segmentation"
],
"authors": [
{
"givenName": "Ahmed",
"surname": "Saad",
"fullName": "Ahmed Saad",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ghassan",
"surname": "Hamarneh",
"fullName": "Ghassan Hamarneh",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Torsten",
"surname": "Möller",
"fullName": "Torsten Möller",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "trans",
"pages": "1366-1375",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/smi/2007/2815/0/28150226",
"title": "3D Vascular Shape Segmentation for Fluid-Structure Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2007/28150226/12OmNAH5dkH",
"parentPublication": {
"id": "proceedings/smi/2007/2815/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2001/1230/0/12300254",
"title": "Partial Probabilistic Interpretations and General Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2001/12300254/12OmNCwlajE",
"parentPublication": {
"id": "proceedings/dexa/2001/1230/0",
"title": "12th International Workshop on Database and Expert Systems Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cscwd/2005/0002/2/01504181",
"title": "The design and implementation of a novel platform for medical data visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cscwd/2005/01504181/12OmNrNh0Lv",
"parentPublication": {
"id": "proceedings/cscwd/2005/0002/2",
"title": "International Conference on Computer Supported Cooperative Work in Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032b182",
"title": "ProbFlow: Joint Optical Flow and Uncertainty Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032b182/12OmNwCaCzd",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2014/4435/0/4435a523",
"title": "Liver Segmentation in Contrast Enhanced MR Datasets Using a Probabilistic Active Shape and Appearance Model",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2014/4435a523/12OmNxvO00m",
"parentPublication": {
"id": "proceedings/cbms/2014/4435/0",
"title": "2014 IEEE 27th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460088",
"title": "Graph cut energy minimization in a probabilistic learning framework for 3D prostate segmentation in MRI",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460088/12OmNzV70mR",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376198",
"title": "Uncertainty Visualization in Medical Volume Rendering Using Probabilistic Animation",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376198/13rRUxBa5x8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/06/08618426",
"title": "Hierarchical Image Semantics Using Probabilistic Path Propagations for Biomedical Research",
"doi": null,
"abstractUrl": "/magazine/cg/2019/06/08618426/17D45WwsQ6K",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacvw/2022/5824/0/582400a760",
"title": "Generalizing Imaging Through Scattering Media With Uncertainty Estimates",
"doi": null,
"abstractUrl": "/proceedings-article/wacvw/2022/582400a760/1B12yUV6Nuo",
"parentPublication": {
"id": "proceedings/wacvw/2022/5824/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision Workshops (WACVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900n3891",
"title": "Learning Probabilistic Ordinal Embeddings for Uncertainty-Aware Regression",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900n3891/1yeItyLY6o8",
"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": "ttg2010061339",
"articleId": "13rRUxBJhvq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010061376",
"articleId": "13rRUyY294y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvf9",
"doi": "10.1109/TVCG.2014.2346405",
"abstract": "Dedicated visualization methods are among the most important tools of modern computer-aided medical applications. Reformation methods such as Multiplanar Reformation or Curved Planar Reformation have evolved as useful tools that facilitate diagnostic and therapeutic work. In this paper, we present a novel approach that can be seen as a generalization of Multiplanar Reformation to curved surfaces. The main concept is to generate reformatted medical volumes driven by the individual anatomical geometry of a specific patient. This process generates flat views of anatomical structures that facilitate many tasks such as diagnosis, navigation and annotation. Our reformation framework is based on a non-linear as-rigid-as-possible volumetric deformation scheme that uses generic triangular surface meshes as input. To manage inevitable distortions during reformation, we introduce importance maps which allow controlling the error distribution and improving the overall visual quality in areas of elevated interest. Our method seamlessly integrates with well-established concepts such as the slice-based inspection of medical datasets and we believe it can improve the overall efficiency of many medical workflows. To demonstrate this, we additionally present an integrated visualization system and discuss several use cases that substantiate its benefits.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dedicated visualization methods are among the most important tools of modern computer-aided medical applications. Reformation methods such as Multiplanar Reformation or Curved Planar Reformation have evolved as useful tools that facilitate diagnostic and therapeutic work. In this paper, we present a novel approach that can be seen as a generalization of Multiplanar Reformation to curved surfaces. The main concept is to generate reformatted medical volumes driven by the individual anatomical geometry of a specific patient. This process generates flat views of anatomical structures that facilitate many tasks such as diagnosis, navigation and annotation. Our reformation framework is based on a non-linear as-rigid-as-possible volumetric deformation scheme that uses generic triangular surface meshes as input. To manage inevitable distortions during reformation, we introduce importance maps which allow controlling the error distribution and improving the overall visual quality in areas of elevated interest. Our method seamlessly integrates with well-established concepts such as the slice-based inspection of medical datasets and we believe it can improve the overall efficiency of many medical workflows. To demonstrate this, we additionally present an integrated visualization system and discuss several use cases that substantiate its benefits.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dedicated visualization methods are among the most important tools of modern computer-aided medical applications. Reformation methods such as Multiplanar Reformation or Curved Planar Reformation have evolved as useful tools that facilitate diagnostic and therapeutic work. In this paper, we present a novel approach that can be seen as a generalization of Multiplanar Reformation to curved surfaces. The main concept is to generate reformatted medical volumes driven by the individual anatomical geometry of a specific patient. This process generates flat views of anatomical structures that facilitate many tasks such as diagnosis, navigation and annotation. Our reformation framework is based on a non-linear as-rigid-as-possible volumetric deformation scheme that uses generic triangular surface meshes as input. To manage inevitable distortions during reformation, we introduce importance maps which allow controlling the error distribution and improving the overall visual quality in areas of elevated interest. Our method seamlessly integrates with well-established concepts such as the slice-based inspection of medical datasets and we believe it can improve the overall efficiency of many medical workflows. To demonstrate this, we additionally present an integrated visualization system and discuss several use cases that substantiate its benefits.",
"title": "ADR - Anatomy-Driven Reformation",
"normalizedTitle": "ADR - Anatomy-Driven Reformation",
"fno": "06876018",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Medical Computing",
"Mesh Generation",
"ADR Method",
"Anatomy Driven Reformation",
"Visualization Methods",
"Computer Aided Medical Application",
"Multiplanar Reformation",
"Curved Planar Reformation",
"Diagnostic Work",
"Therapeutic Work",
"Curved Surface",
"Reformatted Medical Volumes",
"Anatomical Geometry",
"Anatomical Structures",
"Nonlinear As Rigid As Possible Volumetric Deformation Scheme",
"Generic Triangular Surface Mesh",
"Error Distribution",
"Visual Quality",
"Slice Based Inspection",
"Medical Workflow",
"Anatomical Structure",
"Computer Aided Diagnosis",
"Medical Diagnosis",
"Three Dimensional Displays",
"Computed Tomography",
"Medical Visualization",
"Volume Reformation",
"Viewing Algorithms"
],
"authors": [
{
"givenName": "Jan",
"surname": "Kretschmer",
"fullName": "Jan Kretschmer",
"affiliation": "Department of Computer Graphics, FAU Erlangen, and Siemens Healthcare Computed Tomography, Forchheim, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Grzegorz",
"surname": "Soza",
"fullName": "Grzegorz Soza",
"affiliation": "Siemens Healthcare Computed Tomography, Forchheim, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Tietjen",
"fullName": "Christian Tietjen",
"affiliation": "Siemens Healthcare Computed Tomography, Forchheim, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Suehling",
"fullName": "Michael Suehling",
"affiliation": "Siemens Healthcare Computed Tomography, Forchheim, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernhard",
"surname": "Preim",
"fullName": "Bernhard Preim",
"affiliation": "Department of Simulation and Graphics, Otto-von-Guericke University of Magdeburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Stamminger",
"fullName": "Marc Stamminger",
"affiliation": "Department of Computer Graphics, FAU Erlangen, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2496-2505",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ismar/2013/2869/0/06671803",
"title": "Kinect for interactive AR anatomy learning",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2013/06671803/12OmNCd2rmp",
"parentPublication": {
"id": "proceedings/ismar/2013/2869/0",
"title": "2013 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200kanitsar",
"title": "Computed Tomography Angiography: A Case Study of Peripheral Vessel Investigation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200kanitsar/12OmNqIhFLY",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cimca/2008/3514/0/05172621",
"title": "A LDCT Image Contrast Enhancement Algorithm Based on Single-scale Retinex Theory",
"doi": null,
"abstractUrl": "/proceedings-article/cimca/2008/05172621/12OmNrGb2c3",
"parentPublication": {
"id": "proceedings/cimca/2008/3514/0",
"title": "2008 International Conference on Computational Intelligence for Modelling Control & Automation (CIMCA 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbec/2016/2132/0/07458977",
"title": "Anatomical Model Generator Based on Published Clinical Data on Cardiovascular Anatomy",
"doi": null,
"abstractUrl": "/proceedings-article/sbec/2016/07458977/12OmNscxj29",
"parentPublication": {
"id": "proceedings/sbec/2016/2132/0",
"title": "2016 32nd Southern Biomedical Engineering Conference (SBEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300007",
"title": "Advanced Curved Planar Reformation: Flattening of Vascular Structures",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300007/12OmNwErpEV",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206807",
"title": "Constrained marginal space learning for efficient 3D anatomical structure detection in medical images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206807/12OmNxuXcw8",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498kanitsar",
"title": "CPR - Curved Planar Reformation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498kanitsar/12OmNzSyCcj",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cimca/2008/3514/0/05172810",
"title": "A LDCT Image Contrast Enhancement Algorithm Based on Single-Scale Retinex Theory",
"doi": null,
"abstractUrl": "/proceedings-article/cimca/2008/05172810/12OmNzlD9tJ",
"parentPublication": {
"id": "proceedings/cimca/2008/3514/0",
"title": "2008 International Conference on Computational Intelligence for Modelling Control & Automation (CIMCA 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122858",
"title": "Vessel Visualization using Curved Surface Reformation",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122858/13rRUwIF6dS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd-summer/2022/9637/0/963700a125",
"title": "Coronal Curved Planar Reformation for Vertebra Localization in Pelvic Radiotherapy CT Images",
"doi": null,
"abstractUrl": "/proceedings-article/snpd-summer/2022/963700a125/1La4VgWvI5O",
"parentPublication": {
"id": "proceedings/snpd-summer/2022/9637/0",
"title": "2022 23rd ACIS International Summer Virtual Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD-Summer)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876051",
"articleId": "13rRUwInvfa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06877722",
"articleId": "13rRUytWF9k",
"__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": "1nTqoumGCS4",
"doi": "10.1109/TVCG.2020.3030402",
"abstract": "Mission designers must study many dynamical models to plan a low-cost spacecraft trajectory that satisfies mission constraints. They routinely use Poincare maps to search for a suitable path through the interconnected web of periodic orbits and invariant manifolds found in multi-body gravitational systems. This paper is concerned with the extraction and interactive visual exploration of this structural landscape to assist spacecraft trajectory planning. We propose algorithmic solutions that address the specific challenges posed by the characterization of the topology in astrodynamics problems and allow for an effective visual analysis of the resulting information. This visualization framework is applied to the circular restricted three-body problem (CR3BP), where it reveals novel periodic orbits with their relevant invariant manifolds in a suitable format for interactive transfer selection. Representative design problems illustrate how spacecraft path planners can leverage our topology visualization to fully exploit the natural dynamics pathways for energy-efficient trajectory designs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Mission designers must study many dynamical models to plan a low-cost spacecraft trajectory that satisfies mission constraints. They routinely use Poincare maps to search for a suitable path through the interconnected web of periodic orbits and invariant manifolds found in multi-body gravitational systems. This paper is concerned with the extraction and interactive visual exploration of this structural landscape to assist spacecraft trajectory planning. We propose algorithmic solutions that address the specific challenges posed by the characterization of the topology in astrodynamics problems and allow for an effective visual analysis of the resulting information. This visualization framework is applied to the circular restricted three-body problem (CR3BP), where it reveals novel periodic orbits with their relevant invariant manifolds in a suitable format for interactive transfer selection. Representative design problems illustrate how spacecraft path planners can leverage our topology visualization to fully exploit the natural dynamics pathways for energy-efficient trajectory designs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Mission designers must study many dynamical models to plan a low-cost spacecraft trajectory that satisfies mission constraints. They routinely use Poincare maps to search for a suitable path through the interconnected web of periodic orbits and invariant manifolds found in multi-body gravitational systems. This paper is concerned with the extraction and interactive visual exploration of this structural landscape to assist spacecraft trajectory planning. We propose algorithmic solutions that address the specific challenges posed by the characterization of the topology in astrodynamics problems and allow for an effective visual analysis of the resulting information. This visualization framework is applied to the circular restricted three-body problem (CR3BP), where it reveals novel periodic orbits with their relevant invariant manifolds in a suitable format for interactive transfer selection. Representative design problems illustrate how spacecraft path planners can leverage our topology visualization to fully exploit the natural dynamics pathways for energy-efficient trajectory designs.",
"title": "Extraction and Visualization of Poincare Map Topology for Spacecraft Trajectory Design",
"normalizedTitle": "Extraction and Visualization of Poincare Map Topology for Spacecraft Trajectory Design",
"fno": "09222254",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Aircraft Control",
"Celestial Mechanics",
"Data Visualisation",
"Gravitation",
"N Body Problems",
"Poincare Mapping",
"Space Vehicles",
"Topology",
"Trajectory Control",
"CR 3 BP",
"Interactive Transfer Selection",
"Representative Design Problems",
"Spacecraft Path Planners",
"Topology Visualization",
"Natural Dynamics Pathways",
"Energy Efficient Trajectory Designs",
"Poincare Map Topology",
"Spacecraft Trajectory Design",
"Mission Designers",
"Dynamical Models",
"Low Cost Spacecraft Trajectory",
"Mission Constraints",
"Multibody Gravitational Systems",
"Interactive Visual Exploration",
"Structural Landscape",
"Spacecraft Trajectory Planning",
"Algorithmic Solutions",
"Astrodynamics Problems",
"Visual Analysis",
"Visualization Framework",
"Circular Restricted Three Body Problem",
"Interconnected Web Of Periodic Orbits",
"Space Vehicles",
"Trajectory",
"Visualization",
"Topology",
"Orbits",
"Propulsion",
"Earth",
"Trajectory Planning And Design",
"Poincare Map",
"Dynamical Systems",
"Topology Extraction",
"Invariant Manifolds",
"Chaos",
"Visual Analysis"
],
"authors": [
{
"givenName": "Xavier",
"surname": "Tricoche",
"fullName": "Xavier Tricoche",
"affiliation": "Computer Science at Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wayne",
"surname": "Schlei",
"fullName": "Wayne Schlei",
"affiliation": "Mission Design EngineerJHU Applied Physics Lab",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kathleen C.",
"surname": "Howell",
"fullName": "Kathleen C. Howell",
"affiliation": "Astronautics at Purdue University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "765-774",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/imccc/2016/1195/0/07774765",
"title": "Time-Fuel Optimal Trajectory Based Attitude Maneuver Control for Flexible Spacecraft",
"doi": null,
"abstractUrl": "/proceedings-article/imccc/2016/07774765/12OmNxwENNu",
"parentPublication": {
"id": "proceedings/imccc/2016/1195/0",
"title": "2016 Sixth International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2016/4840/0/4840a208",
"title": "Perturbation Correction Calculation Method for Remote Rendezvous between Non-Coplanar Elliptic Orbits",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2016/4840a208/12OmNy314jm",
"parentPublication": {
"id": "proceedings/cis/2016/4840/0",
"title": "2016 12th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smc-it/2017/3462/0/3462a082",
"title": "Machine Learning for Spacecraft Operations Support - The Mars Express Power Challenge",
"doi": null,
"abstractUrl": "/proceedings-article/smc-it/2017/3462a082/12OmNyQph1A",
"parentPublication": {
"id": "proceedings/smc-it/2017/3462/0",
"title": "2017 6th International Conference on Space Mission Challenges for Information Technology (SMC-IT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwcfta/2010/4247/0/4247a316",
"title": "Libration Point Orbits and Its Invariant Manifolds Structure",
"doi": null,
"abstractUrl": "/proceedings-article/iwcfta/2010/4247a316/12OmNzVoBIE",
"parentPublication": {
"id": "proceedings/iwcfta/2010/4247/0",
"title": "Chaos-Fractals Theories and Applications, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2017/04/mcs2017040018",
"title": "Trajectory Optimization for Missions to Small Bodies with a Focus on Scientific Merit",
"doi": null,
"abstractUrl": "/magazine/cs/2017/04/mcs2017040018/13rRUxEhFwm",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cycon-u-s/2017/2379/0/08167508",
"title": "Considerations for secure and resilient satellite architectures",
"doi": null,
"abstractUrl": "/proceedings-article/cycon-u-s/2017/08167508/17D45Wda7hd",
"parentPublication": {
"id": "proceedings/cycon-u-s/2017/2379/0",
"title": "2017 International Conference on Cyber Conflict (CyCon U.S.)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icceic/2021/0212/0/021200a172",
"title": "Research on Architecture of Spacecraft Intelligent Control System",
"doi": null,
"abstractUrl": "/proceedings-article/icceic/2021/021200a172/1AFszg74JGg",
"parentPublication": {
"id": "proceedings/icceic/2021/0212/0",
"title": "2021 2nd International Conference on Computer Engineering and Intelligent Control (ICCEIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scset/2022/7876/0/787600a168",
"title": "Dynamic multi-target trajectory planning of aircraft based on Gaussian pseudo-spectral method",
"doi": null,
"abstractUrl": "/proceedings-article/scset/2022/787600a168/1ANLSJPiA5W",
"parentPublication": {
"id": "proceedings/scset/2022/7876/0",
"title": "2022 International Seminar on Computer Science and Engineering Technology (SCSET)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2020/5904/0/09103685",
"title": "Overview of Fractionated Spacecraft Technology",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2020/09103685/1kesAXrdETC",
"parentPublication": {
"id": "proceedings/iccea/2020/5904/0",
"title": "2020 International Conference on Computer Engineering and Application (ICCEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiea/2020/8288/0/828800a465",
"title": "Research on Automatic Installing Technology of Deployable Thermal Radiator in Spacecraft Field",
"doi": null,
"abstractUrl": "/proceedings-article/aiea/2020/828800a465/1nTunkF9BVm",
"parentPublication": {
"id": "proceedings/aiea/2020/8288/0",
"title": "2020 International Conference on Artificial Intelligence and Electromechanical Automation (AIEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09234473",
"articleId": "1o6HDND936U",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09233392",
"articleId": "1o53j4CHkoo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLavmlrXDG",
"name": "ttg202102-09222254s1-supp1-3030402.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222254s1-supp1-3030402.pdf",
"extension": "pdf",
"size": "6.58 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvA1hs3",
"title": "July",
"year": "2018",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7fi",
"doi": "10.1109/TVCG.2017.2711614",
"abstract": "Retrieving salient structure from textured images is an important but difficult problem in computer vision because texture, which can be irregular, anisotropic, non-uniform and complex, shares many of the same properties as structure. Observing that salient structure in a textured image should be piece-wise smooth, we present a method to retrieve such structures using an L<sub>0</sub> minimization of a modified form of the relative total variation metric. Thanks to the characteristics shared by texture and small structures, our method is effective at retrieving structure based on scale as well. Our method outperforms state-of-art methods in texture removal as well as scale-space filtering. We also demonstrate our method's ability in other applications such as edge detection, clip art compression artifact removal, and inverse half-toning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Retrieving salient structure from textured images is an important but difficult problem in computer vision because texture, which can be irregular, anisotropic, non-uniform and complex, shares many of the same properties as structure. Observing that salient structure in a textured image should be piece-wise smooth, we present a method to retrieve such structures using an L<sub>0</sub> minimization of a modified form of the relative total variation metric. Thanks to the characteristics shared by texture and small structures, our method is effective at retrieving structure based on scale as well. Our method outperforms state-of-art methods in texture removal as well as scale-space filtering. We also demonstrate our method's ability in other applications such as edge detection, clip art compression artifact removal, and inverse half-toning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Retrieving salient structure from textured images is an important but difficult problem in computer vision because texture, which can be irregular, anisotropic, non-uniform and complex, shares many of the same properties as structure. Observing that salient structure in a textured image should be piece-wise smooth, we present a method to retrieve such structures using an L0 minimization of a modified form of the relative total variation metric. Thanks to the characteristics shared by texture and small structures, our method is effective at retrieving structure based on scale as well. Our method outperforms state-of-art methods in texture removal as well as scale-space filtering. We also demonstrate our method's ability in other applications such as edge detection, clip art compression artifact removal, and inverse half-toning.",
"title": "Image Structure Retrieval via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_0$_Z</tex-math></inline-formula> Minimization",
"normalizedTitle": "Image Structure Retrieval via - Minimization",
"fno": "07938357",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Vision",
"Data Compression",
"Edge Detection",
"Feature Extraction",
"Image Denoising",
"Image Filtering",
"Image Resolution",
"Image Texture",
"Textured Image",
"Relative Total Variation",
"Texture Removal",
"Image Structure Retrieval",
"Salient Structure",
"Computer Vision",
"Minimization",
"Scale Space Filtering",
"Image Edge Detection",
"Minimization",
"Smoothing Methods",
"Feature Extraction",
"Optimization",
"Image Texture",
"Texture Removal",
"Scale Space Filtering",
"Image Smoothing",
"<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_$L_0$_Z</tex-math> </inline-formula> </named-content> sparsity"
],
"authors": [
{
"givenName": "Yujing",
"surname": "Sun",
"fullName": "Yujing Sun",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Scott",
"surname": "Schaefer",
"fullName": "Scott Schaefer",
"affiliation": "Department of Computer Science, Texas A&M University, College Station, TX",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenping",
"surname": "Wang",
"fullName": "Wenping Wang",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2018-07-01 00:00:00",
"pubType": "trans",
"pages": "2129-2139",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2019/02/08214273",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _0$_Z</tex-math></inline-formula>TV: A Sparse Optimization Method for Impulse Noise Image Restoration",
"doi": null,
"abstractUrl": "/journal/tp/2019/02/08214273/17D45WIXbPe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08540419",
"title": "Spectral Mesh Segmentation via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _0$_Z</tex-math></inline-formula> Gradient Minimization",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08540419/17D45XoXP4p",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09756312",
"title": "Continuous <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Regret Minimization Queries: A Dynamic Coreset Approach",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09756312/1CvQcl7WKu4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/03/09786656",
"title": "Logarithmic Schatten-<inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula> Norm Minimization for Tensorial Multi-View Subspace Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09786656/1DQPxlTv7lS",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09860045",
"title": "Searching Personalized <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-wing in Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09860045/1FUYx502pJC",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09889176",
"title": "Finding the Maximum <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Balanced Biclique on Weighted Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09889176/1GDrnzNt5Re",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09944955",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$kt$_Z</tex-math></inline-formula>-Safety: Graph Release via <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Anonymity and <inline-formula><tex-math notation=\"LaTeX\">Z_$t$_Z</tex-math></inline-formula>-Closeness",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09944955/1IbM9dSufYI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09025071",
"title": "Matrix Completion via Schatten Capped <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula> Norm",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09025071/1hYGvjFpuXm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/05/09444882",
"title": "Coordinate Descent Method for <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-means",
"doi": null,
"abstractUrl": "/journal/tp/2022/05/09444882/1u51seEJDiM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/09/09563231",
"title": "MM-FSM<inline-formula><tex-math notation=\"LaTeX\">Z_$:$_Z</tex-math></inline-formula> A High-Efficiency General Nonlinear Function Generator for Stochastic Computation",
"doi": null,
"abstractUrl": "/journal/tc/2022/09/09563231/1xvtoWeQvFm",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07935524",
"articleId": "13rRUwIF6lc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07931582",
"articleId": "13rRUygT7fh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRYM",
"name": "ttg201807-07938357s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201807-07938357s1.zip",
"extension": "zip",
"size": "25.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAolH1h",
"title": "July",
"year": "2020",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XeKgwj",
"doi": "10.1109/TVCG.2018.2889055",
"abstract": "Texture smoothing aims to smooth out textures in images, while retaining the prominent structures. This paper presents a saliency-aware approach to the problem with two key contributions. First, we design a deep saliency network with guided non-local blocks (GNLBs) for learning long-range pixel dependencies by taking the predicted saliency map at former layer as the guidance image to help suppress the non-saliency regions in the shallow layer. The GNLB computes the saliency response at a position by a weighted sum of features at all positions, and enables us to produce results that outperform existing deep saliency models. Second, we formulate a joint optimization framework to take saliency information when iteratively separating textures from structures: on the texture layer, we smooth out structures with the help of the saliency information and migrate structures from the texture to structure layer, while on the structure layer, we adopt another deep model to detect edges and simultaneous sparse coding to push textures back to the texture layer. We tested our method on a rich variety of images and compared it with several state-of-the-art methods. Both visual and quantitative comparison results show that our method better preserves structures while removing the texture components.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Texture smoothing aims to smooth out textures in images, while retaining the prominent structures. This paper presents a saliency-aware approach to the problem with two key contributions. First, we design a deep saliency network with guided non-local blocks (GNLBs) for learning long-range pixel dependencies by taking the predicted saliency map at former layer as the guidance image to help suppress the non-saliency regions in the shallow layer. The GNLB computes the saliency response at a position by a weighted sum of features at all positions, and enables us to produce results that outperform existing deep saliency models. Second, we formulate a joint optimization framework to take saliency information when iteratively separating textures from structures: on the texture layer, we smooth out structures with the help of the saliency information and migrate structures from the texture to structure layer, while on the structure layer, we adopt another deep model to detect edges and simultaneous sparse coding to push textures back to the texture layer. We tested our method on a rich variety of images and compared it with several state-of-the-art methods. Both visual and quantitative comparison results show that our method better preserves structures while removing the texture components.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Texture smoothing aims to smooth out textures in images, while retaining the prominent structures. This paper presents a saliency-aware approach to the problem with two key contributions. First, we design a deep saliency network with guided non-local blocks (GNLBs) for learning long-range pixel dependencies by taking the predicted saliency map at former layer as the guidance image to help suppress the non-saliency regions in the shallow layer. The GNLB computes the saliency response at a position by a weighted sum of features at all positions, and enables us to produce results that outperform existing deep saliency models. Second, we formulate a joint optimization framework to take saliency information when iteratively separating textures from structures: on the texture layer, we smooth out structures with the help of the saliency information and migrate structures from the texture to structure layer, while on the structure layer, we adopt another deep model to detect edges and simultaneous sparse coding to push textures back to the texture layer. We tested our method on a rich variety of images and compared it with several state-of-the-art methods. Both visual and quantitative comparison results show that our method better preserves structures while removing the texture components.",
"title": "Saliency-Aware Texture Smoothing",
"normalizedTitle": "Saliency-Aware Texture Smoothing",
"fno": "08585158",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Edge Detection",
"Feature Extraction",
"Image Coding",
"Image Texture",
"Learning Artificial Intelligence",
"Object Detection",
"Optimisation",
"Predicted Saliency Map",
"Long Range Pixel Dependencies",
"Guided Nonlocal Blocks",
"Deep Saliency Network",
"Key Contributions",
"Saliency Aware Approach",
"Saliency Aware Texture Smoothing",
"Texture Components",
"Deep Model",
"Structure Layer",
"Migrate Structures",
"Texture Layer",
"Saliency Information",
"Deep Saliency Models",
"Saliency Response",
"Shallow Layer",
"Nonsaliency Regions",
"Guidance Image",
"Smoothing Methods",
"Image Edge Detection",
"Saliency Detection",
"Optimization",
"Data Models",
"Visualization",
"Semantics",
"Texture Smoothing",
"Saliency Detection",
"Guided Non Local Block",
"Deep Learning"
],
"authors": [
{
"givenName": "Lei",
"surname": "Zhu",
"fullName": "Lei Zhu",
"affiliation": "Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaowei",
"surname": "Hu",
"fullName": "Xiaowei Hu",
"affiliation": "Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Wing",
"surname": "Fu",
"fullName": "Chi-Wing Fu",
"affiliation": "Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Qin",
"fullName": "Jing Qin",
"affiliation": "Centre for Smart Health, School of Nursing, The Hong Kong Polytechnic University, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pheng-Ann",
"surname": "Heng",
"fullName": "Pheng-Ann Heng",
"affiliation": "Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2020-07-01 00:00:00",
"pubType": "trans",
"pages": "2471-2484",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/crv/2016/2491/0/2491a296",
"title": "TIGGER: A Texture-Illumination Guided Global Energy Response Model for Illumination Robust Object Saliency",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2016/2491a296/12OmNBBzolF",
"parentPublication": {
"id": "proceedings/crv/2016/2491/0",
"title": "2016 13th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2011/4541/0/4541a309",
"title": "Edge Saliency Map Detection with Texture Suppression",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2011/4541a309/12OmNqJZgCI",
"parentPublication": {
"id": "proceedings/icig/2011/4541/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/01/ttp2010010171",
"title": "Spatiotemporal Saliency in Dynamic Scenes",
"doi": null,
"abstractUrl": "/journal/tp/2010/01/ttp2010010171/13rRUB6Sq1w",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2012/10/ttp2012101915",
"title": "Context-Aware Saliency Detection",
"doi": null,
"abstractUrl": "/journal/tp/2012/10/ttp2012101915/13rRUx0ger3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/12/08444709",
"title": "Personalized Saliency and Its Prediction",
"doi": null,
"abstractUrl": "/journal/tp/2019/12/08444709/13rRUy3gn8N",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2018/1737/0/08486572",
"title": "Saliency Detection by Deep Network with Boundary Refinement and Global Context",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486572/14jQfNVqQfL",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2018/1737/0/08486465",
"title": "Structure-Texture Decomposition via Joint Structure Discovery and Texture Smoothing",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486465/14jQfP4XL27",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2018/1737/0/08486543",
"title": "Pointwise Shape-Adaptive Texture Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486543/14jQfP4XL28",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2018/1737/0/08486603",
"title": "Co-Saliency Detection via Hierarchical Consistency Measure",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486603/14jQfRlKNy6",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a191",
"title": "Structure-Preserving Bilateral Texture Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a191/1ap5z7EILYY",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08600345",
"articleId": "17D45Xh13tH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08590720",
"articleId": "17D45WrVgaC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1kcw1PnoZTG",
"name": "ttg202007-08585158s1-supp.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202007-08585158s1-supp.pdf",
"extension": "pdf",
"size": "31.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx1qV7B",
"title": "Nov.-Dec.",
"year": "2013",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "33",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzp02qx",
"doi": "10.1109/MCG.2013.83",
"abstract": "We present a semi-automated system for fabricating figurines with faces that are personalised to the individual likeness of the customer. The efficacy of the system has been demonstrated by commercial deployments at Walt Disney World Resort and Star Wars Celebration VI in Orlando Florida. Although the system is semi automated, human intervention is limited to a few simple tasks to maintain the high throughput and consistent quality required for commercial application. In contrast to existing systems that fabricate custom heads that are assembled to pre-fabricated plastic bodies, our system seamlessly integrates 3D facial data with a predefined figurine body into a unique and continuous object that is fabricated as a single piece. The combination of state-of-the-art 3D capture, modelling, and printing that are the core of our system provide the flexibility to fabricate figurines whose complexity is only limited by the creativity of the designer.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a semi-automated system for fabricating figurines with faces that are personalised to the individual likeness of the customer. The efficacy of the system has been demonstrated by commercial deployments at Walt Disney World Resort and Star Wars Celebration VI in Orlando Florida. Although the system is semi automated, human intervention is limited to a few simple tasks to maintain the high throughput and consistent quality required for commercial application. In contrast to existing systems that fabricate custom heads that are assembled to pre-fabricated plastic bodies, our system seamlessly integrates 3D facial data with a predefined figurine body into a unique and continuous object that is fabricated as a single piece. The combination of state-of-the-art 3D capture, modelling, and printing that are the core of our system provide the flexibility to fabricate figurines whose complexity is only limited by the creativity of the designer.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a semi-automated system for fabricating figurines with faces that are personalised to the individual likeness of the customer. The efficacy of the system has been demonstrated by commercial deployments at Walt Disney World Resort and Star Wars Celebration VI in Orlando Florida. Although the system is semi automated, human intervention is limited to a few simple tasks to maintain the high throughput and consistent quality required for commercial application. In contrast to existing systems that fabricate custom heads that are assembled to pre-fabricated plastic bodies, our system seamlessly integrates 3D facial data with a predefined figurine body into a unique and continuous object that is fabricated as a single piece. The combination of state-of-the-art 3D capture, modelling, and printing that are the core of our system provide the flexibility to fabricate figurines whose complexity is only limited by the creativity of the designer.",
"title": "Fabricating 3D Figurines with Personalized Faces",
"normalizedTitle": "Fabricating 3D Figurines with Personalized Faces",
"fno": "mcg2013060036",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Three Dimensional Displays",
"Image Color Analysis",
"Solid Modeling",
"Computational Modeling",
"Fabrication",
"Printing",
"Computer Graphics",
"Face Capture",
"3 D Printing",
"Face Modeling",
"Face Registration"
],
"authors": [
{
"givenName": "J. Rafael",
"surname": "Tena",
"fullName": "J. Rafael Tena",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Moshe",
"surname": "Mahler",
"fullName": "Moshe Mahler",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thabo",
"surname": "Beeler",
"fullName": "Thabo Beeler",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Max",
"surname": "Grosse",
"fullName": "Max Grosse",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Hengchin Yeh",
"fullName": "Hengchin Yeh",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Iain",
"surname": "Matthews",
"fullName": "Iain Matthews",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2013-11-01 00:00:00",
"pubType": "mags",
"pages": "36-46",
"year": "2013",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bwcca/2014/4173/0/4173a395",
"title": "A Digital Fabrication Assistant for 3D Arts and Crafts",
"doi": null,
"abstractUrl": "/proceedings-article/bwcca/2014/4173a395/12OmNvT2p0p",
"parentPublication": {
"id": "proceedings/bwcca/2014/4173/0",
"title": "2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ectc/2017/6315/0/07999700",
"title": "Aerosol-Jet Printed Quasi-Optical Terahertz Filters",
"doi": null,
"abstractUrl": "/proceedings-article/ectc/2017/07999700/12OmNx57HG6",
"parentPublication": {
"id": "proceedings/ectc/2017/6315/0",
"title": "2017 IEEE 67th Electronic Components and Technology Conference (ECTC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/06/mcg2013060048",
"title": "3D-Printing Spatially Varying BRDFs",
"doi": null,
"abstractUrl": "/magazine/cg/2013/06/mcg2013060048/13rRUxly97Z",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/10/08086214",
"title": "Toward Support-Free 3D Printing: A Skeletal Approach for Partitioning Models",
"doi": null,
"abstractUrl": "/journal/tg/2018/10/08086214/13rRUy0HYRy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/03/mcg2017030034",
"title": "FabSquare: Fabricating Photopolymer Objects by Mold 3D Printing and UV Curing",
"doi": null,
"abstractUrl": "/magazine/cg/2017/03/mcg2017030034/13rRUyYBlji",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/03/mcg2017030043",
"title": "Differential 3D Scanning",
"doi": null,
"abstractUrl": "/magazine/cg/2017/03/mcg2017030043/13rRUyeTVku",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/04/08327516",
"title": "PaperCraft3D: Paper-Based 3D Modeling and Scene Fabrication",
"doi": null,
"abstractUrl": "/journal/tg/2019/04/08327516/181W9moJfxQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2019/0409/0/040900a185",
"title": "Modeling, Fabrication and Investigation of Mixing in Low-Cost Passive PDMS Micromixers",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2019/040900a185/1a3wYsk0qEE",
"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"
},
{
"id": "mags/pc/2019/04/08928977",
"title": "Design Different: Pen and Paper for Laser Cutting",
"doi": null,
"abstractUrl": "/magazine/pc/2019/04/08928977/1gKuhzSk9Ko",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/09/09347725",
"title": "Wearable 3D Machine Knitting: Automatic Generation of Shaped Knit Sheets to Cover Real-World Objects",
"doi": null,
"abstractUrl": "/journal/tg/2022/09/09347725/1qWIIciXw76",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2013060026",
"articleId": "13rRUwbs234",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2013060048",
"articleId": "13rRUxly97Z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1txPs9C3tok",
"title": "June",
"year": "2021",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1rlAQHG5pao",
"doi": "10.1109/TVCG.2021.3060500",
"abstract": "This article introduces progressive algorithms for the topological analysis of scalar data. Our approach is based on a hierarchical representation of the input data and the fast identification of topologically invariant vertices, which are vertices that have no impact on the topological description of the data and for which we show that no computation is required as they are introduced in the hierarchy. This enables the definition of efficient coarse-to-fine topological algorithms, which leverage fast update mechanisms for ordinary vertices and avoid computation for the topologically invariant ones. We demonstrate our approach with two examples of topological algorithms (critical point extraction and persistence diagram computation), which generate interpretable outputs upon interruption requests and which progressively refine them otherwise. Experiments on real-life datasets illustrate that our progressive strategy, in addition to the continuous visual feedback it provides, even improves run time performance with regard to non-progressive algorithms and we describe further accelerations with shared-memory parallelism. We illustrate the utility of our approach in batch-mode and interactive setups, where it respectively enables the control of the execution time of complete topological pipelines as well as previews of the topological features found in a dataset, with progressive updates delivered within interactive times.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article introduces progressive algorithms for the topological analysis of scalar data. Our approach is based on a hierarchical representation of the input data and the fast identification of topologically invariant vertices, which are vertices that have no impact on the topological description of the data and for which we show that no computation is required as they are introduced in the hierarchy. This enables the definition of efficient coarse-to-fine topological algorithms, which leverage fast update mechanisms for ordinary vertices and avoid computation for the topologically invariant ones. We demonstrate our approach with two examples of topological algorithms (critical point extraction and persistence diagram computation), which generate interpretable outputs upon interruption requests and which progressively refine them otherwise. Experiments on real-life datasets illustrate that our progressive strategy, in addition to the continuous visual feedback it provides, even improves run time performance with regard to non-progressive algorithms and we describe further accelerations with shared-memory parallelism. We illustrate the utility of our approach in batch-mode and interactive setups, where it respectively enables the control of the execution time of complete topological pipelines as well as previews of the topological features found in a dataset, with progressive updates delivered within interactive times.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article introduces progressive algorithms for the topological analysis of scalar data. Our approach is based on a hierarchical representation of the input data and the fast identification of topologically invariant vertices, which are vertices that have no impact on the topological description of the data and for which we show that no computation is required as they are introduced in the hierarchy. This enables the definition of efficient coarse-to-fine topological algorithms, which leverage fast update mechanisms for ordinary vertices and avoid computation for the topologically invariant ones. We demonstrate our approach with two examples of topological algorithms (critical point extraction and persistence diagram computation), which generate interpretable outputs upon interruption requests and which progressively refine them otherwise. Experiments on real-life datasets illustrate that our progressive strategy, in addition to the continuous visual feedback it provides, even improves run time performance with regard to non-progressive algorithms and we describe further accelerations with shared-memory parallelism. We illustrate the utility of our approach in batch-mode and interactive setups, where it respectively enables the control of the execution time of complete topological pipelines as well as previews of the topological features found in a dataset, with progressive updates delivered within interactive times.",
"title": "A Progressive Approach to Scalar Field Topology",
"normalizedTitle": "A Progressive Approach to Scalar Field Topology",
"fno": "09359504",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Feature Extraction",
"Topology",
"Progressive Updates",
"Topological Features",
"Complete Topological Pipelines",
"Nonprogressive Algorithms",
"Continuous Visual Feedback",
"Progressive Strategy",
"Persistence Diagram Computation",
"Critical Point Extraction",
"Topologically Invariant Ones",
"Ordinary Vertices",
"Coarse To Fine Topological Algorithms",
"Topological Description",
"Topologically Invariant Vertices",
"Fast Identification",
"Hierarchical Representation",
"Scalar Data",
"Topological Analysis",
"Progressive Algorithms",
"Scalar Field Topology",
"Progressive Approach",
"Time Factors",
"Visualization",
"Feature Extraction",
"Data Analysis",
"Data Mining",
"Topology",
"Three Dimensional Displays",
"Topological Data Analysis",
"Scalar Data",
"Progressive Visualization"
],
"authors": [
{
"givenName": "Jules",
"surname": "Vidal",
"fullName": "Jules Vidal",
"affiliation": "CNRS, Sorbonne Université, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pierre",
"surname": "Guillou",
"fullName": "Pierre Guillou",
"affiliation": "CNRS, Sorbonne Université, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Tierny",
"fullName": "Julien Tierny",
"affiliation": "CNRS, Sorbonne Université, Paris, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": true,
"codeDownloadUrl": "https://github.com/julesvidal/progressive-scalar-topology.git",
"codeRepositoryUrl": "https://github.com/julesvidal/progressive-scalar-topology",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "2833-2850",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgames/2013/0820/0/06632622",
"title": "Transfer facial expressions with identical topology",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2013/06632622/12OmNCwUmzy",
"parentPublication": {
"id": "proceedings/cgames/2013/0820/0",
"title": "2013 18th International Conference on Computer Games: AI, Animation, Mobile, Interactive Multimedia, Educational & Serious Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2002/1784/0/17840246",
"title": "Isosurface Reconstruction with Topology Control",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840246/12OmNqAU6sh",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620205",
"title": "A topology modifying progressive decimation algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620205/12OmNzQhP7p",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2014/5618/0/5618a360",
"title": "Data Clustering Using Topological Features",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2014/5618a360/12OmNzV70A5",
"parentPublication": {
"id": "proceedings/bracis/2014/5618/0",
"title": "2014 Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532839",
"title": "Topology-based simplification for feature extraction from 3D scalar fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532839/12OmNzkMlOD",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/01/v0079",
"title": "Compressed Progressive Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2000/01/v0079/13rRUwhpBNZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2022/5670/0/567000a231",
"title": "Progressive Multi-Scale Light Field Networks",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2022/567000a231/1KYswQA4BZ6",
"parentPublication": {
"id": "proceedings/3dv/2022/5670/0",
"title": "2022 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805446",
"title": "Vector Field Topology of Time-Dependent Flows in a Steady Reference Frame",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805446/1cG4GkzNRPG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/03/08827963",
"title": "Topology-Aware Non-Rigid Point Cloud Registration",
"doi": null,
"abstractUrl": "/journal/tp/2021/03/08827963/1ddbebZNTC8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378216",
"title": "Topology Preserving Data Reduction for Computing Persistent Homology",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378216/1s64J6qKBvW",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09418624",
"articleId": "1tcfGK6j0Nq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08933110",
"articleId": "1gKvciBzOfu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1txPu9zmW76",
"name": "ttg202106-09359504s1-tvcg-3060500-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202106-09359504s1-tvcg-3060500-mm.zip",
"extension": "zip",
"size": "7.35 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1D80ZaZz94I",
"title": "June",
"year": "2022",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1qkwANyEXq8",
"doi": "10.1109/TPAMI.2021.3051173",
"abstract": "Estimating 3D human pose from a single image is a challenging task. This work attempts to address the uncertainty of lifting the detected 2D joints to the 3D space by introducing an intermediate state - Part-Centric Heatmap Triplets (<italic>HEMlets</italic>), which shortens the gap between the 2D observation and the 3D interpretation. The HEMlets utilize three joint-heatmaps to represent the relative depth information of the end-joints for each skeletal body part. In our approach, a Convolutional Network (ConvNet) is first trained to predict HEMlets from the input image, followed by a volumetric joint-heatmap regression. We leverage on the integral operation to extract the joint locations from the volumetric heatmaps, guaranteeing end-to-end learning. Despite the simplicity of the network design, the quantitative comparisons show a significant performance improvement over the best-of-grade methods (e.g., 20 percent on Human3.6M). The proposed method naturally supports training with “in-the-wild” images, where only weakly-annotated relative depth information of skeletal joints is available. This further improves the generalization ability of our model, as validated by qualitative comparisons on outdoor images. Leveraging the strength of the HEMlets pose estimation, we further design and append a shallow yet effective network module to regress the SMPL parameters of the body pose and shape. We term the entire HEMlets-based human pose and shape recovery pipeline <italic>HEMlets PoSh</italic>. Extensive quantitative and qualitative experiments on the existing human body recovery benchmarks justify the state-of-the-art results obtained with our HEMlets PoSh approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Estimating 3D human pose from a single image is a challenging task. This work attempts to address the uncertainty of lifting the detected 2D joints to the 3D space by introducing an intermediate state - Part-Centric Heatmap Triplets (<italic>HEMlets</italic>), which shortens the gap between the 2D observation and the 3D interpretation. The HEMlets utilize three joint-heatmaps to represent the relative depth information of the end-joints for each skeletal body part. In our approach, a Convolutional Network (ConvNet) is first trained to predict HEMlets from the input image, followed by a volumetric joint-heatmap regression. We leverage on the integral operation to extract the joint locations from the volumetric heatmaps, guaranteeing end-to-end learning. Despite the simplicity of the network design, the quantitative comparisons show a significant performance improvement over the best-of-grade methods (e.g., 20 percent on Human3.6M). The proposed method naturally supports training with “in-the-wild” images, where only weakly-annotated relative depth information of skeletal joints is available. This further improves the generalization ability of our model, as validated by qualitative comparisons on outdoor images. Leveraging the strength of the HEMlets pose estimation, we further design and append a shallow yet effective network module to regress the SMPL parameters of the body pose and shape. We term the entire HEMlets-based human pose and shape recovery pipeline <italic>HEMlets PoSh</italic>. Extensive quantitative and qualitative experiments on the existing human body recovery benchmarks justify the state-of-the-art results obtained with our HEMlets PoSh approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Estimating 3D human pose from a single image is a challenging task. This work attempts to address the uncertainty of lifting the detected 2D joints to the 3D space by introducing an intermediate state - Part-Centric Heatmap Triplets (HEMlets), which shortens the gap between the 2D observation and the 3D interpretation. The HEMlets utilize three joint-heatmaps to represent the relative depth information of the end-joints for each skeletal body part. In our approach, a Convolutional Network (ConvNet) is first trained to predict HEMlets from the input image, followed by a volumetric joint-heatmap regression. We leverage on the integral operation to extract the joint locations from the volumetric heatmaps, guaranteeing end-to-end learning. Despite the simplicity of the network design, the quantitative comparisons show a significant performance improvement over the best-of-grade methods (e.g., 20 percent on Human3.6M). The proposed method naturally supports training with “in-the-wild” images, where only weakly-annotated relative depth information of skeletal joints is available. This further improves the generalization ability of our model, as validated by qualitative comparisons on outdoor images. Leveraging the strength of the HEMlets pose estimation, we further design and append a shallow yet effective network module to regress the SMPL parameters of the body pose and shape. We term the entire HEMlets-based human pose and shape recovery pipeline HEMlets PoSh. Extensive quantitative and qualitative experiments on the existing human body recovery benchmarks justify the state-of-the-art results obtained with our HEMlets PoSh approach.",
"title": "HEMlets PoSh: Learning Part-Centric Heatmap Triplets for 3D Human Pose and Shape Estimation",
"normalizedTitle": "HEMlets PoSh: Learning Part-Centric Heatmap Triplets for 3D Human Pose and Shape Estimation",
"fno": "09320561",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Bone",
"Convolutional Neural Nets",
"Feature Extraction",
"Learning Artificial Intelligence",
"Pose Estimation",
"Shape Recognition",
"Stereo Image Processing",
"Shape Estimation",
"Volumetric Heatmaps",
"Skeletal Joints",
"HE Mlets Po Sh",
"Human Body Recovery",
"Part Centric Heatmap Triplets Learning",
"3 D Human Pose Estimation",
"Convolutional Network",
"Conv Net",
"Joint Heatmap Regression",
"Joint Locations Extraction",
"Weakly Annotated Relative Depth Information",
"SMPL Parameters",
"Efficiency 20 0 Percent",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Heating Systems",
"Pose Estimation",
"Task Analysis",
"Training",
"Shape",
"3 D Human Pose Estimation",
"Deep Learning",
"Heatmaps",
"Human Body Mesh Recovery"
],
"authors": [
{
"givenName": "Kun",
"surname": "Zhou",
"fullName": "Kun Zhou",
"affiliation": "SmartMore Corporation, Ltd., Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoguang",
"surname": "Han",
"fullName": "Xiaoguang Han",
"affiliation": "Shenzhen Institute of Big Data, The Chinese University of Hong Kong, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nianjuan",
"surname": "Jiang",
"fullName": "Nianjuan Jiang",
"affiliation": "SmartMore Corporation, Ltd., Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kui",
"surname": "Jia",
"fullName": "Kui Jia",
"affiliation": "School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiangbo",
"surname": "Lu",
"fullName": "Jiangbo Lu",
"affiliation": "SmartMore Corporation, Ltd., Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2022-06-01 00:00:00",
"pubType": "trans",
"pages": "3000-3014",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2017/1032/0/1032c621",
"title": "Compositional Human Pose Regression",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032c621/12OmNqBtiU5",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000b159",
"title": "Recognizing Human Actions as the Evolution of Pose Estimation Maps",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000b159/17D45XERmmd",
"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/wacv/2019/1975/0/197500b477",
"title": "3D Human Pose Estimation With 2D Marginal Heatmaps",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500b477/18j8NpOOKn6",
"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/2019/4803/0/480300c344",
"title": "HEMlets Pose: Learning Part-Centric Heatmap Triplets for Accurate 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300c344/1hQqygVk4TK",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08998337",
"title": "Weakly Supervised Adversarial Learning for 3D Human Pose Estimation from Point Clouds",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08998337/1hrXgdu8Bkk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2020/3079/0/307900a677",
"title": "Metric-Scale Truncation-Robust Heatmaps for 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a677/1kecIQrqjdK",
"parentPublication": {
"id": "proceedings/fg/2020/3079/0/",
"title": "2020 15th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2020) (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800h202",
"title": "Compressed Volumetric Heatmaps for Multi-Person 3D Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800h202/1m3nw0MH0o8",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/03/09174911",
"title": "Locally Connected Network for Monocular 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2022/03/09174911/1myqF3drJ1S",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09511827",
"title": "Heatmap Regression via Randomized Rounding",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09511827/1vYRGdzUT5u",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mipr/2021/1865/0/186500a377",
"title": "Respective Volumetric Heatmap Autoencoder for Multi-Person 3D Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/mipr/2021/186500a377/1xPsokwn38Y",
"parentPublication": {
"id": "proceedings/mipr/2021/1865/0",
"title": "2021 IEEE 4th International Conference on Multimedia Information Processing and Retrieval (MIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09294112",
"articleId": "1pA8gc6H8dO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09306905",
"articleId": "1pOZliQwl7W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1sP18ke9Y64",
"title": "May",
"year": "2021",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1saZCxsOG9q",
"doi": "10.1109/TVCG.2021.3067756",
"abstract": "Group navigation can be an invaluable tool for performing guided tours in distributed virtual environments. Related work suggests that group navigation techniques should be comprehensible for both the guide and the attendees, assist the group in avoiding collisions with obstacles, and allow the creation of meaningful spatial arrangements with respect to objects of interest. To meet these requirements, we developed a group navigation technique based on short-distance teleportation (jumping) and evaluated its usability, comprehensibility, and scalability in an initial user study. After navigating with groups of up to 10 users through a virtual museum, participants indicated that our technique is easy to learn for guides, comprehensible also for attendees, non-nauseating for both roles, and therefore well-suited for performing guided tours.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Group navigation can be an invaluable tool for performing guided tours in distributed virtual environments. Related work suggests that group navigation techniques should be comprehensible for both the guide and the attendees, assist the group in avoiding collisions with obstacles, and allow the creation of meaningful spatial arrangements with respect to objects of interest. To meet these requirements, we developed a group navigation technique based on short-distance teleportation (jumping) and evaluated its usability, comprehensibility, and scalability in an initial user study. After navigating with groups of up to 10 users through a virtual museum, participants indicated that our technique is easy to learn for guides, comprehensible also for attendees, non-nauseating for both roles, and therefore well-suited for performing guided tours.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Group navigation can be an invaluable tool for performing guided tours in distributed virtual environments. Related work suggests that group navigation techniques should be comprehensible for both the guide and the attendees, assist the group in avoiding collisions with obstacles, and allow the creation of meaningful spatial arrangements with respect to objects of interest. To meet these requirements, we developed a group navigation technique based on short-distance teleportation (jumping) and evaluated its usability, comprehensibility, and scalability in an initial user study. After navigating with groups of up to 10 users through a virtual museum, participants indicated that our technique is easy to learn for guides, comprehensible also for attendees, non-nauseating for both roles, and therefore well-suited for performing guided tours.",
"title": "Group Navigation for Guided Tours in Distributed Virtual Environments",
"normalizedTitle": "Group Navigation for Guided Tours in Distributed Virtual Environments",
"fno": "09382870",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Museums",
"Teleportation",
"Virtual Reality",
"Virtual Museum",
"Guided Tours",
"Distributed Virtual Environments",
"Group Navigation Technique",
"Navigation",
"Virtual Environments",
"Visualization",
"Virtual Reality",
"Teleportation",
"Legged Locomotion",
"Head Mounted Displays",
"Virtual Reality",
"Collaborative Virtual Environments",
"Group Navigation",
"Guided Tour",
"Teleportation",
"Jumping"
],
"authors": [
{
"givenName": "Tim",
"surname": "Weissker",
"fullName": "Tim Weissker",
"affiliation": "Virtual Reality and Visualization Research Group, Bauhaus-Universität Weimar, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernd",
"surname": "Froehlich",
"fullName": "Bernd Froehlich",
"affiliation": "Virtual Reality and Visualization Research Group, Bauhaus-Universität Weimar, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2021-05-01 00:00:00",
"pubType": "trans",
"pages": "2524-2534",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cw/2003/1922/0/19220453",
"title": "Interactive Distributed Guided Tours of Historical Sites",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2003/19220453/12OmNqBbHFA",
"parentPublication": {
"id": "proceedings/cw/2003/1922/0",
"title": "Proceedings. 2003 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2014/3624/0/06798852",
"title": "Reorientation in virtual environments using interactive portals",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2014/06798852/12OmNqBbHVR",
"parentPublication": {
"id": "proceedings/3dui/2014/3624/0",
"title": "2014 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1999/0167/0/01670099",
"title": "Automatically Generating Virtual Guided Tours",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1999/01670099/12OmNwMFMjH",
"parentPublication": {
"id": "proceedings/ca/1999/0167/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a556",
"title": "Group WiM: A Group Navigation Technique for Collaborative Virtual Reality Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a556/1CJdXqzjctO",
"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/aivr/2022/5725/0/572500a082",
"title": "WiM-Based Group Navigation for Collaborative Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2022/572500a082/1KmFfzv6fWo",
"parentPublication": {
"id": "proceedings/aivr/2022/5725/0",
"title": "2022 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797807",
"title": "Multi-Ray Jumping: Comprehensible Group Navigation for Collocated Users in Immersive Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797807/1cJ0MXFzine",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08998307",
"title": "Getting There Together: Group Navigation in Distributed Virtual Environments",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08998307/1hpPBi8EjJe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a363",
"title": "An Overview of Group Navigation in Multi-User Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a363/1tnXytVyks8",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2021/1838/0/255600a345",
"title": "Spherical World in Miniature: Exploring the Tiny Planets Metaphor for Discrete Locomotion in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2021/255600a345/1tuAuPBgHTi",
"parentPublication": {
"id": "proceedings/vr/2021/1838/0",
"title": "2021 IEEE Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a224",
"title": "Interactive Embodied Agent for Navigation in Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a224/1yeQTsTPSgM",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09382884",
"articleId": "1saZwTHSQeI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09382909",
"articleId": "1saZt58Vwf6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwWoNU",
"title": "Jan.-Feb.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tq",
"pubType": "journal",
"volume": "15",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly96T",
"doi": "10.1109/TDSC.2015.2507133",
"abstract": "Elements of a person's biometrics are typically stable over the duration of a lifetime, and thus, it is highly important to protect biometric data while supporting recognition (it is also called secure biometric recognition). However, the biometric data that are derived from a person usually vary slightly due to a variety of reasons, such as distortion during picture capture, and it is difficult to use traditional techniques, such as classical encryption algorithms, in secure biometric recognition. The negative database (NDB) is a new technique for privacy preservation. Reversing the NDB has been demonstrated to be an NP-hard problem, and several algorithms for generating hard-to-reverse NDBs have been proposed. In this paper, first, we propose negative iris recognition, which is a novel secure iris recognition scheme that is based on the NDB. We show that negative iris recognition supports several important strategies in iris recognition, e.g., shifting and masking. Next, we analyze the security and efficiency of negative iris recognition. Experimental results show that negative iris recognition is an effective and secure iris recognition scheme. Specifically, negative iris recognition can achieve a highly promising recognition performance (i.e., GAR = 98.94% at FAR = 0.01%, EER = 0.60%) on the typical database CASIA-IrisV3-Interval.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Elements of a person's biometrics are typically stable over the duration of a lifetime, and thus, it is highly important to protect biometric data while supporting recognition (it is also called secure biometric recognition). However, the biometric data that are derived from a person usually vary slightly due to a variety of reasons, such as distortion during picture capture, and it is difficult to use traditional techniques, such as classical encryption algorithms, in secure biometric recognition. The negative database (NDB) is a new technique for privacy preservation. Reversing the NDB has been demonstrated to be an NP-hard problem, and several algorithms for generating hard-to-reverse NDBs have been proposed. In this paper, first, we propose negative iris recognition, which is a novel secure iris recognition scheme that is based on the NDB. We show that negative iris recognition supports several important strategies in iris recognition, e.g., shifting and masking. Next, we analyze the security and efficiency of negative iris recognition. Experimental results show that negative iris recognition is an effective and secure iris recognition scheme. Specifically, negative iris recognition can achieve a highly promising recognition performance (i.e., GAR = 98.94% at FAR = 0.01%, EER = 0.60%) on the typical database CASIA-IrisV3-Interval.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Elements of a person's biometrics are typically stable over the duration of a lifetime, and thus, it is highly important to protect biometric data while supporting recognition (it is also called secure biometric recognition). However, the biometric data that are derived from a person usually vary slightly due to a variety of reasons, such as distortion during picture capture, and it is difficult to use traditional techniques, such as classical encryption algorithms, in secure biometric recognition. The negative database (NDB) is a new technique for privacy preservation. Reversing the NDB has been demonstrated to be an NP-hard problem, and several algorithms for generating hard-to-reverse NDBs have been proposed. In this paper, first, we propose negative iris recognition, which is a novel secure iris recognition scheme that is based on the NDB. We show that negative iris recognition supports several important strategies in iris recognition, e.g., shifting and masking. Next, we analyze the security and efficiency of negative iris recognition. Experimental results show that negative iris recognition is an effective and secure iris recognition scheme. Specifically, negative iris recognition can achieve a highly promising recognition performance (i.e., GAR = 98.94% at FAR = 0.01%, EER = 0.60%) on the typical database CASIA-IrisV3-Interval.",
"title": "Negative Iris Recognition",
"normalizedTitle": "Negative Iris Recognition",
"fno": "07350227",
"hasPdf": true,
"idPrefix": "tq",
"keywords": [
"Data Privacy",
"Iris Recognition",
"Negative Iris Recognition",
"Biometric Data",
"Secure Biometric Recognition",
"Secure Iris Recognition Scheme",
"Negative Database",
"Privacy Preservation",
"Iris Recognition",
"Bioinformatics",
"Feature Extraction",
"Databases",
"Cryptography",
"Biometric Recognition",
"Privacy Preservation",
"Negative Database",
"Iris Recognition"
],
"authors": [
{
"givenName": "Dongdong",
"surname": "Zhao",
"fullName": "Dongdong Zhao",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenjian",
"surname": "Luo",
"fullName": "Wenjian Luo",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ran",
"surname": "Liu",
"fullName": "Ran Liu",
"affiliation": "School of Computer Science, China University of Geosciences, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lihua",
"surname": "Yue",
"fullName": "Lihua Yue",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "112-125",
"year": "2018",
"issn": "1545-5971",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ams/2010/4062/0/4062a209",
"title": "Error Correction on IRIS Biometric Template Using Reed Solomon Codes",
"doi": null,
"abstractUrl": "/proceedings-article/ams/2010/4062a209/12OmNAsBFLo",
"parentPublication": {
"id": "proceedings/ams/2010/4062/0",
"title": "Asia International Conference on Modelling & Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccc/2011/4689/0/06363408",
"title": "Zernike's Feature Descriptors for Iris Recognition with SVM",
"doi": null,
"abstractUrl": "/proceedings-article/sccc/2011/06363408/12OmNBNM8T2",
"parentPublication": {
"id": "proceedings/sccc/2011/4689/0",
"title": "2011 30th International Conference of the Chilean Computer Science Society",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761886",
"title": "Cancelable iris biometric",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761886/12OmNBNM90O",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2017/4283/0/4283a210",
"title": "Cancelable Iris Template Generation Using Modulo Operation",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2017/4283a210/12OmNBpVPWZ",
"parentPublication": {
"id": "proceedings/sitis/2017/4283/0",
"title": "2017 13th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2008/3278/0/3278b533",
"title": "An Iris Cryptosystem for Information Security",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278b533/12OmNCeaPTE",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a527",
"title": "A Ground Truth for Iris Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a527/12OmNvDI44g",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2012/9999/0/06396075",
"title": "A novel iris recognition algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2012/06396075/12OmNvwC5wg",
"parentPublication": {
"id": "proceedings/icccnt/2012/9999/0",
"title": "2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2008/3382/2/3382b340",
"title": "A Novel Template Protection Algorithm for Iris Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2008/3382b340/12OmNxETaok",
"parentPublication": {
"id": "proceedings/isda/2008/3382/2",
"title": "2008 Eighth International Conference on Intelligent Systems Design and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545840",
"title": "SegDenseNet: Iris Segmentation for Pre-and-Post Cataract Surgery",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545840/17D45VN31hS",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2018/8321/0/832100a248",
"title": "Iris Template Protection Based on Randomized Response Technique and Aggregated Block Information",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2018/832100a248/17D45WODaqr",
"parentPublication": {
"id": "proceedings/issre/2018/8321/0",
"title": "2018 IEEE 29th International Symposium on Software Reliability Engineering (ISSRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07360157",
"articleId": "13rRUwwslu3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07339436",
"articleId": "13rRUxNmPFm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1F1RbetB1wk",
"title": "April-June",
"year": "2022",
"issueNum": "02",
"idPrefix": "mu",
"pubType": "magazine",
"volume": "29",
"label": "April-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DwUBBXPkVG",
"doi": "10.1109/MMUL.2022.3176142",
"abstract": "Virtual reality (VR) technology is gaining popularity in a variety of fields, including education, games, movies, medicine, and engineering, to name a few. 360Z_$^\\circ$_Z∘ VR video could provide an immersive experience and attract more researchers’ and developers’ attention. Some literature focused on the head movement when users watched 360Z_$^\\circ$_Z∘ videos and released head tracking datasets. With the popularity of VR games, how the game contexts influence players’ head movement and the effect of head movement on VR sickness is a topic worth studying. In this article, we collected a head movement dataset of 30 participants while playing five different VR games (Aircar, Beat Saber, Moss, Arizona Sunshine, and SUPERHOT), and the participants filled the Simulator Sickness Questionnaire (SSQ) after playing VR games. Finally, we analyzed the SSQ scores and the impact of VR games on VR sickness. To the best of our knowledge, this is the first available head movement trajectory dataset based on playing several types of VR games.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Virtual reality (VR) technology is gaining popularity in a variety of fields, including education, games, movies, medicine, and engineering, to name a few. 360$^\\circ$∘ VR video could provide an immersive experience and attract more researchers’ and developers’ attention. Some literature focused on the head movement when users watched 360$^\\circ$∘ videos and released head tracking datasets. With the popularity of VR games, how the game contexts influence players’ head movement and the effect of head movement on VR sickness is a topic worth studying. In this article, we collected a head movement dataset of 30 participants while playing five different VR games (Aircar, Beat Saber, Moss, Arizona Sunshine, and SUPERHOT), and the participants filled the Simulator Sickness Questionnaire (SSQ) after playing VR games. Finally, we analyzed the SSQ scores and the impact of VR games on VR sickness. To the best of our knowledge, this is the first available head movement trajectory dataset based on playing several types of VR games.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Virtual reality (VR) technology is gaining popularity in a variety of fields, including education, games, movies, medicine, and engineering, to name a few. 360-∘ VR video could provide an immersive experience and attract more researchers’ and developers’ attention. Some literature focused on the head movement when users watched 360-∘ videos and released head tracking datasets. With the popularity of VR games, how the game contexts influence players’ head movement and the effect of head movement on VR sickness is a topic worth studying. In this article, we collected a head movement dataset of 30 participants while playing five different VR games (Aircar, Beat Saber, Moss, Arizona Sunshine, and SUPERHOT), and the participants filled the Simulator Sickness Questionnaire (SSQ) after playing VR games. Finally, we analyzed the SSQ scores and the impact of VR games on VR sickness. To the best of our knowledge, this is the first available head movement trajectory dataset based on playing several types of VR games.",
"title": "Why VR Games Sickness? An Empirical Study of Capturing and Analyzing VR Games Head Movement Dataset",
"normalizedTitle": "Why VR Games Sickness? An Empirical Study of Capturing and Analyzing VR Games Head Movement Dataset",
"fno": "09779506",
"hasPdf": true,
"idPrefix": "mu",
"keywords": [
"Computer Games",
"Human Computer Interaction",
"Human Factors",
"Virtual Reality",
"360 X 00 B 0 VR Video",
"Head Tracking Datasets",
"Simulator Sickness Questionnaire",
"VR Games Head Movement Dataset",
"VR Games Sickness",
"Head Movement Trajectory Dataset",
"Virtual Reality",
"Immersive Experience",
"Aircar",
"Beat Saber",
"Moss",
"Arizona Sunshine",
"SUPERHOT",
"SSQ Scores",
"Games",
"Magnetic Heads",
"Cybersickness",
"Virtual Reality",
"Trajectory",
"Videos"
],
"authors": [
{
"givenName": "Jiong",
"surname": "Dong",
"fullName": "Jiong Dong",
"affiliation": "Muroran Institute of Technology, Hokkaido, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kaoru",
"surname": "Ota",
"fullName": "Kaoru Ota",
"affiliation": "Muroran Institute of Technology, Hokkaido, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mianxiong",
"surname": "Dong",
"fullName": "Mianxiong Dong",
"affiliation": "Muroran Institute of Technology, Hokkaido, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2022-04-01 00:00:00",
"pubType": "mags",
"pages": "74-82",
"year": "2022",
"issn": "1070-986X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2016/0842/0/07460053",
"title": "Combating VR sickness through subtle dynamic field-of-view modification",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2016/07460053/12OmNBubORd",
"parentPublication": {
"id": "proceedings/3dui/2016/0842/0",
"title": "2016 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446346",
"title": "Reducing VR Sickness Through Peripheral Visual Effects",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446346/13bd1fHrlRY",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a542",
"title": "Resolution Tradeoff in Gameplay Experience, Performance, and Simulator Sickness in Virtual Reality Games",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a542/1CJcAVYrJew",
"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/5555/01/09793626",
"title": "Mitigation of VR Sickness during Locomotion with a Motion-Based Dynamic Vision Modulator",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09793626/1E5LEepCqTC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798136",
"title": "VR Sickness in Continuous Exposure to Live-action 180°Video",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798136/1cJ1gPJX2og",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090580",
"title": "A Study on the Effects of Head Mounted Displays Movement and Image Movement on Virtual Reality Sickness",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090580/1jIxns5TwxG",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2020/7675/0/767500a247",
"title": "Real-Time Detection of Simulator Sickness in Virtual Reality Games Based on Players' Psychophysiological Data during Gameplay",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2020/767500a247/1pBMj6Ryu9q",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2020/7675/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2020/7463/0/746300a123",
"title": "Exploring the feasibility of mitigating VR-HMD-induced cybersickness using cathodal transcranial direct current stimulation",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2020/746300a123/1qpzDMNZnKo",
"parentPublication": {
"id": "proceedings/aivr/2020/7463/0",
"title": "2020 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a735",
"title": "[DC] Towards Universal VR Sickness Mitigation Strategies",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a735/1tnXDI2lhHq",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a380",
"title": "Evaluating VR Sickness in VR Locomotion Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a380/1tnXc1raaxq",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09726926",
"articleId": "1BrwnabwlLq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09735424",
"articleId": "1BLn3hxpOQU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1GlbpNMaT7y",
"title": "July-Sept.",
"year": "2022",
"issueNum": "03",
"idPrefix": "ta",
"pubType": "journal",
"volume": "13",
"label": "July-Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1kVbwGkgqYg",
"doi": "10.1109/TAFFC.2020.3004617",
"abstract": "As the public use of virtual reality (VR) scales, understanding how users engage across various sources of VR content is critical. 360-video is popular due to its ease of both creation and access. There are, however, few studies of 360-videos, and they suffer from three limitations. First, most studies rely on small and homogeneous samples of participants. Second, they tend to examine only a single 360-video, or a handful of them in a few exceptional cases. Third, very few studies trace participants’ VR use over multiple experiences. The current study examined a large sample of participants (511) and a large set of 360-videos (80). Each participant experienced 5 of the videos, and we tracked head movement in addition to self-report data on presence, arousal, simulator sickness, and future use intention for each video. This design allowed us to answer novel questions relating to individual differences of participants and changes in experience over time, and in general to present results of VR use at a scale not seen before in the literature. Moreover, the results suggest that looking at patterns across stimuli provide unique insights which are missed when looking only within a single piece of content.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As the public use of virtual reality (VR) scales, understanding how users engage across various sources of VR content is critical. 360-video is popular due to its ease of both creation and access. There are, however, few studies of 360-videos, and they suffer from three limitations. First, most studies rely on small and homogeneous samples of participants. Second, they tend to examine only a single 360-video, or a handful of them in a few exceptional cases. Third, very few studies trace participants’ VR use over multiple experiences. The current study examined a large sample of participants (511) and a large set of 360-videos (80). Each participant experienced 5 of the videos, and we tracked head movement in addition to self-report data on presence, arousal, simulator sickness, and future use intention for each video. This design allowed us to answer novel questions relating to individual differences of participants and changes in experience over time, and in general to present results of VR use at a scale not seen before in the literature. Moreover, the results suggest that looking at patterns across stimuli provide unique insights which are missed when looking only within a single piece of content.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As the public use of virtual reality (VR) scales, understanding how users engage across various sources of VR content is critical. 360-video is popular due to its ease of both creation and access. There are, however, few studies of 360-videos, and they suffer from three limitations. First, most studies rely on small and homogeneous samples of participants. Second, they tend to examine only a single 360-video, or a handful of them in a few exceptional cases. Third, very few studies trace participants’ VR use over multiple experiences. The current study examined a large sample of participants (511) and a large set of 360-videos (80). Each participant experienced 5 of the videos, and we tracked head movement in addition to self-report data on presence, arousal, simulator sickness, and future use intention for each video. This design allowed us to answer novel questions relating to individual differences of participants and changes in experience over time, and in general to present results of VR use at a scale not seen before in the literature. Moreover, the results suggest that looking at patterns across stimuli provide unique insights which are missed when looking only within a single piece of content.",
"title": "Stimulus Sampling With 360-Videos: Examining Head Movements, Arousal, Presence, Simulator Sickness, and Preference on a Large Sample of Participants and Videos",
"normalizedTitle": "Stimulus Sampling With 360-Videos: Examining Head Movements, Arousal, Presence, Simulator Sickness, and Preference on a Large Sample of Participants and Videos",
"fno": "09124686",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Videos",
"Head",
"Headphones",
"Psychology",
"Media",
"Virtual Reality",
"Correlation",
"Stimulus Sampling",
"360 Videos",
"Virtual Reality"
],
"authors": [
{
"givenName": "Hanseul",
"surname": "Jun",
"fullName": "Hanseul Jun",
"affiliation": "Department of Communication, Stanford University, Stanford, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark Roman",
"surname": "Miller",
"fullName": "Mark Roman Miller",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fernanda",
"surname": "Herrera",
"fullName": "Fernanda Herrera",
"affiliation": "Department of Communication, Stanford University, Stanford, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Byron",
"surname": "Reeves",
"fullName": "Byron Reeves",
"affiliation": "Department of Communication, Stanford University, Stanford, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeremy N.",
"surname": "Bailenson",
"fullName": "Jeremy N. Bailenson",
"affiliation": "Department of Communication, Stanford University, Stanford, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2022-07-01 00:00:00",
"pubType": "trans",
"pages": "1416-1425",
"year": "2022",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wacv/2018/4886/0/488601b405",
"title": "Stabilizing First Person 360 Degree Videos",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2018/488601b405/12OmNAWpyow",
"parentPublication": {
"id": "proceedings/wacv/2018/4886/0",
"title": "2018 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892229",
"title": "6-DOF VR videos with a single 360-camera",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892229/12OmNAlvHtF",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446469",
"title": "Use of Virtual Reality to Teach Teamwork and Patient Safety in Surgical Education",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446469/13bd1eSlysL",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2022/02/09779506",
"title": "Why VR Games Sickness? An Empirical Study of Capturing and Analyzing VR Games Head Movement Dataset",
"doi": null,
"abstractUrl": "/magazine/mu/2022/02/09779506/1DwUBBXPkVG",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2022/5725/0/572500a176",
"title": "Towards Casually Captured 6DoF VR Videos",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2022/572500a176/1KmFek2AWeQ",
"parentPublication": {
"id": "proceedings/aivr/2022/5725/0",
"title": "2022 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798261",
"title": "Hybrid Projection For Encoding 360 VR Videos",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798261/1cJ0Wb1xK4E",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797805",
"title": "Encouraging Rehabilitation Trials: The Potential of 360° Immersive Instruction Videos",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797805/1cJ13iaKgve",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a081",
"title": "User Experience Study of 360° Music Videos on Computer Monitor and Virtual Reality Goggles",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a081/1cMFaY4kg6I",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090490",
"title": "Evaluation of Simulator Sickness for 360° Videos on an HMD Subject to Participants’ Experience with Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090490/1jIxwgIdgsw",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/04/09384236",
"title": "The Potential of 360° Virtual Reality Videos and Real VR for Education—A Literature Review",
"doi": null,
"abstractUrl": "/magazine/cg/2021/04/09384236/1scDA5NYISI",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09122566",
"articleId": "1kRRnxvEf84",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09128015",
"articleId": "1l3u10bRFgQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFj0",
"title": "March",
"year": "2018",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz9Y",
"doi": "10.1109/TVCG.2017.2666150",
"abstract": "We present a novel algorithm to generate virtual acoustic effects in captured 3D models of real-world scenes for multimodal augmented reality. We leverage recent advances in 3D scene reconstruction in order to automatically compute acoustic material properties. Our technique consists of a two-step procedure that first applies a convolutional neural network (CNN) to estimate the acoustic material properties, including frequency-dependent absorption coefficients, that are used for interactive sound propagation. In the second step, an iterative optimization algorithm is used to adjust the materials determined by the CNN until a virtual acoustic simulation converges to measured acoustic impulse responses. We have applied our algorithm to many reconstructed real-world indoor scenes and evaluated its fidelity for augmented reality applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel algorithm to generate virtual acoustic effects in captured 3D models of real-world scenes for multimodal augmented reality. We leverage recent advances in 3D scene reconstruction in order to automatically compute acoustic material properties. Our technique consists of a two-step procedure that first applies a convolutional neural network (CNN) to estimate the acoustic material properties, including frequency-dependent absorption coefficients, that are used for interactive sound propagation. In the second step, an iterative optimization algorithm is used to adjust the materials determined by the CNN until a virtual acoustic simulation converges to measured acoustic impulse responses. We have applied our algorithm to many reconstructed real-world indoor scenes and evaluated its fidelity for augmented reality applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel algorithm to generate virtual acoustic effects in captured 3D models of real-world scenes for multimodal augmented reality. We leverage recent advances in 3D scene reconstruction in order to automatically compute acoustic material properties. Our technique consists of a two-step procedure that first applies a convolutional neural network (CNN) to estimate the acoustic material properties, including frequency-dependent absorption coefficients, that are used for interactive sound propagation. In the second step, an iterative optimization algorithm is used to adjust the materials determined by the CNN until a virtual acoustic simulation converges to measured acoustic impulse responses. We have applied our algorithm to many reconstructed real-world indoor scenes and evaluated its fidelity for augmented reality applications.",
"title": "Acoustic Classification and Optimization for Multi-Modal Rendering of Real-World Scenes",
"normalizedTitle": "Acoustic Classification and Optimization for Multi-Modal Rendering of Real-World Scenes",
"fno": "07849179",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Acoustics",
"Computational Modeling",
"Acoustic Materials",
"Acoustic Measurements",
"Solid Modeling",
"Image Reconstruction",
"Sound Propagation",
"Material Optimization",
"Recognition"
],
"authors": [
{
"givenName": "Carl",
"surname": "Schissler",
"fullName": "Carl Schissler",
"affiliation": "University of North Carolina, Chapel Hill, NC",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Loftin",
"fullName": "Christian Loftin",
"affiliation": "University of North Carolina, Chapel Hill, NC",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dinesh",
"surname": "Manocha",
"fullName": "Dinesh Manocha",
"affiliation": "University of North Carolina, Chapel Hill, NC",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2018-03-01 00:00:00",
"pubType": "trans",
"pages": "1246-1259",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmcs/1999/0253/2/02531036",
"title": "Augmented Representation of Underwater Scenes by Segmentation and Reconstruction of 3D Acoustic Images",
"doi": null,
"abstractUrl": "/proceedings-article/icmcs/1999/02531036/12OmNrYCXVS",
"parentPublication": {
"id": "proceedings/icmcs/1999/0253/2",
"title": "Multimedia Computing and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2013/5159/0/06726378",
"title": "The Nondestructive Testing Approach of Acoustic Emission for Environmentally Hazardous Objects",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2013/06726378/12OmNvStcPW",
"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/visual/1991/2245/0/00175784",
"title": "Acoustic imaging: the reconstruction of underwater objects",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1991/00175784/12OmNyaGeL0",
"parentPublication": {
"id": "proceedings/visual/1991/2245/0",
"title": "1991 Proceeding Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1993/4120/0/00342489",
"title": "Underwater acoustic field extrapolation using vertical reference arrays",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1993/00342489/12OmNzsJ7q3",
"parentPublication": {
"id": "proceedings/acssc/1993/4120/0",
"title": "Proceedings of 27th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446230",
"title": "Mobile AR In and Out: Towards Delay-Based Modeling of Acoustic Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446230/13bd1sx4Zt9",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse-euc/2017/3220/2/08005991",
"title": "Design and Instrumentation of Portable Monitoring System for Acoustic Measurement Based on Aquatic Density",
"doi": null,
"abstractUrl": "/proceedings-article/cse-euc/2017/08005991/17D45XuDNEi",
"parentPublication": {
"id": "proceedings/cse-euc/2017/3220/2",
"title": "2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798247",
"title": "Immersive Spatial Audio Reproduction for VR/AR Using Room Acoustic Modelling from 360° Images",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798247/1cJ1gHhXwha",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08998301",
"title": "Scene-Aware Audio Rendering via Deep Acoustic Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08998301/1hpPBqG2djy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2022/05/09229520",
"title": "Push the Limit of Acoustic Gesture Recognition",
"doi": null,
"abstractUrl": "/journal/tm/2022/05/09229520/1o3njwLFEqI",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a487",
"title": "Vision-based Acoustic Information Retrieval for Interactive Sound Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a487/1yfxLit9Jw4",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07845707",
"articleId": "13rRUILLkDY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07845705",
"articleId": "13rRUxBJhvD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRF0",
"name": "ttg201803-07849179s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201803-07849179s1.zip",
"extension": "zip",
"size": "83 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqJZgIB",
"title": "April",
"year": "2020",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14H4WOKjoti",
"doi": "10.1109/TVCG.2018.2876541",
"abstract": "We propose an automatic framework to recover the illumination of indoor scenes based on a single RGB-D image. Unlike previous works, our method can recover spatially varying illumination without using any lighting capturing devices or HDR information. The recovered illumination can produce realistic rendering results. To model the geometry of the visible and invisible parts of scenes corresponding to the input RGB-D image, we assume that all objects shown in the image are located in a box with six faces and build a planar-based geometry model based on the input depth map. We then present a confidence-scoring based strategy to separate the light sources from the highlight areas. The positions of light sources both in and out of the camera's view are calculated based on the classification result and the recovered geometry model. Finally, an iterative procedure is proposed to calculate the colors of light sources and the materials in the scene. In addition, a data-driven method is used to set constraints on the light source intensities. Using the estimated light sources and geometry model, environment maps at different points in the scene are generated that can model the spatial variance of illumination. The experimental results demonstrate the validity and flexibility of our approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose an automatic framework to recover the illumination of indoor scenes based on a single RGB-D image. Unlike previous works, our method can recover spatially varying illumination without using any lighting capturing devices or HDR information. The recovered illumination can produce realistic rendering results. To model the geometry of the visible and invisible parts of scenes corresponding to the input RGB-D image, we assume that all objects shown in the image are located in a box with six faces and build a planar-based geometry model based on the input depth map. We then present a confidence-scoring based strategy to separate the light sources from the highlight areas. The positions of light sources both in and out of the camera's view are calculated based on the classification result and the recovered geometry model. Finally, an iterative procedure is proposed to calculate the colors of light sources and the materials in the scene. In addition, a data-driven method is used to set constraints on the light source intensities. Using the estimated light sources and geometry model, environment maps at different points in the scene are generated that can model the spatial variance of illumination. The experimental results demonstrate the validity and flexibility of our approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose an automatic framework to recover the illumination of indoor scenes based on a single RGB-D image. Unlike previous works, our method can recover spatially varying illumination without using any lighting capturing devices or HDR information. The recovered illumination can produce realistic rendering results. To model the geometry of the visible and invisible parts of scenes corresponding to the input RGB-D image, we assume that all objects shown in the image are located in a box with six faces and build a planar-based geometry model based on the input depth map. We then present a confidence-scoring based strategy to separate the light sources from the highlight areas. The positions of light sources both in and out of the camera's view are calculated based on the classification result and the recovered geometry model. Finally, an iterative procedure is proposed to calculate the colors of light sources and the materials in the scene. In addition, a data-driven method is used to set constraints on the light source intensities. Using the estimated light sources and geometry model, environment maps at different points in the scene are generated that can model the spatial variance of illumination. The experimental results demonstrate the validity and flexibility of our approach.",
"title": "Automatic Spatially Varying Illumination Recovery of Indoor Scenes Based on a Single RGB-D Image",
"normalizedTitle": "Automatic Spatially Varying Illumination Recovery of Indoor Scenes Based on a Single RGB-D Image",
"fno": "08511066",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cameras",
"Geometry",
"Image Classification",
"Image Colour Analysis",
"Iterative Methods",
"Lighting",
"Iterative Procedure",
"Illumination Recovery",
"Spatial Variance",
"Light Source Intensities",
"Classification Result",
"Confidence Scoring Based Strategy",
"Input Depth Map",
"Planar Based Geometry Model",
"RGB D Image",
"Indoor Scenes",
"Lighting",
"Light Sources",
"Geometry",
"Cameras",
"Three Dimensional Displays",
"Dynamic Range",
"Probes",
"Illumination Recovery",
"Automatic",
"Indoor Scenes",
"Single RGB D Image"
],
"authors": [
{
"givenName": "Guanyu",
"surname": "Xing",
"fullName": "Guanyu Xing",
"affiliation": "National Key Laboratory of Fundamental Science on Synthetic Vision, Sichuan University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanli",
"surname": "Liu",
"fullName": "Yanli Liu",
"affiliation": "College of Computer Science, Sichuan University, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haibin",
"surname": "Ling",
"fullName": "Haibin Ling",
"affiliation": "Department of Computer and Information Sciences, Center for Data Analytics and Biomedical Informatics, Temple University, Philadelphia, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xavier",
"surname": "Granier",
"fullName": "Xavier Granier",
"affiliation": "LP2N laboratory, Institut d'Optique Graduate School, Bordeaux, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanci",
"surname": "Zhang",
"fullName": "Yanci Zhang",
"affiliation": "College of Computer Science, Sichuan University, Chengdu, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2020-04-01 00:00:00",
"pubType": "trans",
"pages": "1672-1685",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2009/3992/0/05206764",
"title": "Illumination and spatially varying specular reflectance from a single view",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206764/12OmNARRYl8",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130460",
"title": "Spatially adaptive illumination modeling for background subtraction",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130460/12OmNqH9hkn",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/worv/2013/5646/0/06521924",
"title": "Color-based detection robust to varying illumination spectrum",
"doi": null,
"abstractUrl": "/proceedings-article/worv/2013/06521924/12OmNqJq4EZ",
"parentPublication": {
"id": "proceedings/worv/2013/5646/0",
"title": "2013 IEEE Workshop on Robot Vision (WORV 2013)",
"__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/pacificvis/2015/6879/0/07156382",
"title": "Efficient volume illumination with multiple light sources through selective light updates",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156382/12OmNvDZF6A",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206665",
"title": "Robust shadow and illumination estimation using a mixture model",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206665/12OmNx3q6Va",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420720",
"title": "Color constancy under varying illumination",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420720/12OmNzlUKQX",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/02/ttp2013020437",
"title": "Simultaneous Cast Shadows, Illumination and Geometry Inference Using Hypergraphs",
"doi": null,
"abstractUrl": "/journal/tp/2013/02/ttp2013020437/13rRUyfKIEo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09887904",
"title": "Fast and Accurate Illumination Estimation Using LDR Panoramic Images for Realistic Rendering",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09887904/1GBRnHyZ1bW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/09008252",
"title": "A Dataset of Multi-Illumination Images in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/09008252/1hVl7roiUlW",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08967136",
"articleId": "1gPjxXgWQM0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08496780",
"articleId": "14tNJlStZmz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1hQwDaZEX4c",
"name": "ttg202004-08511066s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202004-08511066s1.zip",
"extension": "zip",
"size": "71.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1y2FkV9ZFKM",
"title": "Nov.",
"year": "2021",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1wpqxgia3Vm",
"doi": "10.1109/TVCG.2021.3106497",
"abstract": "High dynamic range (HDR) panoramic environment maps are widely used to illuminate virtual objects to blend with real-world scenes. However, in common applications for augmented and mixed-reality (AR/MR), capturing 360° surroundings to obtain an HDR environment map is often not possible using consumer-level devices. We present a novel light estimation method to predict 360° HDR environment maps from a single photograph with a limited field-of-view (FOV). We introduce the Dynamic Lighting network (DLNet), a convolutional neural network that dynamically generates the convolution filters based on the input photograph sample to adaptively learn the lighting cues within each photograph. We propose novel Spherical Multi-Scale Dynamic (SMD) convolutional modules to dynamically generate sample-specific kernels for decoding features in the spherical domain to predict 360° environment maps. Using DLNet and data augmentations with respect to FOV, an exposure multiplier, and color temperature, our model shows the capability of estimating lighting under diverse input variations. Compared with prior work that fixes the network filters once trained, our method maintains lighting consistency across different exposure multipliers and color temperature, and maintains robust light estimation accuracy as FOV increases. The surrounding lighting information estimated by our method ensures coherent illumination of 3D objects blended with the input photograph, enabling high fidelity augmented and mixed reality supporting a wide range of environmental lighting conditions and device sensors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "High dynamic range (HDR) panoramic environment maps are widely used to illuminate virtual objects to blend with real-world scenes. However, in common applications for augmented and mixed-reality (AR/MR), capturing 360° surroundings to obtain an HDR environment map is often not possible using consumer-level devices. We present a novel light estimation method to predict 360° HDR environment maps from a single photograph with a limited field-of-view (FOV). We introduce the Dynamic Lighting network (DLNet), a convolutional neural network that dynamically generates the convolution filters based on the input photograph sample to adaptively learn the lighting cues within each photograph. We propose novel Spherical Multi-Scale Dynamic (SMD) convolutional modules to dynamically generate sample-specific kernels for decoding features in the spherical domain to predict 360° environment maps. Using DLNet and data augmentations with respect to FOV, an exposure multiplier, and color temperature, our model shows the capability of estimating lighting under diverse input variations. Compared with prior work that fixes the network filters once trained, our method maintains lighting consistency across different exposure multipliers and color temperature, and maintains robust light estimation accuracy as FOV increases. The surrounding lighting information estimated by our method ensures coherent illumination of 3D objects blended with the input photograph, enabling high fidelity augmented and mixed reality supporting a wide range of environmental lighting conditions and device sensors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "High dynamic range (HDR) panoramic environment maps are widely used to illuminate virtual objects to blend with real-world scenes. However, in common applications for augmented and mixed-reality (AR/MR), capturing 360° surroundings to obtain an HDR environment map is often not possible using consumer-level devices. We present a novel light estimation method to predict 360° HDR environment maps from a single photograph with a limited field-of-view (FOV). We introduce the Dynamic Lighting network (DLNet), a convolutional neural network that dynamically generates the convolution filters based on the input photograph sample to adaptively learn the lighting cues within each photograph. We propose novel Spherical Multi-Scale Dynamic (SMD) convolutional modules to dynamically generate sample-specific kernels for decoding features in the spherical domain to predict 360° environment maps. Using DLNet and data augmentations with respect to FOV, an exposure multiplier, and color temperature, our model shows the capability of estimating lighting under diverse input variations. Compared with prior work that fixes the network filters once trained, our method maintains lighting consistency across different exposure multipliers and color temperature, and maintains robust light estimation accuracy as FOV increases. The surrounding lighting information estimated by our method ensures coherent illumination of 3D objects blended with the input photograph, enabling high fidelity augmented and mixed reality supporting a wide range of environmental lighting conditions and device sensors.",
"title": "Adaptive Light Estimation using Dynamic Filtering for Diverse Lighting Conditions",
"normalizedTitle": "Adaptive Light Estimation using Dynamic Filtering for Diverse Lighting Conditions",
"fno": "09523888",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Convolutional Neural Nets",
"Estimation Theory",
"Filtering Theory",
"Image Colour Analysis",
"Lighting",
"Rendering Computer Graphics",
"Virtual Reality",
"Data Augmentations",
"FOV",
"Color Temperature",
"Diverse Input Variations",
"Network Filters",
"Lighting Consistency",
"Mixed Reality",
"Environmental Lighting Conditions",
"Device Sensors",
"Adaptive Light Estimation",
"Dynamic Filtering",
"Diverse Lighting Conditions",
"High Dynamic Range Panoramic Environment Maps",
"Mixed Reality",
"HDR Environment Map",
"Consumer Level Devices",
"Light Estimation Method",
"Single Photograph",
"DL Net",
"Convolutional Neural Network",
"Input Photograph Sample",
"Sample Specific Kernels",
"Illuminate Virtual Objects",
"AR MR",
"Augmented Reality",
"Spherical Multiscale Dynamic Convolutional Modules",
"SMD",
"Limited Field Of View",
"Dynamic Lighting Network",
"Lighting",
"Feature Extraction",
"Estimation",
"Convolution",
"Image Color Analysis",
"Decoding",
"Adaptation Models",
"Augmented Reality",
"Mixed Reality",
"Lighting",
"Light Estimation",
"Deep Learning"
],
"authors": [
{
"givenName": "Junhong",
"surname": "Zhao",
"fullName": "Junhong Zhao",
"affiliation": "Computational Media Innovation Centre (CMIC), Victoria University of Wellington, New Zealand",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew",
"surname": "Chalmers",
"fullName": "Andrew Chalmers",
"affiliation": "Computational Media Innovation Centre (CMIC), Victoria University of Wellington, New Zealand",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Taehyun",
"surname": "Rhee",
"fullName": "Taehyun Rhee",
"affiliation": "Computational Media Innovation Centre (CMIC), Victoria University of Wellington, New Zealand",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2021-11-01 00:00:00",
"pubType": "trans",
"pages": "4097-4106",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2012/1611/0/06239343",
"title": "Recovering spectral reflectance under commonly available lighting conditions",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2012/06239343/12OmNBTs7yq",
"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": "proceedings/3dv/2018/8425/0/842500a199",
"title": "Learning to Estimate Indoor Lighting from 3D Objects",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2018/842500a199/17D45XacGj6",
"parentPublication": {
"id": "proceedings/3dv/2018/8425/0",
"title": "2018 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlise/2022/9246/0/924600a462",
"title": "Research of machine learning under different lighting conditions",
"doi": null,
"abstractUrl": "/proceedings-article/mlise/2022/924600a462/1Ik8V97VWGA",
"parentPublication": {
"id": "proceedings/mlise/2022/9246/0",
"title": "2022 International Conference on Machine Learning and Intelligent Systems Engineering (MLISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300g920",
"title": "Deep Sky Modeling for Single Image Outdoor Lighting Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300g920/1gyrdbEY2sM",
"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/cvpr/2019/3293/0/329300k0150",
"title": "All-Weather Deep Outdoor Lighting Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300k0150/1gyrg6Ricuc",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/10/09115833",
"title": "Reconstructing Reflection Maps Using a Stacked-CNN for Mixed Reality Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2021/10/09115833/1kBgVhAEmeA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150983",
"title": "Deep Lighting Environment Map Estimation from Spherical Panoramas",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150983/1lPH5UYz7Da",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2020/8128/0/812800a355",
"title": "High-Dynamic-Range Lighting Estimation From Face Portraits",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2020/812800a355/1qyxlbQeCtO",
"parentPublication": {
"id": "proceedings/3dv/2020/8128/0",
"title": "2020 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2021/2616/0/261600a511",
"title": "Analysis of Light Source Selection and Lighting Technology in Machine Vision",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2021/261600a511/1y4owJBt4li",
"parentPublication": {
"id": "proceedings/iccea/2021/2616/0",
"title": "2021 International Conference on Computer Engineering and Application (ICCEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900k0586",
"title": "Lighting, Reflectance and Geometry Estimation from 360° Panoramic Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0586/1yeIplXJ9wQ",
"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": "09523830",
"articleId": "1wpqs1dtKes",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09523843",
"articleId": "1wpqlQWCIxy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1y2FwBf0Tyo",
"name": "ttg202111-09523888s1-supp1-3106497.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202111-09523888s1-supp1-3106497.pdf",
"extension": "pdf",
"size": "6.77 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAsk4xH",
"title": "Nov.",
"year": "2020",
"issueNum": "11",
"idPrefix": "si",
"pubType": "journal",
"volume": "28",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nL7sJLJYf6",
"doi": "10.1109/TVLSI.2020.3022776",
"abstract": "Printed electronics (PE) enables disruptive applications in wearables, smart sensors, and healthcare since it provides mechanical flexibility, low cost, and on-demand fabrication. The progress in PE raises trust issues in the supply chain and vulnerability to reverse engineering (RE) attacks. Recently, RE attacks on PE circuits have been successfully performed, pointing out the need for countermeasures against RE, such as camouflaging. In this article, we propose a printed camouflaged logic cell that can be inserted into PE circuits to thwart RE. The proposed cell is based on three components achieved by changing the fabrication process that exploits the additive manufacturing feature of PE. These components are optically look-alike, while their electrical behaviors are different, functioning as a transistor, short, and open. The properties of the proposed cell and standard PE cells are compared in terms of voltage swing, delay, power consumption, and area. Moreover, the proposed camouflaged cell is fabricated and characterized to prove its functionality. Furthermore, numerous camouflaged components are fabricated, and their (in)distinguishability is assessed to validate their optical similarities based on the recent RE attacks on PE. The results show that the proposed cell is a promising candidate to be utilized in camouflaging PE circuits with negligible overhead.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Printed electronics (PE) enables disruptive applications in wearables, smart sensors, and healthcare since it provides mechanical flexibility, low cost, and on-demand fabrication. The progress in PE raises trust issues in the supply chain and vulnerability to reverse engineering (RE) attacks. Recently, RE attacks on PE circuits have been successfully performed, pointing out the need for countermeasures against RE, such as camouflaging. In this article, we propose a printed camouflaged logic cell that can be inserted into PE circuits to thwart RE. The proposed cell is based on three components achieved by changing the fabrication process that exploits the additive manufacturing feature of PE. These components are optically look-alike, while their electrical behaviors are different, functioning as a transistor, short, and open. The properties of the proposed cell and standard PE cells are compared in terms of voltage swing, delay, power consumption, and area. Moreover, the proposed camouflaged cell is fabricated and characterized to prove its functionality. Furthermore, numerous camouflaged components are fabricated, and their (in)distinguishability is assessed to validate their optical similarities based on the recent RE attacks on PE. The results show that the proposed cell is a promising candidate to be utilized in camouflaging PE circuits with negligible overhead.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Printed electronics (PE) enables disruptive applications in wearables, smart sensors, and healthcare since it provides mechanical flexibility, low cost, and on-demand fabrication. The progress in PE raises trust issues in the supply chain and vulnerability to reverse engineering (RE) attacks. Recently, RE attacks on PE circuits have been successfully performed, pointing out the need for countermeasures against RE, such as camouflaging. In this article, we propose a printed camouflaged logic cell that can be inserted into PE circuits to thwart RE. The proposed cell is based on three components achieved by changing the fabrication process that exploits the additive manufacturing feature of PE. These components are optically look-alike, while their electrical behaviors are different, functioning as a transistor, short, and open. The properties of the proposed cell and standard PE cells are compared in terms of voltage swing, delay, power consumption, and area. Moreover, the proposed camouflaged cell is fabricated and characterized to prove its functionality. Furthermore, numerous camouflaged components are fabricated, and their (in)distinguishability is assessed to validate their optical similarities based on the recent RE attacks on PE. The results show that the proposed cell is a promising candidate to be utilized in camouflaging PE circuits with negligible overhead.",
"title": "A Printed Camouflaged Cell Against Reverse Engineering of Printed Electronics Circuits",
"normalizedTitle": "A Printed Camouflaged Cell Against Reverse Engineering of Printed Electronics Circuits",
"fno": "09217985",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Invasive Software",
"Printed Circuits",
"Reverse Engineering",
"Printed Camouflaged Logic Cell",
"Fabrication Process",
"Standard PE Cells",
"Camouflaged Cell",
"Numerous Camouflaged Components",
"Camouflaging PE Circuits",
"Reverse Engineering",
"Printed Electronics Circuits",
"Disruptive Applications",
"Smart Sensors",
"Mechanical Flexibility",
"On Demand Fabrication",
"Trust Issues",
"Supply Chain",
"Transistors",
"Three Dimensional Printing",
"Integrated Circuits",
"Optical Device Fabrication",
"Additive Manufacturing",
"Camouflaging",
"Electrolyte Gated Transistors EG Ts",
"Emerging Technologies For Computing",
"Fabrication",
"Inkjet Printing",
"Internet Of Things Io T",
"Low Cost",
"Printed Electronics PE",
"Reverse Engineering RE"
],
"authors": [
{
"givenName": "Ahmet Turan",
"surname": "Erozan",
"fullName": "Ahmet Turan Erozan",
"affiliation": "Chair of Dependable Nano Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dennis D.",
"surname": "Weller",
"fullName": "Dennis D. Weller",
"affiliation": "Chair of Dependable Nano Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yijing",
"surname": "Feng",
"fullName": "Yijing Feng",
"affiliation": "Chair of Dependable Nano Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gabriel Cadilha",
"surname": "Marques",
"fullName": "Gabriel Cadilha Marques",
"affiliation": "Chair of Dependable Nano Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jasmin",
"surname": "Aghassi-Hagmann",
"fullName": "Jasmin Aghassi-Hagmann",
"affiliation": "Institute of Nanotechnology, Karlsruhe Institute of Technology, Eggenstein-Leopoldshafen, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mehdi B.",
"surname": "Tahoori",
"fullName": "Mehdi B. Tahoori",
"affiliation": "Chair of Dependable Nano Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2020-11-01 00:00:00",
"pubType": "trans",
"pages": "2448-2458",
"year": "2020",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/host/2018/4731/0/08383897",
"title": "CTCG: Charge-trap based camouflaged gates for reverse engineering prevention",
"doi": null,
"abstractUrl": "/proceedings-article/host/2018/08383897/12OmNBBQZr8",
"parentPublication": {
"id": "proceedings/host/2018/4731/0",
"title": "2018 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ectc/2017/6315/0/07999922",
"title": "Scalability and Yield in Elastomer Stamp Micro-Transfer-Printing",
"doi": null,
"abstractUrl": "/proceedings-article/ectc/2017/07999922/12OmNs59K0f",
"parentPublication": {
"id": "proceedings/ectc/2017/6315/0",
"title": "2017 IEEE 67th Electronic Components and Technology Conference (ECTC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsid/2016/9039/0/9039a443",
"title": "Threshold-Dependent Camouflaged Cells to Secure Circuits Against Reverse Engineering Attacks",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsid/2016/9039a443/12OmNzYNN3L",
"parentPublication": {
"id": "proceedings/isvlsid/2016/9039/0",
"title": "2016 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2018/12/08463626",
"title": "Inkjet-Printed EGFET-Based Physical Unclonable Function—Design, Evaluation, and Fabrication",
"doi": null,
"abstractUrl": "/journal/si/2018/12/08463626/17D45WXIkBR",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvisp/2021/0770/0/077000a171",
"title": "Development of a Droplet-Based Microfluidics Platform Toward Single-cell Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icvisp/2021/077000a171/1APq4rnvkaI",
"parentPublication": {
"id": "proceedings/icvisp/2021/0770/0",
"title": "2021 5th International Conference on Vision, Image and Signal Processing (ICVISP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2023/01/09930791",
"title": "A Twofold Clock and Voltage-Based Detection Method for Laser Logic State Imaging Attack",
"doi": null,
"abstractUrl": "/journal/si/2023/01/09930791/1HMP1nhhzBm",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08998378",
"title": "FibAR: Embedding Optical Fibers in 3D Printed Objects for Active Markers in Dynamic Projection Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08998378/1hpPCL9mirK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2020/06/09046766",
"title": "A Novel Printed-Lookup-Table-Based Programmable Printed Digital Circuit",
"doi": null,
"abstractUrl": "/journal/si/2020/06/09046766/1iu9A51UiTS",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2020/06/09037195",
"title": "A Compact Low-Voltage True Random Number Generator Based on Inkjet Printing Technology",
"doi": null,
"abstractUrl": "/journal/si/2020/06/09037195/1kerglcbVjW",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2021/08/09448191",
"title": "Defect Detection in Transparent Printed Electronics Using Learning-Based Optical Inspection",
"doi": null,
"abstractUrl": "/journal/si/2021/08/09448191/1ugE7OC979u",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09204691",
"articleId": "1nmdYmtaGxq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09198933",
"articleId": "1naBuVtBI7m",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1vEWUnHIeys",
"title": "Aug.",
"year": "2021",
"issueNum": "08",
"idPrefix": "si",
"pubType": "journal",
"volume": "29",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ugE7OC979u",
"doi": "10.1109/TVLSI.2021.3082476",
"abstract": "Printed electronics (PE) is an emerging technology that provides attractive and complementary features compared to traditional wafer-scale silicon fabrication, such as flexible substrate and point-of-use ultralow-cost manufacturing. The low-cost manufacturing and larger feature sizes mandate reduced complexity in circuit size and also limited and transparent printing layers. This enables optical inspection for manufacturing defect detection, eliminating the need for electrical testing for gross defect detection. Therefore, the traditional problem of controllability and observability in logic testing can completely be alleviated. In this article, we present a learning-based method for optical inspection to detect defective transistors in transparent PE. The method leverages domain-specific as well as common inspection features extracted from optical images to detect defective transistors using supervised learning algorithms trained with real fabricated transistor images. The results show that the proposed method detects 95% of the defective transistors, which can significantly reduce the cost of the overall test flow.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Printed electronics (PE) is an emerging technology that provides attractive and complementary features compared to traditional wafer-scale silicon fabrication, such as flexible substrate and point-of-use ultralow-cost manufacturing. The low-cost manufacturing and larger feature sizes mandate reduced complexity in circuit size and also limited and transparent printing layers. This enables optical inspection for manufacturing defect detection, eliminating the need for electrical testing for gross defect detection. Therefore, the traditional problem of controllability and observability in logic testing can completely be alleviated. In this article, we present a learning-based method for optical inspection to detect defective transistors in transparent PE. The method leverages domain-specific as well as common inspection features extracted from optical images to detect defective transistors using supervised learning algorithms trained with real fabricated transistor images. The results show that the proposed method detects 95% of the defective transistors, which can significantly reduce the cost of the overall test flow.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Printed electronics (PE) is an emerging technology that provides attractive and complementary features compared to traditional wafer-scale silicon fabrication, such as flexible substrate and point-of-use ultralow-cost manufacturing. The low-cost manufacturing and larger feature sizes mandate reduced complexity in circuit size and also limited and transparent printing layers. This enables optical inspection for manufacturing defect detection, eliminating the need for electrical testing for gross defect detection. Therefore, the traditional problem of controllability and observability in logic testing can completely be alleviated. In this article, we present a learning-based method for optical inspection to detect defective transistors in transparent PE. The method leverages domain-specific as well as common inspection features extracted from optical images to detect defective transistors using supervised learning algorithms trained with real fabricated transistor images. The results show that the proposed method detects 95% of the defective transistors, which can significantly reduce the cost of the overall test flow.",
"title": "Defect Detection in Transparent Printed Electronics Using Learning-Based Optical Inspection",
"normalizedTitle": "Defect Detection in Transparent Printed Electronics Using Learning-Based Optical Inspection",
"fno": "09448191",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Automatic Optical Inspection",
"Feature Extraction",
"Learning Artificial Intelligence",
"Logic Testing",
"Printed Circuit Manufacture",
"Production Engineering Computing",
"Silicon",
"Wafer Scale Integration",
"Transparent Printed Electronics",
"Optical Inspection",
"Traditional Wafer Scale Silicon Fabrication",
"Ultralow Cost Manufacturing",
"Low Cost Manufacturing",
"Transparent Printing Layers",
"Electrical Testing",
"Gross Defect Detection",
"Logic Testing",
"Learning Based Method",
"Defective Transistors",
"Transparent PE",
"Inspection Features",
"Optical Images",
"Supervised Learning Algorithms",
"Fabricated Transistor Images",
"Transistors",
"Optical Imaging",
"Optical Device Fabrication",
"Electrolytes",
"Feature Extraction",
"Inspection",
"Printing",
"Additive Manufacturing",
"Electrolyte Gated Transistor EGT",
"Optical Inspection",
"Printed Electronics PE"
],
"authors": [
{
"givenName": "Ahmet Turan",
"surname": "Erozan",
"fullName": "Ahmet Turan Erozan",
"affiliation": "Chair of Dependable Nano Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Bosse",
"fullName": "Simon Bosse",
"affiliation": "Chair of Dependable Nano Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mehdi B.",
"surname": "Tahoori",
"fullName": "Mehdi B. Tahoori",
"affiliation": "Chair of Dependable Nano Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2021-08-01 00:00:00",
"pubType": "trans",
"pages": "1505-1517",
"year": "2021",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dftvs/1992/2837/0/00224365",
"title": "Optical inspection of wafers using large-area defect detection and sampling",
"doi": null,
"abstractUrl": "/proceedings-article/dftvs/1992/00224365/12OmNs59JIL",
"parentPublication": {
"id": "proceedings/dftvs/1992/2837/0",
"title": "Proceedings 1992 IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2007/2882/0/28820230",
"title": "Radial Basis Function Neural Networks for LED Wafer Defect Inspection",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2007/28820230/12OmNvHGrAp",
"parentPublication": {
"id": "proceedings/icicic/2007/2882/0",
"title": "2007 Second International Conference on Innovative Computing, Information and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/umc/2008/3427/0/3427a087",
"title": "Pattern Recognition from Segmented Images in Automated Inspection Systems",
"doi": null,
"abstractUrl": "/proceedings-article/umc/2008/3427a087/12OmNzVXNSz",
"parentPublication": {
"id": "proceedings/umc/2008/3427/0",
"title": "Ubiquitous Multimedia Computing, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2007/2882/0/28820229",
"title": "Learning Vector Quantization Neural Networks for LED Wafer Defect Inspection",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2007/28820229/12OmNzkMlSu",
"parentPublication": {
"id": "proceedings/icicic/2007/2882/0",
"title": "2007 Second International Conference on Innovative Computing, Information and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2019/2297/0/229700a101",
"title": "Detection Defect in Printed Circuit Boards using Unsupervised Feature Extraction Upon Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2019/229700a101/1fHklx7OPC0",
"parentPublication": {
"id": "proceedings/cw/2019/2297/0",
"title": "2019 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2020/06/09046766",
"title": "A Novel Printed-Lookup-Table-Based Programmable Printed Digital Circuit",
"doi": null,
"abstractUrl": "/journal/si/2020/06/09046766/1iu9A51UiTS",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2020/11/09217985",
"title": "A Printed Camouflaged Cell Against Reverse Engineering of Printed Electronics Circuits",
"doi": null,
"abstractUrl": "/journal/si/2020/11/09217985/1nL7sJLJYf6",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2020/7303/0/730300a245",
"title": "Simulating the Printed Circuit Board Assembly Process for Image Generation",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2020/730300a245/1nkDpuOcfsY",
"parentPublication": {
"id": "proceedings/compsac/2020/7303/0",
"title": "2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvidl/2020/9481/0/948100a090",
"title": "Adaptive Visual Inspection Method for Transparent Label Defect Detection of Curved Glass Bottle",
"doi": null,
"abstractUrl": "/proceedings-article/cvidl/2020/948100a090/1pbe8FvD0L6",
"parentPublication": {
"id": "proceedings/cvidl/2020/9481/0",
"title": "2020 International Conference on Computer Vision, Image and Deep Learning (CVIDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2021/0032/0/09555499",
"title": "Short Survey of Artificial Intelligent Technologies for Defect Detection in Manufacturing",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2021/09555499/1xxciW4jebS",
"parentPublication": {
"id": "proceedings/iisa/2021/0032/0",
"title": "2021 12th International Conference on Information, Intelligence, Systems & Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09502422",
"articleId": "1vEWYaufAWY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09460781",
"articleId": "1uxeVrnTqgw",
"__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": "1zTfZzq1wqY",
"doi": "10.1109/TVCG.2021.3139913",
"abstract": "Face image manipulation via three-dimensional guidance has been widely applied in various interactive scenarios due to its semantically-meaningful understanding and user-friendly controllability. However, existing 3D-morphable-model-based manipulation methods are not directly applicable to out-of-domain faces, such as non-photorealistic paintings, cartoon portraits, or even animals, mainly due to the formidable difficulties in building the model for each specific face domain. To overcome this challenge, we propose, as far as we know, the first method to manipulate faces in arbitrary domains using human 3DMM. This is achieved through two major steps: 1) disentangled mapping from 3DMM parameters to the latent space embedding of a pre-trained StyleGAN2 [1] that guarantees disentangled and precise controls for each semantic attribute; and 2) cross-domain adaptation that bridges domain discrepancies and makes human 3DMM applicable to out-of-domain faces by enforcing a consistent latent space embedding. Experiments and comparisons demonstrate the superiority of our high-quality semantic manipulation method on a variety of face domains with all major 3D facial attributes controllable – pose, expression, shape, albedo, and illumination. Moreover, we develop an intuitive editing interface to support user-friendly control and instant feedback. Our project page is <uri>https://cassiepython.github.io/cddfm3d/index.html</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Face image manipulation via three-dimensional guidance has been widely applied in various interactive scenarios due to its semantically-meaningful understanding and user-friendly controllability. However, existing 3D-morphable-model-based manipulation methods are not directly applicable to out-of-domain faces, such as non-photorealistic paintings, cartoon portraits, or even animals, mainly due to the formidable difficulties in building the model for each specific face domain. To overcome this challenge, we propose, as far as we know, the first method to manipulate faces in arbitrary domains using human 3DMM. This is achieved through two major steps: 1) disentangled mapping from 3DMM parameters to the latent space embedding of a pre-trained StyleGAN2 [1] that guarantees disentangled and precise controls for each semantic attribute; and 2) cross-domain adaptation that bridges domain discrepancies and makes human 3DMM applicable to out-of-domain faces by enforcing a consistent latent space embedding. Experiments and comparisons demonstrate the superiority of our high-quality semantic manipulation method on a variety of face domains with all major 3D facial attributes controllable – pose, expression, shape, albedo, and illumination. Moreover, we develop an intuitive editing interface to support user-friendly control and instant feedback. Our project page is <uri>https://cassiepython.github.io/cddfm3d/index.html</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Face image manipulation via three-dimensional guidance has been widely applied in various interactive scenarios due to its semantically-meaningful understanding and user-friendly controllability. However, existing 3D-morphable-model-based manipulation methods are not directly applicable to out-of-domain faces, such as non-photorealistic paintings, cartoon portraits, or even animals, mainly due to the formidable difficulties in building the model for each specific face domain. To overcome this challenge, we propose, as far as we know, the first method to manipulate faces in arbitrary domains using human 3DMM. This is achieved through two major steps: 1) disentangled mapping from 3DMM parameters to the latent space embedding of a pre-trained StyleGAN2 [1] that guarantees disentangled and precise controls for each semantic attribute; and 2) cross-domain adaptation that bridges domain discrepancies and makes human 3DMM applicable to out-of-domain faces by enforcing a consistent latent space embedding. Experiments and comparisons demonstrate the superiority of our high-quality semantic manipulation method on a variety of face domains with all major 3D facial attributes controllable – pose, expression, shape, albedo, and illumination. Moreover, we develop an intuitive editing interface to support user-friendly control and instant feedback. Our project page is https://cassiepython.github.io/cddfm3d/index.html.",
"title": "Cross-Domain and Disentangled Face Manipulation With 3D Guidance",
"normalizedTitle": "Cross-Domain and Disentangled Face Manipulation With 3D Guidance",
"fno": "09668999",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Animation",
"Face Recognition",
"Image Reconstruction",
"Pose Estimation",
"Solid Modelling",
"3 D Facial Attributes",
"3 D Morphable Model Based Manipulation Methods",
"3 DMM Parameters",
"Arbitrary Domains",
"Bridges Domain Discrepancies",
"Consistent Latent Space Embedding",
"Cross Domain Adaptation",
"Disentangled Controls",
"Face Image Manipulation",
"Face Manipulation",
"High Quality Semantic Manipulation Method",
"Human 3 DMM",
"Interactive Scenarios",
"Nonphotorealistic Paintings",
"Out Of Domain Faces",
"Pre Trained Style GAN 2 1",
"Precise Controls",
"Semantic Attribute",
"Semantically Meaningful Understanding",
"Specific Face Domain",
"Three Dimensional Guidance",
"User Friendly Control",
"User Friendly Controllability",
"Faces",
"Aerospace Electronics",
"Three Dimensional Displays",
"Semantics",
"Lighting",
"Solid Modeling",
"Codes",
"Face Image Manipulation",
"Domain Adaptation",
"3 D Morphable Model",
"Disentanglement",
"Style GAN 2"
],
"authors": [
{
"givenName": "Can",
"surname": "Wang",
"fullName": "Can Wang",
"affiliation": "Department of Computer Science, City University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Menglei",
"surname": "Chai",
"fullName": "Menglei Chai",
"affiliation": "Creative Vision team, Snap Inc., Santa Monica, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingming",
"surname": "He",
"fullName": "Mingming He",
"affiliation": "Institute for Creative Technologies, University of Southern California, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongdong",
"surname": "Chen",
"fullName": "Dongdong Chen",
"affiliation": "Microsoft Cloud AI, Redmond, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Liao",
"fullName": "Jing Liao",
"affiliation": "Department of Computer Science, City University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "2053-2066",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2021/2812/0/281200o4063",
"title": "GAN-Control: Explicitly Controllable GANs",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200o4063/1BmG479cDcI",
"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/694600s8551",
"title": "Neural Template: Topology-aware Reconstruction and Disentangled Generation of 3D Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600s8551/1H0NuMEsMaQ",
"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/tg/5555/01/10061279",
"title": "ReenactArtFace: Artistic Face Image Reenactment",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10061279/1LiKMy3pdDO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300j711",
"title": "Joint Face Detection and Facial Motion Retargeting for Multiple Faces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300j711/1gyrrvF3hok",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600c371",
"title": "Face Synthesis and Recognition Using Disentangled Representation-Learning Wasserstein GAN",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600c371/1iTvl3KxDBS",
"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/cvpr/2020/7168/0/716800f153",
"title": "Disentangled and Controllable Face Image Generation via 3D Imitative-Contrastive Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800f153/1m3nE7TQglW",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800j240",
"title": "Interpreting the Latent Space of GANs for Semantic Face Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800j240/1m3nRsHWYJa",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800g677",
"title": "Cross-Domain Face Presentation Attack Detection via Multi-Domain Disentangled Representation Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800g677/1m3nzaJSkDu",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/04/09241434",
"title": "InterFaceGAN: Interpreting the Disentangled Face Representation Learned by GANs",
"doi": null,
"abstractUrl": "/journal/tp/2022/04/09241434/1ogEwfwfCjC",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900m2858",
"title": "StyleSpace Analysis: Disentangled Controls for StyleGAN Image Generation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900m2858/1yeLlVDbKDu",
"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": "09665307",
"articleId": "1zJiKkgGIaQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09669058",
"articleId": "1zTfZV1Ocnu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1L8lQFA6Yvu",
"name": "ttg202304-09668999s1-supp1-3139913.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202304-09668999s1-supp1-3139913.pdf",
"extension": "pdf",
"size": "3.05 MB",
"__typename": "WebExtraType"
},
{
"id": "1L8lQxnachO",
"name": "ttg202304-09668999s1-supp2-3139913.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202304-09668999s1-supp2-3139913.mp4",
"extension": "mp4",
"size": "41.3 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": "1HeiWQWKlTG",
"doi": "10.1109/TVCG.2022.3212089",
"abstract": "We investigate how underfoot vibrotactile feedback can be used to increase the impression of walking and embodiment of static users represented by a first- or third-person avatar. We designed a multi-sensory setup involving avatar displayed on an HMD, and a set of vibrotactile effects displayed at every footstep. In a first study (N = 44), we compared the impression of walking in 3 vibrotactile conditions : 1) with a ”constant” vibrotactile rendering reproducing simple contact information, 2) with a more sophisticated ”phase-based” vibrotactile rendering the successive contacts of a walking cycle and 3) without vibrotactile feedback. The results show that overall both constant and phase-based rendering significantly improve the impression of walking in first and third-person perspective. Interestingly, the more realistic phase-based rendering seems to increase significantly the impression of walking in the third-person condition, but not in the first-person condition. In a second study (N=28), we evaluated the embodiment towards first- and third-person avatar while receiving no vibrotactile feedback or by receiving vibrotactile feedback. The results show that vibrotactile feedback improves embodiment in both perspectives of the avatar. Taken together, our results support the use of vibrotactile feedback when users observe first- and third-person avatar. They also suggest that constant and phase-based rendering could be used with first-person avatar and support the use of phase-based rendering with third-person avatar. They provide valuable insight for stimulations in any VR applications in which the impression of walking is prominent such as for virtual visits, walking rehabilitation, video games, etc.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We investigate how underfoot vibrotactile feedback can be used to increase the impression of walking and embodiment of static users represented by a first- or third-person avatar. We designed a multi-sensory setup involving avatar displayed on an HMD, and a set of vibrotactile effects displayed at every footstep. In a first study (N = 44), we compared the impression of walking in 3 vibrotactile conditions : 1) with a ”constant” vibrotactile rendering reproducing simple contact information, 2) with a more sophisticated ”phase-based” vibrotactile rendering the successive contacts of a walking cycle and 3) without vibrotactile feedback. The results show that overall both constant and phase-based rendering significantly improve the impression of walking in first and third-person perspective. Interestingly, the more realistic phase-based rendering seems to increase significantly the impression of walking in the third-person condition, but not in the first-person condition. In a second study (N=28), we evaluated the embodiment towards first- and third-person avatar while receiving no vibrotactile feedback or by receiving vibrotactile feedback. The results show that vibrotactile feedback improves embodiment in both perspectives of the avatar. Taken together, our results support the use of vibrotactile feedback when users observe first- and third-person avatar. They also suggest that constant and phase-based rendering could be used with first-person avatar and support the use of phase-based rendering with third-person avatar. They provide valuable insight for stimulations in any VR applications in which the impression of walking is prominent such as for virtual visits, walking rehabilitation, video games, etc.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We investigate how underfoot vibrotactile feedback can be used to increase the impression of walking and embodiment of static users represented by a first- or third-person avatar. We designed a multi-sensory setup involving avatar displayed on an HMD, and a set of vibrotactile effects displayed at every footstep. In a first study (N = 44), we compared the impression of walking in 3 vibrotactile conditions : 1) with a ”constant” vibrotactile rendering reproducing simple contact information, 2) with a more sophisticated ”phase-based” vibrotactile rendering the successive contacts of a walking cycle and 3) without vibrotactile feedback. The results show that overall both constant and phase-based rendering significantly improve the impression of walking in first and third-person perspective. Interestingly, the more realistic phase-based rendering seems to increase significantly the impression of walking in the third-person condition, but not in the first-person condition. In a second study (N=28), we evaluated the embodiment towards first- and third-person avatar while receiving no vibrotactile feedback or by receiving vibrotactile feedback. The results show that vibrotactile feedback improves embodiment in both perspectives of the avatar. Taken together, our results support the use of vibrotactile feedback when users observe first- and third-person avatar. They also suggest that constant and phase-based rendering could be used with first-person avatar and support the use of phase-based rendering with third-person avatar. They provide valuable insight for stimulations in any VR applications in which the impression of walking is prominent such as for virtual visits, walking rehabilitation, video games, etc.",
"title": "Effect of Vibrations on Impression of Walking and Embodiment With First- and Third-Person Avatar",
"normalizedTitle": "Effect of Vibrations on Impression of Walking and Embodiment With First- and Third-Person Avatar",
"fno": "09911682",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Avatars",
"Rendering Computer Graphics",
"Legged Locomotion",
"Foot",
"Visualization",
"Vibrations",
"Loading",
"Action Observation",
"Avatar",
"Embodiment",
"Impression Of Walking",
"Vibrotactile Feedback",
"Virtual Reality"
],
"authors": [
{
"givenName": "Justine",
"surname": "Saint-Aubert",
"fullName": "Justine Saint-Aubert",
"affiliation": "Inria Rennes, Campus Universitaire de Beaulieu F-35042, Rennes Cedex, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Manson",
"fullName": "Julien Manson",
"affiliation": "Inria Rennes, Campus Universitaire de Beaulieu F-35042, Rennes Cedex, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Isabelle",
"surname": "Bonan",
"fullName": "Isabelle Bonan",
"affiliation": "Rennes University Hospital, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yoann",
"surname": "Launey",
"fullName": "Yoann Launey",
"affiliation": "Rennes University Hospital, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anatole",
"surname": "Lécuyer",
"fullName": "Anatole Lécuyer",
"affiliation": "Inria Rennes, Campus Universitaire de Beaulieu F-35042, Rennes Cedex, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mélanie",
"surname": "Cogné",
"fullName": "Mélanie Cogné",
"affiliation": "Rennes University Hospital, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "1-8",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2016/0842/0/07460066",
"title": "Rhythmic vibrations to heels and forefeet to produce virtual walking",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2016/07460066/12OmNBQkwZJ",
"parentPublication": {
"id": "proceedings/3dui/2016/0842/0",
"title": "2016 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2016/0842/0/07460072",
"title": "Gaitzilla: A game to study the effects of virtual embodiment in gait rehabilitation",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2016/07460072/12OmNBqv2nN",
"parentPublication": {
"id": "proceedings/3dui/2016/0842/0",
"title": "2016 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09744001",
"title": "Influence of user posture and virtual exercise on impression of locomotion during VR observation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09744001/1C8BFV420lq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a552",
"title": "Persuasive Vibrations: Effects of Speech-Based Vibrations on Persuasion, Leadership, and Co-Presence During Verbal Communication in VR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a552/1MNgYjAysYU",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798263",
"title": "EEG Can Be Used to Measure Embodiment When Controlling a Walking Self-Avatar",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798263/1cJ1gj5NtQc",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798345",
"title": "Investigation of Visual Self-Representation for a Walking-in-Place Navigation System in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798345/1cJ1hpkUgHS",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08998305",
"title": "Avatar and Sense of Embodiment: Studying the Relative Preference Between Appearance, Control and Point of View",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08998305/1hpPBuW1ahy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090634",
"title": "Rhythmic proprioceptive stimulation improves embodiment in a walking avatar when added to visual stimulation",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090634/1jIxkrgIlEY",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090453",
"title": "Perception of Walking Self-body Avatar Enhances Virtual-walking Sensation",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090453/1jIxoojmMy4",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a452",
"title": "Studying the Inter-Relation Between Locomotion Techniques and Embodiment in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a452/1pysvNRUnD2",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09910018",
"articleId": "1HcjhcNOxUI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09916138",
"articleId": "1HojA9hKTO8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HfCw7JuGys",
"name": "ttg555501-09911682s1-supp1-3212089.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09911682s1-supp1-3212089.mp4",
"extension": "mp4",
"size": "11.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFI",
"title": "May",
"year": "2020",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1hrXgAAK6NW",
"doi": "10.1109/TVCG.2020.2973059",
"abstract": "Directivity and gain in microphone array systems for hearing aids or hearable devices allow users to acoustically enhance the information of a source of interest. This source is usually positioned directly in front. This feature is called acoustic beamforming. The current study aimed to improve users' interactions with beamforming via a virtual prototyping approach in immersive virtual environments (VEs). Eighteen participants took part in experimental sessions composed of a calibration procedure and a selective auditory attention voice-pairing task. Eight concurrent speakers were placed in an anechoic environment in two virtual reality (VR) scenarios. The scenarios were a purely virtual scenario and a realistic 360° audio-visual recording. Participants were asked to find an individual optimal parameterization for three different virtual beamformers: (i) head-guided, (ii) eye gaze-guided, and (iii) a novel interaction technique called dual beamformer, where head-guided is combined with an additional hand-guided beamformer. None of the participants were able to complete the task without a virtual beamformer (i.e., in normal hearing condition) due to the high complexity introduced by the experimental design. However, participants were able to correctly pair all speakers using all three proposed interaction metaphors. Providing superhuman hearing abilities in the form of a dual acoustic beamformer guided by head and hand movements resulted in statistically significant improvements in terms of pairing time, suggesting the task-relevance of interacting with multiple points of interests.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Directivity and gain in microphone array systems for hearing aids or hearable devices allow users to acoustically enhance the information of a source of interest. This source is usually positioned directly in front. This feature is called acoustic beamforming. The current study aimed to improve users' interactions with beamforming via a virtual prototyping approach in immersive virtual environments (VEs). Eighteen participants took part in experimental sessions composed of a calibration procedure and a selective auditory attention voice-pairing task. Eight concurrent speakers were placed in an anechoic environment in two virtual reality (VR) scenarios. The scenarios were a purely virtual scenario and a realistic 360° audio-visual recording. Participants were asked to find an individual optimal parameterization for three different virtual beamformers: (i) head-guided, (ii) eye gaze-guided, and (iii) a novel interaction technique called dual beamformer, where head-guided is combined with an additional hand-guided beamformer. None of the participants were able to complete the task without a virtual beamformer (i.e., in normal hearing condition) due to the high complexity introduced by the experimental design. However, participants were able to correctly pair all speakers using all three proposed interaction metaphors. Providing superhuman hearing abilities in the form of a dual acoustic beamformer guided by head and hand movements resulted in statistically significant improvements in terms of pairing time, suggesting the task-relevance of interacting with multiple points of interests.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Directivity and gain in microphone array systems for hearing aids or hearable devices allow users to acoustically enhance the information of a source of interest. This source is usually positioned directly in front. This feature is called acoustic beamforming. The current study aimed to improve users' interactions with beamforming via a virtual prototyping approach in immersive virtual environments (VEs). Eighteen participants took part in experimental sessions composed of a calibration procedure and a selective auditory attention voice-pairing task. Eight concurrent speakers were placed in an anechoic environment in two virtual reality (VR) scenarios. The scenarios were a purely virtual scenario and a realistic 360° audio-visual recording. Participants were asked to find an individual optimal parameterization for three different virtual beamformers: (i) head-guided, (ii) eye gaze-guided, and (iii) a novel interaction technique called dual beamformer, where head-guided is combined with an additional hand-guided beamformer. None of the participants were able to complete the task without a virtual beamformer (i.e., in normal hearing condition) due to the high complexity introduced by the experimental design. However, participants were able to correctly pair all speakers using all three proposed interaction metaphors. Providing superhuman hearing abilities in the form of a dual acoustic beamformer guided by head and hand movements resulted in statistically significant improvements in terms of pairing time, suggesting the task-relevance of interacting with multiple points of interests.",
"title": "Superhuman Hearing - Virtual Prototyping of Artificial Hearing: a Case Study on Interactions and Acoustic Beamforming",
"normalizedTitle": "Superhuman Hearing - Virtual Prototyping of Artificial Hearing: a Case Study on Interactions and Acoustic Beamforming",
"fno": "08998401",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Acoustic Signal Processing",
"Array Signal Processing",
"Calibration",
"Gaze Tracking",
"Handicapped Aids",
"Hearing Aids",
"Microphone Arrays",
"Speech Processing",
"Statistical Analysis",
"Virtual Reality",
"Statistical Significance",
"Calibration Procedure",
"Superhuman Hearing Abilities",
"Eye Gaze Guided Beamformer",
"Hand Guided Beamformer",
"Interaction Metaphors",
"Virtual Beamformer",
"Realistic 360 X 00 B 0 Audio Visual Recording",
"Virtual Reality Scenarios",
"Anechoic Environment",
"Concurrent Speakers",
"Selective Auditory Attention Voice Pairing Task",
"Immersive Virtual Environments",
"Virtual Prototyping Approach",
"Hearable Devices",
"Hearing Aids",
"Microphone Array Systems",
"Acoustic Beamforming",
"Artificial Hearing",
"Auditory System",
"Array Signal Processing",
"Hearing Aids",
"Acoustics",
"Task Analysis",
"Microphones",
"Ear",
"Virtual Prototyping",
"Sonic Interactions",
"Acoustic Beamforming",
"Artificial Hearing",
"Virtual Reality",
"Multi Speaker Scenario"
],
"authors": [
{
"givenName": "Michele",
"surname": "Geronazzo",
"fullName": "Michele Geronazzo",
"affiliation": "Department of Architecture, Design, and Media Technology, Aalborg University Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luis S.",
"surname": "Vieira",
"fullName": "Luis S. Vieira",
"affiliation": "Khora Virtual Reality, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niels Christian",
"surname": "Nilsson",
"fullName": "Niels Christian Nilsson",
"affiliation": "Department of Architecture, Design, and Media Technology, Aalborg University Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jesper",
"surname": "Udesen",
"fullName": "Jesper Udesen",
"affiliation": "GN Audio A/S, Ballerup, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefania",
"surname": "Serafin",
"fullName": "Stefania Serafin",
"affiliation": "Department of Architecture, Design, and Media Technology, Aalborg University Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2020-05-01 00:00:00",
"pubType": "trans",
"pages": "1912-1922",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/csci/2016/5510/0/07881327",
"title": "6dB SNR Improved 64 Channel Hearing Aid Development Using CSR8675 Bluetooth Chip",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2016/07881327/12OmNvSbBHM",
"parentPublication": {
"id": "proceedings/csci/2016/5510/0",
"title": "2016 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/4/01326750",
"title": "A real time implementation and an evaluation of an optimal filtering technique for noise reduction in dual microphone hearing aids",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326750/12OmNzUPpsJ",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/4",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446298",
"title": "3D Tune-In: 3D-Games for Tuning and Learning About Hearing Aids",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446298/13bd1ftOBDg",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sive/2018/5713/0/08577076",
"title": "The 3D Tune-In Toolkit – 3D audio spatialiser, hearing loss and hearing aid simulations",
"doi": null,
"abstractUrl": "/proceedings-article/sive/2018/08577076/17D45VsBU4f",
"parentPublication": {
"id": "proceedings/sive/2018/5713/0",
"title": "2018 IEEE 4th VR Workshop on Sonic Interactions for Virtual Environments (SIVE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2018/9385/0/938500a296",
"title": "Big Data Analytics in Healthcare: Design and Implementation for a Hearing Aid Case Study",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2018/938500a296/19RSs2R4Q5a",
"parentPublication": {
"id": "proceedings/sitis/2018/9385/0",
"title": "2018 14th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cncit/2022/5296/0/529600a014",
"title": "A Study of Hearing Aid Fitting Formulas Based on Polynomial Approximation",
"doi": null,
"abstractUrl": "/proceedings-article/cncit/2022/529600a014/1GNuyw8GC76",
"parentPublication": {
"id": "proceedings/cncit/2022/5296/0",
"title": "2022 International Conference on Networks, Communications and Information Technology (CNCIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2022/6495/0/649500a308",
"title": "Predicting and Explaining Hearing Aid Usage Using Encoder-Decoder with Attention Mechanism and SHAP",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2022/649500a308/1MeoG3BDZ7y",
"parentPublication": {
"id": "proceedings/sitis/2022/6495/0",
"title": "2022 16th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/services/2019/3851/0/385100a307",
"title": "Improving Hearing Healthcare with Big Data Analytics of Real-Time Hearing Aid Data",
"doi": null,
"abstractUrl": "/proceedings-article/services/2019/385100a307/1cTIczQh5vi",
"parentPublication": {
"id": "proceedings/services/2019/3851/2642-939X",
"title": "2019 IEEE World Congress on Services (SERVICES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sera/2019/0798/0/08886796",
"title": "Identification of Difficult English Words for Assisting Hearing Impaired Children in Learning Language",
"doi": null,
"abstractUrl": "/proceedings-article/sera/2019/08886796/1ezRz8Cf3MI",
"parentPublication": {
"id": "proceedings/sera/2019/0798/0",
"title": "2019 IEEE 17th International Conference on Software Engineering Research, Management and Applications (SERA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icise/2020/2261/0/226100a241",
"title": "The application design of hearing aid parameters auto adaptive system for hearing impaired children based on android terminal",
"doi": null,
"abstractUrl": "/proceedings-article/icise/2020/226100a241/1tnYlALODdu",
"parentPublication": {
"id": "proceedings/icise/2020/2261/0",
"title": "2020 International Conference on Information Science and Education (ICISE-IE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08998375",
"articleId": "1hpPBdSWXTi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08998353",
"articleId": "1hpPDKs9c7C",
"__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": "1nV7LZ69x7i",
"doi": "10.1109/TVCG.2020.3030445",
"abstract": "Collaborative exploration of scientific data sets across large high-resolution displays requires both high visual detail as well as low-latency transfer of image data (oftentimes inducing the need to trade one for the other). In this work, we present a system that dynamically adapts the encoding quality in such systems in a way that reduces the required bandwidth without impacting the details perceived by one or more observers. Humans perceive sharp, colourful details, in the small foveal region around the centre of the field of view, while information in the periphery is perceived blurred and colourless. We account for this by tracking the gaze of observers, and respectively adapting the quality parameter of each macroblock used by the H.264 encoder, considering the so-called visual acuity fall-off. This allows to substantially reduce the required bandwidth with barely noticeable changes in visual quality, which is crucial for collaborative analysis across display walls at different locations. We demonstrate the reduced overall required bandwidth and the high quality inside the foveated regions using particle rendering and parallel coordinates.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Collaborative exploration of scientific data sets across large high-resolution displays requires both high visual detail as well as low-latency transfer of image data (oftentimes inducing the need to trade one for the other). In this work, we present a system that dynamically adapts the encoding quality in such systems in a way that reduces the required bandwidth without impacting the details perceived by one or more observers. Humans perceive sharp, colourful details, in the small foveal region around the centre of the field of view, while information in the periphery is perceived blurred and colourless. We account for this by tracking the gaze of observers, and respectively adapting the quality parameter of each macroblock used by the H.264 encoder, considering the so-called visual acuity fall-off. This allows to substantially reduce the required bandwidth with barely noticeable changes in visual quality, which is crucial for collaborative analysis across display walls at different locations. We demonstrate the reduced overall required bandwidth and the high quality inside the foveated regions using particle rendering and parallel coordinates.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Collaborative exploration of scientific data sets across large high-resolution displays requires both high visual detail as well as low-latency transfer of image data (oftentimes inducing the need to trade one for the other). In this work, we present a system that dynamically adapts the encoding quality in such systems in a way that reduces the required bandwidth without impacting the details perceived by one or more observers. Humans perceive sharp, colourful details, in the small foveal region around the centre of the field of view, while information in the periphery is perceived blurred and colourless. We account for this by tracking the gaze of observers, and respectively adapting the quality parameter of each macroblock used by the H.264 encoder, considering the so-called visual acuity fall-off. This allows to substantially reduce the required bandwidth with barely noticeable changes in visual quality, which is crucial for collaborative analysis across display walls at different locations. We demonstrate the reduced overall required bandwidth and the high quality inside the foveated regions using particle rendering and parallel coordinates.",
"title": "Foveated Encoding for Large High-Resolution Displays",
"normalizedTitle": "Foveated Encoding for Large High-Resolution Displays",
"fno": "09224182",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Colour Graphics",
"Computer Displays",
"Data Visualisation",
"Gaze Tracking",
"Image Colour Analysis",
"Image Resolution",
"Rendering Computer Graphics",
"Video Coding",
"High Resolution Displays",
"Scientific Data Sets",
"Encoding Quality",
"Visual Acuity Fall Off",
"Visual Quality",
"Foveated Encoding",
"Low Latency Image Data Transfer",
"Observer Gaze Tracking",
"Macroblock Quality Parameter Adjustment",
"H 264 Encoder",
"Particle Rendering",
"Parallel Coordinates",
"Visualization",
"Bandwidth",
"Encoding",
"Streaming Media",
"Image Coding",
"Hardware",
"Computational Modeling",
"Large High Resolution Displays",
"Fovetaed Encoding",
"Remote Visualisation"
],
"authors": [
{
"givenName": "Florian",
"surname": "Frieß",
"fullName": "Florian Frieß",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthias",
"surname": "Braun",
"fullName": "Matthias Braun",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valentin",
"surname": "Bruder",
"fullName": "Valentin Bruder",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steffen",
"surname": "Frey",
"fullName": "Steffen Frey",
"affiliation": "University of Groningen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guido",
"surname": "Reina",
"fullName": "Guido Reina",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Ertl",
"fullName": "Thomas Ertl",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "1850-1859",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ism/2015/0379/0/0379a101",
"title": "Fine-Grained Scalable Video Caching",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2015/0379a101/12OmNAs2tpB",
"parentPublication": {
"id": "proceedings/ism/2015/0379/0",
"title": "2015 IEEE International Symposium on Multimedia (ISM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2008/2570/0/04607566",
"title": "Encoding optimization of low resolution soccer video sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607566/12OmNqIzgUQ",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019541",
"title": "Semantic-aware adaptation scheme for soccer video over MPEG-DASH",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019541/12OmNx3q6XY",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2016/1552/0/07574700",
"title": "Efficient lightweight video packet filtering for large-scale video data delivery",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2016/07574700/12OmNxzMnVF",
"parentPublication": {
"id": "proceedings/icmew/2016/1552/0",
"title": "2016 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892319",
"title": "Adaptive 360-degree video streaming using layered video coding",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892319/12OmNyv7mbV",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600b766",
"title": "Cross-Resolution Flow Propagation for Foveated Video Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600b766/1KxV3bSa3Fm",
"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/ldav/2018/6873/0/08739215",
"title": "Adaptive Encoder Settings for Interactive Remote Visualisation on High-Resolution Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2018/08739215/1b1xbgxlBQI",
"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/icmew/2020/1485/0/09106055",
"title": "Towards View-Aware Adaptive Streaming of Holographic Content",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2020/09106055/1kwqzP7ns64",
"parentPublication": {
"id": "proceedings/icmew/2020/1485/0",
"title": "2020 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/05/09382903",
"title": "A Log-Rectilinear Transformation for Foveated 360-degree Video Streaming",
"doi": null,
"abstractUrl": "/journal/tg/2021/05/09382903/1saZxiH9uaQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2021/3283/0/328300a053",
"title": "Amortised Encoding for Large High-Resolution Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2021/328300a053/1zdPA0SVsis",
"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": "09246571",
"articleId": "1oqGlZ1Tdsc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222030",
"articleId": "1nTqvtS8DcY",
"__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": "1IHMMPUiMnu",
"doi": "10.1109/TKDE.2022.3225329",
"abstract": "Various automated bug localization technologies have recently emerged that require adequate bug-fix records available to train a predictive model. However, many projects in practice might not provide these necessities, especially for new projects in the first release, due to the expensive human effort for constructing a large amount of bug-fix records. Aiming to capture the potential relevance distribution between the bug report and code file from a limited number of available bug-fix records, we present the first semi-supervised bug localization model named BL-GAN in this paper. For this purpose, the promising Generative Adversarial Network is introduced in BL-GAN, in which synthetic bug-fix records close to the real ones are constructed by searching the project directory tree to generate file paths instead of traversing the contents of all code files. For processing bug reports, the proposed BL-GAN adopts an attention-based Transformer architecture to capture semantic and sequence information. In order to capture the proprietary structural information in code files, BL-GAN incorporates a novel multilayer Graph Convolutional Network to process the source code in a graphical view. Extensive experiments on large-scale real-world datasets reveal that our model BL-GAN significantly outperforms the state-of-the-art on all evaluation measures.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Various automated bug localization technologies have recently emerged that require adequate bug-fix records available to train a predictive model. However, many projects in practice might not provide these necessities, especially for new projects in the first release, due to the expensive human effort for constructing a large amount of bug-fix records. Aiming to capture the potential relevance distribution between the bug report and code file from a limited number of available bug-fix records, we present the first semi-supervised bug localization model named BL-GAN in this paper. For this purpose, the promising Generative Adversarial Network is introduced in BL-GAN, in which synthetic bug-fix records close to the real ones are constructed by searching the project directory tree to generate file paths instead of traversing the contents of all code files. For processing bug reports, the proposed BL-GAN adopts an attention-based Transformer architecture to capture semantic and sequence information. In order to capture the proprietary structural information in code files, BL-GAN incorporates a novel multilayer Graph Convolutional Network to process the source code in a graphical view. Extensive experiments on large-scale real-world datasets reveal that our model BL-GAN significantly outperforms the state-of-the-art on all evaluation measures.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Various automated bug localization technologies have recently emerged that require adequate bug-fix records available to train a predictive model. However, many projects in practice might not provide these necessities, especially for new projects in the first release, due to the expensive human effort for constructing a large amount of bug-fix records. Aiming to capture the potential relevance distribution between the bug report and code file from a limited number of available bug-fix records, we present the first semi-supervised bug localization model named BL-GAN in this paper. For this purpose, the promising Generative Adversarial Network is introduced in BL-GAN, in which synthetic bug-fix records close to the real ones are constructed by searching the project directory tree to generate file paths instead of traversing the contents of all code files. For processing bug reports, the proposed BL-GAN adopts an attention-based Transformer architecture to capture semantic and sequence information. In order to capture the proprietary structural information in code files, BL-GAN incorporates a novel multilayer Graph Convolutional Network to process the source code in a graphical view. Extensive experiments on large-scale real-world datasets reveal that our model BL-GAN significantly outperforms the state-of-the-art on all evaluation measures.",
"title": "BL-GAN: Semi-Supervised Bug Localization Via Generative Adversarial Network",
"normalizedTitle": "BL-GAN: Semi-Supervised Bug Localization Via Generative Adversarial Network",
"fno": "09965611",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Computer Bugs",
"Codes",
"Location Awareness",
"Generative Adversarial Networks",
"Generators",
"Task Analysis",
"Feature Extraction",
"Bug Localization",
"Bug Report",
"Generative Adversarial Network",
"Semi Supervised Learning"
],
"authors": [
{
"givenName": "Ziye",
"surname": "Zhu",
"fullName": "Ziye Zhu",
"affiliation": "Jiangsu Key Laboratory of Big Data Security and Intelligent Processing, Nanjing University of Posts and Telecommunications, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanghang",
"surname": "Tong",
"fullName": "Hanghang Tong",
"affiliation": "Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Wang",
"fullName": "Yu Wang",
"affiliation": "Jiangsu Key Laboratory of Big Data Security and Intelligent Processing, Nanjing University of Posts and Telecommunications, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun",
"surname": "Li",
"fullName": "Yun Li",
"affiliation": "Jiangsu Key Laboratory of Big Data Security and Intelligent Processing, Nanjing University of Posts and Telecommunications, Nanjing, China",
"__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": "proceedings/annsim/2022/5288/0/09859422",
"title": "Using Generative Adversarial Networks to Assist Synthetic Population Creation for Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/annsim/2022/09859422/1G4EOEjBoBy",
"parentPublication": {
"id": "proceedings/annsim/2022/5288/0",
"title": "2022 Annual Modeling and Simulation Conference (ANNSIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600l1265",
"title": "DO-GAN: A Double Oracle Framework for Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600l1265/1H1kORDwthu",
"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/ipdps/2019/1246/0/124600a866",
"title": "MD-GAN: Multi-Discriminator Generative Adversarial Networks for Distributed Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2019/124600a866/1cYhReGG1YA",
"parentPublication": {
"id": "proceedings/ipdps/2019/1246/0",
"title": "2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/03/09187695",
"title": "DE-GAN: A Conditional Generative Adversarial Network for Document Enhancement",
"doi": null,
"abstractUrl": "/journal/tp/2022/03/09187695/1mVFmWt3gGs",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2020/9228/0/922800a923",
"title": "VC-GAN: Classifying Vessel Types by Maritime Trajectories using Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a923/1pP3td7Dhuw",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09440692",
"title": "SymReg-GAN: Symmetric Image Registration With Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09440692/1tTp7JF3Mty",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412202",
"title": "DFH-GAN: A Deep Face Hashing with Generative Adversarial Network",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412202/1tmjLtNfwlO",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09411979",
"title": "MBD-GAN: Model-based image deblurring with a generative adversarial network",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09411979/1tmjO23bJzW",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2021/3864/0/09428140",
"title": "CI-GAN : Co-Clustering By Information Maximizing Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428140/1uim9HTyCSk",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2021/4121/0/412100a079",
"title": "Ret-GAN: Retinal Image Enhancement using Generative Adversarial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2021/412100a079/1vb8Vz0ZV0A",
"parentPublication": {
"id": "proceedings/cbms/2021/4121/0",
"title": "2021 IEEE 34th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09965593",
"articleId": "1IHMMHgo6NG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09966665",
"articleId": "1IIYdG1Nehy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1GjwQktLcB2",
"title": "Oct.",
"year": "2022",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1smD5kvWVjy",
"doi": "10.1109/TVCG.2021.3069195",
"abstract": "Point clouds are fundamental in the representation of 3D objects. However, they can also be highly unstructured and irregular. This makes it difficult to directly extend 2D generative models to three-dimensional space. In this article, we cast the problem of point cloud generation as a topological representation learning problem. In order to capture the representative features of 3D shapes in the latent space, we propose a hierarchical mixture model that integrates self-attention with an inference tree structure for constructing a point cloud generator. Based on this, we design a novel <italic>Generative Adversarial Network</italic> (GAN) architecture that is capable of generating recognizable point clouds in an unsupervised manner. The proposed adversarial framework (SG-GAN) relies on self-attention mechanism and <italic>Graph Convolution Network</italic> (GCN) to hierarchically infer the latent topology of 3D shapes. Embedding and transferring the global topology information in a tree framework allows our model to capture and enhance the structural connectivity. Furthermore, the proposed architecture endows our model with partially generating 3D structures. Finally, we propose two gradient penalty methods to stabilize the training of SG-GAN and overcome the possible mode collapse of GAN networks. To demonstrate the performance of our model, we present both quantitative and qualitative evaluations and show that SG-GAN is more efficient in training and it exceeds the state-of-the-art in 3D point cloud generation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Point clouds are fundamental in the representation of 3D objects. However, they can also be highly unstructured and irregular. This makes it difficult to directly extend 2D generative models to three-dimensional space. In this article, we cast the problem of point cloud generation as a topological representation learning problem. In order to capture the representative features of 3D shapes in the latent space, we propose a hierarchical mixture model that integrates self-attention with an inference tree structure for constructing a point cloud generator. Based on this, we design a novel <italic>Generative Adversarial Network</italic> (GAN) architecture that is capable of generating recognizable point clouds in an unsupervised manner. The proposed adversarial framework (SG-GAN) relies on self-attention mechanism and <italic>Graph Convolution Network</italic> (GCN) to hierarchically infer the latent topology of 3D shapes. Embedding and transferring the global topology information in a tree framework allows our model to capture and enhance the structural connectivity. Furthermore, the proposed architecture endows our model with partially generating 3D structures. Finally, we propose two gradient penalty methods to stabilize the training of SG-GAN and overcome the possible mode collapse of GAN networks. To demonstrate the performance of our model, we present both quantitative and qualitative evaluations and show that SG-GAN is more efficient in training and it exceeds the state-of-the-art in 3D point cloud generation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Point clouds are fundamental in the representation of 3D objects. However, they can also be highly unstructured and irregular. This makes it difficult to directly extend 2D generative models to three-dimensional space. In this article, we cast the problem of point cloud generation as a topological representation learning problem. In order to capture the representative features of 3D shapes in the latent space, we propose a hierarchical mixture model that integrates self-attention with an inference tree structure for constructing a point cloud generator. Based on this, we design a novel Generative Adversarial Network (GAN) architecture that is capable of generating recognizable point clouds in an unsupervised manner. The proposed adversarial framework (SG-GAN) relies on self-attention mechanism and Graph Convolution Network (GCN) to hierarchically infer the latent topology of 3D shapes. Embedding and transferring the global topology information in a tree framework allows our model to capture and enhance the structural connectivity. Furthermore, the proposed architecture endows our model with partially generating 3D structures. Finally, we propose two gradient penalty methods to stabilize the training of SG-GAN and overcome the possible mode collapse of GAN networks. To demonstrate the performance of our model, we present both quantitative and qualitative evaluations and show that SG-GAN is more efficient in training and it exceeds the state-of-the-art in 3D point cloud generation.",
"title": "SG-GAN: Adversarial Self-Attention GCN for Point Cloud Topological Parts Generation",
"normalizedTitle": "SG-GAN: Adversarial Self-Attention GCN for Point Cloud Topological Parts Generation",
"fno": "09387601",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Gallium Nitride",
"Training",
"Shape",
"Generative Adversarial Networks",
"Solid Modeling",
"Convolution",
"Generative Adversarial Network",
"Graph Convolution Network",
"Binary Tree",
"Self Attention",
"3 D Shape Generation",
"Point Cloud Learning",
"Gradient Penalty"
],
"authors": [
{
"givenName": "Yushi",
"surname": "Li",
"fullName": "Yushi Li",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hung Hom, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "George",
"surname": "Baciu",
"fullName": "George Baciu",
"affiliation": "Department of Computing, Hong Kong Polytechnic University, Hung Hom, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "3499-3512",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/micro/2018/6240/0/624000a669",
"title": "LerGAN: A Zero-Free, Low Data Movement and PIM-Based GAN Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/micro/2018/624000a669/17D45WrVgb6",
"parentPublication": {
"id": "proceedings/micro/2018/6240/0",
"title": "2018 51st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08546039",
"title": "3D Convolutional Generative Adversarial Networks for Detecting Temporal Irregularities in Videos",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08546039/17D45X7VTeW",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000a821",
"title": "FaceID-GAN: Learning a Symmetry Three-Player GAN for Identity-Preserving Face Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000a821/17D45Xh13pk",
"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/wacv/2019/1975/0/197500b099",
"title": "High Fidelity Semantic Shape Completion for Point Clouds Using Latent Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500b099/18j8FoK4oYo",
"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/2019/4803/0/480300h555",
"title": "Attributing Fake Images to GANs: Learning and Analyzing GAN Fingerprints",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h555/1hQqnMgJzcQ",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300e501",
"title": "Seeing What a GAN Cannot Generate",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300e501/1hVlGKg2532",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300d858",
"title": "3D Point Cloud Generative Adversarial Network Based on Tree Structured Graph Convolutions",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300d858/1hVllpVGDv2",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600c371",
"title": "Face Synthesis and Recognition Using Disentangled Representation-Learning Wasserstein GAN",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600c371/1iTvl3KxDBS",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093525",
"title": "FX-GAN: Self-Supervised GAN Learning via Feature Exchange",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093525/1jPbxvOsk6s",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/09/09146333",
"title": "LrGAN: A Compact and Energy Efficient PIM-Based Architecture for GAN Training",
"doi": null,
"abstractUrl": "/journal/tc/2021/09/09146333/1lFF1jOOaEU",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09372829",
"articleId": "1rNP2lp4v72",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09374711",
"articleId": "1rR7Vh9iRr2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VBJ",
"doi": "10.1109/TVCG.2014.2346312",
"abstract": "We present NeuroLines, a novel visualization technique designed for scalable detailed analysis of neuronal connectivity at the nanoscale level. The topology of 3D brain tissue data is abstracted into a multi-scale, relative distance-preserving subway map visualization that allows domain scientists to conduct an interactive analysis of neurons and their connectivity. Nanoscale connectomics aims at reverse-engineering the wiring of the brain. Reconstructing and analyzing the detailed connectivity of neurons and neurites (axons, dendrites) will be crucial for understanding the brain and its development and diseases. However, the enormous scale and complexity of nanoscale neuronal connectivity pose big challenges to existing visualization techniques in terms of scalability. NeuroLines offers a scalable visualization framework that can interactively render thousands of neurites, and that supports the detailed analysis of neuronal structures and their connectivity. We describe and analyze the design of NeuroLines based on two real-world use-cases of our collaborators in developmental neuroscience, and investigate its scalability to large-scale neuronal connectivity data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present NeuroLines, a novel visualization technique designed for scalable detailed analysis of neuronal connectivity at the nanoscale level. The topology of 3D brain tissue data is abstracted into a multi-scale, relative distance-preserving subway map visualization that allows domain scientists to conduct an interactive analysis of neurons and their connectivity. Nanoscale connectomics aims at reverse-engineering the wiring of the brain. Reconstructing and analyzing the detailed connectivity of neurons and neurites (axons, dendrites) will be crucial for understanding the brain and its development and diseases. However, the enormous scale and complexity of nanoscale neuronal connectivity pose big challenges to existing visualization techniques in terms of scalability. NeuroLines offers a scalable visualization framework that can interactively render thousands of neurites, and that supports the detailed analysis of neuronal structures and their connectivity. We describe and analyze the design of NeuroLines based on two real-world use-cases of our collaborators in developmental neuroscience, and investigate its scalability to large-scale neuronal connectivity data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present NeuroLines, a novel visualization technique designed for scalable detailed analysis of neuronal connectivity at the nanoscale level. The topology of 3D brain tissue data is abstracted into a multi-scale, relative distance-preserving subway map visualization that allows domain scientists to conduct an interactive analysis of neurons and their connectivity. Nanoscale connectomics aims at reverse-engineering the wiring of the brain. Reconstructing and analyzing the detailed connectivity of neurons and neurites (axons, dendrites) will be crucial for understanding the brain and its development and diseases. However, the enormous scale and complexity of nanoscale neuronal connectivity pose big challenges to existing visualization techniques in terms of scalability. NeuroLines offers a scalable visualization framework that can interactively render thousands of neurites, and that supports the detailed analysis of neuronal structures and their connectivity. We describe and analyze the design of NeuroLines based on two real-world use-cases of our collaborators in developmental neuroscience, and investigate its scalability to large-scale neuronal connectivity data.",
"title": "NeuroLines: A Subway Map Metaphor for Visualizing Nanoscale Neuronal Connectivity",
"normalizedTitle": "NeuroLines: A Subway Map Metaphor for Visualizing Nanoscale Neuronal Connectivity",
"fno": "06875935",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biology Computing",
"Brain Models",
"Data Visualisation",
"Interactive Systems",
"Neural Nets",
"Neurophysiology",
"Rendering Computer Graphics",
"Reverse Engineering",
"Neuro Lines",
"Subway Map Metaphor",
"Nanoscale Neuronal Connectivity Visualization",
"3 D Brain Tissue Data Topology",
"Multiscale Relative Distance Preserving Subway Map Visualization",
"Nanoscale Connectomics",
"Reverse Engineering",
"Neurons",
"Neurites",
"Interactive Rendering",
"Developmental Neuroscience",
"Large Scale Neuronal Connectivity Data",
"Data Visualization",
"Three Dimensional Displays",
"Nerve Fibers",
"Neurophysiology",
"Navigation",
"Scalability",
"Nanoscale Devices",
"Connectomics",
"Neuroscience",
"Data Abstraction",
"Multi Trees",
"Focus Context"
],
"authors": [
{
"givenName": "Ali K.",
"surname": "Al-Awami",
"fullName": "Ali K. Al-Awami",
"affiliation": "King Abdullah University of Science and Technology (KAUST)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johanna",
"surname": "Beyer",
"fullName": "Johanna Beyer",
"affiliation": "School of Engineering and Applied Sciences at Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hendrik",
"surname": "Strobelt",
"fullName": "Hendrik Strobelt",
"affiliation": "School of Engineering and Applied Sciences at Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Narayanan",
"surname": "Kasthuri",
"fullName": "Narayanan Kasthuri",
"affiliation": "Center for Brain Science at Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeff W.",
"surname": "Lichtman",
"fullName": "Jeff W. Lichtman",
"affiliation": "Center for Brain Science at Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "School of Engineering and Applied Sciences at Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Hadwiger",
"fullName": "Markus Hadwiger",
"affiliation": "King Abdullah University of Science and Technology (KAUST)",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2369-2378",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccad/2006/3891/0/04110131",
"title": "Information Processing in Nanoscale Arrays: DNA Assembly, Molecular Devices, Nano-Array Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/2006/04110131/12OmNwAt1Dl",
"parentPublication": {
"id": "proceedings/iccad/2006/3891/0",
"title": "Computer-Aided Design, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpca/2013/5585/0/06522342",
"title": "Bridging the semantic gap: Emulating biological neuronal behaviors with simple digital neurons",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2013/06522342/12OmNwHQB6l",
"parentPublication": {
"id": "proceedings/hpca/2013/5585/0",
"title": "2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200ding",
"title": "Case Study: Reconstruction,Visualization, and Quantification of Neuronal Fiber Pathways",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200ding/12OmNxX3usx",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dft/2011/1713/0/06104443",
"title": "Efficient Function Mapping in Nanoscale Crossbar Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/dft/2011/06104443/12OmNzTppFP",
"parentPublication": {
"id": "proceedings/dft/2011/1713/0",
"title": "2011 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visap/2017/3490/0/08282373",
"title": "Glitch style visualization of disrupted neuronal connectivity in Parkinson's disease",
"doi": null,
"abstractUrl": "/proceedings-article/visap/2017/08282373/12OmNzlUKvc",
"parentPublication": {
"id": "proceedings/visap/2017/3490/0",
"title": "2017 IEEE VIS Arts Program (VISAP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017643",
"title": "Abstractocyte: A Visual Tool for Exploring Nanoscale Astroglial Cells",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017643/13rRUwI5U7Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/dt/2008/06/mdt2008060549",
"title": "Defect Tolerance for Nanoscale Crossbar-Based Devices",
"doi": null,
"abstractUrl": "/magazine/dt/2008/06/mdt2008060549/13rRUxBJhqF",
"parentPublication": {
"id": "mags/dt",
"title": "IEEE Design & Test of Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122868",
"title": "ConnectomeExplorer: Query-Guided Visual Analysis of Large Volumetric Neuroscience Data",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122868/13rRUxcbnCq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccta/2007/2770/0/04127430",
"title": "Current Status and Future Trends of Nanoscale Technology and Its Impact on Modern Computing, Biology, Medicine and Agricultural Biotechnology",
"doi": null,
"abstractUrl": "/proceedings-article/iccta/2007/04127430/17D45WcjjQ4",
"parentPublication": {
"id": "proceedings/iccta/2007/2770/0",
"title": "International Conference on Computing: Theory and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2020/12/09096622",
"title": "Revisiting Stochastic Computing in the Era of Nanoscale Nonvolatile Technologies",
"doi": null,
"abstractUrl": "/journal/si/2020/12/09096622/1jXr7lBkD8A",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876050",
"articleId": "13rRUxDqS8j",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06876031",
"articleId": "13rRUynHujd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet5R",
"name": "ttg201412-06875935s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06875935s1.zip",
"extension": "zip",
"size": "46.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1HMOit1lSk8",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1wB2yTuC5Q4",
"doi": "10.1109/TVCG.2021.3109460",
"abstract": "We introduce NeuroConstruct, a novel end-to-end application for the segmentation, registration, and visualization of brain volumes imaged using wide-field microscopy. NeuroConstruct offers a Segmentation Toolbox with various annotation helper functions that aid experts to effectively and precisely annotate micrometer resolution neurites. It also offers an automatic neurites segmentation using convolutional neuronal networks (CNN) trained by the Toolbox annotations and somas segmentation using thresholding. To visualize neurites in a given volume, NeuroConstruct offers a hybrid rendering by combining iso-surface rendering of high-confidence classified neurites, along with real-time rendering of raw volume using a 2D transfer function for voxel classification score versus voxel intensity value. For a complete reconstruction of the 3D neurites, we introduce a Registration Toolbox that provides automatic coarse-to-fine alignment of serially sectioned samples. The quantitative and qualitative analysis show that NeuroConstruct outperforms the state-of-the-art in all design aspects. NeuroConstruct was developed as a collaboration between computer scientists and neuroscientists, with an application to the study of cholinergic neurons, which are severely affected in Alzheimer's disease.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce NeuroConstruct, a novel end-to-end application for the segmentation, registration, and visualization of brain volumes imaged using wide-field microscopy. NeuroConstruct offers a Segmentation Toolbox with various annotation helper functions that aid experts to effectively and precisely annotate micrometer resolution neurites. It also offers an automatic neurites segmentation using convolutional neuronal networks (CNN) trained by the Toolbox annotations and somas segmentation using thresholding. To visualize neurites in a given volume, NeuroConstruct offers a hybrid rendering by combining iso-surface rendering of high-confidence classified neurites, along with real-time rendering of raw volume using a 2D transfer function for voxel classification score versus voxel intensity value. For a complete reconstruction of the 3D neurites, we introduce a Registration Toolbox that provides automatic coarse-to-fine alignment of serially sectioned samples. The quantitative and qualitative analysis show that NeuroConstruct outperforms the state-of-the-art in all design aspects. NeuroConstruct was developed as a collaboration between computer scientists and neuroscientists, with an application to the study of cholinergic neurons, which are severely affected in Alzheimer's disease.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce NeuroConstruct, a novel end-to-end application for the segmentation, registration, and visualization of brain volumes imaged using wide-field microscopy. NeuroConstruct offers a Segmentation Toolbox with various annotation helper functions that aid experts to effectively and precisely annotate micrometer resolution neurites. It also offers an automatic neurites segmentation using convolutional neuronal networks (CNN) trained by the Toolbox annotations and somas segmentation using thresholding. To visualize neurites in a given volume, NeuroConstruct offers a hybrid rendering by combining iso-surface rendering of high-confidence classified neurites, along with real-time rendering of raw volume using a 2D transfer function for voxel classification score versus voxel intensity value. For a complete reconstruction of the 3D neurites, we introduce a Registration Toolbox that provides automatic coarse-to-fine alignment of serially sectioned samples. The quantitative and qualitative analysis show that NeuroConstruct outperforms the state-of-the-art in all design aspects. NeuroConstruct was developed as a collaboration between computer scientists and neuroscientists, with an application to the study of cholinergic neurons, which are severely affected in Alzheimer's disease.",
"title": "NeuroConstruct: 3D Reconstruction and Visualization of Neurites in Optical Microscopy Brain Images",
"normalizedTitle": "NeuroConstruct: 3D Reconstruction and Visualization of Neurites in Optical Microscopy Brain Images",
"fno": "09529035",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biological Tissues",
"Biomedical Optical Imaging",
"Brain",
"Cellular Biophysics",
"Data Visualisation",
"Diseases",
"Image Classification",
"Image Reconstruction",
"Image Registration",
"Image Segmentation",
"Medical Image Processing",
"Neurophysiology",
"Optical Microscopy",
"Rendering Computer Graphics",
"3 D Reconstruction",
"Annotate Micrometer Resolution Neurites",
"Annotation Helper Functions",
"Automatic Neurites Segmentation",
"Brain Volumes",
"Given Volume",
"High Confidence Classified Neurites",
"Iso Surface Rendering",
"Neuro Construct",
"Novel End To End Application",
"Optical Microscopy Brain",
"Raw Volume",
"Registration Toolbox",
"Segmentation Toolbox",
"Somas Segmentation",
"Toolbox Annotations",
"Voxel Classification Score Versus Voxel Intensity Value",
"Wide Field Microscopy",
"Neurites",
"Image Segmentation",
"Three Dimensional Displays",
"Rendering Computer Graphics",
"Microscopy",
"Image Reconstruction",
"Visualization",
"Wide Field Microscopy",
"Neuron Morphology",
"Segmentation",
"Registration",
"Hybrid Volume Rendering",
"CNN"
],
"authors": [
{
"givenName": "Parmida",
"surname": "Ghahremani",
"fullName": "Parmida Ghahremani",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Saeed",
"surname": "Boorboor",
"fullName": "Saeed Boorboor",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pooya",
"surname": "Mirhosseini",
"fullName": "Pooya Mirhosseini",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chetan",
"surname": "Gudisagar",
"fullName": "Chetan Gudisagar",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mala",
"surname": "Ananth",
"fullName": "Mala Ananth",
"affiliation": "National Institutes of Health, Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Talmage",
"fullName": "David Talmage",
"affiliation": "National Institutes of Health, Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lorna W.",
"surname": "Role",
"fullName": "Lorna W. Role",
"affiliation": "National Institutes of Health, Bethesda, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arie E.",
"surname": "Kaufman",
"fullName": "Arie E. Kaufman",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4951-4965",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2017/1324/0/132401a139",
"title": "3D Segmentation,Visualization and Quantitative Analysis of Differentiation Activity for Mouse Embryonic Stem Cells using Time-Lapse Fluorescence Microscopy Images",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2017/132401a139/12OmNA0vnUP",
"parentPublication": {
"id": "proceedings/bibe/2017/1324/0",
"title": "2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbmsys/1990/9040/0/00109402",
"title": "Interactive visualization of three-dimensional SPECT cardiac images",
"doi": null,
"abstractUrl": "/proceedings-article/cbmsys/1990/00109402/12OmNC2fGwT",
"parentPublication": {
"id": "proceedings/cbmsys/1990/9040/0",
"title": "1990 Proceedings Third Annual IEEE Symposium on Computer-Based Medical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vbc/1990/2039/0/00109297",
"title": "Surface shading in tomographic volume visualization: a comparative study",
"doi": null,
"abstractUrl": "/proceedings-article/vbc/1990/00109297/12OmNCdBDNO",
"parentPublication": {
"id": "proceedings/vbc/1990/2039/0",
"title": "[1990] Proceedings of the First Conference on Visualization in Biomedical Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08217780",
"title": "3D workflow for segmentation and interactive visualization in brain MR images using multiphase active contours",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08217780/12OmNs0TL1K",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2012/4778/0/4778a062",
"title": "An Automated Adaption of K-means Based Hybrid Segmentation System into Direct Volume Rendering Object Distinction Mode for Enhanced Visualization Effect",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2012/4778a062/12OmNvkpljM",
"parentPublication": {
"id": "proceedings/cgiv/2012/4778/0",
"title": "2012 Ninth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/04/mcg2013040050",
"title": "Exploring the Connectome: Petascale Volume Visualization of Microscopy Data Streams",
"doi": null,
"abstractUrl": "/magazine/cg/2013/04/mcg2013040050/13rRUEgarDL",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061489",
"title": "An interactive visualization tool for multi-channel confocal microscopy data in neurobiology research",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061489/13rRUNvgz4b",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/04/ttg2008040863",
"title": "Reconstruction of Cellular Biological Structures from Optical Microscopy Data",
"doi": null,
"abstractUrl": "/journal/tg/2008/04/ttg2008040863/13rRUwInvsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440805",
"title": "Visualization of Neuronal Structures in Wide-Field Microscopy Brain Images",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440805/17D45WnnFUX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09992117",
"title": "GPU Accelerated 3D Tomographic Reconstruction and Visualization from Noisy Electron Microscopy Tilt-Series",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09992117/1JevBim1nIA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09528986",
"articleId": "1wB2y6gUCqs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09531544",
"articleId": "1wJl2dHzjrO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HMOQDmkqfm",
"name": "ttg202212-09529035s1-supp2-3109460.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09529035s1-supp2-3109460.mp4",
"extension": "mp4",
"size": "35 MB",
"__typename": "WebExtraType"
},
{
"id": "1HMOQOf2WqI",
"name": "ttg202212-09529035s1-supp1-3109460.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09529035s1-supp1-3109460.pdf",
"extension": "pdf",
"size": "3.37 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Jv6pC6iiPe",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xjQYixG2Lm",
"doi": "10.1109/TVCG.2021.3116656",
"abstract": "Dendritic spines are dynamic, submicron-scale protrusions on neuronal dendrites that receive neuronal inputs. Morphological changes in the dendritic spine often reflect alterations in physiological conditions and are indicators of various neuropsychiatric conditions. However, owing to the highly dynamic and heterogeneous nature of spines, accurate measurement and objective analysis of spine morphology are major challenges in neuroscience research. Most conventional approaches for analyzing dendritic spines are based on two-dimensional (2D) images, which barely reflect the actual three-dimensional (3D) shapes. Although some recent studies have attempted to analyze spines with various 3D-based features, it is still difficult to objectively categorize and analyze spines based on 3D morphology. Here, we propose a unified visualization framework for an interactive 3D dendritic spine analysis system, <italic>DXplorer</italic>, that displays 3D rendering of spines and plots the high-dimensional features extracted from the 3D mesh of spines. With this system, users can perform the clustering of spines interactively and explore and analyze dendritic spines based on high-dimensional features. We propose a series of high-dimensional morphological features extracted from a 3D mesh of dendritic spines. In addition, an interactive machine learning classifier with visual exploration and user feedback using an interactive 3D mesh grid view ensures a more precise classification based on the spine phenotype. A user study and two case studies were conducted to quantitatively verify the performance and usability of the <italic>DXplorer</italic>. We demonstrate that the system performs the entire analytic process effectively and provides high-quality, accurate, and objective analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dendritic spines are dynamic, submicron-scale protrusions on neuronal dendrites that receive neuronal inputs. Morphological changes in the dendritic spine often reflect alterations in physiological conditions and are indicators of various neuropsychiatric conditions. However, owing to the highly dynamic and heterogeneous nature of spines, accurate measurement and objective analysis of spine morphology are major challenges in neuroscience research. Most conventional approaches for analyzing dendritic spines are based on two-dimensional (2D) images, which barely reflect the actual three-dimensional (3D) shapes. Although some recent studies have attempted to analyze spines with various 3D-based features, it is still difficult to objectively categorize and analyze spines based on 3D morphology. Here, we propose a unified visualization framework for an interactive 3D dendritic spine analysis system, <italic>DXplorer</italic>, that displays 3D rendering of spines and plots the high-dimensional features extracted from the 3D mesh of spines. With this system, users can perform the clustering of spines interactively and explore and analyze dendritic spines based on high-dimensional features. We propose a series of high-dimensional morphological features extracted from a 3D mesh of dendritic spines. In addition, an interactive machine learning classifier with visual exploration and user feedback using an interactive 3D mesh grid view ensures a more precise classification based on the spine phenotype. A user study and two case studies were conducted to quantitatively verify the performance and usability of the <italic>DXplorer</italic>. We demonstrate that the system performs the entire analytic process effectively and provides high-quality, accurate, and objective analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dendritic spines are dynamic, submicron-scale protrusions on neuronal dendrites that receive neuronal inputs. Morphological changes in the dendritic spine often reflect alterations in physiological conditions and are indicators of various neuropsychiatric conditions. However, owing to the highly dynamic and heterogeneous nature of spines, accurate measurement and objective analysis of spine morphology are major challenges in neuroscience research. Most conventional approaches for analyzing dendritic spines are based on two-dimensional (2D) images, which barely reflect the actual three-dimensional (3D) shapes. Although some recent studies have attempted to analyze spines with various 3D-based features, it is still difficult to objectively categorize and analyze spines based on 3D morphology. Here, we propose a unified visualization framework for an interactive 3D dendritic spine analysis system, DXplorer, that displays 3D rendering of spines and plots the high-dimensional features extracted from the 3D mesh of spines. With this system, users can perform the clustering of spines interactively and explore and analyze dendritic spines based on high-dimensional features. We propose a series of high-dimensional morphological features extracted from a 3D mesh of dendritic spines. In addition, an interactive machine learning classifier with visual exploration and user feedback using an interactive 3D mesh grid view ensures a more precise classification based on the spine phenotype. A user study and two case studies were conducted to quantitatively verify the performance and usability of the DXplorer. We demonstrate that the system performs the entire analytic process effectively and provides high-quality, accurate, and objective analysis.",
"title": "DXplorer: A Unified Visualization Framework for Interactive Dendritic Spine Analysis Using 3D Morphological Features",
"normalizedTitle": "DXplorer: A Unified Visualization Framework for Interactive Dendritic Spine Analysis Using 3D Morphological Features",
"fno": "09555234",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biomedical Optical Imaging",
"Data Visualisation",
"Dendrites",
"Feature Extraction",
"Image Classification",
"Learning Artificial Intelligence",
"Medical Image Processing",
"Neurophysiology",
"Rendering Computer Graphics",
"3 D Morphological Features",
"High Dimensional Features",
"High Dimensional Morphological Features",
"Interactive 3 D Mesh Grid View",
"Interactive Dendritic Spine Analysis",
"Neuronal Dendrites",
"Objective Analysis",
"Spine Morphology",
"Spine Phenotype",
"Spines",
"Three Dimensional Shapes",
"Unified Visualization Framework",
"Three Dimensional Displays",
"Feature Extraction",
"Head",
"Neck",
"Morphology",
"Shape",
"Visualization",
"Biomedical And Medical Visualization",
"Machine Learning",
"Task And Requirements Analysis",
"User Interfaces",
"Intelligence Analysis"
],
"authors": [
{
"givenName": "JunYoung",
"surname": "Choi",
"fullName": "JunYoung Choi",
"affiliation": "Ulsan National Institute of Science and Technology, Ulsan, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sang-Eun",
"surname": "Lee",
"fullName": "Sang-Eun Lee",
"affiliation": "Seoul National University College of Medicine, Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "YeIn",
"surname": "Lee",
"fullName": "YeIn Lee",
"affiliation": "Korea University, Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eunji",
"surname": "Cho",
"fullName": "Eunji Cho",
"affiliation": "Seoul National University College of Medicine, Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sunghoe",
"surname": "Chang",
"fullName": "Sunghoe Chang",
"affiliation": "Seoul National University College of Medicine, Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Won-Ki",
"surname": "Jeong",
"fullName": "Won-Ki Jeong",
"affiliation": "Korea University, Seoul, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1424-1437",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wacv/2014/4985/0/06836066",
"title": "Viewpoint-independent book spine segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2014/06836066/12OmNCwCLld",
"parentPublication": {
"id": "proceedings/wacv/2014/4985/0",
"title": "2014 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2015/7143/0/7143a374",
"title": "Detection and Evaluation on the Spine Tracking Accuracy during Image-Guided Radiation Therapy",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2015/7143a374/12OmNrHSD3n",
"parentPublication": {
"id": "proceedings/icmtma/2015/7143/0",
"title": "2015 Seventh International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2010/4360/0/4360a066",
"title": "Statistic Model of the Spine in Three-Dimension Geometry",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2010/4360a066/12OmNvSbBuL",
"parentPublication": {
"id": "proceedings/isise/2010/4360/0",
"title": "2010 Third International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/4/252140715",
"title": "Detection of presynaptic terminals on dendritic spines in double labeling confocal images",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252140715/12OmNyUnEGA",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/4",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2000/0484/0/04840255",
"title": "Use of Shape Models to Search Digitized Spine X-rays",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2000/04840255/12OmNzRHOU2",
"parentPublication": {
"id": "proceedings/cbms/2000/0484/0",
"title": "Proceedings 13th IEEE Symposium on Computer-Based Medical Systems. CBMS 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/2001/7237/0/00982391",
"title": "Human spine posture estimation from video images based on connected vertebra spheres model",
"doi": null,
"abstractUrl": "/proceedings-article/ca/2001/00982391/12OmNzmtWw6",
"parentPublication": {
"id": "proceedings/ca/2001/7237/0",
"title": "Proceedings Computer Animation 2001. Fourteenth Conference on Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000a430",
"title": "Disentangling 3D Pose in a Dendritic CNN for Unconstrained 2D Face Alignment",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000a430/17D45XacGk8",
"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/aemcse/2022/8474/0/847400a696",
"title": "Multi-perspectives 2D Spine CT images Segmentation of 3D Fuse Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/aemcse/2022/847400a696/1IlOgb601Fe",
"parentPublication": {
"id": "proceedings/aemcse/2022/8474/0",
"title": "2022 5th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933795",
"title": "Interactive Dendritic Spine Analysis Based on 3D Morphological Features",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933795/1fTgFVHfgPe",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cogmi/2020/4144/0/414400a198",
"title": "Artificial Dendrites: an Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/cogmi/2020/414400a198/1qyxRaymb7O",
"parentPublication": {
"id": "proceedings/cogmi/2020/4144/0",
"title": "2020 IEEE Second International Conference on Cognitive Machine Intelligence (CogMI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09551731",
"articleId": "1xgx3DIeexq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09557828",
"articleId": "1xquHkBQ2xa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jv6tIOryqA",
"name": "ttg202302-09555234s1-supp1-3116656.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202302-09555234s1-supp1-3116656.mp4",
"extension": "mp4",
"size": "269 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyv7moW",
"title": "Sept.",
"year": "2019",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvl8",
"doi": "10.1109/TVCG.2018.2856744",
"abstract": "We present a volume exploration framework, FeatureLego, that uses a novel voxel clustering approach for efficient selection of semantic features. We partition the input volume into a set of compact super-voxels that represent the finest selection granularity. We then perform an exhaustive clustering of these super-voxels using a graph-based clustering method. Unlike the prevalent brute-force parameter sampling approaches, we propose an efficient algorithm to perform this exhaustive clustering. By computing an exhaustive set of clusters, we aim to capture as many boundaries as possible and ensure that the user has sufficient options for efficiently selecting semantically relevant features. Furthermore, we merge all the computed clusters into a single tree of meta-clusters that can be used for hierarchical exploration. We implement an intuitive user-interface to interactively explore volumes using our clustering approach. Finally, we show the effectiveness of our framework on multiple real-world datasets of different modalities.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a volume exploration framework, FeatureLego, that uses a novel voxel clustering approach for efficient selection of semantic features. We partition the input volume into a set of compact super-voxels that represent the finest selection granularity. We then perform an exhaustive clustering of these super-voxels using a graph-based clustering method. Unlike the prevalent brute-force parameter sampling approaches, we propose an efficient algorithm to perform this exhaustive clustering. By computing an exhaustive set of clusters, we aim to capture as many boundaries as possible and ensure that the user has sufficient options for efficiently selecting semantically relevant features. Furthermore, we merge all the computed clusters into a single tree of meta-clusters that can be used for hierarchical exploration. We implement an intuitive user-interface to interactively explore volumes using our clustering approach. Finally, we show the effectiveness of our framework on multiple real-world datasets of different modalities.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a volume exploration framework, FeatureLego, that uses a novel voxel clustering approach for efficient selection of semantic features. We partition the input volume into a set of compact super-voxels that represent the finest selection granularity. We then perform an exhaustive clustering of these super-voxels using a graph-based clustering method. Unlike the prevalent brute-force parameter sampling approaches, we propose an efficient algorithm to perform this exhaustive clustering. By computing an exhaustive set of clusters, we aim to capture as many boundaries as possible and ensure that the user has sufficient options for efficiently selecting semantically relevant features. Furthermore, we merge all the computed clusters into a single tree of meta-clusters that can be used for hierarchical exploration. We implement an intuitive user-interface to interactively explore volumes using our clustering approach. Finally, we show the effectiveness of our framework on multiple real-world datasets of different modalities.",
"title": "FeatureLego: Volume Exploration Using Exhaustive Clustering of Super-Voxels",
"normalizedTitle": "FeatureLego: Volume Exploration Using Exhaustive Clustering of Super-Voxels",
"fno": "08412138",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Feature Selection",
"Graph Theory",
"Pattern Clustering",
"User Interfaces",
"Exhaustive Clustering",
"Volume Exploration Framework",
"Feature Lego",
"Compact Super Voxels",
"Exhaustive Set",
"Computed Clusters",
"Meta Clusters",
"Hierarchical Exploration",
"Voxel Clustering Approach",
"Selection Granularity",
"Semantic Features Selection",
"Graph Based Clustering Method",
"Intuitive User Interface",
"Clustering Algorithms",
"Feature Extraction",
"Semantics",
"Histograms",
"Two Dimensional Displays",
"Three Dimensional Displays",
"Visualization",
"Volume Visualization",
"Hierarchical Exploration",
"Voxel Clustering"
],
"authors": [
{
"givenName": "Shreeraj",
"surname": "Jadhav",
"fullName": "Shreeraj Jadhav",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Saad",
"surname": "Nadeem",
"fullName": "Saad Nadeem",
"affiliation": "Department of Medical Physics, Memorial Sloan Kettering Cancer Center, New York, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arie",
"surname": "Kaufman",
"fullName": "Arie Kaufman",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2019-09-01 00:00:00",
"pubType": "trans",
"pages": "2725-2737",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wacv/2015/6683/0/6683b076",
"title": "Multiscale Superpixels and Supervoxels Based on Hierarchical Edge-Weighted Centroidal Voronoi Tessellation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2015/6683b076/12OmNBCqbE5",
"parentPublication": {
"id": "proceedings/wacv/2015/6683/0",
"title": "2015 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742369",
"title": "Static correlation visualization for large time-varying volume data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742369/12OmNCbCrZa",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2017/2610/0/261001a234",
"title": "Static and Dynamic Objects Analysis as a 3D Vector Field",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a234/12OmNy1SFDv",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2010/4080/1/05571060",
"title": "3D Discrete Spherical Fourier Descriptors Based on Surface Curvature Voxels for Pollen Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2010/05571060/13bd1rsER1q",
"parentPublication": {
"id": "proceedings/icie/2010/4080/1",
"title": "Information Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440038",
"title": "Dynamic Volume Lines: Visual Comparison of 3D Volumes through Space-filling Curves",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440038/17D45WrVgbN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/04/08611135",
"title": "Querying Representative and Informative Super-Pixels for Filament Segmentation in Bioimages",
"doi": null,
"abstractUrl": "/journal/tb/2020/04/08611135/17D45Wt3EwA",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/met/2019/2235/0/223500a048",
"title": "Metamorphic Exploration of an Unsupervised Clustering Program",
"doi": null,
"abstractUrl": "/proceedings-article/met/2019/223500a048/1cdNQCJ3txm",
"parentPublication": {
"id": "proceedings/met/2019/2235/0",
"title": "2019 IEEE/ACM 4th International Workshop on Metamorphic Testing (MET)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/11/08425790",
"title": "Non-Exhaustive, Overlapping Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2019/11/08425790/1dR0SEZN1Oo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300j255",
"title": "3D Instance Segmentation via Multi-Task Metric Learning",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300j255/1hVlUFvBONO",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600c033",
"title": "Adapting Image Super-Resolution State-Of-The-Arts and Learning Multi-Model Ensemble for Video Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600c033/1iTvjxR0mWI",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08419325",
"articleId": "13rRUxBa56e",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08419285",
"articleId": "13rRUyYBlgE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4pvgUYiZi",
"name": "ttg201909-08412138s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201909-08412138s1.mp4",
"extension": "mp4",
"size": "43.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvpew5m",
"title": "Sept.",
"year": "2015",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "37",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3xY9i",
"doi": "10.1109/TPAMI.2014.2382104",
"abstract": "We present efficient graph cut algorithms for three problems: (1) finding a region in an image, so that the histogram (or distribution) of an image feature within the region most closely matches a given model; (2) co-segmentation of image pairs and (3) interactive image segmentation with a user-provided bounding box. Each algorithm seeks the optimum of a global cost function based on the Bhattacharyya measure, a convenient alternative to other matching measures such as the Kullback–Leibler divergence. Our functionals are not directly amenable to graph cut optimization as they contain non-linear functions of fractional terms, which make the ensuing optimization problems challenging. We first derive a family of parametric bounds of the Bhattacharyya measure by introducing an auxiliary labeling. Then, we show that these bounds are auxiliary functions of the Bhattacharyya measure, a result which allows us to solve each problem efficiently via graph cuts. We show that the proposed optimization procedures converge within very few graph cut iterations. Comprehensive and various experiments, including quantitative and comparative evaluations over two databases, demonstrate the advantages of the proposed algorithms over related works in regard to optimality, computational load, accuracy and flexibility.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present efficient graph cut algorithms for three problems: (1) finding a region in an image, so that the histogram (or distribution) of an image feature within the region most closely matches a given model; (2) co-segmentation of image pairs and (3) interactive image segmentation with a user-provided bounding box. Each algorithm seeks the optimum of a global cost function based on the Bhattacharyya measure, a convenient alternative to other matching measures such as the Kullback–Leibler divergence. Our functionals are not directly amenable to graph cut optimization as they contain non-linear functions of fractional terms, which make the ensuing optimization problems challenging. We first derive a family of parametric bounds of the Bhattacharyya measure by introducing an auxiliary labeling. Then, we show that these bounds are auxiliary functions of the Bhattacharyya measure, a result which allows us to solve each problem efficiently via graph cuts. We show that the proposed optimization procedures converge within very few graph cut iterations. Comprehensive and various experiments, including quantitative and comparative evaluations over two databases, demonstrate the advantages of the proposed algorithms over related works in regard to optimality, computational load, accuracy and flexibility.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present efficient graph cut algorithms for three problems: (1) finding a region in an image, so that the histogram (or distribution) of an image feature within the region most closely matches a given model; (2) co-segmentation of image pairs and (3) interactive image segmentation with a user-provided bounding box. Each algorithm seeks the optimum of a global cost function based on the Bhattacharyya measure, a convenient alternative to other matching measures such as the Kullback–Leibler divergence. Our functionals are not directly amenable to graph cut optimization as they contain non-linear functions of fractional terms, which make the ensuing optimization problems challenging. We first derive a family of parametric bounds of the Bhattacharyya measure by introducing an auxiliary labeling. Then, we show that these bounds are auxiliary functions of the Bhattacharyya measure, a result which allows us to solve each problem efficiently via graph cuts. We show that the proposed optimization procedures converge within very few graph cut iterations. Comprehensive and various experiments, including quantitative and comparative evaluations over two databases, demonstrate the advantages of the proposed algorithms over related works in regard to optimality, computational load, accuracy and flexibility.",
"title": "Distribution Matching with the Bhattacharyya Similarity: A Bound Optimization Framework",
"normalizedTitle": "Distribution Matching with the Bhattacharyya Similarity: A Bound Optimization Framework",
"fno": "06987271",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Segmentation",
"Optimization",
"Histograms",
"Motion Segmentation",
"Image Color Analysis",
"Context",
"Active Contours",
"Bhattacharyya Measure",
"Graph Cuts",
"Bound Optimization",
"Auxiliary Functions"
],
"authors": [
{
"givenName": "Ismail Ben",
"surname": "Ayed",
"fullName": "Ismail Ben Ayed",
"affiliation": "GE Healthcare, London, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kumaradevan",
"surname": "Punithakumar",
"fullName": "Kumaradevan Punithakumar",
"affiliation": ", University of Alberta, Edmonton, AB, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuo",
"surname": "Li",
"fullName": "Shuo Li",
"affiliation": ", GE Healthcare, London, ON, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2015-09-01 00:00:00",
"pubType": "trans",
"pages": "1777-1791",
"year": "2015",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/mines/2010/4258/0/4258a035",
"title": "Fast Texture Segmentation Based on Semi-local Region Descriptor and Active Contour Driven by the Bhattacharyya Distance",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2010/4258a035/12OmNAndimG",
"parentPublication": {
"id": "proceedings/mines/2010/4258/0",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2003/1950/2/195021056",
"title": "Tracking Objects Using Density Matching and Shape Priors",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2003/195021056/12OmNApcugo",
"parentPublication": {
"id": "proceedings/iccv/2003/1950/2",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459196",
"title": "Kernel active contour",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459196/12OmNxGSmg4",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2010/6984/0/05540045",
"title": "Graph cut segmentation with a global constraint: Recovering region distribution via a bound of the Bhattacharyya measure",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2010/05540045/12OmNxiKs63",
"parentPublication": {
"id": "proceedings/cvpr/2010/6984/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761860",
"title": "Similarity-based matching for face authentication",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761860/12OmNxwWoAh",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284951",
"title": "Special Effects in Film Making with Object Based Transformations",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284951/12OmNyY4rw0",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2015/6658/0/6658a339",
"title": "An FPGA-Based Architecture for Local Similarity Measure for Image/Video Processing Applications",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2015/6658a339/12OmNzdoMzq",
"parentPublication": {
"id": "proceedings/vlsid/2015/6658/0",
"title": "2015 28th International Conference on VLSI Design (VLSID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761726",
"title": "Graph cut based deformable model with statistical shape priors",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761726/12OmNzvz6DN",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600j162",
"title": "Transferability Estimation using Bhattacharyya Class Separability",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600j162/1H1jqDZkzxC",
"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/tg/2023/03/09614998",
"title": "Volume Exploration Using Multidimensional Bhattacharyya Flow",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09614998/1yyho7vk3cs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07001064",
"articleId": "13rRUNvgzb6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07005530",
"articleId": "13rRUxASuUf",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1M9lzdB6MmI",
"title": "March-April",
"year": "2023",
"issueNum": "02",
"idPrefix": "sc",
"pubType": "journal",
"volume": "16",
"label": "March-April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DgjvFwHct2",
"doi": "10.1109/TSC.2022.3173791",
"abstract": "Linux Seccomp is widely used by the program developers and the system maintainers to secure the operating systems, which can block unused syscalls for different applications and containers to shrink the attack surface of the operating systems. However, it is difficult to configure the whitelist of a container or application without the help of program developers. Docker containers block about only 50 syscalls by default, and lots of unblocked useless syscalls introduce a big kernel attack surface. To obtain the dependent syscalls, dynamic tracking is a straight-forward approach but it cannot get the full syscall list. Static analysis can construct an over-approximated syscall list, but the list contains many false positives. In this paper, a systematic dependent syscall analysis approach, sysverify, is proposed by combining static analysis and dynamic verification together to shrink the kernel attack surface. The semantic gap between the binary executables and syscalls is bridged by analyzing the binary and the source code, which builds the mapping between the library APIs and syscalls systematically. To further reduce the attack surface at best effort, we propose a dynamic verification approach to intercept and analyze the security of the invocations of indirect-call-related or rarely invoked syscalls with low overhead.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Linux Seccomp is widely used by the program developers and the system maintainers to secure the operating systems, which can block unused syscalls for different applications and containers to shrink the attack surface of the operating systems. However, it is difficult to configure the whitelist of a container or application without the help of program developers. Docker containers block about only 50 syscalls by default, and lots of unblocked useless syscalls introduce a big kernel attack surface. To obtain the dependent syscalls, dynamic tracking is a straight-forward approach but it cannot get the full syscall list. Static analysis can construct an over-approximated syscall list, but the list contains many false positives. In this paper, a systematic dependent syscall analysis approach, sysverify, is proposed by combining static analysis and dynamic verification together to shrink the kernel attack surface. The semantic gap between the binary executables and syscalls is bridged by analyzing the binary and the source code, which builds the mapping between the library APIs and syscalls systematically. To further reduce the attack surface at best effort, we propose a dynamic verification approach to intercept and analyze the security of the invocations of indirect-call-related or rarely invoked syscalls with low overhead.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Linux Seccomp is widely used by the program developers and the system maintainers to secure the operating systems, which can block unused syscalls for different applications and containers to shrink the attack surface of the operating systems. However, it is difficult to configure the whitelist of a container or application without the help of program developers. Docker containers block about only 50 syscalls by default, and lots of unblocked useless syscalls introduce a big kernel attack surface. To obtain the dependent syscalls, dynamic tracking is a straight-forward approach but it cannot get the full syscall list. Static analysis can construct an over-approximated syscall list, but the list contains many false positives. In this paper, a systematic dependent syscall analysis approach, sysverify, is proposed by combining static analysis and dynamic verification together to shrink the kernel attack surface. The semantic gap between the binary executables and syscalls is bridged by analyzing the binary and the source code, which builds the mapping between the library APIs and syscalls systematically. To further reduce the attack surface at best effort, we propose a dynamic verification approach to intercept and analyze the security of the invocations of indirect-call-related or rarely invoked syscalls with low overhead.",
"title": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"normalizedTitle": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"fno": "09772368",
"hasPdf": true,
"idPrefix": "sc",
"keywords": [
"Application Program Interfaces",
"Computer Network Security",
"Linux",
"Operating System Kernels",
"Operating Systems Computers",
"Program Diagnostics",
"Security Of Data",
"Big Kernel Attack Surface",
"Container",
"Dependent Syscalls",
"Docker Containers Block",
"Dynamic Syscall Limitation",
"Dynamic Tracking",
"Dynamic Verification Approach",
"Linux Seccomp",
"Operating Systems",
"Over Approximated Syscall List",
"Program Developers",
"Static Analysis",
"Straight Forward Approach",
"System Maintainers",
"Systematic Dependent Syscall Analysis Approach",
"Unblocked Useless Syscalls",
"Unused Syscalls",
"Conferences",
"Portable Document Format",
"Indexes",
"Typesetting",
"Loading",
"Web Sites",
"Warranties",
"Container Security",
"Dependent Syscall Analysis",
"Dynamic Verification",
"Shrinking Attack Surface",
"Systematic Static Analysis"
],
"authors": [
{
"givenName": "Dongyang",
"surname": "Zhan",
"fullName": "Dongyang Zhan",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, Heilongjiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhaofeng",
"surname": "Yu",
"fullName": "Zhaofeng Yu",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, Heilongjiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiangzhan",
"surname": "Yu",
"fullName": "Xiangzhan Yu",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, Heilongjiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongli",
"surname": "Zhang",
"fullName": "Hongli Zhang",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, Heilongjiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lin",
"surname": "Ye",
"fullName": "Lin Ye",
"affiliation": "School of Cyberspace Science, Harbin Institute of Technology, Harbin, Heilongjiang, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "1431-1443",
"year": "2023",
"issn": "1939-1374",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2021/06/09397284",
"title": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"doi": null,
"abstractUrl": "/journal/tc/2021/06/09397284/1sA4XChIK6A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2020/9916/0/991600a387",
"title": "SASAK: Shrinking the Attack Surface for Android Kernel with Stricter “seccomp” Restrictions",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2020/991600a387/1sBO60P4lgY",
"parentPublication": {
"id": "proceedings/msn/2020/9916/0",
"title": "2020 16th International Conference on Mobility, Sensing and Networking (MSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/05/09395239",
"title": "A Trust Model for SLA Negotiation Candidates Selection in a Dynamic IoT Environment",
"doi": null,
"abstractUrl": "/journal/sc/2022/05/09395239/1sypXMeQzRu",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09395237",
"title": "Manifold-Inspired Search-Based Algorithm for Automated Test Case Generation",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09395237/1syqhlKA1Q4",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09616408",
"title": "Pull Request Governance in Open Source Communities",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09616408/1yA77WD69DG",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09619951",
"title": "Mesh Convolutional Networks With Face and Vertex Feature Operators",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09619951/1yDftLVqexG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09664358",
"title": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09664358/1zHDJf1LXLW",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09645177",
"title": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09645177/1zc6wR47sFW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09647962",
"title": "PPOAccel: A High-Throughput Acceleration Framework for Proximal Policy Optimization",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09647962/1ziKjpj06Wc",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09650595",
"title": "Cooperative Edge Caching Based on Temporal Convolutional Networks",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09650595/1zkp2c5KJsA",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09780389",
"articleId": "1DDy9qZJm5a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09748077",
"articleId": "1CdABNw868o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1tL6Def0ZS8",
"title": "June",
"year": "2021",
"issueNum": "06",
"idPrefix": "tc",
"pubType": "journal",
"volume": "70",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1sA4XChIK6A",
"doi": "10.1109/TC.2021.3071507",
"abstract": "With the increasing demand for distributed big data analytics and data-intensive programs which contribute to large volumes of packets among processing elements (PEs) and memory banks, we witness a pressing need for new mathematical models and algorithms that can engineer a brain-inspired plasticity into the computing platforms by mining the topological complexity of high-level programs (HLPs) and exploiting their self-similar and fractal characteristics for designing reconfigurable domain-specific computing architectures. In this article, we present Plasticity-on-Chip (PoC) by engineering plasticity into ”artificial brains” to mine and exploit the self-similarity of HLPs. First, we present a communication modeling of HLPs (e.g., C/C++ implementations of various applications) that relies on static and dynamic compiler analysis of programs with varying input seeds, performing comprehensive program analysis of all traces, and representing the HLPs as weighted directed acyclic graphs while capturing the intrinsic timing constraints and data/control flow requirements. Second, we propose a rigorous mathematical framework for determining the optimal parallel degree of executing a set of interacting HLPs (by partitioning them into clusters of densely interconnected supernodes - tasks) which helps us decide the number of available heterogeneous PEs, the amount of required memory and the structure of the synthesized deadlock-free irregular NoC topology that offers an efficient communication medium. These clusters serve as abstract models of computation for the synthesized PEs within the parallel execution model. Finally, exploiting the fractal and complex networks concepts, we extract in-depth features from graphs that serve as inputs for distributed reinforcement learning. Our experimental results on synthesized PEs and NoCs show performance improvements as high as 7.61x when compared to the traditional NoC and 2.6x compared to gem5-Aladdin.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the increasing demand for distributed big data analytics and data-intensive programs which contribute to large volumes of packets among processing elements (PEs) and memory banks, we witness a pressing need for new mathematical models and algorithms that can engineer a brain-inspired plasticity into the computing platforms by mining the topological complexity of high-level programs (HLPs) and exploiting their self-similar and fractal characteristics for designing reconfigurable domain-specific computing architectures. In this article, we present Plasticity-on-Chip (PoC) by engineering plasticity into ”artificial brains” to mine and exploit the self-similarity of HLPs. First, we present a communication modeling of HLPs (e.g., C/C++ implementations of various applications) that relies on static and dynamic compiler analysis of programs with varying input seeds, performing comprehensive program analysis of all traces, and representing the HLPs as weighted directed acyclic graphs while capturing the intrinsic timing constraints and data/control flow requirements. Second, we propose a rigorous mathematical framework for determining the optimal parallel degree of executing a set of interacting HLPs (by partitioning them into clusters of densely interconnected supernodes - tasks) which helps us decide the number of available heterogeneous PEs, the amount of required memory and the structure of the synthesized deadlock-free irregular NoC topology that offers an efficient communication medium. These clusters serve as abstract models of computation for the synthesized PEs within the parallel execution model. Finally, exploiting the fractal and complex networks concepts, we extract in-depth features from graphs that serve as inputs for distributed reinforcement learning. Our experimental results on synthesized PEs and NoCs show performance improvements as high as 7.61x when compared to the traditional NoC and 2.6x compared to gem5-Aladdin.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the increasing demand for distributed big data analytics and data-intensive programs which contribute to large volumes of packets among processing elements (PEs) and memory banks, we witness a pressing need for new mathematical models and algorithms that can engineer a brain-inspired plasticity into the computing platforms by mining the topological complexity of high-level programs (HLPs) and exploiting their self-similar and fractal characteristics for designing reconfigurable domain-specific computing architectures. In this article, we present Plasticity-on-Chip (PoC) by engineering plasticity into ”artificial brains” to mine and exploit the self-similarity of HLPs. First, we present a communication modeling of HLPs (e.g., C/C++ implementations of various applications) that relies on static and dynamic compiler analysis of programs with varying input seeds, performing comprehensive program analysis of all traces, and representing the HLPs as weighted directed acyclic graphs while capturing the intrinsic timing constraints and data/control flow requirements. Second, we propose a rigorous mathematical framework for determining the optimal parallel degree of executing a set of interacting HLPs (by partitioning them into clusters of densely interconnected supernodes - tasks) which helps us decide the number of available heterogeneous PEs, the amount of required memory and the structure of the synthesized deadlock-free irregular NoC topology that offers an efficient communication medium. These clusters serve as abstract models of computation for the synthesized PEs within the parallel execution model. Finally, exploiting the fractal and complex networks concepts, we extract in-depth features from graphs that serve as inputs for distributed reinforcement learning. Our experimental results on synthesized PEs and NoCs show performance improvements as high as 7.61x when compared to the traditional NoC and 2.6x compared to gem5-Aladdin.",
"title": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"normalizedTitle": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"fno": "09397284",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Big Data",
"Complex Networks",
"Concurrency Control",
"Directed Graphs",
"Learning Artificial Intelligence",
"Multiprocessing Systems",
"Network On Chip",
"Optimisation",
"Program Compilers",
"Input Seeds",
"Comprehensive Program Analysis",
"Weighted Directed Acyclic Graphs",
"Intrinsic Timing Constraints",
"Optimal Parallel Degree",
"Heterogeneous PE",
"Efficient Communication Medium",
"Synthesized P Es",
"Parallel Execution Model",
"Fractal Networks Concepts",
"Complex Networks Concepts",
"Distributed Reinforcement Learning",
"Plasticity On Chip Design",
"Data Communications",
"Distributed Big Data Analytics",
"Data Intensive Programs",
"Memory Banks",
"Mathematical Models",
"Brain Inspired Plasticity",
"Computing Platforms",
"Topological Complexity",
"High Level Programs",
"Fractal Characteristics",
"Reconfigurable Domain Specific",
"Engineering Plasticity",
"Artificial Brains",
"Communication Modeling",
"Densely Interconnected Supernodes",
"Interacting HLP",
"Conferences",
"Portable Document Format",
"Indexes",
"Typesetting",
"Loading",
"Web Sites",
"Warranties",
"Software Hardware Codesign",
"Optimal Parallelization Degree",
"Self Similarity",
"Graph Neural Networks",
"Intelligent Scheduler"
],
"authors": [
{
"givenName": "Yao",
"surname": "Xiao",
"fullName": "Yao Xiao",
"affiliation": "Department of Electrical and Computer Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shahin",
"surname": "Nazarian",
"fullName": "Shahin Nazarian",
"affiliation": "Department of Electrical and Computer Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "Bogdan",
"fullName": "Paul Bogdan",
"affiliation": "Department of Electrical and Computer Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "950-962",
"year": "2021",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fccm/2017/4037/0/07966682",
"title": "A Network-on-Chip Based H.264 Video Decoder Prototype Implemented on FPGAs",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2017/07966682/12OmNzt0IMD",
"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/sc/2023/02/09772368",
"title": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"doi": null,
"abstractUrl": "/journal/sc/2023/02/09772368/1DgjvFwHct2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/05/09395239",
"title": "A Trust Model for SLA Negotiation Candidates Selection in a Dynamic IoT Environment",
"doi": null,
"abstractUrl": "/journal/sc/2022/05/09395239/1sypXMeQzRu",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09395237",
"title": "Manifold-Inspired Search-Based Algorithm for Automated Test Case Generation",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09395237/1syqhlKA1Q4",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09616408",
"title": "Pull Request Governance in Open Source Communities",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09616408/1yA77WD69DG",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09619951",
"title": "Mesh Convolutional Networks With Face and Vertex Feature Operators",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09619951/1yDftLVqexG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09664358",
"title": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09664358/1zHDJf1LXLW",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09645177",
"title": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09645177/1zc6wR47sFW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09647962",
"title": "PPOAccel: A High-Throughput Acceleration Framework for Proximal Policy Optimization",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09647962/1ziKjpj06Wc",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09650595",
"title": "Cooperative Edge Caching Based on Temporal Convolutional Networks",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09650595/1zkp2c5KJsA",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09354567",
"articleId": "1reXA1GOj16",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1E0NhqDj0zK",
"title": "April-June",
"year": "2022",
"issueNum": "02",
"idPrefix": "ec",
"pubType": "journal",
"volume": "10",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1syqhlKA1Q4",
"doi": "10.1109/TETC.2021.3070968",
"abstract": "Automated test case generation based on path coverage (ATCG-PC) is a black-box optimization problem whose difficulty is attributed to the one-to-many relationship between path and test cases. It results in a large number of redundant function evaluations in the search process of algorithms for ATCG-PC. To minimize the redundant function evaluations for solving ATCG-PC, the equivalent mapping subspaces are defined to decompose the search space according to the paths. Inspired by the data distribution hypothesis, we assume that the target path can be covered by searching in one neighborhood of a test case (equivalent mapping subspace) instead of the whole search space. This article presents a manifold-inspired search-based algorithm that finds the equivalent mapping subspaces with the test-case-path relationship matrix. Furthermore, the algorithm generates test cases covering all possible paths by searching in the found subspaces. The experimental results show the proposed algorithm has significantly lower function evaluation consumption than the state-of-the-art algorithms with the highest path coverage rate in two open-source toolkits and 16 open-source real-world programs. Several orders of magnitude of function evaluations can be saved by searching in the found equivalent mapping subspaces instead of exploring the whole search space.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Automated test case generation based on path coverage (ATCG-PC) is a black-box optimization problem whose difficulty is attributed to the one-to-many relationship between path and test cases. It results in a large number of redundant function evaluations in the search process of algorithms for ATCG-PC. To minimize the redundant function evaluations for solving ATCG-PC, the equivalent mapping subspaces are defined to decompose the search space according to the paths. Inspired by the data distribution hypothesis, we assume that the target path can be covered by searching in one neighborhood of a test case (equivalent mapping subspace) instead of the whole search space. This article presents a manifold-inspired search-based algorithm that finds the equivalent mapping subspaces with the test-case-path relationship matrix. Furthermore, the algorithm generates test cases covering all possible paths by searching in the found subspaces. The experimental results show the proposed algorithm has significantly lower function evaluation consumption than the state-of-the-art algorithms with the highest path coverage rate in two open-source toolkits and 16 open-source real-world programs. Several orders of magnitude of function evaluations can be saved by searching in the found equivalent mapping subspaces instead of exploring the whole search space.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Automated test case generation based on path coverage (ATCG-PC) is a black-box optimization problem whose difficulty is attributed to the one-to-many relationship between path and test cases. It results in a large number of redundant function evaluations in the search process of algorithms for ATCG-PC. To minimize the redundant function evaluations for solving ATCG-PC, the equivalent mapping subspaces are defined to decompose the search space according to the paths. Inspired by the data distribution hypothesis, we assume that the target path can be covered by searching in one neighborhood of a test case (equivalent mapping subspace) instead of the whole search space. This article presents a manifold-inspired search-based algorithm that finds the equivalent mapping subspaces with the test-case-path relationship matrix. Furthermore, the algorithm generates test cases covering all possible paths by searching in the found subspaces. The experimental results show the proposed algorithm has significantly lower function evaluation consumption than the state-of-the-art algorithms with the highest path coverage rate in two open-source toolkits and 16 open-source real-world programs. Several orders of magnitude of function evaluations can be saved by searching in the found equivalent mapping subspaces instead of exploring the whole search space.",
"title": "Manifold-Inspired Search-Based Algorithm for Automated Test Case Generation",
"normalizedTitle": "Manifold-Inspired Search-Based Algorithm for Automated Test Case Generation",
"fno": "09395237",
"hasPdf": true,
"idPrefix": "ec",
"keywords": [
"Matrix Algebra",
"Optimisation",
"Program Testing",
"Search Problems",
"Target Path",
"Equivalent Mapping Subspace",
"Search Space",
"Lower Function Evaluation Consumption",
"Highest Path Coverage Rate",
"Automated Test Case Generation",
"ATCG PC",
"Blackbox Optimization Problem",
"Redundant Function Evaluations",
"Test Case Path Relationship Matrix",
"Manifold Inspired Search Based Algorithm",
"Conferences",
"Portable Document Format",
"Indexes",
"Typesetting",
"Printing",
"Loading",
"Web Sites",
"Automated Test Case Generation",
"Black Box Optimization",
"Manifold Inspired Search Based Algorithm",
"Equivalent Mapping Subspaces"
],
"authors": [
{
"givenName": "Fangqing",
"surname": "Liu",
"fullName": "Fangqing Liu",
"affiliation": "School of Software Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han",
"surname": "Huang",
"fullName": "Han Huang",
"affiliation": "School of Software Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junpeng",
"surname": "Su",
"fullName": "Junpeng Su",
"affiliation": "School of Software Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stuart D.",
"surname": "Semujju",
"fullName": "Stuart D. Semujju",
"affiliation": "School of Software Engineering, South China University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhongming",
"surname": "Yang",
"fullName": "Zhongming Yang",
"affiliation": "College of Computer Engineering Technical, Guangdong Institute of Science and Technology, Zhuhai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhifeng",
"surname": "Hao",
"fullName": "Zhifeng Hao",
"affiliation": "School of Computer, Guangdong University of Technology, Guangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2022-04-01 00:00:00",
"pubType": "trans",
"pages": "1075-1090",
"year": "2022",
"issn": "2168-6750",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/sc/2023/02/09772368",
"title": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"doi": null,
"abstractUrl": "/journal/sc/2023/02/09772368/1DgjvFwHct2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/06/09397284",
"title": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"doi": null,
"abstractUrl": "/journal/tc/2021/06/09397284/1sA4XChIK6A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/05/09395239",
"title": "A Trust Model for SLA Negotiation Candidates Selection in a Dynamic IoT Environment",
"doi": null,
"abstractUrl": "/journal/sc/2022/05/09395239/1sypXMeQzRu",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09616408",
"title": "Pull Request Governance in Open Source Communities",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09616408/1yA77WD69DG",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09619951",
"title": "Mesh Convolutional Networks With Face and Vertex Feature Operators",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09619951/1yDftLVqexG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/1.91E200",
"title": "Grassmannian Dimensionality Reduction for Optimized Universal Manifold Embedding Representation of 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/1.91E200/1yNivBQZchW",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09664358",
"title": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09664358/1zHDJf1LXLW",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09645177",
"title": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09645177/1zc6wR47sFW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09647962",
"title": "PPOAccel: A High-Throughput Acceleration Framework for Proximal Policy Optimization",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09647962/1ziKjpj06Wc",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09650595",
"title": "Cooperative Edge Caching Based on Temporal Convolutional Networks",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09650595/1zkp2c5KJsA",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09387582",
"articleId": "1smD9B8VkEE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09400722",
"articleId": "1sK2rjVYiI0",
"__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": "1yA77WD69DG",
"doi": "10.1109/TSE.2021.3128356",
"abstract": "Pull requests facilitate inclusion and improvement of contributions in distributed software projects, especially in open source communities. An author makes a pull request to present a contribution as a candidate for inclusion in a code base. The request is inspected by maintainers and reviewers. The initiated process of review and collaborative improvement can be loaded with debates, opinions, and emotions. It heavily influences the atmosphere in the community. It can demotivate and detract contributors or it can fail to guard the code quality. Both problems put the existence of a community at risk. This mixed methods study aims to elucidate the mechanisms of evaluating pull requests in diverse open source software communities from the perspectives of developers and maintainers. We interviewed 30 participants from five different communities and conducted a survey with N=387 respondents. The data shows that acceptance of contributions in open source depends not only on technical criteria, but also significantly on social and strategic aspects. As a result, we identify three governance styles for pull requests: (1) protective, (2) equitable, and (3) lenient. While the protective style values trustworthiness and reliability of the contributor, the lenient style believes in creating a positive and welcoming environment where contributors are mentored to evolve contributions until the community standards are met. Each of the governance styles safeguards the quality of the project code in different ways. We hope that this material will help researchers and community managers to obtain a more nuanced view on the peculiarities of different communities and the strengths and weakness of their pull requests evaluation process.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Pull requests facilitate inclusion and improvement of contributions in distributed software projects, especially in open source communities. An author makes a pull request to present a contribution as a candidate for inclusion in a code base. The request is inspected by maintainers and reviewers. The initiated process of review and collaborative improvement can be loaded with debates, opinions, and emotions. It heavily influences the atmosphere in the community. It can demotivate and detract contributors or it can fail to guard the code quality. Both problems put the existence of a community at risk. This mixed methods study aims to elucidate the mechanisms of evaluating pull requests in diverse open source software communities from the perspectives of developers and maintainers. We interviewed 30 participants from five different communities and conducted a survey with N=387 respondents. The data shows that acceptance of contributions in open source depends not only on technical criteria, but also significantly on social and strategic aspects. As a result, we identify three governance styles for pull requests: (1) protective, (2) equitable, and (3) lenient. While the protective style values trustworthiness and reliability of the contributor, the lenient style believes in creating a positive and welcoming environment where contributors are mentored to evolve contributions until the community standards are met. Each of the governance styles safeguards the quality of the project code in different ways. We hope that this material will help researchers and community managers to obtain a more nuanced view on the peculiarities of different communities and the strengths and weakness of their pull requests evaluation process.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Pull requests facilitate inclusion and improvement of contributions in distributed software projects, especially in open source communities. An author makes a pull request to present a contribution as a candidate for inclusion in a code base. The request is inspected by maintainers and reviewers. The initiated process of review and collaborative improvement can be loaded with debates, opinions, and emotions. It heavily influences the atmosphere in the community. It can demotivate and detract contributors or it can fail to guard the code quality. Both problems put the existence of a community at risk. This mixed methods study aims to elucidate the mechanisms of evaluating pull requests in diverse open source software communities from the perspectives of developers and maintainers. We interviewed 30 participants from five different communities and conducted a survey with N=387 respondents. The data shows that acceptance of contributions in open source depends not only on technical criteria, but also significantly on social and strategic aspects. As a result, we identify three governance styles for pull requests: (1) protective, (2) equitable, and (3) lenient. While the protective style values trustworthiness and reliability of the contributor, the lenient style believes in creating a positive and welcoming environment where contributors are mentored to evolve contributions until the community standards are met. Each of the governance styles safeguards the quality of the project code in different ways. We hope that this material will help researchers and community managers to obtain a more nuanced view on the peculiarities of different communities and the strengths and weakness of their pull requests evaluation process.",
"title": "Pull Request Governance in Open Source Communities",
"normalizedTitle": "Pull Request Governance in Open Source Communities",
"fno": "09616408",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Internet",
"Project Management",
"Public Domain Software",
"Software Engineering",
"Community Managers",
"Community Standards",
"Distributed Software Projects",
"Governance Styles",
"Open Source Software Communities",
"Pull Request Governance",
"Pull Requests Evaluation Process",
"Conferences",
"Portable Document Format",
"Indexes",
"Typesetting",
"Loading",
"Web Sites",
"Warranties",
"Pull Request",
"Open Source",
"Decision Making",
"Governance"
],
"authors": [
{
"givenName": "Adam",
"surname": "Alami",
"fullName": "Adam Alami",
"affiliation": "IT University of Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Raúl",
"surname": "Pardo",
"fullName": "Raúl Pardo",
"affiliation": "IT University of Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marisa Leavitt",
"surname": "Cohn",
"fullName": "Marisa Leavitt Cohn",
"affiliation": "IT University of Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrzej",
"surname": "Wąsowski",
"fullName": "Andrzej Wąsowski",
"affiliation": "IT University of Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4838-4856",
"year": "2022",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2017/2715/0/08258319",
"title": "A generalized incremental bottom-up community detection framework for highly dynamic graphs",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258319/17D45VObpOx",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2023/02/09749844",
"title": "Pull Request Decisions Explained: An Empirical Overview",
"doi": null,
"abstractUrl": "/journal/ts/2023/02/09749844/1CkdXAGrsBi",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/02/09772368",
"title": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"doi": null,
"abstractUrl": "/journal/sc/2023/02/09772368/1DgjvFwHct2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2021/11/08935389",
"title": "Effects of Personality Traits on Pull Request Acceptance",
"doi": null,
"abstractUrl": "/journal/ts/2021/11/08935389/1fPUhns9Zlu",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/06/09332267",
"title": "Are You Still Working on This? An Empirical Study on Pull Request Abandonment",
"doi": null,
"abstractUrl": "/journal/ts/2022/06/09332267/1qzsTKPcdB6",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/06/09397284",
"title": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"doi": null,
"abstractUrl": "/journal/tc/2021/06/09397284/1sA4XChIK6A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09619951",
"title": "Mesh Convolutional Networks With Face and Vertex Feature Operators",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09619951/1yDftLVqexG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09664358",
"title": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09664358/1zHDJf1LXLW",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09645177",
"title": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09645177/1zc6wR47sFW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09647962",
"title": "PPOAccel: A High-Throughput Acceleration Framework for Proximal Policy Optimization",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09647962/1ziKjpj06Wc",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09616462",
"articleId": "1yA78cWbkXu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09618780",
"articleId": "1yBC65qCKgo",
"__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": "1zHDJf1LXLW",
"doi": "10.1109/TSE.2021.3138735",
"abstract": "Data races are often hard to detect in device drivers. According to our study of Linux driver patches that fix data races, about 39% of patches involve a pattern that we call <italic>inconsistent locking discipline</italic>. Specifically, if a variable is accessed within two concurrently executed functions, the sets of locks held around each access are disjoint, at least one of the locksets is non-empty, and at least one of the involved accesses is a write, then a data race may occur. In this paper, we present a hybrid static-dynamic analysis approach, named SDILP, to detect data races caused by inconsistent locking discipline in device drivers. SDILP has a dynamic lockset analysis to detect data races at runtime, and a static lockset analysis to detect more data races based on the dynamic-analysis results. It also performs a static taint analysis to reduce the number of variable accesses monitored by the dynamic analysis. Compared to our previous dynamic approach DILP (Chen et al., 2019), introducing static analysis allows SDILP to achieve better performance and find more data races. We evaluate SDILP on 12 drivers in Linux 5.4, and find 117 real data races, 50 of which have been confirmed by driver developers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data races are often hard to detect in device drivers. According to our study of Linux driver patches that fix data races, about 39% of patches involve a pattern that we call <italic>inconsistent locking discipline</italic>. Specifically, if a variable is accessed within two concurrently executed functions, the sets of locks held around each access are disjoint, at least one of the locksets is non-empty, and at least one of the involved accesses is a write, then a data race may occur. In this paper, we present a hybrid static-dynamic analysis approach, named SDILP, to detect data races caused by inconsistent locking discipline in device drivers. SDILP has a dynamic lockset analysis to detect data races at runtime, and a static lockset analysis to detect more data races based on the dynamic-analysis results. It also performs a static taint analysis to reduce the number of variable accesses monitored by the dynamic analysis. Compared to our previous dynamic approach DILP (Chen et al., 2019), introducing static analysis allows SDILP to achieve better performance and find more data races. We evaluate SDILP on 12 drivers in Linux 5.4, and find 117 real data races, 50 of which have been confirmed by driver developers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data races are often hard to detect in device drivers. According to our study of Linux driver patches that fix data races, about 39% of patches involve a pattern that we call inconsistent locking discipline. Specifically, if a variable is accessed within two concurrently executed functions, the sets of locks held around each access are disjoint, at least one of the locksets is non-empty, and at least one of the involved accesses is a write, then a data race may occur. In this paper, we present a hybrid static-dynamic analysis approach, named SDILP, to detect data races caused by inconsistent locking discipline in device drivers. SDILP has a dynamic lockset analysis to detect data races at runtime, and a static lockset analysis to detect more data races based on the dynamic-analysis results. It also performs a static taint analysis to reduce the number of variable accesses monitored by the dynamic analysis. Compared to our previous dynamic approach DILP (Chen et al., 2019), introducing static analysis allows SDILP to achieve better performance and find more data races. We evaluate SDILP on 12 drivers in Linux 5.4, and find 117 real data races, 50 of which have been confirmed by driver developers.",
"title": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"normalizedTitle": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"fno": "09664358",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Concurrency Control",
"Device Drivers",
"Linux",
"Multi Threading",
"Program Diagnostics",
"System Monitoring",
"Data Races Detection",
"Device Drivers",
"Dynamic Analysis",
"Hybrid Static Dynamic Analysis",
"Inconsistent Locking Discipline",
"Linux Driver Patches",
"SDILP",
"Static Lockset Analysis",
"Static Dynamic Analysis Approach",
"Conferences",
"Portable Document Format",
"Indexes",
"Typesetting",
"Loading",
"Web Sites",
"Warranties",
"Data Race",
"Inconsistent Locking Discipline",
"Device Driver",
"Static Analysis",
"Dynamic Analysis"
],
"authors": [
{
"givenName": "Jia-Ju",
"surname": "Bai",
"fullName": "Jia-Ju Bai",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qiu-Liang",
"surname": "Chen",
"fullName": "Qiu-Liang Chen",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zu-Ming",
"surname": "Jiang",
"fullName": "Zu-Ming Jiang",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julia",
"surname": "Lawall",
"fullName": "Julia Lawall",
"affiliation": "Inria, Paris, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shi-Min",
"surname": "Hu",
"fullName": "Shi-Min Hu",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "5120-5135",
"year": "2022",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ase/2015/0025/0/0025a166",
"title": "Fast and Precise Symbolic Analysis of Concurrency Bugs in Device Drivers (T)",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2015/0025a166/12OmNAJ4peb",
"parentPublication": {
"id": "proceedings/ase/2015/0025/0",
"title": "2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgo/2011/4356/0/05764688",
"title": "Acculock: Accurate and efficient detection of data races",
"doi": null,
"abstractUrl": "/proceedings-article/cgo/2011/05764688/12OmNCbU2Xs",
"parentPublication": {
"id": "proceedings/cgo/2011/4356/0",
"title": "2011 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saner/2019/0591/0/08668017",
"title": "Detecting Data Races Caused by Inconsistent Lock Protection in Device Drivers",
"doi": null,
"abstractUrl": "/proceedings-article/saner/2019/08668017/18uSsFvcr0A",
"parentPublication": {
"id": "proceedings/saner/2019/0591/0",
"title": "2019 IEEE 26th International Conference on Software Analysis, Evolution and Reengineering (SANER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/02/09772368",
"title": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"doi": null,
"abstractUrl": "/journal/sc/2023/02/09772368/1DgjvFwHct2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a094",
"title": "Visual Analysis of Formula One Races",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a094/1cMF8KoSaOI",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/06/09397284",
"title": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"doi": null,
"abstractUrl": "/journal/tc/2021/06/09397284/1sA4XChIK6A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09616408",
"title": "Pull Request Governance in Open Source Communities",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09616408/1yA77WD69DG",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09619951",
"title": "Mesh Convolutional Networks With Face and Vertex Feature Operators",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09619951/1yDftLVqexG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09645177",
"title": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09645177/1zc6wR47sFW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09647962",
"title": "PPOAccel: A High-Throughput Acceleration Framework for Proximal Policy Optimization",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09647962/1ziKjpj06Wc",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09662236",
"articleId": "1zzlg0g2cGQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09665296",
"articleId": "1zJiPS5KpvW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Lk2bbwqInK",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zc6wR47sFW",
"doi": "10.1109/TKDE.2021.3132956",
"abstract": "The task of ACE Event Detection (ED) often encounters ambiguous and unseen trigger words. Most conventional ED systems exclusively consider the semantic or syntactic patterns as the additional evidence to resolve the problem of the ambiguous and unseen triggers, but rarely consider taking advantages of structured knowledge of the event itself. In this study, we propose Dynamic Word-Trigger-Argument Graph Neural Networks (DWTA-GNN), a novel framework that leverages event structure knowledge to facilitate the two issues simultaneously. In our approach, we utilize words, entities, and event annotations from training to construct an event background graph, which can provide sufficient information of event structure to better disambiguate polysemous triggers and identify unseen triggers. To make full use of the constructed background graph, we further design a knowledge matching module to dynamically match appropriate event structure knowledge and construct a subgraph for each incoming sentence. Besides, an event-selective graph convolution is applied to filter out the noise in the matched knowledge so as to enhance event representation. Experiments on the ACE2005 dataset show that our model achieves competitive performance and advances previous approaches on ambiguous and unseen trigger words, verifying the effectiveness of incorporating event structure knowledge for event detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The task of ACE Event Detection (ED) often encounters ambiguous and unseen trigger words. Most conventional ED systems exclusively consider the semantic or syntactic patterns as the additional evidence to resolve the problem of the ambiguous and unseen triggers, but rarely consider taking advantages of structured knowledge of the event itself. In this study, we propose Dynamic Word-Trigger-Argument Graph Neural Networks (DWTA-GNN), a novel framework that leverages event structure knowledge to facilitate the two issues simultaneously. In our approach, we utilize words, entities, and event annotations from training to construct an event background graph, which can provide sufficient information of event structure to better disambiguate polysemous triggers and identify unseen triggers. To make full use of the constructed background graph, we further design a knowledge matching module to dynamically match appropriate event structure knowledge and construct a subgraph for each incoming sentence. Besides, an event-selective graph convolution is applied to filter out the noise in the matched knowledge so as to enhance event representation. Experiments on the ACE2005 dataset show that our model achieves competitive performance and advances previous approaches on ambiguous and unseen trigger words, verifying the effectiveness of incorporating event structure knowledge for event detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The task of ACE Event Detection (ED) often encounters ambiguous and unseen trigger words. Most conventional ED systems exclusively consider the semantic or syntactic patterns as the additional evidence to resolve the problem of the ambiguous and unseen triggers, but rarely consider taking advantages of structured knowledge of the event itself. In this study, we propose Dynamic Word-Trigger-Argument Graph Neural Networks (DWTA-GNN), a novel framework that leverages event structure knowledge to facilitate the two issues simultaneously. In our approach, we utilize words, entities, and event annotations from training to construct an event background graph, which can provide sufficient information of event structure to better disambiguate polysemous triggers and identify unseen triggers. To make full use of the constructed background graph, we further design a knowledge matching module to dynamically match appropriate event structure knowledge and construct a subgraph for each incoming sentence. Besides, an event-selective graph convolution is applied to filter out the noise in the matched knowledge so as to enhance event representation. Experiments on the ACE2005 dataset show that our model achieves competitive performance and advances previous approaches on ambiguous and unseen trigger words, verifying the effectiveness of incorporating event structure knowledge for event detection.",
"title": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"normalizedTitle": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"fno": "09645177",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Graph Neural Networks",
"Graph Theory",
"Learning Artificial Intelligence",
"Natural Language Processing",
"Text Analysis",
"ACE Event Detection",
"Ambiguous Trigger Words",
"Ambiguous Triggers",
"Appropriate Event Structure Knowledge",
"Constructed Background Graph",
"Disambiguate Polysemous Triggers",
"Dynamic Word Trigger Argument Graph Neural Networks",
"Event Annotations",
"Event Background Graph",
"Event Representation",
"Event Selective Graph Convolution",
"Incorporating Event Structure Knowledge",
"Knowledge Matching Module",
"Structured Knowledge",
"Unseen Trigger Words",
"Unseen Triggers",
"Conferences",
"Portable Document Format",
"Indexes",
"Typesetting",
"Loading",
"Web Sites",
"Warranties",
"Deep Learning",
"Big Data Applications",
"Data Mining",
"Text Mining",
"Knowledge Representation"
],
"authors": [
{
"givenName": "Yilin",
"surname": "Zhang",
"fullName": "Yilin Zhang",
"affiliation": "Graduate School at Shenzhen, Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ziran",
"surname": "Li",
"fullName": "Ziran Li",
"affiliation": "Graduate School at Shenzhen, Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhiyuan",
"surname": "Liu",
"fullName": "Zhiyuan Liu",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hai-Tao",
"surname": "Zheng",
"fullName": "Hai-Tao Zheng",
"affiliation": "Graduate School at Shenzhen, Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "Shen",
"fullName": "Ying Shen",
"affiliation": "School of Intelligent Systems Engineering, Sun Yat-Sen University, Guangzhou, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lan",
"surname": "Zhou",
"fullName": "Lan Zhou",
"affiliation": "Shenzhen Giiso Information Technology Company Ltd, Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "3858-3869",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2018/05/07936538",
"title": "Biological Event Trigger Identification with Noise Contrastive Estimation",
"doi": null,
"abstractUrl": "/journal/tb/2018/05/07936538/14dcDXDJqye",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/02/09772368",
"title": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"doi": null,
"abstractUrl": "/journal/sc/2023/02/09772368/1DgjvFwHct2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/06/09397284",
"title": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"doi": null,
"abstractUrl": "/journal/tc/2021/06/09397284/1sA4XChIK6A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/05/09395239",
"title": "A Trust Model for SLA Negotiation Candidates Selection in a Dynamic IoT Environment",
"doi": null,
"abstractUrl": "/journal/sc/2022/05/09395239/1sypXMeQzRu",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09395237",
"title": "Manifold-Inspired Search-Based Algorithm for Automated Test Case Generation",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09395237/1syqhlKA1Q4",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09616408",
"title": "Pull Request Governance in Open Source Communities",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09616408/1yA77WD69DG",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09619951",
"title": "Mesh Convolutional Networks With Face and Vertex Feature Operators",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09619951/1yDftLVqexG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09664358",
"title": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09664358/1zHDJf1LXLW",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09647962",
"title": "PPOAccel: A High-Throughput Acceleration Framework for Proximal Policy Optimization",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09647962/1ziKjpj06Wc",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/09/09650595",
"title": "Cooperative Edge Caching Based on Temporal Convolutional Networks",
"doi": null,
"abstractUrl": "/journal/td/2022/09/09650595/1zkp2c5KJsA",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09609666",
"articleId": "1yoxzwDJbY4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09627543",
"articleId": "1yORJmLl0YM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Ax5ZjGaR20",
"title": "Sept.",
"year": "2022",
"issueNum": "09",
"idPrefix": "td",
"pubType": "journal",
"volume": "33",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ziKjpj06Wc",
"doi": "10.1109/TPDS.2021.3134709",
"abstract": "Reinforcement Learning (RL) is a major branch of AI that enables agents to learn optimal decision making via interaction with the environment. Proximal Policy Optimization (PPO) is the state-of-the-art policy optimization based RL algorithm which achieves superior overall performance on various benchmarks. A PPO agent iteratively optimizes its policy - a function which chooses optimal actions approximated by a DNN, with each iteration consisting of two computationally intensive phases: Sample Generation - where agents inference on its policy and interact with the environment to collect data, and Model Update - where the policy is trained using the collected data. In this paper, we develop the first high-throughput PPO accelerator on CPU-FPGA heterogeneous platform. Our unified systolic-array based design accelerates both the inference and the training of the deep neural network used in a RL algorithm, and is generalizable to various MLP and CNN models across a wide range of RL applications. We develop novel optimizations to simultaneously reduce data access and computation latencies, specifically: (a) optimal data flow mapping to systolic array, (b) novel memory-blocked data layout to enable streaming stall-free data access in both forward and backward propagations, and, (c) a systolic array compute sharing technique to mitigate load imbalance in the training of two networks. We evaluate our design on widely used robotics and gaming benchmarks, achieving 1.4×–26× and 1.3×–2.7× improvements in throughput, respectively, when compared with state-of-the-art CPU/CPU-GPU implementations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Reinforcement Learning (RL) is a major branch of AI that enables agents to learn optimal decision making via interaction with the environment. Proximal Policy Optimization (PPO) is the state-of-the-art policy optimization based RL algorithm which achieves superior overall performance on various benchmarks. A PPO agent iteratively optimizes its policy - a function which chooses optimal actions approximated by a DNN, with each iteration consisting of two computationally intensive phases: Sample Generation - where agents inference on its policy and interact with the environment to collect data, and Model Update - where the policy is trained using the collected data. In this paper, we develop the first high-throughput PPO accelerator on CPU-FPGA heterogeneous platform. Our unified systolic-array based design accelerates both the inference and the training of the deep neural network used in a RL algorithm, and is generalizable to various MLP and CNN models across a wide range of RL applications. We develop novel optimizations to simultaneously reduce data access and computation latencies, specifically: (a) optimal data flow mapping to systolic array, (b) novel memory-blocked data layout to enable streaming stall-free data access in both forward and backward propagations, and, (c) a systolic array compute sharing technique to mitigate load imbalance in the training of two networks. We evaluate our design on widely used robotics and gaming benchmarks, achieving 1.4×–26× and 1.3×–2.7× improvements in throughput, respectively, when compared with state-of-the-art CPU/CPU-GPU implementations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Reinforcement Learning (RL) is a major branch of AI that enables agents to learn optimal decision making via interaction with the environment. Proximal Policy Optimization (PPO) is the state-of-the-art policy optimization based RL algorithm which achieves superior overall performance on various benchmarks. A PPO agent iteratively optimizes its policy - a function which chooses optimal actions approximated by a DNN, with each iteration consisting of two computationally intensive phases: Sample Generation - where agents inference on its policy and interact with the environment to collect data, and Model Update - where the policy is trained using the collected data. In this paper, we develop the first high-throughput PPO accelerator on CPU-FPGA heterogeneous platform. Our unified systolic-array based design accelerates both the inference and the training of the deep neural network used in a RL algorithm, and is generalizable to various MLP and CNN models across a wide range of RL applications. We develop novel optimizations to simultaneously reduce data access and computation latencies, specifically: (a) optimal data flow mapping to systolic array, (b) novel memory-blocked data layout to enable streaming stall-free data access in both forward and backward propagations, and, (c) a systolic array compute sharing technique to mitigate load imbalance in the training of two networks. We evaluate our design on widely used robotics and gaming benchmarks, achieving 1.4×–26× and 1.3×–2.7× improvements in throughput, respectively, when compared with state-of-the-art CPU/CPU-GPU implementations.",
"title": "PPOAccel: A High-Throughput Acceleration Framework for Proximal Policy Optimization",
"normalizedTitle": "PPOAccel: A High-Throughput Acceleration Framework for Proximal Policy Optimization",
"fno": "09647962",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"AI Chips",
"Convolutional Neural Nets",
"Data Acquisition",
"Decision Making",
"Deep Learning Artificial Intelligence",
"Electronic Engineering Computing",
"Field Programmable Gate Arrays",
"Generalisation Artificial Intelligence",
"Logic Design",
"Multi Agent Systems",
"Multilayer Perceptrons",
"Optimisation",
"Reinforcement Learning",
"Systolic Arrays",
"RL Algorithm",
"PPO Agent",
"Optimal Actions",
"High Throughput PPO Accelerator",
"Unified Systolic Array Based Design",
"Computation Latencies",
"Optimal Data Flow Mapping",
"Memory Blocked Data Layout",
"Proximal Policy Optimization",
"High Throughput Acceleration",
"PPO Accel",
"Reinforcement Learning",
"Optimal Decision Making",
"DNN",
"Sample Generation",
"Model Update",
"Data Collection",
"CPU FPGA Heterogeneous Platform",
"Deep Neural Network",
"MLP",
"CNN",
"Data Access",
"Stall Free Data Access Streaming",
"Backward Propagations",
"Forward Propagations",
"Systolic Array Compute Sharing Technique",
"Load Imbalance",
"Network Training",
"Conferences",
"Portable Document Format",
"Indexes",
"Typesetting",
"Loading",
"Web Sites",
"Warranties",
"Reinforcement Learning",
"Hardware Accelerators",
"FPGA"
],
"authors": [
{
"givenName": "Yuan",
"surname": "Meng",
"fullName": "Yuan Meng",
"affiliation": "Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sanmukh",
"surname": "Kuppannagari",
"fullName": "Sanmukh Kuppannagari",
"affiliation": "Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rajgopal",
"surname": "Kannan",
"fullName": "Rajgopal Kannan",
"affiliation": "U.S. Army Research Lab, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Viktor",
"surname": "Prasanna",
"fullName": "Viktor Prasanna",
"affiliation": "Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "2066-2078",
"year": "2022",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/sc/2023/02/09772368",
"title": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"doi": null,
"abstractUrl": "/journal/sc/2023/02/09772368/1DgjvFwHct2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlise/2022/9246/0/924600a069",
"title": "Resource Management Scheduling-Based on Proximal Policy Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/mlise/2022/924600a069/1Ik8YDohRW8",
"parentPublication": {
"id": "proceedings/mlise/2022/9246/0",
"title": "2022 International Conference on Machine Learning and Intelligent Systems Engineering (MLISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2019/3798/0/379800b452",
"title": "Proximal Policy Optimization with Mixed Distributed Training",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2019/379800b452/1hrLXU4kb84",
"parentPublication": {
"id": "proceedings/ictai/2019/3798/0",
"title": "2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2020/5803/0/09114846",
"title": "Accelerating Proximal Policy Optimization on CPU-FPGA Heterogeneous Platforms",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2020/09114846/1kzGarFbYIg",
"parentPublication": {
"id": "proceedings/fccm/2020/5803/0",
"title": "2020 IEEE 28th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/06/09397284",
"title": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"doi": null,
"abstractUrl": "/journal/tc/2021/06/09397284/1sA4XChIK6A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09395237",
"title": "Manifold-Inspired Search-Based Algorithm for Automated Test Case Generation",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09395237/1syqhlKA1Q4",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09616408",
"title": "Pull Request Governance in Open Source Communities",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09616408/1yA77WD69DG",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09619951",
"title": "Mesh Convolutional Networks With Face and Vertex Feature Operators",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09619951/1yDftLVqexG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09664358",
"title": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09664358/1zHDJf1LXLW",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09645177",
"title": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09645177/1zc6wR47sFW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09613798",
"articleId": "1yti48KetO0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09647942",
"articleId": "1ziKjJyLwnC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Ax5ZjGaR20",
"title": "Sept.",
"year": "2022",
"issueNum": "09",
"idPrefix": "td",
"pubType": "journal",
"volume": "33",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zkp2c5KJsA",
"doi": "10.1109/TPDS.2021.3135257",
"abstract": "With the rapid growth of networked multimedia services in the Internet, wireless network traffic has increased dramatically. However, the current mainstream content caching schemes do not take into account the cooperation of different edge servers, resulting in deteriorated system performance. In this paper, we propose a learning-based edge caching scheme to enable mutual cooperation among different edge servers with limited caching resources, thus effectively reducing the content delivery latency. Specifically, we formulate the cooperative content caching problem as an optimization problem, which is proven to be NP-hard. To solve this problem, we design a new learning-based cooperative caching strategy (LECS) that encompasses three key components. Firstly, a temporal convolutional network driven content popularity prediction model is developed to estimate the content popularity with high accuracy. Secondly, with the predicted content popularity, the concept of content caching value (CCV) is introduced to weigh the value of a content cached on a given edge server. Thirdly, an novel dynamic programming algorithm is developed to maximize the overall CCV. Extensive simulation results have demonstrated the superiority of our approach. Compared with the state-of-the-art caching schemes, LECS can improve the cache hit rate by 8.3%-10.1%, and reduce the average content delivery delay by 9.1%-15.1%.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the rapid growth of networked multimedia services in the Internet, wireless network traffic has increased dramatically. However, the current mainstream content caching schemes do not take into account the cooperation of different edge servers, resulting in deteriorated system performance. In this paper, we propose a learning-based edge caching scheme to enable mutual cooperation among different edge servers with limited caching resources, thus effectively reducing the content delivery latency. Specifically, we formulate the cooperative content caching problem as an optimization problem, which is proven to be NP-hard. To solve this problem, we design a new learning-based cooperative caching strategy (LECS) that encompasses three key components. Firstly, a temporal convolutional network driven content popularity prediction model is developed to estimate the content popularity with high accuracy. Secondly, with the predicted content popularity, the concept of content caching value (CCV) is introduced to weigh the value of a content cached on a given edge server. Thirdly, an novel dynamic programming algorithm is developed to maximize the overall CCV. Extensive simulation results have demonstrated the superiority of our approach. Compared with the state-of-the-art caching schemes, LECS can improve the cache hit rate by 8.3%-10.1%, and reduce the average content delivery delay by 9.1%-15.1%.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the rapid growth of networked multimedia services in the Internet, wireless network traffic has increased dramatically. However, the current mainstream content caching schemes do not take into account the cooperation of different edge servers, resulting in deteriorated system performance. In this paper, we propose a learning-based edge caching scheme to enable mutual cooperation among different edge servers with limited caching resources, thus effectively reducing the content delivery latency. Specifically, we formulate the cooperative content caching problem as an optimization problem, which is proven to be NP-hard. To solve this problem, we design a new learning-based cooperative caching strategy (LECS) that encompasses three key components. Firstly, a temporal convolutional network driven content popularity prediction model is developed to estimate the content popularity with high accuracy. Secondly, with the predicted content popularity, the concept of content caching value (CCV) is introduced to weigh the value of a content cached on a given edge server. Thirdly, an novel dynamic programming algorithm is developed to maximize the overall CCV. Extensive simulation results have demonstrated the superiority of our approach. Compared with the state-of-the-art caching schemes, LECS can improve the cache hit rate by 8.3%-10.1%, and reduce the average content delivery delay by 9.1%-15.1%.",
"title": "Cooperative Edge Caching Based on Temporal Convolutional Networks",
"normalizedTitle": "Cooperative Edge Caching Based on Temporal Convolutional Networks",
"fno": "09650595",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Cache Storage",
"Convolutional Neural Nets",
"Cooperative Communication",
"Dynamic Programming",
"Internet",
"Multimedia Communication",
"Temporal Convolutional Network",
"Networked Multimedia Services",
"Wireless Network Traffic",
"Learning Based Edge Caching Scheme",
"Mutual Cooperation",
"Caching Resources",
"Content Caching Problem",
"Optimization Problem",
"Learning Based Cooperative Caching Strategy",
"Content Popularity Prediction Model",
"Predicted Content Popularity",
"Content Caching Value",
"Edge Server",
"Caching Schemes",
"Cache Hit Rate",
"Average Content Delivery Delay",
"Conferences",
"Portable Document Format",
"Indexes",
"Typesetting",
"Printing",
"Loading",
"Web Sites",
"Cooperative Edge Caching",
"Temporal Convolutional Networks",
"Content Caching Value",
"Content Popularity"
],
"authors": [
{
"givenName": "Xu",
"surname": "Zhang",
"fullName": "Xu Zhang",
"affiliation": "Department of Computer Science, College of Engineering, Mathematics, and Physical Sciences, University of Exeter, Exeter, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhengnan",
"surname": "Qi",
"fullName": "Zhengnan Qi",
"affiliation": "School of Electronic Science and Engineering, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Geyong",
"surname": "Min",
"fullName": "Geyong Min",
"affiliation": "Department of Computer Science, College of Engineering, Mathematics, and Physical Sciences, University of Exeter, Exeter, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wang",
"surname": "Miao",
"fullName": "Wang Miao",
"affiliation": "Department of Computer Science, College of Engineering, Mathematics, and Physical Sciences, University of Exeter, Exeter, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qilin",
"surname": "Fan",
"fullName": "Qilin Fan",
"affiliation": "School of Big Data and Software Engineering, Chongqing University, Chongqing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhan",
"surname": "Ma",
"fullName": "Zhan Ma",
"affiliation": "School of Electronic Science and Engineering, Nanjing University, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "2093-2105",
"year": "2022",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/sc/2023/02/09772368",
"title": "Shrinking the Kernel Attack Surface Through Static and Dynamic Syscall Limitation",
"doi": null,
"abstractUrl": "/journal/sc/2023/02/09772368/1DgjvFwHct2",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09861697",
"title": "Multi-Objective Parallel Task Offloading and Content Caching in D2D-aided MEC Networks",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09861697/1FWhW0LZsDm",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iucc-cit-dsci-smartcns/2022/7726/0/772600a073",
"title": "Cooperative Caching Strategy Based on Dynamic Cache Value Perception in Edge Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iucc-cit-dsci-smartcns/2022/772600a073/1M4rfEY2k36",
"parentPublication": {
"id": "proceedings/iucc-cit-dsci-smartcns/2022/7726/0",
"title": "2022 IEEE 21st International Conference on Ubiquitous Computing and Communications (IUCC/CIT/DSCI/SmartCNS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/06/09397284",
"title": "Plasticity-on-Chip Design: Exploiting Self-Similarity for Data Communications",
"doi": null,
"abstractUrl": "/journal/tc/2021/06/09397284/1sA4XChIK6A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2022/05/09395239",
"title": "A Trust Model for SLA Negotiation Candidates Selection in a Dynamic IoT Environment",
"doi": null,
"abstractUrl": "/journal/sc/2022/05/09395239/1sypXMeQzRu",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09395237",
"title": "Manifold-Inspired Search-Based Algorithm for Automated Test Case Generation",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09395237/1syqhlKA1Q4",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09616408",
"title": "Pull Request Governance in Open Source Communities",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09616408/1yA77WD69DG",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09619951",
"title": "Mesh Convolutional Networks With Face and Vertex Feature Operators",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09619951/1yDftLVqexG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09664358",
"title": "Hybrid Static-Dynamic Analysis of Data Races Caused by Inconsistent Locking Discipline in Device Drivers",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09664358/1zHDJf1LXLW",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09645177",
"title": "Event Detection With Dynamic Word-Trigger-Argument Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09645177/1zc6wR47sFW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09647942",
"articleId": "1ziKjJyLwnC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09650699",
"articleId": "1zkp1EHkyI0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1wznCBm2ynS",
"title": "July-Sept.",
"year": "2021",
"issueNum": "03",
"idPrefix": "cc",
"pubType": "journal",
"volume": "9",
"label": "July-Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "187PRKXSEGQ",
"doi": "10.1109/TCC.2019.2902384",
"abstract": "<italic>Control-Flow Integrity</italic> (CFI) is one of the most promising techniques against control-flow hijacking attacks. For <italic>Commercial Off-the-Shelf</italic> (COTS) binaries, a number of solutions provide coarse-grained CFI and thus are context-insensitive, while having the benefit of introducing a low runtime overhead. However, they can hardly defend against elaborately designed attacks due to the inaccuracy of the <italic>Control-Flow Graphs</italic> (CFGs). This paper presents <italic>CloudCFI</italic>, a context-sensitive and incremental CFI, which specifically makes full use of the characteristic of the cloud environment, where multiple instances of a software run on multiple virtual machines, and the control flow checking result from one software instance could be utilized to handle the control-hijacking occurred on other sibling instances. In <italic>CloudCFI</italic>, the accuracy of the control flow checking can be continuously increased to offer the incremental CFI, and a context-sensitive CFI policy is enforced to determine the validity of the control flow of the execution path through checking the entire execution path instead of the single edge or partial edges in the execution path. <italic>CloudCFI</italic> includes the static phase and the runtime phase respectively. Control-flow information and basic-block information is collected through emulation execution in the static phase, and the execution paths are tracked in runtime phase to collect process-tracking information. Next, it recovers the execution path by using basic-block information and process-tracking information, and checks the validity of the control flow by using the control-flow information. A prototype system is implemented and evaluated from several aspects using RIPE and SPEC benchmarks, as well as real-world cloud applications, Memcached and Redis. The evaluation results show that <italic>CloudCFI</italic> can defend against most common control-flow hijacking attacks. Meanwhile, it only introduces a low runtime performance overhead.",
"abstracts": [
{
"abstractType": "Regular",
"content": "<italic>Control-Flow Integrity</italic> (CFI) is one of the most promising techniques against control-flow hijacking attacks. For <italic>Commercial Off-the-Shelf</italic> (COTS) binaries, a number of solutions provide coarse-grained CFI and thus are context-insensitive, while having the benefit of introducing a low runtime overhead. However, they can hardly defend against elaborately designed attacks due to the inaccuracy of the <italic>Control-Flow Graphs</italic> (CFGs). This paper presents <italic>CloudCFI</italic>, a context-sensitive and incremental CFI, which specifically makes full use of the characteristic of the cloud environment, where multiple instances of a software run on multiple virtual machines, and the control flow checking result from one software instance could be utilized to handle the control-hijacking occurred on other sibling instances. In <italic>CloudCFI</italic>, the accuracy of the control flow checking can be continuously increased to offer the incremental CFI, and a context-sensitive CFI policy is enforced to determine the validity of the control flow of the execution path through checking the entire execution path instead of the single edge or partial edges in the execution path. <italic>CloudCFI</italic> includes the static phase and the runtime phase respectively. Control-flow information and basic-block information is collected through emulation execution in the static phase, and the execution paths are tracked in runtime phase to collect process-tracking information. Next, it recovers the execution path by using basic-block information and process-tracking information, and checks the validity of the control flow by using the control-flow information. A prototype system is implemented and evaluated from several aspects using RIPE and SPEC benchmarks, as well as real-world cloud applications, Memcached and Redis. The evaluation results show that <italic>CloudCFI</italic> can defend against most common control-flow hijacking attacks. Meanwhile, it only introduces a low runtime performance overhead.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Control-Flow Integrity (CFI) is one of the most promising techniques against control-flow hijacking attacks. For Commercial Off-the-Shelf (COTS) binaries, a number of solutions provide coarse-grained CFI and thus are context-insensitive, while having the benefit of introducing a low runtime overhead. However, they can hardly defend against elaborately designed attacks due to the inaccuracy of the Control-Flow Graphs (CFGs). This paper presents CloudCFI, a context-sensitive and incremental CFI, which specifically makes full use of the characteristic of the cloud environment, where multiple instances of a software run on multiple virtual machines, and the control flow checking result from one software instance could be utilized to handle the control-hijacking occurred on other sibling instances. In CloudCFI, the accuracy of the control flow checking can be continuously increased to offer the incremental CFI, and a context-sensitive CFI policy is enforced to determine the validity of the control flow of the execution path through checking the entire execution path instead of the single edge or partial edges in the execution path. CloudCFI includes the static phase and the runtime phase respectively. Control-flow information and basic-block information is collected through emulation execution in the static phase, and the execution paths are tracked in runtime phase to collect process-tracking information. Next, it recovers the execution path by using basic-block information and process-tracking information, and checks the validity of the control flow by using the control-flow information. A prototype system is implemented and evaluated from several aspects using RIPE and SPEC benchmarks, as well as real-world cloud applications, Memcached and Redis. The evaluation results show that CloudCFI can defend against most common control-flow hijacking attacks. Meanwhile, it only introduces a low runtime performance overhead.",
"title": "CloudCFI: Context-Sensitive and Incremental CFI in the Cloud Environment",
"normalizedTitle": "CloudCFI: Context-Sensitive and Incremental CFI in the Cloud Environment",
"fno": "08656535",
"hasPdf": true,
"idPrefix": "cc",
"keywords": [
"Cloud Computing",
"Embedded Systems",
"Flow Graphs",
"Security Of Data",
"Virtual Machines",
"Incremental CFI",
"Context Sensitive CFI Policy",
"Execution Path",
"Cloud CFI",
"Static Phase",
"Runtime Phase",
"Control Flow Information",
"Basic Block Information",
"Process Tracking Information",
"Control Flow Hijacking Attacks",
"Cloud Environment",
"Control Flow Integrity",
"Coarse Grained CFI",
"Control Flow Graphs",
"Control Hijacking",
"Control Flow Checking",
"Commercial Off The Shelf Binaries",
"COTS",
"Memcached",
"Redis",
"Virtual Machines",
"Cloud Computing",
"Runtime",
"Operating Systems",
"Hardware",
"Aerospace Electronics",
"Libraries",
"Control Flow Integrity",
"Context Sensitive",
"Cloud",
"Entire Execution Path"
],
"authors": [
{
"givenName": "Weizhong",
"surname": "Qiang",
"fullName": "Weizhong Qiang",
"affiliation": "National Engineering Research Center for Big Data Technology and System, Services Computing Technology and System Lab, Cluster and Grid Computing Lab, Big Data Security Engineering Research Center, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingda",
"surname": "Huang",
"fullName": "Yingda Huang",
"affiliation": "National Engineering Research Center for Big Data Technology and System, Services Computing Technology and System Lab, Cluster and Grid Computing Lab, Big Data Security Engineering Research Center, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hai",
"surname": "Jin",
"fullName": "Hai Jin",
"affiliation": "National Engineering Research Center for Big Data Technology and System, Services Computing Technology and System Lab, Cluster and Grid Computing Lab, Big Data Security Engineering Research Center, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Laurence T.",
"surname": "Yang",
"fullName": "Laurence T. Yang",
"affiliation": "Shenzhen Huazhong University of Science and Technology Research Institute, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Deqing",
"surname": "Zou",
"fullName": "Deqing Zou",
"affiliation": "National Engineering Research Center for Big Data Technology and System, Services Computing Technology and System Lab, Cluster and Grid Computing Lab, Big Data Security Engineering Research Center, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-07-01 00:00:00",
"pubType": "trans",
"pages": "938-957",
"year": "2021",
"issn": "2168-7161",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3pgcic/2014/4171/0/4171a189",
"title": "Static-Dynamic Control Flow Integrity",
"doi": null,
"abstractUrl": "/proceedings-article/3pgcic/2014/4171a189/12OmNwBBqbr",
"parentPublication": {
"id": "proceedings/3pgcic/2014/4171/0",
"title": "2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2018/5663/0/566301a195",
"title": "Poster: Live Path Control Flow Integrity",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2018/566301a195/13bd1gQYgDU",
"parentPublication": {
"id": "proceedings/icse-companion/2018/5663/0",
"title": "2018 IEEE/ACM 40th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2016/11/07464886",
"title": "A Fine-Grained Control Flow Integrity Approach Against Runtime Memory Attacks for Embedded Systems",
"doi": null,
"abstractUrl": "/journal/si/2016/11/07464886/13rRUxjQyn0",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icise/2018/6259/0/625900a051",
"title": "SMP: A New Mechanism to Mitigate Control-Flow Hijacking Attacks",
"doi": null,
"abstractUrl": "/proceedings-article/icise/2018/625900a051/17D45VObpPQ",
"parentPublication": {
"id": "proceedings/icise/2018/6259/0",
"title": "2018 3rd International Conference on Information Systems Engineering (ICISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2015/6949/0/6949a745",
"title": "Counterfeit Object-oriented Programming: On the Difficulty of Preventing Code Reuse Attacks in C++ Applications",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2015/6949a745/17D45VsBU41",
"parentPublication": {
"id": "proceedings/sp/2015/6949/0",
"title": "2015 IEEE Symposium on Security and Privacy (SP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgo/2019/1436/0/08661202",
"title": "Smokestack: Thwarting DOP Attacks with Runtime Stack Layout Randomization",
"doi": null,
"abstractUrl": "/proceedings-article/cgo/2019/08661202/18j8Uri2FvG",
"parentPublication": {
"id": "proceedings/cgo/2019/1436/0",
"title": "2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/host/2021/1357/0/09702268",
"title": "Protecting Indirect Branches Against Fault Attacks Using ARM Pointer Authentication",
"doi": null,
"abstractUrl": "/proceedings-article/host/2021/09702268/1AZOWkmzkXu",
"parentPublication": {
"id": "proceedings/host/2021/1357/0",
"title": "2021 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipcw/2022/3388/0/338800a047",
"title": "A Security Analysis of Labeling-Based Control-Flow Integrity Schemes",
"doi": null,
"abstractUrl": "/proceedings-article/hipcw/2022/338800a047/1LRksHFN7Ow",
"parentPublication": {
"id": "proceedings/hipcw/2022/3388/0",
"title": "2022 IEEE 29th International Conference on High Performance Computing, Data and Analytics Workshop (HiPCW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euros&p/2019/1148/0/114800a095",
"title": "Adaptive Call-Site Sensitive Control Flow Integrity",
"doi": null,
"abstractUrl": "/proceedings-article/euros&p/2019/114800a095/1cI6e2cvsY0",
"parentPublication": {
"id": "proceedings/euros&p/2019/1148/0",
"title": "2019 IEEE European Symposium on Security and Privacy (EuroS&P)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/05/09097354",
"title": "Random CFI (RCFI): Efficient Fine-Grained Control-Flow Integrity Through Random Verification",
"doi": null,
"abstractUrl": "/journal/tc/2021/05/09097354/1jZ6305sl20",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08676357",
"articleId": "18Nk7LlUIAE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08613907",
"articleId": "17D45VsBTTq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1AZLrCRoM4U",
"title": "Feb.",
"year": "2022",
"issueNum": "02",
"idPrefix": "ts",
"pubType": "journal",
"volume": "48",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1kkFHDSIB4k",
"doi": "10.1109/TSE.2020.2999534",
"abstract": "As static data-flow analysis becomes able to report increasingly complex bugs, using an evergrowing set of complex internal rules encoded into flow functions, the analysis tools themselves grow more and more complex. In result, for users to be able to effectively use those tools on specific codebases, they require special configurations—a task which in industry is typically performed by individual developers or dedicated teams. To efficiently use and configure static analysis tools, developers need to build a certain understanding of the analysis’ rules, i.e., how the underlying analyses interpret the analyzed code and their reasoning for reporting certain warnings. In this article, we explore how to assist developers in understanding the analysis’ warnings, and finding weaknesses in the analysis’ rules. To this end, we introduce the concept of <italic>rule graphs</italic> that expose to the developer selected information about the internal rules of data-flow analyses. We have implemented rule graphs on top of a taint analysis, and show how the graphs can support the abovementioned tasks. Our user study and empirical evaluation show that using rule graphs helps developers understand analysis warnings more accurately than using simple warning traces, and that rule graphs can help developers identify causes for false positives in analysis rules.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As static data-flow analysis becomes able to report increasingly complex bugs, using an evergrowing set of complex internal rules encoded into flow functions, the analysis tools themselves grow more and more complex. In result, for users to be able to effectively use those tools on specific codebases, they require special configurations—a task which in industry is typically performed by individual developers or dedicated teams. To efficiently use and configure static analysis tools, developers need to build a certain understanding of the analysis’ rules, i.e., how the underlying analyses interpret the analyzed code and their reasoning for reporting certain warnings. In this article, we explore how to assist developers in understanding the analysis’ warnings, and finding weaknesses in the analysis’ rules. To this end, we introduce the concept of <italic>rule graphs</italic> that expose to the developer selected information about the internal rules of data-flow analyses. We have implemented rule graphs on top of a taint analysis, and show how the graphs can support the abovementioned tasks. Our user study and empirical evaluation show that using rule graphs helps developers understand analysis warnings more accurately than using simple warning traces, and that rule graphs can help developers identify causes for false positives in analysis rules.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As static data-flow analysis becomes able to report increasingly complex bugs, using an evergrowing set of complex internal rules encoded into flow functions, the analysis tools themselves grow more and more complex. In result, for users to be able to effectively use those tools on specific codebases, they require special configurations—a task which in industry is typically performed by individual developers or dedicated teams. To efficiently use and configure static analysis tools, developers need to build a certain understanding of the analysis’ rules, i.e., how the underlying analyses interpret the analyzed code and their reasoning for reporting certain warnings. In this article, we explore how to assist developers in understanding the analysis’ warnings, and finding weaknesses in the analysis’ rules. To this end, we introduce the concept of rule graphs that expose to the developer selected information about the internal rules of data-flow analyses. We have implemented rule graphs on top of a taint analysis, and show how the graphs can support the abovementioned tasks. Our user study and empirical evaluation show that using rule graphs helps developers understand analysis warnings more accurately than using simple warning traces, and that rule graphs can help developers identify causes for false positives in analysis rules.",
"title": "Explaining Static Analysis With Rule Graphs",
"normalizedTitle": "Explaining Static Analysis With Rule Graphs",
"fno": "09106860",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Data Flow Analysis",
"Graph Theory",
"Software Tools",
"Taint Analysis",
"Rule Graphs",
"Analysis Rules",
"Static Data Flow Analysis",
"Complex Bugs",
"Complex Internal Rules",
"Flow Functions",
"Static Analysis Tools",
"Static Analysis",
"Tools",
"SQL Injection",
"Task Analysis",
"Computer Bugs",
"Cognition",
"Usability",
"Program Analysis",
"Data Flow Analysis",
"Rule Graphs",
"Analysis Configuration",
"Explainability",
"Usability"
],
"authors": [
{
"givenName": "Lisa Nguyen Quang",
"surname": "Do",
"fullName": "Lisa Nguyen Quang Do",
"affiliation": "Paderborn University, Paderborn, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eric",
"surname": "Bodden",
"fullName": "Eric Bodden",
"affiliation": "Paderborn University and Fraunhofer IEM, Paderborn, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2022-02-01 00:00:00",
"pubType": "trans",
"pages": "678-690",
"year": "2022",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/ts/2019/09/08303758",
"title": "How Developers Diagnose Potential Security Vulnerabilities with a Static Analysis Tool",
"doi": null,
"abstractUrl": "/journal/ts/2019/09/08303758/13rRUwh80Dj",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2021/3784/0/378400a327",
"title": "Ranking Warnings of Static Analysis Tools Using Representation Learning",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2021/378400a327/1B4m7QC0SiI",
"parentPublication": {
"id": "proceedings/apsec/2021/3784/0",
"title": "2021 28th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/09756950",
"title": "Sorald: Automatic Patch Suggestions for SonarQube Static Analysis Violations",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09756950/1Cxvgrbttvy",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2022/9298/0/929800a516",
"title": "Find Bugs in Static Bug Finders",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2022/929800a516/1EpKKbUIfPG",
"parentPublication": {
"id": "proceedings/icpc/2022/9298/0",
"title": "2022 IEEE/ACM 30th International Conference on Program Comprehension (ICPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saner/2022/3786/0/378600a805",
"title": "Static Analysis Warnings and Automatic Fixing: A Replication for C# Projects",
"doi": null,
"abstractUrl": "/proceedings-article/saner/2022/378600a805/1FbSZMIaFQk",
"parentPublication": {
"id": "proceedings/saner/2022/3786/0",
"title": "2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2023/04/10012496",
"title": "How to Find Actionable Static Analysis Warnings: A Case Study With FindBugs",
"doi": null,
"abstractUrl": "/journal/ts/2023/04/10012496/1JNmOfvADJe",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-seip/2019/1760/0/176000a051",
"title": "Towards Better Utilizing Static Application Security Testing",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seip/2019/176000a051/1cJ7tJSS6ti",
"parentPublication": {
"id": "proceedings/icse-seip/2019/1760/0",
"title": "2019 IEEE/ACM 41st International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnisc/2017/1618/0/161800a122",
"title": "A New Static Vulnerabilities Analysis Algorithm for PHP Codes",
"doi": null,
"abstractUrl": "/proceedings-article/icnisc/2017/161800a122/1dUn8jnPszu",
"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/ts/2022/03/09124719",
"title": "Why Do Software Developers Use Static Analysis Tools? A User-Centered Study of Developer Needs and Motivations",
"doi": null,
"abstractUrl": "/journal/ts/2022/03/09124719/1kVbIHXny1y",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/botse/2021/4468/0/446800a026",
"title": "SAW-BOT: Proposing Fixes for Static Analysis Warnings with GitHub Suggestions",
"doi": null,
"abstractUrl": "/proceedings-article/botse/2021/446800a026/1v2Ql4SxF16",
"parentPublication": {
"id": "proceedings/botse/2021/4468/0",
"title": "2021 IEEE/ACM Third International Workshop on Bots in Software Engineering (BotSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09106854",
"articleId": "1kkFHUVMNsA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09108630",
"articleId": "1koLgVDh5HW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1BrwxcLOaYM",
"title": "Jan.-March",
"year": "2022",
"issueNum": "01",
"idPrefix": "ec",
"pubType": "journal",
"volume": "10",
"label": "Jan.-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1nnSSKB9HeE",
"doi": "10.1109/TETC.2020.3026335",
"abstract": "The growing number and diversity of applications make malware detection and app recommendation for users more challenging. In this work, we design a framework <sc>AppDNA</sc> to automatically generate a compact representation for each app to comprehensively profile its behaviors. The versatile representation can be generated once for each app, and then be used for a wide variety of objectives, including malware detection, app categorization and app version detection, <italic>etc</italic>. We propose to conduct a function-call-graph-based app profiling scheme based on a comprehensive and deep understanding of an app’s behaviors. We design a graph-encoding method to convert a large function call graph to a 64-dimensional fixed length vector to achieve robust app profiling. Our extensive evaluations on 86,332 apps demonstrate that our approach performs app profiling with high accuracy and low computation cost: it takes about 46.5 seconds for one app to extract its function call graph; 0.68 seconds to encode a function call graph; it classifies all 4,024 (benign/malware) apps in around 5.06 seconds with accuracy about 93.07 percent; it classifies all 570 malicious apps’ family (21 families in total) in around 0.83 seconds with accuracy 82.3 percent; it classifies 9,730 apps’ functionality into 2 categories with accuracy 88.1 percent or into 7 categories with accuracy 33.3 percent.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The growing number and diversity of applications make malware detection and app recommendation for users more challenging. In this work, we design a framework <sc>AppDNA</sc> to automatically generate a compact representation for each app to comprehensively profile its behaviors. The versatile representation can be generated once for each app, and then be used for a wide variety of objectives, including malware detection, app categorization and app version detection, <italic>etc</italic>. We propose to conduct a function-call-graph-based app profiling scheme based on a comprehensive and deep understanding of an app’s behaviors. We design a graph-encoding method to convert a large function call graph to a 64-dimensional fixed length vector to achieve robust app profiling. Our extensive evaluations on 86,332 apps demonstrate that our approach performs app profiling with high accuracy and low computation cost: it takes about 46.5 seconds for one app to extract its function call graph; 0.68 seconds to encode a function call graph; it classifies all 4,024 (benign/malware) apps in around 5.06 seconds with accuracy about 93.07 percent; it classifies all 570 malicious apps’ family (21 families in total) in around 0.83 seconds with accuracy 82.3 percent; it classifies 9,730 apps’ functionality into 2 categories with accuracy 88.1 percent or into 7 categories with accuracy 33.3 percent.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The growing number and diversity of applications make malware detection and app recommendation for users more challenging. In this work, we design a framework AppDNA to automatically generate a compact representation for each app to comprehensively profile its behaviors. The versatile representation can be generated once for each app, and then be used for a wide variety of objectives, including malware detection, app categorization and app version detection, etc. We propose to conduct a function-call-graph-based app profiling scheme based on a comprehensive and deep understanding of an app’s behaviors. We design a graph-encoding method to convert a large function call graph to a 64-dimensional fixed length vector to achieve robust app profiling. Our extensive evaluations on 86,332 apps demonstrate that our approach performs app profiling with high accuracy and low computation cost: it takes about 46.5 seconds for one app to extract its function call graph; 0.68 seconds to encode a function call graph; it classifies all 4,024 (benign/malware) apps in around 5.06 seconds with accuracy about 93.07 percent; it classifies all 570 malicious apps’ family (21 families in total) in around 0.83 seconds with accuracy 82.3 percent; it classifies 9,730 apps’ functionality into 2 categories with accuracy 88.1 percent or into 7 categories with accuracy 33.3 percent.",
"title": "AppDNA: Profiling App Behavior via Deep-Learning Function Call Graphs",
"normalizedTitle": "AppDNA: Profiling App Behavior via Deep-Learning Function Call Graphs",
"fno": "09205639",
"hasPdf": true,
"idPrefix": "ec",
"keywords": [
"Deep Learning Artificial Intelligence",
"Flow Graphs",
"Invasive Software",
"Mobile Computing",
"Pattern Classification",
"Profiling App Behavior",
"Deep Learning",
"Malware Detection",
"App Recommendation",
"App Categorization",
"Function Call Graph",
"App Profiling",
"Graph Encoding",
"App DNA",
"App Version Detection",
"64 Dimensional Fixed Length Vector",
"Malicious App Family Classification",
"Malware",
"Encoding",
"Feature Extraction",
"Task Analysis",
"Neural Networks",
"Robustness",
"Smart Phones",
"Malware Detection",
"App Profiling",
"Graph Embedding",
"Deep Learning"
],
"authors": [
{
"givenName": "Anran",
"surname": "Li",
"fullName": "Anran Li",
"affiliation": "University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuangshuang",
"surname": "Xue",
"fullName": "Shuangshuang Xue",
"affiliation": "University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiang-Yang",
"surname": "Li",
"fullName": "Xiang-Yang Li",
"affiliation": "University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lan",
"surname": "Zhang",
"fullName": "Lan Zhang",
"affiliation": "University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianwei",
"surname": "Qian",
"fullName": "Jianwei Qian",
"affiliation": "Illinois Institute of Technology, Chicago, IL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "414-427",
"year": "2022",
"issn": "2168-6750",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipccc/2016/5252/0/07820624",
"title": "Detecting and defending against inter-app permission leaks in android apps",
"doi": null,
"abstractUrl": "/proceedings-article/ipccc/2016/07820624/12OmNBCqbEu",
"parentPublication": {
"id": "proceedings/ipccc/2016/5252/0",
"title": "2016 IEEE 35th International Performance Computing and Communications Conference (IPCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mobilesoft/2017/2669/0/07972728",
"title": "ACCUSE: Helping Users to Minimize Android App Privacy Concerns",
"doi": null,
"abstractUrl": "/proceedings-article/mobilesoft/2017/07972728/12OmNBt3qlO",
"parentPublication": {
"id": "proceedings/mobilesoft/2017/2669/0",
"title": "2017 IEEE/ACM 4th International Conference on Mobile Software Engineering and Systems (MOBILESoft)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cscloud/2016/0946/0/07545916",
"title": "Mobile App Collusions and Its Cyber Security Implications",
"doi": null,
"abstractUrl": "/proceedings-article/cscloud/2016/07545916/12OmNrAdsu9",
"parentPublication": {
"id": "proceedings/cscloud/2016/0946/0",
"title": "2016 IEEE 3rd International Conference on Cyber Security and Cloud Computing (CSCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2017/2684/0/08115638",
"title": "All about activity injection: Threats, semantics, and detection",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2017/08115638/12OmNy68ECP",
"parentPublication": {
"id": "proceedings/ase/2017/2684/0",
"title": "2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mobilesoft/2016/4178/0/07832956",
"title": "Inter-App Communication between Android Apps Developed in App-Inventor and Android Studio",
"doi": null,
"abstractUrl": "/proceedings-article/mobilesoft/2016/07832956/12OmNyfvpSl",
"parentPublication": {
"id": "proceedings/mobilesoft/2016/4178/0",
"title": "2016 IEEE/ACM International Conference on Mobile Software Engineering and Systems (MOBILESoft)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2014/4274/0/4274b242",
"title": "Interoperability-Enriched App Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2014/4274b242/12OmNzSQdqC",
"parentPublication": {
"id": "proceedings/icdmw/2014/4274/0",
"title": "2014 IEEE International Conference on Data Mining Workshop (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2018/5638/0/563801a728",
"title": "Self-Hiding Behavior in Android Apps: Detection and Characterization",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2018/563801a728/13l5ObEgr4d",
"parentPublication": {
"id": "proceedings/icse/2018/5638/0",
"title": "2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/08/07045553",
"title": "APP Relationship Calculation: An Iterative Process",
"doi": null,
"abstractUrl": "/journal/tk/2015/08/07045553/13rRUwbaqLU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2018/5716/0/571601a231",
"title": "Why are Android Apps Removed From Google Play? A Large-Scale Empirical Study",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2018/571601a231/17D45We0UCm",
"parentPublication": {
"id": "proceedings/msr/2018/5716/0",
"title": "2018 IEEE/ACM 15th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/04/09384173",
"title": "Who Moves My App Promotion Investment? A Systematic Study About App Distribution Fraud",
"doi": null,
"abstractUrl": "/journal/tq/2022/04/09384173/1scDzU9zAQw",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09204468",
"articleId": "1nkz3WDSuAg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09205854",
"articleId": "1npxWRhR4d2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBCZnUj",
"title": "Mar.-Apr.",
"year": "2015",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "35",
"label": "Mar.-Apr.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCitB0",
"doi": "10.1109/MCG.2015.29",
"abstract": "Data visualization is a powerful tool to communicate data in a clear, digestible format through graphical means. To be effective, however, form and function need to work in tandem, filtering layers of noise to reveal the key aspects of the analyzed data. Indeed, this could prove to be sufficient in discovering already known patterns. Still, the search for undiscovered patterns would require the full dataset to be presented as a whole, which bears the risk of sensory overload. Human sensory systems function as a systemic unit in relation to one another, dynamically sampling the signals around us to give a concise scene analysis. To decipher a complex, multidimensional dataset, a representational system that is able to reproduce the layers of information through different stimulations would be required. This article explores the possibilities of using multimodal data representation as a method to communicate multidimensional data, guided by the principles of Gestalt psychology. Point Cloud, an artwork that implements such explorations through the visualization and sonification of lightning data is presented as an application of this research. The Web extra can be found at http://youtu.be/pQtxsvgv80E.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data visualization is a powerful tool to communicate data in a clear, digestible format through graphical means. To be effective, however, form and function need to work in tandem, filtering layers of noise to reveal the key aspects of the analyzed data. Indeed, this could prove to be sufficient in discovering already known patterns. Still, the search for undiscovered patterns would require the full dataset to be presented as a whole, which bears the risk of sensory overload. Human sensory systems function as a systemic unit in relation to one another, dynamically sampling the signals around us to give a concise scene analysis. To decipher a complex, multidimensional dataset, a representational system that is able to reproduce the layers of information through different stimulations would be required. This article explores the possibilities of using multimodal data representation as a method to communicate multidimensional data, guided by the principles of Gestalt psychology. Point Cloud, an artwork that implements such explorations through the visualization and sonification of lightning data is presented as an application of this research. The Web extra can be found at http://youtu.be/pQtxsvgv80E.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data visualization is a powerful tool to communicate data in a clear, digestible format through graphical means. To be effective, however, form and function need to work in tandem, filtering layers of noise to reveal the key aspects of the analyzed data. Indeed, this could prove to be sufficient in discovering already known patterns. Still, the search for undiscovered patterns would require the full dataset to be presented as a whole, which bears the risk of sensory overload. Human sensory systems function as a systemic unit in relation to one another, dynamically sampling the signals around us to give a concise scene analysis. To decipher a complex, multidimensional dataset, a representational system that is able to reproduce the layers of information through different stimulations would be required. This article explores the possibilities of using multimodal data representation as a method to communicate multidimensional data, guided by the principles of Gestalt psychology. Point Cloud, an artwork that implements such explorations through the visualization and sonification of lightning data is presented as an application of this research. The Web extra can be found at http://youtu.be/pQtxsvgv80E.",
"title": "Gestalt Principles in Multimodal Data Representation",
"normalizedTitle": "Gestalt Principles in Multimodal Data Representation",
"fno": "mcg2015020080",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualization",
"Psychology",
"Sonification",
"Cloud Computing",
"Granular Synthesis",
"Point Cloud",
"Computer Graphics",
"Gestalt Psychology",
"Multimodal",
"Visualization",
"Sonification",
"Pointillism",
"Granular Synthesis"
],
"authors": [
{
"givenName": "Muhammad Hafiz Wan",
"surname": "Rosli",
"fullName": "Muhammad Hafiz Wan Rosli",
"affiliation": "University of California, Santa Barbara",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andres",
"surname": "Cabrera",
"fullName": "Andres Cabrera",
"affiliation": "University of California, Santa Barbara",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2015-03-01 00:00:00",
"pubType": "mags",
"pages": "80-87",
"year": "2015",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visap/2017/3490/0/08282372",
"title": "California drought impact: Multimodal data representation to predict the water cycle",
"doi": null,
"abstractUrl": "/proceedings-article/visap/2017/08282372/12OmNA0dMNk",
"parentPublication": {
"id": "proceedings/visap/2017/3490/0",
"title": "2017 IEEE VIS Arts Program (VISAP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0/07847177",
"title": "UVisP: User-centric Visualization of Data Provenance with Gestalt Principles",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2016/07847177/12OmNBJNL12",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0",
"title": "2016 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/1/212810044",
"title": "Compact Representation of Multidimensional Data Using Tensor Rank-One Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212810044/12OmNvT2p7y",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2002/1656/0/16560730",
"title": "Representing Spatial Information through Multimodal Interfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2002/16560730/12OmNwdtw7K",
"parentPublication": {
"id": "proceedings/iv/2002/1656/0",
"title": "Proceedings Sixth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/edocw/2016/9933/0/07584360",
"title": "Exploring the Role of Enterprise Architecture in IS-enabled Ot: An EA Principles Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/edocw/2016/07584360/12OmNwekjCt",
"parentPublication": {
"id": "proceedings/edocw/2016/9933/0",
"title": "2016 IEEE 20th International Enterprise Distributed Object Computing Workshop (EDOCW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2002/1656/0/16560737",
"title": "Applying Gestalt Principles to Animated Visualizations of Network Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2002/16560737/12OmNzTYC0F",
"parentPublication": {
"id": "proceedings/iv/2002/1656/0",
"title": "Proceedings Sixth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/06/mco2013060084",
"title": "Empowering Users through Secure On-Demand Data Provisioning",
"doi": null,
"abstractUrl": "/magazine/co/2013/06/mco2013060084/13rRUypGGeu",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iotdi/2022/9641/0/964100a043",
"title": "Multimodal Federated Learning on IoT Data",
"doi": null,
"abstractUrl": "/proceedings-article/iotdi/2022/964100a043/1ErraMJTd2U",
"parentPublication": {
"id": "proceedings/iotdi/2022/9641/0",
"title": "2022 IEEE/ACM Seventh International Conference on Internet-of-Things Design and Implementation (IoTDI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saner/2022/3786/0/378600b278",
"title": "Accessing the Presentation of Causal Graphs and an Application of Gestalt Principles with Eye Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/saner/2022/378600b278/1FbSXyHIgVy",
"parentPublication": {
"id": "proceedings/saner/2022/3786/0",
"title": "2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom-workshops/2021/0424/0/09430982",
"title": "Keynote: Machine learning and data analysis of multimodal affective and pain data",
"doi": null,
"abstractUrl": "/proceedings-article/percom-workshops/2021/09430982/1tROOtZ4SHK",
"parentPublication": {
"id": "proceedings/percom-workshops/2021/0424/0",
"title": "2021 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2015020079",
"articleId": "13rRUxASuk2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2015020088",
"articleId": "13rRUwh80JP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBO3K5e",
"title": "June",
"year": "2010",
"issueNum": "02",
"idPrefix": "ci",
"pubType": "journal",
"volume": "2",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUypp5ar",
"doi": "10.1109/TCIAIG.2010.2046486",
"abstract": "In this paper, we present the design, implementation, and evaluation of an end-to-end camera planning system called Darshak. Darshak automatically constructs cinematic narrative discourse of a given story in a 3-D virtual environment. It utilizes a hierarchical partial-order causal link (POCL) planning algorithm to generate narrative plans that contain story events and camera directives for filming them. Dramatic situation patterns, commonly used by writers of fictional narratives, are formalized as communicative plan operators that provide a basis for structuring the cinematic content of the story's visualization. The dramatic patterns are realized through abstract communicative operators that represent operations on a viewer's beliefs about the story and its telling. Camera shot compositions and transitions are defined in this plan-based framework as execution primitives. Darshak's performance is evaluated through a novel user study based on techniques used to evaluate existing cognitive models of narrative comprehension. Initial study reveals significant effect of the choice of visualization strategies on measured viewer comprehension. It further shows significant effect of Darshak's choice of visualization strategy on comprehension.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present the design, implementation, and evaluation of an end-to-end camera planning system called Darshak. Darshak automatically constructs cinematic narrative discourse of a given story in a 3-D virtual environment. It utilizes a hierarchical partial-order causal link (POCL) planning algorithm to generate narrative plans that contain story events and camera directives for filming them. Dramatic situation patterns, commonly used by writers of fictional narratives, are formalized as communicative plan operators that provide a basis for structuring the cinematic content of the story's visualization. The dramatic patterns are realized through abstract communicative operators that represent operations on a viewer's beliefs about the story and its telling. Camera shot compositions and transitions are defined in this plan-based framework as execution primitives. Darshak's performance is evaluated through a novel user study based on techniques used to evaluate existing cognitive models of narrative comprehension. Initial study reveals significant effect of the choice of visualization strategies on measured viewer comprehension. It further shows significant effect of Darshak's choice of visualization strategy on comprehension.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present the design, implementation, and evaluation of an end-to-end camera planning system called Darshak. Darshak automatically constructs cinematic narrative discourse of a given story in a 3-D virtual environment. It utilizes a hierarchical partial-order causal link (POCL) planning algorithm to generate narrative plans that contain story events and camera directives for filming them. Dramatic situation patterns, commonly used by writers of fictional narratives, are formalized as communicative plan operators that provide a basis for structuring the cinematic content of the story's visualization. The dramatic patterns are realized through abstract communicative operators that represent operations on a viewer's beliefs about the story and its telling. Camera shot compositions and transitions are defined in this plan-based framework as execution primitives. Darshak's performance is evaluated through a novel user study based on techniques used to evaluate existing cognitive models of narrative comprehension. Initial study reveals significant effect of the choice of visualization strategies on measured viewer comprehension. It further shows significant effect of Darshak's choice of visualization strategy on comprehension.",
"title": "Cinematic Visual Discourse: Representation, Generation, and Evaluation",
"normalizedTitle": "Cinematic Visual Discourse: Representation, Generation, and Evaluation",
"fno": "05438752",
"hasPdf": true,
"idPrefix": "ci",
"keywords": [
"Cinematography",
"Virtual Reality",
"Cinematic Visual Discourse",
"End To End Camera Planning System",
"Darshak",
"3 D Virtual Environment",
"Hierarchical Partial Order Causal Link Planning Algorithm",
"Dramatic Situation Pattern",
"Abstract Communicative Operators",
"Camera Shot Composition",
"Plan Based Framework",
"Visualization",
"Smart Cameras",
"Computational Modeling",
"Artificial Intelligence",
"Computational Intelligence",
"Virtual Environment",
"Natural Languages",
"Engineering Profession",
"Lifting Equipment",
"Computer Science",
"Discourse Generation",
"Machinima Generation",
"Planning"
],
"authors": [
{
"givenName": "Arnav",
"surname": "Jhala",
"fullName": "Arnav Jhala",
"affiliation": "Jack Baskin School of Engineering, University of California, Santa Cruz, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R. Michael",
"surname": "Young",
"fullName": "R. Michael Young",
"affiliation": "Deparment of Computer Science, North Carolina State University, Raleigh, NC, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2010-04-01 00:00:00",
"pubType": "trans",
"pages": "69-81",
"year": "2010",
"issn": "1943-068X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/ci/2009/03/05306119",
"title": "Proactive mediation in plan-based narrative environments",
"doi": null,
"abstractUrl": "/journal/ci/2009/03/05306119/13rRUEgs2vJ",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/03/mcg2006030023",
"title": "From Linear Story Generation to Branching Story Graphs",
"doi": null,
"abstractUrl": "/magazine/cg/2006/03/mcg2006030023/13rRUwInv91",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2014/02/06571208",
"title": "Shall i compare thee to another story?: an empirical study of analogy-based story generation",
"doi": null,
"abstractUrl": "/journal/ci/2014/02/06571208/13rRUxEhFv8",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2015/01/06815689",
"title": "Suspenser: a story generation system for suspense",
"doi": null,
"abstractUrl": "/journal/ci/2015/01/06815689/13rRUxk89gI",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2009/03/05288605",
"title": "Planning-based narrative generation in simulated game universes",
"doi": null,
"abstractUrl": "/journal/ci/2009/03/05288605/13rRUy0HYMl",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2009/04/05345846",
"title": "Generation of adaptive dilemma-based interactive narratives",
"doi": null,
"abstractUrl": "/journal/ci/2009/04/05345846/13rRUyp7u1u",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/t4e/2019/4227/0/422700a230",
"title": "Narrative Theory Based Metaphor Generation Framework for Technical Education",
"doi": null,
"abstractUrl": "/proceedings-article/t4e/2019/422700a230/1hgtGzYiPe0",
"parentPublication": {
"id": "proceedings/t4e/2019/4227/0",
"title": "2019 IEEE Tenth International Conference on Technology for Education (T4E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222368",
"title": "Calliope: Automatic Visual Data Story Generation from a Spreadsheet",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222368/1nTqjtc45d6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciddt/2020/0367/0/036700a068",
"title": "Research on Attention-guiding Methods in Cinematic Virtual Reality Based on Eye Tracking Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iciddt/2020/036700a068/1wutCwJe6ze",
"parentPublication": {
"id": "proceedings/iciddt/2020/0367/0",
"title": "2020 International Conference on Innovation Design and Digital Technology (ICIDDT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2021/0898/0/089800b149",
"title": "Multi-agent Story-based Settlement Generation",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2021/089800b149/1zw5RfcjGSY",
"parentPublication": {
"id": "proceedings/ictai/2021/0898/0",
"title": "2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "05484879",
"articleId": "13rRUyft7x9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05443495",
"articleId": "13rRUwx1xJT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclo6",
"title": "June",
"year": "2020",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45VUZMU0",
"doi": "10.1109/TVCG.2018.2887379",
"abstract": "Virtual reality (VR) has enjoyed significant popularity in recent years. Where navigation has been a fundamental appeal of 3D applications for decades, facilitating this in VR has been quite a challenge. Over the past decades, various virtual locomotion techniques (VLTs) have been developed that aim to offer natural, usable and efficient ways of navigating VR without inducing VR sickness. Several studies of these techniques have been conducted in order to evaluate their performance in various study conditions and virtual contexts. Taxonomies have also been proposed to either place similar techniques in meaningful categories or decompose them to their underlying design components. In this survey, we aim to aggregate and understand the current state of the art of VR locomotion research and discuss the design implications of VLTs in terms of strengths, weaknesses and applicability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Virtual reality (VR) has enjoyed significant popularity in recent years. Where navigation has been a fundamental appeal of 3D applications for decades, facilitating this in VR has been quite a challenge. Over the past decades, various virtual locomotion techniques (VLTs) have been developed that aim to offer natural, usable and efficient ways of navigating VR without inducing VR sickness. Several studies of these techniques have been conducted in order to evaluate their performance in various study conditions and virtual contexts. Taxonomies have also been proposed to either place similar techniques in meaningful categories or decompose them to their underlying design components. In this survey, we aim to aggregate and understand the current state of the art of VR locomotion research and discuss the design implications of VLTs in terms of strengths, weaknesses and applicability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Virtual reality (VR) has enjoyed significant popularity in recent years. Where navigation has been a fundamental appeal of 3D applications for decades, facilitating this in VR has been quite a challenge. Over the past decades, various virtual locomotion techniques (VLTs) have been developed that aim to offer natural, usable and efficient ways of navigating VR without inducing VR sickness. Several studies of these techniques have been conducted in order to evaluate their performance in various study conditions and virtual contexts. Taxonomies have also been proposed to either place similar techniques in meaningful categories or decompose them to their underlying design components. In this survey, we aim to aggregate and understand the current state of the art of VR locomotion research and discuss the design implications of VLTs in terms of strengths, weaknesses and applicability.",
"title": "Virtual Locomotion: A Survey",
"normalizedTitle": "Virtual Locomotion: A Survey",
"fno": "08580399",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Virtual Reality",
"Navigation",
"Virtual Locomotion Techniques",
"VLT",
"VR Sickness",
"VR Locomotion",
"Navigation",
"Legged Locomotion",
"Task Analysis",
"Monitoring",
"Visualization",
"Three Dimensional Displays",
"Space Exploration",
"Virtual Reality",
"Virtual Locomotion",
"Virtual Navigation",
"Survey",
"Taxonomy"
],
"authors": [
{
"givenName": "Majed",
"surname": "Al Zayer",
"fullName": "Majed Al Zayer",
"affiliation": "University of Nevada, Reno, NV, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "MacNeilage",
"fullName": "Paul MacNeilage",
"affiliation": "University of Nevada, Reno, NV, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eelke",
"surname": "Folmer",
"fullName": "Eelke Folmer",
"affiliation": "University of Nevada, Reno, NV, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2020-06-01 00:00:00",
"pubType": "trans",
"pages": "2315-2334",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2017/6647/0/07892348",
"title": "Steering locomotion by vestibular perturbation in room-scale VR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892348/12OmNvrMUgU",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2012/1204/0/06184180",
"title": "From virtual to actual mobility: Assessing the benefits of active locomotion through an immersive virtual environment using a motorized wheelchair",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2012/06184180/12OmNxdDFLw",
"parentPublication": {
"id": "proceedings/3dui/2012/1204/0",
"title": "2012 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446130",
"title": "Rapid, Continuous Movement Between Nodes as an Accessible Virtual Reality Locomotion Technique",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446130/13bd1f3HvEx",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/07/07946183",
"title": "Walking with Virtual People: Evaluation of Locomotion Interfaces in Dynamic Environments",
"doi": null,
"abstractUrl": "/journal/tg/2018/07/07946183/13rRUEgs2C2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vs-games/2018/7123/0/08493432",
"title": "LUTE: A Locomotion Usability Test Environmentfor Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2018/08493432/14tNJmUlJD4",
"parentPublication": {
"id": "proceedings/vs-games/2018/7123/0",
"title": "2018 10th International Conference on Virtual Worlds and Games for Serious Applications (VS-Games)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/05/09714054",
"title": "Remote research on locomotion interfaces for virtual reality: Replication of a lab-based study on teleporting interfaces",
"doi": null,
"abstractUrl": "/journal/tg/2022/05/09714054/1B0XZAXWaIg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09744001",
"title": "Influence of user posture and virtual exercise on impression of locomotion during VR observation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09744001/1C8BFV420lq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a696",
"title": "Seamless-walk: Novel Natural Virtual Reality Locomotion Method with a High-Resolution Tactile Sensor",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a696/1CJeXaYYtd6",
"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/5555/01/09761724",
"title": "Effects of Transfer Functions and Body Parts on Body-centric Locomotion in Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09761724/1CKMkLCKOSk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a452",
"title": "Studying the Inter-Relation Between Locomotion Techniques and Embodiment in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a452/1pysvNRUnD2",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08543848",
"articleId": "17D45VsBU70",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1p1cntpQSWc",
"title": "Jan.",
"year": "2021",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cHE3iFCYpy",
"doi": "10.1109/TVCG.2019.2935730",
"abstract": "Walking has always been considered as the gold standard for navigation in Virtual Reality research. Though full rotation is no longer a technical challenge, physical translation is still restricted through limited tracked areas. While rotational information has been shown to be important, the benefit of the translational component is still unclear with mixed results in previous work. To address this gap, we conducted a mixed-method experiment to compare four levels of translational cues and control: none (using the trackpad of the HTC Vive controller to translate), upper-body leaning (sitting on a “NaviChair”, leaning the upper-body to locomote), whole-body leaning/stepping (standing on a platform called NaviBoard, leaning the whole body or stepping one foot off the center to navigate), and full translation (physically walking). Results showed that translational cues and control had significant effects on various measures including task performance, task load, and simulator sickness. While participants performed significantly worse when they used a controller with no embodied translational cues, there was no significant difference between the NaviChair, NaviBoard, and actual walking. These results suggest that translational body-based motion cues and control from a low-cost leaning/stepping interface might provide enough sensory information for supporting spatial updating, spatial awareness, and efficient locomotion in VR, although future work will need to investigate how these results might or might not generalize to other tasks and scenarios.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Walking has always been considered as the gold standard for navigation in Virtual Reality research. Though full rotation is no longer a technical challenge, physical translation is still restricted through limited tracked areas. While rotational information has been shown to be important, the benefit of the translational component is still unclear with mixed results in previous work. To address this gap, we conducted a mixed-method experiment to compare four levels of translational cues and control: none (using the trackpad of the HTC Vive controller to translate), upper-body leaning (sitting on a “NaviChair”, leaning the upper-body to locomote), whole-body leaning/stepping (standing on a platform called NaviBoard, leaning the whole body or stepping one foot off the center to navigate), and full translation (physically walking). Results showed that translational cues and control had significant effects on various measures including task performance, task load, and simulator sickness. While participants performed significantly worse when they used a controller with no embodied translational cues, there was no significant difference between the NaviChair, NaviBoard, and actual walking. These results suggest that translational body-based motion cues and control from a low-cost leaning/stepping interface might provide enough sensory information for supporting spatial updating, spatial awareness, and efficient locomotion in VR, although future work will need to investigate how these results might or might not generalize to other tasks and scenarios.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Walking has always been considered as the gold standard for navigation in Virtual Reality research. Though full rotation is no longer a technical challenge, physical translation is still restricted through limited tracked areas. While rotational information has been shown to be important, the benefit of the translational component is still unclear with mixed results in previous work. To address this gap, we conducted a mixed-method experiment to compare four levels of translational cues and control: none (using the trackpad of the HTC Vive controller to translate), upper-body leaning (sitting on a “NaviChair”, leaning the upper-body to locomote), whole-body leaning/stepping (standing on a platform called NaviBoard, leaning the whole body or stepping one foot off the center to navigate), and full translation (physically walking). Results showed that translational cues and control had significant effects on various measures including task performance, task load, and simulator sickness. While participants performed significantly worse when they used a controller with no embodied translational cues, there was no significant difference between the NaviChair, NaviBoard, and actual walking. These results suggest that translational body-based motion cues and control from a low-cost leaning/stepping interface might provide enough sensory information for supporting spatial updating, spatial awareness, and efficient locomotion in VR, although future work will need to investigate how these results might or might not generalize to other tasks and scenarios.",
"title": "NaviBoard and NaviChair: Limited Translation Combined with Full Rotation for Efficient Virtual Locomotion",
"normalizedTitle": "NaviBoard and NaviChair: Limited Translation Combined with Full Rotation for Efficient Virtual Locomotion",
"fno": "08809840",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Virtual Reality",
"Physical Translation",
"Rotational Information",
"Translational Component",
"Mixed Method Experiment",
"HTC Vive Controller",
"Navi Chair",
"Navi Board",
"Task Performance",
"Embodied Translational Cues",
"Walking",
"Translational Body Based Motion Cues",
"Virtual Locomotion",
"Gold Standard",
"Navigation",
"Virtual Reality",
"Upper Body Leaning",
"Whole Body Leaning",
"Whole Body Stepping",
"Task Load",
"Simulator Sickness",
"Low Cost Leaning Interface",
"Low Cost Stepping Interface",
"Sensory Information",
"Spatial Updating",
"Spatial Awareness",
"Legged Locomotion",
"Task Analysis",
"Navigation",
"Resists",
"Wheelchairs",
"Virtual Reality",
"Input Devices",
"Adaptive Control",
"Cognitive Informatics",
"Human Computer Interaction",
"Human Factors",
"User Interface",
"Virtual Reality"
],
"authors": [
{
"givenName": "Thinh",
"surname": "Nguyen-Vo",
"fullName": "Thinh Nguyen-Vo",
"affiliation": "School of Interactive Arts + Technology, Simon Fraser University, Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernhard E.",
"surname": "Riecke",
"fullName": "Bernhard E. Riecke",
"affiliation": "School of Interactive Arts + Technology, Simon Fraser University, Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wolfgang",
"surname": "Stuerzlinger",
"fullName": "Wolfgang Stuerzlinger",
"affiliation": "School of Interactive Arts + Technology, Simon Fraser University, Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Duc-Minh",
"surname": "Pham",
"fullName": "Duc-Minh Pham",
"affiliation": "School of Interactive Arts + Technology, Simon Fraser University, Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ernst",
"surname": "Kruijff",
"fullName": "Ernst Kruijff",
"affiliation": "Institute of Visual Computing, Bonn-Rhein-Sieg University of Applied Sciences, Sankt Augustin, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2021-01-01 00:00:00",
"pubType": "trans",
"pages": "165-177",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2017/6647/0/07892227",
"title": "Guided head rotation and amplified head rotation: Evaluating semi-natural travel and viewing techniques in virtual reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892227/12OmNwseEYz",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2012/1204/0/06184180",
"title": "From virtual to actual mobility: Assessing the benefits of active locomotion through an immersive virtual environment using a motorized wheelchair",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2012/06184180/12OmNxdDFLw",
"parentPublication": {
"id": "proceedings/3dui/2012/1204/0",
"title": "2012 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/06/mcg2017060028",
"title": "Full-Body Animation of Human Locomotion in Reduced Gravity Using Physics-Based Control",
"doi": null,
"abstractUrl": "/magazine/cg/2017/06/mcg2017060028/13rRUwwslv6",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/04/08314105",
"title": "Detection Thresholds for Rotation and Translation Gains in 360° Video-Based Telepresence Systems",
"doi": null,
"abstractUrl": "/journal/tg/2018/04/08314105/13rRUxASubD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09737429",
"title": "Intentional Head-Motion Assisted Locomotion for Reducing Cybersickness",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09737429/1BQidPzNjBS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798070",
"title": "User-Centered Extension of a Locomotion Typology: Movement-Related Sensory Feedback and Spatial Learning",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798070/1cJ18ja0QXC",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090671",
"title": "The Influence of Full-Body Representation on Translation and Curvature Gain",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090671/1jIxqcIwi64",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2020/9231/0/923100a346",
"title": "Spring Stepper: A Seated VR Locomotion Controller",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2020/923100a346/1oZBBswUSzK",
"parentPublication": {
"id": "proceedings/svr/2020/9231/0",
"title": "2020 22nd Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a391",
"title": "The Effectiveness of Locomotion Interfaces Depends on Self-Motion Cues, Environmental Cues, and the Individual",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a391/1tnXFgLAfSw",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a395",
"title": "Is Walking Necessary for Effective Locomotion and Interaction in VR?",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a395/1tnXRY815xS",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08765747",
"articleId": "1bLyqDlC7cY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08771128",
"articleId": "1bVvOZfToJy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "13rRUygBw76",
"doi": "10.1109/TVCG.2012.88",
"abstract": "Recent advances in laser scanning technology have made it possible to faithfully scan a real object with tiny geometric details, such as pores and wrinkles. However, a faithful digital model should not only capture static details of the real counterpart but also be able to reproduce the deformed versions of such details. In this paper, we develop a data-driven model that has two components; the first accommodates smooth large-scale deformations and the second captures high-resolution details. Large-scale deformations are based on a nonlinear mapping between sparse control points and bone transformations. A global mapping, however, would fail to synthesize realistic geometries from sparse examples, for highly deformable models with a large range of motion. The key is to train a collection of mappings defined over regions locally in both the geometry and the pose space. Deformable fine-scale details are generated from a second nonlinear mapping between the control points and per-vertex displacements. We apply our modeling scheme to scanned human hand models, scanned face models, face models reconstructed from multiview video sequences, and manually constructed dinosaur models. Experiments show that our deformation models, learned from extremely sparse training data, are effective and robust in synthesizing highly deformable models with rich fine features, for keyframe animation as well as performance-driven animation. We also compare our results with those obtained by alternative techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent advances in laser scanning technology have made it possible to faithfully scan a real object with tiny geometric details, such as pores and wrinkles. However, a faithful digital model should not only capture static details of the real counterpart but also be able to reproduce the deformed versions of such details. In this paper, we develop a data-driven model that has two components; the first accommodates smooth large-scale deformations and the second captures high-resolution details. Large-scale deformations are based on a nonlinear mapping between sparse control points and bone transformations. A global mapping, however, would fail to synthesize realistic geometries from sparse examples, for highly deformable models with a large range of motion. The key is to train a collection of mappings defined over regions locally in both the geometry and the pose space. Deformable fine-scale details are generated from a second nonlinear mapping between the control points and per-vertex displacements. We apply our modeling scheme to scanned human hand models, scanned face models, face models reconstructed from multiview video sequences, and manually constructed dinosaur models. Experiments show that our deformation models, learned from extremely sparse training data, are effective and robust in synthesizing highly deformable models with rich fine features, for keyframe animation as well as performance-driven animation. We also compare our results with those obtained by alternative techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent advances in laser scanning technology have made it possible to faithfully scan a real object with tiny geometric details, such as pores and wrinkles. However, a faithful digital model should not only capture static details of the real counterpart but also be able to reproduce the deformed versions of such details. In this paper, we develop a data-driven model that has two components; the first accommodates smooth large-scale deformations and the second captures high-resolution details. Large-scale deformations are based on a nonlinear mapping between sparse control points and bone transformations. A global mapping, however, would fail to synthesize realistic geometries from sparse examples, for highly deformable models with a large range of motion. The key is to train a collection of mappings defined over regions locally in both the geometry and the pose space. Deformable fine-scale details are generated from a second nonlinear mapping between the control points and per-vertex displacements. We apply our modeling scheme to scanned human hand models, scanned face models, face models reconstructed from multiview video sequences, and manually constructed dinosaur models. Experiments show that our deformation models, learned from extremely sparse training data, are effective and robust in synthesizing highly deformable models with rich fine features, for keyframe animation as well as performance-driven animation. We also compare our results with those obtained by alternative techniques.",
"title": "Detail-Preserving Controllable Deformation from Sparse Examples",
"normalizedTitle": "Detail-Preserving Controllable Deformation from Sparse Examples",
"fno": "06171183",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Video Signal Processing",
"Computational Geometry",
"Computer Animation",
"Feature Extraction",
"Image Reconstruction",
"Image Sequences",
"Solid Modelling",
"Performance Driven Animation",
"Detail Preserving Controllable Deformation Sparse Examples",
"Laser Scanning Technology",
"Tiny Geometric Details",
"Object Pores",
"Object Wrinkles",
"Faithful Digital Model",
"Static Detail Capture",
"Data Driven Model",
"Smooth Large Scale Deformation",
"High Resolution Detail Capture",
"Nonlinear Mapping",
"Sparse Control Points",
"Bone Transformation",
"Global Mapping",
"Geometry",
"Pose Space",
"Per Vertex Displacement",
"Scanned Human Hand Model",
"Scanned Face Model",
"Face Model Reconstruction",
"Multiview Video Sequence",
"Manually Constructed Dinosaur Model",
"Keyframe Animation",
"Deformable Models",
"Face",
"Training",
"Bones",
"Data Models",
"Geometry",
"Animation",
"CCA Regression",
"Detail Preserving Deformation",
"Controllable Skinning",
"Learning From Sparse Examples"
],
"authors": [
{
"givenName": null,
"surname": "Yue Qi",
"fullName": "Yue Qi",
"affiliation": "State Key Lab. of Virtual Reality Technol. & Syst., Beihang Univ., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Ling Zhao",
"fullName": "Ling Zhao",
"affiliation": "State Key Lab. of Virtual Reality Technol. & Syst., Beihang Univ., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "KangKang Yin",
"fullName": "KangKang Yin",
"affiliation": "Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Haoda Huang",
"fullName": "Haoda Huang",
"affiliation": "Microsoft Res. Asia, Mountain View, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Yizhou Yu",
"fullName": "Yizhou Yu",
"affiliation": "Univ. of Hong Kong, Hong Kong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Xin Tong",
"fullName": "Xin Tong",
"affiliation": "Microsoft Res. Asia, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2012-08-01 00:00:00",
"pubType": "trans",
"pages": "1215-1227",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ca/2000/0683/0/06830002",
"title": "Integrated System for Skin Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/ca/2000/06830002/12OmNAtaRXK",
"parentPublication": {
"id": "proceedings/ca/2000/0683/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2010/4217/0/4217a236",
"title": "A Hybrid Deformation Model for Virtual Cutting",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2010/4217a236/12OmNBdru9U",
"parentPublication": {
"id": "proceedings/ism/2010/4217/0",
"title": "2010 IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1996/7588/0/75880155",
"title": "Efficient And Accurate Interference Detection For Polynomial Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1996/75880155/12OmNviHKlH",
"parentPublication": {
"id": "proceedings/ca/1996/7588/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv-vis/2008/3271/0/3271a129",
"title": "Talking Head - Visualizations & Level of Detail",
"doi": null,
"abstractUrl": "/proceedings-article/iv-vis/2008/3271a129/12OmNwoPttf",
"parentPublication": {
"id": "proceedings/iv-vis/2008/3271/0",
"title": "Visualisation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pma/2009/3988/0/3988a395",
"title": "Efficient Simulating Interactive Deformation of Virtual Plant",
"doi": null,
"abstractUrl": "/proceedings-article/pma/2009/3988a395/12OmNxE2mNM",
"parentPublication": {
"id": "proceedings/pma/2009/3988/0",
"title": "Plant Growth Modeling and Applications, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2011/4602/0/4602a063",
"title": "Deformation-Aided Virtual Assembly System for Mechanical Structure",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2011/4602a063/12OmNxbW4Tv",
"parentPublication": {
"id": "proceedings/icvrv/2011/4602/0",
"title": "2011 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncvpripg/2011/4599/0/4599a179",
"title": "A New Measure of Detail for Triangulated Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ncvpripg/2011/4599a179/12OmNz6iO6o",
"parentPublication": {
"id": "proceedings/ncvpripg/2011/4599/0",
"title": "Computer Vision, Pattern Recognition, Image Processing and Graphics, National Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/02/v0154",
"title": "An Anatomy-Based Approach to Human Muscle Modeling and Deformation",
"doi": null,
"abstractUrl": "/journal/tg/2002/02/v0154/13rRUIM2VBv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/01/v0091",
"title": "Modal Warping: Real-Time Simulation of Large Rotational Deformation and Manipulation",
"doi": null,
"abstractUrl": "/journal/tg/2005/01/v0091/13rRUy3xY80",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800e685",
"title": "Correspondence-Free Material Reconstruction using Sparse Surface Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800e685/1m3ngsvU9zO",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06171181",
"articleId": "13rRUxlgxTi",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Jv6pC6iiPe",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xSHOBpErN6",
"doi": "10.1109/TVCG.2021.3121229",
"abstract": "Unstructured data are collections of points with irregular topology, often represented through simplicial meshes, such as triangle and tetrahedral meshes. Whenever possible such representations are avoided in visualization since they are computationally demanding if compared with regular grids. In this work, we aim at simplifying the encoding and processing of simplicial meshes. The article proposes <italic>TopoCluster</italic>, a new localized data structure for tetrahedral meshes. TopoCluster provides efficient computation of the connectivity of the mesh elements with a low memory footprint. The key idea of TopoCluster is to subdivide the simplicial mesh into clusters. Then, the connectivity information is computed locally for each cluster and discarded when it is no longer needed. We define two instances of TopoCluster. The first instance prioritizes time efficiency and provides only a modest savings in memory, while the second instance drastically reduces memory consumption up to an order of magnitude with respect to comparable data structures. Thanks to the simple interface provided by TopoCluster, we have been able to integrate both data structures into the existing Topological Toolkit (TTK) framework. As a result, users can run any plugin of TTK using TopoCluster without changing a single line of code.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Unstructured data are collections of points with irregular topology, often represented through simplicial meshes, such as triangle and tetrahedral meshes. Whenever possible such representations are avoided in visualization since they are computationally demanding if compared with regular grids. In this work, we aim at simplifying the encoding and processing of simplicial meshes. The article proposes <italic>TopoCluster</italic>, a new localized data structure for tetrahedral meshes. TopoCluster provides efficient computation of the connectivity of the mesh elements with a low memory footprint. The key idea of TopoCluster is to subdivide the simplicial mesh into clusters. Then, the connectivity information is computed locally for each cluster and discarded when it is no longer needed. We define two instances of TopoCluster. The first instance prioritizes time efficiency and provides only a modest savings in memory, while the second instance drastically reduces memory consumption up to an order of magnitude with respect to comparable data structures. Thanks to the simple interface provided by TopoCluster, we have been able to integrate both data structures into the existing Topological Toolkit (TTK) framework. As a result, users can run any plugin of TTK using TopoCluster without changing a single line of code.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Unstructured data are collections of points with irregular topology, often represented through simplicial meshes, such as triangle and tetrahedral meshes. Whenever possible such representations are avoided in visualization since they are computationally demanding if compared with regular grids. In this work, we aim at simplifying the encoding and processing of simplicial meshes. The article proposes TopoCluster, a new localized data structure for tetrahedral meshes. TopoCluster provides efficient computation of the connectivity of the mesh elements with a low memory footprint. The key idea of TopoCluster is to subdivide the simplicial mesh into clusters. Then, the connectivity information is computed locally for each cluster and discarded when it is no longer needed. We define two instances of TopoCluster. The first instance prioritizes time efficiency and provides only a modest savings in memory, while the second instance drastically reduces memory consumption up to an order of magnitude with respect to comparable data structures. Thanks to the simple interface provided by TopoCluster, we have been able to integrate both data structures into the existing Topological Toolkit (TTK) framework. As a result, users can run any plugin of TTK using TopoCluster without changing a single line of code.",
"title": "TopoCluster: A Localized Data Structure for Topology-Based Visualization",
"normalizedTitle": "TopoCluster: A Localized Data Structure for Topology-Based Visualization",
"fno": "09583888",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Structures",
"Data Visualisation",
"Mesh Generation",
"Topology",
"Data Structures",
"Irregular Topology",
"Localized Data Structure",
"Low Memory Footprint",
"Mesh Elements",
"Tetrahedral Meshes",
"Topocluster",
"Topological Toolkit Framework",
"Topology Based Visualization",
"Unstructured Data",
"Data Structures",
"Encoding",
"Memory Management",
"Faces",
"Data Visualization",
"Runtime",
"Tools",
"Data Visualization",
"Data Structures",
"Topological Data Analysis",
"Simplicial Meshes",
"Tetrahedral Meshes"
],
"authors": [
{
"givenName": "Guoxi",
"surname": "Liu",
"fullName": "Guoxi Liu",
"affiliation": "School of Computing, Clemson University, Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Federico",
"surname": "Iuricich",
"fullName": "Federico Iuricich",
"affiliation": "School of Computing, Clemson University, Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Riccardo",
"surname": "Fellegara",
"fullName": "Riccardo Fellegara",
"affiliation": "German Aerospace Center (DLR), Institute for Software Technology, Braunschweig, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leila",
"surname": "De Floriani",
"fullName": "Leila De Floriani",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1506-1517",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1999/5897/0/00809868",
"title": "Tetrahedral mesh compression with the cut-border machine",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1999/00809868/12OmNBr4ev1",
"parentPublication": {
"id": "proceedings/visual/1999/5897/0",
"title": "Proceedings Visualization '99",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2005/2389/0/23890349",
"title": "CHF: A Scalable Topological Data Structure for Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2005/23890349/12OmNy5hRb4",
"parentPublication": {
"id": "proceedings/sibgrapi/2005/2389/0",
"title": "XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/01/mcg2006010046",
"title": "Visualization of Structured Nonuniform Grids",
"doi": null,
"abstractUrl": "/magazine/cg/2006/01/mcg2006010046/13rRUwjoNzD",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1229",
"title": "Interactive Point-Based Rendering of Higher-Order Tetrahedral Data",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1229/13rRUwvBy8O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017627",
"title": "The Topology ToolKit",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017627/13rRUxZzAhJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/01/v0029",
"title": "Selective Refinement Queries for Volume Visualization of Unstructured Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2004/01/v0029/13rRUyY28Yi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/04015405",
"title": "Streaming Simplification of Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/04015405/13rRUyY28Yk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09968044",
"title": "Marching Windows: Scalable Mesh Generation for Volumetric Data with Multiple Materials",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09968044/1IKDeaftuUM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552891",
"title": "A Memory Efficient Encoding for Ray Tracing Large Unstructured Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552891/1xic5VPyxhu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2021/3335/0/333500a091",
"title": "Ray-traced Shell Traversal of Tetrahedral Meshes for Direct Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2021/333500a091/1yXu8XEUCFq",
"parentPublication": {
"id": "proceedings/vis/2021/3335/0",
"title": "2021 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09576578",
"articleId": "1xIKu8EbmkE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09585392",
"articleId": "1y11d1nDEas",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jv6pLcSsxy",
"name": "ttg202302-09583888s1-supp1-3121229.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202302-09583888s1-supp1-3121229.pdf",
"extension": "pdf",
"size": "520 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgJA",
"title": "July",
"year": "2013",
"issueNum": "07",
"idPrefix": "co",
"pubType": "magazine",
"volume": "46",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0gelz",
"doi": "10.1109/MC.2013.120",
"abstract": "Analysts exploring big data require more from information visualization, data analysis, and data management than these components can now deliver. New infrastructures must address the nature of exploration as well as data scale. The Web extra at http://youtu.be/K9PvskathGI is a video segment that gives an overview of how research in visual analytics can help tackle the challenges of managing and interpreting big data in various domains.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Analysts exploring big data require more from information visualization, data analysis, and data management than these components can now deliver. New infrastructures must address the nature of exploration as well as data scale. The Web extra at http://youtu.be/K9PvskathGI is a video segment that gives an overview of how research in visual analytics can help tackle the challenges of managing and interpreting big data in various domains.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Analysts exploring big data require more from information visualization, data analysis, and data management than these components can now deliver. New infrastructures must address the nature of exploration as well as data scale. The Web extra at http://youtu.be/K9PvskathGI is a video segment that gives an overview of how research in visual analytics can help tackle the challenges of managing and interpreting big data in various domains.",
"title": "Visual Analytics Infrastructures: From Data Management to Exploration",
"normalizedTitle": "Visual Analytics Infrastructures: From Data Management to Exploration",
"fno": "mco2013070022",
"hasPdf": true,
"idPrefix": "co",
"keywords": [
"Visual Analytics",
"Data Visualization",
"Database Systems",
"Data Handling",
"Software Architecture",
"Hardware",
"Software Infrastructures",
"Visual Analytics",
"Visualization",
"Hardware Infrastructures"
],
"authors": [
{
"givenName": "Jean-Daniel",
"surname": "Fekete",
"fullName": "Jean-Daniel Fekete",
"affiliation": "INRIA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2013-07-01 00:00:00",
"pubType": "mags",
"pages": "22-29",
"year": "2013",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2012/4752/0/06400514",
"title": "Big data exploration through visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400514/12OmNC3XhwY",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2006/0591/0/04035757",
"title": "Toward a Multi-Analyst, Collaborative Framework for Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2006/04035757/12OmNqAU6pq",
"parentPublication": {
"id": "proceedings/vast/2006/0591/0",
"title": "2006 IEEE Symposium On Visual Analytics Science And Technology",
"__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/vast/2012/4752/0/06400507",
"title": "Agile visual analytics for banking cyber “big data”",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400507/12OmNyPQ4EL",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__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/co/2013/07/mco2013070047",
"title": "Real-Time Visual Analytics for Text Streams",
"doi": null,
"abstractUrl": "/magazine/co/2013/07/mco2013070047/13rRUxAStVJ",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/07/mco2013070030",
"title": "Visual Analytics Support for Intelligence Analysis",
"doi": null,
"abstractUrl": "/magazine/co/2013/07/mco2013070030/13rRUxD9h0P",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876049",
"title": "Progressive Visual Analytics: User-Driven Visual Exploration of In-Progress Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876049/13rRUyogGAd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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": "trans/tg/2021/02/09216629",
"title": "A Visual Analytics Approach for Exploratory Causal Analysis: Exploration, Validation, and Applications",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09216629/1nJsGFc8lUY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mco2013070020",
"articleId": "13rRUy0HYNj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mco2013070030",
"articleId": "13rRUxD9h0P",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1HGJ6XQen96",
"title": "Nov.",
"year": "2022",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GjwKHZsfIc",
"doi": "10.1109/TVCG.2022.3203093",
"abstract": "By situating computer-generated content in the physical world, mobile augmented reality (AR) can support many tasks that involve effective search and inspection of physical environments. Currently, there is limited information regarding the viability of using AR in realistic wide-area outdoor environments and how AR experiences affect human behavior in these environments. Here, we conducted a wide-area outdoor AR user study (Z_$n=48$_Z) using a commercially available AR headset (Microsoft Hololens 2) to compare (1) user interactions with physical and virtual objects in the environment (2) the effects of different lighting conditions on user behavior and AR experience and (3) the impact of varying cognitive load on AR task performance. Participants engaged in a treasure hunt task where they searched for and classified virtual target items (green “gems”) in an augmented outdoor courtyard scene populated with physical and virtual objects. Cognitive load was manipulated so that in half the search trials users were required to monitor an audio stream and respond to specific target sounds. Walking paths, head orientation and eye gaze information were measured, and users were queried about their memory of encountered objects and provided feedback on the experience. Key findings included (1) Participants self-reported significantly lower comfort in the ambient natural light condition, with virtual objects more visible and participants more likely to walk into physical objects at night; (2) recall for physical objects was worse than for virtual objects, (3) participants discovered more gems hidden behind virtual objects than physical objects, implying higher attention on virtual objects and (4) dual-tasking modified search behavior. These results suggest there are important technical, perceptual and cognitive factors that must be considered if the full potential of “anywhere and anytime mobile AR” is to be realized.",
"abstracts": [
{
"abstractType": "Regular",
"content": "By situating computer-generated content in the physical world, mobile augmented reality (AR) can support many tasks that involve effective search and inspection of physical environments. Currently, there is limited information regarding the viability of using AR in realistic wide-area outdoor environments and how AR experiences affect human behavior in these environments. Here, we conducted a wide-area outdoor AR user study ($n=48$) using a commercially available AR headset (Microsoft Hololens 2) to compare (1) user interactions with physical and virtual objects in the environment (2) the effects of different lighting conditions on user behavior and AR experience and (3) the impact of varying cognitive load on AR task performance. Participants engaged in a treasure hunt task where they searched for and classified virtual target items (green “gems”) in an augmented outdoor courtyard scene populated with physical and virtual objects. Cognitive load was manipulated so that in half the search trials users were required to monitor an audio stream and respond to specific target sounds. Walking paths, head orientation and eye gaze information were measured, and users were queried about their memory of encountered objects and provided feedback on the experience. Key findings included (1) Participants self-reported significantly lower comfort in the ambient natural light condition, with virtual objects more visible and participants more likely to walk into physical objects at night; (2) recall for physical objects was worse than for virtual objects, (3) participants discovered more gems hidden behind virtual objects than physical objects, implying higher attention on virtual objects and (4) dual-tasking modified search behavior. These results suggest there are important technical, perceptual and cognitive factors that must be considered if the full potential of “anywhere and anytime mobile AR” is to be realized.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "By situating computer-generated content in the physical world, mobile augmented reality (AR) can support many tasks that involve effective search and inspection of physical environments. Currently, there is limited information regarding the viability of using AR in realistic wide-area outdoor environments and how AR experiences affect human behavior in these environments. Here, we conducted a wide-area outdoor AR user study (-) using a commercially available AR headset (Microsoft Hololens 2) to compare (1) user interactions with physical and virtual objects in the environment (2) the effects of different lighting conditions on user behavior and AR experience and (3) the impact of varying cognitive load on AR task performance. Participants engaged in a treasure hunt task where they searched for and classified virtual target items (green “gems”) in an augmented outdoor courtyard scene populated with physical and virtual objects. Cognitive load was manipulated so that in half the search trials users were required to monitor an audio stream and respond to specific target sounds. Walking paths, head orientation and eye gaze information were measured, and users were queried about their memory of encountered objects and provided feedback on the experience. Key findings included (1) Participants self-reported significantly lower comfort in the ambient natural light condition, with virtual objects more visible and participants more likely to walk into physical objects at night; (2) recall for physical objects was worse than for virtual objects, (3) participants discovered more gems hidden behind virtual objects than physical objects, implying higher attention on virtual objects and (4) dual-tasking modified search behavior. These results suggest there are important technical, perceptual and cognitive factors that must be considered if the full potential of “anywhere and anytime mobile AR” is to be realized.",
"title": "Investigating Search Among Physical and Virtual Objects Under Different Lighting Conditions",
"normalizedTitle": "Investigating Search Among Physical and Virtual Objects Under Different Lighting Conditions",
"fno": "09874390",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Cognition",
"Mobile Computing",
"Virtual Reality",
"Dual Tasking Modified Search Behavior",
"Physical Environments",
"Physical Objects",
"Physical World",
"Virtual Objects",
"Wide Area Outdoor AR User Study",
"Wide Area Outdoor Environments",
"Lighting",
"Task Analysis",
"Behavioral Sciences",
"Augmented Reality",
"Visualization",
"User Experience",
"Search Problems",
"Mobile Augmented Reality",
"Wide Area",
"User Study",
"Lighting Conditions",
"Perception",
"Behavior"
],
"authors": [
{
"givenName": "You-Jin",
"surname": "Kim",
"fullName": "You-Jin Kim",
"affiliation": "Media Arts and Technology, University of California, Santa Barbara, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Radha",
"surname": "Kumaran",
"fullName": "Radha Kumaran",
"affiliation": "Department of Computer Science, University of California, Santa Barbara, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ehsan",
"surname": "Sayyad",
"fullName": "Ehsan Sayyad",
"affiliation": "Media Arts and Technology, University of California, Santa Barbara, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anne",
"surname": "Milner",
"fullName": "Anne Milner",
"affiliation": "Department of Psychological and Brain Sciences, Institute for Collaborative Biotechnologies, University of California, Santa Barbara, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tom",
"surname": "Bullock",
"fullName": "Tom Bullock",
"affiliation": "Department of Psychological and Brain Sciences, Institute for Collaborative Biotechnologies, University of California, Santa Barbara, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Barry",
"surname": "Giesbrecht",
"fullName": "Barry Giesbrecht",
"affiliation": "Department of Psychological and Brain Sciences, Institute for Collaborative Biotechnologies, University of California, Santa Barbara, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Höllerer",
"fullName": "Tobias Höllerer",
"affiliation": "Media Arts and Technology, University of California, Santa Barbara, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "3788-3798",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isuvr/2011/4420/0/4420b017",
"title": "Estimation of Illuminants for Plausible Lighting in Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2011/4420b017/12OmNvkplcm",
"parentPublication": {
"id": "proceedings/isuvr/2011/4420/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2018/7592/0/08699229",
"title": "The Effect of AR Based Emotional Interaction Among Personified Physical Objects in Manual Operation",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2018/08699229/19F1LS1YWuA",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2018/7592/0",
"title": "2018 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2018/7592/0/08699326",
"title": "Evaluation of Direct Manipulation Methods in Augmented Reality Environments Using Google Glass",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2018/08699326/19F1Oa8ukP6",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2018/7592/0",
"title": "2018 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a121",
"title": "The Influence of Environmental Lighting on Size Variations in Optical See-through Tangible Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a121/1CJc3FU1jUc",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a876",
"title": "HoloCMDS: Investigating Around Field of View Glanceable Commands Selection in AR-HMDs",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a876/1CJdZ8RwdnG",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a085",
"title": "Investigating Lighting Quality in Office Workstations: A Combined Approach Utilizing Virtual Reality and Physical Workstations",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a085/1CJe1WgruTe",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2022/5325/0/532500a612",
"title": "Investigating The Effect of Direction on The Limits of Haptic Retargeting",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2022/532500a612/1JrReInK5H2",
"parentPublication": {
"id": "proceedings/ismar/2022/5325/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2020/7675/0/767500a041",
"title": "Effects of Behavioral and Anthropomorphic Realism on Social Influence with Virtual Humans in AR",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2020/767500a041/1pBMhSuBHpe",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2020/7675/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a279",
"title": "Enhancing Visitor Experience or Hindering Docent Roles: Attentional Issues in Augmented Reality Supported Installations",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a279/1pysvRpTvr2",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09495125",
"title": "Being an Avatar “for Real”: A Survey on Virtual Embodiment in Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09495125/1vyju4jl6AE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09881577",
"articleId": "1Gv8Ze0xuJG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09874255",
"articleId": "1GjwLnkmt8I",
"__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": "1KJsjepjFi8",
"doi": "10.1109/TVCG.2023.3240503",
"abstract": "Designing thin-shell structures that are diverse, lightweight, and physically viable is a challenging task for traditional heuristic methods. To address this challenge, we present a novel parametric design framework for engraving regular, irregular, and customized patterns on thin-shell structures. Our method optimizes pattern parameters such as size and orientation, to ensure structural stiffness while minimizing material consumption. Our method is unique in that it works directly with shapes and patterns represented by functions, and can engrave patterns through simple function operations. By eliminating the need for remeshing in traditional FEM methods, our method is more computationally efficient in optimizing mechanical properties and can significantly increase the diversity of shell structure design. Quantitative evaluation confirms the convergence of the proposed method. We conduct experiments on regular, irregular, and customized patterns and present 3D printed results to demonstrate the effectiveness of our approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Designing thin-shell structures that are diverse, lightweight, and physically viable is a challenging task for traditional heuristic methods. To address this challenge, we present a novel parametric design framework for engraving regular, irregular, and customized patterns on thin-shell structures. Our method optimizes pattern parameters such as size and orientation, to ensure structural stiffness while minimizing material consumption. Our method is unique in that it works directly with shapes and patterns represented by functions, and can engrave patterns through simple function operations. By eliminating the need for remeshing in traditional FEM methods, our method is more computationally efficient in optimizing mechanical properties and can significantly increase the diversity of shell structure design. Quantitative evaluation confirms the convergence of the proposed method. We conduct experiments on regular, irregular, and customized patterns and present 3D printed results to demonstrate the effectiveness of our approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Designing thin-shell structures that are diverse, lightweight, and physically viable is a challenging task for traditional heuristic methods. To address this challenge, we present a novel parametric design framework for engraving regular, irregular, and customized patterns on thin-shell structures. Our method optimizes pattern parameters such as size and orientation, to ensure structural stiffness while minimizing material consumption. Our method is unique in that it works directly with shapes and patterns represented by functions, and can engrave patterns through simple function operations. By eliminating the need for remeshing in traditional FEM methods, our method is more computationally efficient in optimizing mechanical properties and can significantly increase the diversity of shell structure design. Quantitative evaluation confirms the convergence of the proposed method. We conduct experiments on regular, irregular, and customized patterns and present 3D printed results to demonstrate the effectiveness of our approach.",
"title": "A Parametric Design Method for Engraving Patterns on Thin Shells",
"normalizedTitle": "A Parametric Design Method for Engraving Patterns on Thin Shells",
"fno": "10043789",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Optimization",
"Shape",
"Topology",
"Design Methodology",
"Computational Modeling",
"Solid Modeling",
"Three Dimensional Displays",
"Parametric Design",
"Pattern Engraving",
"Structural Optimization",
"Thin Shells"
],
"authors": [
{
"givenName": "Jiangbei",
"surname": "Hu",
"fullName": "Jiangbei Hu",
"affiliation": "DUT-RU International School of Information and Software Engineering and Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province, Dalian University of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shengfa",
"surname": "Wang",
"fullName": "Shengfa Wang",
"affiliation": "DUT-RU International School of Information and Software Engineering, Dalian University of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "He",
"fullName": "Ying He",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhongxuan",
"surname": "Luo",
"fullName": "Zhongxuan Luo",
"affiliation": "School of Software Technology, Dalian University of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Na",
"surname": "Lei",
"fullName": "Na Lei",
"affiliation": "DUT-RU International School of Information and Software Engineering, Dalian University of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ligang",
"surname": "Liu",
"fullName": "Ligang Liu",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Chia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1-12",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/crv/2015/1986/0/1986a214",
"title": "A Method for Global Non-rigid Registration of Multiple Thin Structures",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2015/1986a214/12OmNAtK4kg",
"parentPublication": {
"id": "proceedings/crv/2015/1986/0",
"title": "2015 12th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2015/8020/0/07450393",
"title": "Automatic Hierarchical Mid-surface Abstraction of Thin-Walled Models Based on Rib Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2015/07450393/12OmNBTs7oo",
"parentPublication": {
"id": "proceedings/cad-graphics/2015/8020/0",
"title": "2015 14th International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391b671",
"title": "Shell PCA: Statistical Shape Modelling in Shell Space",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391b671/12OmNC2xhAr",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssst/1991/2190/0/00138591",
"title": "Scattering and radiation from cylindrical anisotropic shells",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1991/00138591/12OmNvnwVqK",
"parentPublication": {
"id": "proceedings/ssst/1991/2190/0",
"title": "The Twenty-Third Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2015/8332/0/8332a037",
"title": "Automatic Recovery of Networks of Thin Structures",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a037/12OmNwJgAIr",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2015/7143/0/7143b294",
"title": "The Study of Electromagnetic Signal Visualization Method Applied to the Whole World",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2015/7143b294/12OmNxXUhTb",
"parentPublication": {
"id": "proceedings/icmtma/2015/7143/0",
"title": "2015 Seventh International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2017/3299/0/08110086",
"title": "Modeling of developable surfaces of three-dimensional geometric objects",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2017/08110086/12OmNzV70zC",
"parentPublication": {
"id": "proceedings/ewdts/2017/3299/0",
"title": "2017 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/03/v0375",
"title": "Meshless Thin-Shell Simulation Based on Global Conformal Parameterization",
"doi": null,
"abstractUrl": "/journal/tg/2006/03/v0375/13rRUxZ0o1m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09928368",
"title": "Large Growth Deformations of Thin Tissue Using Solid-Shells",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09928368/1HJuKaJzi36",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2019/1003/0/08884456",
"title": "Surface visualization of flexible elastic shells",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2019/08884456/1eEUXmGJ5jq",
"parentPublication": {
"id": "proceedings/ewdts/2019/1003/0",
"title": "2019 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10041940",
"articleId": "1KEtpYenAVW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10044277",
"articleId": "1KL728MHdtu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcbnH8",
"doi": "10.1109/TVCG.2011.188",
"abstract": "Clustering as a fundamental data analysis technique has been widely used in many analytic applications. However, it is often difficult for users to understand and evaluate multidimensional clustering results, especially the quality of clusters and their semantics. For large and complex data, high-level statistical information about the clusters is often needed for users to evaluate cluster quality while a detailed display of multidimensional attributes of the data is necessary to understand the meaning of clusters. In this paper, we introduce DICON, an icon-based cluster visualization that embeds statistical information into a multi-attribute display to facilitate cluster interpretation, evaluation, and comparison. We design a treemap-like icon to represent a multidimensional cluster, and the quality of the cluster can be conveniently evaluated with the embedded statistical information. We further develop a novel layout algorithm which can generate similar icons for similar clusters, making comparisons of clusters easier. User interaction and clutter reduction are integrated into the system to help users more effectively analyze and refine clustering results for large datasets. We demonstrate the power of DICON through a user study and a case study in the healthcare domain. Our evaluation shows the benefits of the technique, especially in support of complex multidimensional cluster analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering as a fundamental data analysis technique has been widely used in many analytic applications. However, it is often difficult for users to understand and evaluate multidimensional clustering results, especially the quality of clusters and their semantics. For large and complex data, high-level statistical information about the clusters is often needed for users to evaluate cluster quality while a detailed display of multidimensional attributes of the data is necessary to understand the meaning of clusters. In this paper, we introduce DICON, an icon-based cluster visualization that embeds statistical information into a multi-attribute display to facilitate cluster interpretation, evaluation, and comparison. We design a treemap-like icon to represent a multidimensional cluster, and the quality of the cluster can be conveniently evaluated with the embedded statistical information. We further develop a novel layout algorithm which can generate similar icons for similar clusters, making comparisons of clusters easier. User interaction and clutter reduction are integrated into the system to help users more effectively analyze and refine clustering results for large datasets. We demonstrate the power of DICON through a user study and a case study in the healthcare domain. Our evaluation shows the benefits of the technique, especially in support of complex multidimensional cluster analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering as a fundamental data analysis technique has been widely used in many analytic applications. However, it is often difficult for users to understand and evaluate multidimensional clustering results, especially the quality of clusters and their semantics. For large and complex data, high-level statistical information about the clusters is often needed for users to evaluate cluster quality while a detailed display of multidimensional attributes of the data is necessary to understand the meaning of clusters. In this paper, we introduce DICON, an icon-based cluster visualization that embeds statistical information into a multi-attribute display to facilitate cluster interpretation, evaluation, and comparison. We design a treemap-like icon to represent a multidimensional cluster, and the quality of the cluster can be conveniently evaluated with the embedded statistical information. We further develop a novel layout algorithm which can generate similar icons for similar clusters, making comparisons of clusters easier. User interaction and clutter reduction are integrated into the system to help users more effectively analyze and refine clustering results for large datasets. We demonstrate the power of DICON through a user study and a case study in the healthcare domain. Our evaluation shows the benefits of the technique, especially in support of complex multidimensional cluster analysis.",
"title": "DICON: Interactive Visual Analysis of Multidimensional Clusters",
"normalizedTitle": "DICON: Interactive Visual Analysis of Multidimensional Clusters",
"fno": "ttg2011122581",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visual Analysis",
"Clustering",
"Information Visualization"
],
"authors": [
{
"givenName": "Nan",
"surname": "Cao",
"fullName": "Nan Cao",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Gotz",
"fullName": "David Gotz",
"affiliation": "IBM T.J. Watson Research Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jimeng",
"surname": "Sun",
"fullName": "Jimeng Sun",
"affiliation": "IBM T.J. Watson Research Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2581-2590",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/big-data/2014/5666/0/07004262",
"title": "Evaluating density-based motion for big data visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004262/12OmNB0nWeq",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2009/3733/0/3733a104",
"title": "RadViz and Identification of Clusters in Multidimensional Data",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a104/12OmNBKmXs1",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2017/2219/0/2219a351",
"title": "An Approach to Perform Local Analysis on Multidimensional Projection",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2017/2219a351/12OmNx4Q6AV",
"parentPublication": {
"id": "proceedings/sibgrapi/2017/2219/0",
"title": "2017 30th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/kse/2011/4567/0/4567a054",
"title": "Volume Visualization and Exploration Based on Semi-automatic Multidimensional Transfer Function Design",
"doi": null,
"abstractUrl": "/proceedings-article/kse/2011/4567a054/12OmNx7G5W4",
"parentPublication": {
"id": "proceedings/kse/2011/4567/0",
"title": "Knowledge and Systems Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042500",
"title": "A multidimensional brush for scatterplot data analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042500/12OmNxR5UJf",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061027",
"title": "Comparative Analysis of Multidimensional, Quantitative Data",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061027/13rRUNvya9i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/02/ttg2010020192",
"title": "Cross-Filtered Views for Multidimensional Visual Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2010/02/ttg2010020192/13rRUxBa5bO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/10/k1389",
"title": "A Shrinking-Based Clustering Approach for Multidimensional Data",
"doi": null,
"abstractUrl": "/journal/tk/2005/10/k1389/13rRUxD9h5u",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/12/09128014",
"title": "Geono-Cluster: Interactive Visual Cluster Analysis for Biologists",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09128014/1l3uoODPxAI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2023/01/09599491",
"title": "Visual Analysis of Multidimensional Big Data: A Scalable Lightweight Bundling Method for Parallel Coordinates",
"doi": null,
"abstractUrl": "/journal/bd/2023/01/09599491/1yeC5mmD996",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122572",
"articleId": "13rRUxD9h55",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122591",
"articleId": "13rRUwInvf4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRKC",
"name": "ttg2011122581s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011122581s1.mov",
"extension": "mov",
"size": "16.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK2",
"title": "November",
"year": "2004",
"issueNum": "11",
"idPrefix": "tk",
"pubType": "journal",
"volume": "16",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy2YLTf",
"doi": "10.1109/TKDE.2004.68",
"abstract": "DNA microarray technology has now made it possible to simultaneously monitor the expression levels of thousands of genes during important biological processes and across collections of related samples. Elucidating the patterns hidden in gene expression data offers a tremendous opportunity for an enhanced understanding of functional genomics. However, the large number of genes and the complexity of biological networks greatly increases the challenges of comprehending and interpreting the resulting mass of data, which often consists of millions of measurements. A first step toward addressing this challenge is the use of clustering techniques, which is essential in the data mining process to reveal natural structures and identify interesting patterns in the underlying data. Cluster analysis seeks to partition a given data set into groups based on specified features so that the data points within a group are more similar to each other than the points in different groups. A very rich literature on cluster analysis has developed over the past three decades. Many conventional clustering algorithms have been adapted or directly applied to gene expression data, and also new algorithms have recently been proposed specifically aiming at gene expression data. These clustering algorithms have been proven useful for identifying biologically relevant groups of genes and samples. In this paper, we first briefly introduce the concepts of microarray technology and discuss the basic elements of clustering on gene expression data. In particular, we divide cluster analysis for gene expression data into three categories. Then, we present specific challenges pertinent to each clustering category and introduce several representative approaches. We also discuss the problem of cluster validation in three aspects and review various methods to assess the quality and reliability of clustering results. Finally, we conclude this paper and suggest the promising trends in this field.",
"abstracts": [
{
"abstractType": "Regular",
"content": "DNA microarray technology has now made it possible to simultaneously monitor the expression levels of thousands of genes during important biological processes and across collections of related samples. Elucidating the patterns hidden in gene expression data offers a tremendous opportunity for an enhanced understanding of functional genomics. However, the large number of genes and the complexity of biological networks greatly increases the challenges of comprehending and interpreting the resulting mass of data, which often consists of millions of measurements. A first step toward addressing this challenge is the use of clustering techniques, which is essential in the data mining process to reveal natural structures and identify interesting patterns in the underlying data. Cluster analysis seeks to partition a given data set into groups based on specified features so that the data points within a group are more similar to each other than the points in different groups. A very rich literature on cluster analysis has developed over the past three decades. Many conventional clustering algorithms have been adapted or directly applied to gene expression data, and also new algorithms have recently been proposed specifically aiming at gene expression data. These clustering algorithms have been proven useful for identifying biologically relevant groups of genes and samples. In this paper, we first briefly introduce the concepts of microarray technology and discuss the basic elements of clustering on gene expression data. In particular, we divide cluster analysis for gene expression data into three categories. Then, we present specific challenges pertinent to each clustering category and introduce several representative approaches. We also discuss the problem of cluster validation in three aspects and review various methods to assess the quality and reliability of clustering results. Finally, we conclude this paper and suggest the promising trends in this field.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "DNA microarray technology has now made it possible to simultaneously monitor the expression levels of thousands of genes during important biological processes and across collections of related samples. Elucidating the patterns hidden in gene expression data offers a tremendous opportunity for an enhanced understanding of functional genomics. However, the large number of genes and the complexity of biological networks greatly increases the challenges of comprehending and interpreting the resulting mass of data, which often consists of millions of measurements. A first step toward addressing this challenge is the use of clustering techniques, which is essential in the data mining process to reveal natural structures and identify interesting patterns in the underlying data. Cluster analysis seeks to partition a given data set into groups based on specified features so that the data points within a group are more similar to each other than the points in different groups. A very rich literature on cluster analysis has developed over the past three decades. Many conventional clustering algorithms have been adapted or directly applied to gene expression data, and also new algorithms have recently been proposed specifically aiming at gene expression data. These clustering algorithms have been proven useful for identifying biologically relevant groups of genes and samples. In this paper, we first briefly introduce the concepts of microarray technology and discuss the basic elements of clustering on gene expression data. In particular, we divide cluster analysis for gene expression data into three categories. Then, we present specific challenges pertinent to each clustering category and introduce several representative approaches. We also discuss the problem of cluster validation in three aspects and review various methods to assess the quality and reliability of clustering results. Finally, we conclude this paper and suggest the promising trends in this field.",
"title": "Cluster Analysis for Gene Expression Data: A Survey",
"normalizedTitle": "Cluster Analysis for Gene Expression Data: A Survey",
"fno": "k1370",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Microarray Technology",
"Gene Expression Data",
"Clustering"
],
"authors": [
{
"givenName": "Daxin",
"surname": "Jiang",
"fullName": "Daxin Jiang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chun",
"surname": "Tang",
"fullName": "Chun Tang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aidong",
"surname": "Zhang",
"fullName": "Aidong Zhang",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2004-11-01 00:00:00",
"pubType": "trans",
"pages": "1370-1386",
"year": "2004",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/imsccs/2006/2581/1/25810142",
"title": "Clustering of Gene Expression Data: Performance and Similarity Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/imsccs/2006/25810142/12OmNA14A6F",
"parentPublication": {
"id": "proceedings/imsccs/2006/2581/1",
"title": "Computer and Computational Sciences, International Multi-Symposiums on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icit/2006/2635/0/26350011",
"title": "Efficient Two-stage Fuzzy Clustering of Microarray Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/icit/2006/26350011/12OmNAkWvND",
"parentPublication": {
"id": "proceedings/icit/2006/2635/0",
"title": "Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbeb/2012/4706/0/4706a821",
"title": "ICA-based Gene Expression Modules Exploring for Alzheimer's Disease",
"doi": null,
"abstractUrl": "/proceedings-article/icbeb/2012/4706a821/12OmNBigFyc",
"parentPublication": {
"id": "proceedings/icbeb/2012/4706/0",
"title": "Biomedical Engineering and Biotechnology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csb/2004/2194/0/21940182",
"title": "Biclustering in Gene Expression Data by Tendency",
"doi": null,
"abstractUrl": "/proceedings-article/csb/2004/21940182/12OmNCfAPGO",
"parentPublication": {
"id": "proceedings/csb/2004/2194/0",
"title": "Proceedings. 2004 IEEE Computational Systems Bioinformatics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isms/2013/4963/0/4963a007",
"title": "Fuzzy Rule Based Clustering for Gene Expression Data",
"doi": null,
"abstractUrl": "/proceedings-article/isms/2013/4963a007/12OmNxwENLV",
"parentPublication": {
"id": "proceedings/isms/2013/4963/0",
"title": "Intelligent Systems, Modelling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2008/3452/0/3452a023",
"title": "Analysis of Multiplex Gene Expression Maps Obtained by Voxelation",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2008/3452a023/12OmNyNzhuX",
"parentPublication": {
"id": "proceedings/bibm/2008/3452/0",
"title": "2008 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2009/3679/1/3679a099",
"title": "Gene Expression Data Cluster Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2009/3679a099/12OmNzxgHAm",
"parentPublication": {
"id": "proceedings/icie/2009/3679/1",
"title": "2009 WASE International Conference on Information Engineering (ICIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2005/02/n0083",
"title": "Attribute Clustering for Grouping, Selection, and Classification of Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tb/2005/02/n0083/13rRUxlgya3",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/10/k1363",
"title": "An Interactive Approach to Mining Gene Expression Data",
"doi": null,
"abstractUrl": "/journal/tk/2005/10/k1363/13rRUxly95W",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/03/06138849",
"title": "Empirical Evidence of the Applicability of Functional Clustering through Gene Expression Classification",
"doi": null,
"abstractUrl": "/journal/tb/2012/03/06138849/13rRUyXKxSY",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "k1357",
"articleId": "13rRUxBa5sd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k1387",
"articleId": "13rRUxZ0o1M",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxdm4Eg",
"title": "April",
"year": "2004",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "16",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWli",
"doi": "10.1109/TKDE.2004.1269669",
"abstract": "Abstract—Clustering is a central task in data mining applications such as customer segmentation. High-dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Therefore, techniques have recently been proposed to find clusters in hidden subspaces of the data. However, since the behavior of the data can vary considerably in different subspaces, it is often difficult to define the notion of a cluster with the use of simple mathematical formalizations. The widely used practice of treating clustering as the exact problem of optimizing an arbitrarily chosen objective function can often lead to misleading results. In fact, the proper clustering definition may vary not only with the application and data set but also with the perceptions of the end user. This makes it difficult to separate the definition of the clustering problem from the perception of an end-user. In this paper, we propose a system which performs high-dimensional clustering by cooperation between the human and the computer. The complex task of cluster creation is accomplished through a combination of human intuition and the computational support provided by the computer. The result is a system which leverages the best abilities of both the human and the computer for solving the clustering problem.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Clustering is a central task in data mining applications such as customer segmentation. High-dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Therefore, techniques have recently been proposed to find clusters in hidden subspaces of the data. However, since the behavior of the data can vary considerably in different subspaces, it is often difficult to define the notion of a cluster with the use of simple mathematical formalizations. The widely used practice of treating clustering as the exact problem of optimizing an arbitrarily chosen objective function can often lead to misleading results. In fact, the proper clustering definition may vary not only with the application and data set but also with the perceptions of the end user. This makes it difficult to separate the definition of the clustering problem from the perception of an end-user. In this paper, we propose a system which performs high-dimensional clustering by cooperation between the human and the computer. The complex task of cluster creation is accomplished through a combination of human intuition and the computational support provided by the computer. The result is a system which leverages the best abilities of both the human and the computer for solving the clustering problem.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Clustering is a central task in data mining applications such as customer segmentation. High-dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Therefore, techniques have recently been proposed to find clusters in hidden subspaces of the data. However, since the behavior of the data can vary considerably in different subspaces, it is often difficult to define the notion of a cluster with the use of simple mathematical formalizations. The widely used practice of treating clustering as the exact problem of optimizing an arbitrarily chosen objective function can often lead to misleading results. In fact, the proper clustering definition may vary not only with the application and data set but also with the perceptions of the end user. This makes it difficult to separate the definition of the clustering problem from the perception of an end-user. In this paper, we propose a system which performs high-dimensional clustering by cooperation between the human and the computer. The complex task of cluster creation is accomplished through a combination of human intuition and the computational support provided by the computer. The result is a system which leverages the best abilities of both the human and the computer for solving the clustering problem.",
"title": "A Human-Computer Interactive Method for Projected Clustering",
"normalizedTitle": "A Human-Computer Interactive Method for Projected Clustering",
"fno": "k0448",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"High Dimensional Data Mining",
"Clustering",
"Human Computer Interaction"
],
"authors": [
{
"givenName": "Charu C.",
"surname": "Aggarwal",
"fullName": "Charu C. Aggarwal",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2004-04-01 00:00:00",
"pubType": "trans",
"pages": "448-460",
"year": "2004",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "k0434",
"articleId": "13rRUxBa5xv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k0461",
"articleId": "13rRUxYINfy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyeWdDi",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "si",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQy9F",
"doi": "10.1109/TVLSI.2017.2753139",
"abstract": "In this paper, we present a sparse regression (SpaRe) model-based yield analysis methodology and apply it to memory designs with state-of-the-art write-assist circuitry. At the core of its engine is a mixture importance sampling technique which consists of a uniform sampling stage and an importance sampling stage. The proposed methodology allows for fast and accurate statistical analysis of rare fail events. In our approach, a SpaRe model is built using the uniform sampling stage data points obtained via circuit simulation (CktSim). Along with the model, an optimal threshold value is determined for proper pass/fail predict capability. The model and the threshold value are then used to predict the response in the importance sampling stage. This alleviates the need for CktSims in the latter stage and introduces significant speedup compared to fully CktSim-based approaches. The SpaRe model-based yield analysis is tested on a 14-nm FinFET SRAM design, and the results corroborate well with that of full CktSim-based yield analysis. The methodology is used to compare multiple state-of-the-art SRAM designs including selective boost and write-assist designs. The operating Z_$V_{\\mathrm {min}}$_Z ranges and trends corroborate well with hardware measurements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a sparse regression (SpaRe) model-based yield analysis methodology and apply it to memory designs with state-of-the-art write-assist circuitry. At the core of its engine is a mixture importance sampling technique which consists of a uniform sampling stage and an importance sampling stage. The proposed methodology allows for fast and accurate statistical analysis of rare fail events. In our approach, a SpaRe model is built using the uniform sampling stage data points obtained via circuit simulation (CktSim). Along with the model, an optimal threshold value is determined for proper pass/fail predict capability. The model and the threshold value are then used to predict the response in the importance sampling stage. This alleviates the need for CktSims in the latter stage and introduces significant speedup compared to fully CktSim-based approaches. The SpaRe model-based yield analysis is tested on a 14-nm FinFET SRAM design, and the results corroborate well with that of full CktSim-based yield analysis. The methodology is used to compare multiple state-of-the-art SRAM designs including selective boost and write-assist designs. The operating $V_{\\mathrm {min}}$ ranges and trends corroborate well with hardware measurements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a sparse regression (SpaRe) model-based yield analysis methodology and apply it to memory designs with state-of-the-art write-assist circuitry. At the core of its engine is a mixture importance sampling technique which consists of a uniform sampling stage and an importance sampling stage. The proposed methodology allows for fast and accurate statistical analysis of rare fail events. In our approach, a SpaRe model is built using the uniform sampling stage data points obtained via circuit simulation (CktSim). Along with the model, an optimal threshold value is determined for proper pass/fail predict capability. The model and the threshold value are then used to predict the response in the importance sampling stage. This alleviates the need for CktSims in the latter stage and introduces significant speedup compared to fully CktSim-based approaches. The SpaRe model-based yield analysis is tested on a 14-nm FinFET SRAM design, and the results corroborate well with that of full CktSim-based yield analysis. The methodology is used to compare multiple state-of-the-art SRAM designs including selective boost and write-assist designs. The operating - ranges and trends corroborate well with hardware measurements.",
"title": "Sparse Regression Driven Mixture Importance Sampling for Memory Design",
"normalizedTitle": "Sparse Regression Driven Mixture Importance Sampling for Memory Design",
"fno": "08052534",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Monte Carlo Methods",
"Integrated Circuit Modeling",
"Analytical Models",
"Predictive Models",
"Radio Frequency",
"Data Models",
"Random Access Memory",
"Design For Manufacturing",
"Integrated Circuit IC Design",
"Memory",
"Rare Events",
"Sparse Regression Spa Re",
"SRAM",
"Statistical Analysis"
],
"authors": [
{
"givenName": "Maria",
"surname": "Malik",
"fullName": "Maria Malik",
"affiliation": "George Mason University, Fairfax, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rajiv V.",
"surname": "Joshi",
"fullName": "Rajiv V. Joshi",
"affiliation": "IBM T. J. Watson Research Center, Yorktown Heights, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rouwaida",
"surname": "Kanj",
"fullName": "Rouwaida Kanj",
"affiliation": "American University of Beirut, Beirut, Lebanon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shupeng",
"surname": "Sun",
"fullName": "Shupeng Sun",
"affiliation": "Carnegie Mellon University, Pittsburgh, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Houman",
"surname": "Homayoun",
"fullName": "Houman Homayoun",
"affiliation": "George Mason University, Fairfax, VA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tong",
"surname": "Li",
"fullName": "Tong Li",
"affiliation": "STG, IBM, Austin, TX, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "63-72",
"year": "2018",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dsn/2018/5596/0/559601a303",
"title": "Importance Sampling of Interval Markov Chains",
"doi": null,
"abstractUrl": "/proceedings-article/dsn/2018/559601a303/12OmNBKEyoH",
"parentPublication": {
"id": "proceedings/dsn/2018/5596/0",
"title": "2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccad/2010/8194/0/05654259",
"title": "Sequential importance sampling for low-probability and high-dimensional SRAM yield analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/2010/05654259/12OmNro0HXm",
"parentPublication": {
"id": "proceedings/iccad/2010/8194/0",
"title": "2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2009/3964/0/3964a137",
"title": "Monte Carlo Variance Reduction. Importance Sampling Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2009/3964a137/12OmNvDqsUX",
"parentPublication": {
"id": "proceedings/synasc/2009/3964/0",
"title": "2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2014/5666/0/07004280",
"title": "Distributed Adaptive Importance Sampling on graphical models using MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004280/12OmNwDSdlZ",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuma/1990/2107/0/00151221",
"title": "Structural reliability evaluation by importance sampling and Kalman filter",
"doi": null,
"abstractUrl": "/proceedings-article/isuma/1990/00151221/12OmNwbukis",
"parentPublication": {
"id": "proceedings/isuma/1990/2107/0",
"title": "Proceedings First International Symposium on Uncertainty Modeling and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wsc/1993/1381/0/00718083",
"title": "Optimal Importance Sampling for Quick Simulation of Highly Reliable Markovian Systems",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/1993/00718083/12OmNyQpgW7",
"parentPublication": {
"id": "proceedings/wsc/1993/1381/0",
"title": "Proceedings of 1993 Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2017/03/07564452",
"title": "High-Dimensional and Multiple-Failure-Region Importance Sampling for SRAM Yield Analysis",
"doi": null,
"abstractUrl": "/journal/si/2017/03/07564452/13rRUwjGoJf",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1989/06/t0769",
"title": "Importance Sampling for Ising Computers Using One-Dimensional Cellular Automata",
"doi": null,
"abstractUrl": "/journal/tc/1989/06/t0769/13rRUwvT9fx",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/08/ttg2011081108",
"title": "Representativity for Robust and Adaptive Multiple Importance Sampling",
"doi": null,
"abstractUrl": "/journal/tg/2011/08/ttg2011081108/13rRUxOdD8i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2016/08/07404036",
"title": "Accelerated Accurate Timing Yield Estimation Based on Control Variates and Importance Sampling",
"doi": null,
"abstractUrl": "/journal/si/2016/08/07404036/13rRUxlgxMe",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08103882",
"articleId": "13rRUxAATel",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08074790",
"articleId": "13rRUxBJhsX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqMPfRq",
"title": "Dec.",
"year": "2019",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "41",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14Fq0VAriH9",
"doi": "10.1109/TPAMI.2018.2871850",
"abstract": "Sampling is an important and effective strategy in analyzing “big data,” whereby a smaller subset of a dataset is used to estimate the characteristics of its entire population. The main goal in sampling is often to achieve a significant gain in the computational time. However, a major obstacle towards this goal is the assessment of the smallest sample size needed to ensure, with a high probability, a faithful representation of the entire dataset, especially when the data set is compiled of a large number of diverse structures (e.g., clusters). To address this problem, we propose a method referred to as the Sparse Withdrawal of Inliers in a First Trial (SWIFT) that determines the smallest sample size of a subset of a dataset sampled in one grab, with the guarantee that the subset provides a sufficient number of samples from each of the underlying structures necessary for the discovery and inference. The latter is established with high probability, and the lower bound of the smallest sample size depends on probabilistic guarantees. In addition, we derive an upper bound on the smallest sample size that allows for detection of the structures and show that the two bounds are very close to each other in a variety of scenarios. We show that the problem can be modeled using either a hypergeometric or a multinomial probability mass function (pmf), and derive accurate mathematical bounds to determine a tight approximation to the sample size, leading thus to a sparse sampling strategy. The key features of the proposed method are: (i) sparseness of the sampled subset for analyzing data, where the level of sparseness is independent of the population size; (ii) no prior knowledge of the distribution of data, or the number of underlying structures in the data; and (iii) robustness in the presence of overwhelming number of outliers. We evaluate the method thoroughly in terms of accuracy, its behavior against different parameters, and its effectiveness in reducing the computational cost in various applications of computer vision, such as subspace clustering and structure from motion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Sampling is an important and effective strategy in analyzing “big data,” whereby a smaller subset of a dataset is used to estimate the characteristics of its entire population. The main goal in sampling is often to achieve a significant gain in the computational time. However, a major obstacle towards this goal is the assessment of the smallest sample size needed to ensure, with a high probability, a faithful representation of the entire dataset, especially when the data set is compiled of a large number of diverse structures (e.g., clusters). To address this problem, we propose a method referred to as the Sparse Withdrawal of Inliers in a First Trial (SWIFT) that determines the smallest sample size of a subset of a dataset sampled in one grab, with the guarantee that the subset provides a sufficient number of samples from each of the underlying structures necessary for the discovery and inference. The latter is established with high probability, and the lower bound of the smallest sample size depends on probabilistic guarantees. In addition, we derive an upper bound on the smallest sample size that allows for detection of the structures and show that the two bounds are very close to each other in a variety of scenarios. We show that the problem can be modeled using either a hypergeometric or a multinomial probability mass function (pmf), and derive accurate mathematical bounds to determine a tight approximation to the sample size, leading thus to a sparse sampling strategy. The key features of the proposed method are: (i) sparseness of the sampled subset for analyzing data, where the level of sparseness is independent of the population size; (ii) no prior knowledge of the distribution of data, or the number of underlying structures in the data; and (iii) robustness in the presence of overwhelming number of outliers. We evaluate the method thoroughly in terms of accuracy, its behavior against different parameters, and its effectiveness in reducing the computational cost in various applications of computer vision, such as subspace clustering and structure from motion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Sampling is an important and effective strategy in analyzing “big data,” whereby a smaller subset of a dataset is used to estimate the characteristics of its entire population. The main goal in sampling is often to achieve a significant gain in the computational time. However, a major obstacle towards this goal is the assessment of the smallest sample size needed to ensure, with a high probability, a faithful representation of the entire dataset, especially when the data set is compiled of a large number of diverse structures (e.g., clusters). To address this problem, we propose a method referred to as the Sparse Withdrawal of Inliers in a First Trial (SWIFT) that determines the smallest sample size of a subset of a dataset sampled in one grab, with the guarantee that the subset provides a sufficient number of samples from each of the underlying structures necessary for the discovery and inference. The latter is established with high probability, and the lower bound of the smallest sample size depends on probabilistic guarantees. In addition, we derive an upper bound on the smallest sample size that allows for detection of the structures and show that the two bounds are very close to each other in a variety of scenarios. We show that the problem can be modeled using either a hypergeometric or a multinomial probability mass function (pmf), and derive accurate mathematical bounds to determine a tight approximation to the sample size, leading thus to a sparse sampling strategy. The key features of the proposed method are: (i) sparseness of the sampled subset for analyzing data, where the level of sparseness is independent of the population size; (ii) no prior knowledge of the distribution of data, or the number of underlying structures in the data; and (iii) robustness in the presence of overwhelming number of outliers. We evaluate the method thoroughly in terms of accuracy, its behavior against different parameters, and its effectiveness in reducing the computational cost in various applications of computer vision, such as subspace clustering and structure from motion.",
"title": "Sparse One-Grab Sampling with Probabilistic Guarantees",
"normalizedTitle": "Sparse One-Grab Sampling with Probabilistic Guarantees",
"fno": "08470977",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Approximation Theory",
"Big Data",
"Data Analysis",
"Data Structures",
"Sampling Methods",
"Smallest Sample Size",
"Probabilistic Guarantees",
"Sparse Sampling Strategy",
"Sampled Subset",
"Sparse One Grab Sampling",
"Data Set",
"Data Models",
"Sociology",
"Computational Modeling",
"Mathematical Model",
"Sampling Methods",
"Iterative Methods",
"Sampling Big Data",
"Sample Size",
"Probabilistic Guarantees",
"Parameter Structure Estimation",
"Subspace Clustering"
],
"authors": [
{
"givenName": "Maryam",
"surname": "Jaberi",
"fullName": "Maryam Jaberi",
"affiliation": "Department of Computer Science, UCF, Orlando, FL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marianna",
"surname": "Pensky",
"fullName": "Marianna Pensky",
"affiliation": "Department of Mathematics, UCF, Orlando, FL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hassan",
"surname": "Foroosh",
"fullName": "Hassan Foroosh",
"affiliation": "Department of Computer Science, UCF, Orlando, FL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2019-12-01 00:00:00",
"pubType": "trans",
"pages": "3057-3070",
"year": "2019",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/reldis/1994/6575/0/00336906",
"title": "Probabilistic validation using worst event driven and importance sampling simulation",
"doi": null,
"abstractUrl": "/proceedings-article/reldis/1994/00336906/12OmNAGw15w",
"parentPublication": {
"id": "proceedings/reldis/1994/6575/0",
"title": "Proceedings of IEEE 13th Symposium on Reliable Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuma/1990/2107/0/00151291",
"title": "A probabilistic evaluation of alternative weld inspection sampling plans",
"doi": null,
"abstractUrl": "/proceedings-article/isuma/1990/00151291/12OmNAPjA8X",
"parentPublication": {
"id": "proceedings/isuma/1990/2107/0",
"title": "Proceedings First International Symposium on Uncertainty Modeling and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2014/5726/0/07058016",
"title": "A Sampling Method of Finding Top-k Frequent Items on Timestamp-Based Stream",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2014/07058016/12OmNASrazG",
"parentPublication": {
"id": "proceedings/wisa/2014/5726/0",
"title": "2014 11th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbd/2017/1072/0/1072a374",
"title": "Target Distribution Guided Network Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/cbd/2017/1072a374/12OmNBPc8qN",
"parentPublication": {
"id": "proceedings/cbd/2017/1072/0",
"title": "2017 Fifth International Conference on Advanced Cloud and Big Data (CBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pccc/1989/1918/0/00037388",
"title": "A sampling approach to real-time performance monitoring of digital transmission systems",
"doi": null,
"abstractUrl": "/proceedings-article/pccc/1989/00037388/12OmNBQC8en",
"parentPublication": {
"id": "proceedings/pccc/1989/1918/0",
"title": "1989 Eighth Annual International Phoenix Conference on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1988/9999/0/00197254",
"title": "Iterative pre-filtering over non-uniform sampling grids",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1988/00197254/12OmNvy25c2",
"parentPublication": {
"id": "proceedings/icassp/1988/9999/0",
"title": "ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wsc/2003/8131/1/01261466",
"title": "A simulation study on sampling and selecting under fixed computing budget",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/2003/01261466/12OmNxXCGL2",
"parentPublication": {
"id": "proceedings/wsc/2003/8131/1",
"title": "Proceedings of the 2003 Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532819",
"title": "Effectively visualizing large networks through sampling",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532819/12OmNy3RRHJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2013/2240/0/06785698",
"title": "Detect inflated follower numbers in OSN using star sampling",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2013/06785698/12OmNzG4gz2",
"parentPublication": {
"id": "proceedings/asonam/2013/2240/0",
"title": "2013 International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/1988/0872/0/00025659",
"title": "Test generation by fault sampling",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/1988/00025659/12OmNzGlRzh",
"parentPublication": {
"id": "proceedings/iccd/1988/0872/0",
"title": "Proceedings 1988 IEEE International Conference on Computer Design: VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08485719",
"articleId": "14dcDYx5cUy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08454781",
"articleId": "13rRUwfZC1O",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i585XOaODm",
"name": "ttp201912-08470977s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201912-08470977s1.pdf",
"extension": "pdf",
"size": "141 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK7",
"title": "Oct.",
"year": "2013",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgarjv",
"doi": "10.1109/TVCG.2012.324",
"abstract": "Investigators across many disciplines and organizations must sift through large collections of text documents to understand and piece together information. Whether they are fighting crime, curing diseases, deciding what car to buy, or researching a new field, inevitably investigators will encounter text documents. Taking a visual analytics approach, we integrate multiple text analysis algorithms with a suite of interactive visualizations to provide a flexible and powerful environment that allows analysts to explore collections of documents while sensemaking. Our particular focus is on the process of integrating automated analyses with interactive visualizations in a smooth and fluid manner. We illustrate this integration through two example scenarios: An academic researcher examining InfoVis and VAST conference papers and a consumer exploring car reviews while pondering a purchase decision. Finally, we provide lessons learned toward the design and implementation of visual analytics systems for document exploration and understanding.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Investigators across many disciplines and organizations must sift through large collections of text documents to understand and piece together information. Whether they are fighting crime, curing diseases, deciding what car to buy, or researching a new field, inevitably investigators will encounter text documents. Taking a visual analytics approach, we integrate multiple text analysis algorithms with a suite of interactive visualizations to provide a flexible and powerful environment that allows analysts to explore collections of documents while sensemaking. Our particular focus is on the process of integrating automated analyses with interactive visualizations in a smooth and fluid manner. We illustrate this integration through two example scenarios: An academic researcher examining InfoVis and VAST conference papers and a consumer exploring car reviews while pondering a purchase decision. Finally, we provide lessons learned toward the design and implementation of visual analytics systems for document exploration and understanding.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Investigators across many disciplines and organizations must sift through large collections of text documents to understand and piece together information. Whether they are fighting crime, curing diseases, deciding what car to buy, or researching a new field, inevitably investigators will encounter text documents. Taking a visual analytics approach, we integrate multiple text analysis algorithms with a suite of interactive visualizations to provide a flexible and powerful environment that allows analysts to explore collections of documents while sensemaking. Our particular focus is on the process of integrating automated analyses with interactive visualizations in a smooth and fluid manner. We illustrate this integration through two example scenarios: An academic researcher examining InfoVis and VAST conference papers and a consumer exploring car reviews while pondering a purchase decision. Finally, we provide lessons learned toward the design and implementation of visual analytics systems for document exploration and understanding.",
"title": "Combining Computational Analyses and Interactive Visualization for Document Exploration and Sensemaking in Jigsaw",
"normalizedTitle": "Combining Computational Analyses and Interactive Visualization for Document Exploration and Sensemaking in Jigsaw",
"fno": "ttg2013101646",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Text Analysis",
"Visualization",
"Measurement",
"Data Visualization",
"Algorithm Design And Analysis",
"Computational Modeling",
"Tag Clouds",
"Document Analysis",
"Visual Analytics",
"Information Visualization",
"Sensemaking",
"Exploratory Search",
"Information Seeking"
],
"authors": [
{
"givenName": "C.",
"surname": "Gorg",
"fullName": "C. Gorg",
"affiliation": "Comput. Biosci. Program, Univ. of Colorado, Aurora, CO, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Zhicheng Liu",
"fullName": "Zhicheng Liu",
"affiliation": "Dept. of Comput. Sci., Stanford Univ., Stanford, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jaeyeon Kihm",
"fullName": "Jaeyeon Kihm",
"affiliation": "Cornell CIS, Ithaca, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jaegul Choo",
"fullName": "Jaegul Choo",
"affiliation": "Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Haesun Park",
"fullName": "Haesun Park",
"affiliation": "Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Stasko",
"fullName": "J. Stasko",
"affiliation": "Sch. of Interactive Comput., Georgia Inst. of Technol., Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "10",
"pubDate": "2013-10-01 00:00:00",
"pubType": "trans",
"pages": "1646-1663",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2015/7568/0/7568a114",
"title": "Concentri Cloud: Word Cloud Visualization for Multiple Text Documents",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a114/12OmNA0dMO6",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2014/4103/0/4103a108",
"title": "RadCloud: Visualizing Multiple Texts with Merged Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a108/12OmNAgY7my",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2009/3769/0/3769b789",
"title": "A New Hierarchical Document Clustering Method",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2009/3769b789/12OmNAolGPW",
"parentPublication": {
"id": "proceedings/ncm/2009/3769/0",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2009/3733/0/3733a149",
"title": "Topic-Based Coordination for Visual Analysis of Evolving Document Collections",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a149/12OmNBhpS9v",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2016/5661/0/07883507",
"title": "DocuCompass: Effective exploration of document landscapes",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2016/07883507/12OmNyXMQg6",
"parentPublication": {
"id": "proceedings/vast/2016/5661/0",
"title": "2016 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a013",
"title": "Three-level Visualization of Internet Discussion with Extruded Word Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a013/12OmNyrIaxa",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/06/mcg2010060042",
"title": "Context-Preserving, Dynamic Word Cloud Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2010/06/mcg2010060042/13rRUwcAquA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2022/9755/0/975500a325",
"title": "Meaning of the Clusters on Dimensionality Reduction by Word Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2022/975500a325/1GU6T5a3HI4",
"parentPublication": {
"id": "proceedings/iiai-aai/2022/9755/0",
"title": "2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/12/09143452",
"title": "PyramidTags: Context-, Time- and Word Order-Aware Tag Maps to Explore Large Document Collections",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09143452/1lxmwM0AM9O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2020/7397/0/739700a830",
"title": "Using co-occurrence network to analyse students' satisfaction with classes – a case study",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2020/739700a830/1tGcoeDIOEU",
"parentPublication": {
"id": "proceedings/iiai-aai/2020/7397/0",
"title": "2020 9th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013101633",
"articleId": "13rRUxBJhFv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013101664",
"articleId": "13rRUx0xPII",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgGE",
"name": "ttg2013101646s2.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013101646s2.mov",
"extension": "mov",
"size": "7.93 MB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTXFgGD",
"name": "ttg2013101646s1.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013101646s1.mov",
"extension": "mov",
"size": "17.6 MB",
"__typename": "WebExtraType"
}
],
"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": "1AZKX05IxjO",
"doi": "10.1109/TKDE.2022.3151435",
"abstract": "Recent years, Knowledge Graph Embeddings (KGEs) have shown promising performance on link prediction tasks by mapping the entities and relations from a Knowledge Graph (KG) into a geometric space and thus have gained increasing attentions. In addition, many recent Knowledge Graphs involve evolving data, e.g., the fact (<italic>Obama</italic>, <italic>PresidentOf</italic>, <italic>USA</italic>) is valid only from 2009 to 2017. This introduces important challenges for knowledge representation learning since such temporal KGs change over time. In this work, we strive to move beyond the complex or hypercomplex space for KGE and propose a novel geometric algebra based embedding approach, GeomE, which uses multivector representations and the geometric product to model entities and relations. GeomE subsumes several state-of-the-art KGE models and is able to model diverse relations patterns. On top of this, we extend GeomE to TGeomE for temporal KGE, which performs 4th-order tensor factorization of a temporal KG and devises a new linear temporal regularization for time representation learning. Moreover, we study the effect of time granularity on the performance of TGeomE models. Experimental results show that our proposed models achieve the state-of-the-art performances on link prediction over four commonly-used static KG datasets and four well-established temporal KG datasets across various metrics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent years, Knowledge Graph Embeddings (KGEs) have shown promising performance on link prediction tasks by mapping the entities and relations from a Knowledge Graph (KG) into a geometric space and thus have gained increasing attentions. In addition, many recent Knowledge Graphs involve evolving data, e.g., the fact (<italic>Obama</italic>, <italic>PresidentOf</italic>, <italic>USA</italic>) is valid only from 2009 to 2017. This introduces important challenges for knowledge representation learning since such temporal KGs change over time. In this work, we strive to move beyond the complex or hypercomplex space for KGE and propose a novel geometric algebra based embedding approach, GeomE, which uses multivector representations and the geometric product to model entities and relations. GeomE subsumes several state-of-the-art KGE models and is able to model diverse relations patterns. On top of this, we extend GeomE to TGeomE for temporal KGE, which performs 4th-order tensor factorization of a temporal KG and devises a new linear temporal regularization for time representation learning. Moreover, we study the effect of time granularity on the performance of TGeomE models. Experimental results show that our proposed models achieve the state-of-the-art performances on link prediction over four commonly-used static KG datasets and four well-established temporal KG datasets across various metrics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent years, Knowledge Graph Embeddings (KGEs) have shown promising performance on link prediction tasks by mapping the entities and relations from a Knowledge Graph (KG) into a geometric space and thus have gained increasing attentions. In addition, many recent Knowledge Graphs involve evolving data, e.g., the fact (Obama, PresidentOf, USA) is valid only from 2009 to 2017. This introduces important challenges for knowledge representation learning since such temporal KGs change over time. In this work, we strive to move beyond the complex or hypercomplex space for KGE and propose a novel geometric algebra based embedding approach, GeomE, which uses multivector representations and the geometric product to model entities and relations. GeomE subsumes several state-of-the-art KGE models and is able to model diverse relations patterns. On top of this, we extend GeomE to TGeomE for temporal KGE, which performs 4th-order tensor factorization of a temporal KG and devises a new linear temporal regularization for time representation learning. Moreover, we study the effect of time granularity on the performance of TGeomE models. Experimental results show that our proposed models achieve the state-of-the-art performances on link prediction over four commonly-used static KG datasets and four well-established temporal KG datasets across various metrics.",
"title": "Geometric Algebra Based Embeddings for Static and Temporal Knowledge Graph Completion",
"normalizedTitle": "Geometric Algebra Based Embeddings for Static and Temporal Knowledge Graph Completion",
"fno": "09713947",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Algebra",
"Graph Theory",
"Knowledge Representation",
"Learning Artificial Intelligence",
"Semantic Networks",
"Tensors",
"Commonly Used Static KG Datasets",
"Complex Space",
"Diverse Relations Patterns",
"Geom E",
"Geometric Algebra",
"Geometric Product",
"Geometric Space",
"Hypercomplex Space",
"Knowledge Graph Embeddings",
"Knowledge Representation",
"Linear Temporal Regularization",
"Link Prediction Tasks",
"Multivector Representations",
"Temporal KG Datasets",
"Temporal KGE",
"Temporal Knowledge Graph Completion",
"Tensor Factorization",
"T Geom E Models",
"Time Granularity",
"Time Representation Learning",
"Representation Learning",
"Measurement",
"Tensors",
"Algebra",
"Knowledge Graphs",
"Predictive Models",
"Task Analysis",
"Static Temporal Knowledge Graph Embedding",
"Representation Learning",
"Link Prediction",
"Geometric Algebra"
],
"authors": [
{
"givenName": "Chengjin",
"surname": "Xu",
"fullName": "Chengjin Xu",
"affiliation": "Department of Computer Science, Smart Data Analytics Group, University of Bonn, Bonn, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mojtaba",
"surname": "Nayyeri",
"fullName": "Mojtaba Nayyeri",
"affiliation": "Department of Computer Science, Smart Data Analytics Group, University of Bonn, Bonn, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yung-Yu",
"surname": "Chen",
"fullName": "Yung-Yu Chen",
"affiliation": "AutoScout24 Munich, München, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jens",
"surname": "Lehmann",
"fullName": "Jens Lehmann",
"affiliation": "Department of Computer Science, Smart Data Analytics Group, University of Bonn, Bonn, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2023-05-01 00:00:00",
"pubType": "trans",
"pages": "4838-4851",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a198",
"title": "Detection Geometric Object in the Conformal Geometric Algebra Framework",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a198/12OmNywfKKK",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2006/03/c3068",
"title": "Using Geometric Algebra for 3D Linear Transformations",
"doi": null,
"abstractUrl": "/magazine/cs/2006/03/c3068/13rRUILLkHi",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2002/03/mcg2002030024",
"title": "Geometric Algebra: A Computational Framework for Geometrical Applications (Part 1)",
"doi": null,
"abstractUrl": "/magazine/cg/2002/03/mcg2002030024/13rRUwbs1UQ",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/02/09741534",
"title": "Duality-Induced Regularizer for Semantic Matching Knowledge Graph Embeddings",
"doi": null,
"abstractUrl": "/journal/tp/2023/02/09741534/1C0j3UXditG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020261",
"title": "Learning Framework of Entity and Entity Type Composition Representation for Knowledge Graph Completion",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020261/1KfRWW3DzIk",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icftic/2022/2195/0/10075264",
"title": "A Temporal Knowledge Graph Completion Method with Text Descriptions Enhancement for Bank Compliance Management",
"doi": null,
"abstractUrl": "/proceedings-article/icftic/2022/10075264/1LRl0TG5F5e",
"parentPublication": {
"id": "proceedings/icftic/2022/2195/0",
"title": "2022 4th International Conference on Frontiers Technology of Information and Computer (ICFTIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10058002",
"title": "Enhanced Multi-Task Learning and Knowledge Graph-Based Recommender System",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10058002/1LbFmacN8Ri",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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": "trans/tg/2021/12/09127881",
"title": "Selective Guidance Normal Filter for Geometric Texture Removal",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09127881/1l3ut5TpoCA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci*cc/2020/9594/0/09450214",
"title": "Specific Time Embedding for Temporal Knowledge Graph Completion",
"doi": null,
"abstractUrl": "/proceedings-article/icci*cc/2020/09450214/1uqFPocDlAI",
"parentPublication": {
"id": "proceedings/icci*cc/2020/9594/0",
"title": "2020 IEEE 19th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09690010",
"articleId": "1AlCeJrahDa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09699028",
"articleId": "1ADJcMO1lkY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1M2IefFooxO",
"name": "ttk202305-09713947s1-supp1-3151435.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk202305-09713947s1-supp1-3151435.pdf",
"extension": "pdf",
"size": "1.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1GF6jMpqNjy",
"title": "Oct.",
"year": "2022",
"issueNum": "10",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vhI9JVJ6cU",
"doi": "10.1109/TPAMI.2021.3097396",
"abstract": "Monocular depth prediction plays a crucial role in understanding 3D scene geometry. Although recent methods have achieved impressive progress in the evaluation metrics such as the pixel-wise relative error, most methods neglect the geometric constraints in the 3D space. In this work, we show the importance of the high-order 3D geometric constraints for depth prediction. By designing a loss term that enforces a simple geometric constraint, namely, <italic>virtual normal</italic> directions determined by randomly sampled three points in the reconstructed 3D space, we significantly improve the accuracy and robustness of monocular depth estimation. Importantly, the virtual normal loss can not only improve the performance of learning metric depth, but also disentangle the scale information and enrich the model with better shape information. Therefore, when not having access to absolute metric depth training data, we can use virtual normal to learn a robust affine-invariant depth generated on diverse scenes. Our experiments demonstrate state-of-the-art results of learning metric depth on NYU Depth-V2 and KITTI. From the high-quality predicted depth, we are now able to recover good 3D structures of the scene such as the point cloud and surface normal directly, eliminating the necessity of relying on additional models as was previously done. To demonstrate the excellent generalization capability of learning affine-invariant depth on diverse data with the virtual normal loss, we construct a large-scale and diverse dataset for training affine-invariant depth, termed Diverse Scene Depth dataset (DiverseDepth), and test on five datasets with the zero-shot test setting. Code is available at: <uri>https://git.io/Depth</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Monocular depth prediction plays a crucial role in understanding 3D scene geometry. Although recent methods have achieved impressive progress in the evaluation metrics such as the pixel-wise relative error, most methods neglect the geometric constraints in the 3D space. In this work, we show the importance of the high-order 3D geometric constraints for depth prediction. By designing a loss term that enforces a simple geometric constraint, namely, <italic>virtual normal</italic> directions determined by randomly sampled three points in the reconstructed 3D space, we significantly improve the accuracy and robustness of monocular depth estimation. Importantly, the virtual normal loss can not only improve the performance of learning metric depth, but also disentangle the scale information and enrich the model with better shape information. Therefore, when not having access to absolute metric depth training data, we can use virtual normal to learn a robust affine-invariant depth generated on diverse scenes. Our experiments demonstrate state-of-the-art results of learning metric depth on NYU Depth-V2 and KITTI. From the high-quality predicted depth, we are now able to recover good 3D structures of the scene such as the point cloud and surface normal directly, eliminating the necessity of relying on additional models as was previously done. To demonstrate the excellent generalization capability of learning affine-invariant depth on diverse data with the virtual normal loss, we construct a large-scale and diverse dataset for training affine-invariant depth, termed Diverse Scene Depth dataset (DiverseDepth), and test on five datasets with the zero-shot test setting. Code is available at: <uri>https://git.io/Depth</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Monocular depth prediction plays a crucial role in understanding 3D scene geometry. Although recent methods have achieved impressive progress in the evaluation metrics such as the pixel-wise relative error, most methods neglect the geometric constraints in the 3D space. In this work, we show the importance of the high-order 3D geometric constraints for depth prediction. By designing a loss term that enforces a simple geometric constraint, namely, virtual normal directions determined by randomly sampled three points in the reconstructed 3D space, we significantly improve the accuracy and robustness of monocular depth estimation. Importantly, the virtual normal loss can not only improve the performance of learning metric depth, but also disentangle the scale information and enrich the model with better shape information. Therefore, when not having access to absolute metric depth training data, we can use virtual normal to learn a robust affine-invariant depth generated on diverse scenes. Our experiments demonstrate state-of-the-art results of learning metric depth on NYU Depth-V2 and KITTI. From the high-quality predicted depth, we are now able to recover good 3D structures of the scene such as the point cloud and surface normal directly, eliminating the necessity of relying on additional models as was previously done. To demonstrate the excellent generalization capability of learning affine-invariant depth on diverse data with the virtual normal loss, we construct a large-scale and diverse dataset for training affine-invariant depth, termed Diverse Scene Depth dataset (DiverseDepth), and test on five datasets with the zero-shot test setting. Code is available at: https://git.io/Depth.",
"title": "Virtual Normal: Enforcing Geometric Constraints for Accurate and Robust Depth Prediction",
"normalizedTitle": "Virtual Normal: Enforcing Geometric Constraints for Accurate and Robust Depth Prediction",
"fno": "09488280",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Cameras",
"Computational Geometry",
"Computer Vision",
"Feature Extraction",
"Image Colour Analysis",
"Image Reconstruction",
"Image Representation",
"Image Resolution",
"Image Segmentation",
"Learning Artificial Intelligence",
"Object Detection",
"Solid Modelling",
"Video Signal Processing",
"Diverse Depth",
"Diverse Scene Depth Dataset",
"KITTI",
"High Order 3 D Geometric Constraints",
"Termed Diverse Scene Depth Dataset",
"Point Cloud",
"High Quality Predicted Depth",
"NYU Depth V 2",
"Diverse Scenes",
"Robust Affine Invariant Depth",
"Absolute Metric Depth Training Data",
"Scale Information",
"Virtual Normal Loss",
"Monocular Depth Estimation",
"Reconstructed 3 D Space",
"Randomly Sampled Three Points",
"Virtual Normal Directions",
"Loss Term",
"Pixel Wise Relative Error",
"Evaluation Metrics",
"Monocular Depth Prediction",
"Robust Depth Prediction",
"Geometric Constraints",
"Three Dimensional Displays",
"Measurement",
"Surface Reconstruction",
"Geometry",
"Estimation",
"Image Reconstruction",
"Shape",
"Monocular Depth Estimation",
"3 D From Single Images",
"Surface Normal",
"Virtual Normal"
],
"authors": [
{
"givenName": "Wei",
"surname": "Yin",
"fullName": "Wei Yin",
"affiliation": "School of Computer Science, University of Adelaide, Adelaide, SA, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yifan",
"surname": "Liu",
"fullName": "Yifan Liu",
"affiliation": "School of Computer Science, University of Adelaide, Adelaide, SA, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chunhua",
"surname": "Shen",
"fullName": "Chunhua Shen",
"affiliation": "Monash University, Clayton, VIC, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "7282-7295",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2014/5118/0/5118c283",
"title": "High Quality Photometric Reconstruction Using a Depth Camera",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c283/12OmNAo45HL",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visapp/2014/8133/3/07295102",
"title": "A Bayesian framework for enhanced geometric reconstruction of complex objects by Helmholtz stereopsis",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07295102/12OmNC8dghe",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/2",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2014/7000/1/7000a440",
"title": "Merge2-3D: Combining Multiple Normal Maps with 3D Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2014/7000a440/12OmNx8Ouv7",
"parentPublication": {
"id": "proceedings/3dv/2014/7000/2",
"title": "2014 2nd International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391c174",
"title": "Peeking Template Matching for Depth Extension",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391c174/12OmNyNQSMX",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/05/07464873",
"title": "A Stable Analytical Framework for Isometric Shape-from-Template by Surface Integration",
"doi": null,
"abstractUrl": "/journal/tp/2017/05/07464873/13rRUwwJWH5",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000a283",
"title": "GeoNet: Geometric Neural Network for Joint Depth and Surface Normal Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000a283/17D45VTRonG",
"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/281200m2829",
"title": "Adaptive Surface Normal Constraint for Depth Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2829/1BmL6epkE92",
"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/480300f683",
"title": "Enforcing Geometric Constraints of Virtual Normal for Depth Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300f683/1hQqyDO1f0c",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800c186",
"title": "Normal Assisted Stereo Depth Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c186/1m3noJ4DSSI",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/02/09184024",
"title": "GeoNet++: Iterative Geometric Neural Network with Edge-Aware Refinement for Joint Depth and Surface Normal Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2022/02/09184024/1mLHVYnhWko",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09445658",
"articleId": "1uaajNYaeQw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09453131",
"articleId": "1ulCw1EprwY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1GF6u5ssagU",
"name": "ttp202210-09488280s1-supp1-3097396.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202210-09488280s1-supp1-3097396.pdf",
"extension": "pdf",
"size": "8.16 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Jv6pC6iiPe",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1yfWB7atOh2",
"doi": "10.1109/TVCG.2021.3124911",
"abstract": "Identifying geometric features from sampled surfaces is a significant and fundamental task. The existing curvature-based methods that can identify ridge and valley features are generally sensitive to noise. Without requiring high-order differential operators, most statistics-based methods sacrifice certain extents of the feature descriptive powers in exchange for robustness. However, neither of these types of methods can treat the surface boundary features simultaneously. In this paper, we propose a novel neighbor reweighted local centroid (NRLC) computational algorithm to identify geometric features for point cloud models. It constructs a feature descriptor for the considered point via decomposing each of its neighboring vectors into two orthogonal directions. A neighboring vector starts from the considered point and ends with the corresponding neighbor. The decomposed neighboring vectors are then accumulated with different weights to generate the NRLC. With the defined NRLC, we design a probability set for each candidate feature point so that the convex, concave and surface boundary points can be recognized concurrently. In addition, we introduce a pair of feature operators, including assimilation and dissimilation, to further strengthen the identified geometric features. Finally, we test NRLC on a large body of point cloud models derived from different data sources. Several groups of the comparison experiments are conducted, and the results verify the validity and efficiency of our NRLC method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Identifying geometric features from sampled surfaces is a significant and fundamental task. The existing curvature-based methods that can identify ridge and valley features are generally sensitive to noise. Without requiring high-order differential operators, most statistics-based methods sacrifice certain extents of the feature descriptive powers in exchange for robustness. However, neither of these types of methods can treat the surface boundary features simultaneously. In this paper, we propose a novel neighbor reweighted local centroid (NRLC) computational algorithm to identify geometric features for point cloud models. It constructs a feature descriptor for the considered point via decomposing each of its neighboring vectors into two orthogonal directions. A neighboring vector starts from the considered point and ends with the corresponding neighbor. The decomposed neighboring vectors are then accumulated with different weights to generate the NRLC. With the defined NRLC, we design a probability set for each candidate feature point so that the convex, concave and surface boundary points can be recognized concurrently. In addition, we introduce a pair of feature operators, including assimilation and dissimilation, to further strengthen the identified geometric features. Finally, we test NRLC on a large body of point cloud models derived from different data sources. Several groups of the comparison experiments are conducted, and the results verify the validity and efficiency of our NRLC method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Identifying geometric features from sampled surfaces is a significant and fundamental task. The existing curvature-based methods that can identify ridge and valley features are generally sensitive to noise. Without requiring high-order differential operators, most statistics-based methods sacrifice certain extents of the feature descriptive powers in exchange for robustness. However, neither of these types of methods can treat the surface boundary features simultaneously. In this paper, we propose a novel neighbor reweighted local centroid (NRLC) computational algorithm to identify geometric features for point cloud models. It constructs a feature descriptor for the considered point via decomposing each of its neighboring vectors into two orthogonal directions. A neighboring vector starts from the considered point and ends with the corresponding neighbor. The decomposed neighboring vectors are then accumulated with different weights to generate the NRLC. With the defined NRLC, we design a probability set for each candidate feature point so that the convex, concave and surface boundary points can be recognized concurrently. In addition, we introduce a pair of feature operators, including assimilation and dissimilation, to further strengthen the identified geometric features. Finally, we test NRLC on a large body of point cloud models derived from different data sources. Several groups of the comparison experiments are conducted, and the results verify the validity and efficiency of our NRLC method.",
"title": "Neighbor Reweighted Local Centroid for Geometric Feature Identification",
"normalizedTitle": "Neighbor Reweighted Local Centroid for Geometric Feature Identification",
"fno": "09600876",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Feature Extraction",
"Iterative Methods",
"Probability",
"Solid Modelling",
"Vectors",
"Curvature Based Methods",
"Decomposed Neighboring Vectors",
"Geometric Feature Identification",
"Neighbor Reweighted Local Centroid Computational Algorithm",
"NRLC Method",
"Point Cloud Models",
"Statistics Based Methods",
"Surface Boundary Points",
"Feature Extraction",
"Shape",
"Surface Treatment",
"Tensors",
"Surface Fitting",
"Three Dimensional Displays",
"Task Analysis",
"Feature Identification",
"Local Centroid",
"Convexity And Concavity",
"Surface Boundary Points",
"Assimilation And Dissimilation"
],
"authors": [
{
"givenName": "Tong",
"surname": "Liu",
"fullName": "Tong Liu",
"affiliation": "College of Information Engineering, Northwest A&F University, Yangling, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenhua",
"surname": "Yang",
"fullName": "Zhenhua Yang",
"affiliation": "College of Information Engineering, Northwest A&F University, Yangling, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shaojun",
"surname": "Hu",
"fullName": "Shaojun Hu",
"affiliation": "College of Information Engineering, Northwest A&F University, Yangling, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhiyi",
"surname": "Zhang",
"fullName": "Zhiyi Zhang",
"affiliation": "College of Information Engineering, Northwest A&F University, Yangling, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chunxia",
"surname": "Xiao",
"fullName": "Chunxia Xiao",
"affiliation": "Computer School, Wuhan University, Wuhan, Hubei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaohu",
"surname": "Guo",
"fullName": "Xiaohu Guo",
"affiliation": "Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Long",
"surname": "Yang",
"fullName": "Long Yang",
"affiliation": "College of Information Engineering, Northwest A&F University, Yangling, Shaanxi, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1545-1558",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fcst/2010/7779/0/05575931",
"title": "User-Controlled Geometric Feature Preserving Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/fcst/2010/05575931/12OmNyNQSQn",
"parentPublication": {
"id": "proceedings/fcst/2010/7779/0",
"title": "2010 Fifth International Conference on Frontier of Computer Science and Technology (FCST 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032a153",
"title": "Learning Compact Geometric Features",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032a153/12OmNyS6Rzc",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/07/07956272",
"title": "Sparse Geometric Representation Through Local Shape Probing",
"doi": null,
"abstractUrl": "/journal/tg/2018/07/07956272/13rRUB7a1g1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/04/mcg2015040100",
"title": "Making Sense of Geometric Data",
"doi": null,
"abstractUrl": "/magazine/cg/2015/04/mcg2015040100/13rRUyp7tZa",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300a998",
"title": "Modeling Local Geometric Structure of 3D Point Clouds Using Geo-CNN",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300a998/1gyrJIGQK8o",
"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/cvpr/2019/3293/0/329300k0122",
"title": "Deep Geometric Prior for Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300k0122/1gyrJvG8Kt2",
"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/wacv/2020/6553/0/09093533",
"title": "Robust Template-Based Non-Rigid Motion Tracking Using Local Coordinate Regularization",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093533/1jPbs0rPdC0",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/12/09127881",
"title": "Selective Guidance Normal Filter for Geometric Texture Removal",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09127881/1l3ut5TpoCA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2020/8128/0/812800a753",
"title": "PanoNet3D: Combining Semantic and Geometric Understanding for LiDAR Point Cloud Detection",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2020/812800a753/1qyxjGFgneM",
"parentPublication": {
"id": "proceedings/3dv/2020/8128/0",
"title": "2020 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900o4345",
"title": "Self-supervised Geometric Perception",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900o4345/1yeM866kqYg",
"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": "09599597",
"articleId": "1yeCaMmiM3S",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09606529",
"articleId": "1ymF2Tydh3G",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jv6v80ZgVq",
"name": "ttg202302-09600876s1-supp1-3124911.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202302-09600876s1-supp1-3124911.pdf",
"extension": "pdf",
"size": "9.28 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxGAKWw",
"title": "September/October",
"year": "2008",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SEb",
"doi": "10.1109/TVCG.2008.65",
"abstract": "Interaction between particles in so-called granular media, such as soil and sand, plays an important role in the context of geomechanical phenomena and numerous industrial applications. A two scale homogenization approach based on a micro and a macro scale level is briefly introduced in this paper. Computation of granular material in such a way gives a deeper insight into the context of discontinuous materials and at the same time reduces the computational costs. However, the description and the understanding of the phenomena in granular materials are not yet satisfactory. A sophisticated problem-specific visualization technique would significantly help to illustrate failure phenomena on the microscopic level. As main contribution, we present a novel 2D approach for the visualization of simulation data, based on the above outlined homogenization technique. Our visualization tool supports visualization on micro scale level as well as on macro scale level. The tool shows both aspects closely arranged in form of multiple coordinated views to give users the possibility to analyze the particle behavior effectively. A novel type of interactive rose diagrams was developed to represent the dynamic contact networks on the micro scale level in a condensed and efficient way.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interaction between particles in so-called granular media, such as soil and sand, plays an important role in the context of geomechanical phenomena and numerous industrial applications. A two scale homogenization approach based on a micro and a macro scale level is briefly introduced in this paper. Computation of granular material in such a way gives a deeper insight into the context of discontinuous materials and at the same time reduces the computational costs. However, the description and the understanding of the phenomena in granular materials are not yet satisfactory. A sophisticated problem-specific visualization technique would significantly help to illustrate failure phenomena on the microscopic level. As main contribution, we present a novel 2D approach for the visualization of simulation data, based on the above outlined homogenization technique. Our visualization tool supports visualization on micro scale level as well as on macro scale level. The tool shows both aspects closely arranged in form of multiple coordinated views to give users the possibility to analyze the particle behavior effectively. A novel type of interactive rose diagrams was developed to represent the dynamic contact networks on the micro scale level in a condensed and efficient way.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interaction between particles in so-called granular media, such as soil and sand, plays an important role in the context of geomechanical phenomena and numerous industrial applications. A two scale homogenization approach based on a micro and a macro scale level is briefly introduced in this paper. Computation of granular material in such a way gives a deeper insight into the context of discontinuous materials and at the same time reduces the computational costs. However, the description and the understanding of the phenomena in granular materials are not yet satisfactory. A sophisticated problem-specific visualization technique would significantly help to illustrate failure phenomena on the microscopic level. As main contribution, we present a novel 2D approach for the visualization of simulation data, based on the above outlined homogenization technique. Our visualization tool supports visualization on micro scale level as well as on macro scale level. The tool shows both aspects closely arranged in form of multiple coordinated views to give users the possibility to analyze the particle behavior effectively. A novel type of interactive rose diagrams was developed to represent the dynamic contact networks on the micro scale level in a condensed and efficient way.",
"title": "Visualization of Particle Interactions in Granular Media",
"normalizedTitle": "Visualization of Particle Interactions in Granular Media",
"fno": "ttg2008051110",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Information Visualization",
"Applications"
],
"authors": [
{
"givenName": "Holger A.",
"surname": "Meier",
"fullName": "Holger A. Meier",
"affiliation": "University of Kaiserslautern, Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Schlemmer",
"fullName": "Michael Schlemmer",
"affiliation": "University of Kaiserslautern, Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Wagner",
"fullName": "Christian Wagner",
"affiliation": "University of Kaiserslautern, Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Kerren",
"fullName": "Andreas Kerren",
"affiliation": "Växjö University, Växjö",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans",
"surname": "Hagen",
"fullName": "Hans Hagen",
"affiliation": "University of Kaiserslautern, Kaiserslautern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ellen",
"surname": "Kuhl",
"fullName": "Ellen Kuhl",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "Steinmann",
"fullName": "Paul Steinmann",
"affiliation": "University of Kaiserslautern, Kaiserslautern",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2008-09-01 00:00:00",
"pubType": "trans",
"pages": "1110-1125",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pdp/2010/5672/0/05452425",
"title": "Euforia Integrated Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/2010/05452425/12OmNBAqZK2",
"parentPublication": {
"id": "proceedings/pdp/2010/5672/0",
"title": "18th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2009/4830/0/05255062",
"title": "Hierarchical structure analysis and visualization of Japanese law networks based on morphological analysis and granular computing",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2009/05255062/12OmNvSbBJ6",
"parentPublication": {
"id": "proceedings/grc/2009/4830/0",
"title": "2009 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2009/4830/0/05255036",
"title": "Granular resolution and granular reasoning",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2009/05255036/12OmNwx3Qby",
"parentPublication": {
"id": "proceedings/grc/2009/4830/0",
"title": "2009 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccompanion/2012/4956/0/4956b479",
"title": "Abstract: Remote Visualization for Large-Scale Simulation Using Particle-Based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956b479/12OmNxGSmft",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispass/2013/5776/0/06557147",
"title": "Interactive analysis of large distributed systems with scalable topology-based visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ispass/2013/06557147/12OmNxWuiyZ",
"parentPublication": {
"id": "proceedings/ispass/2013/5776/0",
"title": "IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/1/3735a150",
"title": "Concept Granular Computing Systems",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735a150/12OmNzEVRUM",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/1",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2007/3032/0/30320032",
"title": "Application of Granular Computing in Extension Criminal Reconnaissance System",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2007/30320032/12OmNzhnaa5",
"parentPublication": {
"id": "proceedings/grc/2007/3032/0",
"title": "2007 IEEE International Conference on Granular Computing (GRC 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780065",
"title": "Multi-Resolution Visualization Techniques for Nested Weather Models",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780065/12OmNzwpUr8",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__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/2021/12/09524524",
"title": "Simulating Multi-Scale, Granular Materials and Their Transitions With a Hybrid Euler-Lagrange Solver",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09524524/1wpqubOKAne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008051095",
"articleId": "13rRUNvgz4a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008051126",
"articleId": "13rRUxjyX3R",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qLhZwxtEmA",
"title": "March",
"year": "2021",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1dFoGxhy3eM",
"doi": "10.1109/TVCG.2019.2944172",
"abstract": "Granular media is the second-most-manipulated substance on Earth, second only to water. However, simulation of granular media is still challenging due to the complexity of granular materials and the large number of discrete solid particles. As we know, dry granular materials could form a hybrid state between a fluid and a solid, therefore we propose a two-layer model and divide the simulation domain into a dilute layer, where granules can move freely as a fluid, and a dense layer, where granules act more like a solid. Motivated by the shallow water equations, we derive a set of shallow sand equations for modeling dry granular flows by depth-integrating three-dimensional governing equations along its vertical direction. Unlike previous methods for simulating a 2D granular media, our model does not restrict the depth of the granular media to be shallow anymore. To allow efficient fluid-solid interactions, we also present a ray casting algorithm for one-way solid-fluid coupling. Finally, we introduce a particle-tracking method to improve the visual representation. Our method can be efficiently implemented based on a height field and is fully compatible with modern GPUs, therefore allows us to simulate large-scale dry granular flows in real time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Granular media is the second-most-manipulated substance on Earth, second only to water. However, simulation of granular media is still challenging due to the complexity of granular materials and the large number of discrete solid particles. As we know, dry granular materials could form a hybrid state between a fluid and a solid, therefore we propose a two-layer model and divide the simulation domain into a dilute layer, where granules can move freely as a fluid, and a dense layer, where granules act more like a solid. Motivated by the shallow water equations, we derive a set of shallow sand equations for modeling dry granular flows by depth-integrating three-dimensional governing equations along its vertical direction. Unlike previous methods for simulating a 2D granular media, our model does not restrict the depth of the granular media to be shallow anymore. To allow efficient fluid-solid interactions, we also present a ray casting algorithm for one-way solid-fluid coupling. Finally, we introduce a particle-tracking method to improve the visual representation. Our method can be efficiently implemented based on a height field and is fully compatible with modern GPUs, therefore allows us to simulate large-scale dry granular flows in real time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Granular media is the second-most-manipulated substance on Earth, second only to water. However, simulation of granular media is still challenging due to the complexity of granular materials and the large number of discrete solid particles. As we know, dry granular materials could form a hybrid state between a fluid and a solid, therefore we propose a two-layer model and divide the simulation domain into a dilute layer, where granules can move freely as a fluid, and a dense layer, where granules act more like a solid. Motivated by the shallow water equations, we derive a set of shallow sand equations for modeling dry granular flows by depth-integrating three-dimensional governing equations along its vertical direction. Unlike previous methods for simulating a 2D granular media, our model does not restrict the depth of the granular media to be shallow anymore. To allow efficient fluid-solid interactions, we also present a ray casting algorithm for one-way solid-fluid coupling. Finally, we introduce a particle-tracking method to improve the visual representation. Our method can be efficiently implemented based on a height field and is fully compatible with modern GPUs, therefore allows us to simulate large-scale dry granular flows in real time.",
"title": "Shallow Sand Equations: Real-Time Height Field Simulation of Dry Granular Flows",
"normalizedTitle": "Shallow Sand Equations: Real-Time Height Field Simulation of Dry Granular Flows",
"fno": "08851275",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Simulation",
"Geophysical Fluid Dynamics",
"Granular Flow",
"Granular Materials",
"Sand",
"Shallow Water Equations",
"Shallow Sand Equations",
"Real Time Height Field Simulation",
"Discrete Solid Particles",
"Dry Granular Materials",
"Two Layer Model",
"Shallow Water Equations",
"Fluid Solid Interactions",
"One Way Solid Fluid Coupling",
"Dry Granular Flow Simulation",
"Depth Integrating Three Dimensional Governing Equations",
"Ray Casting Algorithm",
"Particle Tracking Method",
"Visual Representation",
"GPU",
"Mathematical Model",
"Computational Modeling",
"Solids",
"Real Time Systems",
"Media",
"Friction",
"Solid Modeling",
"Shallow Sand Equations",
"Dry Granular Media",
"Real Time Simulation"
],
"authors": [
{
"givenName": "Kuixin",
"surname": "Zhu",
"fullName": "Kuixin Zhu",
"affiliation": "School of Electronic and Computer Engineering, Peking University ShenZhen Graduate School, Peking University, Haidian, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaowei",
"surname": "He",
"fullName": "Xiaowei He",
"affiliation": "State Key Lab. of CS, Institute of Software, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sheng",
"surname": "Li",
"fullName": "Sheng Li",
"affiliation": "Peking University, Haidian, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongan",
"surname": "Wang",
"fullName": "Hongan Wang",
"affiliation": "Institute of Software, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoping",
"surname": "Wang",
"fullName": "Guoping Wang",
"affiliation": "Peking University, Haidian, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2021-03-01 00:00:00",
"pubType": "trans",
"pages": "2073-2084",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cad-graphics/2013/2576/0/06815033",
"title": "Energy-Based Dissolution Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815033/12OmNBt3qhE",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipcw/2016/5773/0/07837061",
"title": "Molecular Dynamics Simulation of Nanoscopic Couette Flow and Lubricated Nanoindentation",
"doi": null,
"abstractUrl": "/proceedings-article/hipcw/2016/07837061/12OmNxXCGI0",
"parentPublication": {
"id": "proceedings/hipcw/2016/5773/0",
"title": "2016 IEEE 23rd International Conference on High-Performance Computing: Workshops (HiPCW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/2014/2729/0/2729a322",
"title": "A Finite Volume Model for Dam-Break Floods with Wet-Dry Fronts on Non-uniform Grids",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/2014/2729a322/12OmNzmclVb",
"parentPublication": {
"id": "proceedings/pdp/2014/2729/0",
"title": "2014 22nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091592",
"title": "Wetting of Porous Solids",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091592/13rRUNvyatj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdiime/2022/9009/0/900900a048",
"title": "Solid-Fluid Interaction Simulation System Based on SPH Unified Particle Framework",
"doi": null,
"abstractUrl": "/proceedings-article/icdiime/2022/900900a048/1Iz56eSpj3y",
"parentPublication": {
"id": "proceedings/icdiime/2022/9009/0",
"title": "2022 International Conference on 3D Immersion, Interaction and Multi-sensory Experiences (ICDIIME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10113697",
"title": "MPMNet: A Data-Driven MPM Framework for Dynamic Fluid-Solid Interaction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10113697/1MNbKoLAFHy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a393",
"title": "Real-Time Viscoelastic Fluid Simulation and Solid Melting Process Based on AVR-SPH",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a393/1ap5BtapJ5u",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icitbs/2020/6698/0/669800a269",
"title": "Effects of Fluid-Structure Interaction on Nonlinear Seismic Response of Deep-Water Hollow Bridge Pier",
"doi": null,
"abstractUrl": "/proceedings-article/icitbs/2020/669800a269/1kuHM2efU64",
"parentPublication": {
"id": "proceedings/icitbs/2020/6698/0",
"title": "2020 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2021/4261/0/09635284",
"title": "3D reconstruction and computational modeling of solid-fluid interaction in realistic heart model",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2021/09635284/1zmvpRunzhe",
"parentPublication": {
"id": "proceedings/bibe/2021/4261/0",
"title": "2021 IEEE 21st International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscipt/2021/4137/0/413700a748",
"title": "Simulation of stage dry ice effect based on UE4",
"doi": null,
"abstractUrl": "/proceedings-article/iscipt/2021/413700a748/1zzpBGY1shW",
"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": "08863985",
"articleId": "1e0Yn4dt3jO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08839414",
"articleId": "1dqsrINsJsk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLiEx76ue4",
"name": "ttg202103-08851275s1-tvcg-he-2944172.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202103-08851275s1-tvcg-he-2944172.mp4",
"extension": "mp4",
"size": "155 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": "1nTrHSFagNy",
"doi": "10.1109/TVCG.2020.3030333",
"abstract": "We present an atmospheric model tailored for the interactive visualization of planetary surfaces. As the exploration of the solar system is progressing with increasingly accurate missions and instruments, the faithful visualization of planetary environments is gaining increasing interest in space research, mission planning, and science communication and education. Atmospheric effects are crucial in data analysis and to provide contextual information for planetary data. Our model correctly accounts for the non-linear path of the light inside the atmosphere (in Earth's case), the light absorption effects by molecules and dust particles, such as the ozone layer and the Martian dust, and a wavelength-dependent phase function for Mie scattering. The mode focuses on interactivity, versatility, and customization, and a comprehensive set of interactive controls make it possible to adapt its appearance dynamically. We demonstrate our results using Earth and Mars as examples. However, it can be readily adapted for the exploration of other atmospheres found on, for example, of exoplanets. For Earth's atmosphere, we visually compare our results with pictures taken from the International Space Station and against the CIE clear sky model. The Martian atmosphere is reproduced based on available scientific data, feedback from domain experts, and is compared to images taken by the Curiosity rover. The work presented here has been implemented in the OpenSpace system, which enables interactive parameter setting and real-time feedback visualization targeting presentations in a wide range of environments, from immersive dome theaters to virtual reality headsets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an atmospheric model tailored for the interactive visualization of planetary surfaces. As the exploration of the solar system is progressing with increasingly accurate missions and instruments, the faithful visualization of planetary environments is gaining increasing interest in space research, mission planning, and science communication and education. Atmospheric effects are crucial in data analysis and to provide contextual information for planetary data. Our model correctly accounts for the non-linear path of the light inside the atmosphere (in Earth's case), the light absorption effects by molecules and dust particles, such as the ozone layer and the Martian dust, and a wavelength-dependent phase function for Mie scattering. The mode focuses on interactivity, versatility, and customization, and a comprehensive set of interactive controls make it possible to adapt its appearance dynamically. We demonstrate our results using Earth and Mars as examples. However, it can be readily adapted for the exploration of other atmospheres found on, for example, of exoplanets. For Earth's atmosphere, we visually compare our results with pictures taken from the International Space Station and against the CIE clear sky model. The Martian atmosphere is reproduced based on available scientific data, feedback from domain experts, and is compared to images taken by the Curiosity rover. The work presented here has been implemented in the OpenSpace system, which enables interactive parameter setting and real-time feedback visualization targeting presentations in a wide range of environments, from immersive dome theaters to virtual reality headsets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an atmospheric model tailored for the interactive visualization of planetary surfaces. As the exploration of the solar system is progressing with increasingly accurate missions and instruments, the faithful visualization of planetary environments is gaining increasing interest in space research, mission planning, and science communication and education. Atmospheric effects are crucial in data analysis and to provide contextual information for planetary data. Our model correctly accounts for the non-linear path of the light inside the atmosphere (in Earth's case), the light absorption effects by molecules and dust particles, such as the ozone layer and the Martian dust, and a wavelength-dependent phase function for Mie scattering. The mode focuses on interactivity, versatility, and customization, and a comprehensive set of interactive controls make it possible to adapt its appearance dynamically. We demonstrate our results using Earth and Mars as examples. However, it can be readily adapted for the exploration of other atmospheres found on, for example, of exoplanets. For Earth's atmosphere, we visually compare our results with pictures taken from the International Space Station and against the CIE clear sky model. The Martian atmosphere is reproduced based on available scientific data, feedback from domain experts, and is compared to images taken by the Curiosity rover. The work presented here has been implemented in the OpenSpace system, which enables interactive parameter setting and real-time feedback visualization targeting presentations in a wide range of environments, from immersive dome theaters to virtual reality headsets.",
"title": "Interactive Visualization of Atmospheric Effects for Celestial Bodies",
"normalizedTitle": "Interactive Visualization of Atmospheric Effects for Celestial Bodies",
"fno": "09222377",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Aerospace Computing",
"Data Analysis",
"Data Visualisation",
"Interactive Systems",
"Mars",
"Mie Scattering",
"Planetary Atmospheres",
"Planetary Rovers",
"Planetary Surfaces",
"Space Research",
"Interactive Controls",
"International Space Station",
"CIE Clear Sky Model",
"Martian Atmosphere",
"Available Scientific Data",
"Interactive Parameter Setting",
"Real Time Feedback Visualization",
"Interactive Visualization",
"Atmospheric Effects",
"Celestial Bodies",
"Atmospheric Model",
"Planetary Surfaces",
"Solar System",
"Increasingly Accurate Missions",
"Faithful Visualization",
"Planetary Environments",
"Space Research",
"Mission Planning",
"Science Communication",
"Education",
"Data Analysis",
"Contextual Information",
"Planetary Data",
"Nonlinear Path",
"Light Absorption Effects",
"Dust Particles",
"Martian Dust",
"Wavelength Dependent Phase Function",
"Atmospheric Modeling",
"Data Visualization",
"Terrestrial Atmosphere",
"Scattering",
"Atmospheric Measurements",
"Real Time Systems",
"Physical Environmental Sciences",
"Engineering",
"Mathematics",
"Computer Graphics Techniques"
],
"authors": [
{
"givenName": "Jonathas",
"surname": "Costa",
"fullName": "Jonathas Costa",
"affiliation": "New York University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Bock",
"fullName": "Alexander Bock",
"affiliation": "Linköping University, University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carter",
"surname": "Emmart",
"fullName": "Carter Emmart",
"affiliation": "American Museum of Natural History",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles",
"surname": "Hansen",
"fullName": "Charles Hansen",
"affiliation": "University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anders",
"surname": "Ynnerman",
"fullName": "Anders Ynnerman",
"affiliation": "Linköping University, University of Utah",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cláudio",
"surname": "Silva",
"fullName": "Cláudio Silva",
"affiliation": "New York University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "785-795",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wscad-ssc/2012/4847/0/4847a041",
"title": "Exploring Multi-level Parallelism in Atmospheric Applications",
"doi": null,
"abstractUrl": "/proceedings-article/wscad-ssc/2012/4847a041/12OmNqBKU3s",
"parentPublication": {
"id": "proceedings/wscad-ssc/2012/4847/0",
"title": "Simpósio em Sistemas Computacionais",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1996/864/0/00568150",
"title": "Interactive exploration and modeling of large data sets: a case study with Venus light scattering data",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1996/00568150/12OmNxEBzho",
"parentPublication": {
"id": "proceedings/visual/1996/864/0",
"title": "Proceedings of Seventh Annual IEEE Visualization '96",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2011/707/0/05753124",
"title": "Spaceborne underwater imaging",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2011/05753124/12OmNxFsmGD",
"parentPublication": {
"id": "proceedings/iccp/2011/707/0",
"title": "IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwecms/2011/398/0/05952381",
"title": "A multiscale approach to phase reconstruction for Adaptive Optics",
"doi": null,
"abstractUrl": "/proceedings-article/iwecms/2011/05952381/12OmNxTmHLX",
"parentPublication": {
"id": "proceedings/iwecms/2011/398/0",
"title": "2011 10th International Workshop on Electronics, Control, Measurement and Signals (ECMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/2/01326274",
"title": "Performance of Doppler estimation for acoustic sources with atmospheric scattering",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326274/12OmNxV4ivb",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/2",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031584",
"title": "Exploring the evolution of pressure-perturbations to understand atmospheric phenomena",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031584/12OmNy6HQVS",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iceet/2009/3819/3/3819c147",
"title": "Xianyang City Atmospheric Dust Analysis in the Spring of 2008",
"doi": null,
"abstractUrl": "/proceedings-article/iceet/2009/3819c147/12OmNyRg4n8",
"parentPublication": {
"id": "proceedings/iceet/2009/3819/3",
"title": "Energy and Environment Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2017/04/mcs2017040006",
"title": "Understanding the Solar Wind–Mars Interaction with Global Magnetohydrodynamic Modeling",
"doi": null,
"abstractUrl": "/magazine/cs/2017/04/mcs2017040006/13rRUEgs2xb",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2002/05/c5064",
"title": "Testing and evaluating atmospheric climate models",
"doi": null,
"abstractUrl": "/magazine/cs/2002/05/c5064/13rRUxAATbA",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wowmom/2022/0876/0/087600a457",
"title": "Joint Terahertz Communication and Atmospheric Sensing in Low Earth Orbit Satellite Networks: Physical Layer Design",
"doi": null,
"abstractUrl": "/proceedings-article/wowmom/2022/087600a457/1FHqaxQxdlu",
"parentPublication": {
"id": "proceedings/wowmom/2022/0876/0",
"title": "2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09233392",
"articleId": "1o53j4CHkoo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09226126",
"articleId": "1nWKV8Mmxos",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLh1WwStbi",
"name": "ttg202102-09222377s1-supp1-3030333.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222377s1-supp1-3030333.mp4",
"extension": "mp4",
"size": "124 MB",
"__typename": "WebExtraType"
},
{
"id": "1qLh17bt7pK",
"name": "ttg202102-09222377s1-supp3-3030333.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222377s1-supp3-3030333.pdf",
"extension": "pdf",
"size": "9.99 MB",
"__typename": "WebExtraType"
},
{
"id": "1qLgTNhs8Bq",
"name": "ttg202102-09222377s1-supp2-3030333.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222377s1-supp2-3030333.mp4",
"extension": "mp4",
"size": "214 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": "1zc6D7Qkucw",
"doi": "10.1109/TVCG.2021.3114819",
"abstract": "In the study of packed granular materials, the performance of a sample (e.g., the detonation of a high-energy explosive) often correlates to measurements of a fluid flowing through it. The “effective surface area,” the surface area accessible to the airflow, is typically measured using a permeametry apparatus that relates the flow conductance to the permeable surface area via the Carman-Kozeny equation. This equation allows calculating the flow rate of a fluid flowing through the granules packed in the sample for a given pressure drop. However, Carman-Kozeny makes inherent assumptions about tunnel shapes and flow paths that may not accurately hold in situations where the particles possess a wide distribution in shapes, sizes, and aspect ratios, as is true with many powdered systems of technological and commercial interest. To address this challenge, we replicate these measurements virtually on micro-CT images of the powdered material, introducing a new Pore Network Model based on the skeleton of the Morse-Smale complex. Pores are identified as basins of the complex, their incidence encodes adjacency, and the conductivity of the capillary between them is computed from the cross-section at their interface. We build and solve a resistive network to compute an approximate laminar fluid flow through the pore structure. We provide two means of estimating flow-permeable surface area: (i) by direct computation of conductivity, and (ii) by identifying dead-ends in the flow coupled with isosurface extraction and the application of the Carman-Kozeny equation, with the aim of establishing consistency over a range of particle shapes, sizes, porosity levels, and void distribution patterns.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the study of packed granular materials, the performance of a sample (e.g., the detonation of a high-energy explosive) often correlates to measurements of a fluid flowing through it. The “effective surface area,” the surface area accessible to the airflow, is typically measured using a permeametry apparatus that relates the flow conductance to the permeable surface area via the Carman-Kozeny equation. This equation allows calculating the flow rate of a fluid flowing through the granules packed in the sample for a given pressure drop. However, Carman-Kozeny makes inherent assumptions about tunnel shapes and flow paths that may not accurately hold in situations where the particles possess a wide distribution in shapes, sizes, and aspect ratios, as is true with many powdered systems of technological and commercial interest. To address this challenge, we replicate these measurements virtually on micro-CT images of the powdered material, introducing a new Pore Network Model based on the skeleton of the Morse-Smale complex. Pores are identified as basins of the complex, their incidence encodes adjacency, and the conductivity of the capillary between them is computed from the cross-section at their interface. We build and solve a resistive network to compute an approximate laminar fluid flow through the pore structure. We provide two means of estimating flow-permeable surface area: (i) by direct computation of conductivity, and (ii) by identifying dead-ends in the flow coupled with isosurface extraction and the application of the Carman-Kozeny equation, with the aim of establishing consistency over a range of particle shapes, sizes, porosity levels, and void distribution patterns.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the study of packed granular materials, the performance of a sample (e.g., the detonation of a high-energy explosive) often correlates to measurements of a fluid flowing through it. The “effective surface area,” the surface area accessible to the airflow, is typically measured using a permeametry apparatus that relates the flow conductance to the permeable surface area via the Carman-Kozeny equation. This equation allows calculating the flow rate of a fluid flowing through the granules packed in the sample for a given pressure drop. However, Carman-Kozeny makes inherent assumptions about tunnel shapes and flow paths that may not accurately hold in situations where the particles possess a wide distribution in shapes, sizes, and aspect ratios, as is true with many powdered systems of technological and commercial interest. To address this challenge, we replicate these measurements virtually on micro-CT images of the powdered material, introducing a new Pore Network Model based on the skeleton of the Morse-Smale complex. Pores are identified as basins of the complex, their incidence encodes adjacency, and the conductivity of the capillary between them is computed from the cross-section at their interface. We build and solve a resistive network to compute an approximate laminar fluid flow through the pore structure. We provide two means of estimating flow-permeable surface area: (i) by direct computation of conductivity, and (ii) by identifying dead-ends in the flow coupled with isosurface extraction and the application of the Carman-Kozeny equation, with the aim of establishing consistency over a range of particle shapes, sizes, porosity levels, and void distribution patterns.",
"title": "Towards replacing physical testing of granular materials with a Topology-based Model",
"normalizedTitle": "Towards replacing physical testing of granular materials with a Topology-based Model",
"fno": "09645370",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computerised Tomography",
"Flow Simulation",
"Flow Through Porous Media",
"Geophysical Fluid Dynamics",
"Granular Materials",
"Laminar Flow",
"Permeability",
"Porosity",
"Porous Materials",
"Voids Solid",
"Physical Testing",
"Topology Based Model",
"Packed Granular Materials",
"Effective Surface Area",
"Permeametry Apparatus",
"Flow Conductance",
"Carman Kozeny Equation",
"Flow Rate",
"Given Pressure Drop",
"Inherent Assumptions",
"Tunnel Shapes",
"Flow Paths",
"Wide Distribution",
"Aspect Ratios",
"Powdered Systems",
"Technological Interest",
"Commercial Interest",
"Micro CT Images",
"Powdered Material",
"Pore Network Model",
"Morse Smale Complex",
"Approximate Laminar Fluid Flow",
"Pore Structure",
"Flow Permeable Surface Area",
"Particle Shapes",
"Shape",
"Mathematical Models",
"Surface Treatment",
"Powders",
"Computational Modeling",
"Area Measurement",
"Particle Measurements",
"Physical And Environmental Sciences",
"Computational Topology Based Techniques",
"Data Abstractions And Types",
"Scalar Field Data",
"Pore Network Model",
"Morse Smale Complex"
],
"authors": [
{
"givenName": "Aniketh",
"surname": "Venkat",
"fullName": "Aniketh Venkat",
"affiliation": "SCI Institute, University of Utah, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Attila",
"surname": "Gyulassy",
"fullName": "Attila Gyulassy",
"affiliation": "SCI Institute, University of Utah, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Graham",
"surname": "Kosiba",
"fullName": "Graham Kosiba",
"affiliation": "Lawrence Livermore National Laboratory, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amitesh",
"surname": "Maiti",
"fullName": "Amitesh Maiti",
"affiliation": "Lawrence Livermore National Laboratory, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Henry",
"surname": "Reinstein",
"fullName": "Henry Reinstein",
"affiliation": "Lawrence Livermore National Laboratory, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Richard",
"surname": "Gee",
"fullName": "Richard Gee",
"affiliation": "Lawrence Livermore National Laboratory, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peer-Timo",
"surname": "Bremer",
"fullName": "Peer-Timo Bremer",
"affiliation": "Lawrence Livermore National Laboratory, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Valerio",
"surname": "Pascucci",
"fullName": "Valerio Pascucci",
"affiliation": "SCI Institute, University of Utah, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "76-85",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icvrv/2015/7673/0/7673a295",
"title": "SPH-based Fluid Simulation with a New Surface Tension Formulation",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2015/7673a295/12OmNAS9zo4",
"parentPublication": {
"id": "proceedings/icvrv/2015/7673/0",
"title": "2015 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2017/2089/0/2089a118",
"title": "Anisotropic Surface Reconstruction for Multiphase Fluids",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2017/2089a118/12OmNCmpcVe",
"parentPublication": {
"id": "proceedings/cw/2017/2089/0",
"title": "2017 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2013/2840/0/2840c952",
"title": "Matching Dry to Wet Materials",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840c952/12OmNwDj0XK",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acsat/2015/0423/0/07478756",
"title": "Modeling the Effect of CNT Concentration in Dielectric Fluid on EDM Performance Using Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/acsat/2015/07478756/12OmNwFid41",
"parentPublication": {
"id": "proceedings/acsat/2015/0423/0",
"title": "2015 4th International Conference on Advanced Computer Science Applications and Technologies (ACSAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crc/2016/3572/0/3572a042",
"title": "The Experimental and Theoretical Study of Oil Droplet Spreading Behaviors after Oblique Collision",
"doi": null,
"abstractUrl": "/proceedings-article/crc/2016/3572a042/12OmNyS6RKc",
"parentPublication": {
"id": "proceedings/crc/2016/3572/0",
"title": "2016 International Conference on Cybernetics, Robotics and Control (CRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crc/2016/3572/0/3572a095",
"title": "The Quality Detection of Surface Defect in Dispensing Dack-End Based on HALCON",
"doi": null,
"abstractUrl": "/proceedings-article/crc/2016/3572a095/12OmNz6iOPB",
"parentPublication": {
"id": "proceedings/crc/2016/3572/0",
"title": "2016 International Conference on Cybernetics, Robotics and Control (CRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/2002/2402/0/24020552",
"title": "Improving the Generality of the Fictitious Magnetic Charge Approach to Computing Inductances in the Presence of Permeable Materials",
"doi": null,
"abstractUrl": "/proceedings-article/dac/2002/24020552/12OmNzvQHQW",
"parentPublication": {
"id": "proceedings/dac/2002/2402/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122149",
"title": "Derived Metric Tensors for Flow Surface Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122149/13rRUwd9CG1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccbd/2022/5716/0/10080788",
"title": "Numerical Simulation on Drag Reduction of Micro-grooved Surface",
"doi": null,
"abstractUrl": "/proceedings-article/iccbd/2022/10080788/1LSP5NEHXq0",
"parentPublication": {
"id": "proceedings/iccbd/2022/5716/0",
"title": "2022 5th International Conference on Computing and Big Data (ICCBD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/12/09524524",
"title": "Simulating Multi-Scale, Granular Materials and Their Transitions With a Hybrid Euler-Lagrange Solver",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09524524/1wpqubOKAne",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552892",
"articleId": "1xibYYzLaWk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552200",
"articleId": "1xic4fDV0di",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBKEyoe",
"title": "September/October",
"year": "2000",
"issueNum": "05",
"idPrefix": "tk",
"pubType": "journal",
"volume": "12",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjXZSq",
"doi": "10.1109/69.877502",
"abstract": "Abstract—We study similarity queries for time series data where similarity is defined, in a fairly general way, in terms of a distance function and a set of affine transformations on the Fourier series representation of a sequence. We identify a safe set of transformations supporting a wide variety of comparisons and show that this set is rich enough to formulate operations such as moving average and time scaling. We also show that queries expressed using safe transformations can efficiently be computed without prior knowledge of the transformations. We present a query processing algorithm that uses the underlying multidimensional index built over the data set to efficiently answer similarity queries. Our experiments show that the performance of this algorithm is competitive to that of processing ordinary (exact match) queries using the index, and much faster than sequential scanning. We propose a generalization of this algorithm for simultaneously handling multiple transformations at a time, and give experimental results on the performance of the generalized algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We study similarity queries for time series data where similarity is defined, in a fairly general way, in terms of a distance function and a set of affine transformations on the Fourier series representation of a sequence. We identify a safe set of transformations supporting a wide variety of comparisons and show that this set is rich enough to formulate operations such as moving average and time scaling. We also show that queries expressed using safe transformations can efficiently be computed without prior knowledge of the transformations. We present a query processing algorithm that uses the underlying multidimensional index built over the data set to efficiently answer similarity queries. Our experiments show that the performance of this algorithm is competitive to that of processing ordinary (exact match) queries using the index, and much faster than sequential scanning. We propose a generalization of this algorithm for simultaneously handling multiple transformations at a time, and give experimental results on the performance of the generalized algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We study similarity queries for time series data where similarity is defined, in a fairly general way, in terms of a distance function and a set of affine transformations on the Fourier series representation of a sequence. We identify a safe set of transformations supporting a wide variety of comparisons and show that this set is rich enough to formulate operations such as moving average and time scaling. We also show that queries expressed using safe transformations can efficiently be computed without prior knowledge of the transformations. We present a query processing algorithm that uses the underlying multidimensional index built over the data set to efficiently answer similarity queries. Our experiments show that the performance of this algorithm is competitive to that of processing ordinary (exact match) queries using the index, and much faster than sequential scanning. We propose a generalization of this algorithm for simultaneously handling multiple transformations at a time, and give experimental results on the performance of the generalized algorithm.",
"title": "Querying Time Series Data Based on Similarity",
"normalizedTitle": "Querying Time Series Data Based on Similarity",
"fno": "k0675",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Similarity Queries",
"Time Series Retrieval",
"Indexing Time Series",
"Fourier Transform"
],
"authors": [
{
"givenName": "Davood",
"surname": "Rafiei",
"fullName": "Davood Rafiei",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alberto O.",
"surname": "Mendelzon",
"fullName": "Alberto O. Mendelzon",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2000-09-01 00:00:00",
"pubType": "trans",
"pages": "675-693",
"year": "2000",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "k0673",
"articleId": "13rRUwInuWI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k0694",
"articleId": "13rRUxASuGx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzd7bmt",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "32",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WXIkCZ",
"doi": "10.1109/TKDE.2018.2880215",
"abstract": "Indexing is crucial for many data mining tasks that rely on efficient and effective similarity query processing. Consequently, indexing large volumes of time series, along with high performance similarity query processing, have became topics of high interest. For many applications across diverse domains though, the amount of data to be processed might be intractable for a single machine, making existing centralized indexing solutions inefficient. We propose a parallel indexing solution that gracefully scales to billions of time series, and a parallel query processing strategy that, given a batch of queries, efficiently exploits the index. Our experiments, on both synthetic and real world data, illustrate that our index creation algorithm works on four billion time series in less than five hours, while the state of the art centralized algorithms do not scale and have their limit on 1 billion time series, where they need more than five days. Also, our distributed querying algorithm is able to efficiently process millions of queries over collections of billions of time series, thanks to an effective load balancing mechanism.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Indexing is crucial for many data mining tasks that rely on efficient and effective similarity query processing. Consequently, indexing large volumes of time series, along with high performance similarity query processing, have became topics of high interest. For many applications across diverse domains though, the amount of data to be processed might be intractable for a single machine, making existing centralized indexing solutions inefficient. We propose a parallel indexing solution that gracefully scales to billions of time series, and a parallel query processing strategy that, given a batch of queries, efficiently exploits the index. Our experiments, on both synthetic and real world data, illustrate that our index creation algorithm works on four billion time series in less than five hours, while the state of the art centralized algorithms do not scale and have their limit on 1 billion time series, where they need more than five days. Also, our distributed querying algorithm is able to efficiently process millions of queries over collections of billions of time series, thanks to an effective load balancing mechanism.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Indexing is crucial for many data mining tasks that rely on efficient and effective similarity query processing. Consequently, indexing large volumes of time series, along with high performance similarity query processing, have became topics of high interest. For many applications across diverse domains though, the amount of data to be processed might be intractable for a single machine, making existing centralized indexing solutions inefficient. We propose a parallel indexing solution that gracefully scales to billions of time series, and a parallel query processing strategy that, given a batch of queries, efficiently exploits the index. Our experiments, on both synthetic and real world data, illustrate that our index creation algorithm works on four billion time series in less than five hours, while the state of the art centralized algorithms do not scale and have their limit on 1 billion time series, where they need more than five days. Also, our distributed querying algorithm is able to efficiently process millions of queries over collections of billions of time series, thanks to an effective load balancing mechanism.",
"title": "Massively Distributed Time Series Indexing and Querying",
"normalizedTitle": "Massively Distributed Time Series Indexing and Querying",
"fno": "08528881",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Mining",
"Indexing",
"Query Processing",
"Resource Allocation",
"Time Series",
"Index Creation Algorithm",
"Centralized Algorithms",
"Distributed Querying Algorithm",
"Time Series Indexing",
"Data Mining Tasks",
"High Performance Similarity Query Processing",
"Centralized Indexing Solutions",
"Parallel Indexing Solution",
"Parallel Query Processing Strategy",
"Synthetic World Data",
"Time Series Analysis",
"Indexing",
"Query Processing",
"Euclidean Distance",
"Task Analysis",
"Time Series",
"Parallel Indexing",
"Distributed Querying"
],
"authors": [
{
"givenName": "Djamel-Edine",
"surname": "Yagoubi",
"fullName": "Djamel-Edine Yagoubi",
"affiliation": "Inria-University of Montpellier-Lirmm, Montpellier, Occitanie, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Reza",
"surname": "Akbarinia",
"fullName": "Reza Akbarinia",
"affiliation": "Inria-University of Montpellier-Lirmm, Montpellier, Occitanie, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Florent",
"surname": "Masseglia",
"fullName": "Florent Masseglia",
"affiliation": "Inria-University of Montpellier-Lirmm, Montpellier, Occitanie, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Themis",
"surname": "Palpanas",
"fullName": "Themis Palpanas",
"affiliation": "Paris Descartes University, Paris, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "108-120",
"year": "2020",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdps/2006/0054/0/01639280",
"title": "DiST: fully decentralized indexing for querying distributed multidimensional datasets",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2006/01639280/12OmNAnMuA2",
"parentPublication": {
"id": "proceedings/ipdps/2006/0054/0",
"title": "Proceedings 20th IEEE International Parallel & Distributed Processing Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcs/2017/3250/0/08035186",
"title": "The Parallel and Distributed Future of Data Series Mining",
"doi": null,
"abstractUrl": "/proceedings-article/hpcs/2017/08035186/12OmNBghtvA",
"parentPublication": {
"id": "proceedings/hpcs/2017/3250/0",
"title": "2017 International Conference on High-Performance Computing & Simulation (HPCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2017/3835/0/3835b135",
"title": "DPiSAX: Massively Distributed Partitioned iSAX",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2017/3835b135/12OmNBqMDu8",
"parentPublication": {
"id": "proceedings/icdm/2017/3835/0",
"title": "2017 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdata-congress/2014/5057/0/06906798",
"title": "Adaptive Indexing for Distributed Array Processing",
"doi": null,
"abstractUrl": "/proceedings-article/bigdata-congress/2014/06906798/12OmNx7ov00",
"parentPublication": {
"id": "proceedings/bigdata-congress/2014/5057/0",
"title": "2014 IEEE International Congress on Big Data (BigData Congress)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2010/4256/0/4256a058",
"title": "iSAX 2.0: Indexing and Mining One Billion Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2010/4256a058/12OmNy87Qvn",
"parentPublication": {
"id": "proceedings/icdm/2010/4256/0",
"title": "2010 IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2014/7615/0/07097785",
"title": "A distributed approach for top-k star queries on massive information networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2014/07097785/12OmNyoiZ5W",
"parentPublication": {
"id": "proceedings/icpads/2014/7615/0",
"title": "2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2000/05/k0675",
"title": "Querying Time Series Data Based on Similarity",
"doi": null,
"abstractUrl": "/journal/tk/2000/05/k0675/13rRUwjXZSq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400b202",
"title": "TARDIS: Distributed Indexing Framework for Big Time Series Data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400b202/1aDT3ls8G9a",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101514",
"title": "Data Series Indexing Gone Parallel",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101514/1kaMPe06R5C",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101877",
"title": "MESSI: In-Memory Data Series Indexing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101877/1kaMz3xHOla",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08525260",
"articleId": "17D45We0UEV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08525337",
"articleId": "17D45WwsQ8z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1GP3Lufasec",
"title": "July-Aug.",
"year": "2022",
"issueNum": "04",
"idPrefix": "ex",
"pubType": "magazine",
"volume": "37",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DUa4JvEH5e",
"doi": "10.1109/MIS.2022.3179843",
"abstract": "The main issue of time-series prediction is to determine the grade of uncertainty in knowledge, with its essential vagueness and haziness in complex problems. In this study, a deep fuzzy long short-term memory (LSTM) architecture has been proposed to handle the high-order uncertainty associated with time-series applications. The LSTM and type-2 fuzzy logic combination aim to make a more transparent, interpretable, and accurate predictive system. The experiments of this study with real data contain global standard and real-valued benchmarks, including Mackey–Glass (MG), sunspot, and English Premier League seasonal datasets. The obtained performance shows the superiority of the proposed fuzzy–deep model in predicting time series with an average AUC = 0.96 in sunspot, 0.93 for football match time series, and 0.95 on a chaotic equation of MG.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The main issue of time-series prediction is to determine the grade of uncertainty in knowledge, with its essential vagueness and haziness in complex problems. In this study, a deep fuzzy long short-term memory (LSTM) architecture has been proposed to handle the high-order uncertainty associated with time-series applications. The LSTM and type-2 fuzzy logic combination aim to make a more transparent, interpretable, and accurate predictive system. The experiments of this study with real data contain global standard and real-valued benchmarks, including Mackey–Glass (MG), sunspot, and English Premier League seasonal datasets. The obtained performance shows the superiority of the proposed fuzzy–deep model in predicting time series with an average AUC = 0.96 in sunspot, 0.93 for football match time series, and 0.95 on a chaotic equation of MG.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The main issue of time-series prediction is to determine the grade of uncertainty in knowledge, with its essential vagueness and haziness in complex problems. In this study, a deep fuzzy long short-term memory (LSTM) architecture has been proposed to handle the high-order uncertainty associated with time-series applications. The LSTM and type-2 fuzzy logic combination aim to make a more transparent, interpretable, and accurate predictive system. The experiments of this study with real data contain global standard and real-valued benchmarks, including Mackey–Glass (MG), sunspot, and English Premier League seasonal datasets. The obtained performance shows the superiority of the proposed fuzzy–deep model in predicting time series with an average AUC = 0.96 in sunspot, 0.93 for football match time series, and 0.95 on a chaotic equation of MG.",
"title": "FD-LSTM: A Fuzzy LSTM Model for Chaotic Time-Series Prediction",
"normalizedTitle": "FD-LSTM: A Fuzzy LSTM Model for Chaotic Time-Series Prediction",
"fno": "09788030",
"hasPdf": true,
"idPrefix": "ex",
"keywords": [
"Chaos",
"Fuzzy Set Theory",
"Time Series",
"Accurate Predictive System",
"Sunspot",
"English Premier League Seasonal Datasets",
"Football Match Time Series",
"FD LSTM",
"Fuzzy LSTM Model",
"Chaotic Time Series Prediction",
"Complex Problems",
"Short Term Memory Architecture",
"High Order Uncertainty",
"Time Series Applications",
"Fuzzy Deep Model",
"Computer Architecture",
"Uncertainty",
"Time Series Analysis",
"Microprocessors",
"Predictive Models",
"Fuzzy Sets",
"Fuzzy Logic",
"Time Series Prediction",
"Deep Learning",
"LSTM",
"Type 2 Fuzzy System"
],
"authors": [
{
"givenName": "Milad Keshtkar",
"surname": "Langeroudi",
"fullName": "Milad Keshtkar Langeroudi",
"affiliation": "Islamic Azad University, Lahijan, Iran",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mohammad Reza",
"surname": "Yamaghani",
"fullName": "Mohammad Reza Yamaghani",
"affiliation": "Islamic Azad University, Lahijan, Iran",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siavash",
"surname": "Khodaparast",
"fullName": "Siavash Khodaparast",
"affiliation": "Islamic Azad University, Lahijan, Iran",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2022-07-01 00:00:00",
"pubType": "mags",
"pages": "70-78",
"year": "2022",
"issn": "1541-1672",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icct/2017/3030/0/08324019",
"title": "A robust and novel regression based fuzzy time series algorithm for prediction of rice yield",
"doi": null,
"abstractUrl": "/proceedings-article/icct/2017/08324019/12OmNBO3KiT",
"parentPublication": {
"id": "proceedings/icct/2017/3030/0",
"title": "2017 International Conference on Intelligent Communication and Computational Techniques (ICCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ivs/2005/8961/0/01505218",
"title": "Predicting chaotic time series using adaptive wavelet-fuzzy inference system",
"doi": null,
"abstractUrl": "/proceedings-article/ivs/2005/01505218/12OmNrHSD4y",
"parentPublication": {
"id": "proceedings/ivs/2005/8961/0",
"title": "2005 IEEE Intelligent Vehicles Symposium Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwcfta/2010/4247/0/4247a355",
"title": "A Chaotic Time Series Prediction Method Based on Fuzzy Neural Network and Its Application",
"doi": null,
"abstractUrl": "/proceedings-article/iwcfta/2010/4247a355/12OmNwG90gS",
"parentPublication": {
"id": "proceedings/iwcfta/2010/4247/0",
"title": "Chaos-Fractals Theories and Applications, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2008/3322/2/3322b050",
"title": "A Fuzzy Time Series Model to Forecast the BDI",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2008/3322b050/12OmNwLOYTw",
"parentPublication": {
"id": "proceedings/ncm/2008/3322/2",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367b493",
"title": "Time Series Mining by Fuzzy Natural Logic and F-Transform",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367b493/12OmNyKa6dg",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ettandgrs/2008/3563/2/3563b569",
"title": "Predicting Daily Ozone Concentration Maxima Using Fuzzy Time Series Based on Two-Stage Partition Method",
"doi": null,
"abstractUrl": "/proceedings-article/ettandgrs/2008/3563b569/12OmNzGlRCO",
"parentPublication": {
"id": "ettandgrs/2008/3563/2",
"title": "Education Technology and Training & Geoscience and Remote Sensing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/07/ttk2008070956",
"title": "Chaotic Time Series Prediction Using a Neuro-Fuzzy System with Time-Delay Coordinates",
"doi": null,
"abstractUrl": "/journal/tk/2008/07/ttk2008070956/13rRUxC0Swg",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/05/k0613",
"title": "Pattern Discovery of Fuzzy Time Series for Financial Prediction",
"doi": null,
"abstractUrl": "/journal/tk/2006/05/k0613/13rRUyuNsxl",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2022/9402/0/940200a437",
"title": "Learning to Rank using Fuzzy-Enhanced LSTM Model",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2022/940200a437/1MBEM0pgjzG",
"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": "mags/ex/2022/02/09495129",
"title": "A Type-2 Fuzzy Time Series Model for Pattern Similarity Analysis: A Case Study on Air Quality Forecasting",
"doi": null,
"abstractUrl": "/magazine/ex/2022/02/09495129/1vyjxeVoFzi",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09763425",
"articleId": "1CT4Y7iaxHy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09896789",
"articleId": "1GP3Q9TGixW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1xlvTMPWF7a",
"title": "Nov.",
"year": "2021",
"issueNum": "11",
"idPrefix": "tm",
"pubType": "journal",
"volume": "20",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1kj0Od0mbM4",
"doi": "10.1109/TMC.2020.2999075",
"abstract": "In cognitive radio networks (CRNs), dynamic spectrum access allows (unlicensed) users to identify and access unused channels opportunistically, thus improves spectrum utilization. In this paper, we address the user-channel allocation problem in multi-user multi-channel CRNs without a prior knowledge of channel statistics. The result of channel access is stochastic with unknown distribution, and statistically different for each user. In deciding the channel for access, a user needs to either explore a channel to learn its statistics, or exploit the channel with the highest expected reward based on the information collected so far. Further, a channel should be accessed exclusively by one user at a time to avoid collision. Using multi-armed bandit framework, we develop two rate-optimal algorithms with low computational complexities of <inline-formula><tex-math notation=\"LaTeX\">Z_$O(N)$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$O(NK)$_Z</tex-math></inline-formula>, respectively, where <inline-formula><tex-math notation=\"LaTeX\">Z_$N$_Z</tex-math></inline-formula> denotes the number of users and <inline-formula><tex-math notation=\"LaTeX\">Z_$K$_Z</tex-math></inline-formula> denotes the number of channels. Further, we extend the results and develop an algorithm that is amenable to implement in a distributed fashion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In cognitive radio networks (CRNs), dynamic spectrum access allows (unlicensed) users to identify and access unused channels opportunistically, thus improves spectrum utilization. In this paper, we address the user-channel allocation problem in multi-user multi-channel CRNs without a prior knowledge of channel statistics. The result of channel access is stochastic with unknown distribution, and statistically different for each user. In deciding the channel for access, a user needs to either explore a channel to learn its statistics, or exploit the channel with the highest expected reward based on the information collected so far. Further, a channel should be accessed exclusively by one user at a time to avoid collision. Using multi-armed bandit framework, we develop two rate-optimal algorithms with low computational complexities of <inline-formula><tex-math notation=\"LaTeX\">$O(N)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"joo-ieq1-2999075.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$O(NK)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>N</mml:mi><mml:mi>K</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"joo-ieq2-2999075.gif\"/></alternatives></inline-formula>, respectively, where <inline-formula><tex-math notation=\"LaTeX\">$N$</tex-math><alternatives><mml:math><mml:mi>N</mml:mi></mml:math><inline-graphic xlink:href=\"joo-ieq3-2999075.gif\"/></alternatives></inline-formula> denotes the number of users and <inline-formula><tex-math notation=\"LaTeX\">$K$</tex-math><alternatives><mml:math><mml:mi>K</mml:mi></mml:math><inline-graphic xlink:href=\"joo-ieq4-2999075.gif\"/></alternatives></inline-formula> denotes the number of channels. Further, we extend the results and develop an algorithm that is amenable to implement in a distributed fashion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In cognitive radio networks (CRNs), dynamic spectrum access allows (unlicensed) users to identify and access unused channels opportunistically, thus improves spectrum utilization. In this paper, we address the user-channel allocation problem in multi-user multi-channel CRNs without a prior knowledge of channel statistics. The result of channel access is stochastic with unknown distribution, and statistically different for each user. In deciding the channel for access, a user needs to either explore a channel to learn its statistics, or exploit the channel with the highest expected reward based on the information collected so far. Further, a channel should be accessed exclusively by one user at a time to avoid collision. Using multi-armed bandit framework, we develop two rate-optimal algorithms with low computational complexities of - and -, respectively, where - denotes the number of users and - denotes the number of channels. Further, we extend the results and develop an algorithm that is amenable to implement in a distributed fashion.",
"title": "Low-Complexity Learning for Dynamic Spectrum Access in Multi-User Multi-Channel Networks",
"normalizedTitle": "Low-Complexity Learning for Dynamic Spectrum Access in Multi-User Multi-Channel Networks",
"fno": "09104933",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Channel Allocation",
"Cognitive Radio",
"Computational Complexity",
"Learning Artificial Intelligence",
"Multi Access Systems",
"Optimisation",
"Radio Networks",
"Statistical Distributions",
"Stochastic Processes",
"Telecommunication Congestion Control",
"Dynamic Spectrum Access",
"Multiuser Multichannel Networks",
"User Channel Allocation Problem",
"Multiuser Multichannel CRN",
"Channel Statistics",
"Unused Channels Access",
"Low Complexity Learning",
"Unlicensed Users",
"Unknown Distribution",
"Collision Avoidance",
"Multiarmed Bandit Framework",
"Rate Optimal Algorithms",
"Optimal Matching",
"Dynamic Spectrum Access",
"Computational Complexity",
"Channel Estimation",
"Bipartite Graph",
"Mobile Computing",
"Cognitive Radio",
"Cognitive Radio Networks",
"Dynamic Spectrum Access",
"Combinatorial Multi Armed Bandits",
"Low Complexity"
],
"authors": [
{
"givenName": "Sunjung",
"surname": "Kang",
"fullName": "Sunjung Kang",
"affiliation": "Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Changhee",
"surname": "Joo",
"fullName": "Changhee Joo",
"affiliation": "Department of Computer Science and Engineering, Korea University, Seoul 02841, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2021-11-01 00:00:00",
"pubType": "trans",
"pages": "3267-3281",
"year": "2021",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/ec/2022/03/09827923",
"title": "PMNS for Efficient Arithmetic and Small Memory Cost",
"doi": null,
"abstractUrl": "/journal/ec/2022/03/09827923/1EWSBFUfd6M",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/08964488",
"title": "Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/08964488/1gLZGsjhZkc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/11/09099372",
"title": "On Heterogeneous Sensing Capability for Distributed Rendezvous in Cognitive Radio Networks",
"doi": null,
"abstractUrl": "/journal/tm/2021/11/09099372/1k7oCRHzGAE",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/02/09141372",
"title": "Highly Efficient and Re-Executable Private Function Evaluation With Linear Complexity",
"doi": null,
"abstractUrl": "/journal/tq/2022/02/09141372/1lu2SzkDEpG",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/10/09194366",
"title": "A Novel Measurement for Network Reliability",
"doi": null,
"abstractUrl": "/journal/tc/2021/10/09194366/1n0EqDZV3X2",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/12/09259210",
"title": "Circuit-Based Quantum Random Access Memory for Classical Data With Continuous Amplitudes",
"doi": null,
"abstractUrl": "/journal/tc/2021/12/09259210/1oIWvw5TOZq",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/05/09423579",
"title": "Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks",
"doi": null,
"abstractUrl": "/journal/tc/2022/05/09423579/1tkyeT8TOwg",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492838",
"title": "Maximum Signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-Clique Identification in Large Signed Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492838/1vq0EU6lrAA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09609537",
"title": "Hamiltonian Paths of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09609537/1yoxLa2YFO0",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09105121",
"articleId": "1kj0OsEhxew",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "1vq0EU6lrAA",
"doi": "10.1109/TKDE.2021.3098423",
"abstract": "The maximum clique problem, which is to find the clique with the largest size, can find many real-world applications and is notable for its capability of modeling many combinatorial problems. However, most existing research focuses on processing unsigned graphs, i.e., treat each connection equally. In real applications, edges of graphs are usually associated with signed information, i.e., positive or negative edges, and signed graph analysis has attracted great attentions in the recent. In this paper, we first analyze the disadvantages of existing signed clique models, and then propose a novel clique model, named signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-clique. Given a signed graph <inline-formula><tex-math notation=\"LaTeX\">Z_$G$_Z</tex-math></inline-formula> and a subgraph <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula>, let <inline-formula><tex-math notation=\"LaTeX\">Z_$d^{+}_{S}(u)$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$d^{-}_{S}(u)$_Z</tex-math></inline-formula> be the number of positive and negative neighbors of vertex <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> in <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula>. We say a subgraph <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula> is a signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-clique if <inline-formula><tex-math notation=\"LaTeX\">Z_$i)$_Z</tex-math></inline-formula> <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula> is a clique and <inline-formula><tex-math notation=\"LaTeX\">Z_$ii)$_Z</tex-math></inline-formula> each vertex <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> in <inline-formula><tex-math notation=\"LaTeX\">Z_$S$_Z</tex-math></inline-formula> fulfills <inline-formula><tex-math notation=\"LaTeX\">Z_$d^{+}_{S}(u) - d^{-}_{S}(u) \\geq \\theta$_Z</tex-math></inline-formula>. We show that the problem of identifying the maximum signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-clique is NP-hard. Novel pruning techniques are proposed to reduce the searching space. In addition, efficient searching strategies are developed to scale for large graphs. Comprehensive experiments on 8 real-world datasets are conducted to demonstrate the effectiveness and efficiency of the proposed approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The maximum clique problem, which is to find the clique with the largest size, can find many real-world applications and is notable for its capability of modeling many combinatorial problems. However, most existing research focuses on processing unsigned graphs, i.e., treat each connection equally. In real applications, edges of graphs are usually associated with signed information, i.e., positive or negative edges, and signed graph analysis has attracted great attentions in the recent. In this paper, we first analyze the disadvantages of existing signed clique models, and then propose a novel clique model, named signed <inline-formula><tex-math notation=\"LaTeX\">$\\theta$</tex-math><alternatives><mml:math><mml:mi>θ</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq2-3098423.gif\"/></alternatives></inline-formula>-clique. Given a signed graph <inline-formula><tex-math notation=\"LaTeX\">$G$</tex-math><alternatives><mml:math><mml:mi>G</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq3-3098423.gif\"/></alternatives></inline-formula> and a subgraph <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq4-3098423.gif\"/></alternatives></inline-formula>, let <inline-formula><tex-math notation=\"LaTeX\">$d^{+}_{S}(u)$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mi>d</mml:mi><mml:mi>S</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"wang-ieq5-3098423.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$d^{-}_{S}(u)$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mi>d</mml:mi><mml:mi>S</mml:mi><mml:mo>-</mml:mo></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"wang-ieq6-3098423.gif\"/></alternatives></inline-formula> be the number of positive and negative neighbors of vertex <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives><mml:math><mml:mi>u</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq7-3098423.gif\"/></alternatives></inline-formula> in <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq8-3098423.gif\"/></alternatives></inline-formula>. We say a subgraph <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq9-3098423.gif\"/></alternatives></inline-formula> is a signed <inline-formula><tex-math notation=\"LaTeX\">$\\theta$</tex-math><alternatives><mml:math><mml:mi>θ</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq10-3098423.gif\"/></alternatives></inline-formula>-clique if <inline-formula><tex-math notation=\"LaTeX\">$i)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"wang-ieq11-3098423.gif\"/></alternatives></inline-formula> <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq12-3098423.gif\"/></alternatives></inline-formula> is a clique and <inline-formula><tex-math notation=\"LaTeX\">$ii)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"wang-ieq13-3098423.gif\"/></alternatives></inline-formula> each vertex <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives><mml:math><mml:mi>u</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq14-3098423.gif\"/></alternatives></inline-formula> in <inline-formula><tex-math notation=\"LaTeX\">$S$</tex-math><alternatives><mml:math><mml:mi>S</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq15-3098423.gif\"/></alternatives></inline-formula> fulfills <inline-formula><tex-math notation=\"LaTeX\">$d^{+}_{S}(u) - d^{-}_{S}(u) \\geq \\theta$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mi>d</mml:mi><mml:mi>S</mml:mi><mml:mo>+</mml:mo></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:msubsup><mml:mi>d</mml:mi><mml:mi>S</mml:mi><mml:mo>-</mml:mo></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>≥</mml:mo><mml:mi>θ</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"wang-ieq16-3098423.gif\"/></alternatives></inline-formula>. We show that the problem of identifying the maximum signed <inline-formula><tex-math notation=\"LaTeX\">$\\theta$</tex-math><alternatives><mml:math><mml:mi>θ</mml:mi></mml:math><inline-graphic xlink:href=\"wang-ieq17-3098423.gif\"/></alternatives></inline-formula>-clique is NP-hard. Novel pruning techniques are proposed to reduce the searching space. In addition, efficient searching strategies are developed to scale for large graphs. Comprehensive experiments on 8 real-world datasets are conducted to demonstrate the effectiveness and efficiency of the proposed approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The maximum clique problem, which is to find the clique with the largest size, can find many real-world applications and is notable for its capability of modeling many combinatorial problems. However, most existing research focuses on processing unsigned graphs, i.e., treat each connection equally. In real applications, edges of graphs are usually associated with signed information, i.e., positive or negative edges, and signed graph analysis has attracted great attentions in the recent. In this paper, we first analyze the disadvantages of existing signed clique models, and then propose a novel clique model, named signed --clique. Given a signed graph - and a subgraph -, let - and - be the number of positive and negative neighbors of vertex - in -. We say a subgraph - is a signed --clique if - - is a clique and - each vertex - in - fulfills -. We show that the problem of identifying the maximum signed --clique is NP-hard. Novel pruning techniques are proposed to reduce the searching space. In addition, efficient searching strategies are developed to scale for large graphs. Comprehensive experiments on 8 real-world datasets are conducted to demonstrate the effectiveness and efficiency of the proposed approaches.",
"title": "Maximum Signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-Clique Identification in Large Signed Graphs",
"normalizedTitle": "Maximum Signed --Clique Identification in Large Signed Graphs",
"fno": "09492838",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Computational Complexity",
"Graph Theory",
"Search Problems",
"Clique Model",
"Combinatorial Problems",
"Graph Analysis",
"Maximum Clique Problem",
"Maximum Signed X 03 B 8 Clique Identification",
"NP Hard Problem",
"Searching Strategies",
"Signed Graphs",
"Signed Information",
"Unsigned Graphs",
"Computational Modeling",
"Analytical Models",
"Proteins",
"Collaboration",
"Sun",
"Social Networking Online",
"Biology",
"Signed Graph",
"Positive Negative Connections",
"signed <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_$\\theta$_Z</tex-math> </inline-formula> </named-content>-clique",
"NP Hard"
],
"authors": [
{
"givenName": "Chen",
"surname": "Chen",
"fullName": "Chen Chen",
"affiliation": "School of Computer and Information Engineering, Zhejiang Gongshang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanping",
"surname": "Wu",
"fullName": "Yanping Wu",
"affiliation": "School of Computer and Information Engineering, Zhejiang Gongshang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Renjie",
"surname": "Sun",
"fullName": "Renjie Sun",
"affiliation": "School of Computer and Information Engineering, Zhejiang Gongshang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoyang",
"surname": "Wang",
"fullName": "Xiaoyang Wang",
"affiliation": "School of Computer and Information Engineering, Zhejiang Gongshang University, Hangzhou, Zhejiang, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1791-1802",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2019/06/08371302",
"title": "Efficient Algorithms for Finding the Closest <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-Mers in Biological Data",
"doi": null,
"abstractUrl": "/journal/tb/2019/06/08371302/13rRUxlgyai",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09723546",
"title": "Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, <inline-formula><tex-math notation=\"LaTeX\">Z_$(SGD)^{2}$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09723546/1BocJwdaFYk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09189818",
"title": "Fully Dynamic <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Center Clustering With Improved Memory Efficiency",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09189818/1mYZ9fnEFq0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2022/06/09351686",
"title": "Mining Diversified Top-<inline-formula><tex-math notation=\"LaTeX\">Z_$r$_Z</tex-math></inline-formula> Lasting Cohesive Subgraphs on Temporal Networks",
"doi": null,
"abstractUrl": "/journal/bd/2022/06/09351686/1r4ZEAVxQQg",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09463675",
"title": "Efficient Hardware Implementation of Finite Field Arithmetic <inline-formula><tex-math notation=\"LaTeX\">Z_$AB+C$_Z</tex-math></inline-formula> for Binary Ring-LWE Based Post-Quantum Cryptography",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09463675/1uFxptYevFC",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09525250",
"title": "Fast Reachability Queries Answering Based on <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathsf{RCN}$_Z</tex-math></inline-formula> Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09525250/1wuoOp439OU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/01/09616383",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$xAFCL$_Z</tex-math></inline-formula>: Run Scalable Function Choreographies Across Multiple FaaS Systems",
"doi": null,
"abstractUrl": "/journal/sc/2023/01/09616383/1yA74qnPV4c",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09609537",
"title": "Hamiltonian Paths of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09609537/1yoxLa2YFO0",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/11/09650723",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$TC-Stream$_Z</tex-math></inline-formula>: Large-Scale Graph Triangle Counting on a Single Machine Using GPUs",
"doi": null,
"abstractUrl": "/journal/td/2022/11/09650723/1zkp1OCIUHS",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09477110",
"articleId": "1v2M0gZ7HMs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09506867",
"articleId": "1vNfnNHsqzK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1yfWD9Y4aLS",
"title": "July",
"year": "2022",
"issueNum": "07",
"idPrefix": "td",
"pubType": "journal",
"volume": "33",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1yoxL0ygC2c",
"doi": "10.1109/TPDS.2021.3126257",
"abstract": "Fault diagnosability is utilized as a significant measure that reflects the reliability of a multiprocessor system. However, people frequently pay close attention to the entire system’s diagnosability while ignoring the system’s important local information. The <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula>-fault-free-neighbor local fault diagnosability (for short, <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula>-FFNLFD) is a novel indicator, which describes the diagnosability of a system at a local node with <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula> fault-free neighbors. In this paper, we propose the <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula>-FFNLFD of general networks at local node under the Preparata Metze Chien model. Moreover, we also characterize some important properties of <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula>-FFNLFD of a multiprocessor system under the comparison model. Furthermore, we apply our proposed conclusions to directly obtain the <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula>-FFNLFD of 11 well-known networks under PMC-M and MM*-M, including hypercubes, locally twisted cubes, <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes, crossed cubes, twisted hypercubes, exchanged hypercubes, star graphs, <inline-formula><tex-math notation=\"LaTeX\">Z_$(n,k)$_Z</tex-math></inline-formula>-star graphs, <inline-formula><tex-math notation=\"LaTeX\">Z_$(n,k)$_Z</tex-math></inline-formula>-arrangement graphs, data center network DCells and BCDCs. Finally, we compare the <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula>-FFNLFD with both diagnosability and conditional diagnosability, and it is shown that the <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula>-FFNLFD is greater than all the other fault diagnosabilities.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Fault diagnosability is utilized as a significant measure that reflects the reliability of a multiprocessor system. However, people frequently pay close attention to the entire system’s diagnosability while ignoring the system’s important local information. The <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq1-3126257.gif\"/></alternatives></inline-formula>-fault-free-neighbor local fault diagnosability (for short, <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq2-3126257.gif\"/></alternatives></inline-formula>-FFNLFD) is a novel indicator, which describes the diagnosability of a system at a local node with <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq3-3126257.gif\"/></alternatives></inline-formula> fault-free neighbors. In this paper, we propose the <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq4-3126257.gif\"/></alternatives></inline-formula>-FFNLFD of general networks at local node under the Preparata Metze Chien model. Moreover, we also characterize some important properties of <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq5-3126257.gif\"/></alternatives></inline-formula>-FFNLFD of a multiprocessor system under the comparison model. Furthermore, we apply our proposed conclusions to directly obtain the <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq6-3126257.gif\"/></alternatives></inline-formula>-FFNLFD of 11 well-known networks under PMC-M and MM*-M, including hypercubes, locally twisted cubes, <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq7-3126257.gif\"/></alternatives></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq8-3126257.gif\"/></alternatives></inline-formula>-cubes, crossed cubes, twisted hypercubes, exchanged hypercubes, star graphs, <inline-formula><tex-math notation=\"LaTeX\">$(n,k)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"lin-ieq9-3126257.gif\"/></alternatives></inline-formula>-star graphs, <inline-formula><tex-math notation=\"LaTeX\">$(n,k)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"lin-ieq10-3126257.gif\"/></alternatives></inline-formula>-arrangement graphs, data center network DCells and BCDCs. Finally, we compare the <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq11-3126257.gif\"/></alternatives></inline-formula>-FFNLFD with both diagnosability and conditional diagnosability, and it is shown that the <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"lin-ieq12-3126257.gif\"/></alternatives></inline-formula>-FFNLFD is greater than all the other fault diagnosabilities.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Fault diagnosability is utilized as a significant measure that reflects the reliability of a multiprocessor system. However, people frequently pay close attention to the entire system’s diagnosability while ignoring the system’s important local information. The --fault-free-neighbor local fault diagnosability (for short, --FFNLFD) is a novel indicator, which describes the diagnosability of a system at a local node with - fault-free neighbors. In this paper, we propose the --FFNLFD of general networks at local node under the Preparata Metze Chien model. Moreover, we also characterize some important properties of --FFNLFD of a multiprocessor system under the comparison model. Furthermore, we apply our proposed conclusions to directly obtain the --FFNLFD of 11 well-known networks under PMC-M and MM*-M, including hypercubes, locally twisted cubes, --ary --cubes, crossed cubes, twisted hypercubes, exchanged hypercubes, star graphs, --star graphs, --arrangement graphs, data center network DCells and BCDCs. Finally, we compare the --FFNLFD with both diagnosability and conditional diagnosability, and it is shown that the --FFNLFD is greater than all the other fault diagnosabilities.",
"title": "FFNLFD: Fault Diagnosis of Multiprocessor Systems at Local Node With Fault-Free Neighbors Under PMC Model and MM* Model",
"normalizedTitle": "FFNLFD: Fault Diagnosis of Multiprocessor Systems at Local Node With Fault-Free Neighbors Under PMC Model and MM* Model",
"fno": "09609660",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Fault Diagnosis",
"Fault Tolerant Computing",
"Graph Theory",
"Hypercube Networks",
"Network Theory Graphs",
"Parallel Processing",
"Program Diagnostics",
"Program Testing",
"Software Reliability",
"FFNLFD",
"Fault Diagnosis",
"Multiprocessor System Reliability",
"Fault Free Neighbors",
"PMC Model",
"MM Model",
"Preparata Metze Chien Model",
"Locally Twisted Cubes",
"Twisted Hypercubes",
"Kk Ary Nn Cubes",
"Crossed Cubes",
"Exchanged Hypercubes",
"Star Graphs",
"Arrangement Graphs",
"Data Center Network D Cells",
"BCD Cs",
"Test Based Diagnostic Model",
"Multiprocessing Systems",
"Hypercubes",
"Data Models",
"Fault Diagnosis",
"Data Centers",
"Computer Science",
"Computer Crime",
"Interconnection Networks",
"Reliability",
"Fault Diagnosis",
"Fault Free Neighbor Local Fault Diagnosability"
],
"authors": [
{
"givenName": "Limei",
"surname": "Lin",
"fullName": "Limei Lin",
"affiliation": "Key Laboratory of Network Security and Cryptology, and Center for Applied Mathematics of Fujian Province (Fujian Normal University), College of Computer and Cyber Security, Fujian Normal University, Fuzhou, Fujian, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanze",
"surname": "Huang",
"fullName": "Yanze Huang",
"affiliation": "School of Computer Science and Mathematics, Fujian University of Technology, Fuzhou, Fujian, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuhang",
"surname": "Lin",
"fullName": "Yuhang Lin",
"affiliation": "Key Laboratory of Network Security and Cryptology, and Center for Applied Mathematics of Fujian Province (Fujian Normal University), College of Computer and Cyber Security, Fujian Normal University, Fuzhou, Fujian, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sun-Yuan",
"surname": "Hsieh",
"fullName": "Sun-Yuan Hsieh",
"affiliation": "Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Li",
"surname": "Xu",
"fullName": "Li Xu",
"affiliation": "Key Laboratory of Network Security and Cryptology, and Center for Applied Mathematics of Fujian Province (Fujian Normal University), College of Computer and Cyber Security, Fujian Normal University, Fuzhou, Fujian, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2022-07-01 00:00:00",
"pubType": "trans",
"pages": "1739-1751",
"year": "2022",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tq/2018/02/07464850",
"title": "Conditional Diagnosability of Z_$(n,k)$_Z -Star Graphs Under the PMC Model",
"doi": null,
"abstractUrl": "/journal/tq/2018/02/07464850/13rRUxly9fn",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2015/04/06800081",
"title": "The <inline-formula><tex-math notation=\"LaTeX\">Z_${\\schmi g}$_Z</tex-math></inline-formula>-Good-Neighbor Conditional Diagnosability of <inline-formula><tex-math notation=\"LaTeX\">Z_${\\schmi k}$_Z</tex-math></inline-formula>-Ary <inline-formula><tex-math notation=\"LaTeX\">Z_${\\schmi n}$_Z</tex-math></inline-formula>-Cubes under the PMC Model and MM Model",
"doi": null,
"abstractUrl": "/journal/td/2015/04/06800081/13rRUyeCka1",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2021/06/08705372",
"title": "Scheduling Real-Time Security Aware Tasks in Fog Networks",
"doi": null,
"abstractUrl": "/journal/sc/2021/06/08705372/19JpNnOBEY0",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09858633",
"title": "Robustness of Subsystem Reliability of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-Cube Networks Under Probabilistic Fault Model",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09858633/1FUYE7DVEaI",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/04/10036103",
"title": "Intermittent Fault Diagnosis of Split-Star Networks and its Applications",
"doi": null,
"abstractUrl": "/journal/td/2023/04/10036103/1KsSIU37H1u",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2021/10/09194366",
"title": "A Novel Measurement for Network Reliability",
"doi": null,
"abstractUrl": "/journal/tc/2021/10/09194366/1n0EqDZV3X2",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/05/09431707",
"title": "Building Fault-Tolerant Overlays With Low Node Degrees for Topic-Based Publish/Subscribe",
"doi": null,
"abstractUrl": "/journal/tq/2022/05/09431707/1tB9khbrCKc",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/05/09423579",
"title": "Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks",
"doi": null,
"abstractUrl": "/journal/tc/2022/05/09423579/1tkyeT8TOwg",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/08/09645299",
"title": "Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing",
"doi": null,
"abstractUrl": "/journal/td/2022/08/09645299/1zc6KmIXvk4",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09600618",
"articleId": "1yeDB356Y6s",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09609537",
"articleId": "1yoxLa2YFO0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1yfWD9Y4aLS",
"title": "July",
"year": "2022",
"issueNum": "07",
"idPrefix": "td",
"pubType": "journal",
"volume": "33",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1yoxLa2YFO0",
"doi": "10.1109/TPDS.2021.3126254",
"abstract": "The <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cube <inline-formula><tex-math notation=\"LaTeX\">Z_$Q_n^k$_Z</tex-math></inline-formula> is one of the most attractive interconnection networks for parallel and distributed systems. Let <inline-formula><tex-math notation=\"LaTeX\">Z_$F$_Z</tex-math></inline-formula> be a set of faulty links in <inline-formula><tex-math notation=\"LaTeX\">Z_$Q_n^k$_Z</tex-math></inline-formula> and let <inline-formula><tex-math notation=\"LaTeX\">Z_$L$_Z</tex-math></inline-formula> be a linear forest in <inline-formula><tex-math notation=\"LaTeX\">Z_$Q_n^k-F$_Z</tex-math></inline-formula> such that <inline-formula><tex-math notation=\"LaTeX\">Z_$|E(L)|+|F|\\leq 2n-3$_Z</tex-math></inline-formula>. For any two distinct nodes <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$v$_Z</tex-math></inline-formula> of <inline-formula><tex-math notation=\"LaTeX\">Z_$Q_n^k$_Z</tex-math></inline-formula> with <inline-formula><tex-math notation=\"LaTeX\">Z_$n\\geq 2$_Z</tex-math></inline-formula> and odd <inline-formula><tex-math notation=\"LaTeX\">Z_$k\\geq 3$_Z</tex-math></inline-formula>, we prove that <inline-formula><tex-math notation=\"LaTeX\">Z_$Q_n^k-F$_Z</tex-math></inline-formula> admits a Hamiltonian path between <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$v$_Z</tex-math></inline-formula> passing through <inline-formula><tex-math notation=\"LaTeX\">Z_$L$_Z</tex-math></inline-formula> if and only if none of the paths in <inline-formula><tex-math notation=\"LaTeX\">Z_$L$_Z</tex-math></inline-formula> has <inline-formula><tex-math notation=\"LaTeX\">Z_$u$_Z</tex-math></inline-formula> or <inline-formula><tex-math notation=\"LaTeX\">Z_$v$_Z</tex-math></inline-formula> as internal nodes or both of them as end-nodes. The upper bound <inline-formula><tex-math notation=\"LaTeX\">Z_$2n-3$_Z</tex-math></inline-formula> on <inline-formula><tex-math notation=\"LaTeX\">Z_$|E(L)|+|F|$_Z</tex-math></inline-formula> is optimal in the worst case. The main results in this paper generalized some known results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq3-3126254.gif\"/></alternatives></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq4-3126254.gif\"/></alternatives></inline-formula>-cube <inline-formula><tex-math notation=\"LaTeX\">$Q_n^k$</tex-math><alternatives><mml:math><mml:msubsup><mml:mi>Q</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math><inline-graphic xlink:href=\"yang-ieq5-3126254.gif\"/></alternatives></inline-formula> is one of the most attractive interconnection networks for parallel and distributed systems. Let <inline-formula><tex-math notation=\"LaTeX\">$F$</tex-math><alternatives><mml:math><mml:mi>F</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq6-3126254.gif\"/></alternatives></inline-formula> be a set of faulty links in <inline-formula><tex-math notation=\"LaTeX\">$Q_n^k$</tex-math><alternatives><mml:math><mml:msubsup><mml:mi>Q</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math><inline-graphic xlink:href=\"yang-ieq7-3126254.gif\"/></alternatives></inline-formula> and let <inline-formula><tex-math notation=\"LaTeX\">$L$</tex-math><alternatives><mml:math><mml:mi>L</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq8-3126254.gif\"/></alternatives></inline-formula> be a linear forest in <inline-formula><tex-math notation=\"LaTeX\">$Q_n^k-F$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mi>Q</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup><mml:mo>-</mml:mo><mml:mi>F</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq9-3126254.gif\"/></alternatives></inline-formula> such that <inline-formula><tex-math notation=\"LaTeX\">$|E(L)|+|F|\\leq 2n-3$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:mo>+</mml:mo><mml:mo>|</mml:mo><mml:mi>F</mml:mi><mml:mo>|</mml:mo><mml:mo>≤</mml:mo><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq10-3126254.gif\"/></alternatives></inline-formula>. For any two distinct nodes <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives><mml:math><mml:mi>u</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq11-3126254.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$v$</tex-math><alternatives><mml:math><mml:mi>v</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq12-3126254.gif\"/></alternatives></inline-formula> of <inline-formula><tex-math notation=\"LaTeX\">$Q_n^k$</tex-math><alternatives><mml:math><mml:msubsup><mml:mi>Q</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math><inline-graphic xlink:href=\"yang-ieq13-3126254.gif\"/></alternatives></inline-formula> with <inline-formula><tex-math notation=\"LaTeX\">$n\\geq 2$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>n</mml:mi><mml:mo>≥</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq14-3126254.gif\"/></alternatives></inline-formula> and odd <inline-formula><tex-math notation=\"LaTeX\">$k\\geq 3$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>k</mml:mi><mml:mo>≥</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq15-3126254.gif\"/></alternatives></inline-formula>, we prove that <inline-formula><tex-math notation=\"LaTeX\">$Q_n^k-F$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mi>Q</mml:mi><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msubsup><mml:mo>-</mml:mo><mml:mi>F</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq16-3126254.gif\"/></alternatives></inline-formula> admits a Hamiltonian path between <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives><mml:math><mml:mi>u</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq17-3126254.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$v$</tex-math><alternatives><mml:math><mml:mi>v</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq18-3126254.gif\"/></alternatives></inline-formula> passing through <inline-formula><tex-math notation=\"LaTeX\">$L$</tex-math><alternatives><mml:math><mml:mi>L</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq19-3126254.gif\"/></alternatives></inline-formula> if and only if none of the paths in <inline-formula><tex-math notation=\"LaTeX\">$L$</tex-math><alternatives><mml:math><mml:mi>L</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq20-3126254.gif\"/></alternatives></inline-formula> has <inline-formula><tex-math notation=\"LaTeX\">$u$</tex-math><alternatives><mml:math><mml:mi>u</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq21-3126254.gif\"/></alternatives></inline-formula> or <inline-formula><tex-math notation=\"LaTeX\">$v$</tex-math><alternatives><mml:math><mml:mi>v</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq22-3126254.gif\"/></alternatives></inline-formula> as internal nodes or both of them as end-nodes. The upper bound <inline-formula><tex-math notation=\"LaTeX\">$2n-3$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq23-3126254.gif\"/></alternatives></inline-formula> on <inline-formula><tex-math notation=\"LaTeX\">$|E(L)|+|F|$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>(</mml:mo><mml:mi>L</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:mo>+</mml:mo><mml:mo>|</mml:mo><mml:mi>F</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq24-3126254.gif\"/></alternatives></inline-formula> is optimal in the worst case. The main results in this paper generalized some known results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The --ary --cube - is one of the most attractive interconnection networks for parallel and distributed systems. Let - be a set of faulty links in - and let - be a linear forest in - such that -. For any two distinct nodes - and - of - with - and odd -, we prove that - admits a Hamiltonian path between - and - passing through - if and only if none of the paths in - has - or - as internal nodes or both of them as end-nodes. The upper bound - on - is optimal in the worst case. The main results in this paper generalized some known results.",
"title": "Hamiltonian Paths of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-ary <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"normalizedTitle": "Hamiltonian Paths of --ary --cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests",
"fno": "09609537",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Computational Complexity",
"Fault Tolerant Computing",
"Hypercube Networks",
"Trees Mathematics",
"Hamiltonian Path",
"Faulty Links",
"Linear Forests",
"Interconnection Networks",
"Parallel System",
"Distributed Systems",
"Forestry",
"Fault Tolerant Systems",
"Fault Tolerance",
"Program Processors",
"Routing",
"Upper Bound",
"Information Science",
"Interconnection Networks",
"<inline-formula xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"> <tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math> </inline-formula>-ary <inline-formula xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"> <tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math> </inline-formula>-cubes",
"Fault Tolerance",
"Prescribed Linear Forests",
"Hamiltonian Paths"
],
"authors": [
{
"givenName": "Yuxing",
"surname": "Yang",
"fullName": "Yuxing Yang",
"affiliation": "School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lingling",
"surname": "Zhang",
"fullName": "Lingling Zhang",
"affiliation": "School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2022-07-01 00:00:00",
"pubType": "trans",
"pages": "1752-1760",
"year": "2022",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2019/06/08371302",
"title": "Efficient Algorithms for Finding the Closest <inline-formula><tex-math notation=\"LaTeX\">Z_$l$_Z</tex-math></inline-formula>-Mers in Biological Data",
"doi": null,
"abstractUrl": "/journal/tb/2019/06/08371302/13rRUxlgyai",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09756312",
"title": "Continuous <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Regret Minimization Queries: A Dynamic Coreset Approach",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09756312/1CvQcl7WKu4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09189818",
"title": "Fully Dynamic <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Center Clustering With Improved Memory Efficiency",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09189818/1mYZ9fnEFq0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2022/06/09351686",
"title": "Mining Diversified Top-<inline-formula><tex-math notation=\"LaTeX\">Z_$r$_Z</tex-math></inline-formula> Lasting Cohesive Subgraphs on Temporal Networks",
"doi": null,
"abstractUrl": "/journal/bd/2022/06/09351686/1r4ZEAVxQQg",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09373914",
"title": "A Practical <inline-formula><tex-math notation=\"LaTeX\">Z_$O(N^2)$_Z</tex-math></inline-formula> Outlier Removal Method for Correspondence-Based Point Cloud Registration",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09373914/1rPt9ICFlCw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492838",
"title": "Maximum Signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-Clique Identification in Large Signed Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492838/1vq0EU6lrAA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09525250",
"title": "Fast Reachability Queries Answering Based on <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathsf{RCN}$_Z</tex-math></inline-formula> Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09525250/1wuoOp439OU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2023/01/09616383",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$xAFCL$_Z</tex-math></inline-formula>: Run Scalable Function Choreographies Across Multiple FaaS Systems",
"doi": null,
"abstractUrl": "/journal/sc/2023/01/09616383/1yA74qnPV4c",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/11/09650723",
"title": "<inline-formula><tex-math notation=\"LaTeX\">Z_$TC-Stream$_Z</tex-math></inline-formula>: Large-Scale Graph Triangle Counting on a Single Machine Using GPUs",
"doi": null,
"abstractUrl": "/journal/td/2022/11/09650723/1zkp1OCIUHS",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09609660",
"articleId": "1yoxL0ygC2c",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Lk2bbwqInK",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zzl2ZAAVvq",
"doi": "10.1109/TKDE.2021.3137955",
"abstract": "<inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-truss model only considers the direct common neighbors of an edge, which restricts its ability to reveal fine-grained structure information of the graph. Motivated by this, in this paper, we propose a new model named <inline-formula><tex-math notation=\"LaTeX\">Z_$(k, \\tau)$_Z</tex-math></inline-formula>-truss that considers the higher-order neighborhood (<inline-formula><tex-math notation=\"LaTeX\">Z_$\\tau$_Z</tex-math></inline-formula> hop) information of an edge. Based on the <inline-formula><tex-math notation=\"LaTeX\">Z_$(k, \\tau)$_Z</tex-math></inline-formula>-truss model, we study the higher-order truss decomposition problem which computes the <inline-formula><tex-math notation=\"LaTeX\">Z_$(k, \\tau)$_Z</tex-math></inline-formula>-trusses for all possible <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula> values regarding a given <inline-formula><tex-math notation=\"LaTeX\">Z_$\\tau$_Z</tex-math></inline-formula>. Higher-order truss decomposition can be used in the applications such as community detection and search, hierarchical structure analysis, and graph visualization. To address this problem, we first propose a bottom-up decomposition paradigm in the increasing order of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula> values to compute the corresponding <inline-formula><tex-math notation=\"LaTeX\">Z_$(k, \\tau)$_Z</tex-math></inline-formula>-truss. Based on the bottom-up decomposition paradigm, we further devise three optimization strategies to reduce the unnecessary computation. We evaluate our proposed algorithms on real datasets and synthetic datasets, the experimental results demonstrate the efficiency, effectiveness and scalability of our proposed algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "<inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"yuan-ieq1-3137955.gif\"/></alternatives></inline-formula>-truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"yuan-ieq2-3137955.gif\"/></alternatives></inline-formula>-truss model only considers the direct common neighbors of an edge, which restricts its ability to reveal fine-grained structure information of the graph. Motivated by this, in this paper, we propose a new model named <inline-formula><tex-math notation=\"LaTeX\">$(k, \\tau)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>τ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"yuan-ieq3-3137955.gif\"/></alternatives></inline-formula>-truss that considers the higher-order neighborhood (<inline-formula><tex-math notation=\"LaTeX\">$\\tau$</tex-math><alternatives><mml:math><mml:mi>τ</mml:mi></mml:math><inline-graphic xlink:href=\"yuan-ieq4-3137955.gif\"/></alternatives></inline-formula> hop) information of an edge. Based on the <inline-formula><tex-math notation=\"LaTeX\">$(k, \\tau)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>τ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"yuan-ieq5-3137955.gif\"/></alternatives></inline-formula>-truss model, we study the higher-order truss decomposition problem which computes the <inline-formula><tex-math notation=\"LaTeX\">$(k, \\tau)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>τ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"yuan-ieq6-3137955.gif\"/></alternatives></inline-formula>-trusses for all possible <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"yuan-ieq7-3137955.gif\"/></alternatives></inline-formula> values regarding a given <inline-formula><tex-math notation=\"LaTeX\">$\\tau$</tex-math><alternatives><mml:math><mml:mi>τ</mml:mi></mml:math><inline-graphic xlink:href=\"yuan-ieq8-3137955.gif\"/></alternatives></inline-formula>. Higher-order truss decomposition can be used in the applications such as community detection and search, hierarchical structure analysis, and graph visualization. To address this problem, we first propose a bottom-up decomposition paradigm in the increasing order of <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"yuan-ieq9-3137955.gif\"/></alternatives></inline-formula> values to compute the corresponding <inline-formula><tex-math notation=\"LaTeX\">$(k, \\tau)$</tex-math><alternatives><mml:math><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>τ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"yuan-ieq10-3137955.gif\"/></alternatives></inline-formula>-truss. Based on the bottom-up decomposition paradigm, we further devise three optimization strategies to reduce the unnecessary computation. We evaluate our proposed algorithms on real datasets and synthetic datasets, the experimental results demonstrate the efficiency, effectiveness and scalability of our proposed algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "--truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the --truss model only considers the direct common neighbors of an edge, which restricts its ability to reveal fine-grained structure information of the graph. Motivated by this, in this paper, we propose a new model named --truss that considers the higher-order neighborhood (- hop) information of an edge. Based on the --truss model, we study the higher-order truss decomposition problem which computes the --trusses for all possible - values regarding a given -. Higher-order truss decomposition can be used in the applications such as community detection and search, hierarchical structure analysis, and graph visualization. To address this problem, we first propose a bottom-up decomposition paradigm in the increasing order of - values to compute the corresponding --truss. Based on the bottom-up decomposition paradigm, we further devise three optimization strategies to reduce the unnecessary computation. We evaluate our proposed algorithms on real datasets and synthetic datasets, the experimental results demonstrate the efficiency, effectiveness and scalability of our proposed algorithms.",
"title": "Higher-Order Truss Decomposition in Graphs",
"normalizedTitle": "Higher-Order Truss Decomposition in Graphs",
"fno": "09662190",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Computational Complexity",
"Data Visualisation",
"Graph Theory",
"Network Theory Graphs",
"Decomposition Paradigm",
"Fine Grained Structure Information",
"Hierarchical Structure Analysis",
"Higher Order Neighborhood",
"Higher Order Truss Decomposition Problem",
"Increasing Order",
"Typical Cohesive Subgraph Model",
"X 03 C 4 Hop",
"Computational Modeling",
"Image Edge Detection",
"Optimization",
"Scalability",
"Data Models",
"Collaboration",
"Visualization",
"Higher Order Neighborhood",
"Truss Decomposition",
"Graph Algorithm"
],
"authors": [
{
"givenName": "Zi",
"surname": "Chen",
"fullName": "Zi Chen",
"affiliation": "Software Engineering Institute, East China Normal University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Long",
"surname": "Yuan",
"fullName": "Long Yuan",
"affiliation": "School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, Jiangsu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Li",
"surname": "Han",
"fullName": "Li Han",
"affiliation": "Software Engineering Institute, East China Normal University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhengping",
"surname": "Qian",
"fullName": "Zhengping Qian",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "3966-3978",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2023/03/09774034",
"title": "Exploring Truss Maintenance in Fully Dynamic Graphs: A Mixed Structure-Based Approach",
"doi": null,
"abstractUrl": "/journal/tc/2023/03/09774034/1DjDrsbt0yY",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/01/09930647",
"title": "The High Faulty Tolerant Capability of the Alternating Group Graphs",
"doi": null,
"abstractUrl": "/journal/td/2023/01/09930647/1HMP3UkhGus",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09199134",
"title": "Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09199134/1naBq7vTUIw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09210126",
"title": "Truss-Based Structural Diversity Search in Large Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09210126/1nxQ8gROGQ0",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/09/09250607",
"title": "Enumerating Maximum Cliques in Massive Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2022/09/09250607/1oxjS6MBaA8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/01/09420260",
"title": "Age Optimal Information Gathering and Dissemination on Graphs",
"doi": null,
"abstractUrl": "/journal/tm/2023/01/09420260/1tdUGrSPdg4",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09452800",
"title": "Core Decomposition on Uncertain Graphs Revisited",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09452800/1ulCu0Hdqs8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09492838",
"title": "Maximum Signed <inline-formula><tex-math notation=\"LaTeX\">Z_$\\theta$_Z</tex-math></inline-formula>-Clique Identification in Large Signed Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09492838/1vq0EU6lrAA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09525250",
"title": "Fast Reachability Queries Answering Based on <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathsf{RCN}$_Z</tex-math></inline-formula> Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09525250/1wuoOp439OU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09629291",
"title": "Efficient Influential Community Search in Large Uncertain Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09629291/1yXvGVkW7ra",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09645229",
"articleId": "1zc6xbJImXe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09599377",
"articleId": "1yeC7hKnkVq",
"__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": "1DSufQYATSM",
"doi": "10.1109/TAFFC.2022.3179717",
"abstract": "Automatic emotion recognition based on electroencephalogram (EEG) has attracted rapidly increasing interests. Due to large inter-subject variabilities, subject-independent emotion recognition faces great challenges. Recently, domain adaptation methods have been successfully applied in this field due to their ability to align features from different subjects. However, since EEG signals corresponding to some emotions have similar oscillation patterns, they are often confused and aligned to the wrong categories, which limits the generalization ability of the model across subjects. Besides, almost all methods only support offline applications, which require collecting a large number of samples of new subjects. To achieve online recognition, a simpler model is needed. In this paper, a novel Gated Recurrent Unit-Minimum Class Confusion (GRU-MCC) model is proposed. Specifically, a simple feature extractor based on gated recurrent unit (GRU) is firstly applied to model the spatial dependence of multiple electrodes and obtain high-level discriminative features. Then, during training, minimum class confusion (MCC) loss is introduced to reduce the confusion between the correct and ambiguous classes for the target subject and increase the transfer gains. We conduct both offline and online experiments on two public datasets: SEED and MPED. The results indicate that our method can obtain the superior performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Automatic emotion recognition based on electroencephalogram (EEG) has attracted rapidly increasing interests. Due to large inter-subject variabilities, subject-independent emotion recognition faces great challenges. Recently, domain adaptation methods have been successfully applied in this field due to their ability to align features from different subjects. However, since EEG signals corresponding to some emotions have similar oscillation patterns, they are often confused and aligned to the wrong categories, which limits the generalization ability of the model across subjects. Besides, almost all methods only support offline applications, which require collecting a large number of samples of new subjects. To achieve online recognition, a simpler model is needed. In this paper, a novel Gated Recurrent Unit-Minimum Class Confusion (GRU-MCC) model is proposed. Specifically, a simple feature extractor based on gated recurrent unit (GRU) is firstly applied to model the spatial dependence of multiple electrodes and obtain high-level discriminative features. Then, during training, minimum class confusion (MCC) loss is introduced to reduce the confusion between the correct and ambiguous classes for the target subject and increase the transfer gains. We conduct both offline and online experiments on two public datasets: SEED and MPED. The results indicate that our method can obtain the superior performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Automatic emotion recognition based on electroencephalogram (EEG) has attracted rapidly increasing interests. Due to large inter-subject variabilities, subject-independent emotion recognition faces great challenges. Recently, domain adaptation methods have been successfully applied in this field due to their ability to align features from different subjects. However, since EEG signals corresponding to some emotions have similar oscillation patterns, they are often confused and aligned to the wrong categories, which limits the generalization ability of the model across subjects. Besides, almost all methods only support offline applications, which require collecting a large number of samples of new subjects. To achieve online recognition, a simpler model is needed. In this paper, a novel Gated Recurrent Unit-Minimum Class Confusion (GRU-MCC) model is proposed. Specifically, a simple feature extractor based on gated recurrent unit (GRU) is firstly applied to model the spatial dependence of multiple electrodes and obtain high-level discriminative features. Then, during training, minimum class confusion (MCC) loss is introduced to reduce the confusion between the correct and ambiguous classes for the target subject and increase the transfer gains. We conduct both offline and online experiments on two public datasets: SEED and MPED. The results indicate that our method can obtain the superior performance.",
"title": "EEG-Based Subject-Independent Emotion Recognition Using Gated Recurrent Unit and Minimum Class Confusion",
"normalizedTitle": "EEG-Based Subject-Independent Emotion Recognition Using Gated Recurrent Unit and Minimum Class Confusion",
"fno": "09786857",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Emotion Recognition",
"Feature Extraction",
"Brain Modeling",
"Electroencephalography",
"Adaptation Models",
"Training",
"Logic Gates",
"Electroencephalogram EEG",
"Emotion Recognition",
"Subject Independent",
"Gated Recurrent Unit GRU",
"Minimum Class Confusion MCC"
],
"authors": [
{
"givenName": "Heng",
"surname": "Cui",
"fullName": "Heng Cui",
"affiliation": "Department of Neurosurgery, The First Affiliated Hospital of USTC, Division of Life Sciences and Medicine, University of Science and Technology of China, Hefei 230001, China and also with the School of Information Science and Technology, University of Science and Technology of China, Hefei 230027, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aiping",
"surname": "Liu",
"fullName": "Aiping Liu",
"affiliation": "School of Information Science and Technology, University of Science and Technology of China, Hefei 230027, China.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xu",
"surname": "Zhang",
"fullName": "Xu Zhang",
"affiliation": "School of Information Science and Technology, University of Science and Technology of China, Hefei 230027, China.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiang",
"surname": "Chen",
"fullName": "Xiang Chen",
"affiliation": "School of Information Science and Technology, University of Science and Technology of China, Hefei 230027, China.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Liu",
"fullName": "Jun Liu",
"affiliation": "School of Information Science and Technology, University of Science and Technology of China, Hefei 230027, China.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xun",
"surname": "Chen",
"fullName": "Xun Chen",
"affiliation": "Department of Neurosurgery, The First Affiliated Hospital of USTC, Division of Life Sciences and Medicine, University of Science and Technology of China, Hefei 230001, China and also with the USTC IAT-Huami Joint Laboratory for Brain-Machine Intelligence, Institute of Advanced Technology, University of Science and Technology of China, Hefei 230088, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-06-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/icpr/2008/2174/0/04761452",
"title": "Subject-independent brain computer interface through boosting",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761452/12OmNx7ouRt",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msn/2018/0548/0/054800a134",
"title": "Deep Identity Confusion for Automatic Sleep Staging Based on Single-Channel EEG",
"doi": null,
"abstractUrl": "/proceedings-article/msn/2018/054800a134/19m3ph6eUY8",
"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": "trans/tb/2020/05/08686117",
"title": "RNA-Protein Binding Sites Prediction via Multi Scale Convolutional Gated Recurrent Unit Networks",
"doi": null,
"abstractUrl": "/journal/tb/2020/05/08686117/19maYAFykrC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/5555/01/09748967",
"title": "Contrastive Learning of Subject-Invariant EEG Representations for Cross-Subject Emotion Recognition",
"doi": null,
"abstractUrl": "/journal/ta/5555/01/09748967/1CiyVjtBkK4",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/04/09817639",
"title": "Joint Feature Adaptation and Graph Adaptive Label Propagation for Cross-Subject Emotion Recognition From EEG Signals",
"doi": null,
"abstractUrl": "/journal/ta/2022/04/09817639/1EOzSXKSc8g",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2019/2286/0/228600a114",
"title": "Personalized Posture and Fall Classification with Shallow Gated Recurrent Units",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2019/228600a114/1cdO29Wxhw4",
"parentPublication": {
"id": "proceedings/cbms/2019/2286/0",
"title": "2019 IEEE 32nd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09005975",
"title": "Radically Simplifying Gated Recurrent Architectures Without Loss of Performance",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09005975/1hJrVT4w67m",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2020/4199/0/09016439",
"title": "Gated Recurrent Unit Network-based Cellular Trafile Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2020/09016439/1hQqTRKXsmk",
"parentPublication": {
"id": "proceedings/icoin/2020/4199/0",
"title": "2020 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09411994",
"title": "Leveraging Synthetic Subject Invariant EEG Signals for Zero Calibration BCI",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09411994/1tmj1K0yw6s",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdacs/2021/2561/0/256100a031",
"title": "A Stock Price Forecasting Method Using Autoregressive Integrated Moving Average model and Gated Recurrent Unit Network",
"doi": null,
"abstractUrl": "/proceedings-article/bdacs/2021/256100a031/1wiRr6qLetq",
"parentPublication": {
"id": "proceedings/bdacs/2021/2561/0",
"title": "2021 International Conference on Big Data Analysis and Computer Science (BDACS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09787392",
"articleId": "1DSufFOQrTy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09793717",
"articleId": "1E5LtQheIqA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1C0jiNVmIU0",
"title": "April",
"year": "2022",
"issueNum": "02",
"idPrefix": "ai",
"pubType": "journal",
"volume": "3",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1wREiD23EUE",
"doi": "10.1109/TAI.2021.3110935",
"abstract": "In multi-dimensional classification, the semantics of objects are characterized by multiple class variables from different dimensions. To model the dependencies among class variables, one natural strategy is to build a number of multiclass classifiers in a chaining structure, one per dimension, where the subsequent classifiers on the chain augment the feature space with all labeling information used by the preceding classifiers. However, it is shown that this strategy cannot compete with existing state-of-the-art approaches via comparative studies. One possible reason is that inaccurate predictions of preceding classifiers would degenerate the performance of subsequent ones. Besides, it is more difficult to learn a multiclass classifier than a binary one with the same accuracy, and better performance can be expected if the multi-dimensional classification problem can be solved by building multiple binary classifiers in a chaining structure. Based on these conjectures, this article proposes an approach, which builds a chain of binary classifiers to solve the multi-dimensional classification problem with the help of one-versus-one decomposition. To address the issue that different one-versus-one decomposed problems involve different training examples, the feature space is augmented with the binary predictions of preceding classifiers on the chain to train the subsequent ones. To alleviate the effect of the specified chaining order, the ensemble version of the proposed approach is further investigated. Comparative studies over 20 benchmark datasets clearly show the superiority of the proposed approach against the state-of-the-art multi-dimensional classification baselines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In multi-dimensional classification, the semantics of objects are characterized by multiple class variables from different dimensions. To model the dependencies among class variables, one natural strategy is to build a number of multiclass classifiers in a chaining structure, one per dimension, where the subsequent classifiers on the chain augment the feature space with all labeling information used by the preceding classifiers. However, it is shown that this strategy cannot compete with existing state-of-the-art approaches via comparative studies. One possible reason is that inaccurate predictions of preceding classifiers would degenerate the performance of subsequent ones. Besides, it is more difficult to learn a multiclass classifier than a binary one with the same accuracy, and better performance can be expected if the multi-dimensional classification problem can be solved by building multiple binary classifiers in a chaining structure. Based on these conjectures, this article proposes an approach, which builds a chain of binary classifiers to solve the multi-dimensional classification problem with the help of one-versus-one decomposition. To address the issue that different one-versus-one decomposed problems involve different training examples, the feature space is augmented with the binary predictions of preceding classifiers on the chain to train the subsequent ones. To alleviate the effect of the specified chaining order, the ensemble version of the proposed approach is further investigated. Comparative studies over 20 benchmark datasets clearly show the superiority of the proposed approach against the state-of-the-art multi-dimensional classification baselines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In multi-dimensional classification, the semantics of objects are characterized by multiple class variables from different dimensions. To model the dependencies among class variables, one natural strategy is to build a number of multiclass classifiers in a chaining structure, one per dimension, where the subsequent classifiers on the chain augment the feature space with all labeling information used by the preceding classifiers. However, it is shown that this strategy cannot compete with existing state-of-the-art approaches via comparative studies. One possible reason is that inaccurate predictions of preceding classifiers would degenerate the performance of subsequent ones. Besides, it is more difficult to learn a multiclass classifier than a binary one with the same accuracy, and better performance can be expected if the multi-dimensional classification problem can be solved by building multiple binary classifiers in a chaining structure. Based on these conjectures, this article proposes an approach, which builds a chain of binary classifiers to solve the multi-dimensional classification problem with the help of one-versus-one decomposition. To address the issue that different one-versus-one decomposed problems involve different training examples, the feature space is augmented with the binary predictions of preceding classifiers on the chain to train the subsequent ones. To alleviate the effect of the specified chaining order, the ensemble version of the proposed approach is further investigated. Comparative studies over 20 benchmark datasets clearly show the superiority of the proposed approach against the state-of-the-art multi-dimensional classification baselines.",
"title": "Decomposition-Based Classifier Chains for Multi-Dimensional Classification",
"normalizedTitle": "Decomposition-Based Classifier Chains for Multi-Dimensional Classification",
"fno": "09536022",
"hasPdf": true,
"idPrefix": "ai",
"keywords": [
"Learning Artificial Intelligence",
"Pattern Classification",
"Decomposition Based Classifier Chains",
"Multiple Class Variables",
"Natural Strategy",
"Multiclass Classifier",
"Chaining Structure",
"Subsequent Classifiers",
"Feature Space",
"Preceding Classifiers",
"Subsequent Ones",
"Multidimensional Classification Problem",
"Multiple Binary Classifiers",
"Binary Predictions",
"Specified Chaining Order",
"Multidimensional Classification Baselines",
"Training",
"Semantics",
"Buildings",
"Predictive Models",
"Data Models",
"Compounds",
"Space Vehicles",
"Class Dependencies",
"Classifier Chains CC",
"Machine Learning",
"Multi Dimensional Classification MDC"
],
"authors": [
{
"givenName": "Bin-Bin",
"surname": "Jia",
"fullName": "Bin-Bin Jia",
"affiliation": "School of Computer Science and Engineering, Southeast University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min-Ling",
"surname": "Zhang",
"fullName": "Min-Ling Zhang",
"affiliation": "School of Computer Science and Engineering, Southeast University, Nanjing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2022-04-01 00:00:00",
"pubType": "trans",
"pages": "176-191",
"year": "2022",
"issn": "2691-4581",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iri/2016/3207/0/3207a615",
"title": "A Classifier Ensemble Framework for Multimedia Big Data Classification",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2016/3207a615/12OmNAkniW9",
"parentPublication": {
"id": "proceedings/iri/2016/3207/0",
"title": "2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2001/1272/1/127210968",
"title": "Spin Discriminant Analysis (SDA) - Using a One-Dimensional Classifier for High Dimensional Classification Problems",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2001/127210968/12OmNvA1hDo",
"parentPublication": {
"id": "proceedings/cvpr/2001/1272/1",
"title": "Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2005/2278/0/22780034",
"title": "Classifier Fusion Using Shared Sampling Distribution for Boosting",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2005/22780034/12OmNwbukiU",
"parentPublication": {
"id": "proceedings/icdm/2005/2278/0",
"title": "Fifth IEEE International Conference on Data Mining (ICDM'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itcc/2004/2108/1/210810326",
"title": "A Hybrid Classifier Approach for Web Retrieved Documents Classification",
"doi": null,
"abstractUrl": "/proceedings-article/itcc/2004/210810326/12OmNylKB4i",
"parentPublication": {
"id": "proceedings/itcc/2004/2108/2",
"title": "Information Technology: Coding and Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109d328",
"title": "One-Vs-All Training of Prototype Classifier for Pattern Classification and Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109d328/12OmNzAohWN",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2015/7082/0/07177400",
"title": "Group sensitive Classifier Chains for multi-label classification",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2015/07177400/12OmNzYwbXI",
"parentPublication": {
"id": "proceedings/icme/2015/7082/0",
"title": "2015 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2005/2409/0/24090274",
"title": "Modeling, Quantifying, and Testing Complex Aggregate Service Chains",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2005/24090274/12OmNzhnabK",
"parentPublication": {
"id": "proceedings/icws/2005/2409/0",
"title": "IEEE International Conference on Web Services (ICWS'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2013/2972/0/06735287",
"title": "A Genetic Algorithm for Optimizing the Label Ordering in Multi-label Classifier Chains",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2013/06735287/12OmNznkJSX",
"parentPublication": {
"id": "proceedings/ictai/2013/2972/0",
"title": "2013 IEEE 25th International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/11/07106533",
"title": "Joint Binary Classifier Learning for ECOC-Based Multi-Class Classification",
"doi": null,
"abstractUrl": "/journal/tp/2016/11/07106533/13rRUxBa5d9",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09448482",
"title": "A Novel Classifier Ensemble Method Based on Subspace Enhancement for High-Dimensional Data Classification",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09448482/1ugDPKjn6ko",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09592830",
"articleId": "1y5ZoG5vIvS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09556146",
"articleId": "1xlw3z5rIek",
"__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": "1EJBePXOX9C",
"doi": "10.1109/TKDE.2022.3188426",
"abstract": "Network embedding – finding a low dimensional representation of the nodes with attributes in a hierarchical, directed network remains a challenging problem in the machine learning community. An emerging approach is to embed complex networks – networks of real-world systems – into hyperbolic space due to the fact that hyperbolic space can better naturally represent such a network’s hierarchical structure. Existing hyperbolic embedding approaches, however, cannot handle the embedding of attributed directed networks to an arbitrary embedding dimension. To fill this gap, we introduce HEADNet, for Hyperbolic Embedding of Attributed Directed Networks, an algorithm based on extending previous works for embedding directed attributed networks to Gaussian distributions in hyperbolic space of arbitrary dimension. Through experimentation on a variety of both synthetic and real-world networks, we show that HEADNet can achieve competitive performance on common downstream machine learning tasks, including predicting directed links for previously unseen nodes. HEADNet provides an inductive hyperbolic embedding method for directed attributed networks, which opens the door to hyperbolic manifold learning on a wider range of real-world networks. The source code is freely available at <uri>https://github.com/DavidMcDonald1993/HEADNET</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Network embedding – finding a low dimensional representation of the nodes with attributes in a hierarchical, directed network remains a challenging problem in the machine learning community. An emerging approach is to embed complex networks – networks of real-world systems – into hyperbolic space due to the fact that hyperbolic space can better naturally represent such a network’s hierarchical structure. Existing hyperbolic embedding approaches, however, cannot handle the embedding of attributed directed networks to an arbitrary embedding dimension. To fill this gap, we introduce HEADNet, for Hyperbolic Embedding of Attributed Directed Networks, an algorithm based on extending previous works for embedding directed attributed networks to Gaussian distributions in hyperbolic space of arbitrary dimension. Through experimentation on a variety of both synthetic and real-world networks, we show that HEADNet can achieve competitive performance on common downstream machine learning tasks, including predicting directed links for previously unseen nodes. HEADNet provides an inductive hyperbolic embedding method for directed attributed networks, which opens the door to hyperbolic manifold learning on a wider range of real-world networks. The source code is freely available at <uri>https://github.com/DavidMcDonald1993/HEADNET</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Network embedding – finding a low dimensional representation of the nodes with attributes in a hierarchical, directed network remains a challenging problem in the machine learning community. An emerging approach is to embed complex networks – networks of real-world systems – into hyperbolic space due to the fact that hyperbolic space can better naturally represent such a network’s hierarchical structure. Existing hyperbolic embedding approaches, however, cannot handle the embedding of attributed directed networks to an arbitrary embedding dimension. To fill this gap, we introduce HEADNet, for Hyperbolic Embedding of Attributed Directed Networks, an algorithm based on extending previous works for embedding directed attributed networks to Gaussian distributions in hyperbolic space of arbitrary dimension. Through experimentation on a variety of both synthetic and real-world networks, we show that HEADNet can achieve competitive performance on common downstream machine learning tasks, including predicting directed links for previously unseen nodes. HEADNet provides an inductive hyperbolic embedding method for directed attributed networks, which opens the door to hyperbolic manifold learning on a wider range of real-world networks. The source code is freely available at https://github.com/DavidMcDonald1993/HEADNET.",
"title": "Hyperbolic Embedding of Attributed and Directed Networks",
"normalizedTitle": "Hyperbolic Embedding of Attributed and Directed Networks",
"fno": "09815143",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Extraterrestrial Measurements",
"Complex Networks",
"Task Analysis",
"Gaussian Distribution",
"Computational Modeling",
"Uncertainty",
"Neural Networks",
"Attributed Network Embedding",
"Directed Network Embedding",
"Hyperbolic Embedding",
"Complex Networks"
],
"authors": [
{
"givenName": "David",
"surname": "McDonald",
"fullName": "David McDonald",
"affiliation": "AIA Insights Ltd., U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shan",
"surname": "He",
"fullName": "Shan He",
"affiliation": "Department of Computer Science, University of Birmingham, Birmingham, U.K.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-07-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/iscc/2017/1629/0/08024652",
"title": "A path-based recommendations approach for online systems via hyperbolic network embedding",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2017/08024652/12OmNwNeYAD",
"parentPublication": {
"id": "proceedings/iscc/2017/1629/0",
"title": "2017 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2017/3876/0/387601b120",
"title": "Hub-Authority Cores and Attributed Directed Network Mining",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2017/387601b120/12OmNyeECvH",
"parentPublication": {
"id": "proceedings/ictai/2017/3876/0",
"title": "2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tn/2017/03/07891008",
"title": "Hyperbolic Embedding for Efficient Computation of Path Centralities and Adaptive Routing in Large-Scale Complex Commodity Networks",
"doi": null,
"abstractUrl": "/journal/tn/2017/03/07891008/13rRUwI5UgW",
"parentPublication": {
"id": "trans/tn",
"title": "IEEE Transactions on Network Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2008/01/04445694",
"title": "Hyperbolic embedding of Internet graph for distance estimation and overlay construction",
"doi": null,
"abstractUrl": "/journal/nt/2008/01/04445694/13rRUxlgxQs",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2021/2174/0/217400a679",
"title": "A hyperbolic embedding for scale-free networks",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-cbdcom-cyberscitech/2021/217400a679/1BLnGLrfzWg",
"parentPublication": {
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2021/2174/0",
"title": "2021 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"
},
{
"id": "proceedings/pacificvis/2022/2335/0/233500a071",
"title": "Browser-based Hyperbolic Visualization of Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2022/233500a071/1E2wnzT07xm",
"parentPublication": {
"id": "proceedings/pacificvis/2022/2335/0",
"title": "2022 IEEE 15th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a356",
"title": "Nested Hyperbolic Spaces for Dimensionality Reduction and Hyperbolic NN Design",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a356/1H1lATWPXPi",
"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/tk/5555/01/09999499",
"title": "Hyperbolic Temporal Network Embedding",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09999499/1JrMz2WQoO4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2019/5584/0/558400a476",
"title": "The Skeleton of Hyperbolic Graphs for Greedy Navigation",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2019/558400a476/1jdDUpWuvLi",
"parentPublication": {
"id": "proceedings/csci/2019/5584/0",
"title": "2019 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2020/7624/0/762400b365",
"title": "Hyperbolic Trees in Complex Networks",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2020/762400b365/1uGYNxVyfWo",
"parentPublication": {
"id": "proceedings/csci/2020/7624/0",
"title": "2020 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09815145",
"articleId": "1EJBeyi9j4A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09815157",
"articleId": "1EJBf3kXg64",
"__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": "1wB2yxXmZYA",
"doi": "10.1109/TVCG.2021.3109975",
"abstract": "In this article, we develop a novel method for fast geodesic distance queries. The key idea is to embed the mesh into a high-dimensional space, such that the euclidean distance in the high-dimensional space can induce the geodesic distance in the original manifold surface. However, directly solving the high-dimensional embedding problem is not feasible due to the large number of variables and the fact that the embedding problem is highly nonlinear. We overcome the challenges with two novel ideas. First, instead of taking all vertices as variables, we embed only the saddle vertices, which greatly reduces the problem complexity. We then compute a local embedding for each non-saddle vertex. Second, to reduce the large approximation error resulting from the purely euclidean embedding, we propose a cascaded optimization approach that repeatedly introduces additional embedding coordinates with a non-euclidean function to reduce the approximation residual. Using the precomputation data, our approach can determine the geodesic distance between any two vertices in near-constant time. Computational testing results show that our method is more desirable than previous geodesic distance queries methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this article, we develop a novel method for fast geodesic distance queries. The key idea is to embed the mesh into a high-dimensional space, such that the euclidean distance in the high-dimensional space can induce the geodesic distance in the original manifold surface. However, directly solving the high-dimensional embedding problem is not feasible due to the large number of variables and the fact that the embedding problem is highly nonlinear. We overcome the challenges with two novel ideas. First, instead of taking all vertices as variables, we embed only the saddle vertices, which greatly reduces the problem complexity. We then compute a local embedding for each non-saddle vertex. Second, to reduce the large approximation error resulting from the purely euclidean embedding, we propose a cascaded optimization approach that repeatedly introduces additional embedding coordinates with a non-euclidean function to reduce the approximation residual. Using the precomputation data, our approach can determine the geodesic distance between any two vertices in near-constant time. Computational testing results show that our method is more desirable than previous geodesic distance queries methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this article, we develop a novel method for fast geodesic distance queries. The key idea is to embed the mesh into a high-dimensional space, such that the euclidean distance in the high-dimensional space can induce the geodesic distance in the original manifold surface. However, directly solving the high-dimensional embedding problem is not feasible due to the large number of variables and the fact that the embedding problem is highly nonlinear. We overcome the challenges with two novel ideas. First, instead of taking all vertices as variables, we embed only the saddle vertices, which greatly reduces the problem complexity. We then compute a local embedding for each non-saddle vertex. Second, to reduce the large approximation error resulting from the purely euclidean embedding, we propose a cascaded optimization approach that repeatedly introduces additional embedding coordinates with a non-euclidean function to reduce the approximation residual. Using the precomputation data, our approach can determine the geodesic distance between any two vertices in near-constant time. Computational testing results show that our method is more desirable than previous geodesic distance queries methods.",
"title": "GeodesicEmbedding (GE): A High-Dimensional Embedding Approach for Fast Geodesic Distance Queries",
"normalizedTitle": "GeodesicEmbedding (GE): A High-Dimensional Embedding Approach for Fast Geodesic Distance Queries",
"fno": "09528952",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Approximation Theory",
"Computational Geometry",
"Differential Geometry",
"Graph Theory",
"Mesh Generation",
"Optimisation",
"Additional Embedding",
"Cascaded Optimization Approach",
"Euclidean Distance",
"Fast Geodesic Distance Queries",
"High Dimensional Embedding Approach",
"High Dimensional Embedding Problem",
"High Dimensional Space",
"Local Embedding",
"Noneuclidean Function",
"Original Manifold Surface",
"Previous Geodesic Distance",
"Problem Complexity",
"Purely Euclidean Embedding",
"Saddle Vertices",
"Measurement",
"Optimization",
"Relays",
"Geodesy",
"Complexity Theory",
"Germanium",
"Computer Science",
"Geodesic Distance Queries",
"Saddle Vertices",
"High Dimension Embedding",
"Cascaded Optimization"
],
"authors": [
{
"givenName": "Qianwei",
"surname": "Xia",
"fullName": "Qianwei Xia",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juyong",
"surname": "Zhang",
"fullName": "Juyong Zhang",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zheng",
"surname": "Fang",
"fullName": "Zheng Fang",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jin",
"surname": "Li",
"fullName": "Jin Li",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingyue",
"surname": "Zhang",
"fullName": "Mingyue Zhang",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bailin",
"surname": "Deng",
"fullName": "Bailin Deng",
"affiliation": "School of Computer Science and Informatics, Cardiff University, Cardiff, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "He",
"fullName": "Ying He",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4930-4939",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ibica/2011/4606/0/4606a091",
"title": "Detection of Spot from Complex Regions Based on Geodesic Distance",
"doi": null,
"abstractUrl": "/proceedings-article/ibica/2011/4606a091/12OmNAS9zxw",
"parentPublication": {
"id": "proceedings/ibica/2011/4606/0",
"title": "Innovations in Bio-inspired Computing and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icat/2006/2754/0/27540275",
"title": "Interactive Skeleton Extraction Using Geodesic Distance",
"doi": null,
"abstractUrl": "/proceedings-article/icat/2006/27540275/12OmNCgJecr",
"parentPublication": {
"id": "proceedings/icat/2006/2754/0",
"title": "16th International Conference on Artificial Reality and Telexistence--Workshops (ICAT'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2007/1834/0/04458006",
"title": "Estimating geodesic distances on locally linear patches",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2007/04458006/12OmNvA1hiv",
"parentPublication": {
"id": "proceedings/isspit/2007/1834/0",
"title": "2007 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457d624",
"title": "Geodesic Distance Descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457d624/12OmNx38vRo",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2007/3067/0/30670416",
"title": "Facial Shape Spaces from Surface Normals and Geodesic Distance",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2007/30670416/12OmNz4BdhX",
"parentPublication": {
"id": "proceedings/dicta/2007/3067/0",
"title": "9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/05/mcs2012050049",
"title": "Geodesic Distance-Based Realistic Facial Animation Using RBF Interpolation",
"doi": null,
"abstractUrl": "/magazine/cs/2012/05/mcs2012050049/13rRUwhpBRm",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/05/i0827",
"title": "Building k-Connected Neighborhood Graphs for Isometric Data Embedding",
"doi": null,
"abstractUrl": "/journal/tp/2006/05/i0827/13rRUxly8Yy",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/01/08509134",
"title": "Efficient Inter-Geodesic Distance Computation and Fast Classical Scaling",
"doi": null,
"abstractUrl": "/journal/tp/2020/01/08509134/14Fq0W8dzaM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/02/08789398",
"title": "Parallel and Scalable Heat Methods for Geodesic Distance Computation",
"doi": null,
"abstractUrl": "/journal/tp/2021/02/08789398/1ch5I9yJ13G",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2020/9558/0/09172881",
"title": "Unsupervised Euclidean Distance Attack on Network Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2020/09172881/1mtwjX6CN2M",
"parentPublication": {
"id": "proceedings/dsc/2020/9558/0",
"title": "2020 IEEE Fifth International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09528956",
"articleId": "1wB2xUo1WKY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09528986",
"articleId": "1wB2y6gUCqs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvTBB89",
"title": "Feb.",
"year": "2018",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvsX",
"doi": "10.1109/TVCG.2017.2658570",
"abstract": "Virtual Reality (VR) Head-Mounted Displays (HMDs) are on the verge of becoming commodity hardware available to the average user and feasible to use as a tool for 3D work. Some HMDs include front-facing cameras, enabling Augmented Reality (AR) functionality. Apart from avoiding collisions with the environment, interaction with virtual objects may also be affected by seeing the real environment. However, whether these effects are positive or negative has not yet been studied extensively. For most tasks it is unknown whether AR has any advantage over VR. In this work we present the results of a user study in which we compared user performance measured in task completion time on a 9 degrees of freedom object selection and transformation task performed either in AR or VR, both with a 3D input device and a mouse. Our results show faster task completion time in AR over VR. When using a 3D input device, a purely VR environment increased task completion time by 22.5 percent on average compared to AR ( Z_${p}<0.024$_Z ). Surprisingly, a similar effect occurred when using a mouse: users were about 17.3 percent slower in VR than in AR ( Z_${p}<0.04$_Z ). Mouse and 3D input device produced similar task completion times in each condition (AR or VR) respectively. We further found no differences in reported comfort.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Virtual Reality (VR) Head-Mounted Displays (HMDs) are on the verge of becoming commodity hardware available to the average user and feasible to use as a tool for 3D work. Some HMDs include front-facing cameras, enabling Augmented Reality (AR) functionality. Apart from avoiding collisions with the environment, interaction with virtual objects may also be affected by seeing the real environment. However, whether these effects are positive or negative has not yet been studied extensively. For most tasks it is unknown whether AR has any advantage over VR. In this work we present the results of a user study in which we compared user performance measured in task completion time on a 9 degrees of freedom object selection and transformation task performed either in AR or VR, both with a 3D input device and a mouse. Our results show faster task completion time in AR over VR. When using a 3D input device, a purely VR environment increased task completion time by 22.5 percent on average compared to AR ( ${p}<0.024$ ). Surprisingly, a similar effect occurred when using a mouse: users were about 17.3 percent slower in VR than in AR ( ${p}<0.04$ ). Mouse and 3D input device produced similar task completion times in each condition (AR or VR) respectively. We further found no differences in reported comfort.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Virtual Reality (VR) Head-Mounted Displays (HMDs) are on the verge of becoming commodity hardware available to the average user and feasible to use as a tool for 3D work. Some HMDs include front-facing cameras, enabling Augmented Reality (AR) functionality. Apart from avoiding collisions with the environment, interaction with virtual objects may also be affected by seeing the real environment. However, whether these effects are positive or negative has not yet been studied extensively. For most tasks it is unknown whether AR has any advantage over VR. In this work we present the results of a user study in which we compared user performance measured in task completion time on a 9 degrees of freedom object selection and transformation task performed either in AR or VR, both with a 3D input device and a mouse. Our results show faster task completion time in AR over VR. When using a 3D input device, a purely VR environment increased task completion time by 22.5 percent on average compared to AR ( - ). Surprisingly, a similar effect occurred when using a mouse: users were about 17.3 percent slower in VR than in AR ( - ). Mouse and 3D input device produced similar task completion times in each condition (AR or VR) respectively. We further found no differences in reported comfort.",
"title": "Augmented Reality versus Virtual Reality for 3D Object Manipulation",
"normalizedTitle": "Augmented Reality versus Virtual Reality for 3D Object Manipulation",
"fno": "07833028",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Performance Evaluation",
"Mice",
"Resists",
"Visualization",
"Training",
"Augmented Reality",
"Artificial",
"Augmented",
"And Virtual Realities Multimedia Information Systems Information Interfaces And Representation",
"Interaction Techniques Methodology And Techniques Computer Graphics"
],
"authors": [
{
"givenName": "Max",
"surname": "Krichenbauer",
"fullName": "Max Krichenbauer",
"affiliation": "Department of Information Science, Nara Sentan Kagaku Gijutsu Daigakuin Daigaku, Ikoma, Nara, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Goshiro",
"surname": "Yamamoto",
"fullName": "Goshiro Yamamoto",
"affiliation": "Department of Interactive Media Design Laboratory, Nara Institute of Science and Technology, Ikoma, Nara, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Takafumi",
"surname": "Taketom",
"fullName": "Takafumi Taketom",
"affiliation": "Department of Interactive Media Design Laboratory, Nara Institute of Science and Technology, Ikoma, Nara, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Sandor",
"fullName": "Christian Sandor",
"affiliation": "Department of Interactive Media Design Laboratory, Nara Institute of Science and Technology, Ikoma, Nara, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hirokazu",
"surname": "Kato",
"fullName": "Hirokazu Kato",
"affiliation": "Graduate School of Information Science, NAIST, Ikoma, Nara, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2018-02-01 00:00:00",
"pubType": "trans",
"pages": "1038-1048",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/1999/0210/0/02100032",
"title": "Virtual Reality and Augmented Reality as a Training Tool for Assembly Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/iv/1999/02100032/12OmNAObbyR",
"parentPublication": {
"id": "proceedings/iv/1999/0210/0",
"title": "1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmu/2017/31/0/08330112",
"title": "Clash tanks: An investigation of virtual and augmented reality gaming experience",
"doi": null,
"abstractUrl": "/proceedings-article/icmu/2017/08330112/12OmNB8TU7d",
"parentPublication": {
"id": "proceedings/icmu/2017/31/0",
"title": "2017 Tenth International Conference on Mobile Computing and Ubiquitous Network (ICMU)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismarw/2016/3740/0/07836495",
"title": "Evaluating Positional Head-Tracking in Immersive VR for 3D Designers",
"doi": null,
"abstractUrl": "/proceedings-article/ismarw/2016/07836495/12OmNx4Q6Cm",
"parentPublication": {
"id": "proceedings/ismarw/2016/3740/0",
"title": "2016 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2016/0836/0/07504692",
"title": "Evaluating wide-field-of-view augmented reality with mixed reality simulation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504692/12OmNzRZpYz",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08447561",
"title": "Transferability of Spatial Maps: Augmented Versus Virtual Reality Training",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08447561/13bd1fKQxs5",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/07/07935524",
"title": "Handheld Guides in Inspection Tasks: Augmented Reality versus Picture",
"doi": null,
"abstractUrl": "/journal/tg/2018/07/07935524/13rRUwIF6lc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/11/08007246",
"title": "AR Feels “Softer” than VR: Haptic Perception of Stiffness in Augmented versus Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2017/11/08007246/13rRUwh80Hj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2022/1316/0/131600b552",
"title": "SoK: Authentication in Augmented and Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2022/131600b552/1FlQIjcP4FW",
"parentPublication": {
"id": "proceedings/sp/2022/1316/0/",
"title": "2022 IEEE Symposium on Security and Privacy (SP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798174",
"title": "Comparison in Depth Perception between Virtual Reality and Augmented Reality Systems",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798174/1cJ11OY78k0",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2020/7675/0/767500a203",
"title": "Industrial Augmented Reality: 3D-Content Editor for Augmented Reality Maintenance Worker Support System",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2020/767500a203/1pBMigKK7F6",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2020/7675/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08241922",
"articleId": "13rRUwfZBVr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07831370",
"articleId": "13rRUxNEqQ1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1HGJ6XQen96",
"title": "Nov.",
"year": "2022",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GjwLnkmt8I",
"doi": "10.1109/TVCG.2022.3203111",
"abstract": "When a user is performing a manual task, AR or VR can provide information about the current subtask (cueing) and upcoming subtasks (precueing) that makes them easier and faster to complete. Previous research on cueing and precueing in AR and VR has focused on path-following tasks requiring simple actions at each of a series of locations, such as pushing a button or just visiting. We consider a more complex task, whose subtasks involve moving to and picking up an item, moving that item to a designated place while rotating it to a specific angle, and depositing it. We conducted two user studies to examine how people accomplish this task while wearing an AR headset, guided by different visualizations that cue and precue movement and rotation. Participants performed best when given movement information for two successive subtasks and rotation information for a single subtask. In addition, participants performed best when the rotation visualization was split across the manipulated object and its destination.",
"abstracts": [
{
"abstractType": "Regular",
"content": "When a user is performing a manual task, AR or VR can provide information about the current subtask (cueing) and upcoming subtasks (precueing) that makes them easier and faster to complete. Previous research on cueing and precueing in AR and VR has focused on path-following tasks requiring simple actions at each of a series of locations, such as pushing a button or just visiting. We consider a more complex task, whose subtasks involve moving to and picking up an item, moving that item to a designated place while rotating it to a specific angle, and depositing it. We conducted two user studies to examine how people accomplish this task while wearing an AR headset, guided by different visualizations that cue and precue movement and rotation. Participants performed best when given movement information for two successive subtasks and rotation information for a single subtask. In addition, participants performed best when the rotation visualization was split across the manipulated object and its destination.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "When a user is performing a manual task, AR or VR can provide information about the current subtask (cueing) and upcoming subtasks (precueing) that makes them easier and faster to complete. Previous research on cueing and precueing in AR and VR has focused on path-following tasks requiring simple actions at each of a series of locations, such as pushing a button or just visiting. We consider a more complex task, whose subtasks involve moving to and picking up an item, moving that item to a designated place while rotating it to a specific angle, and depositing it. We conducted two user studies to examine how people accomplish this task while wearing an AR headset, guided by different visualizations that cue and precue movement and rotation. Participants performed best when given movement information for two successive subtasks and rotation information for a single subtask. In addition, participants performed best when the rotation visualization was split across the manipulated object and its destination.",
"title": "Precueing Object Placement and Orientation for Manual Tasks in Augmented Reality",
"normalizedTitle": "Precueing Object Placement and Orientation for Manual Tasks in Augmented Reality",
"fno": "09874255",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"User Interfaces",
"AR",
"Augmented Reality",
"Manipulated Object",
"Precue Movement",
"Precueing Object Placement",
"Rotation Information",
"Rotation Visualization",
"VR",
"Task Analysis",
"Visualization",
"Copper",
"Training",
"Manuals",
"Computer Science",
"Collaboration",
"Augmented Reality",
"Precueing",
"Cueing",
"Manual Tasks"
],
"authors": [
{
"givenName": "Jen-Shuo",
"surname": "Liu",
"fullName": "Jen-Shuo Liu",
"affiliation": "Department of Computer Science, Columbia University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Barbara",
"surname": "Tversky",
"fullName": "Barbara Tversky",
"affiliation": "Department of Human Development, Teachers College, Columbia University, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Feiner",
"fullName": "Steven Feiner",
"affiliation": "Department of Computer Science, Columbia University, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "3799-3809",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/rtoss/1994/5710/0/00292568",
"title": "An end-to-end approach to schedule tasks with shared resources in multiprocessor systems",
"doi": null,
"abstractUrl": "/proceedings-article/rtoss/1994/00292568/12OmNBubOVB",
"parentPublication": {
"id": "proceedings/rtoss/1994/5710/0",
"title": "Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/07/07935524",
"title": "Handheld Guides in Inspection Tasks: Augmented Reality versus Picture",
"doi": null,
"abstractUrl": "/journal/tg/2018/07/07935524/13rRUwIF6lc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sec/2018/9445/0/944500a354",
"title": "A Heuristic Algorithm Based on Resource Requirements Forecasting for Server Placement in Edge Computing",
"doi": null,
"abstractUrl": "/proceedings-article/sec/2018/944500a354/17D45WZZ7BS",
"parentPublication": {
"id": "proceedings/sec/2018/9445/0",
"title": "2018 IEEE/ACM Symposium on Edge Computing (SEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a540",
"title": "A Testbed for Exploring Multi-Level Precueing in Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a540/1CJe0tUBKU0",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a950",
"title": "Collaborative manual tasks in distributed virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a950/1J7Wic8zpC0",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2022/5365/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a483",
"title": "Press the red button: A user study comparing notification placement with augmented and non-augmented tasks in AR",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a483/1J7WoEKP7vq",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2022/5365/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2018/0604/0/060400a150",
"title": "Augmented Reality Owner Manual Evaluation by NASA TLX Method",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2018/060400a150/1cJ7y1sjSBG",
"parentPublication": {
"id": "proceedings/svr/2018/0604/0",
"title": "2018 20th Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2020/04/08859329",
"title": "Resource-Constrained Replication Strategies for Hierarchical and Heterogeneous Tasks",
"doi": null,
"abstractUrl": "/journal/td/2020/04/08859329/1dR0W2D7MIw",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2020/9231/0/923100a179",
"title": "Augmented Reality for Manual Assembly in Industry 4.0: Gathering Guidelines",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2020/923100a179/1oZBDyQMM6c",
"parentPublication": {
"id": "proceedings/svr/2020/9231/0",
"title": "2020 22nd Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2020/9231/0/923100a189",
"title": "Manual PCB assembly using Augmented Reality towards Total Quality",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2020/923100a189/1oZBzP5SgGk",
"parentPublication": {
"id": "proceedings/svr/2020/9231/0",
"title": "2020 22nd Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09874390",
"articleId": "1GjwKHZsfIc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09872089",
"articleId": "1GhRVcef9xS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HOtmfXNjig",
"name": "ttg202211-09874255s1-tvcg-3203111-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202211-09874255s1-tvcg-3203111-mm.zip",
"extension": "zip",
"size": "43.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx4gUpX",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "td",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1LUpIEoEkgg",
"doi": "10.1109/TPDS.2023.3263124",
"abstract": "Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM<sc>c</sc>) in general sparse tensors, the <underline>S</underline>parse <underline>S</underline>ymmetric <underline>T</underline>ensor <underline>T</underline>imes <underline>S</underline>ame <underline>M</underline>atrix <underline>c</underline>hain (S <inline-formula><tex-math notation=\"LaTeX\">Z_$^{3}$_Z</tex-math></inline-formula> TTM<sc>c</sc>) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S <inline-formula><tex-math notation=\"LaTeX\">Z_$^{3}$_Z</tex-math></inline-formula> TTM<sc>c</sc> operation. We theoretically establish that S <inline-formula><tex-math notation=\"LaTeX\">Z_$^{3}$_Z</tex-math></inline-formula> TTM<sc>c</sc> on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to <inline-formula><tex-math notation=\"LaTeX\">Z_$2.72 \\times$_Z</tex-math></inline-formula> speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM<sc>c</sc>) in general sparse tensors, the <underline>S</underline>parse <underline>S</underline>ymmetric <underline>T</underline>ensor <underline>T</underline>imes <underline>S</underline>ame <underline>M</underline>atrix <underline>c</underline>hain (S <inline-formula><tex-math notation=\"LaTeX\">$^{3}$</tex-math></inline-formula> TTM<sc>c</sc>) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S <inline-formula><tex-math notation=\"LaTeX\">$^{3}$</tex-math></inline-formula> TTM<sc>c</sc> operation. We theoretically establish that S <inline-formula><tex-math notation=\"LaTeX\">$^{3}$</tex-math></inline-formula> TTM<sc>c</sc> on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to <inline-formula><tex-math notation=\"LaTeX\">$2.72 \\times$</tex-math></inline-formula> speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S - TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S - TTMc operation. We theoretically establish that S - TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to - speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.",
"title": "Sparse Symmetric Format for Tucker Decomposition",
"normalizedTitle": "Sparse Symmetric Format for Tucker Decomposition",
"fno": "10086668",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Tensors",
"Symmetric Matrices",
"Sparse Matrices",
"Indexes",
"Signal Processing Algorithms",
"Matrix Decomposition",
"Parallel Algorithms",
"Compressed Storage",
"Sparse Tensors",
"Symmetric Tensors",
"Tensor Times Matrix Chain"
],
"authors": [
{
"givenName": "Shruti",
"surname": "Shivakumar",
"fullName": "Shruti Shivakumar",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiajia",
"surname": "Li",
"fullName": "Jiajia Li",
"affiliation": "North Carolina State University, Raleigh, NC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ramakrishnan",
"surname": "Kannan",
"fullName": "Ramakrishnan Kannan",
"affiliation": "Oak Ridge National Laboratory, Oak Ridge, TN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Srinivas",
"surname": "Aluru",
"fullName": "Srinivas Aluru",
"affiliation": "Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2019/05/08344546",
"title": "What Makes Objects Similar: A Unified Multi-Metric Learning Approach",
"doi": null,
"abstractUrl": "/journal/tp/2019/05/08344546/13rRUNvgyXK",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/11/09618826",
"title": "Scalable Unsupervised ML: Latency Hiding in Distributed Sparse Tensor Decomposition",
"doi": null,
"abstractUrl": "/journal/td/2022/11/09618826/1DFdf7P69iw",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09787804",
"title": "VCSR: An Efficient GPU Memory-Aware Sparse Format",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09787804/1DUa58audEI",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09893402",
"title": "Structured Sparse Non-negative Matrix Factorization with <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09893402/1GGLdY0vH0c",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/12/09913653",
"title": "Algorithm and Hardware Co-Design of Energy-Efficient LSTM Networks for Video Recognition With Hierarchical Tucker Tensor Decomposition",
"doi": null,
"abstractUrl": "/journal/tc/2022/12/09913653/1HmgfOUW9vG",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09996133",
"title": "A Framework for Accurate Community Detection on Signed Networks Using Adversarial Learning",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09996133/1JilSN4zm2A",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10091452",
"title": "Sparse Quadratic Approximation for Graph Learning",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10091452/1M2IHz1BulG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/07/09353224",
"title": "What and How: Generalized Lifelong Spectral Clustering via Dual Memory",
"doi": null,
"abstractUrl": "/journal/tp/2022/07/09353224/1r8knzBTSWA",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09463735",
"title": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09463735/1uFxm1okYhO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/04/09459541",
"title": "<sc>gSoFa</sc>: Scalable Sparse Symbolic LU Factorization on GPUs",
"doi": null,
"abstractUrl": "/journal/td/2022/04/09459541/1uvA0zwhJKg",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10083229",
"articleId": "1LSKEWBg1uE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10086665",
"articleId": "1LUpIKQjxp6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Fz3ebZZCbS",
"title": "Sept.",
"year": "2022",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1strfOg4pIk",
"doi": "10.1109/TPAMI.2021.3070599",
"abstract": "Graph representation and learning is a fundamental problem in machine learning area. Graph Convolutional Networks (GCNs) have been recently studied and demonstrated very powerful for graph representation and learning. Graph convolution (GC) operation in GCNs can be regarded as a composition of feature aggregation and nonlinear transformation step. Existing GCs generally conduct feature aggregation on a full neighborhood set in which each node computes its representation by aggregating the feature information of all its neighbors. However, this full aggregation strategy is not guaranteed to be optimal for GCN learning and also can be affected by some graph structure noises, such as incorrect or undesired edge connections. To address these issues, we propose to integrate <italic>elastic net based selection</italic> into graph convolution and propose a novel <italic>graph elastic convolution</italic> (GeC) operation. In GeC, each node can adaptively select the optimal neighbors in its feature aggregation. The key aspect of the proposed GeC operation is that it can be formulated by a regularization framework, based on which we can derive a simple update rule to implement GeC in a self-supervised manner. Using GeC, we then present a novel GeCN for graph learning. Experimental results demonstrate the effectiveness and robustness of GeCN.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graph representation and learning is a fundamental problem in machine learning area. Graph Convolutional Networks (GCNs) have been recently studied and demonstrated very powerful for graph representation and learning. Graph convolution (GC) operation in GCNs can be regarded as a composition of feature aggregation and nonlinear transformation step. Existing GCs generally conduct feature aggregation on a full neighborhood set in which each node computes its representation by aggregating the feature information of all its neighbors. However, this full aggregation strategy is not guaranteed to be optimal for GCN learning and also can be affected by some graph structure noises, such as incorrect or undesired edge connections. To address these issues, we propose to integrate <italic>elastic net based selection</italic> into graph convolution and propose a novel <italic>graph elastic convolution</italic> (GeC) operation. In GeC, each node can adaptively select the optimal neighbors in its feature aggregation. The key aspect of the proposed GeC operation is that it can be formulated by a regularization framework, based on which we can derive a simple update rule to implement GeC in a self-supervised manner. Using GeC, we then present a novel GeCN for graph learning. Experimental results demonstrate the effectiveness and robustness of GeCN.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graph representation and learning is a fundamental problem in machine learning area. Graph Convolutional Networks (GCNs) have been recently studied and demonstrated very powerful for graph representation and learning. Graph convolution (GC) operation in GCNs can be regarded as a composition of feature aggregation and nonlinear transformation step. Existing GCs generally conduct feature aggregation on a full neighborhood set in which each node computes its representation by aggregating the feature information of all its neighbors. However, this full aggregation strategy is not guaranteed to be optimal for GCN learning and also can be affected by some graph structure noises, such as incorrect or undesired edge connections. To address these issues, we propose to integrate elastic net based selection into graph convolution and propose a novel graph elastic convolution (GeC) operation. In GeC, each node can adaptively select the optimal neighbors in its feature aggregation. The key aspect of the proposed GeC operation is that it can be formulated by a regularization framework, based on which we can derive a simple update rule to implement GeC in a self-supervised manner. Using GeC, we then present a novel GeCN for graph learning. Experimental results demonstrate the effectiveness and robustness of GeCN.",
"title": "GeCNs: Graph Elastic Convolutional Networks for Data Representation",
"normalizedTitle": "GeCNs: Graph Elastic Convolutional Networks for Data Representation",
"fno": "09394783",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Convolutional Neural Nets",
"Data Handling",
"Data Structures",
"Graph Theory",
"Supervised Learning",
"Nonlinear Transformation Step",
"Feature Aggregation",
"Feature Information",
"Aggregation Strategy",
"GCN Learning",
"Graph Structure Noises",
"Elastic Net Based Selection",
"Ge C Operation",
"Graph Learning",
"Data Representation",
"Graph Representation",
"Fundamental Problem",
"Machine Learning Area",
"Graph Convolutional Networks",
"GCN",
"Graph Convolution Operation",
"Graph Elastic Convolutional Networks",
"Graph Elastic Convolution Operation",
"Convolution",
"Task Analysis",
"Optimization",
"Supervised Learning",
"Machine Learning",
"Training",
"Sparse Matrices",
"Graph Convolutional Networks",
"Elastic Net",
"Semi Supervised Classification",
"Graph Representation"
],
"authors": [
{
"givenName": "Bo",
"surname": "Jiang",
"fullName": "Bo Jiang",
"affiliation": "Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, School of Computer Science and Technology, Anhui University, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Beibei",
"surname": "Wang",
"fullName": "Beibei Wang",
"affiliation": "Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, School of Computer Science and Technology, Anhui University, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jin",
"surname": "Tang",
"fullName": "Jin Tang",
"affiliation": "Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, School of Computer Science and Technology, Anhui University, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bin",
"surname": "Luo",
"fullName": "Bin Luo",
"affiliation": "Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, School of Computer Science and Technology, Anhui University, Hefei, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "4935-4947",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cisai/2021/0692/0/069200a190",
"title": "Gait-based Emotion Recognition Using Spatial Temporal Graph Convolutional Networks",
"doi": null,
"abstractUrl": "/proceedings-article/cisai/2021/069200a190/1BmOq65WI8w",
"parentPublication": {
"id": "proceedings/cisai/2021/0692/0",
"title": "2021 International Conference on Computer Information Science and Artificial Intelligence (CISAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/02/09763421",
"title": "Differentiable Graph Module (DGM) for Graph Convolutional Networks",
"doi": null,
"abstractUrl": "/journal/tp/2023/02/09763421/1CT4TAOdeV2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/03/09796468",
"title": "Are Graph Convolutional Networks With Random Weights Feasible?",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09796468/1EexiN6tWYU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/5555/01/10070790",
"title": "Accelerating Graph Convolutional Networks Through a PIM-Accelerated Approach",
"doi": null,
"abstractUrl": "/journal/tc/5555/01/10070790/1LxaXpyj7Ik",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2022/9744/0/974400a334",
"title": "Event Detection with Cross-Sentence Graph Convolutional Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2022/974400a334/1MrFQpSVeAo",
"parentPublication": {
"id": "proceedings/ictai/2022/9744/0",
"title": "2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/02/09211767",
"title": "Learnable Pooling in Graph Convolutional Networks for Brain Surface Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2022/02/09211767/1nB9SOc7u9i",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/06/09224195",
"title": "Co-Embedding of Nodes and Edges With Graph Neural Networks",
"doi": null,
"abstractUrl": "/journal/tp/2023/06/09224195/1nV4WVB9ihO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412311",
"title": "Kernel-based Graph Convolutional Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412311/1tmiDAwhP68",
"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/450900a154",
"title": "A Hyperbolic-to-Hyperbolic Graph Convolutional Network",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900a154/1yeJgfbgw6Y",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/04/09647902",
"title": "CatGCN: Graph Convolutional Networks With Categorical Node Features",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09647902/1ziK3TJGARW",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09420291",
"articleId": "1tdUFbKjgiY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09432709",
"articleId": "1tG8cAP2vZu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1JIolK2elDa",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tm",
"pubType": "journal",
"volume": "22",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1u8ly4Dd5qo",
"doi": "10.1109/TMC.2021.3086143",
"abstract": "Many mobile systems run on ARM-based devices today. People use these for increasingly diverse yet security-sensitive applications. ARM has adopted a security model to tackle this threat, where they manage private information in an isolated <italic>trusted execution environment</italic> (TEE) provided by <italic>TrustZone</italic>. This TrustZone-based model has been proven effective, but due to security concerns, it is available solely for the vendor's applications, thereby hindering the broad use of TrustZone. Consequently, we propose a runtime framework backed by TrustZone to construct a secondary TEE. <sc>Ambassy</sc> has its residence built on an on-chip field-programmable gate array (FPGA), which is a standard component in an <italic>ARM/FPGA hybrid</italic> system readily available on the market today. This study, to the best of our knowledge, is the first attempt to broaden the use of TrustZone by using an FPGA to build a secondary TEE for arbitrary third-parties, which otherwise should be expelled to the Normal World. This paper describes many design challenges that we have overcome to fully implement <sc>Ambassy</sc> on an FPGA. Our experiments demonstrate the practicality of <sc>Ambassy</sc> by presenting the security analysis and performance results of third-party application samples. The samples all run safely on <sc>Ambassy</sc>, with shorter execution times than regular TEE applications in TrustZone (by a factor of 5.5–52).",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many mobile systems run on ARM-based devices today. People use these for increasingly diverse yet security-sensitive applications. ARM has adopted a security model to tackle this threat, where they manage private information in an isolated <italic>trusted execution environment</italic> (TEE) provided by <italic>TrustZone</italic>. This TrustZone-based model has been proven effective, but due to security concerns, it is available solely for the vendor's applications, thereby hindering the broad use of TrustZone. Consequently, we propose a runtime framework backed by TrustZone to construct a secondary TEE. <sc>Ambassy</sc> has its residence built on an on-chip field-programmable gate array (FPGA), which is a standard component in an <italic>ARM/FPGA hybrid</italic> system readily available on the market today. This study, to the best of our knowledge, is the first attempt to broaden the use of TrustZone by using an FPGA to build a secondary TEE for arbitrary third-parties, which otherwise should be expelled to the Normal World. This paper describes many design challenges that we have overcome to fully implement <sc>Ambassy</sc> on an FPGA. Our experiments demonstrate the practicality of <sc>Ambassy</sc> by presenting the security analysis and performance results of third-party application samples. The samples all run safely on <sc>Ambassy</sc>, with shorter execution times than regular TEE applications in TrustZone (by a factor of 5.5–52).",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many mobile systems run on ARM-based devices today. People use these for increasingly diverse yet security-sensitive applications. ARM has adopted a security model to tackle this threat, where they manage private information in an isolated trusted execution environment (TEE) provided by TrustZone. This TrustZone-based model has been proven effective, but due to security concerns, it is available solely for the vendor's applications, thereby hindering the broad use of TrustZone. Consequently, we propose a runtime framework backed by TrustZone to construct a secondary TEE. Ambassy has its residence built on an on-chip field-programmable gate array (FPGA), which is a standard component in an ARM/FPGA hybrid system readily available on the market today. This study, to the best of our knowledge, is the first attempt to broaden the use of TrustZone by using an FPGA to build a secondary TEE for arbitrary third-parties, which otherwise should be expelled to the Normal World. This paper describes many design challenges that we have overcome to fully implement Ambassy on an FPGA. Our experiments demonstrate the practicality of Ambassy by presenting the security analysis and performance results of third-party application samples. The samples all run safely on Ambassy, with shorter execution times than regular TEE applications in TrustZone (by a factor of 5.5–52).",
"title": "Ambassy: A Runtime Framework to Delegate Trusted Applications in an ARM/FPGA Hybrid System",
"normalizedTitle": "Ambassy: A Runtime Framework to Delegate Trusted Applications in an ARM/FPGA Hybrid System",
"fno": "09446637",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Field Programmable Gate Arrays",
"Mobile Computing",
"Operating Systems Computers",
"Trusted Computing",
"Ambassy",
"ARM Based Devices Today",
"Delegate Trusted Applications",
"FPGA",
"Isolated Trusted Execution Environment",
"Mobile Systems",
"On Chip Field Programmable Gate Array",
"Private Information",
"Regular TEE Applications",
"Runtime Framework",
"Security Analysis",
"Security Concerns",
"Security Model",
"Security Sensitive Applications",
"Shorter Execution Times",
"Standard Component",
"Third Party Application Samples",
"Trust Zone Based Model",
"Security",
"Field Programmable Gate Arrays",
"Software",
"Mobile Computing",
"Hardware",
"System On Chip",
"Task Analysis"
],
"authors": [
{
"givenName": "Dongil",
"surname": "Hwang",
"fullName": "Dongil Hwang",
"affiliation": "Department of Electrical and Computer Engineering (ECE), Inter-University Semiconductor Research Center (ISRC), Seoul National University, Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sanzhar",
"surname": "Yeleuov",
"fullName": "Sanzhar Yeleuov",
"affiliation": "School of Electrical and Computer Engineering, UNIST, Ulsan, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiwon",
"surname": "Seo",
"fullName": "Jiwon Seo",
"affiliation": "Department of Electrical and Computer Engineering (ECE), Inter-University Semiconductor Research Center (ISRC), Seoul National University, Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minu",
"surname": "Chung",
"fullName": "Minu Chung",
"affiliation": "School of Electrical and Computer Engineering, UNIST, Ulsan, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hyungon",
"surname": "Moon",
"fullName": "Hyungon Moon",
"affiliation": "School of Electrical and Computer Engineering, UNIST, Ulsan, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yunheung",
"surname": "Paek",
"fullName": "Yunheung Paek",
"affiliation": "Department of Electrical and Computer Engineering (ECE), Inter-University Semiconductor Research Center (ISRC), Seoul National University, Seoul, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "708-719",
"year": "2023",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dsd/2015/8035/0/8035a263",
"title": "Parameterizable Ethernet Network-on-Chip Architecture on FPGA",
"doi": null,
"abstractUrl": "/proceedings-article/dsd/2015/8035a263/12OmNBgQFRh",
"parentPublication": {
"id": "proceedings/dsd/2015/8035/0",
"title": "2015 Euromicro Conference on Digital System Design (DSD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2013/2809/0/2809a193",
"title": "Formal Analysis of Trusted FPGA Firmware",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2013/2809a193/12OmNCcKQC2",
"parentPublication": {
"id": "proceedings/icinis/2013/2809/0",
"title": "2013 6th International Conference on Intelligent Networks and Intelligent Systems (ICINIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsid/2010/4076/0/4076a477",
"title": "FPGA-Based Runtime Adaptive Multiprocessor Approach for Embedded High Performance Computing Applications",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsid/2010/4076a477/12OmNwfsI4D",
"parentPublication": {
"id": "proceedings/isvlsid/2010/4076/0",
"title": "2010 IEEE Computer Society Annual Symposium on VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/host/2015/7421/0/07140235",
"title": "FPGA SoC architecture and runtime to prevent hardware Trojans from leaking secrets",
"doi": null,
"abstractUrl": "/proceedings-article/host/2015/07140235/12OmNwogh3b",
"parentPublication": {
"id": "proceedings/host/2015/7421/0",
"title": "2015 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/reconfig/2009/3917/0/3917a374",
"title": "Runtime Temporal Partitioning Assembly to Reduce FPGA Reconfiguration Time",
"doi": null,
"abstractUrl": "/proceedings-article/reconfig/2009/3917a374/12OmNy50g2B",
"parentPublication": {
"id": "proceedings/reconfig/2009/3917/0",
"title": "Reconfigurable Computing and FPGAs, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2010/4108/0/4108a062",
"title": "Homogeneous NoC-based FPGA: The Foundation for Virtual FPGA",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2010/4108a062/12OmNzxgHFn",
"parentPublication": {
"id": "proceedings/cit/2010/4108/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/mc/2018/04/08573843",
"title": "Scalable FPGA Accelerator for Deep Convolutional Neural Networks with Stochastic Streaming",
"doi": null,
"abstractUrl": "/journal/mc/2018/04/08573843/17D45XH89oo",
"parentPublication": {
"id": "trans/mc",
"title": "IEEE Transactions on Multi-Scale Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2019/08/08643768",
"title": "The Security of ARM TrustZone in a FPGA-Based SoC",
"doi": null,
"abstractUrl": "/journal/tc/2019/08/08643768/17PYEmo8Wn8",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/h2rc/2019/5999/0/599900a019",
"title": "Accelerating Large Garbled Circuits on an FPGA-enabled Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/h2rc/2019/599900a019/1gjRFeNwG9q",
"parentPublication": {
"id": "proceedings/h2rc/2019/5999/0",
"title": "2019 IEEE/ACM International Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/02/09340405",
"title": "<sc>Colony</sc>: A Privileged Trusted Execution Environment With Extensibility",
"doi": null,
"abstractUrl": "/journal/tc/2022/02/09340405/1qMKs2ArdaU",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09476997",
"articleId": "1v2M5wHxRGo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09444881",
"articleId": "1u51wN5TECQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyq0zFH",
"title": "Sept.",
"year": "2019",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "41",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7as",
"doi": "10.1109/TPAMI.2018.2858795",
"abstract": "Repeated patterns (such as windows, balconies, and doors) are prominent and significant features in urban scenes. Therefore, detection of these repeated patterns becomes very important for city scene analysis. This paper attacks the problem of repeated pattern detection in a precise, efficient and automatic way, by combining traditional feature extraction with a Kronecker product based low-rank model. We introduced novel algorithms that extract repeated patterns from rectified images with solid theoretical support. Our method is tailored for 2D images of building façades and tested on a large set of façade images.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Repeated patterns (such as windows, balconies, and doors) are prominent and significant features in urban scenes. Therefore, detection of these repeated patterns becomes very important for city scene analysis. This paper attacks the problem of repeated pattern detection in a precise, efficient and automatic way, by combining traditional feature extraction with a Kronecker product based low-rank model. We introduced novel algorithms that extract repeated patterns from rectified images with solid theoretical support. Our method is tailored for 2D images of building façades and tested on a large set of façade images.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Repeated patterns (such as windows, balconies, and doors) are prominent and significant features in urban scenes. Therefore, detection of these repeated patterns becomes very important for city scene analysis. This paper attacks the problem of repeated pattern detection in a precise, efficient and automatic way, by combining traditional feature extraction with a Kronecker product based low-rank model. We introduced novel algorithms that extract repeated patterns from rectified images with solid theoretical support. Our method is tailored for 2D images of building façades and tested on a large set of façade images.",
"title": "A Kronecker Product Model for Repeated Pattern Detection on 2D Urban Images",
"normalizedTitle": "A Kronecker Product Model for Repeated Pattern Detection on 2D Urban Images",
"fno": "08417901",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Feature Extraction",
"Image Texture",
"Object Detection",
"Kronecker Product Model",
"Repeated Pattern Detection",
"2 D Urban Images",
"Urban Scenes",
"City Scene Analysis",
"Traditional Feature Extraction",
"Low Rank Model",
"Solid Theoretical Support",
"Cost Function",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Windows",
"Feature Extraction",
"Periodic Structures",
"Repeated Pattern Detection",
"Low Rank",
"Kronecker Product Model",
"Urban Facade"
],
"authors": [
{
"givenName": "Juan",
"surname": "Liu",
"fullName": "Juan Liu",
"affiliation": "Google Inc, New York, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Emmanouil Z.",
"surname": "Psarakis",
"fullName": "Emmanouil Z. Psarakis",
"affiliation": "Computer Engineering & Informatics, University of Patras, Patras, Greece",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yang",
"surname": "Feng",
"fullName": "Yang Feng",
"affiliation": "Statistics, Columbia University, New York, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ioannis",
"surname": "Stamos",
"fullName": "Ioannis Stamos",
"affiliation": "Computer Science, Hunter College of CUNY, New York, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2019-09-01 00:00:00",
"pubType": "trans",
"pages": "2266-2272",
"year": "2019",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2013/2840/0/2840a401",
"title": "Automatic Kronecker Product Model Based Detection of Repeated Patterns in 2D Urban Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840a401/12OmNx9FhNf",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2008/2242/0/04587461",
"title": "Detecting and matching repeated patterns for automatic geo-tagging in urban environments",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2008/04587461/12OmNxzuMCm",
"parentPublication": {
"id": "proceedings/cvpr/2008/2242/0",
"title": "2008 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/11/08705329",
"title": "Multi-Window 3D Interaction for Collaborative Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2020/11/08705329/19Jq3VAoa2Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2022/6814/0/681400a063",
"title": "A Semantics-aware Method for Adding 3D Window Details to Textured LoD2 CityGML Models",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2022/681400a063/1I6RPcjsVBm",
"parentPublication": {
"id": "proceedings/cw/2022/6814/0",
"title": "2022 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2018/8497/0/849700a035",
"title": "Slice-Based Window Detection from Scene Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2018/849700a035/1a3x7xj68A8",
"parentPublication": {
"id": "proceedings/icvrv/2018/8497/0",
"title": "2018 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093273",
"title": "Fast Deep Stereo with 2D Convolutional Processing of Cost Signatures",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093273/1jPbziWYWCA",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09145640",
"title": "Large-Scale Architectural Asset Extraction from Panoramic Imagery",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09145640/1lE0csLCf6g",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2020/7445/0/09150430",
"title": "Communication Avoiding 2D Stencil Implementations over PaRSEC Task-Based Runtime",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2020/09150430/1lPGCr9t0tO",
"parentPublication": {
"id": "proceedings/ipdpsw/2020/7445/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800m2252",
"title": "Learning to Segment 3D Point Clouds in 2D Image Space",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800m2252/1m3o6mX0Tjq",
"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/searis/2018/6272/0/09180231",
"title": "VD1: a technical approach to a hybrid 2D and 3D desktop environment",
"doi": null,
"abstractUrl": "/proceedings-article/searis/2018/09180231/1mK7jmn4lbO",
"parentPublication": {
"id": "proceedings/searis/2018/6272/0",
"title": "2018 IEEE 11th Workshop on Software Engineering and Architectures for Real-time Interactive Systems (SEARIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08413121",
"articleId": "13rRUwh80CK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08400387",
"articleId": "13rRUxASuwx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i584TTxQYw",
"name": "ttp201909-08417901s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201909-08417901s1.pdf",
"extension": "pdf",
"size": "32.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzvhvFW",
"title": "Jan.",
"year": "2016",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "38",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAASXt",
"doi": "10.1109/TPAMI.2015.2435739",
"abstract": "We show that by extending the Laplacian formalism, which was first introduced in the Graphics community to regularize 3D meshes, we can turn the monocular 3D shape reconstruction of a deformable surface given correspondences with a reference image into a much better-posed problem. This allows us to quickly and reliably eliminate outliers by simply solving a linear least squares problem. This yields an initial 3D shape estimate, which is not necessarily accurate, but whose 2D projections are. The initial shape is then refined by a constrained optimization problem to output the final surface reconstruction. Our approach allows us to reduce the dimensionality of the surface reconstruction problem without sacrificing accuracy, thus allowing for real-time implementations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We show that by extending the Laplacian formalism, which was first introduced in the Graphics community to regularize 3D meshes, we can turn the monocular 3D shape reconstruction of a deformable surface given correspondences with a reference image into a much better-posed problem. This allows us to quickly and reliably eliminate outliers by simply solving a linear least squares problem. This yields an initial 3D shape estimate, which is not necessarily accurate, but whose 2D projections are. The initial shape is then refined by a constrained optimization problem to output the final surface reconstruction. Our approach allows us to reduce the dimensionality of the surface reconstruction problem without sacrificing accuracy, thus allowing for real-time implementations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We show that by extending the Laplacian formalism, which was first introduced in the Graphics community to regularize 3D meshes, we can turn the monocular 3D shape reconstruction of a deformable surface given correspondences with a reference image into a much better-posed problem. This allows us to quickly and reliably eliminate outliers by simply solving a linear least squares problem. This yields an initial 3D shape estimate, which is not necessarily accurate, but whose 2D projections are. The initial shape is then refined by a constrained optimization problem to output the final surface reconstruction. Our approach allows us to reduce the dimensionality of the surface reconstruction problem without sacrificing accuracy, thus allowing for real-time implementations.",
"title": "Template-Based Monocular 3D Shape Recovery Using Laplacian Meshes",
"normalizedTitle": "Template-Based Monocular 3D Shape Recovery Using Laplacian Meshes",
"fno": "07110605",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Shape",
"Three Dimensional Displays",
"Transmission Line Matrix Methods",
"Linear Systems",
"Laplace Equations",
"Surface Reconstruction",
"Indexes",
"Laplacian Formalism",
"Deformable Surfaces",
"Monocular Shape Recovery",
"Laplacian Formalism",
"Deformable Surfaces",
"Monocular Shape Recovery"
],
"authors": [
{
"givenName": "Dat Tien",
"surname": "Ngo",
"fullName": "Dat Tien Ngo",
"affiliation": "École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonas",
"surname": "Östlund",
"fullName": "Jonas Östlund",
"affiliation": "École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pascal",
"surname": "Fua",
"fullName": "Pascal Fua",
"affiliation": "École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "172-187",
"year": "2016",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2011/0063/0/06130323",
"title": "Real-time structure and motion recovery from two views of a multiplanar scene",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130323/12OmNAR1aZC",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130447",
"title": "A pixel-based approach to template-based monocular 3D reconstruction of deformable surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130447/12OmNCga1RM",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2010/7259/0/05521461",
"title": "Point Cloud Skeletons via Laplacian Based Contraction",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2010/05521461/12OmNCvLXYS",
"parentPublication": {
"id": "proceedings/smi/2010/7259/0",
"title": "Shape Modeling International (SMI 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459403",
"title": "Template-free monocular reconstruction of deformable surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459403/12OmNqJHFsI",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/01/06866216",
"title": "From Shading to Local Shape",
"doi": null,
"abstractUrl": "/journal/tp/2015/01/06866216/13rRUwbJD67",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/02/07858760",
"title": "Shading-Based Surface Detail Recovery Under General Unknown Illumination",
"doi": null,
"abstractUrl": "/journal/tp/2018/02/07858760/13rRUwdIOW8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/10/07010934",
"title": "Shape-from-Template",
"doi": null,
"abstractUrl": "/journal/tp/2015/10/07010934/13rRUxAAT2u",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600d938",
"title": "<tex>Z_$\\phi$_Z</tex>-SfT: Shape-from-Template with a Physics-Based Deformation Model",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600d938/1H0L0rADIpq",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09159927",
"title": "Learning on 3D Meshes With Laplacian Encoding and Pooling",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09159927/1m3m77L2v3a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900k0241",
"title": "D<sup>2</sup>IM-Net: Learning Detail Disentangled Implicit Fields from Single Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0241/1yeIv3o1GDe",
"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": "07102746",
"articleId": "13rRUxASu20",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07110624",
"articleId": "13rRUwInvzD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesQn",
"name": "ttp201601-07110605s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201601-07110605s1.zip",
"extension": "zip",
"size": "46.9 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxYIMV0",
"doi": "10.1109/TVCG.2014.2388205",
"abstract": "Polyhedral meshes (PM)—meshes having planar faces—have enjoyed a rise in popularity in recent years due to their importance in architectural and industrial design. However, they are also notoriously difficult to generate and manipulate. Previous methods start with a smooth surface and then apply elaborate meshing schemes to create polyhedral meshes approximating the surface. In this paper, we describe a reverse approach: given the topology of a mesh, we explore the space of possible planar meshes having that topology. Our approach is based on a complete characterization of the maximal linear spaces of polyhedral meshes contained in the curved manifold of polyhedral meshes with a given topology. We show that these linear spaces can be described as nullspaces of differential operators, much like harmonic functions are nullspaces of the Laplacian operator. An analysis of this operator provides tools for global and local design of a polyhedral mesh, which fully expose the geometric possibilities and limitations of the given topology.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Polyhedral meshes (PM)—meshes having planar faces—have enjoyed a rise in popularity in recent years due to their importance in architectural and industrial design. However, they are also notoriously difficult to generate and manipulate. Previous methods start with a smooth surface and then apply elaborate meshing schemes to create polyhedral meshes approximating the surface. In this paper, we describe a reverse approach: given the topology of a mesh, we explore the space of possible planar meshes having that topology. Our approach is based on a complete characterization of the maximal linear spaces of polyhedral meshes contained in the curved manifold of polyhedral meshes with a given topology. We show that these linear spaces can be described as nullspaces of differential operators, much like harmonic functions are nullspaces of the Laplacian operator. An analysis of this operator provides tools for global and local design of a polyhedral mesh, which fully expose the geometric possibilities and limitations of the given topology.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Polyhedral meshes (PM)—meshes having planar faces—have enjoyed a rise in popularity in recent years due to their importance in architectural and industrial design. However, they are also notoriously difficult to generate and manipulate. Previous methods start with a smooth surface and then apply elaborate meshing schemes to create polyhedral meshes approximating the surface. In this paper, we describe a reverse approach: given the topology of a mesh, we explore the space of possible planar meshes having that topology. Our approach is based on a complete characterization of the maximal linear spaces of polyhedral meshes contained in the curved manifold of polyhedral meshes with a given topology. We show that these linear spaces can be described as nullspaces of differential operators, much like harmonic functions are nullspaces of the Laplacian operator. An analysis of this operator provides tools for global and local design of a polyhedral mesh, which fully expose the geometric possibilities and limitations of the given topology.",
"title": "On Linear Spaces of Polyhedral Meshes",
"normalizedTitle": "On Linear Spaces of Polyhedral Meshes",
"fno": "07006805",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Topology",
"Manifolds",
"Vectors",
"Transmission Line Matrix Methods",
"Geometry",
"Shape",
"Space Exploration",
"Polyhedral Meshes"
],
"authors": [
{
"givenName": "Roi",
"surname": "Poranne",
"fullName": "Roi Poranne",
"affiliation": "Technion—Israel Institute of Technology, Haifa, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Renjie",
"surname": "Chen",
"fullName": "Renjie Chen",
"affiliation": "Technion—Israel Institute of Technology, Haifa, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Craig",
"surname": "Gotsman",
"fullName": "Craig Gotsman",
"affiliation": "Technion—Israel Institute of Technology, Haifa, Israel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2015-05-01 00:00:00",
"pubType": "trans",
"pages": "652-662",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dpvt/2006/2825/0/282500365",
"title": "Revealing Significant Medial Structure in Polyhedral Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2006/282500365/12OmNBO3JYD",
"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/icmip/2017/5954/0/5954a315",
"title": "A Polygon Meshes Compression Algorithm Based on ASCII and Interval Coding",
"doi": null,
"abstractUrl": "/proceedings-article/icmip/2017/5954a315/12OmNCbU395",
"parentPublication": {
"id": "proceedings/icmip/2017/5954/0",
"title": "2017 2nd International Conference on Multimedia and Image Processing (ICMIP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifita/2010/4115/1/4115a109",
"title": "A Lower Bound on the Dimension of Bicubic Spline Spaces over T-meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ifita/2010/4115a109/12OmNviZljU",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1989/1952/0/00037852",
"title": "From 3D line segments to objects and spaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1989/00037852/12OmNvjQ8Vy",
"parentPublication": {
"id": "proceedings/cvpr/1989/1952/0",
"title": "1989 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi-t/2017/0619/0/0619a042",
"title": "Geometric Data Analysis Based on Manifold Learning with Applications for Image Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi-t/2017/0619a042/12OmNx8Ounr",
"parentPublication": {
"id": "proceedings/sibgrapi-t/2017/0619/0",
"title": "2017 30th SIBGRAPI Conference on Graphics, Patterns and Images Tutorials (SIBGRAPI-T)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780068",
"title": "Polyhedral Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780068/12OmNyQpgSx",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122115",
"title": "Interactive Volume Visualization of General Polyhedral Grids",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122115/13rRUxZzAhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1989/09/i1001",
"title": "Computing Minimal Distances on Polyhedral Surfaces",
"doi": null,
"abstractUrl": "/journal/tp/1989/09/i1001/13rRUxlgy4B",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017576",
"title": "Interactive Design and Visualization of Branched Covering Spaces",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017576/13rRUzphDy0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1996/7594/0/00548468",
"title": "Spectral partitioning works: planar graphs and finite element meshes",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1996/00548468/17D45Xbl4PB",
"parentPublication": {
"id": "proceedings/focs/1996/7594/0",
"title": "Proceedings of 37th Conference on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06994851",
"articleId": "13rRUwghd9a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06977984",
"articleId": "13rRUxASuvf",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRUK",
"name": "ttg201505-07006805s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201505-07006805s1.zip",
"extension": "zip",
"size": "18.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": "1LFQ6yTQbIs",
"doi": "10.1109/TVCG.2023.3259044",
"abstract": "Geometric deep learning has sparked a rising interest in computer graphics to perform shape understanding tasks, such as shape classification and semantic segmentation. When the input is a polygonal surface, one has to suffer from the irregular mesh structure. Motivated by the geometric spectral theory, we introduce <italic>Laplacian2Mesh</italic>, a novel and flexible convolutional neural network (CNN) framework for coping with irregular triangle meshes (vertices may have any valence). By mapping the input mesh surface to the multi-dimensional Laplacian-Beltrami space, Laplacian2Mesh enables one to perform shape analysis tasks directly using the mature CNNs, without the need to deal with the irregular connectivity of the mesh structure. We further define a mesh pooling operation such that the receptive field of the network can be expanded while retaining the original vertex set as well as the connections between them. Besides, we introduce a channel-wise self-attention block to learn the individual importance of feature ingredients. Laplacian2Mesh not only decouples the geometry from the irregular connectivity of the mesh structure but also better captures the global features that are central to shape classification and segmentation. Extensive tests on various datasets demonstrate the effectiveness and efficiency of Laplacian2Mesh, particularly in terms of the capability of being vulnerable to noise to fulfill various learning tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Geometric deep learning has sparked a rising interest in computer graphics to perform shape understanding tasks, such as shape classification and semantic segmentation. When the input is a polygonal surface, one has to suffer from the irregular mesh structure. Motivated by the geometric spectral theory, we introduce <italic>Laplacian2Mesh</italic>, a novel and flexible convolutional neural network (CNN) framework for coping with irregular triangle meshes (vertices may have any valence). By mapping the input mesh surface to the multi-dimensional Laplacian-Beltrami space, Laplacian2Mesh enables one to perform shape analysis tasks directly using the mature CNNs, without the need to deal with the irregular connectivity of the mesh structure. We further define a mesh pooling operation such that the receptive field of the network can be expanded while retaining the original vertex set as well as the connections between them. Besides, we introduce a channel-wise self-attention block to learn the individual importance of feature ingredients. Laplacian2Mesh not only decouples the geometry from the irregular connectivity of the mesh structure but also better captures the global features that are central to shape classification and segmentation. Extensive tests on various datasets demonstrate the effectiveness and efficiency of Laplacian2Mesh, particularly in terms of the capability of being vulnerable to noise to fulfill various learning tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Geometric deep learning has sparked a rising interest in computer graphics to perform shape understanding tasks, such as shape classification and semantic segmentation. When the input is a polygonal surface, one has to suffer from the irregular mesh structure. Motivated by the geometric spectral theory, we introduce Laplacian2Mesh, a novel and flexible convolutional neural network (CNN) framework for coping with irregular triangle meshes (vertices may have any valence). By mapping the input mesh surface to the multi-dimensional Laplacian-Beltrami space, Laplacian2Mesh enables one to perform shape analysis tasks directly using the mature CNNs, without the need to deal with the irregular connectivity of the mesh structure. We further define a mesh pooling operation such that the receptive field of the network can be expanded while retaining the original vertex set as well as the connections between them. Besides, we introduce a channel-wise self-attention block to learn the individual importance of feature ingredients. Laplacian2Mesh not only decouples the geometry from the irregular connectivity of the mesh structure but also better captures the global features that are central to shape classification and segmentation. Extensive tests on various datasets demonstrate the effectiveness and efficiency of Laplacian2Mesh, particularly in terms of the capability of being vulnerable to noise to fulfill various learning tasks.",
"title": "Laplacian2Mesh: Laplacian-Based Mesh Understanding",
"normalizedTitle": "Laplacian2Mesh: Laplacian-Based Mesh Understanding",
"fno": "10076837",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shape",
"Task Analysis",
"Convolution",
"Laplace Equations",
"Three Dimensional Displays",
"Deep Learning",
"Kernel",
"Geometric Deep Learning",
"Laplacian Pooling",
"Laplacian Beltrami Space",
"Mesh Understanding"
],
"authors": [
{
"givenName": "Qiujie",
"surname": "Dong",
"fullName": "Qiujie Dong",
"affiliation": "School of Computer Science and Technology, Shandong University, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zixiong",
"surname": "Wang",
"fullName": "Zixiong Wang",
"affiliation": "School of Computer Science and Technology, Shandong University, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Manyi",
"surname": "Li",
"fullName": "Manyi Li",
"affiliation": "School of Software, Shandong University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junjie",
"surname": "Gao",
"fullName": "Junjie Gao",
"affiliation": "School of Computer Science and Technology, Shandong University, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuangmin",
"surname": "Chen",
"fullName": "Shuangmin Chen",
"affiliation": "School of Information and Technology, Qingdao University of Science and Technology, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenyu",
"surname": "Shu",
"fullName": "Zhenyu Shu",
"affiliation": "School of Computer and Data Engineering, Ningbo Institute of Technology, Zhejiang University, Ningbo, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shiqing",
"surname": "Xin",
"fullName": "Shiqing Xin",
"affiliation": "School of Computer Science and Technology, Shandong University, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Changhe",
"surname": "Tu",
"fullName": "Changhe Tu",
"affiliation": "School of Computer Science and Technology, Shandong University, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenping",
"surname": "Wang",
"fullName": "Wenping Wang",
"affiliation": "Department of Computer Science & Engineering, Texas A&M University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-03-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/cgiv/2007/2928/0/29280195",
"title": "Mesh Editing in ROI with Dual Laplacian",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2007/29280195/12OmNBRsVy4",
"parentPublication": {
"id": "proceedings/cgiv/2007/2928/0",
"title": "Computer Graphics, Imaging and Visualisation (CGIV 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730269",
"title": "A Global Laplacian Smoothing Approach with Feature Preservation",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730269/12OmNBTJIAu",
"parentPublication": {
"id": "proceedings/cad-cg/2005/2473/0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2013/5099/0/5099a179",
"title": "Shape Inflation with an Adapted Laplacian Operator for Hybrid Quad/Triangle Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2013/5099a179/12OmNqGRGaD",
"parentPublication": {
"id": "proceedings/sibgrapi/2013/5099/0",
"title": "2013 XXVI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2013/4989/0/4989c435",
"title": "Optical Flow Estimation Using Laplacian Mesh Energy",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989c435/12OmNvzJG1K",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460450",
"title": "Shape signature using the edge-based Laplacian",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460450/12OmNwudQLH",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2016/2823/0/2823a588",
"title": "Locality-Aware Laplacian Mesh Smoothing",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2016/2823a588/12OmNynJMIp",
"parentPublication": {
"id": "proceedings/icpp/2016/2823/0",
"title": "2016 45th International Conference on Parallel Processing (ICPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457g584",
"title": "SyncSpecCNN: Synchronized Spectral CNN for 3D Shape Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457g584/12OmNyoAA54",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/03/ttg2009030518",
"title": "Quasi-Developable Mesh Surface Interpolation via Mesh Deformation",
"doi": null,
"abstractUrl": "/journal/tg/2009/03/ttg2009030518/13rRUxjQybN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10070611",
"title": "Mesh Neural Networks Based on Dual Graph Pyramids",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10070611/1LvvYkEy8XC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09159927",
"title": "Learning on 3D Meshes With Laplacian Encoding and Pooling",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09159927/1m3m77L2v3a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10076909",
"articleId": "1LFQ6bbu1Wg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10076832",
"articleId": "1LFQ6Ir6DEQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1LH8FviYvN6",
"name": "ttg555501-010076837s1-supp1-3259044.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010076837s1-supp1-3259044.pdf",
"extension": "pdf",
"size": "217 kB",
"__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": "1LtR6T3cY0w",
"doi": "10.1109/TVCG.2023.3255820",
"abstract": "Learning the latent representation of three-dimensional (3D) morphable geometry is useful for several tasks, such as 3D face tracking, human motion analysis, and character generation and animation. For unstructured surface meshes, previous state-of-the-art methods focus on designing convolution operators and share the same pooling and unpooling operations to encode neighborhood information. Previous models use a mesh pooling operation based on edge contraction, which is based on the Euclidean distance of vertices rather than the actual topology. In this study, we investigated whether such a pooling operation can be improved, introducing an improved pooling layer that combines the vertex normals and adjacent faces area. Furthermore, to prevent template overfitting, we increased the receptive field and improved low-resolution projection in the unpooling stage. This increase did not affect processing efficiency because the operation was implemented once on the mesh. We performed experiments to evaluate the proposed method, whose results indicated that the proposed operations outperformed Neural3DMM with 14% lower reconstruction errors and outperformed CoMA by 15% by modifying the pooling and unpooling matrices.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Learning the latent representation of three-dimensional (3D) morphable geometry is useful for several tasks, such as 3D face tracking, human motion analysis, and character generation and animation. For unstructured surface meshes, previous state-of-the-art methods focus on designing convolution operators and share the same pooling and unpooling operations to encode neighborhood information. Previous models use a mesh pooling operation based on edge contraction, which is based on the Euclidean distance of vertices rather than the actual topology. In this study, we investigated whether such a pooling operation can be improved, introducing an improved pooling layer that combines the vertex normals and adjacent faces area. Furthermore, to prevent template overfitting, we increased the receptive field and improved low-resolution projection in the unpooling stage. This increase did not affect processing efficiency because the operation was implemented once on the mesh. We performed experiments to evaluate the proposed method, whose results indicated that the proposed operations outperformed Neural3DMM with 14% lower reconstruction errors and outperformed CoMA by 15% by modifying the pooling and unpooling matrices.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Learning the latent representation of three-dimensional (3D) morphable geometry is useful for several tasks, such as 3D face tracking, human motion analysis, and character generation and animation. For unstructured surface meshes, previous state-of-the-art methods focus on designing convolution operators and share the same pooling and unpooling operations to encode neighborhood information. Previous models use a mesh pooling operation based on edge contraction, which is based on the Euclidean distance of vertices rather than the actual topology. In this study, we investigated whether such a pooling operation can be improved, introducing an improved pooling layer that combines the vertex normals and adjacent faces area. Furthermore, to prevent template overfitting, we increased the receptive field and improved low-resolution projection in the unpooling stage. This increase did not affect processing efficiency because the operation was implemented once on the mesh. We performed experiments to evaluate the proposed method, whose results indicated that the proposed operations outperformed Neural3DMM with 14% lower reconstruction errors and outperformed CoMA by 15% by modifying the pooling and unpooling matrices.",
"title": "Efficient Pooling Operator for 3D Morphable Models",
"normalizedTitle": "Efficient Pooling Operator for 3D Morphable Models",
"fno": "10068322",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Convolution",
"Faces",
"Three Dimensional Displays",
"Shape",
"Task Analysis",
"Computational Modeling",
"Geometry",
"Latent Representation",
"Mesh Reconstruction",
"Morphable Model"
],
"authors": [
{
"givenName": "Haoliang",
"surname": "Zhang",
"fullName": "Haoliang Zhang",
"affiliation": "The University of Oklahoma, Norman, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Samuel",
"surname": "Cheng",
"fullName": "Samuel Cheng",
"affiliation": "The University of Oklahoma, Norman, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian El",
"surname": "Amm",
"fullName": "Christian El Amm",
"affiliation": "The University of Oklahoma, Norman, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonghoon",
"surname": "Kim",
"fullName": "Jonghoon Kim",
"affiliation": "Chungnam National University, Republic of Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "1-9",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2017/1034/0/1034a895",
"title": "3D Morphable Models as Spatial Transformer Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a895/12OmNyPQ4OA",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000c626",
"title": "Recurrent Slice Networks for 3D Segmentation of Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000c626/17D45Xq6dzm",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09870559",
"title": "P2T: Pyramid Pooling Transformer for Scene Understanding",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09870559/1GgcM53dti8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2019/9214/0/921400a513",
"title": "Adaptive Salience Preserving Pooling for Deep Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2019/921400a513/1cJ0Ai6YpXi",
"parentPublication": {
"id": "proceedings/icmew/2019/9214/0",
"title": "2019 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300h212",
"title": "Neural 3D Morphable Models: Spiral Convolutional Networks for 3D Shape Representation Learning and Generation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h212/1hVlISVeBaw",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300d364",
"title": "Global Feature Guided Local Pooling",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300d364/1hVldsD7mpy",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150750",
"title": "Mesh Variational Autoencoders with Edge Contraction Pooling",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150750/1lPH7Uy2hqw",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800i609",
"title": "DualConvMesh-Net: Joint Geodesic and Euclidean Convolutions on 3D Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800i609/1m3nzTemaGs",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/02/09211767",
"title": "Learnable Pooling in Graph Convolutional Networks for Brain Surface Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2022/02/09211767/1nB9SOc7u9i",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900n3159",
"title": "Learning Feature Aggregation for Deep 3D Morphable Models",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900n3159/1yeJkSsaWNa",
"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": "10066189",
"articleId": "1LoWA0TvtJK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10068257",
"articleId": "1LtR7CeyeHe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1LxaWO7f96M",
"name": "ttg555501-010068322s1-supp1-3255820.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010068322s1-supp1-3255820.pdf",
"extension": "pdf",
"size": "1.04 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvAiSp1",
"title": "Nov.",
"year": "2018",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14M3DYV3qyA",
"doi": "10.1109/TVCG.2018.2868587",
"abstract": "Previous research has demonstrated that Augmented Reality can reduce a user's task response time and mental effort when completing a procedural task. This paper investigates techniques to improve user performance and reduce mental effort by providing projector-based Spatial Augmented Reality predictive cues for future responses. The objective of the two experiments conducted in this study was to isolate the performance and mental effort differences from several different annotation cueing techniques for simple (Experiment 1) and complex (Experiment 2) button-pressing tasks. Comporting with existing cognitive neuroscience literature on prediction, attentional orienting, and interference, we hypothesized that for both simple procedural tasks and complex search-based tasks, having a visual cue guiding to the next task's location would positively impact performance relative to a baseline, no-cue condition. Additionally, we predicted that direction-based cues would provide a more significant positive impact than target-based cues. The results indicated that providing a line to the next task was the most effective technique for improving the users' task time and mental effort in both the simple and complex tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Previous research has demonstrated that Augmented Reality can reduce a user's task response time and mental effort when completing a procedural task. This paper investigates techniques to improve user performance and reduce mental effort by providing projector-based Spatial Augmented Reality predictive cues for future responses. The objective of the two experiments conducted in this study was to isolate the performance and mental effort differences from several different annotation cueing techniques for simple (Experiment 1) and complex (Experiment 2) button-pressing tasks. Comporting with existing cognitive neuroscience literature on prediction, attentional orienting, and interference, we hypothesized that for both simple procedural tasks and complex search-based tasks, having a visual cue guiding to the next task's location would positively impact performance relative to a baseline, no-cue condition. Additionally, we predicted that direction-based cues would provide a more significant positive impact than target-based cues. The results indicated that providing a line to the next task was the most effective technique for improving the users' task time and mental effort in both the simple and complex tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Previous research has demonstrated that Augmented Reality can reduce a user's task response time and mental effort when completing a procedural task. This paper investigates techniques to improve user performance and reduce mental effort by providing projector-based Spatial Augmented Reality predictive cues for future responses. The objective of the two experiments conducted in this study was to isolate the performance and mental effort differences from several different annotation cueing techniques for simple (Experiment 1) and complex (Experiment 2) button-pressing tasks. Comporting with existing cognitive neuroscience literature on prediction, attentional orienting, and interference, we hypothesized that for both simple procedural tasks and complex search-based tasks, having a visual cue guiding to the next task's location would positively impact performance relative to a baseline, no-cue condition. Additionally, we predicted that direction-based cues would provide a more significant positive impact than target-based cues. The results indicated that providing a line to the next task was the most effective technique for improving the users' task time and mental effort in both the simple and complex tasks.",
"title": "A Comparison of Predictive Spatial Augmented Reality Cues for Procedural Tasks",
"normalizedTitle": "A Comparison of Predictive Spatial Augmented Reality Cues for Procedural Tasks",
"fno": "08493594",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Cognition",
"Human Computer Interaction",
"Complex Tasks",
"Predictive Spatial Augmented Reality Cues",
"Procedural Task",
"User Performance",
"Future Responses",
"Mental Effort Differences",
"Complex Button Pressing Tasks",
"Simple Procedural Tasks",
"Complex Search Based Tasks",
"Visual Cue",
"No Cue Condition",
"Direction Based Cues",
"Target Based Cues",
"Projector Based Spatial Augmented Reality Predictive Cues",
"Task Analysis",
"Visualization",
"Resists",
"Monitoring",
"Augmented Reality",
"Complexity Theory",
"Maintenance Engineering",
"Spatial Augmented Reality",
"Predictive Cue",
"Mental Effort",
"Procedural Task"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Volmer",
"fullName": "Benjamin Volmer",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "James",
"surname": "Baumeister",
"fullName": "James Baumeister",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stewart",
"surname": "Von Itzstein",
"fullName": "Stewart Von Itzstein",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ina",
"surname": "Bornkessel-Schlesewsky",
"fullName": "Ina Bornkessel-Schlesewsky",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthias",
"surname": "Schlesewsky",
"fullName": "Matthias Schlesewsky",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark",
"surname": "Billinghurst",
"fullName": "Mark Billinghurst",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bruce H.",
"surname": "Thomas",
"fullName": "Bruce H. Thomas",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2018-11-01 00:00:00",
"pubType": "trans",
"pages": "2846-2856",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ismarw/2016/3740/0/07836504",
"title": "An Evaluation of Information Connection in Augmented Reality for 3D Scenes with Occlusion",
"doi": null,
"abstractUrl": "/proceedings-article/ismarw/2016/07836504/12OmNvSbBGA",
"parentPublication": {
"id": "proceedings/ismarw/2016/3740/0",
"title": "2016 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2013/2869/0/06671795",
"title": "Study of augmented gesture communication cues and view sharing in remote collaboration",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2013/06671795/12OmNwl8GBu",
"parentPublication": {
"id": "proceedings/ismar/2013/2869/0",
"title": "2013 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismarw/2015/8471/0/8471a004",
"title": "Visual Subliminal Cues for Spatial Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismarw/2015/8471a004/12OmNyp9MgE",
"parentPublication": {
"id": "proceedings/ismarw/2015/8471/0",
"title": "2015 IEEE International Symposium on Mixed and Augmented Reality Workshops (ISMARW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a589",
"title": "A Comparison of Spatial Augmented Reality Predictive Cues and their Effects on Sleep Deprived Users",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a589/1CJbSaiJUQg",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09854202",
"title": "Event Related Brain Responses Reveal the Impact of Spatial Augmented Reality Predictive Cues on Mental Effort",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09854202/1FJ0TF9D3Jm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/11/08799015",
"title": "Conveying spatial awareness cues in xR collaborations",
"doi": null,
"abstractUrl": "/journal/tg/2019/11/08799015/1cumXlkNGuY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2019/4765/0/476500a001",
"title": "Low-Cost Real-Time Mental Load Adaptation for Augmented Reality Instructions - A Feasibility Study",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2019/476500a001/1gysjlovPr2",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2019/4765/0",
"title": "2019 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2019/4765/0/476500a340",
"title": "Less is More: Using Spatialized Auditory and Visual Cues for Target Acquisition in a Real-World Search Task",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2019/476500a340/1gysnlmPxzq",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2019/4765/0",
"title": "2019 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a498",
"title": "Enhancing First-Person View Task Instruction Videos with Augmented Reality Cues",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a498/1pyswTqrkZ2",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a159",
"title": "Exploring the Effect of Visual Cues on Eye Gaze During AR-Guided Picking and Assembly Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a159/1yeQM18rD7G",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08514064",
"articleId": "14M3DZSFbS8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08456852",
"articleId": "14M3E059xAY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNASILLu",
"title": "May-June",
"year": "2016",
"issueNum": "03",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "18",
"label": "May-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3xYb8",
"doi": "10.1109/MCSE.2016.52",
"abstract": "Voronoi diagrams are fundamental data structures in computational geometry, with applications in areas such as physics-based simulations. For non-Euclidean distances, the Voronoi diagram must be performed over a grid-graph, where the edges encode the required distance information. The major bottleneck in this case is a shortest path algorithm that must be computed multiple times during the simulation. The authors present a GPU algorithm for solving the shortest path problem from multiple sources using a generalized distance function. Their algorithm was designed to leverage the grid-based nature of the underlying graph that represents the deformable objects. Experimental results report speed-ups up to 65x over a current reference sequential method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Voronoi diagrams are fundamental data structures in computational geometry, with applications in areas such as physics-based simulations. For non-Euclidean distances, the Voronoi diagram must be performed over a grid-graph, where the edges encode the required distance information. The major bottleneck in this case is a shortest path algorithm that must be computed multiple times during the simulation. The authors present a GPU algorithm for solving the shortest path problem from multiple sources using a generalized distance function. Their algorithm was designed to leverage the grid-based nature of the underlying graph that represents the deformable objects. Experimental results report speed-ups up to 65x over a current reference sequential method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Voronoi diagrams are fundamental data structures in computational geometry, with applications in areas such as physics-based simulations. For non-Euclidean distances, the Voronoi diagram must be performed over a grid-graph, where the edges encode the required distance information. The major bottleneck in this case is a shortest path algorithm that must be computed multiple times during the simulation. The authors present a GPU algorithm for solving the shortest path problem from multiple sources using a generalized distance function. Their algorithm was designed to leverage the grid-based nature of the underlying graph that represents the deformable objects. Experimental results report speed-ups up to 65x over a current reference sequential method.",
"title": "Parallel Voronoi Computation for Physics-Based Simulations",
"normalizedTitle": "Parallel Voronoi Computation for Physics-Based Simulations",
"fno": "mcs2016030088",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Interpolation",
"Computational Modeling",
"Graphics Processing Units",
"Algorithm Design And Analysis",
"Three Dimensional Displays",
"Topology",
"Scientific Computing",
"Physics",
"Simulation"
],
"authors": [
{
"givenName": "João",
"surname": "Comba",
"fullName": "João Comba",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julio",
"surname": "Toss",
"fullName": "Julio Toss",
"affiliation": "Universidade Federal do Rio Grande do Sul (UFRGS)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bruno",
"surname": "Raffin",
"fullName": "Bruno Raffin",
"affiliation": "Université Grenoble Alpes, INRIA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2016-05-01 00:00:00",
"pubType": "mags",
"pages": "88-94",
"year": "2016",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iros/1995/7108/3/71083033",
"title": "Planning conditional shortest paths through an unknown environment: a framed-quadtree approach",
"doi": null,
"abstractUrl": "/proceedings-article/iros/1995/71083033/12OmNAlvHAj",
"parentPublication": {
"id": "proceedings/iros/1995/7108/3",
"title": "Intelligent Robots and Systems, IEEE/RSJ International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvri/2011/0054/0/05759626",
"title": "Hierarchical Voronoi diagram-based path planning among polygonal obstacles for 3D virtual worlds",
"doi": null,
"abstractUrl": "/proceedings-article/isvri/2011/05759626/12OmNAolH4M",
"parentPublication": {
"id": "proceedings/isvri/2011/0054/0",
"title": "2011 IEEE International Symposium on VR Innovation (ISVRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2007/3005/0/04390942",
"title": "Computation of Geodesic Voronoi Diagrams in Riemannian 3-Space using Medial Equations",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2007/04390942/12OmNBOCWp8",
"parentPublication": {
"id": "proceedings/cw/2007/3005/0",
"title": "2007 International Conference on Cyberworlds (CW'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pbg/2005/20/0/01500315",
"title": "Voronoi rasterization of sparse point sets",
"doi": null,
"abstractUrl": "/proceedings-article/pbg/2005/01500315/12OmNBfZSmM",
"parentPublication": {
"id": "proceedings/pbg/2005/20/0",
"title": "Point-Based Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cesce/2010/3972/1/3972a386",
"title": "The Research and Implement of DEM Interpolation Method Based on Voronoi K Order Adjacency",
"doi": null,
"abstractUrl": "/proceedings-article/cesce/2010/3972a386/12OmNBhpS0B",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2017/1042/0/1042a362",
"title": "Simple and Fast Parallel Algorithms for the Voronoi Map and the Euclidean Distance Map, with GPU Implementations",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2017/1042a362/12OmNBkfRmd",
"parentPublication": {
"id": "proceedings/icpp/2017/1042/0",
"title": "2017 46th International Conference on Parallel Processing (ICPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1994/5090/2/00323267",
"title": "Maintaining Voronoi diagrams in parallel",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1994/00323267/12OmNxcMSlv",
"parentPublication": {
"id": "proceedings/hicss/1994/5090/2",
"title": "Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2014/4258/0/4258a212",
"title": "Parallel Shortest Path Algorithm for Voronoi Diagrams with Generalized Distance Functions",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2014/4258a212/12OmNxwncpk",
"parentPublication": {
"id": "proceedings/sibgrapi/2014/4258/0",
"title": "2014 27th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2011/4483/0/4483a075",
"title": "Generalized Voronoi Diagram Computation on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2011/4483a075/12OmNyQ7FWk",
"parentPublication": {
"id": "proceedings/isvd/2011/4483/0",
"title": "2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09151267",
"title": "Parallel Computation of 3D Clipped Voronoi Diagrams",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09151267/1lPCq0H8hUY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2016030084",
"articleId": "13rRUIJcWpx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2016030095",
"articleId": "13rRUIJuxsA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC1oT5u",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "35",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOveb0",
"doi": "10.1109/TPAMI.2012.261",
"abstract": "We describe a method for articulated human detection and human pose estimation in static images based on a new representation of deformable part models. Rather than modeling articulation using a family of warped (rotated and foreshortened) templates, we use a mixture of small, nonoriented parts. We describe a general, flexible mixture model that jointly captures spatial relations between part locations and co-occurrence relations between part mixtures, augmenting standard pictorial structure models that encode just spatial relations. Our models have several notable properties: 1) They efficiently model articulation by sharing computation across similar warps, 2) they efficiently model an exponentially large set of global mixtures through composition of local mixtures, and 3) they capture the dependency of global geometry on local appearance (parts look different at different locations). When relations are tree structured, our models can be efficiently optimized with dynamic programming. We learn all parameters, including local appearances, spatial relations, and co-occurrence relations (which encode local rigidity) with a structured SVM solver. Because our model is efficient enough to be used as a detector that searches over scales and image locations, we introduce novel criteria for evaluating pose estimation and human detection, both separately and jointly. We show that currently used evaluation criteria may conflate these two issues. Most previous approaches model limbs with rigid and articulated templates that are trained independently of each other, while we present an extensive diagnostic evaluation that suggests that flexible structure and joint training are crucial for strong performance. We present experimental results on standard benchmarks that suggest our approach is the state-of-the-art system for pose estimation, improving past work on the challenging Parse and Buffy datasets while being orders of magnitude faster.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a method for articulated human detection and human pose estimation in static images based on a new representation of deformable part models. Rather than modeling articulation using a family of warped (rotated and foreshortened) templates, we use a mixture of small, nonoriented parts. We describe a general, flexible mixture model that jointly captures spatial relations between part locations and co-occurrence relations between part mixtures, augmenting standard pictorial structure models that encode just spatial relations. Our models have several notable properties: 1) They efficiently model articulation by sharing computation across similar warps, 2) they efficiently model an exponentially large set of global mixtures through composition of local mixtures, and 3) they capture the dependency of global geometry on local appearance (parts look different at different locations). When relations are tree structured, our models can be efficiently optimized with dynamic programming. We learn all parameters, including local appearances, spatial relations, and co-occurrence relations (which encode local rigidity) with a structured SVM solver. Because our model is efficient enough to be used as a detector that searches over scales and image locations, we introduce novel criteria for evaluating pose estimation and human detection, both separately and jointly. We show that currently used evaluation criteria may conflate these two issues. Most previous approaches model limbs with rigid and articulated templates that are trained independently of each other, while we present an extensive diagnostic evaluation that suggests that flexible structure and joint training are crucial for strong performance. We present experimental results on standard benchmarks that suggest our approach is the state-of-the-art system for pose estimation, improving past work on the challenging Parse and Buffy datasets while being orders of magnitude faster.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a method for articulated human detection and human pose estimation in static images based on a new representation of deformable part models. Rather than modeling articulation using a family of warped (rotated and foreshortened) templates, we use a mixture of small, nonoriented parts. We describe a general, flexible mixture model that jointly captures spatial relations between part locations and co-occurrence relations between part mixtures, augmenting standard pictorial structure models that encode just spatial relations. Our models have several notable properties: 1) They efficiently model articulation by sharing computation across similar warps, 2) they efficiently model an exponentially large set of global mixtures through composition of local mixtures, and 3) they capture the dependency of global geometry on local appearance (parts look different at different locations). When relations are tree structured, our models can be efficiently optimized with dynamic programming. We learn all parameters, including local appearances, spatial relations, and co-occurrence relations (which encode local rigidity) with a structured SVM solver. Because our model is efficient enough to be used as a detector that searches over scales and image locations, we introduce novel criteria for evaluating pose estimation and human detection, both separately and jointly. We show that currently used evaluation criteria may conflate these two issues. Most previous approaches model limbs with rigid and articulated templates that are trained independently of each other, while we present an extensive diagnostic evaluation that suggests that flexible structure and joint training are crucial for strong performance. We present experimental results on standard benchmarks that suggest our approach is the state-of-the-art system for pose estimation, improving past work on the challenging Parse and Buffy datasets while being orders of magnitude faster.",
"title": "Articulated Human Detection with Flexible Mixtures of Parts",
"normalizedTitle": "Articulated Human Detection with Flexible Mixtures of Parts",
"fno": "ttp2013122878",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computational Modeling",
"Human Factors",
"Object Segmentation",
"Human Factors",
"Deformable Models",
"Pose Estimation",
"Shape Analysis",
"Deformable Part Models",
"Pose Estimation",
"Object Detection",
"Articulated Shapes"
],
"authors": [
{
"givenName": null,
"surname": "Yi Yang",
"fullName": "Yi Yang",
"affiliation": "Dept. of Comput. Sci., Univ. of California at Irvine, Irvine, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Deva",
"surname": "Ramanan",
"fullName": "Deva Ramanan",
"affiliation": "Dept. of Comput. Sci., Univ. of California at Irvine, Irvine, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2878-2890",
"year": "2013",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2011/0394/0/05995741",
"title": "Articulated pose estimation with flexible mixtures-of-parts",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995741/12OmNApcu8T",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109d670",
"title": "Combined Top-Down/Bottom-Up Human Articulated Pose Estimation Using AdaBoost Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109d670/12OmNC3XhsY",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2016/2491/0/2491a416",
"title": "Multi-player Detection with Articulated Mixtures-of-Parts Representation Constrained by Global Appearance",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2016/2491a416/12OmNC8uRsj",
"parentPublication": {
"id": "proceedings/crv/2016/2491/0",
"title": "2016 13th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c337",
"title": "Multi-source Deep Learning for Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c337/12OmNCcKQg3",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2005/9313/0/01577162",
"title": "Estimating articulated human pose from video using shape context",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2005/01577162/12OmNrIaefA",
"parentPublication": {
"id": "proceedings/isspit/2005/9313/0",
"title": "2005 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2015/7632/0/07301801",
"title": "Articulated pose estimation via multiple mixture parts model",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2015/07301801/12OmNxj23jj",
"parentPublication": {
"id": "proceedings/avss/2015/7632/0",
"title": "2015 12th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109d768",
"title": "Articulated Human Body: 3D Pose Estimation Using a Single Camera",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109d768/12OmNzXnNsM",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995648",
"title": "A unified framework for locating and recognizing human actions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995648/12OmNzvQHKi",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/07/07990516",
"title": "Attribute And-Or Grammar for Joint Parsing of Human Pose, Parts and Attributes",
"doi": null,
"abstractUrl": "/journal/tp/2018/07/07990516/13rRUx0gerc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2019/9552/0/955200a640",
"title": "Pose2Body: Pose-Guided Human Parts Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2019/955200a640/1cdOGWkvdhC",
"parentPublication": {
"id": "proceedings/icme/2019/9552/0",
"title": "2019 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2013122866",
"articleId": "13rRUx0xPJR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2013122891",
"articleId": "13rRUwInuXu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzVXNI4",
"title": "Oct.",
"year": "2006",
"issueNum": "10",
"idPrefix": "si",
"pubType": "journal",
"volume": "14",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0StC",
"doi": "10.1109/TVLSI.2006.884151",
"abstract": "Liquid crystal displays (LCDs) have appeared in applications ranging from medical equipment to automobiles, gas pumps, laptops, and handheld portable computers. These display components present a cascaded energy attenuator to the battery of the handheld device which is responsible for about half of the energy drain at maximum display intensity. As such, the display components become the main focus of every effort for maximization of embedded system's battery lifetime. This paper proposes an approach for pixel transformation of the displayed image to increase the potential energy saving of the backlight scaling method. The proposed approach takes advantage of human visual system (HVS) characteristics and tries to minimize distortion between the perceived brightness values of the individual pixels in the original image and those of the backlight-scaled image. This is in contrast to previous backlight scaling approaches which simply match the luminance values of the individual pixels in the original and backlight-scaled images. Furthermore, this paper proposes a temporally-aware backlight scaling technique for video streams. The goal is to maximize energy saving in the display system by means of dynamic backlight dimming subject to a video distortion tolerance. The video distortion comprises of: 1) an intra-frame (spatial) distortion component due to frame-sensitive backlight scaling and transmittance function tuning and 2) an inter-frame (temporal) distortion component due to large-step backlight dimming across frames modulated by the psychophysical characteristics of the human visual system. The proposed backlight scaling technique is capable of efficiently computing the flickering effect online and subsequently using a measure of the temporal distortion to appropriately adjust the slack on the intra-frame spatial distortion, thereby, achieving a good balance between the two sources of distortion while maximizing the backlight dimming-driven energy saving in the display system and meeting an overall video quality figure of merit. The proposed dynamic backlight scaling approach is amenable to highly efficient hardware realization and has been implemented on the Apollo Testbed II. Actual current measurements demonstrate the effectiveness of proposed technique compared to the previous backlight dimming techniques, which have ignored the temporal distortion effect",
"abstracts": [
{
"abstractType": "Regular",
"content": "Liquid crystal displays (LCDs) have appeared in applications ranging from medical equipment to automobiles, gas pumps, laptops, and handheld portable computers. These display components present a cascaded energy attenuator to the battery of the handheld device which is responsible for about half of the energy drain at maximum display intensity. As such, the display components become the main focus of every effort for maximization of embedded system's battery lifetime. This paper proposes an approach for pixel transformation of the displayed image to increase the potential energy saving of the backlight scaling method. The proposed approach takes advantage of human visual system (HVS) characteristics and tries to minimize distortion between the perceived brightness values of the individual pixels in the original image and those of the backlight-scaled image. This is in contrast to previous backlight scaling approaches which simply match the luminance values of the individual pixels in the original and backlight-scaled images. Furthermore, this paper proposes a temporally-aware backlight scaling technique for video streams. The goal is to maximize energy saving in the display system by means of dynamic backlight dimming subject to a video distortion tolerance. The video distortion comprises of: 1) an intra-frame (spatial) distortion component due to frame-sensitive backlight scaling and transmittance function tuning and 2) an inter-frame (temporal) distortion component due to large-step backlight dimming across frames modulated by the psychophysical characteristics of the human visual system. The proposed backlight scaling technique is capable of efficiently computing the flickering effect online and subsequently using a measure of the temporal distortion to appropriately adjust the slack on the intra-frame spatial distortion, thereby, achieving a good balance between the two sources of distortion while maximizing the backlight dimming-driven energy saving in the display system and meeting an overall video quality figure of merit. The proposed dynamic backlight scaling approach is amenable to highly efficient hardware realization and has been implemented on the Apollo Testbed II. Actual current measurements demonstrate the effectiveness of proposed technique compared to the previous backlight dimming techniques, which have ignored the temporal distortion effect",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Liquid crystal displays (LCDs) have appeared in applications ranging from medical equipment to automobiles, gas pumps, laptops, and handheld portable computers. These display components present a cascaded energy attenuator to the battery of the handheld device which is responsible for about half of the energy drain at maximum display intensity. As such, the display components become the main focus of every effort for maximization of embedded system's battery lifetime. This paper proposes an approach for pixel transformation of the displayed image to increase the potential energy saving of the backlight scaling method. The proposed approach takes advantage of human visual system (HVS) characteristics and tries to minimize distortion between the perceived brightness values of the individual pixels in the original image and those of the backlight-scaled image. This is in contrast to previous backlight scaling approaches which simply match the luminance values of the individual pixels in the original and backlight-scaled images. Furthermore, this paper proposes a temporally-aware backlight scaling technique for video streams. The goal is to maximize energy saving in the display system by means of dynamic backlight dimming subject to a video distortion tolerance. The video distortion comprises of: 1) an intra-frame (spatial) distortion component due to frame-sensitive backlight scaling and transmittance function tuning and 2) an inter-frame (temporal) distortion component due to large-step backlight dimming across frames modulated by the psychophysical characteristics of the human visual system. The proposed backlight scaling technique is capable of efficiently computing the flickering effect online and subsequently using a measure of the temporal distortion to appropriately adjust the slack on the intra-frame spatial distortion, thereby, achieving a good balance between the two sources of distortion while maximizing the backlight dimming-driven energy saving in the display system and meeting an overall video quality figure of merit. The proposed dynamic backlight scaling approach is amenable to highly efficient hardware realization and has been implemented on the Apollo Testbed II. Actual current measurements demonstrate the effectiveness of proposed technique compared to the previous backlight dimming techniques, which have ignored the temporal distortion effect",
"title": "HVS-aware dynamic backlight scaling in TFT-LCDs",
"normalizedTitle": "HVS-aware dynamic backlight scaling in TFT-LCDs",
"fno": "01715347",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Liquid Crystal Displays",
"Thin Film Transistors",
"Visual Perception",
"TFT LCD",
"Liquid Crystal Displays",
"Cascaded Energy Attenuator",
"Handheld Device",
"Display Intensity",
"Display Components",
"Embedded System",
"Battery Lifetime",
"Pixel Transformation",
"Dynamic Backlight Scaling Method",
"Human Visual System",
"Brightness Values",
"Luminance Values",
"Video Streams",
"Display System",
"Video Distortion Tolerance",
"Intra Frame Distortion",
"Frame Sensitive Backlight Scaling",
"Transmittance Function Tuning",
"Inter Frame Distortion",
"Large Step Backlight Dimming",
"Flickering Effect Online",
"Temporal Distortion Effect",
"Thin Film Transistor Liquid Crystal Display",
"Liquid Crystal Displays",
"Computer Displays",
"Pixel",
"Vehicle Dynamics",
"Portable Computers",
"Batteries",
"Humans",
"Visual System",
"Application Software",
"Biomedical Equipment",
"Backlight Scaling",
"Hunan Visual System",
"Power Management",
"Thin Film Transistor Liquid Crystal Display TFT LCD"
],
"authors": [
{
"givenName": "A.",
"surname": "Iranli",
"fullName": "A. Iranli",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "W.",
"surname": "Lee",
"fullName": "W. Lee",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.",
"surname": "Pedram",
"fullName": "M. Pedram",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2006-10-01 00:00:00",
"pubType": "trans",
"pages": "1103-1116",
"year": "2006",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2017/6067/0/08019511",
"title": "Dynamic backlight scaling considering ambient luminance for mobile energy saving",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019511/12OmNCcbE7U",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issst/2010/7094/0/05507735",
"title": "ReLCD recycling and re-use of LCD panels",
"doi": null,
"abstractUrl": "/proceedings-article/issst/2010/05507735/12OmNqJ8tjT",
"parentPublication": {
"id": "proceedings/issst/2010/7094/0",
"title": "IEEE International Symposium on Sustainable Systems and Technology (ISSST 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/2016/1503/0/07760799",
"title": "Display power reduction for mobile closed-source games",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2016/07760799/12OmNvIxeYn",
"parentPublication": {
"id": "proceedings/asap/2016/1503/0",
"title": "2016 IEEE 27th International Conference on Application-specific Systems, Architectures and Processors (ASAP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2010/4271/0/4271a132",
"title": "Image Enhancement for Reducing LCD Backlight Power Based on Human Visual Characteristics",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2010/4271a132/12OmNwB2dUQ",
"parentPublication": {
"id": "proceedings/dicta/2010/4271/0",
"title": "2010 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2004/2085/1/208510252",
"title": "Power Minimization in a Backlit TFT-LCD Display by Concurrent Brightness and Contrast Scaling",
"doi": null,
"abstractUrl": "/proceedings-article/date/2004/208510252/12OmNzh5z0w",
"parentPublication": {
"id": "proceedings/date/2004/2085/3",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2009/3781/0/05090888",
"title": "Visual quality analysis for dynamic backlight scaling in LCD systems",
"doi": null,
"abstractUrl": "/proceedings-article/date/2009/05090888/12OmNzxgHGe",
"parentPublication": {
"id": "proceedings/date/2009/3781/0",
"title": "2009 Design, Automation & Test in Europe Conference & Exhibition (DATE'09)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/dt/2004/05/d5388",
"title": "A Backlight Power Management Framework for Battery-Operated Multimedia Systems",
"doi": null,
"abstractUrl": "/magazine/dt/2004/05/d5388/13rRUxAATc2",
"parentPublication": {
"id": "mags/dt",
"title": "IEEE Design & Test of Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/08/01316898",
"title": "DLS: dynamic backlight luminance scaling of liquid crystal display",
"doi": null,
"abstractUrl": "/journal/si/2004/08/01316898/13rRUxjQyeG",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2014/02/ttc2014020335",
"title": "Dynamic Backlight Scaling Optimization: A Cloud-Based Energy-Saving Service for Mobile Streaming Applications",
"doi": null,
"abstractUrl": "/journal/tc/2014/02/ttc2014020335/13rRUyYSWkb",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09146716",
"title": "Volumetric Head-Mounted Display With Locally Adaptive Focal Blocks",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09146716/1lHjPSqVrpK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01715346",
"articleId": "13rRUB7a0YC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01715348",
"articleId": "13rRUxOdDah",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqESuig",
"title": "May/June",
"year": "2010",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWsN",
"doi": "10.1109/TVCG.2009.95",
"abstract": "We present the design and implementation of an optical see-through head-mounted display (HMD) with addressable focus cues utilizing a liquid lens. We implemented a monocular bench prototype capable of addressing the focal distance of the display from infinity to as close as 8 diopters. Two operation modes of the system were demonstrated: a vari-focal plane mode in which the accommodation cue is addressable, and a time-multiplexed multi-focal plane mode in which both the accommodation and retinal blur cues can be rendered. We further performed experiments to assess the depth perception and eye accommodative response of the system operated in a vari-focal plane mode. Both subjective and objective measurements suggest that the perceived depths and accommodative responses of the user match with the rendered depths of the virtual display with addressable accommodation cues, approximating the real-world 3-D viewing condition.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present the design and implementation of an optical see-through head-mounted display (HMD) with addressable focus cues utilizing a liquid lens. We implemented a monocular bench prototype capable of addressing the focal distance of the display from infinity to as close as 8 diopters. Two operation modes of the system were demonstrated: a vari-focal plane mode in which the accommodation cue is addressable, and a time-multiplexed multi-focal plane mode in which both the accommodation and retinal blur cues can be rendered. We further performed experiments to assess the depth perception and eye accommodative response of the system operated in a vari-focal plane mode. Both subjective and objective measurements suggest that the perceived depths and accommodative responses of the user match with the rendered depths of the virtual display with addressable accommodation cues, approximating the real-world 3-D viewing condition.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present the design and implementation of an optical see-through head-mounted display (HMD) with addressable focus cues utilizing a liquid lens. We implemented a monocular bench prototype capable of addressing the focal distance of the display from infinity to as close as 8 diopters. Two operation modes of the system were demonstrated: a vari-focal plane mode in which the accommodation cue is addressable, and a time-multiplexed multi-focal plane mode in which both the accommodation and retinal blur cues can be rendered. We further performed experiments to assess the depth perception and eye accommodative response of the system operated in a vari-focal plane mode. Both subjective and objective measurements suggest that the perceived depths and accommodative responses of the user match with the rendered depths of the virtual display with addressable accommodation cues, approximating the real-world 3-D viewing condition.",
"title": "A Novel Prototype for an Optical See-Through Head-Mounted Display with Addressable Focus Cues",
"normalizedTitle": "A Novel Prototype for an Optical See-Through Head-Mounted Display with Addressable Focus Cues",
"fno": "ttg2010030381",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Mixed And Augmented Reality",
"Focus Cues",
"Accommodation",
"Retinal Blur",
"Convergence",
"User Studies"
],
"authors": [
{
"givenName": "Sheng",
"surname": "Liu",
"fullName": "Sheng Liu",
"affiliation": "University of Arizona, Tucson",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong",
"surname": "Hua",
"fullName": "Hong Hua",
"affiliation": "University of Arizona, Tucson",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dewen",
"surname": "Cheng",
"fullName": "Dewen Cheng",
"affiliation": "University of Arizona, Tucson and Beijing Institute of Technology, Beijing",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2010-05-01 00:00:00",
"pubType": "trans",
"pages": "381-393",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vrais/1997/7843/0/78430138",
"title": "Factors influencing operator interaction with virtual objects viewed via head-mounted see-through displays: viewing conditions and rendering latency",
"doi": null,
"abstractUrl": "/proceedings-article/vrais/1997/78430138/12OmNBtCCGG",
"parentPublication": {
"id": "proceedings/vrais/1997/7843/0",
"title": "Virtual Reality Annual International Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/1995/7190/0/71900329",
"title": "Range segmentation using focus cues",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/1995/71900329/12OmNCmpcTg",
"parentPublication": {
"id": "proceedings/iscv/1995/7190/0",
"title": "Computer Vision, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2008/2840/0/04637321",
"title": "An optical see-through head mounted display with addressable focal planes",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2008/04637321/12OmNwe2IAw",
"parentPublication": {
"id": "proceedings/ismar/2008/2840/0",
"title": "2008 7th IEEE/ACM International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/01/ttp2011010101",
"title": "Multiperson Visual Focus of Attention from Head Pose and Meeting Contextual Cues",
"doi": null,
"abstractUrl": "/journal/tp/2011/01/ttp2011010101/13rRUwcAqrk",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1995/12/i1213",
"title": "Performance Analysis of Stereo, Vergence, and Focus as Depth Cues for Active Vision",
"doi": null,
"abstractUrl": "/journal/tp/1995/12/i1213/13rRUwcS1DZ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/07/07226865",
"title": "Resolving the Vergence-Accommodation Conflict in Head-Mounted Displays",
"doi": null,
"abstractUrl": "/journal/tg/2016/07/07226865/13rRUxASuhD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/05/09714124",
"title": "Video See-Through Mixed Reality with Focus Cues",
"doi": null,
"abstractUrl": "/journal/tg/2022/05/09714124/1B0XWyWo5KE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/05/10049728",
"title": "Off-Axis Layered Displays: Hybrid Direct-View/Near-Eye Mixed Reality with Focus Cues",
"doi": null,
"abstractUrl": "/journal/tg/2023/05/10049728/1KYotSK4YMM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010030369",
"articleId": "13rRUxjQybP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010030394",
"articleId": "13rRUypp57y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesZ3",
"name": "ttg2010030381s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010030381s.zip",
"extension": "zip",
"size": "9.37 kB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxDqSb2",
"doi": "10.1109/MCG.2017.4031064",
"abstract": "This article explores what it takes to make interactive computer graphics and VR attractive as a promotional vehicle, from the points of view of tourism agencies and the tourists themselves. The authors exploited current VR and human-machine interface (HMI) technologies to develop an interactive, innovative, and attractive user experience called the Multisensory Apulia Touristic Experience (MATE). The MATE system implements a natural gesture-based interface and multisensory stimuli, including visuals, audio, smells, and climate effects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article explores what it takes to make interactive computer graphics and VR attractive as a promotional vehicle, from the points of view of tourism agencies and the tourists themselves. The authors exploited current VR and human-machine interface (HMI) technologies to develop an interactive, innovative, and attractive user experience called the Multisensory Apulia Touristic Experience (MATE). The MATE system implements a natural gesture-based interface and multisensory stimuli, including visuals, audio, smells, and climate effects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article explores what it takes to make interactive computer graphics and VR attractive as a promotional vehicle, from the points of view of tourism agencies and the tourists themselves. The authors exploited current VR and human-machine interface (HMI) technologies to develop an interactive, innovative, and attractive user experience called the Multisensory Apulia Touristic Experience (MATE). The MATE system implements a natural gesture-based interface and multisensory stimuli, including visuals, audio, smells, and climate effects.",
"title": "Experiencing the Sights, Smells, Sounds, and Climate of Southern Italy in VR",
"normalizedTitle": "Experiencing the Sights, Smells, Sounds, and Climate of Southern Italy in VR",
"fno": "mcg2017060019",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computer Graphics",
"Travel Industry",
"Virtual Reality",
"Southern Italy",
"Interactive Computer Graphics",
"VR",
"Virtual Reality",
"Tourism Agencies",
"Tourism Appeal",
"Tourism Marketing",
"Three Dimensional Displays",
"Visualization",
"Meteorology",
"Videos",
"Olfactory",
"Virtual Environments",
"Mobile Communication",
"Man Machine Systems",
"User Interfaces",
"Computer Graphics",
"Multisensory Virtual Environment",
"Natural User Interfaces",
"Gesture Controls",
"Human Machine Interface"
],
"authors": [
{
"givenName": "Vito M.",
"surname": "Manghisi",
"fullName": "Vito M. Manghisi",
"affiliation": "Polytechnic University of Bari",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michele",
"surname": "Fiorentino",
"fullName": "Michele Fiorentino",
"affiliation": "Polytechnic University of Bari",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michele",
"surname": "Gattullo",
"fullName": "Michele Gattullo",
"affiliation": "Polytechnic University of Bari",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Antonio",
"surname": "Boccaccio",
"fullName": "Antonio Boccaccio",
"affiliation": "Polytechnic University of Bari",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vitoantonio",
"surname": "Bevilacqua",
"fullName": "Vitoantonio Bevilacqua",
"affiliation": "Polytechnic University of Bari",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Giuseppe L.",
"surname": "Cascella",
"fullName": "Giuseppe L. Cascella",
"affiliation": "Polytechnic University of Bari",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michele",
"surname": "Dassisti",
"fullName": "Michele Dassisti",
"affiliation": "Polytechnic University of Bari",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Antonio E.",
"surname": "Uva",
"fullName": "Antonio E. Uva",
"affiliation": "Polytechnic University of Bari",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2017-11-01 00:00:00",
"pubType": "mags",
"pages": "19-25",
"year": "2017",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2022/02/09143472",
"title": "Do Multisensory Stimuli Benefit the Virtual Reality Experience? A Systematic Review",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09143472/1lxmwwX05lC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2017060010",
"articleId": "13rRUx0xPyU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2017060026",
"articleId": "13rRUx0xPpu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1CpcG1DISYM",
"title": "May",
"year": "2022",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1B0Y2dBeUi4",
"doi": "10.1109/TVCG.2022.3150514",
"abstract": "Studies in virtual reality (VR) have introduced numerous multisensory simulation techniques for more immersive VR experiences. However, although they primarily focus on expanding sensory types or increasing individual sensory quality, they lack consensus in designing appropriate interactions between different sensory stimuli. This paper explores how the congruence between auditory and visual (AV) stimuli, which are the sensory stimuli typically provided by VR devices, affects the cognition and experience of VR users as a critical interaction factor in promoting multisensory integration. We defined the types of (in)congruence between AV stimuli, and then designed 12 virtual spaces with different types or degrees of congruence between AV stimuli. We then evaluated the presence, immersion, motion sickness, and cognition changes in each space. We observed the following key findings: 1) there is a limit to the degree of temporal or spatial incongruence that can be tolerated, with few negative effects on user experience until that point is exceeded; 2) users are tolerant of semantic incongruence; 3) a simulation that considers synesthetic congruence contributes to the user's sense of immersion and presence. Based on these insights, we identified the essential considerations for designing sensory simulations in VR and proposed future research directions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Studies in virtual reality (VR) have introduced numerous multisensory simulation techniques for more immersive VR experiences. However, although they primarily focus on expanding sensory types or increasing individual sensory quality, they lack consensus in designing appropriate interactions between different sensory stimuli. This paper explores how the congruence between auditory and visual (AV) stimuli, which are the sensory stimuli typically provided by VR devices, affects the cognition and experience of VR users as a critical interaction factor in promoting multisensory integration. We defined the types of (in)congruence between AV stimuli, and then designed 12 virtual spaces with different types or degrees of congruence between AV stimuli. We then evaluated the presence, immersion, motion sickness, and cognition changes in each space. We observed the following key findings: 1) there is a limit to the degree of temporal or spatial incongruence that can be tolerated, with few negative effects on user experience until that point is exceeded; 2) users are tolerant of semantic incongruence; 3) a simulation that considers synesthetic congruence contributes to the user's sense of immersion and presence. Based on these insights, we identified the essential considerations for designing sensory simulations in VR and proposed future research directions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Studies in virtual reality (VR) have introduced numerous multisensory simulation techniques for more immersive VR experiences. However, although they primarily focus on expanding sensory types or increasing individual sensory quality, they lack consensus in designing appropriate interactions between different sensory stimuli. This paper explores how the congruence between auditory and visual (AV) stimuli, which are the sensory stimuli typically provided by VR devices, affects the cognition and experience of VR users as a critical interaction factor in promoting multisensory integration. We defined the types of (in)congruence between AV stimuli, and then designed 12 virtual spaces with different types or degrees of congruence between AV stimuli. We then evaluated the presence, immersion, motion sickness, and cognition changes in each space. We observed the following key findings: 1) there is a limit to the degree of temporal or spatial incongruence that can be tolerated, with few negative effects on user experience until that point is exceeded; 2) users are tolerant of semantic incongruence; 3) a simulation that considers synesthetic congruence contributes to the user's sense of immersion and presence. Based on these insights, we identified the essential considerations for designing sensory simulations in VR and proposed future research directions.",
"title": "Studying the Effects of Congruence of Auditory and Visual Stimuli on Virtual Reality Experiences",
"normalizedTitle": "Studying the Effects of Congruence of Auditory and Visual Stimuli on Virtual Reality Experiences",
"fno": "09714043",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"User Experience",
"Solid Modeling",
"Psychology",
"Multisensory Integration",
"Semantics",
"Legged Locomotion",
"Virtual Reality",
"Sensory Simulation",
"Multisensory Integration",
"Congruence",
"User Experience"
],
"authors": [
{
"givenName": "Hayeon",
"surname": "Kim",
"fullName": "Hayeon Kim",
"affiliation": "Department of Computer Science, Yonsei University, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "In-Kwon",
"surname": "Lee",
"fullName": "In-Kwon Lee",
"affiliation": "Department of Computer Science, Yonsei University, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2022-05-01 00:00:00",
"pubType": "trans",
"pages": "2080-2090",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ngmast/2016/0949/0/07801465",
"title": "Immersive Virtual Reality as a Supplement in the Rehabilitation Program of Post-Stroke Patients",
"doi": null,
"abstractUrl": "/proceedings-article/ngmast/2016/07801465/12OmNrMZpyR",
"parentPublication": {
"id": "proceedings/ngmast/2016/0949/0",
"title": "2016 10th International Conference on Next-Generation Mobile Applications, Security and Technologies (NGMAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2017/06/msp2017060052",
"title": "An Exploration of the Effects of Sensory Stimuli on the Completion of Security Tasks",
"doi": null,
"abstractUrl": "/magazine/sp/2017/06/msp2017060052/13rRUyY2933",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/05/10049717",
"title": "Eating, Smelling, and Seeing: Investigating Multisensory Integration and (In)congruent Stimuli while Eating in VR",
"doi": null,
"abstractUrl": "/journal/tg/2023/05/10049717/1KYostbG9gY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10057483",
"title": "Studying the Influence of Multisensory Stimuli on a Firefighting Training Virtual Environment",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10057483/1LbFmZlZK24",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797744",
"title": "Effects of Stereoscopic Viewing and Haptic Feedback, Sensory-Motor Congruence and Calibration on Near-Field Fine Motor Perception-Action Coordination in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797744/1cJ1dKraais",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2019/3888/0/08925528",
"title": "Depression Detection from Electroencephalogram Signals Induced by Affective Auditory Stimuli",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2019/08925528/1fHGAqGFzP2",
"parentPublication": {
"id": "proceedings/acii/2019/3888/0",
"title": "2019 8th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089548",
"title": "The Impact of Multi-sensory Stimuli on Confidence Levels for Perceptual-cognitive Tasks in VR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089548/1jIxbiGNwCQ",
"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/vr/2020/5608/0/09089462",
"title": "VR Bridges: Simulating Smooth Uneven Surfaces in VR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089462/1jIxeZPD4LS",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09143472",
"title": "Do Multisensory Stimuli Benefit the Virtual Reality Experience? A Systematic Review",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09143472/1lxmwwX05lC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csde/2019/6303/0/09162347",
"title": "Bimodal ERP Study with Auditory-Visual Stimuli",
"doi": null,
"abstractUrl": "/proceedings-article/csde/2019/09162347/1m6hOpdfTVu",
"parentPublication": {
"id": "proceedings/csde/2019/6303/0",
"title": "2019 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09714052",
"articleId": "1B0Y1Tyx2PC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09714044",
"articleId": "1B0Y1js4l4Q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Cpd9ARu4uc",
"name": "ttg202205-09714043s1-supp1-3150514.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202205-09714043s1-supp1-3150514.mp4",
"extension": "mp4",
"size": "46.4 MB",
"__typename": "WebExtraType"
}
],
"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": "1bpYGVRBVYc",
"doi": "10.1109/TVCG.2019.2926978",
"abstract": "Multiple factors can affect presence in virtual environments, such as the number of human senses engaged in a given experience or the extent to which the virtual experience is credible. The purpose of the present work is to study how the inclusion of credible multisensory stimuli affects the sense of presence, namely, through the use of wind, passive haptics, vibration, and scent. Our sample consisted of 37 participants (27 men and 10 women) whose ages ranged from 17 to 44 years old and were mostly students. The participants were divided randomly into 3 groups: Control Scenario (visual and auditory - N = 12), Passive Haptic Scenario (visual, auditory, and passive haptic - N = 13) and Multisensory Scenario (visual, auditory, wind, passive haptic, vibration, and scent - N = 12). The results indicated a significant increase in the involvement subscale when all multisensory stimuli were delivered. We found a trend where the use of passive haptics by itself has a positive impact on presence, which should be the subject of further work.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multiple factors can affect presence in virtual environments, such as the number of human senses engaged in a given experience or the extent to which the virtual experience is credible. The purpose of the present work is to study how the inclusion of credible multisensory stimuli affects the sense of presence, namely, through the use of wind, passive haptics, vibration, and scent. Our sample consisted of 37 participants (27 men and 10 women) whose ages ranged from 17 to 44 years old and were mostly students. The participants were divided randomly into 3 groups: Control Scenario (visual and auditory - N = 12), Passive Haptic Scenario (visual, auditory, and passive haptic - N = 13) and Multisensory Scenario (visual, auditory, wind, passive haptic, vibration, and scent - N = 12). The results indicated a significant increase in the involvement subscale when all multisensory stimuli were delivered. We found a trend where the use of passive haptics by itself has a positive impact on presence, which should be the subject of further work.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multiple factors can affect presence in virtual environments, such as the number of human senses engaged in a given experience or the extent to which the virtual experience is credible. The purpose of the present work is to study how the inclusion of credible multisensory stimuli affects the sense of presence, namely, through the use of wind, passive haptics, vibration, and scent. Our sample consisted of 37 participants (27 men and 10 women) whose ages ranged from 17 to 44 years old and were mostly students. The participants were divided randomly into 3 groups: Control Scenario (visual and auditory - N = 12), Passive Haptic Scenario (visual, auditory, and passive haptic - N = 13) and Multisensory Scenario (visual, auditory, wind, passive haptic, vibration, and scent - N = 12). The results indicated a significant increase in the involvement subscale when all multisensory stimuli were delivered. We found a trend where the use of passive haptics by itself has a positive impact on presence, which should be the subject of further work.",
"title": "Impact of Different Sensory Stimuli on Presence in Credible Virtual Environments",
"normalizedTitle": "Impact of Different Sensory Stimuli on Presence in Credible Virtual Environments",
"fno": "08756096",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Haptic Interfaces",
"Virtual Reality",
"Credible Virtual Environments",
"Human Senses",
"Virtual Experience",
"Credible Multisensory Stimuli",
"Scent",
"Control Scenario",
"Passive Haptic Scenario",
"Vibration",
"Haptic Interfaces",
"Visualization",
"Virtual Environments",
"Vibrations",
"Games",
"Market Research",
"Olfactory",
"Virtual Reality",
"Multisensory",
"Presence",
"Immersion",
"Games",
"Passive Haptics"
],
"authors": [
{
"givenName": "Guilherme",
"surname": "Gonçalves",
"fullName": "Guilherme Gonçalves",
"affiliation": "UTAD - University of Trás-os-Montes e Alto Douro, Vila Real, Portugal",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miguel",
"surname": "Melo",
"fullName": "Miguel Melo",
"affiliation": "INESC TEC - Institute for Systems and Computer Engineering, Technology and Science, Porto, Portugal",
"__typename": "ArticleAuthorType"
},
{
"givenName": "José",
"surname": "Vasconcelos-Raposo",
"fullName": "José Vasconcelos-Raposo",
"affiliation": "INESC TEC - Institute for Systems and Computer Engineering, Technology and Science, Porto, Portugal",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maximino",
"surname": "Bessa",
"fullName": "Maximino Bessa",
"affiliation": "INESC TEC - Institute for Systems and Computer Engineering, Technology and Science, Porto, Portugal",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2020-11-01 00:00:00",
"pubType": "trans",
"pages": "3231-3240",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/aiccsa/2014/7100/0/07073274",
"title": "A study on the design and effectiveness of tactile feedback in driving simulator",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2014/07073274/12OmNCyBXk4",
"parentPublication": {
"id": "proceedings/aiccsa/2014/7100/0",
"title": "2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2014/3624/0/06798850",
"title": "A comparison of different methods for reducing the unintended positional drift accompanying walking-in-place locomotion",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2014/06798850/12OmNvCzFbu",
"parentPublication": {
"id": "proceedings/3dui/2014/3624/0",
"title": "2014 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2011/0039/0/05759467",
"title": "Effects of sensory feedback while interacting with graphical menus in virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2011/05759467/12OmNvoFjQv",
"parentPublication": {
"id": "proceedings/vr/2011/0039/0",
"title": "2011 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2015/9953/0/07344630",
"title": "Synestouch: Haptic + audio affective design for wearable devices",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2015/07344630/12OmNy5zsqA",
"parentPublication": {
"id": "proceedings/acii/2015/9953/0",
"title": "2015 International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2016/03/07412776",
"title": "Rhythmic Haptic Stimuli Improve Short-Term Attention",
"doi": null,
"abstractUrl": "/journal/th/2016/03/07412776/13rRUypp57L",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a824",
"title": "Touch the History in Virtuality: Combine Passive Haptic with 360° Videos in History Learning",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a824/1CJdh3RT5wQ",
"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/icmew/2022/7218/0/09859362",
"title": "Exploring Multisensory Feedback for Virtual Reality Relaxation",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2022/09859362/1G4F5nOkBNK",
"parentPublication": {
"id": "proceedings/icmew/2022/7218/0",
"title": "2022 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798330",
"title": "Virtual Crafting Experience: Hand Motion and Scent Stimulation in Conjunction with a Promotional Video for Improving Interest",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798330/1cJ0RQ6BbR6",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2019/4765/0/476500a042",
"title": "Smart Haproxy: A Novel Vibrotactile Feedback Prototype Combining Passive and Active Haptic in AR Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2019/476500a042/1gysov56h20",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2019/4765/0",
"title": "2019 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/02/09143472",
"title": "Do Multisensory Stimuli Benefit the Virtual Reality Experience? A Systematic Review",
"doi": null,
"abstractUrl": "/journal/tg/2022/02/09143472/1lxmwwX05lC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08723521",
"articleId": "1aqKS8oyU4U",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08730513",
"articleId": "1aAxbhCR94c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04J",
"title": "Nov.-Dec.",
"year": "2012",
"issueNum": "06",
"idPrefix": "ts",
"pubType": "journal",
"volume": "38",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYjKc3",
"doi": "10.1109/TSE.2011.109",
"abstract": "Software Product Line Engineering (SPLE) is a prominent paradigm for the assembly of a family of products using product line core assets. The modeling of software assets that together form the actual products is critical for achieving the strategic benefits of Software Product Lines (SPLs). We propose a feature-based approach to software asset modeling based on abstractions provided by Domain-Specific Kits (DSKs). This approach involves a software Asset Metamodel (AMM) used to derive Asset Modeling Languages (AMLs) that define reusable software assets in domain-specific terms. The approach also prescribes a roadmap for modeling these software assets in conjunction with the product line reference architecture. Asset capabilities can be modeled using feature diagrams as the external views of the software assets. Internal views can be expressed in terms of Domain-Specific Artifacts (DSAs) with Variability Points (VPs), where the domain-specific artifacts are created using Domain-Specific Kits. This approach produces loosely coupled and highly cohesive software assets that are reusable for multiple product lines. The approach is validated by assessing software asset reuse in two different product lines in the finance domain. We also evaluated the productivity gains in large-scale complex projects, and found that the approach yielded a significant reduction in the total project effort.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Software Product Line Engineering (SPLE) is a prominent paradigm for the assembly of a family of products using product line core assets. The modeling of software assets that together form the actual products is critical for achieving the strategic benefits of Software Product Lines (SPLs). We propose a feature-based approach to software asset modeling based on abstractions provided by Domain-Specific Kits (DSKs). This approach involves a software Asset Metamodel (AMM) used to derive Asset Modeling Languages (AMLs) that define reusable software assets in domain-specific terms. The approach also prescribes a roadmap for modeling these software assets in conjunction with the product line reference architecture. Asset capabilities can be modeled using feature diagrams as the external views of the software assets. Internal views can be expressed in terms of Domain-Specific Artifacts (DSAs) with Variability Points (VPs), where the domain-specific artifacts are created using Domain-Specific Kits. This approach produces loosely coupled and highly cohesive software assets that are reusable for multiple product lines. The approach is validated by assessing software asset reuse in two different product lines in the finance domain. We also evaluated the productivity gains in large-scale complex projects, and found that the approach yielded a significant reduction in the total project effort.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Software Product Line Engineering (SPLE) is a prominent paradigm for the assembly of a family of products using product line core assets. The modeling of software assets that together form the actual products is critical for achieving the strategic benefits of Software Product Lines (SPLs). We propose a feature-based approach to software asset modeling based on abstractions provided by Domain-Specific Kits (DSKs). This approach involves a software Asset Metamodel (AMM) used to derive Asset Modeling Languages (AMLs) that define reusable software assets in domain-specific terms. The approach also prescribes a roadmap for modeling these software assets in conjunction with the product line reference architecture. Asset capabilities can be modeled using feature diagrams as the external views of the software assets. Internal views can be expressed in terms of Domain-Specific Artifacts (DSAs) with Variability Points (VPs), where the domain-specific artifacts are created using Domain-Specific Kits. This approach produces loosely coupled and highly cohesive software assets that are reusable for multiple product lines. The approach is validated by assessing software asset reuse in two different product lines in the finance domain. We also evaluated the productivity gains in large-scale complex projects, and found that the approach yielded a significant reduction in the total project effort.",
"title": "Modeling Product Line Software Assets Using Domain-Specific Kits",
"normalizedTitle": "Modeling Product Line Software Assets Using Domain-Specific Kits",
"fno": "tts2012061376",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Software Reliability",
"Computer Architecture",
"Productivity",
"Programming",
"Complexity Theory",
"Systematics",
"Software Product Lines",
"Asset Modeling",
"Domain Specific Kits",
"Feature Models",
"Reuse",
"Software Asset"
],
"authors": [
{
"givenName": "N. Ilker",
"surname": "Altintas",
"fullName": "N. Ilker Altintas",
"affiliation": "Cybersoft Information Technologies, Istanbul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Semih",
"surname": "Cetin",
"fullName": "Semih Cetin",
"affiliation": "Cybersoft Information Technologies, Istanbul",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ali H.",
"surname": "Dogru",
"fullName": "Ali H. Dogru",
"affiliation": "Middle East Technical University, Ankara",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Halit",
"surname": "Oguztuzun",
"fullName": "Halit Oguztuzun",
"affiliation": "Middle East Technical University, Ankara",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2012-11-01 00:00:00",
"pubType": "trans",
"pages": "1376-1402",
"year": "2012",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/apsec/2005/2465/0/24650491",
"title": "A Systematic Method for Scoping Core Assets in Product Line Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2005/24650491/12OmNB9bvd1",
"parentPublication": {
"id": "proceedings/apsec/2005/2465/0",
"title": "12th Asia-Pacific Software Engineering Conference (APSEC'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wicsa/2008/3092/0/3092a267",
"title": "Understanding Architectural Assets",
"doi": null,
"abstractUrl": "/proceedings-article/wicsa/2008/3092a267/12OmNCfSqEG",
"parentPublication": {
"id": "proceedings/wicsa/2008/3092/0",
"title": "Software Architecture, Working IEEE/IFIP Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sose/2008/3499/0/3499a091",
"title": "A Representation Model for Reusable Assets to Support User Context",
"doi": null,
"abstractUrl": "/proceedings-article/sose/2008/3499a091/12OmNxFsmuw",
"parentPublication": {
"id": "proceedings/sose/2008/3499/0",
"title": "2008 IEEE International Symposium on Service-Oriented System Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ecbs/2000/0604/0/06040237",
"title": "PuLSE-I: Deriving Instances from a Product Line Infrastructure",
"doi": null,
"abstractUrl": "/proceedings-article/ecbs/2000/06040237/12OmNxveNMB",
"parentPublication": {
"id": "proceedings/ecbs/2000/0604/0",
"title": "Engineering of Computer-Based Systems, IEEE International Conference on the",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2011/4367/0/4367b082",
"title": "The Exploration of the Core Asset Library in the Software Product Line",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2011/4367b082/12OmNzhnaap",
"parentPublication": {
"id": "proceedings/itng/2011/4367/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2004/2245/0/22450092",
"title": "A Systematic Method to Instantiate Core Assets in Product Line Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2004/22450092/12OmNzwHvd3",
"parentPublication": {
"id": "proceedings/apsec/2004/2245/0",
"title": "11th Asia-Pacific Software Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcre/2005/2474/0/24740120",
"title": "Asset Recovery and Their Incorporation into Product Lines",
"doi": null,
"abstractUrl": "/proceedings-article/wcre/2005/24740120/12OmNzwHvoh",
"parentPublication": {
"id": "proceedings/wcre/2005/2474/0",
"title": "12th Working Conference on Reverse Engineering (WCRE'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2005/07/e0551",
"title": "An Approach to Developing Domain Requirements as a Core Asset Based on Commonality and Variability Analysis in a Product Line",
"doi": null,
"abstractUrl": "/journal/ts/2005/07/e0551/13rRUxBa5dw",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2009/04/mso2009040047",
"title": "Improving Domain-Specific Language Reuse with Software Product Line Techniques",
"doi": null,
"abstractUrl": "/magazine/so/2009/04/mso2009040047/13rRUygBwcG",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2010/03/mso2010030029",
"title": "Toward Compositional Software Product Lines",
"doi": null,
"abstractUrl": "/magazine/so/2010/03/mso2010030029/13rRUyogGyj",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tts2012061355",
"articleId": "13rRUwfZBWZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tts2012061403",
"articleId": "13rRUyeTVjL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvEQsdH",
"title": "April-June",
"year": "2003",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwh80H0",
"doi": "10.1109/TVCG.2003.10012",
"abstract": "Abstract—Most collision detection methods developed so far are based on geometrical object-space interference tests. While this remains the basic mode of investigation for geometric algorithms, the requirements for interactive rates and complex geometry predominate in commercial applications. In this article, we propose a new mode of collision detection based on an image-space approach. This approach breaks the object-space collision detection bottleneck by distributing the computational load onto the hardware graphics pipeline. The image-space approach, in conjuction with efficient bounding-box strategies in the object-space, has the potential to handle complex object interactions at interactive rates.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Most collision detection methods developed so far are based on geometrical object-space interference tests. While this remains the basic mode of investigation for geometric algorithms, the requirements for interactive rates and complex geometry predominate in commercial applications. In this article, we propose a new mode of collision detection based on an image-space approach. This approach breaks the object-space collision detection bottleneck by distributing the computational load onto the hardware graphics pipeline. The image-space approach, in conjuction with efficient bounding-box strategies in the object-space, has the potential to handle complex object interactions at interactive rates.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Most collision detection methods developed so far are based on geometrical object-space interference tests. While this remains the basic mode of investigation for geometric algorithms, the requirements for interactive rates and complex geometry predominate in commercial applications. In this article, we propose a new mode of collision detection based on an image-space approach. This approach breaks the object-space collision detection bottleneck by distributing the computational load onto the hardware graphics pipeline. The image-space approach, in conjuction with efficient bounding-box strategies in the object-space, has the potential to handle complex object interactions at interactive rates.",
"title": "Image-Based Techniques in a Hybrid Collision Detector",
"normalizedTitle": "Image-Based Techniques in a Hybrid Collision Detector",
"fno": "v0254",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Based Collision Detection",
"Object Interference",
"Motion Simulation"
],
"authors": [
{
"givenName": "George",
"surname": "Baciu",
"fullName": "George Baciu",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wingo S.K.",
"surname": "Wong",
"fullName": "Wingo S.K. Wong",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2003-04-01 00:00:00",
"pubType": "trans",
"pages": "254-271",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0241",
"articleId": "13rRUyYSWkT",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzA6GUk",
"title": "Aug.",
"year": "2012",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "34",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5t4",
"doi": "10.1109/TPAMI.2011.264",
"abstract": "This paper presents an effective approach for the offline recognition of unconstrained handwritten Chinese texts. Under the general integrated segmentation-and-recognition framework with character oversegmentation, we investigate three important issues: candidate path evaluation, path search, and parameter estimation. For path evaluation, we combine multiple contexts (character recognition scores, geometric and linguistic contexts) from the Bayesian decision view, and convert the classifier outputs to posterior probabilities via confidence transformation. In path search, we use a refined beam search algorithm to improve the search efficiency and, meanwhile, use a candidate character augmentation strategy to improve the recognition accuracy. The combining weights of the path evaluation function are optimized by supervised learning using a Maximum Character Accuracy criterion. We evaluated the recognition performance on a Chinese handwriting database CASIA-HWDB, which contains nearly four million character samples of 7,356 classes and 5,091 pages of unconstrained handwritten texts. The experimental results show that confidence transformation and combining multiple contexts improve the text line recognition performance significantly. On a test set of 1,015 handwritten pages, the proposed approach achieved character-level accurate rate of 90.75 percent and correct rate of 91.39 percent, which are superior by far to the best results reported in the literature.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents an effective approach for the offline recognition of unconstrained handwritten Chinese texts. Under the general integrated segmentation-and-recognition framework with character oversegmentation, we investigate three important issues: candidate path evaluation, path search, and parameter estimation. For path evaluation, we combine multiple contexts (character recognition scores, geometric and linguistic contexts) from the Bayesian decision view, and convert the classifier outputs to posterior probabilities via confidence transformation. In path search, we use a refined beam search algorithm to improve the search efficiency and, meanwhile, use a candidate character augmentation strategy to improve the recognition accuracy. The combining weights of the path evaluation function are optimized by supervised learning using a Maximum Character Accuracy criterion. We evaluated the recognition performance on a Chinese handwriting database CASIA-HWDB, which contains nearly four million character samples of 7,356 classes and 5,091 pages of unconstrained handwritten texts. The experimental results show that confidence transformation and combining multiple contexts improve the text line recognition performance significantly. On a test set of 1,015 handwritten pages, the proposed approach achieved character-level accurate rate of 90.75 percent and correct rate of 91.39 percent, which are superior by far to the best results reported in the literature.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents an effective approach for the offline recognition of unconstrained handwritten Chinese texts. Under the general integrated segmentation-and-recognition framework with character oversegmentation, we investigate three important issues: candidate path evaluation, path search, and parameter estimation. For path evaluation, we combine multiple contexts (character recognition scores, geometric and linguistic contexts) from the Bayesian decision view, and convert the classifier outputs to posterior probabilities via confidence transformation. In path search, we use a refined beam search algorithm to improve the search efficiency and, meanwhile, use a candidate character augmentation strategy to improve the recognition accuracy. The combining weights of the path evaluation function are optimized by supervised learning using a Maximum Character Accuracy criterion. We evaluated the recognition performance on a Chinese handwriting database CASIA-HWDB, which contains nearly four million character samples of 7,356 classes and 5,091 pages of unconstrained handwritten texts. The experimental results show that confidence transformation and combining multiple contexts improve the text line recognition performance significantly. On a test set of 1,015 handwritten pages, the proposed approach achieved character-level accurate rate of 90.75 percent and correct rate of 91.39 percent, which are superior by far to the best results reported in the literature.",
"title": "Handwritten Chinese Text Recognition by Integrating Multiple Contexts",
"normalizedTitle": "Handwritten Chinese Text Recognition by Integrating Multiple Contexts",
"fno": "06112767",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Text Analysis",
"Bayes Methods",
"Handwritten Character Recognition",
"Learning Artificial Intelligence",
"Natural Languages",
"Pattern Classification",
"Probability",
"Search Problems",
"Character Level Correct Rate",
"Handwritten Chinese Text Offline Recognition",
"Integrated Segmentation And Recognition Framework",
"Character Oversegmentation",
"Path Search",
"Parameter Estimation",
"Multiple Contexts",
"Character Recognition Scores",
"Geometric Contexts",
"Linguistic Contexts",
"Bayesian Decision",
"Classifier",
"Posterior Probabilities",
"Confidence Transformation",
"Beam Search Algorithm",
"Search Efficiency Improvement",
"Candidate Character Augmentation Strategy",
"Recognition Accuracy Improvement",
"Supervised Learning",
"Path Evaluation Function Optimization",
"Maximum Character Accuracy Criterion",
"Recognition Performance",
"Chinese Handwriting Database",
"CASIA HWDB",
"Unconstrained Handwritten Texts",
"Text Line Recognition Performance Improvement",
"Handwritten Pages",
"Character Level Accurate Rate",
"Character Recognition",
"Text Recognition",
"Context",
"Handwriting Recognition",
"Hidden Markov Models",
"Image Segmentation",
"Lattices",
"Maximum Character Accuracy Training",
"Handwritten Chinese Text Recognition",
"Confidence Transformation",
"Geometric Models",
"Language Models",
"Refined Beam Search",
"Candidate Character Augmentation"
],
"authors": [
{
"givenName": null,
"surname": "Fei Yin",
"fullName": "Fei Yin",
"affiliation": "Nat. Lab. of Pattern Recognition, Inst. of Autom., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Qiu-Feng Wang",
"fullName": "Qiu-Feng Wang",
"affiliation": "Nat. Lab. of Pattern Recognition, Inst. of Autom., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Cheng-Lin Liu",
"fullName": "Cheng-Lin Liu",
"affiliation": "Nat. Lab. of Pattern Recognition, Inst. of Autom., Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2012-08-01 00:00:00",
"pubType": "trans",
"pages": "1469-1481",
"year": "2012",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdar/2011/4520/0/4520a518",
"title": "Improving Handwritten Chinese Text Recognition by Confidence Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2011/4520a518/12OmNA0MZ2B",
"parentPublication": {
"id": "proceedings/icdar/2011/4520/0",
"title": "2011 International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/das/2012/4661/0/4661a110",
"title": "Improving Handwritten Chinese Text Recognition by Unsupervised Language Model Adaptation",
"doi": null,
"abstractUrl": "/proceedings-article/das/2012/4661a110/12OmNB9t6kA",
"parentPublication": {
"id": "proceedings/das/2012/4661/0",
"title": "Document Analysis Systems, IAPR International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2010/4221/0/4221a007",
"title": "Integrating Geometric Context for Text Alignment of Handwritten Chinese Documents",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2010/4221a007/12OmNBAIARi",
"parentPublication": {
"id": "proceedings/icfhr/2010/4221/0",
"title": "Frontiers in Handwriting Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725b111",
"title": "Comparative Study of Devnagari Handwritten Character Recognition Using Different Feature and Classifiers",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725b111/12OmNqNosaY",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725a763",
"title": "Character-SIFT: A Novel Feature for Offline Handwritten Chinese Character Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725a763/12OmNvTTckN",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2013/4999/0/06628631",
"title": "Sub-structure Learning Based Handwritten Chinese Text Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2013/06628631/12OmNwqx4a2",
"parentPublication": {
"id": "proceedings/icdar/2013/4999/0",
"title": "2013 12th International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccms/2010/3941/1/3941a110",
"title": "Semantic-Based Handwritten Chinese Character Recognition Model",
"doi": null,
"abstractUrl": "/proceedings-article/iccms/2010/3941a110/12OmNzWOBfm",
"parentPublication": {
"id": "proceedings/iccms/2010/3941/3",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460847",
"title": "String-level learning of confidence transformation for Chinese handwritten text recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460847/12OmNzmclus",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/10/ttp2013102413",
"title": "Handwritten Chinese/Japanese Text Recognition Using Semi-Markov Conditional Random Fields",
"doi": null,
"abstractUrl": "/journal/tp/2013/10/ttp2013102413/13rRUwInvgo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfhr/2020/9966/0/996600a157",
"title": "Weakly Supervised Learning for Over-Segmentation Based Handwritten Chinese Text Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icfhr/2020/996600a157/1p2VuT8dt5u",
"parentPublication": {
"id": "proceedings/icfhr/2020/9966/0",
"title": "2020 17th International Conference on Frontiers in Handwriting Recognition (ICFHR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06109274",
"articleId": "13rRUx0PqqJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06104060",
"articleId": "13rRUwjXZKO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK8",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBrGh0",
"doi": "10.1109/TVCG.2014.2346660",
"abstract": "Multi-class classifiers often compute scores for the classification samples describing probabilities to belong to different classes. In order to improve the performance of such classifiers, machine learning experts need to analyze classification results for a large number of labeled samples to find possible reasons for incorrect classification. Confusion matrices are widely used for this purpose. However, they provide no information about classification scores and features computed for the samples. We propose a set of integrated visual methods for analyzing the performance of probabilistic classifiers. Our methods provide insight into different aspects of the classification results for a large number of samples. One visualization emphasizes at which probabilities these samples were classified and how these probabilities correlate with classification error in terms of false positives and false negatives. Another view emphasizes the features of these samples and ranks them by their separation power between selected true and false classifications. We demonstrate the insight gained using our technique in a benchmarking classification dataset, and show how it enables improving classification performance by interactively defining and evaluating post-classification rules.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multi-class classifiers often compute scores for the classification samples describing probabilities to belong to different classes. In order to improve the performance of such classifiers, machine learning experts need to analyze classification results for a large number of labeled samples to find possible reasons for incorrect classification. Confusion matrices are widely used for this purpose. However, they provide no information about classification scores and features computed for the samples. We propose a set of integrated visual methods for analyzing the performance of probabilistic classifiers. Our methods provide insight into different aspects of the classification results for a large number of samples. One visualization emphasizes at which probabilities these samples were classified and how these probabilities correlate with classification error in terms of false positives and false negatives. Another view emphasizes the features of these samples and ranks them by their separation power between selected true and false classifications. We demonstrate the insight gained using our technique in a benchmarking classification dataset, and show how it enables improving classification performance by interactively defining and evaluating post-classification rules.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multi-class classifiers often compute scores for the classification samples describing probabilities to belong to different classes. In order to improve the performance of such classifiers, machine learning experts need to analyze classification results for a large number of labeled samples to find possible reasons for incorrect classification. Confusion matrices are widely used for this purpose. However, they provide no information about classification scores and features computed for the samples. We propose a set of integrated visual methods for analyzing the performance of probabilistic classifiers. Our methods provide insight into different aspects of the classification results for a large number of samples. One visualization emphasizes at which probabilities these samples were classified and how these probabilities correlate with classification error in terms of false positives and false negatives. Another view emphasizes the features of these samples and ranks them by their separation power between selected true and false classifications. We demonstrate the insight gained using our technique in a benchmarking classification dataset, and show how it enables improving classification performance by interactively defining and evaluating post-classification rules.",
"title": "Visual Methods for Analyzing Probabilistic Classification Data",
"normalizedTitle": "Visual Methods for Analyzing Probabilistic Classification Data",
"fno": "06875957",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Histograms",
"Probability",
"Probabilistic Logic",
"Data Visualization",
"Image Color Analysis",
"Electric Breakdown",
"Visual Inspection",
"Probabilistic Classification",
"Confusion Analysis",
"Feature Evaluation And Selection"
],
"authors": [
{
"givenName": "Bilal",
"surname": "Alsallakh",
"fullName": "Bilal Alsallakh",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Allan",
"surname": "Hanbury",
"fullName": "Allan Hanbury",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helwig",
"surname": "Hauser",
"fullName": "Helwig Hauser",
"affiliation": ", University of Bergen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Silvia",
"surname": "Miksch",
"fullName": "Silvia Miksch",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andreas",
"surname": "Rauber",
"fullName": "Andreas Rauber",
"affiliation": ", Vienna University of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "1703-1712",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdmw/2016/5910/0/07836782",
"title": "Ensemble of Heterogeneous Classifiers for Improving Automated Tweet Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836782/12OmNBa2iFk",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019308",
"title": "An extended probabilistic collaborative representation based classifier for image classification",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019308/12OmNxE2n1R",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851c950",
"title": "A Probabilistic Collaborative Representation Based Approach for Pattern Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851c950/12OmNxj23c2",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cenics/2009/3832/0/3832a105",
"title": "Multiparameter Electronics Systems Control Probabilistic Evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/cenics/2009/3832a105/12OmNySG3Vb",
"parentPublication": {
"id": "proceedings/cenics/2009/3832/0",
"title": "Advances in Circuits, Electronics and Micro-electronics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2001/1272/1/127210058",
"title": "LDA/SVM Driven Nearest Neighbor Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2001/127210058/12OmNyrIaJX",
"parentPublication": {
"id": "proceedings/cvpr/2001/1272/1",
"title": "Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2015/0016/0/0016a246",
"title": "Probabilistic Fuzzy Naive Bayes",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2015/0016a246/12OmNzDeheG",
"parentPublication": {
"id": "proceedings/bracis/2015/0016/0",
"title": "2015 Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2016/5473/0/07837860",
"title": "Binary Classifier Calibration Using an Ensemble of Near Isotonic Regression Models",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07837860/12OmNzd7bxA",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258374",
"title": "A comparison of classification models for natural disaster and critical event detection from news",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258374/17D45WwsQ6D",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300j953",
"title": "Analyzing the Variety Loss in the Context of Probabilistic Trajectory Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300j953/1hQqlzHGOgo",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300d722",
"title": "Diversity With Cooperation: Ensemble Methods for Few-Shot Classification",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300d722/1hQqm2MIQuc",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875958",
"articleId": "13rRUxZ0o1C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875974",
"articleId": "13rRUB6Sq0A",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRME",
"name": "ttg201412-06875957s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06875957s1.zip",
"extension": "zip",
"size": "26 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCbCrUN",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZ0o1A",
"doi": "10.1109/TVCG.2013.206",
"abstract": "Time-oriented data play an essential role in many Visual Analytics scenarios such as extracting medical insights from collections of electronic health records or identifying emerging problems and vulnerabilities in network traffic. However, many software libraries for Visual Analytics treat time as a flat numerical data type and insufficiently tackle the complexity of the time domain such as calendar granularities and intervals. Therefore, developers of advanced Visual Analytics designs need to implement temporal foundations in their application code over and over again. We present TimeBench, a software library that provides foundational data structures and algorithms for time-oriented data in Visual Analytics. Its expressiveness and developer accessibility have been evaluated through application examples demonstrating a variety of challenges with time-oriented data and long-term developer studies conducted in the scope of research and student projects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Time-oriented data play an essential role in many Visual Analytics scenarios such as extracting medical insights from collections of electronic health records or identifying emerging problems and vulnerabilities in network traffic. However, many software libraries for Visual Analytics treat time as a flat numerical data type and insufficiently tackle the complexity of the time domain such as calendar granularities and intervals. Therefore, developers of advanced Visual Analytics designs need to implement temporal foundations in their application code over and over again. We present TimeBench, a software library that provides foundational data structures and algorithms for time-oriented data in Visual Analytics. Its expressiveness and developer accessibility have been evaluated through application examples demonstrating a variety of challenges with time-oriented data and long-term developer studies conducted in the scope of research and student projects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Time-oriented data play an essential role in many Visual Analytics scenarios such as extracting medical insights from collections of electronic health records or identifying emerging problems and vulnerabilities in network traffic. However, many software libraries for Visual Analytics treat time as a flat numerical data type and insufficiently tackle the complexity of the time domain such as calendar granularities and intervals. Therefore, developers of advanced Visual Analytics designs need to implement temporal foundations in their application code over and over again. We present TimeBench, a software library that provides foundational data structures and algorithms for time-oriented data in Visual Analytics. Its expressiveness and developer accessibility have been evaluated through application examples demonstrating a variety of challenges with time-oriented data and long-term developer studies conducted in the scope of research and student projects.",
"title": "TimeBench: A Data Model and Software Library for Visual Analytics of Time-Oriented Data",
"normalizedTitle": "TimeBench: A Data Model and Software Library for Visual Analytics of Time-Oriented Data",
"fno": "ttg2013122247",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visual Analytics",
"Data Models",
"Data Structures",
"Data Visualization",
"Time Domain Analysis",
"Time",
"Visual Analytics",
"Data Models",
"Data Structures",
"Data Visualization",
"Time Domain Analysis",
"Temporal Data",
"Visual Analytics",
"Information Visualization",
"Toolkits",
"Software Infrastructure"
],
"authors": [
{
"givenName": "Alexander",
"surname": "Rind",
"fullName": "Alexander Rind",
"affiliation": "Inst. of Software Technol. & Interactive Syst., Vienna Univ. of Technol., Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim",
"surname": "Lammarsch",
"fullName": "Tim Lammarsch",
"affiliation": "Inst. of Software Technol. & Interactive Syst., Vienna Univ. of Technol., Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wolfgang",
"surname": "Aigner",
"fullName": "Wolfgang Aigner",
"affiliation": "Inst. of Software Technol. & Interactive Syst., Vienna Univ. of Technol., Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bilal",
"surname": "Alsallakh",
"fullName": "Bilal Alsallakh",
"affiliation": "Inst. of Software Technol. & Interactive Syst., Vienna Univ. of Technol., Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Silvia",
"surname": "Miksch",
"fullName": "Silvia Miksch",
"affiliation": "Inst. of Software Technol. & Interactive Syst., Vienna Univ. of Technol., Vienna, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2247-2256",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2014/6227/0/07042498",
"title": "TimeGraph: A data management framework for visual analytics of large multivariate time-oriented networks",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042498/12OmNBlXs3i",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400514",
"title": "Big data exploration through visual analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400514/12OmNC3XhwY",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042477",
"title": "Feature-driven visual analytics of soccer data",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042477/12OmNxcMSiK",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc/2016/4297/0/07828556",
"title": "Agile Visual Analytics in Data Science Systems",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc/2016/07828556/12OmNyPQ4Qw",
"parentPublication": {
"id": "proceedings/hpcc/2016/4297/0",
"title": "2016 IEEE 18th International Conference on High-Performance Computing and Communications, IEEE 14th International Conference on Smart City, and IEEE 2nd International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a352",
"title": "Visualization for Visual Analytics: Micro-visualization, Abstraction, and Physical Appeal",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a352/12OmNySG3Oy",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2012/4925/0/4925a894",
"title": "Cubix: A Visual Analytics Tool for Conceptual and Semantic Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a894/12OmNz5JCf2",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/06/mcg2015060069",
"title": "Visual Analytics for MOOC Data",
"doi": null,
"abstractUrl": "/magazine/cg/2015/06/mcg2015060069/13rRUwInvMP",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/08/mco2013080090",
"title": "Bixplorer: Visual Analytics with Biclusters",
"doi": null,
"abstractUrl": "/magazine/co/2013/08/mco2013080090/13rRUwcAqvs",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/02/mcg2009020084",
"title": "Demystifying Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2009/02/mcg2009020084/13rRUy3gn3z",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vahc/2019/2423/0/08945032",
"title": "Towards a Structural Framework for Explicit Domain Knowledge in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2019/08945032/1grQj8QowOA",
"parentPublication": {
"id": "proceedings/vahc/2019/2423/0",
"title": "2019 IEEE Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122237",
"articleId": "13rRUxAAT0R",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122257",
"articleId": "13rRUwInuWu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRUv",
"name": "ttg2013122247s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122247s.mp4",
"extension": "mp4",
"size": "5.66 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.