data
dict |
|---|
{
"issue": {
"id": "12OmNwudQUo",
"title": "March",
"year": "2017",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIIVlkm",
"doi": "10.1109/TVCG.2016.2638546",
"abstract": "The papers in this special section were presented at the 14th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2015), which was held in Los Angeles, California on August 7-9, 2015.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The papers in this special section were presented at the 14th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2015), which was held in Los Angeles, California on August 7-9, 2015.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The papers in this special section were presented at the 14th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2015), which was held in Los Angeles, California on August 7-9, 2015.",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"normalizedTitle": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"fno": "07835799",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Special Issues And Sections",
"Meetings",
"Animation",
"Computer Graphics"
],
"authors": [
{
"givenName": "Florence",
"surname": "Bertails-Descoubes",
"fullName": "Florence Bertails-Descoubes",
"affiliation": "Inria RhôneAlpes, 655 avenue de l'Europe, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stelian",
"surname": "Coros",
"fullName": "Stelian Coros",
"affiliation": "Robotics Institute at Carnegie Mellon University, Pittsburgh, Pennsylvania 15213",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2017-03-01 00:00:00",
"pubType": "trans",
"pages": "1165-1166",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2012/03/ttg2012030354",
"title": "Guest Editors' Introduction: Special Section on ACM VRST",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030354/13rRUILLkvn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/10/07557101",
"title": "Guest Editor's Introduction to the Special Section on the ACM Symposium on Interactive 3D Graphics and Games (I3D)",
"doi": null,
"abstractUrl": "/journal/tg/2016/10/07557101/13rRUwbaqUQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/ttg2012060837",
"title": "Guest Editor's Introduction: Special Section on the Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/ttg2012060837/13rRUwdrdSy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/01/ttg2014010002",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010002/13rRUwfZC0h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/04/07064835",
"title": "Message from the VR Program Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2015/04/07064835/13rRUwh80uB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/12/ttp2013122819",
"title": "TPAMI CVPR Special Section",
"doi": null,
"abstractUrl": "/journal/tp/2013/12/ttp2013122819/13rRUwjXZKQ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050721",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D 2012)",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050721/13rRUxBa5rV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/10/07230338",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2015/10/07230338/13rRUxOve9L",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/10/06881790",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/10/06881790/13rRUy0HYRq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/02/08329161",
"title": "Guest Editorial for the 14th Asia Pacific Bioinformatics Conference",
"doi": null,
"abstractUrl": "/journal/tb/2018/02/08329161/13rRUzp02mT",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07835796",
"articleId": "13rRUxYIMV5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07742381",
"articleId": "13rRUxC0SvZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBcj5DU",
"title": "July",
"year": "1986",
"issueNum": "07",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "6",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvMt",
"doi": "10.1109/MCG.1986.276826",
"abstract": "Provides notice of upcoming conference events of interest to practitioners and researchers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Provides notice of upcoming conference events of interest to practitioners and researchers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Provides notice of upcoming conference events of interest to practitioners and researchers.",
"title": "ACM SIGGRAPH 86",
"normalizedTitle": "ACM SIGGRAPH 86",
"fno": "04056952",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "07",
"pubDate": "1986-07-01 00:00:00",
"pubType": "mags",
"pages": "80d",
"year": "1986",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "MCG-v6-n7-21",
"articleId": "13rRUwbs22T",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyv7moM",
"title": "Jan.",
"year": "2014",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfZC0h",
"doi": "10.1109/TVCG.2014.3",
"abstract": "This special section presents expanded versions of three of the best papers from the 11th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2012), which was held in Lausanne, Switzerland, from 29-31 July 2012. SCA has established itself as the premier conference dedicated specifically to innovations in the software and technology of computer animation. SCA 2012 received 80 submissions and each submission was reviewed by at least three members of the international program committee. After a thorough online discussion, the 72-member international program committee decided on the 27 full papers and nine short presentation papers accepted for the final program. Out of 27 full papers, the symposium's Best Papers Award Committee selected one best paper, two runner-ups, and four honorable mentions. The selection was informed by the original reviews and the conference presentations. We are delighted to present three out of the six very best papers of SCA 2012 invited for this special section. Each of the invited papers contains a minimum of 30 percent new material and received at least three reviews, including one reviewer not among the original SCA reviewers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This special section presents expanded versions of three of the best papers from the 11th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2012), which was held in Lausanne, Switzerland, from 29-31 July 2012. SCA has established itself as the premier conference dedicated specifically to innovations in the software and technology of computer animation. SCA 2012 received 80 submissions and each submission was reviewed by at least three members of the international program committee. After a thorough online discussion, the 72-member international program committee decided on the 27 full papers and nine short presentation papers accepted for the final program. Out of 27 full papers, the symposium's Best Papers Award Committee selected one best paper, two runner-ups, and four honorable mentions. The selection was informed by the original reviews and the conference presentations. We are delighted to present three out of the six very best papers of SCA 2012 invited for this special section. Each of the invited papers contains a minimum of 30 percent new material and received at least three reviews, including one reviewer not among the original SCA reviewers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This special section presents expanded versions of three of the best papers from the 11th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2012), which was held in Lausanne, Switzerland, from 29-31 July 2012. SCA has established itself as the premier conference dedicated specifically to innovations in the software and technology of computer animation. SCA 2012 received 80 submissions and each submission was reviewed by at least three members of the international program committee. After a thorough online discussion, the 72-member international program committee decided on the 27 full papers and nine short presentation papers accepted for the final program. Out of 27 full papers, the symposium's Best Papers Award Committee selected one best paper, two runner-ups, and four honorable mentions. The selection was informed by the original reviews and the conference presentations. We are delighted to present three out of the six very best papers of SCA 2012 invited for this special section. Each of the invited papers contains a minimum of 30 percent new material and received at least three reviews, including one reviewer not among the original SCA reviewers.",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"normalizedTitle": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"fno": "ttg2014010002",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Special Issues And Sections",
"Meetings",
"Computer Graphics",
"Visualization"
],
"authors": [
{
"givenName": "Paul G.",
"surname": "Kry",
"fullName": "Paul G. Kry",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jehee",
"surname": "Lee",
"fullName": "Jehee Lee",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2014-01-01 00:00:00",
"pubType": "trans",
"pages": "2-3",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2013/05/ttb2013051089",
"title": "Guest Editorial for ACM BCB",
"doi": null,
"abstractUrl": "/journal/tb/2013/05/ttb2013051089/13rRUEgs2Af",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/03/07835799",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2017/03/07835799/13rRUIIVlkm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/06/ttb2013061345",
"title": "Guest Editors' introduction to the special section on bioinformatics research and applications",
"doi": null,
"abstractUrl": "/journal/tb/2013/06/ttb2013061345/13rRUILLku4",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060898",
"title": "Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium 2012",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060898/13rRUNvgziD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/01/ttg2011010001",
"title": "Guest Editor's Introduction Special Section on the Virtual Reality Conference (VR)",
"doi": null,
"abstractUrl": "/journal/tg/2011/01/ttg2011010001/13rRUwIF6l4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/06/06807545",
"title": "Guest Editor's Introduction: Special Section on the International Symposium on Mixed and Augmented Reality 2012",
"doi": null,
"abstractUrl": "/journal/tg/2014/06/06807545/13rRUwhHcQT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2013/08/ttm2013081470",
"title": "Guest Editorial: Special Section on Outstanding Papers from MobiSys 2012",
"doi": null,
"abstractUrl": "/journal/tm/2013/08/ttm2013081470/13rRUxAATh6",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050721",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D 2012)",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050721/13rRUxBa5rV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/10/07230338",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2015/10/07230338/13rRUxOve9L",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/10/06881790",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/10/06881790/13rRUy0HYRq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2014010001",
"articleId": "13rRUEgarsI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2014010004",
"articleId": "13rRUxcbnCr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzvhvFS",
"title": "May",
"year": "2013",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5rV",
"doi": "10.1109/TVCG.2013.64",
"abstract": "The papers in this special section includes extended versions of four of the best papers presented at the 2012 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games held from 9-11 March 2012 in Costa Mesa, California.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The papers in this special section includes extended versions of four of the best papers presented at the 2012 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games held from 9-11 March 2012 in Costa Mesa, California.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The papers in this special section includes extended versions of four of the best papers presented at the 2012 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games held from 9-11 March 2012 in Costa Mesa, California.",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D 2012)",
"normalizedTitle": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D 2012)",
"fno": "ttg2013050721",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Special Issues And Sections",
"Meetings",
"Computer Graphics",
"Three Dimensional Displays",
"Interactive Systems"
],
"authors": [
{
"givenName": "Michael",
"surname": "Garland",
"fullName": "Michael Garland",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rui",
"surname": "Wang",
"fullName": "Rui Wang",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "05",
"pubDate": "2013-05-01 00:00:00",
"pubType": "trans",
"pages": "721-722",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2013/05/ttb2013051089",
"title": "Guest Editorial for ACM BCB",
"doi": null,
"abstractUrl": "/journal/tb/2013/05/ttb2013051089/13rRUEgs2Af",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/04/ttb2013040817",
"title": "Guest Editorial for Special Section on BSB 2012",
"doi": null,
"abstractUrl": "/journal/tb/2013/04/ttb2013040817/13rRUIIVlaV",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/03/07835799",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2017/03/07835799/13rRUIIVlkm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060898",
"title": "Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium 2012",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060898/13rRUNvgziD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/08/07138667",
"title": "Guest Editors’ Introduction: Special Section on the IEEE Pacific Visualization Symposium 2014",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/07138667/13rRUwI5Ugf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/01/ttg2014010002",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010002/13rRUwfZC0h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2013/08/ttm2013081470",
"title": "Guest Editorial: Special Section on Outstanding Papers from MobiSys 2012",
"doi": null,
"abstractUrl": "/journal/tm/2013/08/ttm2013081470/13rRUxAATh6",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/10/07230338",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2015/10/07230338/13rRUxOve9L",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2014/01/ttm2014010003",
"title": "Guest Editorial: Special section on outstanding papers from MobiCom 2012",
"doi": null,
"abstractUrl": "/journal/tm/2014/01/ttm2014010003/13rRUxZ0o27",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/10/06881790",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/10/06881790/13rRUy0HYRq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "ttg2013050723",
"articleId": "13rRUxBa5bY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvvc5Ol",
"title": "September",
"year": "1982",
"issueNum": "07",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "2",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5zt",
"doi": "10.1109/MCG.1982.1674400",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Eurographics'82",
"normalizedTitle": "Eurographics'82",
"fno": "mcg1982070030",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "07",
"pubDate": "1982-07-01 00:00:00",
"pubType": "mags",
"pages": "30",
"year": "1982",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg1982070023",
"articleId": "13rRUwjXZLT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1982070033",
"articleId": "13rRUNvyan5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCfAPxN",
"title": "September/October",
"year": "1989",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "9",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SGn",
"doi": "10.1109/MCG.1989.10028",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Siggraph",
"normalizedTitle": "Siggraph",
"fno": "mcg1989050014",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "1989-09-01 00:00:00",
"pubType": "mags",
"pages": "14-15, 89-91",
"year": "1989",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg1989050008",
"articleId": "13rRUyoPSRk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1989050016",
"articleId": "13rRUIJcWo7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx4Q6DL",
"title": "Oct.",
"year": "2017",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SWd",
"doi": "10.1109/TVCG.2017.2738478",
"abstract": null,
"abstracts": [],
"normalizedAbstract": null,
"title": "Introduction to the Special Section on the ACM/Eurographics Symposium on Computer Animation 2016",
"normalizedTitle": "Introduction to the Special Section on the ACM/Eurographics Symposium on Computer Animation 2016",
"fno": "08023920",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Miguel",
"surname": "Otaduy",
"fullName": "Miguel Otaduy",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "10",
"pubDate": "2017-10-01 00:00:00",
"pubType": "trans",
"pages": "2207",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/sp/2017/03/msp2017030070",
"title": "ACM CCS 2016 Interviews, Part 2",
"doi": null,
"abstractUrl": "/magazine/sp/2017/03/msp2017030070/13rRUEgarri",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/03/07835799",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2017/03/07835799/13rRUIIVlkm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/ttg2012060837",
"title": "Guest Editor's Introduction: Special Section on the Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/ttg2012060837/13rRUwdrdSy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/01/ttg2014010002",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010002/13rRUwfZC0h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2017/02/msp2017020088",
"title": "ACM CCS 2016 Interviews, Part 1",
"doi": null,
"abstractUrl": "/magazine/sp/2017/02/msp2017020088/13rRUxAASRu",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/ttg2012081189",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/ttg2012081189/13rRUxBa5xg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/10/07230338",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2015/10/07230338/13rRUxOve9L",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2017/04/msp2017040058",
"title": "ACM CCS 2016 Interview, Part 3",
"doi": null,
"abstractUrl": "/magazine/sp/2017/04/msp2017040058/13rRUxjQyfK",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/10/06881790",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/10/06881790/13rRUy0HYRq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/01/ttg2012010003",
"title": "Guest Editor's Introduction: Special Section on the Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)",
"doi": null,
"abstractUrl": "/journal/tg/2012/01/ttg2012010003/13rRUyYSWsQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "07987773",
"articleId": "13rRUIM2VBL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAGepWJ",
"title": "Oct.",
"year": "2015",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOve9L",
"doi": "10.1109/TVCG.2015.2461771",
"abstract": "The papers in this special issue were presented at the 13th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2014), which was held in Copenhagen, Denmark from 21-23 July 2014. ",
"abstracts": [
{
"abstractType": "Regular",
"content": "The papers in this special issue were presented at the 13th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2014), which was held in Copenhagen, Denmark from 21-23 July 2014. ",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The papers in this special issue were presented at the 13th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2014), which was held in Copenhagen, Denmark from 21-23 July 2014. ",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"normalizedTitle": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"fno": "07230338",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Special Issues And Sections",
"Meetings",
"Computer Graphics",
"Visualization"
],
"authors": [
{
"givenName": "Eftychios",
"surname": "Sifakis",
"fullName": "Eftychios Sifakis",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vladlen",
"surname": "Koltun",
"fullName": "Vladlen Koltun",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "10",
"pubDate": "2015-10-01 00:00:00",
"pubType": "trans",
"pages": "1101-1102",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2015/05/07293248",
"title": "Guest Editorial for Special Section on ISB/TBC 2014",
"doi": null,
"abstractUrl": "/journal/tb/2015/05/07293248/13rRUEgs2Kl",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/03/07835799",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2017/03/07835799/13rRUIIVlkm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030354",
"title": "Guest Editors' Introduction: Special Section on ACM VRST",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030354/13rRUILLkvn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/08/07138667",
"title": "Guest Editors’ Introduction: Special Section on the IEEE Pacific Visualization Symposium 2014",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/07138667/13rRUwI5Ugf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2016/01/07401238",
"title": "Guest Editorial for Special Section on the 10th International Conference on Intelligent Computing (ICIC)",
"doi": null,
"abstractUrl": "/journal/tb/2016/01/07401238/13rRUwInvrD",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/ttg2012060837",
"title": "Guest Editor's Introduction: Special Section on the Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/ttg2012060837/13rRUwdrdSy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/01/ttg2014010002",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010002/13rRUwfZC0h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050721",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D 2012)",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050721/13rRUxBa5rV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/07/07484393",
"title": "Guest Editorial: Special Section on CVPR 2014",
"doi": null,
"abstractUrl": "/journal/tp/2016/07/07484393/13rRUxDItis",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/10/06881790",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/10/06881790/13rRUy0HYRq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "07164346",
"articleId": "13rRUzpzeB6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvEyR70",
"title": "Oct.",
"year": "2014",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0HYRq",
"doi": "10.1109/TVCG.2014.2321713",
"abstract": "The papers in this special section present expanded versions of three of the best papers from the 12th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA), which was held in Anaheim, CA from July 19 to 21, 2013. Now in its dozenth year, SCA has become firmly established as the premiere forum for innovations in the software and technology of computer animation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The papers in this special section present expanded versions of three of the best papers from the 12th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA), which was held in Anaheim, CA from July 19 to 21, 2013. Now in its dozenth year, SCA has become firmly established as the premiere forum for innovations in the software and technology of computer animation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The papers in this special section present expanded versions of three of the best papers from the 12th Annual ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA), which was held in Anaheim, CA from July 19 to 21, 2013. Now in its dozenth year, SCA has become firmly established as the premiere forum for innovations in the software and technology of computer animation.",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"normalizedTitle": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"fno": "06881790",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Special Issues And Sections",
"Meetings",
"Animation",
"Computer Graphics",
"Computer Applications"
],
"authors": [
{
"givenName": "Theodore",
"surname": "Kim",
"fullName": "Theodore Kim",
"affiliation": "Media Arts & Technology Program, University of California, 3309 Phelps Hall, Santa Barbara, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Summer",
"fullName": "Robert Summer",
"affiliation": ", Disney Research Zurich, Stampfenbachstrasse 48, 8006 Zurich, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "10",
"pubDate": "2014-10-01 00:00:00",
"pubType": "trans",
"pages": "1344",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tb/2013/05/ttb2013051089",
"title": "Guest Editorial for ACM BCB",
"doi": null,
"abstractUrl": "/journal/tb/2013/05/ttb2013051089/13rRUEgs2Af",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/03/07835799",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2017/03/07835799/13rRUIIVlkm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030354",
"title": "Guest Editors' Introduction: Special Section on ACM VRST",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030354/13rRUILLkvn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060898",
"title": "Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium 2012",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060898/13rRUNvgziD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/08/07138667",
"title": "Guest Editors’ Introduction: Special Section on the IEEE Pacific Visualization Symposium 2014",
"doi": null,
"abstractUrl": "/journal/tg/2015/08/07138667/13rRUwI5Ugf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/01/ttg2014010002",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010002/13rRUwfZC0h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/12/ttp2013122819",
"title": "TPAMI CVPR Special Section",
"doi": null,
"abstractUrl": "/journal/tp/2013/12/ttp2013122819/13rRUwjXZKQ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050721",
"title": "Guest Editors' Introduction: Special Section on the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D 2012)",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050721/13rRUxBa5rV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/10/07230338",
"title": "Guest Editor's Introduction: Special Section on the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA)",
"doi": null,
"abstractUrl": "/journal/tg/2015/10/07230338/13rRUxOve9L",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/03/tth2010030153",
"title": "Guest Editorial for World Haptics Spotlight Section",
"doi": null,
"abstractUrl": "/journal/th/2010/03/tth2010030153/13rRUy0HYRB",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "06781622",
"articleId": "13rRUxBa5rY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC36tSf",
"title": "Aug.",
"year": "2013",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPi8",
"doi": "10.1109/TVCG.2012.323",
"abstract": "Many 2D visual spaces have a virtually one-dimensional nature with very high aspect ratio between the dimensions: examples include time-series data, multimedia data such as sound or video, text documents, and bipartite graphs. Common among these is that the space can become very large, e.g., temperature measurements could span a long time period, surveillance video could cover entire days or weeks, and documents can have thousands of pages. Many analysis tasks for such spaces require several foci while retaining context and distance awareness. In this extended version of our IEEE PacificVis 2010 paper, we introduce a method for supporting this kind of multifocus interaction that we call stack zooming. The approach is based on building hierarchies of 1D strips stacked on top of each other, where each subsequent stack represents a higher zoom level, and sibling strips represent branches in the exploration. Correlation graphics show the relation between stacks and strips of different levels, providing context and distance awareness for the foci. The zoom hierarchies can also be used as graphical histories and for communicating insights to stakeholders and can be further extended with annotation and integrated statistics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many 2D visual spaces have a virtually one-dimensional nature with very high aspect ratio between the dimensions: examples include time-series data, multimedia data such as sound or video, text documents, and bipartite graphs. Common among these is that the space can become very large, e.g., temperature measurements could span a long time period, surveillance video could cover entire days or weeks, and documents can have thousands of pages. Many analysis tasks for such spaces require several foci while retaining context and distance awareness. In this extended version of our IEEE PacificVis 2010 paper, we introduce a method for supporting this kind of multifocus interaction that we call stack zooming. The approach is based on building hierarchies of 1D strips stacked on top of each other, where each subsequent stack represents a higher zoom level, and sibling strips represent branches in the exploration. Correlation graphics show the relation between stacks and strips of different levels, providing context and distance awareness for the foci. The zoom hierarchies can also be used as graphical histories and for communicating insights to stakeholders and can be further extended with annotation and integrated statistics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many 2D visual spaces have a virtually one-dimensional nature with very high aspect ratio between the dimensions: examples include time-series data, multimedia data such as sound or video, text documents, and bipartite graphs. Common among these is that the space can become very large, e.g., temperature measurements could span a long time period, surveillance video could cover entire days or weeks, and documents can have thousands of pages. Many analysis tasks for such spaces require several foci while retaining context and distance awareness. In this extended version of our IEEE PacificVis 2010 paper, we introduce a method for supporting this kind of multifocus interaction that we call stack zooming. The approach is based on building hierarchies of 1D strips stacked on top of each other, where each subsequent stack represents a higher zoom level, and sibling strips represent branches in the exploration. Correlation graphics show the relation between stacks and strips of different levels, providing context and distance awareness for the foci. The zoom hierarchies can also be used as graphical histories and for communicating insights to stakeholders and can be further extended with annotation and integrated statistics.",
"title": "Stack Zooming for Multifocus Interaction in Skewed-Aspect Visual Spaces",
"normalizedTitle": "Stack Zooming for Multifocus Interaction in Skewed-Aspect Visual Spaces",
"fno": "ttg2013081362",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Strips",
"Context",
"Layout",
"Navigation",
"Nonlinear Distortion",
"Vegetation",
"Interaction",
"Multifocus Interaction",
"Temporal Data",
"Comparative Visualization",
"Visual Exploration",
"Visual Analytics"
],
"authors": [
{
"givenName": "W.",
"surname": "Javed",
"fullName": "W. Javed",
"affiliation": "Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "N.",
"surname": "Elmqvist",
"fullName": "N. Elmqvist",
"affiliation": "Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2013-08-01 00:00:00",
"pubType": "trans",
"pages": "1362-1374",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900008",
"title": "Elastic Hierarchies: Combining Treemaps and Node-Link Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900008/12OmNAOKnSi",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/1995/7201/0/72010074",
"title": "Research report: Interacting with huge hierarchies: beyond cone trees",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/1995/72010074/12OmNxvwoSg",
"parentPublication": {
"id": "proceedings/ieee-infovis/1995/7201/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429613",
"title": "Stack zooming for multi-focus interaction in time-series data visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429613/12OmNyRg4yL",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122023",
"title": "Visualization of Temporal Similarity in Field Data",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122023/13rRUNvyath",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/05963661",
"title": "Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/05963661/13rRUxYIMUX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2022/2335/0/233500a166",
"title": "Hierarchical Multifocus Navigation in Text Annotation Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2022/233500a166/1E2wlHCyLkY",
"parentPublication": {
"id": "proceedings/pacificvis/2022/2335/0",
"title": "2022 IEEE 15th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a001",
"title": "Exploring D3 Implementation Challenges on Stack Overflow",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a001/1J6h6awUbbG",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013081354",
"articleId": "13rRUNvgz9N",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013081375",
"articleId": "13rRUxC0SWa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBcj5E9",
"title": "January/February",
"year": "2006",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzp02oc",
"doi": "10.1109/TVCG.2006.16",
"abstract": "Abstract—The contour tree has been used to compute the topology of isosurfaces, generate a minimal seed set for accelerated isosurface extraction, and provide a user interface to segment individual contour components in a scalar field. In this paper, we extend the benefits of the contour tree to time-varying data visualization. We define temporal correspondence of contour components and describe an algorithm to compute the correspondence information in time-dependent contour trees. A graph representing the topology changes of time-varying isosurfaces is constructed in real-time for any selected isovalue using the precomputed correspondence information. Quantitative properties, such as surface area and volume of contour components, are computed and labeled on the graph. This topology change graph helps users to detect significant topological and geometric changes in time-varying isosurfaces. The graph is also used as an interactive user interface to segment, track, and visualize the evolution of any selected contour components over time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The contour tree has been used to compute the topology of isosurfaces, generate a minimal seed set for accelerated isosurface extraction, and provide a user interface to segment individual contour components in a scalar field. In this paper, we extend the benefits of the contour tree to time-varying data visualization. We define temporal correspondence of contour components and describe an algorithm to compute the correspondence information in time-dependent contour trees. A graph representing the topology changes of time-varying isosurfaces is constructed in real-time for any selected isovalue using the precomputed correspondence information. Quantitative properties, such as surface area and volume of contour components, are computed and labeled on the graph. This topology change graph helps users to detect significant topological and geometric changes in time-varying isosurfaces. The graph is also used as an interactive user interface to segment, track, and visualize the evolution of any selected contour components over time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The contour tree has been used to compute the topology of isosurfaces, generate a minimal seed set for accelerated isosurface extraction, and provide a user interface to segment individual contour components in a scalar field. In this paper, we extend the benefits of the contour tree to time-varying data visualization. We define temporal correspondence of contour components and describe an algorithm to compute the correspondence information in time-dependent contour trees. A graph representing the topology changes of time-varying isosurfaces is constructed in real-time for any selected isovalue using the precomputed correspondence information. Quantitative properties, such as surface area and volume of contour components, are computed and labeled on the graph. This topology change graph helps users to detect significant topological and geometric changes in time-varying isosurfaces. The graph is also used as an interactive user interface to segment, track, and visualize the evolution of any selected contour components over time.",
"title": "Time-Varying Contour Topology",
"normalizedTitle": "Time-Varying Contour Topology",
"fno": "v0014",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Contour Tree",
"Level Set Topology",
"Feature Tracking",
"Time Varying Volume Visualization"
],
"authors": [
{
"givenName": "Bong-Soo",
"surname": "Sohn",
"fullName": "Bong-Soo Sohn",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chandrajit",
"surname": "Bajaj",
"fullName": "Chandrajit Bajaj",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2006-01-01 00:00:00",
"pubType": "trans",
"pages": "14-25",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2010/4109/0/4109c796",
"title": "Length Increasing Active Contour for the Segmentation of Small Blood Vessels",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109c796/12OmNBOUxjT",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2009/3920/0/3920a033",
"title": "Contour Extraction of Drosophila Embryos",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2009/3920a033/12OmNrHB1SK",
"parentPublication": {
"id": "proceedings/ictai/2009/3920/0",
"title": "2009 21st IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2010/7029/0/05543585",
"title": "Structural correspondence as a contour grouping problem",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2010/05543585/12OmNwAt1Dh",
"parentPublication": {
"id": "proceedings/cvprw/2010/7029/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2009/3852/0/3852a070",
"title": "A Hybrid Tracking Method Based on Active Contour and Mean Shift Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2009/3852a070/12OmNxEjY95",
"parentPublication": {
"id": "proceedings/icinis/2009/3852/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/430P3C02",
"title": "Contour-based recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/430P3C02/12OmNyqzM0A",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061481",
"title": "Automatic Transfer Function Generation Using Contour Tree Controlled Residue Flow Model and Color Harmonics",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061481/13rRUEgarBm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/11/ttg2011111599",
"title": "Drawing Contour Trees in the Plane",
"doi": null,
"abstractUrl": "/journal/tg/2011/11/ttg2011111599/13rRUwbs2go",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061185",
"title": "Applying Manifold Learning to Plotting Approximate Contour Trees",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061185/13rRUwdIOUE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020249",
"title": "Computing Reeb Graphs as a Union of Contour Trees",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020249/13rRUxDqS8h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/02/04069241",
"title": "Topology-Controlled Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2007/02/04069241/13rRUytF41s",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0002",
"articleId": "13rRUy2YLYl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0026",
"articleId": "13rRUyYjK59",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrJRP1V",
"title": "August",
"year": "2001",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "23",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxwd",
"doi": "10.1109/34.946984",
"abstract": "Abstract—This paper presents a hybrid evolutionary search method based on clusters (HESC). The method is specifically designed to enhance the search efficiency while alleviating the problem of premature convergence inherent in standard evolutionary search methods (SES). It involves the simultaneous evolution of a main species and an additional fast mutating species. A hybrid search method which includes a local parallel single agent search and a global multiagent evolutionary search is carried out for the main species. Effective utilization of the search history is achieved with the clustering and training of a fuzzy ART neural network (ART NN) during the search. The advantages of HESC include 1) guaranteed population diversity at each generation, 2) effective integration of local search for the exploitation of important regions and the global search for the exploration of the entire space, and 3) fast exploration ability of the fast mutating species and migration from the additional species to the main species. Those advantages have been confirmed with experiments in which hard optimization problems were successfully solved with HESC.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper presents a hybrid evolutionary search method based on clusters (HESC). The method is specifically designed to enhance the search efficiency while alleviating the problem of premature convergence inherent in standard evolutionary search methods (SES). It involves the simultaneous evolution of a main species and an additional fast mutating species. A hybrid search method which includes a local parallel single agent search and a global multiagent evolutionary search is carried out for the main species. Effective utilization of the search history is achieved with the clustering and training of a fuzzy ART neural network (ART NN) during the search. The advantages of HESC include 1) guaranteed population diversity at each generation, 2) effective integration of local search for the exploitation of important regions and the global search for the exploration of the entire space, and 3) fast exploration ability of the fast mutating species and migration from the additional species to the main species. Those advantages have been confirmed with experiments in which hard optimization problems were successfully solved with HESC.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper presents a hybrid evolutionary search method based on clusters (HESC). The method is specifically designed to enhance the search efficiency while alleviating the problem of premature convergence inherent in standard evolutionary search methods (SES). It involves the simultaneous evolution of a main species and an additional fast mutating species. A hybrid search method which includes a local parallel single agent search and a global multiagent evolutionary search is carried out for the main species. Effective utilization of the search history is achieved with the clustering and training of a fuzzy ART neural network (ART NN) during the search. The advantages of HESC include 1) guaranteed population diversity at each generation, 2) effective integration of local search for the exploitation of important regions and the global search for the exploration of the entire space, and 3) fast exploration ability of the fast mutating species and migration from the additional species to the main species. Those advantages have been confirmed with experiments in which hard optimization problems were successfully solved with HESC.",
"title": "Hybrid Evolutionary Search Method Based on Clusters",
"normalizedTitle": "Hybrid Evolutionary Search Method Based on Clusters",
"fno": "i0786",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Evolutionary Computation",
"ART Neural Network",
"Prematurity",
"Cluster",
"Optimization"
],
"authors": [
{
"givenName": "Ming",
"surname": "Li",
"fullName": "Ming Li",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hon-Yuen",
"surname": "Tam",
"fullName": "Hon-Yuen Tam",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2001-08-01 00:00:00",
"pubType": "trans",
"pages": "786-799",
"year": "2001",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0785",
"articleId": "13rRUyfKIIW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0800",
"articleId": "13rRUwj7cq4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx57HSr",
"title": "September/October",
"year": "2006",
"issueNum": "05",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "8",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwkfAUs",
"doi": "10.1109/MCSE.2006.83",
"abstract": "This article proposes a practical approach for simulating the phenomenon of water waves on 3D mesh surfaces. First of all, the geodesic distance map, which will govern the movement of water waves in the simulation, is computed on a given mesh surface. Based on the geodesic distance map, we then simulate the water waves on 3D surfaces using a sinusoidal wave model with damping. Our computing method for the geodesic distance map can process the scenario with multiple sources. Together with the method for superposing multiple water waves, the water waves with various sources can be simulated on the surface of a given mesh model. To demonstrate the performance of our approach, example animations are generated at the end of the paper--all can be updated in an interactive frame rate.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article proposes a practical approach for simulating the phenomenon of water waves on 3D mesh surfaces. First of all, the geodesic distance map, which will govern the movement of water waves in the simulation, is computed on a given mesh surface. Based on the geodesic distance map, we then simulate the water waves on 3D surfaces using a sinusoidal wave model with damping. Our computing method for the geodesic distance map can process the scenario with multiple sources. Together with the method for superposing multiple water waves, the water waves with various sources can be simulated on the surface of a given mesh model. To demonstrate the performance of our approach, example animations are generated at the end of the paper--all can be updated in an interactive frame rate.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article proposes a practical approach for simulating the phenomenon of water waves on 3D mesh surfaces. First of all, the geodesic distance map, which will govern the movement of water waves in the simulation, is computed on a given mesh surface. Based on the geodesic distance map, we then simulate the water waves on 3D surfaces using a sinusoidal wave model with damping. Our computing method for the geodesic distance map can process the scenario with multiple sources. Together with the method for superposing multiple water waves, the water waves with various sources can be simulated on the surface of a given mesh model. To demonstrate the performance of our approach, example animations are generated at the end of the paper--all can be updated in an interactive frame rate.",
"title": "Water Wave Animation on Mesh Surfaces",
"normalizedTitle": "Water Wave Animation on Mesh Surfaces",
"fno": "c5081",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Water Wave",
"Geodesic Distance Map",
"Mesh Surface",
"Multiple Sources"
],
"authors": [
{
"givenName": "Shengjun",
"surname": "Liu",
"fullName": "Shengjun Liu",
"affiliation": "Zhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaogang",
"surname": "Jin",
"fullName": "Xiaogang Jin",
"affiliation": "Zhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charlie C. L.",
"surname": "Wang",
"fullName": "Charlie C. L. Wang",
"affiliation": "Zhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jim X.",
"surname": "Chen",
"fullName": "Jim X. Chen",
"affiliation": "George Mason University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "mags",
"pages": "81-87",
"year": "2006",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgi/2001/1007/0/10070073",
"title": "Water Animation with Disturbance Model",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2001/10070073/12OmNAolGSf",
"parentPublication": {
"id": "proceedings/cgi/2001/1007/0",
"title": "Proceedings. Computer Graphics International 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2006/9753/0/04042375",
"title": "Diffusion Geodesic Path: A Common Feature for Automatic Image-Map Registration",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2006/04042375/12OmNAs2trN",
"parentPublication": {
"id": "proceedings/isspit/2006/9753/0",
"title": "2006 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2011/4621/0/4621a109",
"title": "Realtime Video Based Water Surface Approximation",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2011/4621a109/12OmNscxj23",
"parentPublication": {
"id": "proceedings/cvmp/2011/4621/0",
"title": "2011 Conference for Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2011/4483/0/4483a039",
"title": "Isotropic Mesh Simplification by Evolving the Geodesic Delaunay Triangulation",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2011/4483a039/12OmNwwd2VI",
"parentPublication": {
"id": "proceedings/isvd/2011/4483/0",
"title": "2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995428",
"title": "A two-stage reconstruction approach for seeing through water",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995428/12OmNxveNH4",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2010/4047/2/4047b117",
"title": "Research on Simulation of Water Waves Combined with Illumination Model",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2010/4047b117/12OmNxwnckC",
"parentPublication": {
"id": "proceedings/icic/2010/4047/1",
"title": "2010 Third International Conference on Information and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ghtc/2011/4595/0/4595a287",
"title": "Ocean Wave Energy-Driven Desalination Systems for Off-grid Coastal Communities in Developing Countries",
"doi": null,
"abstractUrl": "/proceedings-article/ghtc/2011/4595a287/12OmNyUWQYp",
"parentPublication": {
"id": "proceedings/ghtc/2011/4595/0",
"title": "IEEE Global Humanitarian Technology Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/2/3118b875",
"title": "Relative Power Percentage and Time-Power Percentages Map Analysis of Electrogastrogram Slow Waves",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118b875/12OmNzC5Tdx",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/2",
"title": "BioMedical Engineering and Informatics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/05999663",
"title": "A Deformable Surface Model for Real-Time Water Drop Animation",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/05999663/13rRUyY28Ys",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/03/08301570",
"title": "A Skinned Tetrahedral Mesh for Hair Animation and Hair-Water Interaction",
"doi": null,
"abstractUrl": "/journal/tg/2019/03/08301570/17D45W9KVHk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "c5070",
"articleId": "13rRUxYIN80",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "c5088",
"articleId": "13rRUxASulp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1I6Nvxq2hxe",
"title": "Dec.",
"year": "2022",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xSHN8Dq0HS",
"doi": "10.1109/TPAMI.2021.3121963",
"abstract": "In this paper, we introduce a novel method for reconstructing surface normals and depth of dynamic objects in water. Past shape recovery methods have leveraged various visual cues for estimating shape (e.g., depth) or surface normals. Methods that estimate both compute one from the other. We show that these two geometric surface properties can be simultaneously recovered for each pixel when the object is observed underwater. Our key idea is to leverage multi-wavelength near-infrared light absorption along different underwater light paths in conjunction with surface shading. Our method can handle both Lambertian and non-Lambertian surfaces. We derive a principled theory for this surface normals and shape from water method and a practical calibration method for determining its imaging parameters values. By construction, the method can be implemented as a one-shot imaging system. We prototype both an off-line and a video-rate imaging system and demonstrate the effectiveness of the method on a number of real-world static and dynamic objects. The results show that the method can recover intricate surface features that are otherwise inaccessible.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we introduce a novel method for reconstructing surface normals and depth of dynamic objects in water. Past shape recovery methods have leveraged various visual cues for estimating shape (e.g., depth) or surface normals. Methods that estimate both compute one from the other. We show that these two geometric surface properties can be simultaneously recovered for each pixel when the object is observed underwater. Our key idea is to leverage multi-wavelength near-infrared light absorption along different underwater light paths in conjunction with surface shading. Our method can handle both Lambertian and non-Lambertian surfaces. We derive a principled theory for this surface normals and shape from water method and a practical calibration method for determining its imaging parameters values. By construction, the method can be implemented as a one-shot imaging system. We prototype both an off-line and a video-rate imaging system and demonstrate the effectiveness of the method on a number of real-world static and dynamic objects. The results show that the method can recover intricate surface features that are otherwise inaccessible.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we introduce a novel method for reconstructing surface normals and depth of dynamic objects in water. Past shape recovery methods have leveraged various visual cues for estimating shape (e.g., depth) or surface normals. Methods that estimate both compute one from the other. We show that these two geometric surface properties can be simultaneously recovered for each pixel when the object is observed underwater. Our key idea is to leverage multi-wavelength near-infrared light absorption along different underwater light paths in conjunction with surface shading. Our method can handle both Lambertian and non-Lambertian surfaces. We derive a principled theory for this surface normals and shape from water method and a practical calibration method for determining its imaging parameters values. By construction, the method can be implemented as a one-shot imaging system. We prototype both an off-line and a video-rate imaging system and demonstrate the effectiveness of the method on a number of real-world static and dynamic objects. The results show that the method can recover intricate surface features that are otherwise inaccessible.",
"title": "Surface Normals and Shape From Water",
"normalizedTitle": "Surface Normals and Shape From Water",
"fno": "09583771",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Calibration",
"Computer Vision",
"Image Reconstruction",
"Shape Recognition",
"Stereo Image Processing",
"Underwater Optics",
"3 D Geometry Reconstruction",
"Calibration Method",
"Dynamic Objects",
"Geometric Surface Properties",
"Imaging Parameters",
"Multiwavelength Near Infrared Light Absorption",
"Non Lambertian Surfaces",
"One Shot Imaging System",
"Shape Estimation",
"Shape Recovery",
"Static Object",
"Surface Features",
"Surface Normal Reconstruction",
"Surface Shading",
"Underwater Light Path",
"Video Rate Imaging System",
"Visual Cues",
"Water Method",
"Surface Reconstruction",
"Shape",
"Three Dimensional Displays",
"Absorption",
"Light Sources",
"Surface Waves",
"Water Resources",
"Computational Photography",
"Underwater Reconstruction",
"Near Infrared Light",
"Absorption"
],
"authors": [
{
"givenName": "Meng-Yu Jennifer",
"surname": "Kuo",
"fullName": "Meng-Yu Jennifer Kuo",
"affiliation": "Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Satoshi",
"surname": "Murai",
"fullName": "Satoshi Murai",
"affiliation": "Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ryo",
"surname": "Kawahara",
"fullName": "Ryo Kawahara",
"affiliation": "Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shohei",
"surname": "Nobuhara",
"fullName": "Shohei Nobuhara",
"affiliation": "Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ko",
"surname": "Nishino",
"fullName": "Ko Nishino",
"affiliation": "Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, Kyoto, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "9150-9162",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2017/0733/0/0733b735",
"title": "Surface Normal Reconstruction from Specular Information in Light Field Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733b735/12OmNAP1YZr",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2012/4829/0/4829a336",
"title": "Computing Gender Difference Using Fisher-Rao Metric from Facial Surface Normals",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2012/4829a336/12OmNvIxeY0",
"parentPublication": {
"id": "proceedings/sibgrapi/2012/4829/0",
"title": "2012 25th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2011/4369/0/4369a188",
"title": "An Approach for Shape from Surface Normals with Local Discontinuity Detection",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2011/4369a188/12OmNx9WT2p",
"parentPublication": {
"id": "proceedings/3dimpvt/2011/4369/0",
"title": "2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459381",
"title": "Attached shadow coding: Estimating surface normals from shadows under unknown reflectance and lighting conditions",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459381/12OmNylsZWO",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032b566",
"title": "Surface Normals in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032b566/12OmNyrZLAX",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118070",
"title": "Shape from shading via the fusion of specular and Lambertian image components",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118070/12OmNzUxO6U",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1983/06/04767454",
"title": "Error Analysis of Surface Normals Determined by Radiometry",
"doi": null,
"abstractUrl": "/journal/tp/1983/06/04767454/13rRUxbTMzO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300h829",
"title": "Surface Normals and Shape From Water",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h829/1hVlrmTFlcs",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09403910",
"title": "Surface Normals and Light Directions From Shading and Polarization",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09403910/1sLH9jSRKKc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/07/09416180",
"title": "Non-Rigid Shape From Water",
"doi": null,
"abstractUrl": "/journal/tp/2021/07/09416180/1t7gXuQkMj6",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09661330",
"articleId": "1zzl3nsBrHO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09625763",
"articleId": "1yLTnG9Uisw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzwpU9K",
"title": "Nov.",
"year": "2014",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5Uga",
"doi": "10.1109/TVCG.2014.2339835",
"abstract": "This paper presents a computational framework for modelling the biomechanics of human facial expressions. A detailed high-order (Cubic-Hermite) finite element model of the human head was constructed using anatomical data segmented from magnetic resonance images. The model includes a superficial soft-tissue continuum consisting of skin, the subcutaneous layer and the superficial Musculo-Aponeurotic system. Embedded within this continuum mesh, are 20 pairs of facial muscles which drive facial expressions. These muscles were treated as transversely-isotropic and their anatomical geometries and fibre orientations were accurately depicted. In order to capture the relative composition of muscles and fat, material heterogeneity was also introduced into the model. Complex contact interactions between the lips, eyelids, and between superficial soft tissue continuum and deep rigid skeletal bones were also computed. In addition, this paper investigates the impact of incorporating material heterogeneity and contact interactions, which are often neglected in similar studies. Four facial expressions were simulated using the developed model and the results were compared with surface data obtained from a 3D structured-light scanner. Predicted expressions showed good agreement with the experimental data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a computational framework for modelling the biomechanics of human facial expressions. A detailed high-order (Cubic-Hermite) finite element model of the human head was constructed using anatomical data segmented from magnetic resonance images. The model includes a superficial soft-tissue continuum consisting of skin, the subcutaneous layer and the superficial Musculo-Aponeurotic system. Embedded within this continuum mesh, are 20 pairs of facial muscles which drive facial expressions. These muscles were treated as transversely-isotropic and their anatomical geometries and fibre orientations were accurately depicted. In order to capture the relative composition of muscles and fat, material heterogeneity was also introduced into the model. Complex contact interactions between the lips, eyelids, and between superficial soft tissue continuum and deep rigid skeletal bones were also computed. In addition, this paper investigates the impact of incorporating material heterogeneity and contact interactions, which are often neglected in similar studies. Four facial expressions were simulated using the developed model and the results were compared with surface data obtained from a 3D structured-light scanner. Predicted expressions showed good agreement with the experimental data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a computational framework for modelling the biomechanics of human facial expressions. A detailed high-order (Cubic-Hermite) finite element model of the human head was constructed using anatomical data segmented from magnetic resonance images. The model includes a superficial soft-tissue continuum consisting of skin, the subcutaneous layer and the superficial Musculo-Aponeurotic system. Embedded within this continuum mesh, are 20 pairs of facial muscles which drive facial expressions. These muscles were treated as transversely-isotropic and their anatomical geometries and fibre orientations were accurately depicted. In order to capture the relative composition of muscles and fat, material heterogeneity was also introduced into the model. Complex contact interactions between the lips, eyelids, and between superficial soft tissue continuum and deep rigid skeletal bones were also computed. In addition, this paper investigates the impact of incorporating material heterogeneity and contact interactions, which are often neglected in similar studies. Four facial expressions were simulated using the developed model and the results were compared with surface data obtained from a 3D structured-light scanner. Predicted expressions showed good agreement with the experimental data.",
"title": "Generating Facial Expressions Using an Anatomically Accurate Biomechanical Model",
"normalizedTitle": "Generating Facial Expressions Using an Anatomically Accurate Biomechanical Model",
"fno": "06872553",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Muscles",
"Biological Tissues",
"Biological System Modeling",
"Skin",
"Face",
"Materials",
"Computational Modeling",
"Muscle Driven Model",
"Facial Animation",
"Anatomical Facial Geometry",
"Finite Deformation Elasticity"
],
"authors": [
{
"givenName": "Tim",
"surname": "Wu",
"fullName": "Tim Wu",
"affiliation": ", Auckland Bioengineering Institute, Auckland, New Zealand",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alice",
"surname": "Hung",
"fullName": "Alice Hung",
"affiliation": ", Auckland Bioengineering Institute, Auckland, New Zealand",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kumar",
"surname": "Mithraratne",
"fullName": "Kumar Mithraratne",
"affiliation": ", Auckland Bioengineering Institute, Auckland, New Zealand",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2014-11-01 00:00:00",
"pubType": "trans",
"pages": "1519-1529",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2017/1034/0/1034c810",
"title": "Towards Automated Recognition of Facial Expressions in Animal Models",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c810/12OmNCzb9xl",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2016/1437/0/1437b452",
"title": "Extended DISFA Dataset: Investigating Posed and Spontaneous Facial Expressions",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437b452/12OmNrYlmDm",
"parentPublication": {
"id": "proceedings/cvprw/2016/1437/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2008/2570/0/04607595",
"title": "Muscle-driven modeling of wrinkles for 3D facial expressions",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607595/12OmNrkjVeg",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1994/6240/0/00324007",
"title": "Modeling of vascular expressions in facial animation",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1994/00324007/12OmNwK7o9I",
"parentPublication": {
"id": "proceedings/ca/1994/6240/0",
"title": "Proceedings of Computer Animation '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/2001/7237/0/00982372",
"title": "Analysis and synthesis of facial expressions with hand-generated muscle actuation basis",
"doi": null,
"abstractUrl": "/proceedings-article/ca/2001/00982372/12OmNwcUk1f",
"parentPublication": {
"id": "proceedings/ca/2001/7237/0",
"title": "Proceedings Computer Animation 2001. Fourteenth Conference on Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/2001/7237/0/00982390",
"title": "Interactive modeling of the human musculature",
"doi": null,
"abstractUrl": "/proceedings-article/ca/2001/00982390/12OmNxRF74d",
"parentPublication": {
"id": "proceedings/ca/2001/7237/0",
"title": "Proceedings Computer Animation 2001. Fourteenth Conference on Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733c259",
"title": "DyadGAN: Generating Facial Expressions in Dyadic Interactions",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733c259/12OmNxveNUc",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2018/02/07547933",
"title": "Virtual Character Facial Expressions Influence Human Brain and Facial EMG Activity in a Decision-Making Game",
"doi": null,
"abstractUrl": "/journal/ta/2018/02/07547933/13rRUxlgy26",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2014/03/06778017",
"title": "Design of a Wearable Device for Reading Positive Expressions from Facial EMG Signals",
"doi": null,
"abstractUrl": "/journal/ta/2014/03/06778017/13rRUyY2937",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2019/0089/0/08756541",
"title": "A Boost in Revealing Subtle Facial Expressions: A Consolidated Eulerian Framework",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2019/08756541/1bzYwpdafPa",
"parentPublication": {
"id": "proceedings/fg/2019/0089/0",
"title": "2019 14th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2019)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06636298",
"articleId": "13rRUwjoNx5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06787045",
"articleId": "13rRUyY28Yz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC36tSf",
"title": "Aug.",
"year": "2013",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvB3",
"doi": "10.1109/TVCG.2012.150",
"abstract": "Streamline seeding rakes are widely used in vector field visualization. We present new approaches for calculating similarity between integral curves (streamlines and pathlines). While others have used similarity distance measures, the computational expense involved with existing techniques is relatively high due to the vast number of euclidean distance tests, restricting interactivity and their use for streamline seeding rakes. We introduce the novel idea of computing streamline signatures based on a set of curve-based attributes. A signature produces a compact representation for describing a streamline. Similarity comparisons are performed by using a popular statistical measure on the derived signatures. We demonstrate that this novel scheme, including a hierarchical variant, produces good clustering results and is computed over two orders of magnitude faster than previous methods. Similarity-based clustering enables filtering of the streamlines to provide a nonuniform seeding distribution along the seeding object. We show that this method preserves the overall flow behavior while using only a small subset of the original streamline set. We apply focus + context rendering using the clusters which allows for faster and easier analysis in cases of high visual complexity and occlusion. The method provides a high level of interactivity and allows the user to easily fine tune the clustering results at runtime while avoiding any time-consuming recomputation. Our method maintains interactive rates even when hundreds of streamlines are used.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Streamline seeding rakes are widely used in vector field visualization. We present new approaches for calculating similarity between integral curves (streamlines and pathlines). While others have used similarity distance measures, the computational expense involved with existing techniques is relatively high due to the vast number of euclidean distance tests, restricting interactivity and their use for streamline seeding rakes. We introduce the novel idea of computing streamline signatures based on a set of curve-based attributes. A signature produces a compact representation for describing a streamline. Similarity comparisons are performed by using a popular statistical measure on the derived signatures. We demonstrate that this novel scheme, including a hierarchical variant, produces good clustering results and is computed over two orders of magnitude faster than previous methods. Similarity-based clustering enables filtering of the streamlines to provide a nonuniform seeding distribution along the seeding object. We show that this method preserves the overall flow behavior while using only a small subset of the original streamline set. We apply focus + context rendering using the clusters which allows for faster and easier analysis in cases of high visual complexity and occlusion. The method provides a high level of interactivity and allows the user to easily fine tune the clustering results at runtime while avoiding any time-consuming recomputation. Our method maintains interactive rates even when hundreds of streamlines are used.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Streamline seeding rakes are widely used in vector field visualization. We present new approaches for calculating similarity between integral curves (streamlines and pathlines). While others have used similarity distance measures, the computational expense involved with existing techniques is relatively high due to the vast number of euclidean distance tests, restricting interactivity and their use for streamline seeding rakes. We introduce the novel idea of computing streamline signatures based on a set of curve-based attributes. A signature produces a compact representation for describing a streamline. Similarity comparisons are performed by using a popular statistical measure on the derived signatures. We demonstrate that this novel scheme, including a hierarchical variant, produces good clustering results and is computed over two orders of magnitude faster than previous methods. Similarity-based clustering enables filtering of the streamlines to provide a nonuniform seeding distribution along the seeding object. We show that this method preserves the overall flow behavior while using only a small subset of the original streamline set. We apply focus + context rendering using the clusters which allows for faster and easier analysis in cases of high visual complexity and occlusion. The method provides a high level of interactivity and allows the user to easily fine tune the clustering results at runtime while avoiding any time-consuming recomputation. Our method maintains interactive rates even when hundreds of streamlines are used.",
"title": "Similarity Measures for Enhancing Interactive Streamline Seeding",
"normalizedTitle": "Similarity Measures for Enhancing Interactive Streamline Seeding",
"fno": "ttg2013081342",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Measurement",
"Visualization",
"Streaming Media",
"Clustering Algorithms",
"Vectors",
"Data Visualization",
"Context",
"Streamlines",
"Flow Visualization",
"Clustering",
"Similarity Measures",
"Focus Context"
],
"authors": [
{
"givenName": "T.",
"surname": "McLoughlin",
"fullName": "T. McLoughlin",
"affiliation": "Dept. of Comput. Sci., Swansea Univ., Swansea, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "M. W.",
"surname": "Jones",
"fullName": "M. W. Jones",
"affiliation": "Dept. of Comput. Sci., Swansea Univ., Swansea, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R. S.",
"surname": "Laramee",
"fullName": "R. S. Laramee",
"affiliation": "Dept. of Comput. Sci., Swansea Univ., Swansea, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Malki",
"fullName": "R. Malki",
"affiliation": "Marine Energy Res. Group, Swansea Univ., Swansea, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "I.",
"surname": "Masters",
"fullName": "I. Masters",
"affiliation": "Marine Energy Res. Group, Swansea Univ., Swansea, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C. D.",
"surname": "Hansen",
"fullName": "C. D. Hansen",
"affiliation": "Sch. of Comput., Univ. of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2013-08-01 00:00:00",
"pubType": "trans",
"pages": "1342-1353",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2009/4404/0/04906832",
"title": "Dual streamline seeding",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2009/04906832/12OmNAq3hTZ",
"parentPublication": {
"id": "proceedings/pacificvis/2009/4404/0",
"title": "2009 IEEE Pacific Visualization Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2015/8020/0/07450407",
"title": "Feature-Based Streamline Selection Method for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2015/07450407/12OmNBEYzMf",
"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/cis/2010/4297/0/4297a238",
"title": "A Streamline Placement Method Highlighting Flow Field Topology",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a238/12OmNvF83qx",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780027",
"title": "A Flow-guided Streamline Seeding Strategy",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780027/12OmNxI0Kvw",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1448",
"title": "Similarity-Guided Streamline Placement with Error Evaluation",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1448/13rRUEgs2BN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0630",
"title": "Image-Based Streamline Generation and Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0630/13rRUwdIOUC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050791",
"title": "Topology-Aware Evenly Spaced Streamline Placement",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050791/13rRUwvT9gp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06025348",
"title": "Hierarchical Streamline Bundles",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06025348/13rRUyY28Yt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071185",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071185/13rRUyfbwqG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013081331",
"articleId": "13rRUxly9dT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013081354",
"articleId": "13rRUNvgz9N",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgDz",
"name": "ttg2013081342s.m1v",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013081342s.m1v",
"extension": "m1v",
"size": "39.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwENDN",
"title": "May/June",
"year": "2007",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdIOUC",
"doi": "10.1109/TVCG.2007.1009",
"abstract": "Abstract—Seeding streamlines in 3D flow fields without considering their projections in screen space can produce visually cluttered rendering results. Streamlines will overlap or intersect with each other in the output image, which makes it difficult for the user to perceive the underlying flow structure. This paper presents a method to control the seeding and generation of streamlines in image space to avoid visual cluttering and allow a more flexible exploration of flow fields. In our algorithm, 2D images with depth maps generated by a variety of visualization techniques can be used as input from which seeds are placed and streamlines are generated. The density and rendering styles of streamlines can be flexibly controlled based on various criteria to improve visual clarity. With our image space approach, it is straightforward to implement the level of detail rendering, depth peeling, and stylized rendering of streamlines to allow for more effective visualization of 3D flow fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Seeding streamlines in 3D flow fields without considering their projections in screen space can produce visually cluttered rendering results. Streamlines will overlap or intersect with each other in the output image, which makes it difficult for the user to perceive the underlying flow structure. This paper presents a method to control the seeding and generation of streamlines in image space to avoid visual cluttering and allow a more flexible exploration of flow fields. In our algorithm, 2D images with depth maps generated by a variety of visualization techniques can be used as input from which seeds are placed and streamlines are generated. The density and rendering styles of streamlines can be flexibly controlled based on various criteria to improve visual clarity. With our image space approach, it is straightforward to implement the level of detail rendering, depth peeling, and stylized rendering of streamlines to allow for more effective visualization of 3D flow fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Seeding streamlines in 3D flow fields without considering their projections in screen space can produce visually cluttered rendering results. Streamlines will overlap or intersect with each other in the output image, which makes it difficult for the user to perceive the underlying flow structure. This paper presents a method to control the seeding and generation of streamlines in image space to avoid visual cluttering and allow a more flexible exploration of flow fields. In our algorithm, 2D images with depth maps generated by a variety of visualization techniques can be used as input from which seeds are placed and streamlines are generated. The density and rendering styles of streamlines can be flexibly controlled based on various criteria to improve visual clarity. With our image space approach, it is straightforward to implement the level of detail rendering, depth peeling, and stylized rendering of streamlines to allow for more effective visualization of 3D flow fields.",
"title": "Image-Based Streamline Generation and Rendering",
"normalizedTitle": "Image-Based Streamline Generation and Rendering",
"fno": "v0630",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Flow Visualization",
"Streamlines",
"Streamline Seeding",
"Level Of Detail",
"Depth Peeling",
"Stylized Rendering"
],
"authors": [
{
"givenName": "Liya",
"surname": "Li",
"fullName": "Liya Li",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han-Wei",
"surname": "Shen",
"fullName": "Han-Wei Shen",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2007-05-01 00:00:00",
"pubType": "trans",
"pages": "630-640",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cis/2010/4297/0/4297a238",
"title": "A Streamline Placement Method Highlighting Flow Field Topology",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a238/12OmNvF83qx",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b224",
"title": "Streamline-based Visualization of 3D Explosion Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b224/12OmNwtEEJX",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780027",
"title": "A Flow-guided Streamline Seeding Strategy",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780027/12OmNxI0Kvw",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660061",
"title": "Farthest Point Seeding for Efficient Placement of Streamlines",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660061/12OmNyvoX8D",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081342",
"title": "Similarity Measures for Enhancing Interactive Streamline Seeding",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081342/13rRUwInvB3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050791",
"title": "Topology-Aware Evenly Spaced Streamline Placement",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050791/13rRUwvT9gp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/08093671",
"title": "Image-based streamline generation and rendering",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/08093671/13rRUxASuSD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06025348",
"title": "Hierarchical Streamline Bundles",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06025348/13rRUyY28Yt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071185",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071185/13rRUyfbwqG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0620",
"articleId": "13rRUwwaKsY",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnL",
"title": "November/December",
"year": "2006",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfZC06",
"doi": "10.1109/TVCG.2006.104",
"abstract": "Abstract—Predicates are functions that return Boolean values. They are an essential tool in computer science. A close look at flow feature definitions reveals that they can be seen as point predicates that tell if a specific feature exists at a certain point. Besides the information about features, scientists and engineers like to know the overall behavior of all streamlines in the flow, typically in the connection with the important features in their application domain. We call this a structure definition for the flow. A successful example for a structure definition is flow topology. In this paper, we present streamline predicates as functions that tell the user about the connection between streamlines and features selected by the user. This means answers to questions like: Which streamlines flow through a given vortex, separation bubble, or shock wave? It can be shown that streamline predicates may refine flow topology so that it also reveals questions about vortices in 3D.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Predicates are functions that return Boolean values. They are an essential tool in computer science. A close look at flow feature definitions reveals that they can be seen as point predicates that tell if a specific feature exists at a certain point. Besides the information about features, scientists and engineers like to know the overall behavior of all streamlines in the flow, typically in the connection with the important features in their application domain. We call this a structure definition for the flow. A successful example for a structure definition is flow topology. In this paper, we present streamline predicates as functions that tell the user about the connection between streamlines and features selected by the user. This means answers to questions like: Which streamlines flow through a given vortex, separation bubble, or shock wave? It can be shown that streamline predicates may refine flow topology so that it also reveals questions about vortices in 3D.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Predicates are functions that return Boolean values. They are an essential tool in computer science. A close look at flow feature definitions reveals that they can be seen as point predicates that tell if a specific feature exists at a certain point. Besides the information about features, scientists and engineers like to know the overall behavior of all streamlines in the flow, typically in the connection with the important features in their application domain. We call this a structure definition for the flow. A successful example for a structure definition is flow topology. In this paper, we present streamline predicates as functions that tell the user about the connection between streamlines and features selected by the user. This means answers to questions like: Which streamlines flow through a given vortex, separation bubble, or shock wave? It can be shown that streamline predicates may refine flow topology so that it also reveals questions about vortices in 3D.",
"title": "Streamline Predicates",
"normalizedTitle": "Streamline Predicates",
"fno": "v1601",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Flow Visualization",
"Feature Detection"
],
"authors": [
{
"givenName": "Tobias",
"surname": "Salzbrunn",
"fullName": "Tobias Salzbrunn",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gerik",
"surname": "Scheuermann",
"fullName": "Gerik Scheuermann",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2006-11-01 00:00:00",
"pubType": "trans",
"pages": "1601-1612",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cad-graphics/2015/8020/0/07450407",
"title": "Feature-Based Streamline Selection Method for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2015/07450407/12OmNBEYzMf",
"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/ieee-vis/1998/9176/0/91760135",
"title": "Image-Guided Streamline Placement on Curvilinear Grid Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760135/12OmNCbU2XH",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596153",
"title": "Exploring vector fields with distribution-based streamline analysis",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596153/12OmNvAiSjV",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2010/4297/0/4297a238",
"title": "A Streamline Placement Method Highlighting Flow Field Topology",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a238/12OmNvF83qx",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/05/07117453",
"title": "A Vocabulary Approach to Partial Streamline Matching and Exploratory Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/05/07117453/13rRUEgs2C0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081342",
"title": "Similarity Measures for Enhancing Interactive Streamline Seeding",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081342/13rRUwInvB3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050791",
"title": "Topology-Aware Evenly Spaced Streamline Placement",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050791/13rRUwvT9gp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06025348",
"title": "Hierarchical Streamline Bundles",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06025348/13rRUyY28Yt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071185",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071185/13rRUyfbwqG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1590",
"articleId": "13rRUxjQyp5",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz2C1Bz",
"title": "September/October",
"year": "2010",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwvT9gp",
"doi": "10.1109/TVCG.2009.206",
"abstract": "This paper presents a new streamline placement algorithm that produces evenly spaced long streamlines while preserving topological features of a flow field. Singularities and separatrices are extracted to decompose the flow field into topological regions. In each region, a seeding path is selected from a set of streamlines integrated in the orthogonal flow field. The uniform sample points on this path are then used as seeds to generate streamlines in the original flow field. Additional seeds are placed where a large gap between adjacent streamlines occurs. The number of short streamlines is significantly reduced as evenly spaced long streamlines spawned along the seeding paths can fill the topological regions very well. Several metrics for evaluating streamline placement quality are discussed and applied to our method as well as some other approaches. Compared to previous work in uniform streamline placement, our method is more effective in creating evenly spaced long streamlines and preserving topological features. It has the potential to provide both intuitive perception of important flow characteristics and detail reconstruction across visually pleasing streamlines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a new streamline placement algorithm that produces evenly spaced long streamlines while preserving topological features of a flow field. Singularities and separatrices are extracted to decompose the flow field into topological regions. In each region, a seeding path is selected from a set of streamlines integrated in the orthogonal flow field. The uniform sample points on this path are then used as seeds to generate streamlines in the original flow field. Additional seeds are placed where a large gap between adjacent streamlines occurs. The number of short streamlines is significantly reduced as evenly spaced long streamlines spawned along the seeding paths can fill the topological regions very well. Several metrics for evaluating streamline placement quality are discussed and applied to our method as well as some other approaches. Compared to previous work in uniform streamline placement, our method is more effective in creating evenly spaced long streamlines and preserving topological features. It has the potential to provide both intuitive perception of important flow characteristics and detail reconstruction across visually pleasing streamlines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a new streamline placement algorithm that produces evenly spaced long streamlines while preserving topological features of a flow field. Singularities and separatrices are extracted to decompose the flow field into topological regions. In each region, a seeding path is selected from a set of streamlines integrated in the orthogonal flow field. The uniform sample points on this path are then used as seeds to generate streamlines in the original flow field. Additional seeds are placed where a large gap between adjacent streamlines occurs. The number of short streamlines is significantly reduced as evenly spaced long streamlines spawned along the seeding paths can fill the topological regions very well. Several metrics for evaluating streamline placement quality are discussed and applied to our method as well as some other approaches. Compared to previous work in uniform streamline placement, our method is more effective in creating evenly spaced long streamlines and preserving topological features. It has the potential to provide both intuitive perception of important flow characteristics and detail reconstruction across visually pleasing streamlines.",
"title": "Topology-Aware Evenly Spaced Streamline Placement",
"normalizedTitle": "Topology-Aware Evenly Spaced Streamline Placement",
"fno": "ttg2010050791",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Evenly Spaced Streamlines",
"Flow Topology",
"Flow Visualization",
"Seeding Strategy",
"Streamline Placement"
],
"authors": [
{
"givenName": "Keqin",
"surname": "Wu",
"fullName": "Keqin Wu",
"affiliation": "Mississippi State University, Starkville",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhanping",
"surname": "Liu",
"fullName": "Zhanping Liu",
"affiliation": "Kitware, Inc., Clifton Park",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Song",
"surname": "Zhang",
"fullName": "Song Zhang",
"affiliation": "Mississippi State University, Starkville",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert J.",
"surname": "Moorhead II",
"fullName": "Robert J. Moorhead II",
"affiliation": "Mississippi State University, Starkville",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2010-09-01 00:00:00",
"pubType": "trans",
"pages": "791-801",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1998/9176/0/91760135",
"title": "Image-Guided Streamline Placement on Curvilinear Grid Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760135/12OmNCbU2XH",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2010/4297/0/4297a238",
"title": "A Streamline Placement Method Highlighting Flow Field Topology",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a238/12OmNvF83qx",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660061",
"title": "Farthest Point Seeding for Efficient Placement of Streamlines",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660061/12OmNyvoX8D",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0965",
"title": "An Advanced Evenly-Spaced Streamline Placement Algorithm",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0965/13rRUIM2VBz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/08/ttg2013081342",
"title": "Similarity Measures for Enhancing Interactive Streamline Seeding",
"doi": null,
"abstractUrl": "/journal/tg/2013/08/ttg2013081342/13rRUwInvB3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0630",
"title": "Image-Based Streamline Generation and Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0630/13rRUwdIOUC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2007/04/c4086",
"title": "Robust Loop Detection for Interactively Placing Evenly Spaced Streamlines",
"doi": null,
"abstractUrl": "/magazine/cs/2007/04/c4086/13rRUxC0Srt",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06025348",
"title": "Hierarchical Streamline Bundles",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06025348/13rRUyY28Yt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071185",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071185/13rRUyfbwqG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010050777",
"articleId": "13rRUxAAT7B",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010050802",
"articleId": "13rRUxd2aYW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBhpS2A",
"title": "July",
"year": "2013",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyfbwqG",
"doi": "10.1109/TVCG.2012.169",
"abstract": "Parallel streamline placement is still an open problem in flow visualization. In this paper, we propose an innovative method to place streamlines in parallel for 2D flow fields. This method is based on our proposed concept of local tracing areas (LTAs). An LTA is defined as a subdomain enclosed by streamlines and/or field borders, where the tracing of streamlines are localized. Given a flow field, it is initialized as an LTA, which is later recursively partitioned into hierarchical LTAs. Streamlines are placed within different LTAs simultaneously and independently. At the same time, to control the density of streamlines, each streamline is associated with an isolation zone and a saturation zone, both of which are center aligned with the streamline but have different widths. None of streamlines can trace into isolation zones of others. And new streamlines are only seeded within valid seeding areas (VSAs) that are enclosed by saturation zones and/or field borders. To implement the parallel strategy and the density control, a cell-based modeling is devised to describe isolation zones and LTAs as well as saturation zones and VSAs. With the help of these cell-based models, a heuristic seeding strategy is proposed to seed streamlines within irregular LTAs, and a cell-marking technique is used to control the seeding and tracing of streamlines. Test results show that the placement method can achieve highly parallel performance on shared memory systems without losing the quality of placements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Parallel streamline placement is still an open problem in flow visualization. In this paper, we propose an innovative method to place streamlines in parallel for 2D flow fields. This method is based on our proposed concept of local tracing areas (LTAs). An LTA is defined as a subdomain enclosed by streamlines and/or field borders, where the tracing of streamlines are localized. Given a flow field, it is initialized as an LTA, which is later recursively partitioned into hierarchical LTAs. Streamlines are placed within different LTAs simultaneously and independently. At the same time, to control the density of streamlines, each streamline is associated with an isolation zone and a saturation zone, both of which are center aligned with the streamline but have different widths. None of streamlines can trace into isolation zones of others. And new streamlines are only seeded within valid seeding areas (VSAs) that are enclosed by saturation zones and/or field borders. To implement the parallel strategy and the density control, a cell-based modeling is devised to describe isolation zones and LTAs as well as saturation zones and VSAs. With the help of these cell-based models, a heuristic seeding strategy is proposed to seed streamlines within irregular LTAs, and a cell-marking technique is used to control the seeding and tracing of streamlines. Test results show that the placement method can achieve highly parallel performance on shared memory systems without losing the quality of placements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Parallel streamline placement is still an open problem in flow visualization. In this paper, we propose an innovative method to place streamlines in parallel for 2D flow fields. This method is based on our proposed concept of local tracing areas (LTAs). An LTA is defined as a subdomain enclosed by streamlines and/or field borders, where the tracing of streamlines are localized. Given a flow field, it is initialized as an LTA, which is later recursively partitioned into hierarchical LTAs. Streamlines are placed within different LTAs simultaneously and independently. At the same time, to control the density of streamlines, each streamline is associated with an isolation zone and a saturation zone, both of which are center aligned with the streamline but have different widths. None of streamlines can trace into isolation zones of others. And new streamlines are only seeded within valid seeding areas (VSAs) that are enclosed by saturation zones and/or field borders. To implement the parallel strategy and the density control, a cell-based modeling is devised to describe isolation zones and LTAs as well as saturation zones and VSAs. With the help of these cell-based models, a heuristic seeding strategy is proposed to seed streamlines within irregular LTAs, and a cell-marking technique is used to control the seeding and tracing of streamlines. Test results show that the placement method can achieve highly parallel performance on shared memory systems without losing the quality of placements.",
"title": "Parallel Streamline Placement for 2D Flow Fields",
"normalizedTitle": "Parallel Streamline Placement for 2D Flow Fields",
"fno": "ttg2013071185",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Streaming Media",
"Parallel Processing",
"Program Processors",
"Clutter",
"Synchronization",
"Shape",
"Streamline Placement",
"Flow Visualization",
"Parallel Algorithms",
"Seeding Strategies"
],
"authors": [
{
"givenName": null,
"surname": "Wenyao Zhang",
"fullName": "Wenyao Zhang",
"affiliation": "Beijing Lab. of Intell. Inf. Technol., Beijing Inst. of Technol., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Yi Wang",
"fullName": "Yi Wang",
"affiliation": "Sch. of Mechatronical Eng., Beijing Inst. of Technol., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jianfeng Zhan",
"fullName": "Jianfeng Zhan",
"affiliation": "State Key Lab. of Comput. Archit., Inst. of Comput. Technol., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Beichen Liu",
"fullName": "Beichen Liu",
"affiliation": "Beijing Lab. of Intell. Inf. Technol., Beijing Inst. of Technol., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jianguo Ning",
"fullName": "Jianguo Ning",
"affiliation": "Sch. of Mechatronical Eng., Beijing Inst. of Technol., Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2013-07-01 00:00:00",
"pubType": "trans",
"pages": "1185-1198",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cad-graphics/2015/8020/0/07450407",
"title": "Feature-Based Streamline Selection Method for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2015/07450407/12OmNBEYzMf",
"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/ieee-vis/1998/9176/0/91760135",
"title": "Image-Guided Streamline Placement on Curvilinear Grid Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760135/12OmNCbU2XH",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2010/4297/0/4297a238",
"title": "A Streamline Placement Method Highlighting Flow Field Topology",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a238/12OmNvF83qx",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b224",
"title": "Streamline-based Visualization of 3D Explosion Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b224/12OmNwtEEJX",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780027",
"title": "A Flow-guided Streamline Seeding Strategy",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780027/12OmNxI0Kvw",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660061",
"title": "Farthest Point Seeding for Efficient Placement of Streamlines",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660061/12OmNyvoX8D",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b174",
"title": "Multiresolution Streamline Placement for 2D Flow Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b174/12OmNz6iOml",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0630",
"title": "Image-Based Streamline Generation and Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0630/13rRUwdIOUC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050791",
"title": "Topology-Aware Evenly Spaced Streamline Placement",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050791/13rRUwvT9gp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06025348",
"title": "Hierarchical Streamline Bundles",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06025348/13rRUyY28Yt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013071172",
"articleId": "13rRUEgarnJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013071199",
"articleId": "13rRUwI5U2E",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRJ3",
"name": "ttg2013071185s1.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013071185s1.pdf",
"extension": "pdf",
"size": "129 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAgY7py",
"title": "Nov.-Dec.",
"year": "2015",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "35",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5pf",
"doi": "10.1109/MCG.2015.114",
"abstract": "In response to their growing use in the real world, this article presents two algorithms for direct parameterization of quadrilateral meshes. The proposed algorithms are angle-preserving mappings, with one mapping a topological disk surface onto a Euclidean plane and one mapping a topological sphere surface onto a unit sphere. Specifically, for topological disk surfaces, the authors devise a discrete conformal energy function to flatten the quadrilateral meshes with a length-preserving boundary condition. For topological sphere surfaces, a derived Tuette energy function is applied to the initialization of parameterization for a mesh, and then the final spherical parametrization result is obtained by minimizing a devised harmonic energy function. Experimental results demonstrate the efficiency of the proposed methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In response to their growing use in the real world, this article presents two algorithms for direct parameterization of quadrilateral meshes. The proposed algorithms are angle-preserving mappings, with one mapping a topological disk surface onto a Euclidean plane and one mapping a topological sphere surface onto a unit sphere. Specifically, for topological disk surfaces, the authors devise a discrete conformal energy function to flatten the quadrilateral meshes with a length-preserving boundary condition. For topological sphere surfaces, a derived Tuette energy function is applied to the initialization of parameterization for a mesh, and then the final spherical parametrization result is obtained by minimizing a devised harmonic energy function. Experimental results demonstrate the efficiency of the proposed methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In response to their growing use in the real world, this article presents two algorithms for direct parameterization of quadrilateral meshes. The proposed algorithms are angle-preserving mappings, with one mapping a topological disk surface onto a Euclidean plane and one mapping a topological sphere surface onto a unit sphere. Specifically, for topological disk surfaces, the authors devise a discrete conformal energy function to flatten the quadrilateral meshes with a length-preserving boundary condition. For topological sphere surfaces, a derived Tuette energy function is applied to the initialization of parameterization for a mesh, and then the final spherical parametrization result is obtained by minimizing a devised harmonic energy function. Experimental results demonstrate the efficiency of the proposed methods.",
"title": "Angle-Preserving Quadrilateral Mesh Parameterization",
"normalizedTitle": "Angle-Preserving Quadrilateral Mesh Parameterization",
"fno": "mcg2015060051",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Harmonic Analysis",
"Mesh Generation",
"Conformal Mapping",
"Laplace Equations",
"Boundary Conditions",
"Solid Modeling",
"Human Computer Interaction",
"Conformal Mapping",
"Computer Graphics",
"Quadrilateral Mesh",
"Parameterization"
],
"authors": [
{
"givenName": "Wenyong",
"surname": "Gong",
"fullName": "Wenyong Gong",
"affiliation": "Jilin University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaohua",
"surname": "Xie",
"fullName": "Xiaohua Xie",
"affiliation": "Sun Yat-Sen University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rui",
"surname": "Ma",
"fullName": "Rui Ma",
"affiliation": "Jilin University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tieru",
"surname": "Wu",
"fullName": "Tieru Wu",
"affiliation": "Jilin University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2015-11-01 00:00:00",
"pubType": "mags",
"pages": "51-59",
"year": "2015",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2007/1016/0/04284900",
"title": "An Energy-Minimizing Mesh Parameterization",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284900/12OmNBt3qkv",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dmdcm/2011/4413/0/4413a266",
"title": "Direct Spherical Parameterization Based on Surface Curvature",
"doi": null,
"abstractUrl": "/proceedings-article/dmdcm/2011/4413a266/12OmNCeaPV9",
"parentPublication": {
"id": "proceedings/dmdcm/2011/4413/0",
"title": "Digital Media and Digital Content Management, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2000/0662/1/06621354",
"title": "Parameterization of Closed Surfaces for Parametric Surface Descriptio",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2000/06621354/12OmNviZlpk",
"parentPublication": {
"id": "proceedings/cvpr/2000/0662/1",
"title": "Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730301",
"title": "A New Approach of Progressive Spherical Parameterization",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730301/12OmNwp74GO",
"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/smi/2010/7259/0/05521444",
"title": "Direct-Product Volumetric Parameterization of Handlebodies via Harmonic Fields",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2010/05521444/12OmNx965xN",
"parentPublication": {
"id": "proceedings/smi/2010/7259/0",
"title": "Shape Modeling International (SMI 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2008/2260/0/04547954",
"title": "Approximate topological matching of quadrilateral meshes",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2008/04547954/12OmNz5JBQB",
"parentPublication": {
"id": "proceedings/smi/2008/2260/0",
"title": "IEEE International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a124",
"title": "Structure Preserving Mesh Parameterization",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a124/12OmNzn38YO",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/01/v0083",
"title": "Mesh Parameterization by Minimizing the Synthesized Distortion Metric with the Coefficient-Optimizing Algorithm",
"doi": null,
"abstractUrl": "/journal/tg/2006/01/v0083/13rRUEgarsC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/06/07434077",
"title": "Spherical Parameterization Balancing Angle and Area Distortions",
"doi": null,
"abstractUrl": "/journal/tg/2017/06/07434077/13rRUxAASTf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/03/09166751",
"title": "Global Conformal Parameterization via an Implementation of Holomorphic Quadratic Differentials",
"doi": null,
"abstractUrl": "/journal/tg/2022/03/09166751/1mgaVw1u2eQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2015060042",
"articleId": "13rRUyg2jQ7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2015060060",
"articleId": "13rRUxASuk3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz2C1BC",
"title": "July",
"year": "2012",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBrGgV",
"doi": "10.1109/TVCG.2011.131",
"abstract": "This paper presents a simple and efficient automatic mesh segmentation algorithm that solely exploits the shape concavity information. The method locates concave creases and seams using a set of concavity-sensitive scalar fields. These fields are computed by solving a Laplacian system with a novel concavity-sensitive weighting scheme. Isolines sampled from the concavity-aware fields naturally gather at concave seams, serving as good cutting boundary candidates. In addition, the fields provide sufficient information allowing efficient evaluation of the candidate cuts. We perform a summarization of all field gradient magnitudes to define a score for each isoline and employ a score-based greedy algorithm to select the best cuts. Extensive experiments and quantitative analysis have shown that the quality of our segmentations are better than or comparable with existing state-of-the-art more complex approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a simple and efficient automatic mesh segmentation algorithm that solely exploits the shape concavity information. The method locates concave creases and seams using a set of concavity-sensitive scalar fields. These fields are computed by solving a Laplacian system with a novel concavity-sensitive weighting scheme. Isolines sampled from the concavity-aware fields naturally gather at concave seams, serving as good cutting boundary candidates. In addition, the fields provide sufficient information allowing efficient evaluation of the candidate cuts. We perform a summarization of all field gradient magnitudes to define a score for each isoline and employ a score-based greedy algorithm to select the best cuts. Extensive experiments and quantitative analysis have shown that the quality of our segmentations are better than or comparable with existing state-of-the-art more complex approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a simple and efficient automatic mesh segmentation algorithm that solely exploits the shape concavity information. The method locates concave creases and seams using a set of concavity-sensitive scalar fields. These fields are computed by solving a Laplacian system with a novel concavity-sensitive weighting scheme. Isolines sampled from the concavity-aware fields naturally gather at concave seams, serving as good cutting boundary candidates. In addition, the fields provide sufficient information allowing efficient evaluation of the candidate cuts. We perform a summarization of all field gradient magnitudes to define a score for each isoline and employ a score-based greedy algorithm to select the best cuts. Extensive experiments and quantitative analysis have shown that the quality of our segmentations are better than or comparable with existing state-of-the-art more complex approaches.",
"title": "Mesh Segmentation with Concavity-Aware Fields",
"normalizedTitle": "Mesh Segmentation with Concavity-Aware Fields",
"fno": "ttg2012071125",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Concavity Aware Field",
"Mesh Segmentation",
"Isolines"
],
"authors": [
{
"givenName": "Oscar Kin-Chung",
"surname": "Au",
"fullName": "Oscar Kin-Chung Au",
"affiliation": "The City University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Youyi",
"surname": "Zheng",
"fullName": "Youyi Zheng",
"affiliation": "The Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Menglin",
"surname": "Chen",
"fullName": "Menglin Chen",
"affiliation": "The Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pengfei",
"surname": "Xu",
"fullName": "Pengfei Xu",
"affiliation": "The Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chiew-Lan",
"surname": "Tai",
"fullName": "Chiew-Lan Tai",
"affiliation": "The Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2012-07-01 00:00:00",
"pubType": "trans",
"pages": "1125-1134",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2009/3789/0/3789a250",
"title": "Surface Mesh Segmentation Using Local Geometry",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a250/12OmNAL3B9E",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/1995/7190/0/71900311",
"title": "3D part segmentation: a new physics-based approach",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/1995/71900311/12OmNAsTgPx",
"parentPublication": {
"id": "proceedings/iscv/1995/7190/0",
"title": "Computer Vision, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wimob/2012/1429/0/p284bezzina",
"title": "An interference-aware routing metric for multi-radio multi-channel wireless mesh networks",
"doi": null,
"abstractUrl": "/proceedings-article/wimob/2012/p284bezzina/12OmNBqMDwV",
"parentPublication": {
"id": "proceedings/wimob/2012/1429/0",
"title": "2012 IEEE 8th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/4/3336h118",
"title": "Load-Aware Network Entry in WiMAX Mesh Mode",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336h118/12OmNqJZgDw",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880043",
"title": "Centroidal Voronoi Tessellation Based Algorithms for Vector Fields Visualization and Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880043/12OmNzZEAD4",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/03/v0320",
"title": "Volumetric Segmentation Using Weibull E-SD Fields",
"doi": null,
"abstractUrl": "/journal/tg/2003/03/v0320/13rRUEgarBj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/10/ttp2010101871",
"title": "Self-Validated Labeling of Markov Random Fields for Image Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/2010/10/ttp2010101871/13rRUwghd67",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/05989803",
"title": "Dot Scissor: A Single-Click Interface for Mesh Segmentation",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/05989803/13rRUxNW1TR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2006/2686/0/04027052",
"title": "Improving 2D mesh image segmentation with Markovian Random Fields",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2006/04027052/17QjJeeJOAe",
"parentPublication": {
"id": "proceedings/sibgrapi/2006/2686/0",
"title": "2006 19th Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a103",
"title": "Improved Mesh Segmentation with Perception-Aware Cuts",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a103/1ap5ALHw2aY",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012071115",
"articleId": "13rRUxC0SOV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012071135",
"articleId": "13rRUNvgz4d",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xjQVW2XkGY",
"doi": "10.1109/TVCG.2021.3114687",
"abstract": "We present Knowledge Rocks, an implementation strategy and guideline for augmenting visualization systems to knowledge-assisted visualization systems, as defined by the KAVA model. Visualization systems become more and more sophisticated. Hence, it is increasingly important to support users with an integrated knowledge base in making constructive choices and drawing the right conclusions. We support the effective reactivation of visualization software resources by augmenting them with knowledge-assistance. To provide a general and yet supportive implementation strategy, we propose an implementation process that bases on an application-agnostic architecture. This architecture is derived from existing knowledge-assisted visualization systems and the KAVA model. Its centerpiece is an ontology that is able to automatically analyze and classify input data, linked to a database to store classified instances. We discuss design decisions and advantages of the KR framework and illustrate its broad area of application in diverse integration possibilities of this architecture into an existing visualization system. In addition, we provide a detailed case study by augmenting an it-security system with knowledge-assistance facilities.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present Knowledge Rocks, an implementation strategy and guideline for augmenting visualization systems to knowledge-assisted visualization systems, as defined by the KAVA model. Visualization systems become more and more sophisticated. Hence, it is increasingly important to support users with an integrated knowledge base in making constructive choices and drawing the right conclusions. We support the effective reactivation of visualization software resources by augmenting them with knowledge-assistance. To provide a general and yet supportive implementation strategy, we propose an implementation process that bases on an application-agnostic architecture. This architecture is derived from existing knowledge-assisted visualization systems and the KAVA model. Its centerpiece is an ontology that is able to automatically analyze and classify input data, linked to a database to store classified instances. We discuss design decisions and advantages of the KR framework and illustrate its broad area of application in diverse integration possibilities of this architecture into an existing visualization system. In addition, we provide a detailed case study by augmenting an it-security system with knowledge-assistance facilities.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present Knowledge Rocks, an implementation strategy and guideline for augmenting visualization systems to knowledge-assisted visualization systems, as defined by the KAVA model. Visualization systems become more and more sophisticated. Hence, it is increasingly important to support users with an integrated knowledge base in making constructive choices and drawing the right conclusions. We support the effective reactivation of visualization software resources by augmenting them with knowledge-assistance. To provide a general and yet supportive implementation strategy, we propose an implementation process that bases on an application-agnostic architecture. This architecture is derived from existing knowledge-assisted visualization systems and the KAVA model. Its centerpiece is an ontology that is able to automatically analyze and classify input data, linked to a database to store classified instances. We discuss design decisions and advantages of the KR framework and illustrate its broad area of application in diverse integration possibilities of this architecture into an existing visualization system. In addition, we provide a detailed case study by augmenting an it-security system with knowledge-assistance facilities.",
"title": "Knowledge Rocks: Adding Knowledge Assistance to Visualization Systems",
"normalizedTitle": "Knowledge Rocks: Adding Knowledge Assistance to Visualization Systems",
"fno": "09555492",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Ontologies",
"Knowledge Based Systems",
"Lesions",
"Computer Architecture",
"Rocks",
"Security",
"Knowledge Assisted Visualization",
"Ontology",
"IT Security"
],
"authors": [
{
"givenName": "Anna-Pia",
"surname": "Lohfink",
"fullName": "Anna-Pia Lohfink",
"affiliation": "Technische Universität Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon D.",
"surname": "Duque Anton",
"fullName": "Simon D. Duque Anton",
"affiliation": "Technische Universität Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Heike",
"surname": "Leitte",
"fullName": "Heike Leitte",
"affiliation": "Technische Universität Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christoph",
"surname": "Garth",
"fullName": "Christoph Garth",
"affiliation": "Technische Universität Kaiserslautern, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "1117-1127",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2006/0224/0/02240043",
"title": "Coupling Ontologies with Graphics Content for Knowledge Driven Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2006/02240043/12OmNqGRG7J",
"parentPublication": {
"id": "proceedings/vr/2006/0224/0",
"title": "IEEE Virtual Reality Conference (VR 2006)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iceccs/1995/7123/0/71230223",
"title": "Knowledge-Based assistance for real-time systems",
"doi": null,
"abstractUrl": "/proceedings-article/iceccs/1995/71230223/12OmNrJAdTq",
"parentPublication": {
"id": "proceedings/iceccs/1995/7123/0",
"title": "Engineering of Complex Computer Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2004/2177/0/21770519",
"title": "Learning from Architects: The Difference between Knowledge Visualization and Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770519/12OmNx9nGLN",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eitt/2015/8037/0/07446144",
"title": "A Framework of Dynamic Visual Navigation for Subject Knowledge",
"doi": null,
"abstractUrl": "/proceedings-article/eitt/2015/07446144/12OmNz6iOaG",
"parentPublication": {
"id": "proceedings/eitt/2015/8037/0",
"title": "2015 International Conference of Educational Innovation through Technology (EITT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/01/mcg2010010050",
"title": "Prajna: Adding Automated Reasoning to the Visual- Analysis Process",
"doi": null,
"abstractUrl": "/magazine/cg/2010/01/mcg2010010050/13rRUwbJCZg",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/01/mcg2009010012",
"title": "Data, Information, and Knowledge in Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2009/01/mcg2009010012/13rRUx0geC1",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/01/mcg2010010015",
"title": "Guest Editors' Introduction: Knowledge-Assisted Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2010/01/mcg2010010015/13rRUzp02qs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2018/7445/0/744500a044",
"title": "Visualization and Forecast Analysis of Science and Technology Intelligence Based on Knowledge Graph",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2018/744500a044/17D45XdBRSf",
"parentPublication": {
"id": "proceedings/dcabes/2018/7445/0",
"title": "2018 17th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585498",
"title": "The Role of Explicit Knowledge: A Conceptual Model of Knowledge-Assisted Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585498/17D45XvMccM",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trex/2021/1817/0/181700a001",
"title": "The Enhanced Security in Process System - Evaluating Knowledge Assistance",
"doi": null,
"abstractUrl": "/proceedings-article/trex/2021/181700a001/1yQB5Z4abUQ",
"parentPublication": {
"id": "proceedings/trex/2021/1817/0",
"title": "2021 IEEE Workshop on TRust and EXpertise in Visual Analytics (TREX)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552430",
"articleId": "1xibXqiU5LG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552846",
"articleId": "1xibYOLsNc4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaB0LYxOg",
"name": "ttg202201-09555492s1-supp1-3114687.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09555492s1-supp1-3114687.pdf",
"extension": "pdf",
"size": "2.38 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAZx8Oo",
"title": "January",
"year": "2010",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "32",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyagg",
"doi": "10.1109/TPAMI.2008.270",
"abstract": "Many traditional two-view stereo algorithms explicitly or implicitly use the frontal parallel plane assumption when exploiting contextual information since, e.g., the smoothness prior biases toward constant disparity (depth) over a neighborhood. This introduces systematic errors to the matching process for slanted or curved surfaces. These errors are nonnegligible for detailed geometric modeling of natural objects such as a human face. We show how to use contextual information geometrically to avoid such errors. A differential geometric study of smooth surfaces allows contextual information to be encoded in Cartan's moving frame model over local quadratic approximations, providing a framework of geometric consistency for both depth and surface normals; the accuracy of our reconstructions argues for the sufficiency of the approximation. In effect, Cartan's model provides the additional constraint necessary to move beyond the frontal parallel plane assumption in stereo reconstruction. It also suggests how geometry can extend surfaces to account for unmatched points due to partial occlusion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many traditional two-view stereo algorithms explicitly or implicitly use the frontal parallel plane assumption when exploiting contextual information since, e.g., the smoothness prior biases toward constant disparity (depth) over a neighborhood. This introduces systematic errors to the matching process for slanted or curved surfaces. These errors are nonnegligible for detailed geometric modeling of natural objects such as a human face. We show how to use contextual information geometrically to avoid such errors. A differential geometric study of smooth surfaces allows contextual information to be encoded in Cartan's moving frame model over local quadratic approximations, providing a framework of geometric consistency for both depth and surface normals; the accuracy of our reconstructions argues for the sufficiency of the approximation. In effect, Cartan's model provides the additional constraint necessary to move beyond the frontal parallel plane assumption in stereo reconstruction. It also suggests how geometry can extend surfaces to account for unmatched points due to partial occlusion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many traditional two-view stereo algorithms explicitly or implicitly use the frontal parallel plane assumption when exploiting contextual information since, e.g., the smoothness prior biases toward constant disparity (depth) over a neighborhood. This introduces systematic errors to the matching process for slanted or curved surfaces. These errors are nonnegligible for detailed geometric modeling of natural objects such as a human face. We show how to use contextual information geometrically to avoid such errors. A differential geometric study of smooth surfaces allows contextual information to be encoded in Cartan's moving frame model over local quadratic approximations, providing a framework of geometric consistency for both depth and surface normals; the accuracy of our reconstructions argues for the sufficiency of the approximation. In effect, Cartan's model provides the additional constraint necessary to move beyond the frontal parallel plane assumption in stereo reconstruction. It also suggests how geometry can extend surfaces to account for unmatched points due to partial occlusion.",
"title": "Differential Geometric Inference in Surface Stereo",
"normalizedTitle": "Differential Geometric Inference in Surface Stereo",
"fno": "ttp2010010072",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Stereo Matching",
"Surface Stereo",
"Differential Geometry",
"Curved Surface",
"Slanted Surface",
"Computational Inference",
"Half Occluded Surface Region"
],
"authors": [
{
"givenName": "Gang",
"surname": "Li",
"fullName": "Gang Li",
"affiliation": "Siemens Corporate Research, Princeton",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven W.",
"surname": "Zucker",
"fullName": "Steven W. Zucker",
"affiliation": "Yale University, New Haven",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2010-01-01 00:00:00",
"pubType": "trans",
"pages": "72-86",
"year": "2010",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/itcs/2009/3688/1/3688a640",
"title": "An Improved Algorithm of Bi-cubic Triangular Curved Surface-Splicing for Curved Surface Reconstruction Based on Hermite Surface",
"doi": null,
"abstractUrl": "/proceedings-article/itcs/2009/3688a640/12OmNAo45CX",
"parentPublication": {
"id": "proceedings/itcs/2009/3688/1",
"title": "Information Technology and Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2011/4369/0/4369a025",
"title": "Surface Reconstruction in Photometric Stereo with Calibration Error",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2011/4369a025/12OmNCulYic",
"parentPublication": {
"id": "proceedings/3dimpvt/2011/4369/0",
"title": "2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2010/4286/1/4286a324",
"title": "Belief Propagation Stereo Matching Based on Differential Geometry Constraint of Disparity",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2010/4286a324/12OmNqJ8tnt",
"parentPublication": {
"id": "proceedings/icdma/2010/4286/1",
"title": "2010 International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118065",
"title": "Using surface model to correct and fit disparity data in stereo vision",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118065/12OmNs59K2N",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccms/2010/3941/1/3941a505",
"title": "Stereo Matching for Slanted Plane: A Probability Model",
"doi": null,
"abstractUrl": "/proceedings-article/iccms/2010/3941a505/12OmNyKJiE2",
"parentPublication": {
"id": "proceedings/iccms/2010/3941/3",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498tasdizen",
"title": "Geometric Surface Smoothing via Anisotropic Diffusion of Normals",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498tasdizen/12OmNyRg4pW",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2001/1143/1/00937522",
"title": "New perspectives on geometric reflection theory from rough surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/00937522/12OmNzmclV4",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06035704",
"title": "Inference-Based Surface Reconstruction of Cluttered Environments",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06035704/13rRUwj7cp9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1990/03/i0309",
"title": "Stereo Correspondence by Surface Reconstruction",
"doi": null,
"abstractUrl": "/journal/tp/1990/03/i0309/13rRUxCitza",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/12/ttp2009122282",
"title": "Optimal Reconstruction of Approximate Planar Surfaces Using Photometric Stereo",
"doi": null,
"abstractUrl": "/journal/tp/2009/12/ttp2009122282/13rRUxDItij",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2010010056",
"articleId": "13rRUyoPSQf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2010010087",
"articleId": "13rRUxNW20p",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvwoNX",
"title": "July/August",
"year": "2010",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwkxc5l",
"doi": "10.1109/TVCG.2009.208",
"abstract": "A method for implicit surface reconstruction is proposed. The novelty in this paper is the adaption of Markov Random Field regularization of a distance field. The Markov Random Field formulation allows us to integrate both knowledge about the type of surface we wish to reconstruct (the prior) and knowledge about data (the observation model) in an orthogonal fashion. Local models that account for both scene-specific knowledge and physical properties of the scanning device are described. Furthermore, how the optimal distance field can be computed is demonstrated using conjugate gradients, sparse Cholesky factorization, and a multiscale iterative optimization scheme. The method is demonstrated on a set of scanned human heads and, both in terms of accuracy and the ability to close holes, the proposed method is shown to have similar or superior performance when compared to current state-of-the-art algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A method for implicit surface reconstruction is proposed. The novelty in this paper is the adaption of Markov Random Field regularization of a distance field. The Markov Random Field formulation allows us to integrate both knowledge about the type of surface we wish to reconstruct (the prior) and knowledge about data (the observation model) in an orthogonal fashion. Local models that account for both scene-specific knowledge and physical properties of the scanning device are described. Furthermore, how the optimal distance field can be computed is demonstrated using conjugate gradients, sparse Cholesky factorization, and a multiscale iterative optimization scheme. The method is demonstrated on a set of scanned human heads and, both in terms of accuracy and the ability to close holes, the proposed method is shown to have similar or superior performance when compared to current state-of-the-art algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A method for implicit surface reconstruction is proposed. The novelty in this paper is the adaption of Markov Random Field regularization of a distance field. The Markov Random Field formulation allows us to integrate both knowledge about the type of surface we wish to reconstruct (the prior) and knowledge about data (the observation model) in an orthogonal fashion. Local models that account for both scene-specific knowledge and physical properties of the scanning device are described. Furthermore, how the optimal distance field can be computed is demonstrated using conjugate gradients, sparse Cholesky factorization, and a multiscale iterative optimization scheme. The method is demonstrated on a set of scanned human heads and, both in terms of accuracy and the ability to close holes, the proposed method is shown to have similar or superior performance when compared to current state-of-the-art algorithms.",
"title": "Markov Random Field Surface Reconstruction",
"normalizedTitle": "Markov Random Field Surface Reconstruction",
"fno": "ttg2010040636",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bayesian Approach",
"Implicit Surface",
"Markov Random Field",
"Mesh Generation",
"Surface Reconstruction"
],
"authors": [
{
"givenName": "Rasmus R.",
"surname": "Paulsen",
"fullName": "Rasmus R. Paulsen",
"affiliation": "Technical University of Denmark, Lyngby",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jakob Andreas",
"surname": "Bærentzen",
"fullName": "Jakob Andreas Bærentzen",
"affiliation": "Technical University of Denmark, Lyngby",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rasmus",
"surname": "Larsen",
"fullName": "Rasmus Larsen",
"affiliation": "Technical University of Denmark, Lyngby",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2010-07-01 00:00:00",
"pubType": "trans",
"pages": "636-646",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2017/0733/0/0733b735",
"title": "Surface Normal Reconstruction from Specular Information in Light Field Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733b735/12OmNAP1YZr",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsm/2001/1278/0/12780194",
"title": "Fast Surface Reconstruction Using the Level Set Method",
"doi": null,
"abstractUrl": "/proceedings-article/vlsm/2001/12780194/12OmNs0C9Kh",
"parentPublication": {
"id": "proceedings/vlsm/2001/1278/0",
"title": "Proceedings of 1st IEEE Workshop on Variational and Level Set Methods in Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2009/3813/0/3813a072",
"title": "Surface Reconstruction: An Improved Marching Triangle Algorithm for Scalar and Vector Implicit Field Representations",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2009/3813a072/12OmNy2Jt55",
"parentPublication": {
"id": "proceedings/sibgrapi/2009/3813/0",
"title": "2009 XXII Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1992/2855/0/00223261",
"title": "Shape from texture using Markov random field models and stereo-windows",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223261/12OmNyo1nVL",
"parentPublication": {
"id": "proceedings/cvpr/1992/2855/0",
"title": "Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2003/09/i1089",
"title": "Hidden Markov Random Field Model Selection Criteria Based on Mean Field-Like Approximations",
"doi": null,
"abstractUrl": "/journal/tp/2003/09/i1089/13rRUEgs2MW",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1983/01/04767341",
"title": "Markov Random Field Texture Models",
"doi": null,
"abstractUrl": "/journal/tp/1983/01/04767341/13rRUNvgz5e",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06081858",
"title": "A Curvature-Adaptive Implicit Surface Reconstruction for Irregularly Spaced Points",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06081858/13rRUx0xPTP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2018/8425/0/842500a012",
"title": "Surface Light Field Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2018/842500a012/17D45WODasr",
"parentPublication": {
"id": "proceedings/3dv/2018/8425/0",
"title": "2018 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200g505",
"title": "Learning Signed Distance Field for Multi-view Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g505/1BmFLjuiAKs",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2019/3263/0/08747335",
"title": "Mirror Surface Reconstruction Using Polarization Field",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2019/08747335/1bcJwaY8Oek",
"parentPublication": {
"id": "proceedings/iccp/2019/3263/0",
"title": "2019 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010040621",
"articleId": "13rRUwkxc5k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010040599",
"articleId": "13rRUNvyate",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7k",
"title": "May",
"year": "2011",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCitJ9",
"doi": "10.1109/TVCG.2010.75",
"abstract": "We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds an octree for the given set of oriented points, then computes an implicit function over the space of the octree, and finally extracts an isosurface as a watertight triangle mesh. A key component of our algorithm is a novel technique for octree construction on the GPU. This technique builds octrees in real time and uses level-order traversals to exploit the fine-grained parallelism of the GPU. Moreover, the technique produces octrees that provide fast access to the neighborhood information of each octree node, which is critical for fast GPU surface reconstruction. With an octree so constructed, our GPU algorithm performs Poisson surface reconstruction, which produces high-quality surfaces through a global optimization. Given a set of 500K points, our algorithm runs at the rate of about five frames per second, which is over two orders of magnitude faster than previous CPU algorithms. To demonstrate the potential of our algorithm, we propose a user-guided surface reconstruction technique which reduces the topological ambiguity and improves reconstruction results for imperfect scan data. We also show how to use our algorithm to perform on-the-fly conversion from dynamic point clouds to surfaces as well as to reconstruct fluid surfaces for real-time fluid simulation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds an octree for the given set of oriented points, then computes an implicit function over the space of the octree, and finally extracts an isosurface as a watertight triangle mesh. A key component of our algorithm is a novel technique for octree construction on the GPU. This technique builds octrees in real time and uses level-order traversals to exploit the fine-grained parallelism of the GPU. Moreover, the technique produces octrees that provide fast access to the neighborhood information of each octree node, which is critical for fast GPU surface reconstruction. With an octree so constructed, our GPU algorithm performs Poisson surface reconstruction, which produces high-quality surfaces through a global optimization. Given a set of 500K points, our algorithm runs at the rate of about five frames per second, which is over two orders of magnitude faster than previous CPU algorithms. To demonstrate the potential of our algorithm, we propose a user-guided surface reconstruction technique which reduces the topological ambiguity and improves reconstruction results for imperfect scan data. We also show how to use our algorithm to perform on-the-fly conversion from dynamic point clouds to surfaces as well as to reconstruct fluid surfaces for real-time fluid simulation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds an octree for the given set of oriented points, then computes an implicit function over the space of the octree, and finally extracts an isosurface as a watertight triangle mesh. A key component of our algorithm is a novel technique for octree construction on the GPU. This technique builds octrees in real time and uses level-order traversals to exploit the fine-grained parallelism of the GPU. Moreover, the technique produces octrees that provide fast access to the neighborhood information of each octree node, which is critical for fast GPU surface reconstruction. With an octree so constructed, our GPU algorithm performs Poisson surface reconstruction, which produces high-quality surfaces through a global optimization. Given a set of 500K points, our algorithm runs at the rate of about five frames per second, which is over two orders of magnitude faster than previous CPU algorithms. To demonstrate the potential of our algorithm, we propose a user-guided surface reconstruction technique which reduces the topological ambiguity and improves reconstruction results for imperfect scan data. We also show how to use our algorithm to perform on-the-fly conversion from dynamic point clouds to surfaces as well as to reconstruct fluid surfaces for real-time fluid simulation.",
"title": "Data-Parallel Octrees for Surface Reconstruction",
"normalizedTitle": "Data-Parallel Octrees for Surface Reconstruction",
"fno": "ttg2011050669",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Surface Reconstruction",
"Octree",
"Programable Graphics Unit",
"Marching Cubes"
],
"authors": [
{
"givenName": "Kun",
"surname": "Zhou",
"fullName": "Kun Zhou",
"affiliation": "Zhejiang University, HangZhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minmin",
"surname": "Gong",
"fullName": "Minmin Gong",
"affiliation": "Microsoft Research Asia, Beijing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Huang",
"fullName": "Xin Huang",
"affiliation": "Microsoft Research Asia, Beijing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Baining",
"surname": "Guo",
"fullName": "Baining Guo",
"affiliation": "Microsoft Research Asia, Beijing",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-05-01 00:00:00",
"pubType": "trans",
"pages": "669-681",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/1998/8295/0/82951067",
"title": "3D Reconstruction with projective Octrees and Epipolar Geometry",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1998/82951067/12OmNBE7Mrv",
"parentPublication": {
"id": "proceedings/iccv/1998/8295/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880259",
"title": "Surface Reconstruction of Noisy and Defective Data Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880259/12OmNwvVrCE",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2006/2686/0/26860205",
"title": "Robust adaptive meshes for implicit surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2006/26860205/12OmNxb5hwt",
"parentPublication": {
"id": "proceedings/sibgrapi/2006/2686/0",
"title": "2006 19th Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/3/252130950",
"title": "Triangular Mesh Generation of Octrees of Non-Convex 3D Objects",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252130950/12OmNylKB4R",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/3",
"title": "2006 18th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2008/2835/0/28350018",
"title": "Dendro: parallel algorithms for multigrid and AMR methods on 2:1 balanced octrees",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2008/28350018/12OmNz6iOOi",
"parentPublication": {
"id": "proceedings/sc/2008/2835/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2010/4216/0/4216a151",
"title": "Parallel Linear Octree Meshing with Immersed Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2010/4216a151/12OmNzYwchT",
"parentPublication": {
"id": "proceedings/sbac-pad/2010/4216/0",
"title": "Computer Architecture and High Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2001/1007/0/10070306",
"title": "A Marching Voxels Method for Surface Rendering of Volume Data",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2001/10070306/12OmNzdoN6A",
"parentPublication": {
"id": "proceedings/cgi/2001/1007/0",
"title": "Proceedings. Computer Graphics International 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0/08291962",
"title": "Integrated Quality Mesh Generation for Poisson Surface Reconstruction in HPC Applications",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2017/08291962/17D45VsBTYE",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0",
"title": "2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09839681",
"title": "SSRNet: Scalable 3D Surface Reconstruction Network",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09839681/1FisL8u19du",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800a967",
"title": "SSRNet: Scalable 3D Surface Reconstruction Network",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800a967/1m3nKc80MlG",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011050655",
"articleId": "13rRUwdrdSx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011050682",
"articleId": "13rRUxZRbnZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxVV61W",
"title": "July",
"year": "2004",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "26",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNEqR8",
"doi": "10.1109/TPAMI.2004.31",
"abstract": "Abstract—For surface reconstruction problems with noisy and incomplete range data, a Bayesian estimation approach can improve the overall quality of the surfaces. The Bayesian approach to surface estimation relies on a likelihood term, which ties the surface estimate to the input data, and the prior, which ensures surface smoothness or continuity. This paper introduces a new high-order, nonlinear prior for surface reconstruction. The proposed prior can smooth complex, noisy surfaces, while preserving sharp, geometric features, and it is a natural generalization of edge-preserving methods in image processing, such as anisotropic diffusion. An exact solution would require solving a fourth-order partial differential equation (PDE), which can be difficult with conventional numerical techniques. Our approach is to solve a cascade system of two second-order PDEs, which resembles the original fourth-order system. This strategy is based on the observation that the generalization of image processing to surfaces entails filtering the surface normals. We solve one PDE for processing the normals and one for refitting the surface to the normals. Furthermore, we implement the associated surface deformations using level sets. Hence, the algorithm can accommodate very complex shapes with arbitrary and changing topologies. This paper gives the mathematical formulation and describes the numerical algorithms. We also show results using range and medical data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—For surface reconstruction problems with noisy and incomplete range data, a Bayesian estimation approach can improve the overall quality of the surfaces. The Bayesian approach to surface estimation relies on a likelihood term, which ties the surface estimate to the input data, and the prior, which ensures surface smoothness or continuity. This paper introduces a new high-order, nonlinear prior for surface reconstruction. The proposed prior can smooth complex, noisy surfaces, while preserving sharp, geometric features, and it is a natural generalization of edge-preserving methods in image processing, such as anisotropic diffusion. An exact solution would require solving a fourth-order partial differential equation (PDE), which can be difficult with conventional numerical techniques. Our approach is to solve a cascade system of two second-order PDEs, which resembles the original fourth-order system. This strategy is based on the observation that the generalization of image processing to surfaces entails filtering the surface normals. We solve one PDE for processing the normals and one for refitting the surface to the normals. Furthermore, we implement the associated surface deformations using level sets. Hence, the algorithm can accommodate very complex shapes with arbitrary and changing topologies. This paper gives the mathematical formulation and describes the numerical algorithms. We also show results using range and medical data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—For surface reconstruction problems with noisy and incomplete range data, a Bayesian estimation approach can improve the overall quality of the surfaces. The Bayesian approach to surface estimation relies on a likelihood term, which ties the surface estimate to the input data, and the prior, which ensures surface smoothness or continuity. This paper introduces a new high-order, nonlinear prior for surface reconstruction. The proposed prior can smooth complex, noisy surfaces, while preserving sharp, geometric features, and it is a natural generalization of edge-preserving methods in image processing, such as anisotropic diffusion. An exact solution would require solving a fourth-order partial differential equation (PDE), which can be difficult with conventional numerical techniques. Our approach is to solve a cascade system of two second-order PDEs, which resembles the original fourth-order system. This strategy is based on the observation that the generalization of image processing to surfaces entails filtering the surface normals. We solve one PDE for processing the normals and one for refitting the surface to the normals. Furthermore, we implement the associated surface deformations using level sets. Hence, the algorithm can accommodate very complex shapes with arbitrary and changing topologies. This paper gives the mathematical formulation and describes the numerical algorithms. We also show results using range and medical data.",
"title": "Higher-Order Nonlinear Priors for Surface Reconstruction",
"normalizedTitle": "Higher-Order Nonlinear Priors for Surface Reconstruction",
"fno": "i0878",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Surface Reconstruction",
"Robust Estimation",
"Anisotropic Diffusion",
"Level Sets"
],
"authors": [
{
"givenName": "Tolga",
"surname": "Tasdizen",
"fullName": "Tolga Tasdizen",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ross",
"surname": "Whitaker",
"fullName": "Ross Whitaker",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2004-07-01 00:00:00",
"pubType": "trans",
"pages": "878-891",
"year": "2004",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2001/1195/0/11950404",
"title": "Finite Difference Surface Representation Considering Effect of Boundary Curvature",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2001/11950404/12OmNBhHt9W",
"parentPublication": {
"id": "proceedings/iv/2001/1195/0",
"title": "Proceedings Fifth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2003/1991/0/19910353",
"title": "Anisotropic diffusion of surface normals for feature preserving surface reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2003/19910353/12OmNrFkeSE",
"parentPublication": {
"id": "proceedings/3dim/2003/1991/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498tasdizen",
"title": "Geometric Surface Smoothing via Anisotropic Diffusion of Normals",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498tasdizen/12OmNyRg4pW",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459381",
"title": "Attached shadow coding: Estimating surface normals from shadows under unknown reflectance and lighting conditions",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459381/12OmNylsZWO",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870159",
"title": "Fast Normal Estimation Using Surface Characteristics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870159/12OmNyr8YwV",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2001/0853/0/08530250",
"title": "Surface Representation Using Second, Fourth and Mixed Order Partial Differential Equations",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2001/08530250/12OmNzsJ7tQ",
"parentPublication": {
"id": "proceedings/smi/2001/0853/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g305",
"title": "Reconstructing Surfaces for Sparse Point Clouds with On-Surface Priors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g305/1H1jpDpUMPS",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b404",
"title": "Non-Line-of-Sight Surface Reconstruction Using the Directional Light-Cone Transform",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b404/1m3nmtpZT8I",
"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/716800e715",
"title": "Shape Reconstruction by Learning Differentiable Surface Representations",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800e715/1m3o2Uz2vok",
"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/12/09583771",
"title": "Surface Normals and Shape From Water",
"doi": null,
"abstractUrl": "/journal/tp/2022/12/09583771/1xSHN8Dq0HS",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0862",
"articleId": "13rRUygT7aa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0892",
"articleId": "13rRUzphDyT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrYlmwv",
"title": "January",
"year": "2011",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvgm",
"doi": "10.1109/TPAMI.2010.61",
"abstract": "We consider the problem of spatially and temporally registering multiple video sequences of dynamical scenes which contain, but are not limited to, nonrigid objects such as fireworks, flags fluttering in the wind, etc., taken from different vantage points. This problem is extremely challenging due to the presence of complex variations in the appearance of such dynamic scenes. In this paper, we propose a simple algorithm for matching such complex scenes. Our algorithm does not require the cameras to be synchronized, and is not based on frame-by-frame or volume-by-volume registration. Instead, we model each video as the output of a linear dynamical system and transform the task of registering the video sequences to that of registering the parameters of the corresponding dynamical models. As these parameters are not uniquely defined, one cannot directly compare them to perform registration. We resolve these ambiguities by jointly identifying the parameters from multiple video sequences, and converting the identified parameters to a canonical form. This reduces the video registration problem to a multiple image registration problem, which can be efficiently solved using existing image matching techniques. We test our algorithm on a wide variety of challenging video sequences and show that it matches the performance of significantly more computationally expensive existing methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We consider the problem of spatially and temporally registering multiple video sequences of dynamical scenes which contain, but are not limited to, nonrigid objects such as fireworks, flags fluttering in the wind, etc., taken from different vantage points. This problem is extremely challenging due to the presence of complex variations in the appearance of such dynamic scenes. In this paper, we propose a simple algorithm for matching such complex scenes. Our algorithm does not require the cameras to be synchronized, and is not based on frame-by-frame or volume-by-volume registration. Instead, we model each video as the output of a linear dynamical system and transform the task of registering the video sequences to that of registering the parameters of the corresponding dynamical models. As these parameters are not uniquely defined, one cannot directly compare them to perform registration. We resolve these ambiguities by jointly identifying the parameters from multiple video sequences, and converting the identified parameters to a canonical form. This reduces the video registration problem to a multiple image registration problem, which can be efficiently solved using existing image matching techniques. We test our algorithm on a wide variety of challenging video sequences and show that it matches the performance of significantly more computationally expensive existing methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We consider the problem of spatially and temporally registering multiple video sequences of dynamical scenes which contain, but are not limited to, nonrigid objects such as fireworks, flags fluttering in the wind, etc., taken from different vantage points. This problem is extremely challenging due to the presence of complex variations in the appearance of such dynamic scenes. In this paper, we propose a simple algorithm for matching such complex scenes. Our algorithm does not require the cameras to be synchronized, and is not based on frame-by-frame or volume-by-volume registration. Instead, we model each video as the output of a linear dynamical system and transform the task of registering the video sequences to that of registering the parameters of the corresponding dynamical models. As these parameters are not uniquely defined, one cannot directly compare them to perform registration. We resolve these ambiguities by jointly identifying the parameters from multiple video sequences, and converting the identified parameters to a canonical form. This reduces the video registration problem to a multiple image registration problem, which can be efficiently solved using existing image matching techniques. We test our algorithm on a wide variety of challenging video sequences and show that it matches the performance of significantly more computationally expensive existing methods.",
"title": "Video Registration Using Dynamic Textures",
"normalizedTitle": "Video Registration Using Dynamic Textures",
"fno": "ttp2011010158",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Dynamic Textures",
"Video Registration",
"Nonrigid Dynamical Scenes"
],
"authors": [
{
"givenName": "Avinash",
"surname": "Ravichandran",
"fullName": "Avinash Ravichandran",
"affiliation": "The Johns Hopkins University, Baltimore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "René",
"surname": "Vidal",
"fullName": "René Vidal",
"affiliation": "The Johns Hopkins Univeristy, Baltimore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2011-01-01 00:00:00",
"pubType": "trans",
"pages": "158-171",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2011/0394/0/05995438",
"title": "Global temporal registration of multiple non-rigid surface sequences",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995438/12OmNAWpyv5",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457650",
"title": "Video-based raindrop detection for improved image registration",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457650/12OmNCdBDLr",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995632",
"title": "Efficient groupwise non-rigid registration of textured surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995632/12OmNvzJG3q",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csie/2009/3507/6/3507f239",
"title": "A Hybrid Image Registration for Different Phases of Contrast Enhanced Liver CT Data",
"doi": null,
"abstractUrl": "/proceedings-article/csie/2009/3507f239/12OmNxw5Bol",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2003/1971/0/19710313",
"title": "On Registration of Regions of Interest (ROI) in Video Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2003/19710313/12OmNyz5JU8",
"parentPublication": {
"id": "proceedings/avss/2003/1971/0",
"title": "Proceedings of the IEEE Conference on Advanced Video and Signal Based Surveillance, 2003.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04409036",
"title": "Optimization and Learning for Registration of Moving Dynamic Textures",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04409036/12OmNzcPAzs",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1995/05/mcg1995050052",
"title": "Dynamic Registration Correction in Video-Based Augmented Reality Systems",
"doi": null,
"abstractUrl": "/magazine/cg/1995/05/mcg1995050052/13rRUIJcWfT",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/07/ttp2013071606",
"title": "Clustering Dynamic Textures with the Hierarchical EM Algorithm for Modeling Video",
"doi": null,
"abstractUrl": "/journal/tp/2013/07/ttp2013071606/13rRUwInuXt",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/10/ttp2009101862",
"title": "Layered Dynamic Textures",
"doi": null,
"abstractUrl": "/journal/tp/2009/10/ttp2009101862/13rRUxASuiR",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/08/ttp2011081633",
"title": "Robust Point Set Registration Using Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/journal/tp/2011/08/ttp2011081633/13rRUxjQycY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011010144",
"articleId": "13rRUwvT9hn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011010172",
"articleId": "13rRUxDItil",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwfb6TD",
"title": "April",
"year": "2006",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "28",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhHcKh",
"doi": "10.1109/TPAMI.2006.81",
"abstract": "In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, however, the local relationship among neighboring points is stronger and more stable than the global one. In this paper, we introduce the notion of a neighborhood structure for the general point matching problem. We formulate point matching as an optimization problem to preserve local neighborhood structures during matching. Our approach has a simple graph matching interpretation, where each point is a node in the graph, and two nodes are connected by an edge if they are neighbors. The optimal match between two graphs is the one that maximizes the number of matched edges. Existing techniques are leveraged to search for an optimal solution with the shape context distance used to initialize the graph matching, followed by relaxation labeling updates for refinement. Extensive experiments show the robustness of our approach under deformation, noise in point locations, outliers, occlusion, and rotation. It outperforms the shape context and TPS-RPM algorithms on most scenarios.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, however, the local relationship among neighboring points is stronger and more stable than the global one. In this paper, we introduce the notion of a neighborhood structure for the general point matching problem. We formulate point matching as an optimization problem to preserve local neighborhood structures during matching. Our approach has a simple graph matching interpretation, where each point is a node in the graph, and two nodes are connected by an edge if they are neighbors. The optimal match between two graphs is the one that maximizes the number of matched edges. Existing techniques are leveraged to search for an optimal solution with the shape context distance used to initialize the graph matching, followed by relaxation labeling updates for refinement. Extensive experiments show the robustness of our approach under deformation, noise in point locations, outliers, occlusion, and rotation. It outperforms the shape context and TPS-RPM algorithms on most scenarios.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, however, the local relationship among neighboring points is stronger and more stable than the global one. In this paper, we introduce the notion of a neighborhood structure for the general point matching problem. We formulate point matching as an optimization problem to preserve local neighborhood structures during matching. Our approach has a simple graph matching interpretation, where each point is a node in the graph, and two nodes are connected by an edge if they are neighbors. The optimal match between two graphs is the one that maximizes the number of matched edges. Existing techniques are leveraged to search for an optimal solution with the shape context distance used to initialize the graph matching, followed by relaxation labeling updates for refinement. Extensive experiments show the robustness of our approach under deformation, noise in point locations, outliers, occlusion, and rotation. It outperforms the shape context and TPS-RPM algorithms on most scenarios.",
"title": "Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures",
"normalizedTitle": "Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures",
"fno": "i0643",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Point Matching",
"Shape Matching",
"Image Registration",
"Nonrigid Shapes",
"Relaxation Labeling"
],
"authors": [
{
"givenName": "Yefeng",
"surname": "Zheng",
"fullName": "Yefeng Zheng",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Doermann",
"fullName": "David Doermann",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2006-04-01 00:00:00",
"pubType": "trans",
"pages": "643-649",
"year": "2006",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isda/2006/2528/2/252820497",
"title": "Design and Realization of Medical Image Nonrigid Matching Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2006/252820497/12OmNAoDi4Q",
"parentPublication": {
"id": "proceedings/isda/2006/2528/2",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/1/3735a256",
"title": "Point Pattern Matching with Locality Preserving Descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735a256/12OmNqESufI",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/1",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2013/1309/0/06732502",
"title": "Image registration using consistent robust point matching",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732502/12OmNvEQsej",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/1995/7190/0/71900289",
"title": "Point correspondence in unstructured nonrigid motion",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/1995/71900289/12OmNx1Iw8h",
"parentPublication": {
"id": "proceedings/iscv/1995/7190/0",
"title": "Computer Vision, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scam/2008/3353/0/3353a111",
"title": "From Indentation Shapes to Code Structures",
"doi": null,
"abstractUrl": "/proceedings-article/scam/2008/3353a111/12OmNxymobE",
"parentPublication": {
"id": "proceedings/scam/2008/3353/0",
"title": "2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2015/6850/0/6850a116",
"title": "An Algorithm of Image Matching Based on Mahalanobis Distance and Weighted KNN Graph",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2015/6850a116/12OmNzVGcHA",
"parentPublication": {
"id": "proceedings/icisce/2015/6850/0",
"title": "2015 2nd International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06060815",
"title": "Robust Dense Registration of Partial Nonrigid Shapes",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06060815/13rRUxASu0I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/08/ttp2011081633",
"title": "Robust Point Set Registration Using Gaussian Mixture Models",
"doi": null,
"abstractUrl": "/journal/tp/2011/08/ttp2011081633/13rRUxjQycY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/02/ttp2011020427",
"title": "Topology Preserving Relaxation Labeling for Nonrigid Point Matching",
"doi": null,
"abstractUrl": "/journal/tp/2011/02/ttp2011020427/13rRUytF42C",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09684725",
"title": "Neighborhood Preserving Kernels for Attributed Graphs",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09684725/1AgmlkCAqzu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0637",
"articleId": "13rRUwfZC1q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0650",
"articleId": "13rRUNvgzaX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAZx8Oo",
"title": "January",
"year": "2010",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "32",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNW20p",
"doi": "10.1109/TPAMI.2008.265",
"abstract": "The registration problem for images of a deforming surface has been well studied. External occlusions are usually well handled. In 2D image-based registration, self-occlusions are more challenging. Consequently, the surface is usually assumed to be only slightly self-occluding. This paper is about image-based nonrigid registration with self-occlusion reasoning. A specific framework explicitly modeling self-occlusions is proposed. It is combined with an intensity-based, “direct” data term for registration. Self-occlusions are detected as shrinkage areas in the 2D warp. Experimental results on several challenging data sets show that our approach successfully registers images with self-occlusions while effectively detecting the self-occluded regions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The registration problem for images of a deforming surface has been well studied. External occlusions are usually well handled. In 2D image-based registration, self-occlusions are more challenging. Consequently, the surface is usually assumed to be only slightly self-occluding. This paper is about image-based nonrigid registration with self-occlusion reasoning. A specific framework explicitly modeling self-occlusions is proposed. It is combined with an intensity-based, “direct” data term for registration. Self-occlusions are detected as shrinkage areas in the 2D warp. Experimental results on several challenging data sets show that our approach successfully registers images with self-occlusions while effectively detecting the self-occluded regions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The registration problem for images of a deforming surface has been well studied. External occlusions are usually well handled. In 2D image-based registration, self-occlusions are more challenging. Consequently, the surface is usually assumed to be only slightly self-occluding. This paper is about image-based nonrigid registration with self-occlusion reasoning. A specific framework explicitly modeling self-occlusions is proposed. It is combined with an intensity-based, “direct” data term for registration. Self-occlusions are detected as shrinkage areas in the 2D warp. Experimental results on several challenging data sets show that our approach successfully registers images with self-occlusions while effectively detecting the self-occluded regions.",
"title": "Direct Estimation of Nonrigid Registrations with Image-Based Self-Occlusion Reasoning",
"normalizedTitle": "Direct Estimation of Nonrigid Registrations with Image-Based Self-Occlusion Reasoning",
"fno": "ttp2010010087",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Nonrigid Registration",
"Self Occlusion",
"Direct Method",
"Image Retexturing"
],
"authors": [
{
"givenName": "Vincent",
"surname": "Gay-Bellile",
"fullName": "Vincent Gay-Bellile",
"affiliation": "CEA Saclay and LASMEA, UMR, CNRS/UBP, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adrien",
"surname": "Bartoli",
"fullName": "Adrien Bartoli",
"affiliation": "LASMEA, UMR, CNRS/UBP, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Patrick",
"surname": "Sayd",
"fullName": "Patrick Sayd",
"affiliation": "CEA Saclay, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2010-01-01 00:00:00",
"pubType": "trans",
"pages": "87-104",
"year": "2010",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2007/1630/0/04408989",
"title": "Direct Estimation of Non-Rigid Registrations with Image-Based Self-Occlusion Reasoning",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04408989/12OmNAkniW5",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ihmsc/2010/4151/1/4151a143",
"title": "Efficient 3D Hand Posture Estimation with Self-Occlusion from Multiview Images",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2010/4151a143/12OmNAnuTp2",
"parentPublication": {
"id": "proceedings/ihmsc/2010/4151/1",
"title": "Intelligent Human-Machine Systems and Cybernetics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2007/1749/0/04538853",
"title": "Deformable Surface Augmentation in Spite of Self-Occlusions",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2007/04538853/12OmNrH1PzV",
"parentPublication": {
"id": "proceedings/ismar/2007/1749/0",
"title": "2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2010/3987/2/3987b082",
"title": "A Nonrigid Image Registration Approach Based on Cooperative Game Among Pixels",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2010/3987b082/12OmNvSKO2Z",
"parentPublication": {
"id": "proceedings/etcs/2010/3987/2",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/398P3B31",
"title": "Occlusion reasoning for object detection under arbitrary viewpoint",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/398P3B31/12OmNviHKbU",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995588",
"title": "2D nonrigid partial shape matching using MCMC and contour subdivision",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995588/12OmNvnwVlH",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995632",
"title": "Efficient groupwise non-rigid registration of textured surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995632/12OmNvzJG3q",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06060815",
"title": "Robust Dense Registration of Partial Nonrigid Shapes",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06060815/13rRUxASu0I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/07/07533440",
"title": "Randomly Perturbed B-Splines for Nonrigid Image Registration",
"doi": null,
"abstractUrl": "/journal/tp/2017/07/07533440/13rRUyYSWmh",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/11/ttp2010111994",
"title": "Computing Accurate Correspondences across Groups of Images",
"doi": null,
"abstractUrl": "/journal/tp/2010/11/ttp2010111994/13rRUytWFaj",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2010010072",
"articleId": "13rRUNvyagg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2010010105",
"articleId": "13rRUwh80vF",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvSbBJM",
"title": "August",
"year": "2011",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQycY",
"doi": "10.1109/TPAMI.2010.223",
"abstract": "In this paper, we present a unified framework for the rigid and nonrigid point set registration problem in the presence of significant amounts of noise and outliers. The key idea of this registration framework is to represent the input point sets using Gaussian mixture models. Then, the problem of point set registration is reformulated as the problem of aligning two Gaussian mixtures such that a statistical discrepancy measure between the two corresponding mixtures is minimized. We show that the popular iterative closest point (ICP) method [1] and several existing point set registration methods [2], [3], [4], [5], [6], [7] in the field are closely related and can be reinterpreted meaningfully in our general framework. Our instantiation of this general framework is based on the the L2 distance between two Gaussian mixtures, which has the closed-form expression and in turn leads to a computationally efficient registration algorithm. The resulting registration algorithm exhibits inherent statistical robustness, has an intuitive interpretation, and is simple to implement. We also provide theoretical and experimental comparisons with other robust methods for point set registration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a unified framework for the rigid and nonrigid point set registration problem in the presence of significant amounts of noise and outliers. The key idea of this registration framework is to represent the input point sets using Gaussian mixture models. Then, the problem of point set registration is reformulated as the problem of aligning two Gaussian mixtures such that a statistical discrepancy measure between the two corresponding mixtures is minimized. We show that the popular iterative closest point (ICP) method [1] and several existing point set registration methods [2], [3], [4], [5], [6], [7] in the field are closely related and can be reinterpreted meaningfully in our general framework. Our instantiation of this general framework is based on the the L2 distance between two Gaussian mixtures, which has the closed-form expression and in turn leads to a computationally efficient registration algorithm. The resulting registration algorithm exhibits inherent statistical robustness, has an intuitive interpretation, and is simple to implement. We also provide theoretical and experimental comparisons with other robust methods for point set registration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a unified framework for the rigid and nonrigid point set registration problem in the presence of significant amounts of noise and outliers. The key idea of this registration framework is to represent the input point sets using Gaussian mixture models. Then, the problem of point set registration is reformulated as the problem of aligning two Gaussian mixtures such that a statistical discrepancy measure between the two corresponding mixtures is minimized. We show that the popular iterative closest point (ICP) method [1] and several existing point set registration methods [2], [3], [4], [5], [6], [7] in the field are closely related and can be reinterpreted meaningfully in our general framework. Our instantiation of this general framework is based on the the L2 distance between two Gaussian mixtures, which has the closed-form expression and in turn leads to a computationally efficient registration algorithm. The resulting registration algorithm exhibits inherent statistical robustness, has an intuitive interpretation, and is simple to implement. We also provide theoretical and experimental comparisons with other robust methods for point set registration.",
"title": "Robust Point Set Registration Using Gaussian Mixture Models",
"normalizedTitle": "Robust Point Set Registration Using Gaussian Mixture Models",
"fno": "ttp2011081633",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Point Set Registration",
"Nonrigid Registration",
"Gaussian Mixtures",
"Robust Matching"
],
"authors": [
{
"givenName": "Bing",
"surname": "Jian",
"fullName": "Bing Jian",
"affiliation": "Siemens Healthcare, Malvern",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Baba C.",
"surname": "Vemuri",
"fullName": "Baba C. Vemuri",
"affiliation": "University of Florida, Gainesville",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2011-08-01 00:00:00",
"pubType": "trans",
"pages": "1633-1645",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2016/1611/0/07822551",
"title": "Cardiac image registration by combining point set matching with surface structure features",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2016/07822551/12OmNA14A4G",
"parentPublication": {
"id": "proceedings/bibm/2016/1611/0",
"title": "2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995744",
"title": "Robust point set registration using EM-ICP with information-theoretically optimal outlier handling",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995744/12OmNC943FH",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/07410845",
"title": "An Adaptive Data Representation for Robust Point-Set Registration and Merging",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/07410845/12OmNqBtiPw",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032c688",
"title": "Point Set Registration with Global-Local Correspondence and Transformation Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032c688/12OmNro0HRE",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a058",
"title": "Robust Point Set Matching under Variational Bayesian Framework",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a058/12OmNynsbzK",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2007/2932/0/29320099",
"title": "Automatic Genre Classification of TV Programmes Using Gaussian Mixture Models and Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2007/29320099/12OmNzyGH5Y",
"parentPublication": {
"id": "proceedings/dexa/2007/2932/0",
"title": "18th International Workshop on Database and Expert Systems Applications (DEXA 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/12/ttp2010122262",
"title": "Point Set Registration: Coherent Point Drift",
"doi": null,
"abstractUrl": "/journal/tp/2010/12/ttp2010122262/13rRUwghdae",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/03/ttp2011030587",
"title": "Rigid and Articulated Point Registration with Expectation Conditional Maximization",
"doi": null,
"abstractUrl": "/journal/tp/2011/03/ttp2011030587/13rRUytF42D",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600e500",
"title": "Overlap-guided Gaussian Mixture Models for Point Cloud Registration",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600e500/1L8qlfO8Lcs",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/08/09290402",
"title": "Acceleration of Non-Rigid Point Set Registration With Downsampling and Gaussian Process Regression",
"doi": null,
"abstractUrl": "/journal/tp/2021/08/09290402/1prKIrOP53a",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011081619",
"articleId": "13rRUIM2VId",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011081646",
"articleId": "13rRUx0xPoa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SOY",
"doi": "10.1109/TVCG.2016.2599016",
"abstract": "Inertial particles are finite-sized objects that are carried by fluid flows and in contrast to massless tracer particles they are subject to inertia effects. In unsteady flows, the dynamics of tracer particles have been extensively studied by the extraction of Lagrangian coherent structures (LCS), such as hyperbolic LCS as ridges of the Finite-Time Lyapunov Exponent (FTLE). The extension of the rich LCS framework to inertial particles is currently a hot topic in the CFD literature and is actively under research. Recently, backward FTLE on tracer particles has been shown to correlate with the preferential particle settling of small inertial particles. For larger particles, inertial trajectories may deviate strongly from (massless) tracer trajectories, and thus for a better agreement, backward FTLE should be computed on inertial trajectories directly. Inertial backward integration, however, has not been possible until the recent introduction of the influence curve concept, which — given an observation and an initial velocity — allows to recover all sources of inertial particles as tangent curves of a derived vector field. In this paper, we show that FTLE on the influence curve vector field is in agreement with preferential particle settling and more importantly it is not only valid for small (near-tracer) particles. We further generalize the influence curve concept to general equations of motion in unsteady spatio-velocity phase spaces, which enables backward integration with more general equations of motion. Applying the influence curve concept to tracer particles in the spatio-velocity domain emits streaklines in massless flows as tangent curves of the influence curve vector field. We demonstrate the correlation between inertial backward FTLE and the preferential particle settling in a number of unsteady vector fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Inertial particles are finite-sized objects that are carried by fluid flows and in contrast to massless tracer particles they are subject to inertia effects. In unsteady flows, the dynamics of tracer particles have been extensively studied by the extraction of Lagrangian coherent structures (LCS), such as hyperbolic LCS as ridges of the Finite-Time Lyapunov Exponent (FTLE). The extension of the rich LCS framework to inertial particles is currently a hot topic in the CFD literature and is actively under research. Recently, backward FTLE on tracer particles has been shown to correlate with the preferential particle settling of small inertial particles. For larger particles, inertial trajectories may deviate strongly from (massless) tracer trajectories, and thus for a better agreement, backward FTLE should be computed on inertial trajectories directly. Inertial backward integration, however, has not been possible until the recent introduction of the influence curve concept, which — given an observation and an initial velocity — allows to recover all sources of inertial particles as tangent curves of a derived vector field. In this paper, we show that FTLE on the influence curve vector field is in agreement with preferential particle settling and more importantly it is not only valid for small (near-tracer) particles. We further generalize the influence curve concept to general equations of motion in unsteady spatio-velocity phase spaces, which enables backward integration with more general equations of motion. Applying the influence curve concept to tracer particles in the spatio-velocity domain emits streaklines in massless flows as tangent curves of the influence curve vector field. We demonstrate the correlation between inertial backward FTLE and the preferential particle settling in a number of unsteady vector fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Inertial particles are finite-sized objects that are carried by fluid flows and in contrast to massless tracer particles they are subject to inertia effects. In unsteady flows, the dynamics of tracer particles have been extensively studied by the extraction of Lagrangian coherent structures (LCS), such as hyperbolic LCS as ridges of the Finite-Time Lyapunov Exponent (FTLE). The extension of the rich LCS framework to inertial particles is currently a hot topic in the CFD literature and is actively under research. Recently, backward FTLE on tracer particles has been shown to correlate with the preferential particle settling of small inertial particles. For larger particles, inertial trajectories may deviate strongly from (massless) tracer trajectories, and thus for a better agreement, backward FTLE should be computed on inertial trajectories directly. Inertial backward integration, however, has not been possible until the recent introduction of the influence curve concept, which — given an observation and an initial velocity — allows to recover all sources of inertial particles as tangent curves of a derived vector field. In this paper, we show that FTLE on the influence curve vector field is in agreement with preferential particle settling and more importantly it is not only valid for small (near-tracer) particles. We further generalize the influence curve concept to general equations of motion in unsteady spatio-velocity phase spaces, which enables backward integration with more general equations of motion. Applying the influence curve concept to tracer particles in the spatio-velocity domain emits streaklines in massless flows as tangent curves of the influence curve vector field. We demonstrate the correlation between inertial backward FTLE and the preferential particle settling in a number of unsteady vector fields.",
"title": "Backward Finite-Time Lyapunov Exponents in Inertial Flows",
"normalizedTitle": "Backward Finite-Time Lyapunov Exponents in Inertial Flows",
"fno": "07539598",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Mathematical Model",
"Trajectory",
"Atmospheric Modeling",
"Gravity",
"Automobiles",
"Three Dimensional Displays",
"Preferential Particle Settling",
"Inertial Particles",
"Finite Time Lyapunov Exponents",
"Backward Integration"
],
"authors": [
{
"givenName": "Tobias",
"surname": "Günther",
"fullName": "Tobias Günther",
"affiliation": "Visual Computing Group, University of Magdeburg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": "Visual Computing Group, University of Magdeburg",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "970-979",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2014/2874/0/2874a277",
"title": "An Alternative Formulation of Lyapunov Exponents for Computing Lagrangian Coherent Structures",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a277/12OmNwfsI0r",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crc/2017/0677/0/0677a149",
"title": "Research on Fast Measurement Method of Borehole Trajectory Based on Fiber Optic Gyro MWD System",
"doi": null,
"abstractUrl": "/proceedings-article/crc/2017/0677a149/12OmNx4gUw8",
"parentPublication": {
"id": "proceedings/crc/2017/0677/0",
"title": "2017 2nd International Conference on Cybernetics, Robotics and Control (CRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539608",
"title": "Topological Analysis of Inertial Dynamics",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539608/13rRUwIF69m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875993",
"title": "Vortex Cores of Inertial Particles",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875993/13rRUwbJD4L",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07422124",
"title": "Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07422124/13rRUxbTMyV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440096",
"title": "Objective Vortex Corelines of Finite-sized Objects in Fluid Flows",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440096/17D45WXIkH8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09992037",
"title": "CROMOSim: A Deep Learning-Based Cross-Modality Inertial Measurement Simulator",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09992037/1JevyOwzhgQ",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150951",
"title": "Upright and Stabilized Omnidirectional Depth Estimation for Wide-baseline Multi-camera Inertial Systems",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150951/1lPHA65cYus",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539583",
"articleId": "13rRUx0xPif",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539639",
"articleId": "13rRUwwJWFR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclOq",
"title": "June",
"year": "2016",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxbTMyV",
"doi": "10.1109/TVCG.2016.2534560",
"abstract": "The objective of this paper is to understand transport behavior in uncertain time-varying flow fields by redefining the finite-time Lyapunov exponent (FTLE) and Lagrangian coherent structure (LCS) as stochastic counterparts of their traditional deterministic definitions. Three new concepts are introduced: the distribution of the FTLE (D-FTLE), the FTLE of distributions (FTLE-D), and uncertain LCS (U-LCS). The D-FTLE is the probability density function of FTLE values for every spatiotemporal location, which can be visualized with different statistical measurements. The FTLE-D extends the deterministic FTLE by measuring the divergence of particle distributions. It gives a statistical overview of how transport behaviors vary in neighborhood locations. The U-LCS, the probabilities of finding LCSs over the domain, can be extracted with stochastic ridge finding and density estimation algorithms. We show that our approach produces better results than existing variance-based methods do. Our experiments also show that the combination of D-FTLE, FTLE-D, and U-LCS can help users understand transport behaviors and find separatrices in ensemble simulations of atmospheric processes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The objective of this paper is to understand transport behavior in uncertain time-varying flow fields by redefining the finite-time Lyapunov exponent (FTLE) and Lagrangian coherent structure (LCS) as stochastic counterparts of their traditional deterministic definitions. Three new concepts are introduced: the distribution of the FTLE (D-FTLE), the FTLE of distributions (FTLE-D), and uncertain LCS (U-LCS). The D-FTLE is the probability density function of FTLE values for every spatiotemporal location, which can be visualized with different statistical measurements. The FTLE-D extends the deterministic FTLE by measuring the divergence of particle distributions. It gives a statistical overview of how transport behaviors vary in neighborhood locations. The U-LCS, the probabilities of finding LCSs over the domain, can be extracted with stochastic ridge finding and density estimation algorithms. We show that our approach produces better results than existing variance-based methods do. Our experiments also show that the combination of D-FTLE, FTLE-D, and U-LCS can help users understand transport behaviors and find separatrices in ensemble simulations of atmospheric processes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The objective of this paper is to understand transport behavior in uncertain time-varying flow fields by redefining the finite-time Lyapunov exponent (FTLE) and Lagrangian coherent structure (LCS) as stochastic counterparts of their traditional deterministic definitions. Three new concepts are introduced: the distribution of the FTLE (D-FTLE), the FTLE of distributions (FTLE-D), and uncertain LCS (U-LCS). The D-FTLE is the probability density function of FTLE values for every spatiotemporal location, which can be visualized with different statistical measurements. The FTLE-D extends the deterministic FTLE by measuring the divergence of particle distributions. It gives a statistical overview of how transport behaviors vary in neighborhood locations. The U-LCS, the probabilities of finding LCSs over the domain, can be extracted with stochastic ridge finding and density estimation algorithms. We show that our approach produces better results than existing variance-based methods do. Our experiments also show that the combination of D-FTLE, FTLE-D, and U-LCS can help users understand transport behaviors and find separatrices in ensemble simulations of atmospheric processes.",
"title": "Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows",
"normalizedTitle": "Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows",
"fno": "07422124",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Uncertainty",
"Atmospheric Measurements",
"Particle Measurements",
"Data Visualization",
"Meteorology",
"Three Dimensional Displays",
"Topology",
"Lagrangian Coherent Structures",
"Uncertain Flow Visualization",
"Stochastic Particle Tracing",
"Lagrangian Coherent Structures",
"Uncertain Flow Visualization",
"Stochastic Particle Tracing"
],
"authors": [
{
"givenName": "Hanqi",
"surname": "Guo",
"fullName": "Hanqi Guo",
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenbin",
"surname": "He",
"fullName": "Wenbin He",
"affiliation": "Department of Computer Science and Engineering, the Ohio State University, Columbus, OH",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tom",
"surname": "Peterka",
"fullName": "Tom Peterka",
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han-Wei",
"surname": "Shen",
"fullName": "Han-Wei Shen",
"affiliation": "Department of Computer Science and Engineering, the Ohio State University, Columbus, OH",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Scott M.",
"surname": "Collis",
"fullName": "Scott M. Collis",
"affiliation": "Environmental Science Division, Argonne National Laboratory, Lemont, IL",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonathan J.",
"surname": "Helmus",
"fullName": "Jonathan J. Helmus",
"affiliation": "Environmental Science Division, Argonne National Laboratory, Lemont, IL",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2016-06-01 00:00:00",
"pubType": "trans",
"pages": "1672-1682",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icse/2012/1066/0/06227164",
"title": "What make long term contributors: Willingness and opportunity in OSS community",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2012/06227164/12OmNvSbBw7",
"parentPublication": {
"id": "proceedings/icse/2012/1066/0",
"title": "2012 34th International Conference on Software Engineering (ICSE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a277",
"title": "An Alternative Formulation of Lyapunov Exponents for Computing Lagrangian Coherent Structures",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a277/12OmNwfsI0r",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2015/8454/0/07344077",
"title": "Can student engagement be measured? And, if so, does it matter?",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2015/07344077/12OmNx3q73K",
"parentPublication": {
"id": "proceedings/fie/2015/8454/0",
"title": "2015 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2017/1562/0/1562a607",
"title": "Measuring Polarization in Twitter Enabled in Online Political Conversation: The Case of 2016 US Presidential Election",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2017/1562a607/12OmNx6g6ov",
"parentPublication": {
"id": "proceedings/iri/2017/1562/0",
"title": "2017 IEEE International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcomp/2014/5711/0/07043840",
"title": "Evaluation of PM2.5 and PM10 using normalized first-order absolute sum of high-frequency spectrum",
"doi": null,
"abstractUrl": "/proceedings-article/smartcomp/2014/07043840/12OmNx8fi8I",
"parentPublication": {
"id": "proceedings/smartcomp/2014/5711/0",
"title": "2014 International Conference on Smart Computing (SMARTCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2017/0621/0/0621a927",
"title": "Impact of Environmental Uncertainty and Organizational Mechanism on Manufacturing Flexibility through Absorptive Capacity",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2017/0621a927/12OmNzl3WTA",
"parentPublication": {
"id": "proceedings/iiai-aai/2017/0621/0",
"title": "2017 6th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539598",
"title": "Backward Finite-Time Lyapunov Exponents in Inertial Flows",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539598/13rRUxC0SOY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122159",
"title": "Lagrangian Coherent Structures for Design Analysis of Revolving Doors",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122159/13rRUxZ0o1y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805455",
"title": "Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805455/1cG4y9tZbPO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a016",
"title": "Uncertain Transport in Unsteady Flows",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a016/1qRORkoFgUU",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07422137",
"articleId": "13rRUxYINfh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07422144",
"articleId": "13rRUILtJmd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cG4y9tZbPO",
"doi": "10.1109/TVCG.2019.2934313",
"abstract": "Time-dependent fluid flows often contain numerous hyperbolic Lagrangian coherent structures, which act as transport barriers that guide the advection. The finite-time Lyapunov exponent is a commonly-used approximation to locate these repelling or attracting structures. Especially on large numerical simulations, the FTLE ridges can become arbitrarily sharp and very complex. Thus, the discrete sampling onto a grid for a subsequent direct volume rendering is likely to miss sharp ridges in the visualization. For this reason, an unbiased Monte Carlo-based rendering approach was recently proposed that treats the FTLE field as participating medium with single scattering. This method constructs a ground truth rendering without discretization, but it is prohibitively slow with render times in the order of days or weeks for a single image. In this paper, we accelerate the rendering process significantly, which allows us to compute video sequence of high-resolution FTLE animations in a much more reasonable time frame. For this, we follow two orthogonal approaches to improve on the rendering process: the volumetric light path integration in gradient domain and an acceleration of the transmittance estimation. We analyze the convergence and performance of the proposed method and demonstrate the approach by rendering complex FTLE fields in several 3D vector fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Time-dependent fluid flows often contain numerous hyperbolic Lagrangian coherent structures, which act as transport barriers that guide the advection. The finite-time Lyapunov exponent is a commonly-used approximation to locate these repelling or attracting structures. Especially on large numerical simulations, the FTLE ridges can become arbitrarily sharp and very complex. Thus, the discrete sampling onto a grid for a subsequent direct volume rendering is likely to miss sharp ridges in the visualization. For this reason, an unbiased Monte Carlo-based rendering approach was recently proposed that treats the FTLE field as participating medium with single scattering. This method constructs a ground truth rendering without discretization, but it is prohibitively slow with render times in the order of days or weeks for a single image. In this paper, we accelerate the rendering process significantly, which allows us to compute video sequence of high-resolution FTLE animations in a much more reasonable time frame. For this, we follow two orthogonal approaches to improve on the rendering process: the volumetric light path integration in gradient domain and an acceleration of the transmittance estimation. We analyze the convergence and performance of the proposed method and demonstrate the approach by rendering complex FTLE fields in several 3D vector fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Time-dependent fluid flows often contain numerous hyperbolic Lagrangian coherent structures, which act as transport barriers that guide the advection. The finite-time Lyapunov exponent is a commonly-used approximation to locate these repelling or attracting structures. Especially on large numerical simulations, the FTLE ridges can become arbitrarily sharp and very complex. Thus, the discrete sampling onto a grid for a subsequent direct volume rendering is likely to miss sharp ridges in the visualization. For this reason, an unbiased Monte Carlo-based rendering approach was recently proposed that treats the FTLE field as participating medium with single scattering. This method constructs a ground truth rendering without discretization, but it is prohibitively slow with render times in the order of days or weeks for a single image. In this paper, we accelerate the rendering process significantly, which allows us to compute video sequence of high-resolution FTLE animations in a much more reasonable time frame. For this, we follow two orthogonal approaches to improve on the rendering process: the volumetric light path integration in gradient domain and an acceleration of the transmittance estimation. We analyze the convergence and performance of the proposed method and demonstrate the approach by rendering complex FTLE fields in several 3D vector fields.",
"title": "Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents",
"normalizedTitle": "Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents",
"fno": "08805455",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Approximation Theory",
"Computer Animation",
"Hyperbolic Equations",
"Image Sequences",
"Lyapunov Methods",
"Monte Carlo Methods",
"Rendering Computer Graphics",
"Sampling Methods",
"Video Signal Processing",
"Transmittance Estimation",
"Volumetric Light Path Integration",
"Video Sequence",
"Transport Barriers",
"Commonly Used Approximation",
"Complex FTLE Fields",
"Reasonable Time Frame",
"High Resolution FTLE Animations",
"Rendering Process",
"Render Times",
"FTLE Field",
"Unbiased Monte Carlo Based Rendering Approach",
"Sharp Ridges",
"Subsequent Direct Volume Rendering",
"Discrete Sampling",
"FTLE Ridges",
"Numerical Simulations",
"Repelling",
"Numerous Hyperbolic Lagrangian Coherent Structures",
"Time Dependent Fluid Flows",
"Finite Time Lyapunov Exponent",
"Accelerated Monte Carlo Rendering",
"Rendering Computer Graphics",
"Acceleration",
"Monte Carlo Methods",
"Scattering",
"Feature Extraction",
"Data Visualization",
"Animation",
"Scientific Visualization",
"Monte Carlo",
"Feature Extraction",
"Finite Time Lyapunov Exponents",
"Gradient Domain",
"Fourier"
],
"authors": [
{
"givenName": "Irene Baeza",
"surname": "Rojo",
"fullName": "Irene Baeza Rojo",
"affiliation": "Computer Graphics Laboratory, ETH Zürich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Gross",
"fullName": "Markus Gross",
"affiliation": "Computer Graphics Laboratory, ETH Zürich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Günther",
"fullName": "Tobias Günther",
"affiliation": "Computer Graphics Laboratory, ETH Zürich",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "708-718",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300059",
"title": "Monte Carlo Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300059/12OmNCdBDFe",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2001/1007/0/10070201",
"title": "A Monte Carlo Method for Accelerating the Computation of Animated Radiosity Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2001/10070201/12OmNrYlmvM",
"parentPublication": {
"id": "proceedings/cgi/2001/1007/0",
"title": "Proceedings. Computer Graphics International 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2004/8781/0/87810033",
"title": "Interactive Transfer Function Control for Monte Carlo Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2004/87810033/12OmNwGqBoE",
"parentPublication": {
"id": "proceedings/vv/2004/8781/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2008/3307/0/3307a229",
"title": "Credit Risk Modelling using Hardware Accelerated Monte-Carlo Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2008/3307a229/12OmNxwncFQ",
"parentPublication": {
"id": "proceedings/fccm/2008/3307/0",
"title": "2008 16th International Symposium on Field-Programmable Custom Computing Machines",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/01250406",
"title": "Monte Carlo volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/01250406/12OmNzh5z86",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539598",
"title": "Backward Finite-Time Lyapunov Exponents in Inertial Flows",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539598/13rRUxC0SOY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/06/07422124",
"title": "Finite-Time Lyapunov Exponents and Lagrangian Coherent Structures in Uncertain Unsteady Flows",
"doi": null,
"abstractUrl": "/journal/tg/2016/06/07422124/13rRUxbTMyV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/01/v0023",
"title": "Error and Complexity of Random Walk Monte Carlo Radiosity",
"doi": null,
"abstractUrl": "/journal/tg/1997/01/v0023/13rRUy2YLST",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2022/02/09721666",
"title": "Hardware-Accelerated Ray Tracing of CAD-Based Geometry for Monte Carlo Radiation Transport",
"doi": null,
"abstractUrl": "/magazine/cs/2022/02/09721666/1Bhz0VJvu1i",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2018/6882/0/08823761",
"title": "FTLE Ridge Lines for Long Integration Times",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2018/08823761/1d5kyZ4adkA",
"parentPublication": {
"id": "proceedings/scivis/2018/6882/0",
"title": "2018 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08807379",
"articleId": "1cG6h8OkgJq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08807369",
"articleId": "1cG6oJ0zDtm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1fe9Op3Np8A",
"name": "ttg202001-08805455s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08805455s1.zip",
"extension": "zip",
"size": "186 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzd7bmf",
"title": "March",
"year": "2011",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvB0",
"doi": "10.1109/TVCG.2010.39",
"abstract": "This paper describes a complete system to create anatomically accurate example-based volume deformation and animation of articulated body regions, starting from multiple in vivo volume scans of a specific individual. In order to solve the correspondence problem across volume scans, a template volume is registered to each sample. The wide range of pose variations is first approximated by volume blend deformation (VBD), providing proper initialization of the articulated subject in different poses. A novel registration method is presented to efficiently reduce the computation cost while avoiding strong local minima inherent in complex articulated body volume registration. The algorithm highly constrains the degrees of freedom and search space involved in the nonlinear optimization, using hierarchical volume structures and locally constrained deformation based on the biharmonic clamped spline. Our registration step establishes a correspondence across scans, allowing a data-driven deformation approach in the volume domain. The results provide an occlusion-free person-specific 3D human body model, asymptotically accurate inner tissue deformations, and realistic volume animation of articulated movements driven by standard joint control estimated from the actual skeleton. Our approach also addresses the practical issues arising in using scans from living subjects. The robustness of our algorithms is tested by their applications on the hand, probably the most complex articulated region in the body, and the knee, a frequent subject area for medical imaging due to injuries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper describes a complete system to create anatomically accurate example-based volume deformation and animation of articulated body regions, starting from multiple in vivo volume scans of a specific individual. In order to solve the correspondence problem across volume scans, a template volume is registered to each sample. The wide range of pose variations is first approximated by volume blend deformation (VBD), providing proper initialization of the articulated subject in different poses. A novel registration method is presented to efficiently reduce the computation cost while avoiding strong local minima inherent in complex articulated body volume registration. The algorithm highly constrains the degrees of freedom and search space involved in the nonlinear optimization, using hierarchical volume structures and locally constrained deformation based on the biharmonic clamped spline. Our registration step establishes a correspondence across scans, allowing a data-driven deformation approach in the volume domain. The results provide an occlusion-free person-specific 3D human body model, asymptotically accurate inner tissue deformations, and realistic volume animation of articulated movements driven by standard joint control estimated from the actual skeleton. Our approach also addresses the practical issues arising in using scans from living subjects. The robustness of our algorithms is tested by their applications on the hand, probably the most complex articulated region in the body, and the knee, a frequent subject area for medical imaging due to injuries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper describes a complete system to create anatomically accurate example-based volume deformation and animation of articulated body regions, starting from multiple in vivo volume scans of a specific individual. In order to solve the correspondence problem across volume scans, a template volume is registered to each sample. The wide range of pose variations is first approximated by volume blend deformation (VBD), providing proper initialization of the articulated subject in different poses. A novel registration method is presented to efficiently reduce the computation cost while avoiding strong local minima inherent in complex articulated body volume registration. The algorithm highly constrains the degrees of freedom and search space involved in the nonlinear optimization, using hierarchical volume structures and locally constrained deformation based on the biharmonic clamped spline. Our registration step establishes a correspondence across scans, allowing a data-driven deformation approach in the volume domain. The results provide an occlusion-free person-specific 3D human body model, asymptotically accurate inner tissue deformations, and realistic volume animation of articulated movements driven by standard joint control estimated from the actual skeleton. Our approach also addresses the practical issues arising in using scans from living subjects. The robustness of our algorithms is tested by their applications on the hand, probably the most complex articulated region in the body, and the knee, a frequent subject area for medical imaging due to injuries.",
"title": "Scan-Based Volume Animation Driven by Locally Adaptive Articulated Registrations",
"normalizedTitle": "Scan-Based Volume Animation Driven by Locally Adaptive Articulated Registrations",
"fno": "ttg2011030368",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Registration",
"Deformation",
"Volume Animation"
],
"authors": [
{
"givenName": "Taehyun",
"surname": "Rhee",
"fullName": "Taehyun Rhee",
"affiliation": "Samsung Electronics Co., Ltd., Giheung-gu",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.P.",
"surname": "Lewis",
"fullName": "J.P. Lewis",
"affiliation": "Weta Digital, Wellington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ulrich",
"surname": "Neumann",
"fullName": "Ulrich Neumann",
"affiliation": "University of Southern California, Los Angeles",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Krishna S.",
"surname": "Nayak",
"fullName": "Krishna S. Nayak",
"affiliation": "University of Southern California, Los Angeles",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2011-03-01 00:00:00",
"pubType": "trans",
"pages": "368-379",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2010/4166/0/4166a041",
"title": "Character Skin Deformation: A Survey",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2010/4166a041/12OmNApu5fG",
"parentPublication": {
"id": "proceedings/cgiv/2010/4166/0",
"title": "2010 Seventh International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a306",
"title": "Lattice-Based Skinning and Deformation for Real-Time Skeleton-Driven Animation",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a306/12OmNBEGYGs",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1996/7588/0/75880098",
"title": "Facial Animation",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1996/75880098/12OmNvT2oR2",
"parentPublication": {
"id": "proceedings/ca/1996/7588/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2002/1656/0/16560664",
"title": "Virtual Sculpting and Deformable Volume Modelling",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2002/16560664/12OmNwoxSf0",
"parentPublication": {
"id": "proceedings/iv/2002/1656/0",
"title": "Proceedings Sixth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1996/3673/0/36730073",
"title": "Deformable Volume Rendering by 3D Texture Mapping and Octree Encoding",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730073/12OmNwsNRcc",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2007/3009/0/30090435",
"title": "Soft-Tissue Deformation for In Vivo Volume Animation",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2007/30090435/12OmNxw5Bm3",
"parentPublication": {
"id": "proceedings/pg/2007/3009/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/1998/9180/0/91800047",
"title": "Volume Animation Using the Skeleton Tree",
"doi": null,
"abstractUrl": "/proceedings-article/vv/1998/91800047/12OmNyLiuwI",
"parentPublication": {
"id": "proceedings/vv/1998/9180/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/01/ttg2010010070",
"title": "Fluid Simulation with Articulated Bodies",
"doi": null,
"abstractUrl": "/journal/tg/2010/01/ttg2010010070/13rRUxDqS8f",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600n3191",
"title": "COAP: Compositional Articulated Occupancy of People",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600n3191/1H1jh510fDy",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900n3648",
"title": "Motion Representations for Articulated Animation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900n3648/1yeJdY5M4EM",
"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": "ttg2011030357",
"articleId": "13rRUxlgy3D",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011030380",
"articleId": "13rRUy3gn7s",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgDy",
"name": "ttg2011030368s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011030368s.mov",
"extension": "mov",
"size": "17.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNs5rl2Y",
"title": "July-September",
"year": "1997",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "3",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuhl",
"doi": "10.1109/2945.620488",
"abstract": "Abstract—Free-form deformations (FFDs) are a popular tool for modeling and keyframe animation. This paper extends the use of FFDs to a dynamic setting. Our goal is to enable normally inanimate graphics objects, such as teapots and tables, to become animated, and learn to move about in a charming, cartoon-like manner. To achieve this goal, we implement a system that can transform a wide class of objects into dynamic characters. Our formulation is based on parameterized hierarchical FFDs augmented with Lagrangian dynamics, and provides an efficient way to animate and control the simulated characters. Objects are assigned mass distributions and elastic deformation properties, which allow them to translate, rotate, and deform according to internal and external forces. In addition, we implement an automated optimization process that searches for suitable control strategies. The primary contributions of the work are threefold. First, we formulate a dynamic generalization of conventional, geometric FFDs. The formulation employs deformation modes which are tailored by the user and are expressed in terms of FFDs. Second, the formulation accommodates a hierarchy of dynamic FFDs that can be used to model local as well as global deformations. Third, the deformation modes can be active, thereby producing locomotion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Free-form deformations (FFDs) are a popular tool for modeling and keyframe animation. This paper extends the use of FFDs to a dynamic setting. Our goal is to enable normally inanimate graphics objects, such as teapots and tables, to become animated, and learn to move about in a charming, cartoon-like manner. To achieve this goal, we implement a system that can transform a wide class of objects into dynamic characters. Our formulation is based on parameterized hierarchical FFDs augmented with Lagrangian dynamics, and provides an efficient way to animate and control the simulated characters. Objects are assigned mass distributions and elastic deformation properties, which allow them to translate, rotate, and deform according to internal and external forces. In addition, we implement an automated optimization process that searches for suitable control strategies. The primary contributions of the work are threefold. First, we formulate a dynamic generalization of conventional, geometric FFDs. The formulation employs deformation modes which are tailored by the user and are expressed in terms of FFDs. Second, the formulation accommodates a hierarchy of dynamic FFDs that can be used to model local as well as global deformations. Third, the deformation modes can be active, thereby producing locomotion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Free-form deformations (FFDs) are a popular tool for modeling and keyframe animation. This paper extends the use of FFDs to a dynamic setting. Our goal is to enable normally inanimate graphics objects, such as teapots and tables, to become animated, and learn to move about in a charming, cartoon-like manner. To achieve this goal, we implement a system that can transform a wide class of objects into dynamic characters. Our formulation is based on parameterized hierarchical FFDs augmented with Lagrangian dynamics, and provides an efficient way to animate and control the simulated characters. Objects are assigned mass distributions and elastic deformation properties, which allow them to translate, rotate, and deform according to internal and external forces. In addition, we implement an automated optimization process that searches for suitable control strategies. The primary contributions of the work are threefold. First, we formulate a dynamic generalization of conventional, geometric FFDs. The formulation employs deformation modes which are tailored by the user and are expressed in terms of FFDs. Second, the formulation accommodates a hierarchy of dynamic FFDs that can be used to model local as well as global deformations. Third, the deformation modes can be active, thereby producing locomotion.",
"title": "Dynamic Free-Form Deformations for Animation Synthesis",
"normalizedTitle": "Dynamic Free-Form Deformations for Animation Synthesis",
"fno": "v0201",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Physically Based Animation",
"Free Form Deformations",
"Control Synthesis",
"Deformation Models",
"Lagrangian Dynamics"
],
"authors": [
{
"givenName": "Petros",
"surname": "Faloutsos",
"fullName": "Petros Faloutsos",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michiel",
"surname": "van de Panne",
"fullName": "Michiel van de Panne",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Demetri",
"surname": "Terzopoulos",
"fullName": "Demetri Terzopoulos",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1997-07-01 00:00:00",
"pubType": "trans",
"pages": "201-214",
"year": "1997",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "v0215",
"articleId": "13rRUNvyaeP",
"__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": "13rRUwbJD4L",
"doi": "10.1109/TVCG.2014.2346415",
"abstract": "The cores of massless, swirling particle motion are an indicator for vortex-like behavior in vector fields and to this end, a number of coreline extractors have been proposed in the literature. Though, many practical applications go beyond the study of the vector field. Instead, engineers seek to understand the behavior of inertial particles moving therein, for instance in sediment transport, helicopter brownout and pulverized coal combustion. In this paper, we present two strategies for the extraction of the corelines that inertial particles swirl around, which depend on particle density, particle diameter, fluid viscosity and gravity. The first is to deduce the local swirling behavior from the autonomous inertial motion ODE, which eventually reduces to a parallel vectors operation. For the second strategy, we use a particle density estimation to locate inertial attractors. With this, we are able to extract the cores of swirling inertial particle motion for both steady and unsteady 3D vector fields. We demonstrate our techniques in a number of benchmark data sets, and elaborate on the relation to traditional massless corelines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The cores of massless, swirling particle motion are an indicator for vortex-like behavior in vector fields and to this end, a number of coreline extractors have been proposed in the literature. Though, many practical applications go beyond the study of the vector field. Instead, engineers seek to understand the behavior of inertial particles moving therein, for instance in sediment transport, helicopter brownout and pulverized coal combustion. In this paper, we present two strategies for the extraction of the corelines that inertial particles swirl around, which depend on particle density, particle diameter, fluid viscosity and gravity. The first is to deduce the local swirling behavior from the autonomous inertial motion ODE, which eventually reduces to a parallel vectors operation. For the second strategy, we use a particle density estimation to locate inertial attractors. With this, we are able to extract the cores of swirling inertial particle motion for both steady and unsteady 3D vector fields. We demonstrate our techniques in a number of benchmark data sets, and elaborate on the relation to traditional massless corelines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The cores of massless, swirling particle motion are an indicator for vortex-like behavior in vector fields and to this end, a number of coreline extractors have been proposed in the literature. Though, many practical applications go beyond the study of the vector field. Instead, engineers seek to understand the behavior of inertial particles moving therein, for instance in sediment transport, helicopter brownout and pulverized coal combustion. In this paper, we present two strategies for the extraction of the corelines that inertial particles swirl around, which depend on particle density, particle diameter, fluid viscosity and gravity. The first is to deduce the local swirling behavior from the autonomous inertial motion ODE, which eventually reduces to a parallel vectors operation. For the second strategy, we use a particle density estimation to locate inertial attractors. With this, we are able to extract the cores of swirling inertial particle motion for both steady and unsteady 3D vector fields. We demonstrate our techniques in a number of benchmark data sets, and elaborate on the relation to traditional massless corelines.",
"title": "Vortex Cores of Inertial Particles",
"normalizedTitle": "Vortex Cores of Inertial Particles",
"fno": "06875993",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Vectors",
"Gravity",
"Three Dimensional Displays",
"Jacobian Matrices",
"Time Factors",
"Particle Measurements",
"Eigenvalues And Eigenfunctions",
"Vortex Cores",
"Inertial Particles",
"Flow Visualization"
],
"authors": [
{
"givenName": "Tobias",
"surname": "Gunther",
"fullName": "Tobias Gunther",
"affiliation": ", Visual Computing Group at the University of Magdeburg",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Holger",
"surname": "Theisel",
"fullName": "Holger Theisel",
"affiliation": ", Visual Computing Group at the University of Magdeburg",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2535-2544",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1993/3940/0/00398850",
"title": "Visualization of turbulent flow with particles",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1993/00398850/12OmNAolGVS",
"parentPublication": {
"id": "proceedings/visual/1993/3940/0",
"title": "Proceedings Visualization '93",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/3/3962f039",
"title": "Track Calculation and Numerical Simulation on Particles in High Pressure Abrasive Water Jet Nozzle",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962f039/12OmNB8kHRU",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/3",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2010/4286/1/4286a702",
"title": "Experimental Study on Acoustic Agglomeration of Fine Particles from Coal Combustion",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2010/4286a702/12OmNBl6EHS",
"parentPublication": {
"id": "proceedings/icdma/2010/4286/1",
"title": "2010 International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iseim/2005/6063/2/01496164",
"title": "Electrical measurement of different discharge from spherical and filamentary particles",
"doi": null,
"abstractUrl": "/proceedings-article/iseim/2005/01496164/12OmNqBbHRK",
"parentPublication": {
"id": "proceedings/iseim/2005/6063/2",
"title": "International Symposium on Electrical Insulating Materials",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2008/3304/3/3304c609",
"title": "A New Data-Mining Approach: Self-Organizing Entanglement Dynamics of Quantum Particles",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2008/3304c609/12OmNvFHfFW",
"parentPublication": {
"id": "proceedings/icnc/2008/3304/3",
"title": "2008 Fourth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/3/3336e031",
"title": "A Numerical Simulation of Motion of Particles under the Wafer in CMP",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336e031/12OmNxisQRS",
"parentPublication": {
"id": "proceedings/csse/2008/3336/3",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539608",
"title": "Topological Analysis of Inertial Dynamics",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539608/13rRUwIF69m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539598",
"title": "Backward Finite-Time Lyapunov Exponents in Inertial Flows",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539598/13rRUxC0SOY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1759",
"title": "Cores of Swirling Particle Motion in Unsteady Flows",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1759/13rRUxly8Xx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440096",
"title": "Objective Vortex Corelines of Finite-sized Objects in Fluid Flows",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440096/17D45WXIkH8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06875965",
"articleId": "13rRUB7a1fS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875956",
"articleId": "13rRUNvyaf2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFq1",
"name": "ttg201412-06875993s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201412-06875993s1.zip",
"extension": "zip",
"size": "30.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNySXEWS",
"title": "July/August",
"year": "2007",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYIMUQ",
"doi": "10.1109/TVCG.2007.1022",
"abstract": "Abstract—We present a new fluid simulation technique that significantly reduces the nonphysical dissipation of velocity. The proposed method is based on an apt use of particles and derivative information. We note that a major source of numerical dissipation in the conventional Navier-Stokes equations solver lies in the advection step. Hence, starting with the conventional grid-based simulator, when the details of fluid movements need to be simulated, we replace the advection part with a particle simulator. When swapping between the grid-based and particle-based simulators, the physical quantities such as the level set and velocity must be converted. For this purpose, we develop a novel dissipation-suppressing conversion procedure that utilizes the derivative information stored in the particles, as well as in the grid points. For the fluid regions where such details are not needed, the advection is simulated using an octree-based constrained interpolation profile (CIP) solver, which we develop in this work. Through several experiments, we show that the proposed technique can reproduce the detailed movements of high-Reynolds-number fluids such as droplets/bubbles, thin water sheets, and whirlpools. The increased accuracy in the advection, which forms the basis of the proposed technique, can also be used to produce better results in larger scale fluid simulations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We present a new fluid simulation technique that significantly reduces the nonphysical dissipation of velocity. The proposed method is based on an apt use of particles and derivative information. We note that a major source of numerical dissipation in the conventional Navier-Stokes equations solver lies in the advection step. Hence, starting with the conventional grid-based simulator, when the details of fluid movements need to be simulated, we replace the advection part with a particle simulator. When swapping between the grid-based and particle-based simulators, the physical quantities such as the level set and velocity must be converted. For this purpose, we develop a novel dissipation-suppressing conversion procedure that utilizes the derivative information stored in the particles, as well as in the grid points. For the fluid regions where such details are not needed, the advection is simulated using an octree-based constrained interpolation profile (CIP) solver, which we develop in this work. Through several experiments, we show that the proposed technique can reproduce the detailed movements of high-Reynolds-number fluids such as droplets/bubbles, thin water sheets, and whirlpools. The increased accuracy in the advection, which forms the basis of the proposed technique, can also be used to produce better results in larger scale fluid simulations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We present a new fluid simulation technique that significantly reduces the nonphysical dissipation of velocity. The proposed method is based on an apt use of particles and derivative information. We note that a major source of numerical dissipation in the conventional Navier-Stokes equations solver lies in the advection step. Hence, starting with the conventional grid-based simulator, when the details of fluid movements need to be simulated, we replace the advection part with a particle simulator. When swapping between the grid-based and particle-based simulators, the physical quantities such as the level set and velocity must be converted. For this purpose, we develop a novel dissipation-suppressing conversion procedure that utilizes the derivative information stored in the particles, as well as in the grid points. For the fluid regions where such details are not needed, the advection is simulated using an octree-based constrained interpolation profile (CIP) solver, which we develop in this work. Through several experiments, we show that the proposed technique can reproduce the detailed movements of high-Reynolds-number fluids such as droplets/bubbles, thin water sheets, and whirlpools. The increased accuracy in the advection, which forms the basis of the proposed technique, can also be used to produce better results in larger scale fluid simulations.",
"title": "Derivative Particles for Simulating Detailed Movements of Fluids",
"normalizedTitle": "Derivative Particles for Simulating Detailed Movements of Fluids",
"fno": "v0711",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Physically Based Modeling",
"Multiphase Fluid",
"High Reynolds Number Fluid",
"Water"
],
"authors": [
{
"givenName": "Oh-young",
"surname": "Song",
"fullName": "Oh-young Song",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Doyub",
"surname": "Kim",
"fullName": "Doyub Kim",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hyeong-Seok",
"surname": "Ko",
"fullName": "Hyeong-Seok Ko",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2007-07-01 00:00:00",
"pubType": "trans",
"pages": "711-719",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2009/3789/0/3789a038",
"title": "Particle Importance Based Fluid Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a038/12OmNAolHa9",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/viz/2009/3734/0/3734a076",
"title": "VOF Method for Fluids and Solids on Octree Structure",
"doi": null,
"abstractUrl": "/proceedings-article/viz/2009/3734a076/12OmNBkxspY",
"parentPublication": {
"id": "proceedings/viz/2009/3734/0",
"title": "Visualisation, International Conference in",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2013/5050/0/5050a694",
"title": "Dynamic Fluids Mixed with Local-Control Effects",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a694/12OmNwqft4O",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvgip/2008/3476/0/3476a063",
"title": "Explosion Simulation Using Compressible Fluids",
"doi": null,
"abstractUrl": "/proceedings-article/icvgip/2008/3476a063/12OmNz5JBRO",
"parentPublication": {
"id": "proceedings/icvgip/2008/3476/0",
"title": "Computer Vision, Graphics & Image Processing, Indian Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815003",
"title": "Synthesizing Solid-Induced Turbulence for Particle-Based Fluids",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815003/12OmNzlD9EF",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0939",
"title": "Texturing Fluids",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0939/13rRUwbs20O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/01/ttg2010010147",
"title": "Virtual Rheoscopic Fluids",
"doi": null,
"abstractUrl": "/journal/tg/2010/01/ttg2010010147/13rRUwgQpDr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/01/ttg2014010004",
"title": "Multiphase Flow of Immiscible Fluids on Unstructured Moving Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010004/13rRUxcbnCr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1997/03/mcg1997030052",
"title": "Real-Time Fluid Simulation in a Dynamic Virtual Environment",
"doi": null,
"abstractUrl": "/magazine/cg/1997/03/mcg1997030052/13rRUyXKxU3",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0135",
"title": "Advections with Significantly Reduced Dissipation and Diffusion",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0135/13rRUygT7y2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0697",
"articleId": "13rRUNvyatb",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0720",
"articleId": "13rRUwjGoLz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAnuTvo",
"title": "Nov.",
"year": "2016",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwvBy8Y",
"doi": "10.1109/TVCG.2015.2511734",
"abstract": "In many numerical simulations of fluids governed by the incompressible Navier-Stokes equations, the pressure Poisson equation needs to be solved to enforce mass conservation. Multigrid solvers show excellent convergence in simple scenarios, yet they can converge slowly in domains where physically separated regions are combined at coarser scales. Moreover, existing multigrid solvers are tailored to specific discretizations of the pressure Poisson equation, and they cannot easily be adapted to other discretizations. In this paper we analyze the convergence properties of existing multigrid solvers for the pressure Poisson equation in different simulation domains, and we show how to further improve the multigrid convergence rate by using a graph-based extension to determine the coarse grid hierarchy. The proposed multigrid solver is generic in that it can be applied to different kinds of discretizations of the pressure Poisson equation, by using solely the specification of the simulation domain and pre-assembled computational stencils. We analyze the proposed solver in combination with finite difference and finite volume discretizations of the pressure Poisson equation. Our evaluations show that, despite the common assumption, multigrid schemes can exploit their potential even in the most complicated simulation scenarios, yet this behavior is obtained at the price of higher memory consumption.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In many numerical simulations of fluids governed by the incompressible Navier-Stokes equations, the pressure Poisson equation needs to be solved to enforce mass conservation. Multigrid solvers show excellent convergence in simple scenarios, yet they can converge slowly in domains where physically separated regions are combined at coarser scales. Moreover, existing multigrid solvers are tailored to specific discretizations of the pressure Poisson equation, and they cannot easily be adapted to other discretizations. In this paper we analyze the convergence properties of existing multigrid solvers for the pressure Poisson equation in different simulation domains, and we show how to further improve the multigrid convergence rate by using a graph-based extension to determine the coarse grid hierarchy. The proposed multigrid solver is generic in that it can be applied to different kinds of discretizations of the pressure Poisson equation, by using solely the specification of the simulation domain and pre-assembled computational stencils. We analyze the proposed solver in combination with finite difference and finite volume discretizations of the pressure Poisson equation. Our evaluations show that, despite the common assumption, multigrid schemes can exploit their potential even in the most complicated simulation scenarios, yet this behavior is obtained at the price of higher memory consumption.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In many numerical simulations of fluids governed by the incompressible Navier-Stokes equations, the pressure Poisson equation needs to be solved to enforce mass conservation. Multigrid solvers show excellent convergence in simple scenarios, yet they can converge slowly in domains where physically separated regions are combined at coarser scales. Moreover, existing multigrid solvers are tailored to specific discretizations of the pressure Poisson equation, and they cannot easily be adapted to other discretizations. In this paper we analyze the convergence properties of existing multigrid solvers for the pressure Poisson equation in different simulation domains, and we show how to further improve the multigrid convergence rate by using a graph-based extension to determine the coarse grid hierarchy. The proposed multigrid solver is generic in that it can be applied to different kinds of discretizations of the pressure Poisson equation, by using solely the specification of the simulation domain and pre-assembled computational stencils. We analyze the proposed solver in combination with finite difference and finite volume discretizations of the pressure Poisson equation. Our evaluations show that, despite the common assumption, multigrid schemes can exploit their potential even in the most complicated simulation scenarios, yet this behavior is obtained at the price of higher memory consumption.",
"title": "Solving the Fluid Pressure Poisson Equation Using Multigrid—Evaluation and Improvements",
"normalizedTitle": "Solving the Fluid Pressure Poisson Equation Using Multigrid—Evaluation and Improvements",
"fno": "07364293",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Mathematical Model",
"Convergence",
"Computational Modeling",
"Multigrid Methods",
"Interpolation",
"Poisson Equations",
"Topology",
"Convergence Analysis",
"Fluid Simulation",
"Multigrid"
],
"authors": [
{
"givenName": "Christian",
"surname": "Dick",
"fullName": "Christian Dick",
"affiliation": "Computer Graphics and Visualization Group, Technische Universität München, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcus",
"surname": "Rogowsky",
"fullName": "Marcus Rogowsky",
"affiliation": "Computer Graphics and Visualization Group, Technische Universität München, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Computer Graphics and Visualization Group, Technische Universität München, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2016-11-01 00:00:00",
"pubType": "trans",
"pages": "2480-2492",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bcgin/2011/4464/0/4464a307",
"title": "Fast and High Accuracy Numerical Methods for Solving PDEs in Computational Finance",
"doi": null,
"abstractUrl": "/proceedings-article/bcgin/2011/4464a307/12OmNAkWvE6",
"parentPublication": {
"id": "proceedings/bcgin/2011/4464/0",
"title": "2011 International Conference on Business Computing and Global Informatization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2012/4789/0/4789a714",
"title": "A High Order Compact Difference Scheme and Multigrid Method for Solving the 3D Convection Diffusion Equation on Non-uniform Grids",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2012/4789a714/12OmNCbU2S7",
"parentPublication": {
"id": "proceedings/iccis/2012/4789/0",
"title": "2012 Fourth International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpeur/1989/1940/0/00093482",
"title": "Locally adaptive multigrid method for 3D numerical investigation of semiconductor devices",
"doi": null,
"abstractUrl": "/proceedings-article/cmpeur/1989/00093482/12OmNvA1hzc",
"parentPublication": {
"id": "proceedings/cmpeur/1989/1940/0",
"title": "COMPEURO 89 Proceedings VLSI and Computer Peripherals.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccms/2010/3941/4/3941d242",
"title": "A Cascadic Multigrid Algorithm for the Double Obstacle Problem",
"doi": null,
"abstractUrl": "/proceedings-article/iccms/2010/3941d242/12OmNviHKgf",
"parentPublication": {
"id": "proceedings/iccms/2010/3941/4",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04409176",
"title": "Efficient Computation of the Inverse Gradient on Irregular Domains",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04409176/12OmNzC5SMR",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06171181",
"title": "A Multigrid Fluid Pressure Solver Handling Separating Solid Boundary Conditions",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06171181/13rRUxlgxTi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2006/06/c6034",
"title": "Multigrid Methods for the Stokes System",
"doi": null,
"abstractUrl": "/magazine/cs/2006/06/c6034/13rRUyg2jRz",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2006/05/c5096",
"title": "Multigrid Methods: Managing Massive Meshes",
"doi": null,
"abstractUrl": "/magazine/cs/2006/05/c5096/13rRUygBw9Z",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scala/2018/0176/0/017600a017",
"title": "Communication Avoiding Multigrid Preconditioned Conjugate Gradient Method for Extreme Scale Multiphase CFD Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/scala/2018/017600a017/18jXKefKL6g",
"parentPublication": {
"id": "proceedings/scala/2018/0176/0",
"title": "2018 IEEE/ACM 9th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (scalA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2021/8442/0/09910116",
"title": "Distributed Multigrid Neural Solvers on Megavoxel Domains",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2021/09910116/1HzBIgRKoOA",
"parentPublication": {
"id": "proceedings/sc/2021/8442/0",
"title": "SC21: International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07364274",
"articleId": "13rRUygBw7d",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07360212",
"articleId": "13rRUxYIN4c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzXFovR",
"title": "November",
"year": "2011",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0qnGi",
"doi": "10.1109/TVCG.2010.268",
"abstract": "We present a hexahedral finite element method for simulating cuts in deformable bodies using the corotational formulation of strain at high computational efficiency. Key to our approach is a novel embedding of adaptive element refinements and topological changes of the simulation grid into a geometric multigrid solver. Starting with a coarse hexahedral simulation grid, this grid is adaptively refined at the surface of a cutting tool until a finest resolution level, and the cut is modeled by separating elements along the cell faces at this level. To represent the induced discontinuities on successive multigrid levels, the affected coarse grid cells are duplicated and the resulting connectivity components are distributed to either side of the cut. Drawing upon recent work on octree and multigrid schemes for the numerical solution of partial differential equations, we develop efficient algorithms for updating the systems of equations of the adaptive finite element discretization and the multigrid hierarchy. To construct a surface that accurately aligns with the cuts, we adapt the splitting cubes algorithm to the specific linked voxel representation of the simulation domain we use. The paper is completed by a convergence analysis of the finite element solver and a performance comparison to alternative numerical solution methods. These investigations show that our approach offers high computational efficiency and physical accuracy, and that it enables cutting of deformable bodies at very high resolutions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a hexahedral finite element method for simulating cuts in deformable bodies using the corotational formulation of strain at high computational efficiency. Key to our approach is a novel embedding of adaptive element refinements and topological changes of the simulation grid into a geometric multigrid solver. Starting with a coarse hexahedral simulation grid, this grid is adaptively refined at the surface of a cutting tool until a finest resolution level, and the cut is modeled by separating elements along the cell faces at this level. To represent the induced discontinuities on successive multigrid levels, the affected coarse grid cells are duplicated and the resulting connectivity components are distributed to either side of the cut. Drawing upon recent work on octree and multigrid schemes for the numerical solution of partial differential equations, we develop efficient algorithms for updating the systems of equations of the adaptive finite element discretization and the multigrid hierarchy. To construct a surface that accurately aligns with the cuts, we adapt the splitting cubes algorithm to the specific linked voxel representation of the simulation domain we use. The paper is completed by a convergence analysis of the finite element solver and a performance comparison to alternative numerical solution methods. These investigations show that our approach offers high computational efficiency and physical accuracy, and that it enables cutting of deformable bodies at very high resolutions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a hexahedral finite element method for simulating cuts in deformable bodies using the corotational formulation of strain at high computational efficiency. Key to our approach is a novel embedding of adaptive element refinements and topological changes of the simulation grid into a geometric multigrid solver. Starting with a coarse hexahedral simulation grid, this grid is adaptively refined at the surface of a cutting tool until a finest resolution level, and the cut is modeled by separating elements along the cell faces at this level. To represent the induced discontinuities on successive multigrid levels, the affected coarse grid cells are duplicated and the resulting connectivity components are distributed to either side of the cut. Drawing upon recent work on octree and multigrid schemes for the numerical solution of partial differential equations, we develop efficient algorithms for updating the systems of equations of the adaptive finite element discretization and the multigrid hierarchy. To construct a surface that accurately aligns with the cuts, we adapt the splitting cubes algorithm to the specific linked voxel representation of the simulation domain we use. The paper is completed by a convergence analysis of the finite element solver and a performance comparison to alternative numerical solution methods. These investigations show that our approach offers high computational efficiency and physical accuracy, and that it enables cutting of deformable bodies at very high resolutions.",
"title": "A Hexahedral Multigrid Approach for Simulating Cuts in Deformable Objects",
"normalizedTitle": "A Hexahedral Multigrid Approach for Simulating Cuts in Deformable Objects",
"fno": "ttg2011111663",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Deformable Objects",
"Cutting",
"Finite Elements",
"Multigrid",
"Octree Meshes"
],
"authors": [
{
"givenName": "Christian",
"surname": "Dick",
"fullName": "Christian Dick",
"affiliation": "Technische Universität München, Garching",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joachim",
"surname": "Georgii",
"fullName": "Joachim Georgii",
"affiliation": "Fraunhofer MEVIS, Bremen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rüdiger",
"surname": "Westermann",
"fullName": "Rüdiger Westermann",
"affiliation": "Technische Universität München, Garching",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2011-11-01 00:00:00",
"pubType": "trans",
"pages": "1663-1675",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sc/1999/1966/0/19660027",
"title": "Parallel Multigrid Solver for 3D Unstructured Finite Element Problems",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1999/19660027/12OmNAQJzUV",
"parentPublication": {
"id": "proceedings/sc/1999/1966/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2012/0806/0/1000a045",
"title": "Parallel geometric-algebraic multigrid on unstructured forests of octrees",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2012/1000a045/12OmNy7Qfuf",
"parentPublication": {
"id": "proceedings/sc/2012/0806/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/shpcc/1992/2775/0/00232666",
"title": "Incremental mapping for solution-adaptive multigrid hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/shpcc/1992/00232666/12OmNyoiZ5O",
"parentPublication": {
"id": "proceedings/shpcc/1992/2775/0",
"title": "1992 Proceedings Scalable High Performance Computing Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2011/01/ttd2011010022",
"title": "Cyclic Reduction Tridiagonal Solvers on GPUs Applied to Mixed-Precision Multigrid",
"doi": null,
"abstractUrl": "/journal/td/2011/01/ttd2011010022/13rRUwd9CFF",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/11/07364293",
"title": "Solving the Fluid Pressure Poisson Equation Using Multigrid—Evaluation and Improvements",
"doi": null,
"abstractUrl": "/journal/tg/2016/11/07364293/13rRUwvBy8Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2006/06/c6056",
"title": "A Massively Parallel Multigrid Method for Finite Elements",
"doi": null,
"abstractUrl": "/magazine/cs/2006/06/c6056/13rRUxC0SLp",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/10/06747389",
"title": "Large-Scale Liquid Simulation on Adaptive Hexahedral Grids",
"doi": null,
"abstractUrl": "/journal/tg/2014/10/06747389/13rRUxYrbMj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2006/06/c6044",
"title": "Multigrid Methods on Adaptively Refined Grids",
"doi": null,
"abstractUrl": "/magazine/cs/2006/06/c6044/13rRUxcsYPK",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1986/11/01676698",
"title": "Multigrid Algorithms on the Hypercube Multiprocessor",
"doi": null,
"abstractUrl": "/journal/tc/1986/11/01676698/13rRUxlgy2A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2019/1246/0/124600a101",
"title": "Asynchronous Multigrid Methods",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2019/124600a101/1cYhNxfoynm",
"parentPublication": {
"id": "proceedings/ipdps/2019/1246/0",
"title": "2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011111650",
"articleId": "13rRUytF41w",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011111676",
"articleId": "13rRUxASuMA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgMK",
"name": "ttg2011111663s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011111663s1.zip",
"extension": "zip",
"size": "64 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnG",
"title": "April-June",
"year": "2002",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "8",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VBv",
"doi": "10.1109/2945.998668",
"abstract": "Muscle simulation is an important component of human modeling, but there have been few attempts to demonstrate, in three dimensions and in an anatomically correct way, the structures of muscles and the way in which these change during motion. This paper proposes an anatomically-based approach to muscle modeling that attempts to provide models for human musculature based on the real morphological structures. These models provide a good visual description of muscle form and action and represent a sound base from which to produce further progress toward medically accurate simulation of human bodies. Three major problems have been addressed: geometric modeling, deformation, and texture. To allow for the wide variety of deformable muscle shapes encountered in the body, while retaining as many of their common properties as possible, the geometric models are classified into several categories according to the characteristics of their structures and actions. Within each category, the model for each muscle has an efficient structural form, created using anatomical data. Deformation is also performed on the basis of the categories, with all models within each category sharing the same deformation scheme. The categories cover both general and special cases. The result is an efficient, anatomically accurate muscle representation that is specifically designed to accommodate the particular form of deformation exhibited by each individual muscle. Interactions between muscles are also taken into account to avoid penetration occurring between adjacent muscles in our model. To provide a suitable visual effect, the muscle texture is generated directly on the model surface. The textures and colors are obtained from anatomical data via image analysis. Some results are presented on the geometric modeling, the deformation, and the texture of muscles related to the lower limb.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Muscle simulation is an important component of human modeling, but there have been few attempts to demonstrate, in three dimensions and in an anatomically correct way, the structures of muscles and the way in which these change during motion. This paper proposes an anatomically-based approach to muscle modeling that attempts to provide models for human musculature based on the real morphological structures. These models provide a good visual description of muscle form and action and represent a sound base from which to produce further progress toward medically accurate simulation of human bodies. Three major problems have been addressed: geometric modeling, deformation, and texture. To allow for the wide variety of deformable muscle shapes encountered in the body, while retaining as many of their common properties as possible, the geometric models are classified into several categories according to the characteristics of their structures and actions. Within each category, the model for each muscle has an efficient structural form, created using anatomical data. Deformation is also performed on the basis of the categories, with all models within each category sharing the same deformation scheme. The categories cover both general and special cases. The result is an efficient, anatomically accurate muscle representation that is specifically designed to accommodate the particular form of deformation exhibited by each individual muscle. Interactions between muscles are also taken into account to avoid penetration occurring between adjacent muscles in our model. To provide a suitable visual effect, the muscle texture is generated directly on the model surface. The textures and colors are obtained from anatomical data via image analysis. Some results are presented on the geometric modeling, the deformation, and the texture of muscles related to the lower limb.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Muscle simulation is an important component of human modeling, but there have been few attempts to demonstrate, in three dimensions and in an anatomically correct way, the structures of muscles and the way in which these change during motion. This paper proposes an anatomically-based approach to muscle modeling that attempts to provide models for human musculature based on the real morphological structures. These models provide a good visual description of muscle form and action and represent a sound base from which to produce further progress toward medically accurate simulation of human bodies. Three major problems have been addressed: geometric modeling, deformation, and texture. To allow for the wide variety of deformable muscle shapes encountered in the body, while retaining as many of their common properties as possible, the geometric models are classified into several categories according to the characteristics of their structures and actions. Within each category, the model for each muscle has an efficient structural form, created using anatomical data. Deformation is also performed on the basis of the categories, with all models within each category sharing the same deformation scheme. The categories cover both general and special cases. The result is an efficient, anatomically accurate muscle representation that is specifically designed to accommodate the particular form of deformation exhibited by each individual muscle. Interactions between muscles are also taken into account to avoid penetration occurring between adjacent muscles in our model. To provide a suitable visual effect, the muscle texture is generated directly on the model surface. The textures and colors are obtained from anatomical data via image analysis. Some results are presented on the geometric modeling, the deformation, and the texture of muscles related to the lower limb.",
"title": "An Anatomy-Based Approach to Human Muscle Modeling and Deformation",
"normalizedTitle": "An Anatomy-Based Approach to Human Muscle Modeling and Deformation",
"fno": "v0154",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Human Modeling",
"Figure Animation",
"Deformation",
"Texture"
],
"authors": [
{
"givenName": "F.",
"surname": "Dong",
"fullName": "F. Dong",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.J.",
"surname": "Clapworthy",
"fullName": "G.J. Clapworthy",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.A.",
"surname": "Krokos",
"fullName": "M.A. Krokos",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Yao",
"fullName": "J. Yao",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2002-04-01 00:00:00",
"pubType": "trans",
"pages": "154-170",
"year": "2002",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0144",
"articleId": "13rRUwIF6dD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0171",
"articleId": "13rRUxCitJ2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwswg8f",
"title": "May/June",
"year": "2004",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "24",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyoyhG5",
"doi": "10.1109/MCG.2004.1297008",
"abstract": "This article presents a novel technique, called image-based surface detail transfer, that transfers geometric details from one surface to another with simple 2D image operations. The authors? basic finding is that, without knowing its 3D geometry, geometric details (local deformations) of an object can be extracted from a single image in a way independent of its surface reflectance. Furthermore, these geometric details can be directly transferred to modify the appearance of other objects in image space. The article provides examples of surface detail transfer between real objects, as well as between real and synthesized objects. It also demonstrates that this technique can be applied to human faces to produce aging effects or as a touch-up tool to remove wrinkles and color spots on the face images.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article presents a novel technique, called image-based surface detail transfer, that transfers geometric details from one surface to another with simple 2D image operations. The authors? basic finding is that, without knowing its 3D geometry, geometric details (local deformations) of an object can be extracted from a single image in a way independent of its surface reflectance. Furthermore, these geometric details can be directly transferred to modify the appearance of other objects in image space. The article provides examples of surface detail transfer between real objects, as well as between real and synthesized objects. It also demonstrates that this technique can be applied to human faces to produce aging effects or as a touch-up tool to remove wrinkles and color spots on the face images.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article presents a novel technique, called image-based surface detail transfer, that transfers geometric details from one surface to another with simple 2D image operations. The authors? basic finding is that, without knowing its 3D geometry, geometric details (local deformations) of an object can be extracted from a single image in a way independent of its surface reflectance. Furthermore, these geometric details can be directly transferred to modify the appearance of other objects in image space. The article provides examples of surface detail transfer between real objects, as well as between real and synthesized objects. It also demonstrates that this technique can be applied to human faces to produce aging effects or as a touch-up tool to remove wrinkles and color spots on the face images.",
"title": "Image-Based Surface Detail Transfer",
"normalizedTitle": "Image-Based Surface Detail Transfer",
"fno": "mcg2004030030",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Geometric Details",
"Aging Simulation",
"Surface Detail Transfer"
],
"authors": [
{
"givenName": "Zicheng",
"surname": "Liu",
"fullName": "Zicheng Liu",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhengyou",
"surname": "Zhang",
"fullName": "Zhengyou Zhang",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "Shan",
"fullName": "Ying Shan",
"affiliation": "Sarnoff Corporation",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2004-05-01 00:00:00",
"pubType": "mags",
"pages": "30-35",
"year": "2004",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/itcs/2009/3688/1/3688a640",
"title": "An Improved Algorithm of Bi-cubic Triangular Curved Surface-Splicing for Curved Surface Reconstruction Based on Hermite Surface",
"doi": null,
"abstractUrl": "/proceedings-article/itcs/2009/3688a640/12OmNAo45CX",
"parentPublication": {
"id": "proceedings/itcs/2009/3688/1",
"title": "Information Technology and Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2000/0592/0/05920410",
"title": "Piecewise Linear Image Coding Using Surface Triangulation and Geometric Compression",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2000/05920410/12OmNCfSqRV",
"parentPublication": {
"id": "proceedings/dcc/2000/0592/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2001/1272/2/127220794",
"title": "Image-Based Surface Detail Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2001/127220794/12OmNCw3z5x",
"parentPublication": {
"id": "proceedings/cvpr/2001/1272/2",
"title": "Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032c344",
"title": "3D Surface Detail Enhancement from a Single Normal Map",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032c344/12OmNwCsdKG",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2005/2392/0/23920447",
"title": "Surface Modelling Using Fourth Order Geometric Flows",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2005/23920447/12OmNwswg2T",
"parentPublication": {
"id": "proceedings/cgiv/2005/2392/0",
"title": "International Conference on Computer Graphics, Imaging and Visualization (CGIV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498tasdizen",
"title": "Geometric Surface Smoothing via Anisotropic Diffusion of Normals",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498tasdizen/12OmNyRg4pW",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/1997/7943/0/79430190",
"title": "Physics-Based Models for Image Analysis/Synthesis and Geometric Design",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/1997/79430190/12OmNzvhvLk",
"parentPublication": {
"id": "proceedings/3dim/1997/7943/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__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": "proceedings/icvrv/2020/0497/0/049700a356",
"title": "3D Surface Detail Enhancement",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2020/049700a356/1vg8o7U0NDG",
"parentPublication": {
"id": "proceedings/icvrv/2020/0497/0",
"title": "2020 International Conference on Virtual Reality and Visualization (ICVRV)",
"__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": "mcg2004030021",
"articleId": "13rRUxCRFQc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2004030036",
"articleId": "13rRUy0HYU8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwkR5xR",
"title": "Jan.-March",
"year": "2016",
"issueNum": "01",
"idPrefix": "ec",
"pubType": "journal",
"volume": "4",
"label": "Jan.-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpvG",
"doi": "10.1109/TETC.2016.2515901",
"abstract": "On December 31, 2015, yet another year of resounding success has been recorded for the IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING (TETC). As you will read further in this editorial, TETC has experienced many new initiatives and I am pleased to report that TETC continues to strengthen its reputation and consolidate its unique role within the publication portfolio of the Computer Society (CS). ScholarOne reports the following very impressive statistics for the 2015 calendar year:<disp-quote><p>Number of submitted original papers: 422",
"abstracts": [
{
"abstractType": "Regular",
"content": "On December 31, 2015, yet another year of resounding success has been recorded for the IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING (TETC). As you will read further in this editorial, TETC has experienced many new initiatives and I am pleased to report that TETC continues to strengthen its reputation and consolidate its unique role within the publication portfolio of the Computer Society (CS). ScholarOne reports the following very impressive statistics for the 2015 calendar year:<disp-quote><p>Number of submitted original papers: 422",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "On December 31, 2015, yet another year of resounding success has been recorded for the IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING (TETC). As you will read further in this editorial, TETC has experienced many new initiatives and I am pleased to report that TETC continues to strengthen its reputation and consolidate its unique role within the publication portfolio of the Computer Society (CS). ScholarOne reports the following very impressive statistics for the 2015 calendar year:Number of submitted original papers: 422",
"title": "Message From the Editor-in-Chief",
"normalizedTitle": "Message From the Editor-in-Chief",
"fno": "07423841",
"hasPdf": true,
"idPrefix": "ec",
"keywords": [],
"authors": [
{
"givenName": "Fabrizio",
"surname": "Lombardi",
"fullName": "Fabrizio Lombardi",
"affiliation": "Northeastern University, Boston, MA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "3-4",
"year": "2016",
"issn": "2168-6750",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/an/2014/03/man20140300c4",
"title": "Seeking Editor in Chief",
"doi": null,
"abstractUrl": "/magazine/an/2014/03/man20140300c4/13rRUILLkFz",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cd/2014/01/mcd20140100c2",
"title": "Seeking Editor in Chief - IEEE Security & Privacy",
"doi": null,
"abstractUrl": "/magazine/cd/2014/01/mcd20140100c2/13rRUwgQpwv",
"parentPublication": {
"id": "mags/cd",
"title": "IEEE Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2015/01/07055408",
"title": "EIC Message",
"doi": null,
"abstractUrl": "/journal/ec/2015/01/07055408/13rRUx0xPrh",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/11/08053887",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2017/11/08053887/13rRUxBa56a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2014/04/msp20140400c2",
"title": "Seeking IEEE Security & Security Editor in Chief",
"doi": null,
"abstractUrl": "/magazine/sp/2014/04/msp20140400c2/13rRUxjyX2p",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2003/01/w1004",
"title": "From the Editor in Chief: Weather Forecast",
"doi": null,
"abstractUrl": "/magazine/ic/2003/01/w1004/13rRUxly91S",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/01/06815757",
"title": "Editorial from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tb/2014/01/06815757/13rRUyoPSNL",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/11/08514109",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2018/11/08514109/14M3E12c6Eo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/11/09927195",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2022/11/09927195/1HGJm87UJvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663062",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663062/1zBaC3IZK9y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07423833",
"articleId": "13rRUxYrbQg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07423842",
"articleId": "13rRUwI5Uc2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "1y2Fxh3IZDG",
"doi": "10.1109/TVCG.2021.3110543",
"abstract": "Welcome to the November 2021 issue of the <italic>IEEE Transactions on Visualization and Computer Graphics (TVCG)</italic>. This issue contains selected papers accepted at the IEEE International Symposium on Mixed and Augmented Reality (ISMAR). The conference took place in Bari, Italy from October 4–8, 2021 in virtual mode due to the COVID-19 pandemic.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Welcome to the November 2021 issue of the <italic>IEEE Transactions on Visualization and Computer Graphics (TVCG)</italic>. This issue contains selected papers accepted at the IEEE International Symposium on Mixed and Augmented Reality (ISMAR). The conference took place in Bari, Italy from October 4–8, 2021 in virtual mode due to the COVID-19 pandemic.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Welcome to the November 2021 issue of the IEEE Transactions on Visualization and Computer Graphics (TVCG). This issue contains selected papers accepted at the IEEE International Symposium on Mixed and Augmented Reality (ISMAR). The conference took place in Bari, Italy from October 4–8, 2021 in virtual mode due to the COVID-19 pandemic.",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"normalizedTitle": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"fno": "09591457",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Klaus",
"surname": "Mueller",
"fullName": "Klaus Mueller",
"affiliation": "Stony Brook University (State University of New York), USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Doug",
"surname": "Bowman",
"fullName": "Doug Bowman",
"affiliation": "Virginia Tech, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "11",
"pubDate": "2021-11-01 00:00:00",
"pubType": "trans",
"pages": "4085-4085",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2014/12/06935055",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935055/13rRUwh80He",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/11/08053887",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2017/11/08053887/13rRUxBa56a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/11/08514109",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2018/11/08514109/14M3E12c6Eo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/05/09754286",
"title": "IEEE VR 2022 Message from the Journal Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2022/05/09754286/1Cpd7Bwusk8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/11/09927195",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2022/11/09927195/1HGJm87UJvq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/11/08855103",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2019/11/08855103/1dNHm0Dq8lG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/11/08855105",
"title": "Message from the ISMAR 2019 Science and Technology Program Chairs and <italic>TVCG</italic> Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2019/11/08855105/1dNHma690d2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/12/09254193",
"title": "Message from the Editor-in-Chief and from the Associate Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2020/12/09254193/1oDXLUaRaDK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663062",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663062/1zBaC3IZK9y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663061",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663061/1zBb8giCGEU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "09591492",
"articleId": "1y2FvGMxBuM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zBaJbm09eU",
"doi": "10.1109/TVCG.2021.3125595",
"abstract": "Presents a listing of the VIS 2021 Executive Committee.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Presents a listing of the VIS 2021 Executive Committee.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Presents a listing of the VIS 2021 Executive Committee.",
"title": "VIS 2021 Executive Committee",
"normalizedTitle": "VIS 2021 Executive Committee",
"fno": "09663082",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "xxxv-xxxv",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "09663080",
"articleId": "1zBaUnoFaDe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09663078",
"articleId": "1zBatQHolgs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zBaOnEFy6I",
"doi": "10.1109/TVCG.2021.3114913",
"abstract": "Presents a listing of the VIS 2021 reviewers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Presents a listing of the VIS 2021 reviewers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Presents a listing of the VIS 2021 reviewers.",
"title": "VIS 2021 Reviewers",
"normalizedTitle": "VIS 2021 Reviewers",
"fno": "09663066",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "xliv-xlviii",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "09663070",
"articleId": "1zBasw2ZU3K",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552242",
"articleId": "1xic4WSUlKE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zBaReFPWne",
"doi": "10.1109/TVCG.2021.3114915",
"abstract": "Presents a listing of the VIS 2021 Program Committee.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Presents a listing of the VIS 2021 Program Committee.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Presents a listing of the VIS 2021 Program Committee.",
"title": "VIS 2021 Program Committee",
"normalizedTitle": "VIS 2021 Program Committee",
"fno": "09663064",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "xxxvii-xl",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "09663078",
"articleId": "1zBatQHolgs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09663070",
"articleId": "1zBasw2ZU3K",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zBaUnoFaDe",
"doi": "10.1109/TVCG.2021.3125547",
"abstract": "Presents a listing of the VIS 2021 Steering Committee.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Presents a listing of the VIS 2021 Steering Committee.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Presents a listing of the VIS 2021 Steering Committee.",
"title": "VIS 2021 Steering Committee",
"normalizedTitle": "VIS 2021 Steering Committee",
"fno": "09663080",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "xxxiv-xxxiv",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "09663079",
"articleId": "1zBay2vt8DC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09663082",
"articleId": "1zBaJbm09eU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zBasw2ZU3K",
"doi": "10.1109/TVCG.2021.3114935",
"abstract": "Presents a listing of the VIS 2021 Best Papers Committee.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Presents a listing of the VIS 2021 Best Papers Committee.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Presents a listing of the VIS 2021 Best Papers Committee.",
"title": "VIS 2021 Best Papers Committee",
"normalizedTitle": "VIS 2021 Best Papers Committee",
"fno": "09663070",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "xli-xliii",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "09663064",
"articleId": "1zBaReFPWne",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09663066",
"articleId": "1zBaOnEFy6I",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zBatQHolgs",
"doi": "10.1109/TVCG.2021.3125551",
"abstract": "Presents a listing of the VIS 2021 Area Curation Committee.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Presents a listing of the VIS 2021 Area Curation Committee.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Presents a listing of the VIS 2021 Area Curation Committee.",
"title": "VIS 2021 Area Curation Committee",
"normalizedTitle": "VIS 2021 Area Curation Committee",
"fno": "09663078",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "xxxvi-xxxvi",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "09663082",
"articleId": "1zBaJbm09eU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09663064",
"articleId": "1zBaReFPWne",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zBay2vt8DC",
"doi": "10.1109/TVCG.2021.3114894",
"abstract": "Presents a listing of the VIS 2021 Conference Committee.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Presents a listing of the VIS 2021 Conference Committee.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Presents a listing of the VIS 2021 Conference Committee.",
"title": "VIS 2021 Conference Committee",
"normalizedTitle": "VIS 2021 Conference Committee",
"fno": "09663079",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "xxxi-xxxiii",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "09663059",
"articleId": "1zBaY9iZ9bq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09663080",
"articleId": "1zBaUnoFaDe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XzbnJm",
"doi": "10.1109/TVCG.2018.2874733",
"abstract": "This January 2019 issue of the <italic>IEEE Transactions on Visualization and Computer Graphics (TVCG)</italic> contains the proceedings of IEEE VIS 2018, held during 21-26 October 2018 at the Estrel Hotel & Congress Center in Berlin. With IEEE VIS 2018, the conference series is in its 29th year.</p> <p>IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (IEEE VAST), the IEEE Information Visualization Conference (IEEE InfoVis), and the IEEE Scientific Visualization Conference (IEEE SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This January 2019 issue of the <italic>IEEE Transactions on Visualization and Computer Graphics (TVCG)</italic> contains the proceedings of IEEE VIS 2018, held during 21-26 October 2018 at the Estrel Hotel & Congress Center in Berlin. With IEEE VIS 2018, the conference series is in its 29th year.</p> <p>IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (IEEE VAST), the IEEE Information Visualization Conference (IEEE InfoVis), and the IEEE Scientific Visualization Conference (IEEE SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This January 2019 issue of the IEEE Transactions on Visualization and Computer Graphics (TVCG) contains the proceedings of IEEE VIS 2018, held during 21-26 October 2018 at the Estrel Hotel & Congress Center in Berlin. With IEEE VIS 2018, the conference series is in its 29th year. IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (IEEE VAST), the IEEE Information Visualization Conference (IEEE InfoVis), and the IEEE Scientific Visualization Conference (IEEE SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"title": "Preface",
"normalizedTitle": "Preface",
"fno": "08570935",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": "Tufts University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim",
"surname": "Dwyer",
"fullName": "Tim Dwyer",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Issei",
"surname": "Fujishiro",
"fullName": "Issei Fujishiro",
"affiliation": "Keio University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Petra",
"surname": "Isenberg",
"fullName": "Petra Isenberg",
"affiliation": "Inria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steve",
"surname": "Franconeri",
"fullName": "Steve Franconeri",
"affiliation": "Northwestern University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Qu",
"fullName": "Huamin Qu",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Schreck",
"fullName": "Tobias Schreck",
"affiliation": "Graz University of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gunther H.",
"surname": "Weber",
"fullName": "Gunther H. Weber",
"affiliation": "Lawrence Berkeley National Laboratory & University of California, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "xii-xvii",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2014/01/ttg2014010001",
"title": "State of the Journal",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010001/13rRUEgarsI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06935055",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935055/13rRUwh80He",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06935059",
"title": "Message from the VIS Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935059/13rRUxBa564",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/04/08315160",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2018/04/08315160/13rRUxNW1TW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ica/2018/8180/0/08459985",
"title": "Preface",
"doi": null,
"abstractUrl": "/proceedings-article/ica/2018/08459985/13xI8AQ5AIO",
"parentPublication": {
"id": "proceedings/ica/2018/8180/0",
"title": "2018 IEEE International Conference on Agents (ICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08930151",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08930151/1fEi0WcYUXS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09340112",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09340112/1qMK1vPtB7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a051",
"title": "A Review of Geospatial Content in IEEE Visualization Publications",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a051/1qRO6cuHu00",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663062",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663062/1zBaC3IZK9y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663061",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663061/1zBb8giCGEU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08570933",
"articleId": "17D45Xq6dDd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08576490",
"articleId": "17D45Xh13vF",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1fEi0WcYUXS",
"doi": "10.1109/TVCG.2019.2935644",
"abstract": "This January 2020 issue of the IEEE Transactions on Visualization and Computer Graphics (TVCG) contains the proceedings of IEEE VIS 2019, held during 20-25 October 2019 at the Vancouver Convention Center in Vancouver, BC, Canada. With IEEE VIS 2019, the conference series is in its 30 th year.</p> <p>IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (VAST), the IEEE Information Visualization Conference (InfoVis), and the IEEE Scientific Visualization Conference (SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This January 2020 issue of the IEEE Transactions on Visualization and Computer Graphics (TVCG) contains the proceedings of IEEE VIS 2019, held during 20-25 October 2019 at the Vancouver Convention Center in Vancouver, BC, Canada. With IEEE VIS 2019, the conference series is in its 30 th year.</p> <p>IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (VAST), the IEEE Information Visualization Conference (InfoVis), and the IEEE Scientific Visualization Conference (SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This January 2020 issue of the IEEE Transactions on Visualization and Computer Graphics (TVCG) contains the proceedings of IEEE VIS 2019, held during 20-25 October 2019 at the Vancouver Convention Center in Vancouver, BC, Canada. With IEEE VIS 2019, the conference series is in its 30 th year. IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (VAST), the IEEE Information Visualization Conference (InfoVis), and the IEEE Scientific Visualization Conference (SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"title": "Preface",
"normalizedTitle": "Preface",
"fno": "08930151",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": "Tufts University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Issei",
"surname": "Fujishiro",
"fullName": "Issei Fujishiro",
"affiliation": "Keio University, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Petra",
"surname": "Isenberg",
"fullName": "Petra Isenberg",
"affiliation": "Inria, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Keim",
"fullName": "Daniel Keim",
"affiliation": "Universität Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Lindstrom",
"fullName": "Peter Lindstrom",
"affiliation": "Lawrence Livermore National Laboratory, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ross",
"surname": "Maciejewski",
"fullName": "Ross Maciejewski",
"affiliation": "Arizona State University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miriah",
"surname": "Meyer",
"fullName": "Miriah Meyer",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gunther H.",
"surname": "Weber",
"fullName": "Gunther H. Weber",
"affiliation": "Lawrence Berkeley National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Weiskopf",
"fullName": "Daniel Weiskopf",
"affiliation": "University of Stuttgart, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jo",
"surname": "Wood",
"fullName": "Jo Wood",
"affiliation": "City, University of London, UK",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "xi-xvi",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2014/12/06935055",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935055/13rRUwh80He",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06935059",
"title": "Message from the VIS Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935059/13rRUxBa564",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08570935",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08570935/17D45XzbnJm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/06/08703194",
"title": "Guest Editors' Introduction: Special Section on IEEE PacificVis 2019",
"doi": null,
"abstractUrl": "/journal/tg/2019/06/08703194/19Er7j5Ad7a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09991007",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09991007/1J9z8EpCr72",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/07/08723303",
"title": "Errata to “RingText: Dwell-Free and Hands-Free Text Entry for Mobile Head-Mounted Displays Using Head Motions” [May 19 1991-2001]",
"doi": null,
"abstractUrl": "/journal/tg/2019/07/08723303/1aqzjJfQFCU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/models-c/2019/5125/0/512500a587",
"title": "Preface to the 1st Workshop on DevOps@MODELS",
"doi": null,
"abstractUrl": "/proceedings-article/models-c/2019/512500a587/1f8MVQqHtTO",
"parentPublication": {
"id": "proceedings/models-c/2019/5125/0",
"title": "2019 ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09340112",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09340112/1qMK1vPtB7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a051",
"title": "A Review of Geospatial Content in IEEE Visualization Publications",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a051/1qRO6cuHu00",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663061",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663061/1zBb8giCGEU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08925350",
"articleId": "1fvZm5VNd1C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08915896",
"articleId": "1fjdO4NrufK",
"__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": "1qMK1vPtB7i",
"doi": "10.1109/TVCG.2020.3033678",
"abstract": "This February 2021 issue of the <italic>IEEE Transactions on Visualization and Computer Graphics</italic> (TVCG) contains the proceedings of IEEE VIS 2020, held online between 25-30 October 2020, hosted by General Chairs from the University of Utah. With IEEE VIS 2020, the conference series is in its 31st year.</p> <p>IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (VAST), the IEEE Information Visualization Conference (InfoVis), and the IEEE Scientific Visualization Conference (SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This February 2021 issue of the <italic>IEEE Transactions on Visualization and Computer Graphics</italic> (TVCG) contains the proceedings of IEEE VIS 2020, held online between 25-30 October 2020, hosted by General Chairs from the University of Utah. With IEEE VIS 2020, the conference series is in its 31st year.</p> <p>IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (VAST), the IEEE Information Visualization Conference (InfoVis), and the IEEE Scientific Visualization Conference (SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This February 2021 issue of the IEEE Transactions on Visualization and Computer Graphics (TVCG) contains the proceedings of IEEE VIS 2020, held online between 25-30 October 2020, hosted by General Chairs from the University of Utah. With IEEE VIS 2020, the conference series is in its 31st year. IEEE VIS consists of three conferences, held concurrently: the IEEE Visual Analytics Science and Technology Conference (VAST), the IEEE Information Visualization Conference (InfoVis), and the IEEE Scientific Visualization Conference (SciVis). These three conferences are the premier venues for the visualization community to exchange the latest ideas and developments, attracting researchers and practitioners alike.",
"title": "Preface",
"normalizedTitle": "Preface",
"fno": "09340112",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "University of Maryland, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian",
"surname": "Fisher",
"fullName": "Brian Fisher",
"affiliation": "Simon Fraser University, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Lindstrom",
"fullName": "Peter Lindstrom",
"affiliation": "Lawrence Livermore National Laboratory, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ross",
"surname": "Maciejewski",
"fullName": "Ross Maciejewski",
"affiliation": "Arizona State University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miriah",
"surname": "Meyer",
"fullName": "Miriah Meyer",
"affiliation": "University of Utah, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Silvia",
"surname": "Miksch",
"fullName": "Silvia Miksch",
"affiliation": "Vienna University of Technology (TU Wien), Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luis Gustavo",
"surname": "Nonato",
"fullName": "Luis Gustavo Nonato",
"affiliation": "University of São Paulo, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nathalie",
"surname": "Riche",
"fullName": "Nathalie Riche",
"affiliation": "Microsoft Research, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Han-Wei",
"surname": "Shen",
"fullName": "Han-Wei Shen",
"affiliation": "Ohio State University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruediger",
"surname": "Westermann",
"fullName": "Ruediger Westermann",
"affiliation": "Technical University of Munich, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jo",
"surname": "Wood",
"fullName": "Jo Wood",
"affiliation": "City University of London, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jing",
"surname": "Yang",
"fullName": "Jing Yang",
"affiliation": "University of North Carolina at Charlotte, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "xviii-xxv",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2014/12/06935055",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935055/13rRUwh80He",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06935059",
"title": "Message from the VIS Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935059/13rRUxBa564",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08570935",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08570935/17D45XzbnJm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08930151",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08930151/1fEi0WcYUXS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/09052630",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/09052630/1iFLLHpsBfW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ctisc/2020/6501/0/09203910",
"title": "Preface: CTISC 2020",
"doi": null,
"abstractUrl": "/proceedings-article/ctisc/2020/09203910/1nkDbwZ5WBW",
"parentPublication": {
"id": "proceedings/ctisc/2020/6501/0",
"title": "2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09340061",
"title": "IEEE Transactions on Visualization and Computer Graphics [Conference announcement]",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09340061/1qLeIgCNJuM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a051",
"title": "A Review of Geospatial Content in IEEE Visualization Publications",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a051/1qRO6cuHu00",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663062",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663062/1zBaC3IZK9y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663061",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663061/1zBb8giCGEU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09340111",
"articleId": "1qMJUst1lg4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09340042",
"articleId": "1qL7ufN3miQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zBaynLGiHe",
"doi": "10.1109/TVCG.2021.3115333",
"abstract": "We have been honored to oversee the organization of IEEE VIS 2021. This marked the first year in which the SciVis, InfoVis, and VAST conferences were merged into a single, unified IEEE VIS. When we began planning for VIS in 2019, we envisioned a great experience for our community, who would be able to enjoy the innovative scientific program provided by a unified VIS, while delighting in the hospitable and lively atmosphere of New Orleans. But even the best laid plans cannot account for all contingencies. The emergence of the COVID-19 pandemic changed and complicated much in our lives, including the planning for VIS 2021. Moreover, transition to a unified conference was not without its challenges as well. Despite the difficulties, our community showed, once again, its strength and resilience. Our organizing committee created an exciting conference with a rich program full of high-quality research with all challenges being continuously and admirably addressed. As general chairs, our primary responsibility was to watch these wonderful volunteers conduct truly inspiring work under extreme constraints. For this, we are deeply indebted.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We have been honored to oversee the organization of IEEE VIS 2021. This marked the first year in which the SciVis, InfoVis, and VAST conferences were merged into a single, unified IEEE VIS. When we began planning for VIS in 2019, we envisioned a great experience for our community, who would be able to enjoy the innovative scientific program provided by a unified VIS, while delighting in the hospitable and lively atmosphere of New Orleans. But even the best laid plans cannot account for all contingencies. The emergence of the COVID-19 pandemic changed and complicated much in our lives, including the planning for VIS 2021. Moreover, transition to a unified conference was not without its challenges as well. Despite the difficulties, our community showed, once again, its strength and resilience. Our organizing committee created an exciting conference with a rich program full of high-quality research with all challenges being continuously and admirably addressed. As general chairs, our primary responsibility was to watch these wonderful volunteers conduct truly inspiring work under extreme constraints. For this, we are deeply indebted.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We have been honored to oversee the organization of IEEE VIS 2021. This marked the first year in which the SciVis, InfoVis, and VAST conferences were merged into a single, unified IEEE VIS. When we began planning for VIS in 2019, we envisioned a great experience for our community, who would be able to enjoy the innovative scientific program provided by a unified VIS, while delighting in the hospitable and lively atmosphere of New Orleans. But even the best laid plans cannot account for all contingencies. The emergence of the COVID-19 pandemic changed and complicated much in our lives, including the planning for VIS 2021. Moreover, transition to a unified conference was not without its challenges as well. Despite the difficulties, our community showed, once again, its strength and resilience. Our organizing committee created an exciting conference with a rich program full of high-quality research with all challenges being continuously and admirably addressed. As general chairs, our primary responsibility was to watch these wonderful volunteers conduct truly inspiring work under extreme constraints. For this, we are deeply indebted.",
"title": "Welcome",
"normalizedTitle": "Welcome",
"fno": "09663063",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Brian",
"surname": "Summa",
"fullName": "Brian Summa",
"affiliation": "Tulane University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luis Gustavo",
"surname": "Nonato",
"fullName": "Luis Gustavo Nonato",
"affiliation": "Universidade de Sao Paulo, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "xiii-xiii",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2020/01/08930151",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08930151/1fEi0WcYUXS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09340112",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09340112/1qMK1vPtB7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663062",
"title": "Message from the Editor-in-Chief",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663062/1zBaC3IZK9y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663082",
"title": "VIS 2021 Executive Committee",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663082/1zBaJbm09eU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663066",
"title": "VIS 2021 Reviewers",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663066/1zBaOnEFy6I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663080",
"title": "VIS 2021 Steering Committee",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663080/1zBaUnoFaDe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663070",
"title": "VIS 2021 Best Papers Committee",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663070/1zBasw2ZU3K",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663078",
"title": "VIS 2021 Area Curation Committee",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663078/1zBatQHolgs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663079",
"title": "VIS 2021 Conference Committee",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663079/1zBay2vt8DC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09663061",
"title": "Preface",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09663061/1zBb8giCGEU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09663062",
"articleId": "1zBaC3IZK9y",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09663061",
"articleId": "1zBb8giCGEU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDX",
"title": "May",
"year": "2019",
"issueNum": "05",
"idPrefix": "tp",
"pubType": "journal",
"volume": "41",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgyXK",
"doi": "10.1109/TPAMI.2018.2829192",
"abstract": "Linkages are essentially determined by similarity measures that may be derived from multiple perspectives. For example, spatial linkages are usually generated based on localities of heterogeneous data. Semantic linkages, however, can come from even more properties, such as different physical meanings behind social relations. Many existing metric learning models focus on spatial linkages but leave the <italic>rich</italic> semantic factors unconsidered. We propose a Unified Multi-Metric Learning (<sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$^2$_Z</tex-math></inline-formula><sc>l</sc>) framework to exploit <italic>multiple types</italic> of metrics with respect to overdetermined similarities between linkages. In <sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$^2$_Z</tex-math></inline-formula><sc>l</sc>, types of combination operators are introduced for distance characterization from multiple perspectives, and thus can introduce flexibilities for representing and utilizing both spatial and semantic linkages. Besides, we propose a uniform solver for <sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$^2$_Z</tex-math></inline-formula><sc>l</sc>, and the theoretical analysis reflects the generalization ability of <sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$^2$_Z</tex-math></inline-formula><sc>l</sc> as well. Extensive experiments on diverse applications exhibit the superior classification performance and comprehensibility of <sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">Z_$^2$_Z</tex-math></inline-formula><sc>l</sc>. Visualization results also validate its ability to physical meanings discovery.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Linkages are essentially determined by similarity measures that may be derived from multiple perspectives. For example, spatial linkages are usually generated based on localities of heterogeneous data. Semantic linkages, however, can come from even more properties, such as different physical meanings behind social relations. Many existing metric learning models focus on spatial linkages but leave the <italic>rich</italic> semantic factors unconsidered. We propose a Unified Multi-Metric Learning (<sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">$^2$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href=\"ye-ieq1-2829192.gif\"/></alternatives></inline-formula><sc>l</sc>) framework to exploit <italic>multiple types</italic> of metrics with respect to overdetermined similarities between linkages. In <sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">$^2$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href=\"ye-ieq2-2829192.gif\"/></alternatives></inline-formula><sc>l</sc>, types of combination operators are introduced for distance characterization from multiple perspectives, and thus can introduce flexibilities for representing and utilizing both spatial and semantic linkages. Besides, we propose a uniform solver for <sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">$^2$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href=\"ye-ieq3-2829192.gif\"/></alternatives></inline-formula><sc>l</sc>, and the theoretical analysis reflects the generalization ability of <sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">$^2$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href=\"ye-ieq4-2829192.gif\"/></alternatives></inline-formula><sc>l</sc> as well. Extensive experiments on diverse applications exhibit the superior classification performance and comprehensibility of <sc>Um</sc><inline-formula><tex-math notation=\"LaTeX\">$^2$</tex-math><alternatives><mml:math><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href=\"ye-ieq5-2829192.gif\"/></alternatives></inline-formula><sc>l</sc>. Visualization results also validate its ability to physical meanings discovery.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Linkages are essentially determined by similarity measures that may be derived from multiple perspectives. For example, spatial linkages are usually generated based on localities of heterogeneous data. Semantic linkages, however, can come from even more properties, such as different physical meanings behind social relations. Many existing metric learning models focus on spatial linkages but leave the rich semantic factors unconsidered. We propose a Unified Multi-Metric Learning (Um-l) framework to exploit multiple types of metrics with respect to overdetermined similarities between linkages. In Um-l, types of combination operators are introduced for distance characterization from multiple perspectives, and thus can introduce flexibilities for representing and utilizing both spatial and semantic linkages. Besides, we propose a uniform solver for Um-l, and the theoretical analysis reflects the generalization ability of Um-l as well. Extensive experiments on diverse applications exhibit the superior classification performance and comprehensibility of Um-l. Visualization results also validate its ability to physical meanings discovery.",
"title": "What Makes Objects Similar: A Unified Multi-Metric Learning Approach",
"normalizedTitle": "What Makes Objects Similar: A Unified Multi-Metric Learning Approach",
"fno": "08344546",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Measurement",
"Couplings",
"Semantics",
"Symmetric Matrices",
"Feature Extraction",
"Indexes",
"Correlation",
"Distance Metric Learning",
"Multi Metric Learning",
"Similarity Measures",
"Semantic"
],
"authors": [
{
"givenName": "Han-Jia",
"surname": "Ye",
"fullName": "Han-Jia Ye",
"affiliation": "National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "De-Chuan",
"surname": "Zhan",
"fullName": "De-Chuan Zhan",
"affiliation": "National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuan",
"surname": "Jiang",
"fullName": "Yuan Jiang",
"affiliation": "National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhi-Hua",
"surname": "Zhou",
"fullName": "Zhi-Hua Zhou",
"affiliation": "National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2019-05-01 00:00:00",
"pubType": "trans",
"pages": "1257-1270",
"year": "2019",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/td/2022/12/09732663",
"title": "Optimal Convex Hull Formation on a Grid by Asynchronous Robots With Lights",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09732663/1BD8Qcr91gQ",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/02/08730423",
"title": "Predicting Carbon Spectrum in Heteronuclear Single Quantum Coherence Spectroscopy for Online Feedback During Surgery",
"doi": null,
"abstractUrl": "/journal/tb/2020/02/08730423/1aAwyubtkha",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2021/01/09143480",
"title": "<sc>K-Athena</sc>: A Performance Portable Structured Grid Finite Volume Magnetohydrodynamics Code",
"doi": null,
"abstractUrl": "/journal/td/2021/01/09143480/1lxmD8qe0NO",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__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/tk/2023/01/09431704",
"title": "Corporate Relative Valuation Using Heterogeneous Multi-Modal Graph Neural Network",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09431704/1tB9b1r0Y12",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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/tp/2022/10/09448388",
"title": "A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method for Efficient Optimization and Generalization",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09448388/1ugE3BTixLq",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/05/09511831",
"title": "Data, User and Power Allocations for Caching in Multi-Access Edge Computing",
"doi": null,
"abstractUrl": "/journal/td/2022/05/09511831/1vYRJw2uV0I",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09485048",
"title": "Efficient Adaptive Online Learning via Frequent Directions",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09485048/1veojcOSicw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2022/12/09618848",
"title": "<sc>D<inline-formula><tex-math notation=\"LaTeX\">Z_$^2$_Z</tex-math></inline-formula>Abs</sc>: A Framework for Dynamic Dependence Analysis of Distributed Programs",
"doi": null,
"abstractUrl": "/journal/ts/2022/12/09618848/1yBC5MAzo0U",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08341743",
"articleId": "13rRUxjQyqq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08341745",
"articleId": "13rRUwh80I8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1soTv9FL6Qo",
"name": "ttp201905-08344546s1-tpami-ye-2829192-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201905-08344546s1-tpami-ye-2829192-mm.zip",
"extension": "zip",
"size": "814 kB",
"__typename": "WebExtraType"
},
{
"id": "18U6LuTk7te",
"name": "ttp201905-08344546s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201905-08344546s1.zip",
"extension": "zip",
"size": "814 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwENE5",
"title": "April",
"year": "2019",
"issueNum": "04",
"idPrefix": "tc",
"pubType": "journal",
"volume": "68",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14s8M4Sn2IE",
"doi": "10.1109/TC.2018.2874662",
"abstract": "We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathbb {F}_2$_Z</tex-math></inline-formula>. We restrict the search of small circuits to a class of circuits we call <italic>symmetric bilinear. These are circuits in which AND gates only compute functions of the form <inline-formula><tex-math notation=\"LaTeX\">Z_$\\sum _{i \\in S} a_i \\cdot \\sum _{i \\in S} b_i \\quad \\quad (S \\subseteq \\lbrace 0, \\ldots, n-1\\rbrace).$_Z</tex-math></inline-formula> These techniques yield improved recurrences for <inline-formula><tex-math notation=\"LaTeX\">Z_$M(kn)$_Z</tex-math></inline-formula>, the number of gates used in a circuit that multiplies two <inline-formula><tex-math notation=\"LaTeX\">Z_$kn$_Z</tex-math></inline-formula>-term polynomials, for <inline-formula><tex-math notation=\"LaTeX\">Z_$k = 4,5,6,$_Z</tex-math></inline-formula> and 7. We built and verified the circuits for <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>-term binary polynomial multiplication for values of <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> of practical interest. Circuits for <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula> up to 100 are posted at <uri>http://cs-www.cs.yale.edu/homes/peralta/CircuitStuff/BinPolMult.tar.gz</uri>.</italic>",
"abstracts": [
{
"abstractType": "Regular",
"content": "We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over <inline-formula><tex-math notation=\"LaTeX\">$\\mathbb {F}_2$</tex-math><alternatives><mml:math><mml:msub><mml:mi mathvariant=\"double-struck\">F</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math><inline-graphic xlink:href=\"peralta-ieq1-2874662.gif\"/></alternatives></inline-formula>. We restrict the search of small circuits to a class of circuits we call <italic>symmetric bilinear. These are circuits in which AND gates only compute functions of the form <inline-formula><tex-math notation=\"LaTeX\">$\\sum _{i \\in S} a_i \\cdot \\sum _{i \\in S} b_i \\quad \\quad (S \\subseteq \\lbrace 0, \\ldots, n-1\\rbrace).$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>∈</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>·</mml:mo><mml:msub><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>∈</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mspace width=\"1.em\"/><mml:mspace width=\"1.em\"/><mml:mrow><mml:mo>(</mml:mo><mml:mi>S</mml:mi><mml:mo>⊆</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mo>...</mml:mo><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"peralta-ieq2-2874662.gif\"/></alternatives></inline-formula> These techniques yield improved recurrences for <inline-formula><tex-math notation=\"LaTeX\">$M(kn)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>M</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"peralta-ieq3-2874662.gif\"/></alternatives></inline-formula>, the number of gates used in a circuit that multiplies two <inline-formula><tex-math notation=\"LaTeX\">$kn$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>k</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"peralta-ieq4-2874662.gif\"/></alternatives></inline-formula>-term polynomials, for <inline-formula><tex-math notation=\"LaTeX\">$k = 4,5,6,$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"peralta-ieq5-2874662.gif\"/></alternatives></inline-formula> and 7. We built and verified the circuits for <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"peralta-ieq6-2874662.gif\"/></alternatives></inline-formula>-term binary polynomial multiplication for values of <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"peralta-ieq7-2874662.gif\"/></alternatives></inline-formula> of practical interest. Circuits for <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"peralta-ieq8-2874662.gif\"/></alternatives></inline-formula> up to 100 are posted at <uri>http://cs-www.cs.yale.edu/homes/peralta/CircuitStuff/BinPolMult.tar.gz</uri>.</italic>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of polynomials over -. We restrict the search of small circuits to a class of circuits we call symmetric bilinear. These are circuits in which AND gates only compute functions of the form - These techniques yield improved recurrences for -, the number of gates used in a circuit that multiplies two --term polynomials, for - and 7. We built and verified the circuits for --term binary polynomial multiplication for values of - of practical interest. Circuits for - up to 100 are posted at http://cs-www.cs.yale.edu/homes/peralta/CircuitStuff/BinPolMult.tar.gz.",
"title": "Better Circuits for Binary Polynomial Multiplication",
"normalizedTitle": "Better Circuits for Binary Polynomial Multiplication",
"fno": "08494787",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Logic Gates",
"Symmetric Matrices",
"Additives",
"Complexity Theory",
"Elliptic Curve Cryptography",
"Upper Bound",
"Binary Polynomial Multiplication",
"Circuits",
"Symmetric Bilinear Circuits"
],
"authors": [
{
"givenName": "Magnus Gaudal",
"surname": "Find",
"fullName": "Magnus Gaudal Find",
"affiliation": "National Institute of Standards and Technology, Gaithersburg, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "René",
"surname": "Peralta",
"fullName": "René Peralta",
"affiliation": "Computer Security Division, National Institute of Standards and Technology, Gaithersburg, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2019-04-01 00:00:00",
"pubType": "trans",
"pages": "624-630",
"year": "2019",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2023/01/09681162",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681162/1A8c6sY0Afe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/01/09721000",
"title": "An Iterative Montgomery Modular Multiplication Algorithm With Low Area-Time Product",
"doi": null,
"abstractUrl": "/journal/tc/2023/01/09721000/1BfUabvXdDy",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/06/09924585",
"title": "Tensor Based Multivariate Polynomial Modulo Multiplier for Cryptographic Applications",
"doi": null,
"abstractUrl": "/journal/tc/2023/06/09924585/1HBI0BSZqjC",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/02/09328560",
"title": "High-Radix Design of a Scalable Montgomery Modular Multiplier With Low Latency",
"doi": null,
"abstractUrl": "/journal/tc/2022/02/09328560/1qw8PWGHmEM",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09369083",
"title": "Robust Low-Tubal-Rank Tensor Recovery From Binary Measurements",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09369083/1rFvS23KDAI",
"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/tc/2022/06/09445629",
"title": "Up to <inline-formula><tex-math notation=\"LaTeX\">Z_$8k$_Z</tex-math></inline-formula>-bit Modular Montgomery Multiplication in Residue Number Systems With Fast 16-bit Residue Channels",
"doi": null,
"abstractUrl": "/journal/tc/2022/06/09445629/1uaauvs6N0c",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/06/09511805",
"title": "Distributed Graph Realizations",
"doi": null,
"abstractUrl": "/journal/td/2022/06/09511805/1vYRJ00nBTi",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09485048",
"title": "Efficient Adaptive Online Learning via Frequent Directions",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09485048/1veojcOSicw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__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": "08523808",
"articleId": "17D45VsBU7c",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "18k4xJ6Nkly",
"name": "ttc201904-08494787s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttc201904-08494787s1.zip",
"extension": "zip",
"size": "9.47 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyKJiah",
"title": "Dec.",
"year": "2018",
"issueNum": "12",
"idPrefix": "td",
"pubType": "journal",
"volume": "29",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XzbnJ8",
"doi": "10.1109/TPDS.2018.2849705",
"abstract": "This work presents and studies the efficiency problem of mapping GPU threads onto simplex domains. A non-linear map <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda (\\omega)$_Z</tex-math></inline-formula> is formulated based on a block-space enumeration principle that reduces the number of thread-blocks by a factor of approximately <inline-formula><tex-math notation=\"LaTeX\">Z_$2\\times$_Z</tex-math></inline-formula> and <inline-formula> <tex-math notation=\"LaTeX\">Z_$6\\times$_Z</tex-math></inline-formula> for 2-simplex and 3-simplex domains, respectively, when compared to the standard approach. Performance results show that <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda (\\omega)$_Z</tex-math> </inline-formula> is competitive and even the fastest map when ran in recent GPU architectures such as the Tesla V100, where it reaches up to <inline-formula><tex-math notation=\"LaTeX\">Z_$1.5\\times$_Z</tex-math></inline-formula> of speedup in 2-simplex tests. In 3-simplex tests, it reaches up to <inline-formula><tex-math notation=\"LaTeX\">Z_$2.3\\times$_Z</tex-math></inline-formula> of speedup for small workloads and up to <inline-formula><tex-math notation=\"LaTeX\">Z_$1.25\\times$_Z</tex-math></inline-formula> for larger ones. The results obtained make <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda (\\omega)$_Z</tex-math></inline-formula> a useful GPU optimization technique with applications on parallel problems that define all-pairs, all-triplets or nearest neighbors interactions in a 2-simplex or 3-simplex domain.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This work presents and studies the efficiency problem of mapping GPU threads onto simplex domains. A non-linear map <inline-formula><tex-math notation=\"LaTeX\">$\\lambda (\\omega)$</tex-math><alternatives> <inline-graphic xlink:href=\"navarro-ieq1-2849705.gif\"/></alternatives></inline-formula> is formulated based on a block-space enumeration principle that reduces the number of thread-blocks by a factor of approximately <inline-formula><tex-math notation=\"LaTeX\">$2\\times$</tex-math><alternatives> <inline-graphic xlink:href=\"navarro-ieq2-2849705.gif\"/></alternatives></inline-formula> and <inline-formula> <tex-math notation=\"LaTeX\">$6\\times$</tex-math><alternatives><inline-graphic xlink:href=\"navarro-ieq3-2849705.gif\"/> </alternatives></inline-formula> for 2-simplex and 3-simplex domains, respectively, when compared to the standard approach. Performance results show that <inline-formula><tex-math notation=\"LaTeX\">$\\lambda (\\omega)$</tex-math> <alternatives><inline-graphic xlink:href=\"navarro-ieq4-2849705.gif\"/></alternatives></inline-formula> is competitive and even the fastest map when ran in recent GPU architectures such as the Tesla V100, where it reaches up to <inline-formula><tex-math notation=\"LaTeX\">$1.5\\times$</tex-math><alternatives> <inline-graphic xlink:href=\"navarro-ieq5-2849705.gif\"/></alternatives></inline-formula> of speedup in 2-simplex tests. In 3-simplex tests, it reaches up to <inline-formula><tex-math notation=\"LaTeX\">$2.3\\times$</tex-math><alternatives> <inline-graphic xlink:href=\"navarro-ieq6-2849705.gif\"/></alternatives></inline-formula> of speedup for small workloads and up to <inline-formula><tex-math notation=\"LaTeX\">$1.25\\times$</tex-math><alternatives> <inline-graphic xlink:href=\"navarro-ieq7-2849705.gif\"/></alternatives></inline-formula> for larger ones. The results obtained make <inline-formula><tex-math notation=\"LaTeX\">$\\lambda (\\omega)$</tex-math><alternatives> <inline-graphic xlink:href=\"navarro-ieq8-2849705.gif\"/></alternatives></inline-formula> a useful GPU optimization technique with applications on parallel problems that define all-pairs, all-triplets or nearest neighbors interactions in a 2-simplex or 3-simplex domain.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This work presents and studies the efficiency problem of mapping GPU threads onto simplex domains. A non-linear map - is formulated based on a block-space enumeration principle that reduces the number of thread-blocks by a factor of approximately - and - for 2-simplex and 3-simplex domains, respectively, when compared to the standard approach. Performance results show that - is competitive and even the fastest map when ran in recent GPU architectures such as the Tesla V100, where it reaches up to - of speedup in 2-simplex tests. In 3-simplex tests, it reaches up to - of speedup for small workloads and up to - for larger ones. The results obtained make - a useful GPU optimization technique with applications on parallel problems that define all-pairs, all-triplets or nearest neighbors interactions in a 2-simplex or 3-simplex domain.",
"title": "Competitiveness of a Non-Linear Block-Space GPU Thread Map for Simplex Domains",
"normalizedTitle": "Competitiveness of a Non-Linear Block-Space GPU Thread Map for Simplex Domains",
"fno": "08392762",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Graphics Processing Units",
"Instruction Sets",
"Symmetric Matrices",
"Computer Architecture",
"Optimization",
"Programming",
"GPU Thread Mapping",
"Block Space",
"Simplex Domains",
"GPU Optimization"
],
"authors": [
{
"givenName": "Cristóbal A.",
"surname": "Navarro",
"fullName": "Cristóbal A. Navarro",
"affiliation": "Institute of Informatics, Austral University of Chile, Valdivia, Región de los Ríos, Chile",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthieu",
"surname": "Vernier",
"fullName": "Matthieu Vernier",
"affiliation": "Institute of Informatics, Austral University of Chile, Valdivia, Región de los Ríos, Chile",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benjamin",
"surname": "Bustos",
"fullName": "Benjamin Bustos",
"affiliation": "Department of Computer Science, Millenium Institute for Foundational Research on Data, University of Chile, Santiago, Chile",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nancy",
"surname": "Hitschfeld",
"fullName": "Nancy Hitschfeld",
"affiliation": "Computer Science Department, University of Chile, Santiago, Chile",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2018-12-01 00:00:00",
"pubType": "trans",
"pages": "2728-2741",
"year": "2018",
"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/tc/2017/08/06357187",
"title": "Wait-Free Programming for General Purpose Computations on Graphics Processors",
"doi": null,
"abstractUrl": "/journal/tc/2017/08/06357187/13rRUzpzeAh",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09681162",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681162/1A8c6sY0Afe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09712412",
"title": "Centerless Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09712412/1AZKZVM8b84",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/03/09827923",
"title": "PMNS for Efficient Arithmetic and Small Memory Cost",
"doi": null,
"abstractUrl": "/journal/ec/2022/03/09827923/1EWSBFUfd6M",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/04/09109708",
"title": "Unsupervised Large Graph Embedding Based on Balanced and Hierarchical K-Means",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09109708/1kpEsyACWGs",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__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/tp/2022/10/09485048",
"title": "Efficient Adaptive Online Learning via Frequent Directions",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09485048/1veojcOSicw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__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": "08372629",
"articleId": "17D45Wt3EwC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08370902",
"articleId": "17D45XuDNFO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1IRhD73QTpC",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1A8c6sY0Afe",
"doi": "10.1109/TPAMI.2022.3143089",
"abstract": "Point cloud (PC)—a collection of discrete geometric samples of a 3D object’s surface—is typically large, which entails expensive subsequent operations. Thus, PC sub-sampling is of practical importance. Previous model-based sub-sampling schemes are ad-hoc in design and do not preserve the overall shape sufficiently well, while previous data-driven schemes are trained for specific pre-determined input PC sizes and sub-sampling rates and thus do not generalize well. Leveraging advances in graph sampling, we propose a fast PC sub-sampling algorithm of linear time complexity that chooses a 3D point subset while minimizing a global reconstruction error. Specifically, to articulate a sampling objective, we first assume a super-resolution (SR) method based on feature graph Laplacian regularization (FGLR) that reconstructs the original high-res PC, given points chosen by a sampling matrix <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf H}$_Z</tex-math></inline-formula>. We prove that minimizing a worst-case SR reconstruction error is equivalent to maximizing the smallest eigenvalue <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda _{\\min }$_Z</tex-math></inline-formula> of matrix <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf H}^{\\top } {\\mathbf H}+ \\mu {\\boldsymbol{\\mathcal{L}}}$_Z</tex-math></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">Z_${\\boldsymbol{\\mathcal{L}}}$_Z</tex-math></inline-formula> is a symmetric, positive semi-definite matrix derived from a neighborhood graph connecting the 3D points. To arrive at a fast algorithm, instead of maximizing <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda _{\\min }$_Z</tex-math></inline-formula>, we maximize a lower bound <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda ^-_{\\min }({\\mathbf H}^{\\top } {\\mathbf H}+ \\mu {\\boldsymbol{\\mathcal{L}}})$_Z</tex-math></inline-formula> via selection of <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf H}$_Z</tex-math></inline-formula>—this translates to a graph sampling problem for a signed graph <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathcal G}$_Z</tex-math></inline-formula> with self-loops specified by graph Laplacian <inline-formula><tex-math notation=\"LaTeX\">Z_${\\boldsymbol{\\mathcal{L}}}$_Z</tex-math></inline-formula>. We tackle this general graph sampling problem in three steps. First, we approximate <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathcal G}$_Z</tex-math></inline-formula> with a balanced graph <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathcal G}_B$_Z</tex-math></inline-formula> specified by Laplacian <inline-formula><tex-math notation=\"LaTeX\">Z_${\\boldsymbol{\\mathcal{L}}}_B$_Z</tex-math></inline-formula>. Second, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we perform a similarity transform <inline-formula><tex-math notation=\"LaTeX\">Z_${\\boldsymbol{\\mathcal{L}}}_p~=~{\\mathbf S}{\\boldsymbol{\\mathcal{L}}}_B {\\mathbf S}^{-1}$_Z</tex-math></inline-formula>, so that all Gershgorin disc left-ends of <inline-formula><tex-math notation=\"LaTeX\">Z_${\\boldsymbol{\\mathcal{L}}}_p$_Z</tex-math></inline-formula> are aligned exactly at <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda _{\\min }({\\boldsymbol{\\mathcal{L}}}_B)$_Z</tex-math></inline-formula>. Finally, we choose samples on <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathcal G}_B$_Z</tex-math></inline-formula> using a previous graph sampling algorithm to maximize <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda ^-_{\\min }({\\mathbf H}^{\\top } {\\mathbf H}+ \\mu {\\boldsymbol{\\mathcal{L}}}_p)$_Z</tex-math></inline-formula> in linear time. Experimental results show that 3D points chosen by our algorithm outperformed competing schemes both numerically and visually in reconstruction quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Point cloud (PC)—a collection of discrete geometric samples of a 3D object’s surface—is typically large, which entails expensive subsequent operations. Thus, PC sub-sampling is of practical importance. Previous model-based sub-sampling schemes are ad-hoc in design and do not preserve the overall shape sufficiently well, while previous data-driven schemes are trained for specific pre-determined input PC sizes and sub-sampling rates and thus do not generalize well. Leveraging advances in graph sampling, we propose a fast PC sub-sampling algorithm of linear time complexity that chooses a 3D point subset while minimizing a global reconstruction error. Specifically, to articulate a sampling objective, we first assume a super-resolution (SR) method based on feature graph Laplacian regularization (FGLR) that reconstructs the original high-res PC, given points chosen by a sampling matrix <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf H}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">H</mml:mi></mml:math><inline-graphic xlink:href=\"dinesh-ieq1-3143089.gif\"/></alternatives></inline-formula>. We prove that minimizing a worst-case SR reconstruction error is equivalent to maximizing the smallest eigenvalue <inline-formula><tex-math notation=\"LaTeX\">$\\lambda _{\\min }$</tex-math><alternatives><mml:math><mml:msub><mml:mi>λ</mml:mi><mml:mo movablelimits=\"true\" form=\"prefix\">min</mml:mo></mml:msub></mml:math><inline-graphic xlink:href=\"dinesh-ieq2-3143089.gif\"/></alternatives></inline-formula> of matrix <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf H}^{\\top } {\\mathbf H}+ \\mu {\\boldsymbol{\\mathcal{L}}}$</tex-math><alternatives><mml:math><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant=\"bold\">H</mml:mi></mml:mrow><mml:mi>⊤</mml:mi></mml:msup><mml:mi mathvariant=\"bold\">H</mml:mi><mml:mo>+</mml:mo><mml:mi>μ</mml:mi><mml:mi mathvariant=\"script\">L</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"dinesh-ieq3-3143089.gif\"/></alternatives></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">${\\boldsymbol{\\mathcal{L}}}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">L</mml:mi></mml:math><inline-graphic xlink:href=\"dinesh-ieq4-3143089.gif\"/></alternatives></inline-formula> is a symmetric, positive semi-definite matrix derived from a neighborhood graph connecting the 3D points. To arrive at a fast algorithm, instead of maximizing <inline-formula><tex-math notation=\"LaTeX\">$\\lambda _{\\min }$</tex-math><alternatives><mml:math><mml:msub><mml:mi>λ</mml:mi><mml:mo movablelimits=\"true\" form=\"prefix\">min</mml:mo></mml:msub></mml:math><inline-graphic xlink:href=\"dinesh-ieq5-3143089.gif\"/></alternatives></inline-formula>, we maximize a lower bound <inline-formula><tex-math notation=\"LaTeX\">$\\lambda ^-_{\\min }({\\mathbf H}^{\\top } {\\mathbf H}+ \\mu {\\boldsymbol{\\mathcal{L}}})$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mi>λ</mml:mi><mml:mo movablelimits=\"true\" form=\"prefix\">min</mml:mo><mml:mo>-</mml:mo></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant=\"bold\">H</mml:mi></mml:mrow><mml:mi>⊤</mml:mi></mml:msup><mml:mi mathvariant=\"bold\">H</mml:mi><mml:mo>+</mml:mo><mml:mi>μ</mml:mi><mml:mi mathvariant=\"script\">L</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"dinesh-ieq6-3143089.gif\"/></alternatives></inline-formula> via selection of <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf H}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">H</mml:mi></mml:math><inline-graphic xlink:href=\"dinesh-ieq7-3143089.gif\"/></alternatives></inline-formula>—this translates to a graph sampling problem for a signed graph <inline-formula><tex-math notation=\"LaTeX\">${\\mathcal G}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">G</mml:mi></mml:math><inline-graphic xlink:href=\"dinesh-ieq8-3143089.gif\"/></alternatives></inline-formula> with self-loops specified by graph Laplacian <inline-formula><tex-math notation=\"LaTeX\">${\\boldsymbol{\\mathcal{L}}}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">L</mml:mi></mml:math><inline-graphic xlink:href=\"dinesh-ieq9-3143089.gif\"/></alternatives></inline-formula>. We tackle this general graph sampling problem in three steps. First, we approximate <inline-formula><tex-math notation=\"LaTeX\">${\\mathcal G}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">G</mml:mi></mml:math><inline-graphic xlink:href=\"dinesh-ieq10-3143089.gif\"/></alternatives></inline-formula> with a balanced graph <inline-formula><tex-math notation=\"LaTeX\">${\\mathcal G}_B$</tex-math><alternatives><mml:math><mml:msub><mml:mi mathvariant=\"script\">G</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"dinesh-ieq11-3143089.gif\"/></alternatives></inline-formula> specified by Laplacian <inline-formula><tex-math notation=\"LaTeX\">${\\boldsymbol{\\mathcal{L}}}_B$</tex-math><alternatives><mml:math><mml:msub><mml:mi mathvariant=\"script\">L</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"dinesh-ieq12-3143089.gif\"/></alternatives></inline-formula>. Second, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we perform a similarity transform <inline-formula><tex-math notation=\"LaTeX\">${\\boldsymbol{\\mathcal{L}}}_p~=~{\\mathbf S}{\\boldsymbol{\\mathcal{L}}}_B {\\mathbf S}^{-1}$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi mathvariant=\"script\">L</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mspace width=\"3.33333pt\"/><mml:mo>=</mml:mo><mml:mspace width=\"3.33333pt\"/><mml:mi mathvariant=\"bold\">S</mml:mi><mml:msub><mml:mi mathvariant=\"script\">L</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mi mathvariant=\"bold\">S</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href=\"dinesh-ieq13-3143089.gif\"/></alternatives></inline-formula>, so that all Gershgorin disc left-ends of <inline-formula><tex-math notation=\"LaTeX\">${\\boldsymbol{\\mathcal{L}}}_p$</tex-math><alternatives><mml:math><mml:msub><mml:mi mathvariant=\"script\">L</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"dinesh-ieq14-3143089.gif\"/></alternatives></inline-formula> are aligned exactly at <inline-formula><tex-math notation=\"LaTeX\">$\\lambda _{\\min }({\\boldsymbol{\\mathcal{L}}}_B)$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>λ</mml:mi><mml:mo movablelimits=\"true\" form=\"prefix\">min</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant=\"script\">L</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"dinesh-ieq15-3143089.gif\"/></alternatives></inline-formula>. Finally, we choose samples on <inline-formula><tex-math notation=\"LaTeX\">${\\mathcal G}_B$</tex-math><alternatives><mml:math><mml:msub><mml:mi mathvariant=\"script\">G</mml:mi><mml:mi>B</mml:mi></mml:msub></mml:math><inline-graphic xlink:href=\"dinesh-ieq16-3143089.gif\"/></alternatives></inline-formula> using a previous graph sampling algorithm to maximize <inline-formula><tex-math notation=\"LaTeX\">$\\lambda ^-_{\\min }({\\mathbf H}^{\\top } {\\mathbf H}+ \\mu {\\boldsymbol{\\mathcal{L}}}_p)$</tex-math><alternatives><mml:math><mml:mrow><mml:msubsup><mml:mi>λ</mml:mi><mml:mo movablelimits=\"true\" form=\"prefix\">min</mml:mo><mml:mo>-</mml:mo></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant=\"bold\">H</mml:mi></mml:mrow><mml:mi>⊤</mml:mi></mml:msup><mml:mi mathvariant=\"bold\">H</mml:mi><mml:mo>+</mml:mo><mml:mi>μ</mml:mi><mml:msub><mml:mi mathvariant=\"script\">L</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math><inline-graphic xlink:href=\"dinesh-ieq17-3143089.gif\"/></alternatives></inline-formula> in linear time. Experimental results show that 3D points chosen by our algorithm outperformed competing schemes both numerically and visually in reconstruction quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Point cloud (PC)—a collection of discrete geometric samples of a 3D object’s surface—is typically large, which entails expensive subsequent operations. Thus, PC sub-sampling is of practical importance. Previous model-based sub-sampling schemes are ad-hoc in design and do not preserve the overall shape sufficiently well, while previous data-driven schemes are trained for specific pre-determined input PC sizes and sub-sampling rates and thus do not generalize well. Leveraging advances in graph sampling, we propose a fast PC sub-sampling algorithm of linear time complexity that chooses a 3D point subset while minimizing a global reconstruction error. Specifically, to articulate a sampling objective, we first assume a super-resolution (SR) method based on feature graph Laplacian regularization (FGLR) that reconstructs the original high-res PC, given points chosen by a sampling matrix -. We prove that minimizing a worst-case SR reconstruction error is equivalent to maximizing the smallest eigenvalue - of matrix -, where - is a symmetric, positive semi-definite matrix derived from a neighborhood graph connecting the 3D points. To arrive at a fast algorithm, instead of maximizing -, we maximize a lower bound - via selection of -—this translates to a graph sampling problem for a signed graph - with self-loops specified by graph Laplacian -. We tackle this general graph sampling problem in three steps. First, we approximate - with a balanced graph - specified by Laplacian -. Second, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we perform a similarity transform -, so that all Gershgorin disc left-ends of - are aligned exactly at -. Finally, we choose samples on - using a previous graph sampling algorithm to maximize - in linear time. Experimental results show that 3D points chosen by our algorithm outperformed competing schemes both numerically and visually in reconstruction quality.",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"normalizedTitle": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"fno": "09681162",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Approximation Theory",
"Computational Complexity",
"Computational Geometry",
"Eigenvalues And Eigenfunctions",
"Graph Theory",
"Matrix Algebra",
"Sampling Methods",
"3 D Point Subset",
"Data Driven Schemes",
"Discrete Geometric Samples",
"Feature Graph Laplacian Regularization",
"General Graph Sampling Problem",
"Gershgorin Disc Alignment",
"Gershgorin Disc Left Ends",
"Gershgorin Disc Perfect Alignment",
"Global Reconstruction Error",
"Graph Balancing",
"Linear Time Complexity",
"Model Based Sub Sampling Schemes",
"Neighborhood Graph",
"Original High Res PC",
"Point Cloud Sampling",
"Recent Linear Algebraic Theorem",
"Sampling Matrix",
"Semidefinite Matrix",
"Smallest Eigenvalue",
"Super Resolution Method",
"Worst Case SR Reconstruction Error",
"Three Dimensional Displays",
"Laplace Equations",
"Signal Processing Algorithms",
"Symmetric Matrices",
"Eigenvalues And Eigenfunctions",
"Point Cloud Compression",
"Superresolution",
"Point Cloud Processing",
"Graph Signal Processing",
"Graph Sampling",
"Gershgorin Circle Theorem",
"Graph Laplacian Regularizer"
],
"authors": [
{
"givenName": "Chinthaka",
"surname": "Dinesh",
"fullName": "Chinthaka Dinesh",
"affiliation": "School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gene",
"surname": "Cheung",
"fullName": "Gene Cheung",
"affiliation": "Department of Electrical Engineering & Computer Science, York University, Toronto, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ivan V.",
"surname": "Bajić",
"fullName": "Ivan V. Bajić",
"affiliation": "School of Engineering Science, Simon Fraser University, Burnaby, BC, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "868-886",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tp/2023/01/09712412",
"title": "Centerless Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09712412/1AZKZVM8b84",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/03/09827923",
"title": "PMNS for Efficient Arithmetic and Small Memory Cost",
"doi": null,
"abstractUrl": "/journal/ec/2022/03/09827923/1EWSBFUfd6M",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/08964488",
"title": "Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/08964488/1gLZGsjhZkc",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09037115",
"title": "Aligning Points to Lines: Provable Approximations",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09037115/1igMO6tI3Is",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/04/09109708",
"title": "Unsupervised Large Graph Embedding Based on Balanced and Hierarchical K-Means",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09109708/1kpEsyACWGs",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2022/02/09187550",
"title": "Towards More Secure Constructions of Adjustable Join Schemes",
"doi": null,
"abstractUrl": "/journal/tq/2022/02/09187550/1mVFLWkSEQU",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09463735",
"title": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09463735/1uFxm1okYhO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2023/01/09582834",
"title": "Latency and Energy-Aware Load Balancing in Cloud Data Centers: A Bargaining Game Based Approach",
"doi": null,
"abstractUrl": "/journal/cc/2023/01/09582834/1xR2SrQJAXK",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__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": "09735342",
"articleId": "1BLmVZBJX6o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09669083",
"articleId": "1zTfWdgENFK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1IRhD73QTpC",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1AZKZVM8b84",
"doi": "10.1109/TPAMI.2022.3150981",
"abstract": "Although lots of clustering models have been proposed recently, <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-means and the family of spectral clustering methods are both still drawing a lot of attention due to their simplicity and efficacy. We first reviewed the unified framework of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-means and graph cut models, and then proposed a clustering method called <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-sums where a <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-nearest neighbor (<inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-NN) graph is adopted. The main idea of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-sums is to minimize directly the sum of the distances between points in the same cluster. To deal with the situation where the graph is unavailable, we proposed <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-sums-x that takes features as input. The computational and memory overhead of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-sums are both <inline-formula><tex-math notation=\"LaTeX\">Z_$O(nk)$_Z</tex-math></inline-formula>, indicating that it can scale linearly w.r.t. the number of objects to group. Moreover, the costs of computational and memory are Irrelevant to the product of the number of points and clusters. The computational and memory complexity of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-sums-x are both linear w.r.t. the number of points. To validate the advantage of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-sums and <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-sums-x on facial datasets, extensive experiments have been conducted on 10 synthetic datasets and 17 benchmark datasets. While having a low time complexity, the performance of <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-sums is comparable with several state-of-the-art clustering methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Although lots of clustering models have been proposed recently, <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq1-3150981.gif\"/></alternatives></inline-formula>-means and the family of spectral clustering methods are both still drawing a lot of attention due to their simplicity and efficacy. We first reviewed the unified framework of <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq2-3150981.gif\"/></alternatives></inline-formula>-means and graph cut models, and then proposed a clustering method called <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq3-3150981.gif\"/></alternatives></inline-formula>-sums where a <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq4-3150981.gif\"/></alternatives></inline-formula>-nearest neighbor (<inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq5-3150981.gif\"/></alternatives></inline-formula>-NN) graph is adopted. The main idea of <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq6-3150981.gif\"/></alternatives></inline-formula>-sums is to minimize directly the sum of the distances between points in the same cluster. To deal with the situation where the graph is unavailable, we proposed <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq7-3150981.gif\"/></alternatives></inline-formula>-sums-x that takes features as input. The computational and memory overhead of <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq8-3150981.gif\"/></alternatives></inline-formula>-sums are both <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=\"pei-ieq9-3150981.gif\"/></alternatives></inline-formula>, indicating that it can scale linearly w.r.t. the number of objects to group. Moreover, the costs of computational and memory are Irrelevant to the product of the number of points and clusters. The computational and memory complexity of <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq10-3150981.gif\"/></alternatives></inline-formula>-sums-x are both linear w.r.t. the number of points. To validate the advantage of <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq11-3150981.gif\"/></alternatives></inline-formula>-sums and <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq12-3150981.gif\"/></alternatives></inline-formula>-sums-x on facial datasets, extensive experiments have been conducted on 10 synthetic datasets and 17 benchmark datasets. While having a low time complexity, the performance of <inline-formula><tex-math notation=\"LaTeX\">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href=\"pei-ieq13-3150981.gif\"/></alternatives></inline-formula>-sums is comparable with several state-of-the-art clustering methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Although lots of clustering models have been proposed recently, --means and the family of spectral clustering methods are both still drawing a lot of attention due to their simplicity and efficacy. We first reviewed the unified framework of --means and graph cut models, and then proposed a clustering method called --sums where a --nearest neighbor (--NN) graph is adopted. The main idea of --sums is to minimize directly the sum of the distances between points in the same cluster. To deal with the situation where the graph is unavailable, we proposed --sums-x that takes features as input. The computational and memory overhead of --sums are both -, indicating that it can scale linearly w.r.t. the number of objects to group. Moreover, the costs of computational and memory are Irrelevant to the product of the number of points and clusters. The computational and memory complexity of --sums-x are both linear w.r.t. the number of points. To validate the advantage of --sums and --sums-x on facial datasets, extensive experiments have been conducted on 10 synthetic datasets and 17 benchmark datasets. While having a low time complexity, the performance of --sums is comparable with several state-of-the-art clustering methods.",
"title": "Centerless Clustering",
"normalizedTitle": "Centerless Clustering",
"fno": "09712412",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computational Complexity",
"Graph Theory",
"Pattern Clustering",
"Centerless Clustering",
"Clustering Models",
"Computational Memory Complexity",
"Computational Memory Overhead",
"Graph Cut Models",
"K Nearest Neighbor",
"K Sums",
"K Sums X",
"Spectral Clustering Methods",
"Clustering Algorithms",
"Clustering Methods",
"Analytical Models",
"Computational Modeling",
"Symmetric Matrices",
"Linear Programming",
"Videos",
"Artificial Intelligence",
"Clustering",
"Efficient",
"<named-content xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" content-type=\"math\" xlink:type=\"simple\"> <inline-formula> <tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math> </inline-formula> </named-content>-nearest graph",
"<named-content xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" content-type=\"math\" xlink:type=\"simple\"> <inline-formula> <tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math> </inline-formula> </named-content>-means"
],
"authors": [
{
"givenName": "Shenfei",
"surname": "Pei",
"fullName": "Shenfei Pei",
"affiliation": "Key Laboratory of Intelligent Interaction and Applications (Ministry of Industry and Information Technology), School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huimin",
"surname": "Chen",
"fullName": "Huimin Chen",
"affiliation": "Key Laboratory of Intelligent Interaction and Applications (Ministry of Industry and Information Technology), School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feiping",
"surname": "Nie",
"fullName": "Feiping Nie",
"affiliation": "Key Laboratory of Intelligent Interaction and Applications (Ministry of Industry and Information Technology), School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rong",
"surname": "Wang",
"fullName": "Rong Wang",
"affiliation": "Key Laboratory of Intelligent Interaction and Applications (Ministry of Industry and Information Technology), School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuelong",
"surname": "Li",
"fullName": "Xuelong Li",
"affiliation": "Key Laboratory of Intelligent Interaction and Applications (Ministry of Industry and Information Technology), School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "167-181",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09681162",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681162/1A8c6sY0Afe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09769920",
"title": "Unified One-Step Multi-View Spectral Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09769920/1D80Z611aGA",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/04/09109708",
"title": "Unsupervised Large Graph Embedding Based on Balanced and Hierarchical K-Means",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09109708/1kpEsyACWGs",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09244575",
"title": "Distributed Density Peaks Clustering Revisited",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09244575/1ojYk1yEY1i",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/06/09309172",
"title": "Detecting Meaningful Clusters From High-Dimensional Data: A Strongly Consistent Sparse Center-Based Clustering Approach",
"doi": null,
"abstractUrl": "/journal/tp/2022/06/09309172/1pQEdzozLwY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09409736",
"title": "Low-Rank Riemannian Optimization for Graph-Based Clustering Applications",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09409736/1sXjx764TBe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/05/09444882",
"title": "Coordinate Descent Method for <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-means",
"doi": null,
"abstractUrl": "/journal/tp/2022/05/09444882/1u51seEJDiM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09463735",
"title": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09463735/1uFxm1okYhO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09485048",
"title": "Efficient Adaptive Online Learning via Frequent Directions",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09485048/1veojcOSicw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09674931",
"articleId": "1zYeSAsg7DO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09721052",
"articleId": "1BfU4JW4nIs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1MNboCLDDZC",
"title": "June",
"year": "2023",
"issueNum": "06",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DjDnjq9sGI",
"doi": "10.1109/TKDE.2022.3174570",
"abstract": "A graph stream is a continuous sequence of data items, in which each item indicates an edge, including its two endpoints and edge weight. It forms a dynamic graph that changes with every item. Graph streams play important roles in cyber security, social networks, cloud troubleshooting systems and more. Due to the vast volume and high update speed of graph streams, traditional data structures for graph storage such as the adjacency matrix and the adjacency list are no longer sufficient. However, prior art of graph stream summarization either supports limited kinds of queries or suffers from poor accuracy of query results. In this paper, we propose a novel <italic>G</italic>raph <italic>S</italic>tream <italic>S</italic>ketch (GSS for short) to summarize the graph streams, which has linear space cost <inline-formula><tex-math notation=\"LaTeX\">Z_$O(|E|)$_Z</tex-math></inline-formula> (E is the edge set of the graph) and high update speed, and supports most kinds of queries over graph streams with controllable errors. Experimental results show that our solution is up to 142 times faster than the adjacency list when processing updates in graph streams, and its memory consumption is as small as <inline-formula><tex-math notation=\"LaTeX\">Z_$30\\%$_Z</tex-math></inline-formula> of the adjacency list. Though error is introduced as a trade off in our solution, both theoretical analysis and experiment results confirm that such error is small and controllable. The relative error is below <inline-formula><tex-math notation=\"LaTeX\">Z_$10^{-2}$_Z</tex-math></inline-formula> in edge weight query, and the precision is above <inline-formula><tex-math notation=\"LaTeX\">Z_$90\\%$_Z</tex-math></inline-formula> is 1-hop precursor/successor queries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A graph stream is a continuous sequence of data items, in which each item indicates an edge, including its two endpoints and edge weight. It forms a dynamic graph that changes with every item. Graph streams play important roles in cyber security, social networks, cloud troubleshooting systems and more. Due to the vast volume and high update speed of graph streams, traditional data structures for graph storage such as the adjacency matrix and the adjacency list are no longer sufficient. However, prior art of graph stream summarization either supports limited kinds of queries or suffers from poor accuracy of query results. In this paper, we propose a novel <italic>G</italic>raph <italic>S</italic>tream <italic>S</italic>ketch (GSS for short) to summarize the graph streams, which has linear space cost <inline-formula><tex-math notation=\"LaTeX\">$O(|E|)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mo>|</mml:mo><mml:mi>E</mml:mi><mml:mo>|</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"zou-ieq1-3174570.gif\"/></alternatives></inline-formula> (E is the edge set of the graph) and high update speed, and supports most kinds of queries over graph streams with controllable errors. Experimental results show that our solution is up to 142 times faster than the adjacency list when processing updates in graph streams, and its memory consumption is as small as <inline-formula><tex-math notation=\"LaTeX\">$30\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>30</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"zou-ieq3-3174570.gif\"/></alternatives></inline-formula> of the adjacency list. Though error is introduced as a trade off in our solution, both theoretical analysis and experiment results confirm that such error is small and controllable. The relative error is below <inline-formula><tex-math notation=\"LaTeX\">$10^{-2}$</tex-math><alternatives><mml:math><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math><inline-graphic xlink:href=\"zou-ieq4-3174570.gif\"/></alternatives></inline-formula> in edge weight query, and the precision is above <inline-formula><tex-math notation=\"LaTeX\">$90\\%$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>90</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"zou-ieq5-3174570.gif\"/></alternatives></inline-formula> is 1-hop precursor/successor queries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A graph stream is a continuous sequence of data items, in which each item indicates an edge, including its two endpoints and edge weight. It forms a dynamic graph that changes with every item. Graph streams play important roles in cyber security, social networks, cloud troubleshooting systems and more. Due to the vast volume and high update speed of graph streams, traditional data structures for graph storage such as the adjacency matrix and the adjacency list are no longer sufficient. However, prior art of graph stream summarization either supports limited kinds of queries or suffers from poor accuracy of query results. In this paper, we propose a novel Graph Stream Sketch (GSS for short) to summarize the graph streams, which has linear space cost - (E is the edge set of the graph) and high update speed, and supports most kinds of queries over graph streams with controllable errors. Experimental results show that our solution is up to 142 times faster than the adjacency list when processing updates in graph streams, and its memory consumption is as small as - of the adjacency list. Though error is introduced as a trade off in our solution, both theoretical analysis and experiment results confirm that such error is small and controllable. The relative error is below - in edge weight query, and the precision is above - is 1-hop precursor/successor queries.",
"title": "Graph Stream Sketch: Summarizing Graph Streams With High Speed and Accuracy",
"normalizedTitle": "Graph Stream Sketch: Summarizing Graph Streams With High Speed and Accuracy",
"fno": "09774007",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Structures",
"Social Networking Online",
"Heuristic Algorithms",
"Costs",
"Throughput",
"Sparse Matrices",
"Monitoring",
"Approximate Query",
"Data Stream",
"Sketch",
"Graph"
],
"authors": [
{
"givenName": "Xiangyang",
"surname": "Gou",
"fullName": "Xiangyang Gou",
"affiliation": "Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lei",
"surname": "Zou",
"fullName": "Lei Zou",
"affiliation": "Beijing Institute of Big Data Research and National Engineering Laboratory for Big Data Analysis Technology and Application (PKU), Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chenxingyu",
"surname": "Zhao",
"fullName": "Chenxingyu Zhao",
"affiliation": "Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tong",
"surname": "Yang",
"fullName": "Tong Yang",
"affiliation": "Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2023-06-01 00:00:00",
"pubType": "trans",
"pages": "5901-5914",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09759987",
"title": "Sparse and Flexible Projections for Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09759987/1CHsvtlNSSI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2023/04/09858684",
"title": "GRIP: A Graph Neural Network Accelerator Architecture",
"doi": null,
"abstractUrl": "/journal/tc/2023/04/09858684/1FUYCxUwwvu",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/03/09976297",
"title": "Exploring Memory Access Similarity to Improve Irregular Application Performance for Distributed Hybrid Memory Systems",
"doi": null,
"abstractUrl": "/journal/td/2023/03/09976297/1IWfP8p5MQ0",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__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/tp/2022/05/09241452",
"title": "Enhanced Group Sparse Regularized Nonconvex Regression for Face Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2022/05/09241452/1ogEy0c42R2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/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/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/06/09511805",
"title": "Distributed Graph Realizations",
"doi": null,
"abstractUrl": "/journal/td/2022/06/09511805/1vYRJ00nBTi",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/05/09516878",
"title": "Workload Balancing via Graph Reordering on Multicore Systems",
"doi": null,
"abstractUrl": "/journal/td/2022/05/09516878/1watZSFykhi",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09770382",
"articleId": "1D9FShdbrtS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09745316",
"articleId": "1Cagr25huGk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1MNbzmDbBMQ",
"name": "ttk202306-09774007s1-supp1-3174570.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk202306-09774007s1-supp1-3174570.pdf",
"extension": "pdf",
"size": "662 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1BzPxbqLS6I",
"title": "April",
"year": "2022",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1kpEsyACWGs",
"doi": "10.1109/TKDE.2020.3000226",
"abstract": "There are many successful spectral based unsupervised dimensionality reduction methods, including Laplacian Eigenmap (LE), Locality Preserving Projection (LPP), Spectral Regression (SR), etc. We find that LPP and SR are equivalent if the symmetric similarity matrix is doubly stochastic, Positive Semi-Definite (PSD) and with rank <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula> is the reduced dimension. Since solving SR is believed faster than solving LPP based on some related literature, the discovery promotes us to seek to construct such specific similarity matrix to speed up LPP solving procedures. We then propose an unsupervised linear method called Unsupervised Large Graph Embedding (ULGE). ULGE starts with a similar idea as LPP but adopts an efficient approach to construct anchor-based similarity matrix and then performs spectral analysis on it. Moreover, since conventional anchor generation strategies suffer kinds of problems, we propose an efficient and effective anchor generation strategy, called Balanced <inline-formula><tex-math notation=\"LaTeX\">Z_$K$_Z</tex-math></inline-formula>-means based Hierarchical <inline-formula><tex-math notation=\"LaTeX\">Z_$K$_Z</tex-math></inline-formula>-means (BHKH). The computational complexity of ULGE can reduce to <inline-formula><tex-math notation=\"LaTeX\">Z_$O(ndm)$_Z</tex-math></inline-formula>, which is a significant improvement compared to conventional methods need <inline-formula><tex-math notation=\"LaTeX\">Z_$O(n^2d)$_Z</tex-math></inline-formula> at least, where <inline-formula><tex-math notation=\"LaTeX\">Z_$n$_Z</tex-math></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">Z_$d$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$m$_Z</tex-math></inline-formula> are the number of samples, dimensions, and anchors, respectively. Extensive experiments on several publicly available datasets demonstrate the efficiency and effectiveness of the proposed method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "There are many successful spectral based unsupervised dimensionality reduction methods, including Laplacian Eigenmap (LE), Locality Preserving Projection (LPP), Spectral Regression (SR), etc. We find that LPP and SR are equivalent if the symmetric similarity matrix is doubly stochastic, Positive Semi-Definite (PSD) and with rank <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"zhu-ieq1-3000226.gif\"/></alternatives></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">$p$</tex-math><alternatives><mml:math><mml:mi>p</mml:mi></mml:math><inline-graphic xlink:href=\"zhu-ieq2-3000226.gif\"/></alternatives></inline-formula> is the reduced dimension. Since solving SR is believed faster than solving LPP based on some related literature, the discovery promotes us to seek to construct such specific similarity matrix to speed up LPP solving procedures. We then propose an unsupervised linear method called Unsupervised Large Graph Embedding (ULGE). ULGE starts with a similar idea as LPP but adopts an efficient approach to construct anchor-based similarity matrix and then performs spectral analysis on it. Moreover, since conventional anchor generation strategies suffer kinds of problems, we propose an efficient and effective anchor generation strategy, called Balanced <inline-formula><tex-math notation=\"LaTeX\">$K$</tex-math><alternatives><mml:math><mml:mi>K</mml:mi></mml:math><inline-graphic xlink:href=\"zhu-ieq3-3000226.gif\"/></alternatives></inline-formula>-means based Hierarchical <inline-formula><tex-math notation=\"LaTeX\">$K$</tex-math><alternatives><mml:math><mml:mi>K</mml:mi></mml:math><inline-graphic xlink:href=\"zhu-ieq4-3000226.gif\"/></alternatives></inline-formula>-means (BHKH). The computational complexity of ULGE can reduce to <inline-formula><tex-math notation=\"LaTeX\">$O(ndm)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"zhu-ieq5-3000226.gif\"/></alternatives></inline-formula>, which is a significant improvement compared to conventional methods need <inline-formula><tex-math notation=\"LaTeX\">$O(n^2d)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>O</mml:mi><mml:mo>(</mml:mo><mml:msup><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"zhu-ieq6-3000226.gif\"/></alternatives></inline-formula> at least, where <inline-formula><tex-math notation=\"LaTeX\">$n$</tex-math><alternatives><mml:math><mml:mi>n</mml:mi></mml:math><inline-graphic xlink:href=\"zhu-ieq7-3000226.gif\"/></alternatives></inline-formula>, <inline-formula><tex-math notation=\"LaTeX\">$d$</tex-math><alternatives><mml:math><mml:mi>d</mml:mi></mml:math><inline-graphic xlink:href=\"zhu-ieq8-3000226.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href=\"zhu-ieq9-3000226.gif\"/></alternatives></inline-formula> are the number of samples, dimensions, and anchors, respectively. Extensive experiments on several publicly available datasets demonstrate the efficiency and effectiveness of the proposed method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "There are many successful spectral based unsupervised dimensionality reduction methods, including Laplacian Eigenmap (LE), Locality Preserving Projection (LPP), Spectral Regression (SR), etc. We find that LPP and SR are equivalent if the symmetric similarity matrix is doubly stochastic, Positive Semi-Definite (PSD) and with rank -, where - is the reduced dimension. Since solving SR is believed faster than solving LPP based on some related literature, the discovery promotes us to seek to construct such specific similarity matrix to speed up LPP solving procedures. We then propose an unsupervised linear method called Unsupervised Large Graph Embedding (ULGE). ULGE starts with a similar idea as LPP but adopts an efficient approach to construct anchor-based similarity matrix and then performs spectral analysis on it. Moreover, since conventional anchor generation strategies suffer kinds of problems, we propose an efficient and effective anchor generation strategy, called Balanced --means based Hierarchical --means (BHKH). The computational complexity of ULGE can reduce to -, which is a significant improvement compared to conventional methods need - at least, where -, - and - are the number of samples, dimensions, and anchors, respectively. Extensive experiments on several publicly available datasets demonstrate the efficiency and effectiveness of the proposed method.",
"title": "Unsupervised Large Graph Embedding Based on Balanced and Hierarchical K-Means",
"normalizedTitle": "Unsupervised Large Graph Embedding Based on Balanced and Hierarchical K-Means",
"fno": "09109708",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Reduction",
"Eigenvalues And Eigenfunctions",
"Feature Extraction",
"Graph Theory",
"Matrix Algebra",
"Regression Analysis",
"Unsupervised Learning",
"Laplacian Eigenmap",
"Symmetric Similarity Matrix",
"Positive Semidefinite Matrix",
"Similarity Matrix",
"LPP Solving Procedures",
"Unsupervised Linear Method",
"Unsupervised Large Graph Embedding",
"ULGE",
"Anchor Based Similarity Matrix",
"Spectral Analysis",
"Anchor Generation Strategy",
"Balanced K Means Based Hierarchical K Means Strategy",
"Spectral Based Unsupervised Dimensionality Reduction Methods",
"PSD Matrix",
"Dimensionality Reduction",
"Symmetric Matrices",
"Eigenvalues And Eigenfunctions",
"Laplace Equations",
"Spectral Analysis",
"Matrix Decomposition",
"Large Graph Embedding",
"balanced <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>-means based hierarchical <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>-means",
"Anchor Based Graph",
"Dimensionality Reduction"
],
"authors": [
{
"givenName": "Feiping",
"surname": "Nie",
"fullName": "Feiping Nie",
"affiliation": "School of Computer Science and Center for Optical Imagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Zhu",
"fullName": "Wei Zhu",
"affiliation": "School of Computer Science and Center for Optical Imagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuelong",
"surname": "Li",
"fullName": "Xuelong Li",
"affiliation": "School of Computer Science and Center for Optical Imagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, P. R. China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2022-04-01 00:00:00",
"pubType": "trans",
"pages": "2008-2019",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/cs/2019/01/08661802",
"title": "Random Sampling Using k-Vector",
"doi": null,
"abstractUrl": "/magazine/cs/2019/01/08661802/18bmP7hVoD6",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09681162",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681162/1A8c6sY0Afe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09712412",
"title": "Centerless Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09712412/1AZKZVM8b84",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/10/09690512",
"title": "Communication-Efficient <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-Means for Edge-Based Machine Learning",
"doi": null,
"abstractUrl": "/journal/td/2022/10/09690512/1Aqs1yORIZi",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2020/05/08911258",
"title": "Large-Scale Automatic K-Means Clustering for Heterogeneous Many-Core Supercomputer",
"doi": null,
"abstractUrl": "/journal/td/2020/05/08911258/1gXC2EiyM6Y",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/01/09127807",
"title": "Average Top-k Aggregate Loss for Supervised Learning",
"doi": null,
"abstractUrl": "/journal/tp/2022/01/09127807/1l3uajhdTP2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/10/09314042",
"title": "Adaptive Local Embedding Learning for Semi-Supervised Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2022/10/09314042/1q8U4AEHVTy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/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/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/tk/2023/04/09643014",
"title": "k-Pleased Querying",
"doi": null,
"abstractUrl": "/journal/tk/2023/04/09643014/1zarWNa1c5y",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09119847",
"articleId": "1kJzgPs0NTa",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1z98erbYoUw",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1lgLpXeYP7y",
"doi": "10.1109/TPAMI.2020.3007673",
"abstract": "Data clustering, which is to partition the given data into different groups, has attracted much attention. Recently various effective algorithms have been developed to tackle the task. Among these methods, non-negative matrix factorization (NMF) has been demonstrated to be a powerful tool. However, there are still some problems. First, the standard NMF is sensitive to noises and outliers. Although <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,1}$_Z</tex-math></inline-formula> norm based NMF improves the robustness, it is still affected easily by large noises. Second, for most graph regularized NMF, the performance highly depends on the initial similarity graph. Third, many graph-based NMF models perform the graph construction and matrix factorization in two separated steps. Thus the learned graph structure may not be optimal. To overcome the above drawbacks, we propose a robust bi-stochastic graph regularized matrix factorization (RBSMF) framework for data clustering. Specifically, we present a general loss function, which is more robust than the commonly used <inline-formula><tex-math notation=\"LaTeX\">Z_$L_2$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$L_1$_Z</tex-math></inline-formula> functions. Besides, instead of keeping the graph fixed, we learn an adaptive similarity graph. Furthermore, the graph updating and matrix factorization are processed simultaneously, which can make the learned graph more appropriate for clustering. Extensive experiments have shown the proposed RBSMF outperforms other state-of-the-art methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data clustering, which is to partition the given data into different groups, has attracted much attention. Recently various effective algorithms have been developed to tackle the task. Among these methods, non-negative matrix factorization (NMF) has been demonstrated to be a powerful tool. However, there are still some problems. First, the standard NMF is sensitive to noises and outliers. Although <inline-formula><tex-math notation=\"LaTeX\">$\\ell _{2,1}$</tex-math><alternatives><mml:math><mml:msub><mml:mi>ℓ</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math><inline-graphic xlink:href=\"wang-ieq1-3007673.gif\"/></alternatives></inline-formula> norm based NMF improves the robustness, it is still affected easily by large noises. Second, for most graph regularized NMF, the performance highly depends on the initial similarity graph. Third, many graph-based NMF models perform the graph construction and matrix factorization in two separated steps. Thus the learned graph structure may not be optimal. To overcome the above drawbacks, we propose a robust bi-stochastic graph regularized matrix factorization (RBSMF) framework for data clustering. Specifically, we present a general loss function, which is more robust than the commonly used <inline-formula><tex-math notation=\"LaTeX\">$L_2$</tex-math><alternatives><mml:math><mml:msub><mml:mi>L</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math><inline-graphic xlink:href=\"wang-ieq2-3007673.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$L_1$</tex-math><alternatives><mml:math><mml:msub><mml:mi>L</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math><inline-graphic xlink:href=\"wang-ieq3-3007673.gif\"/></alternatives></inline-formula> functions. Besides, instead of keeping the graph fixed, we learn an adaptive similarity graph. Furthermore, the graph updating and matrix factorization are processed simultaneously, which can make the learned graph more appropriate for clustering. Extensive experiments have shown the proposed RBSMF outperforms other state-of-the-art methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data clustering, which is to partition the given data into different groups, has attracted much attention. Recently various effective algorithms have been developed to tackle the task. Among these methods, non-negative matrix factorization (NMF) has been demonstrated to be a powerful tool. However, there are still some problems. First, the standard NMF is sensitive to noises and outliers. Although - norm based NMF improves the robustness, it is still affected easily by large noises. Second, for most graph regularized NMF, the performance highly depends on the initial similarity graph. Third, many graph-based NMF models perform the graph construction and matrix factorization in two separated steps. Thus the learned graph structure may not be optimal. To overcome the above drawbacks, we propose a robust bi-stochastic graph regularized matrix factorization (RBSMF) framework for data clustering. Specifically, we present a general loss function, which is more robust than the commonly used - and - functions. Besides, instead of keeping the graph fixed, we learn an adaptive similarity graph. Furthermore, the graph updating and matrix factorization are processed simultaneously, which can make the learned graph more appropriate for clustering. Extensive experiments have shown the proposed RBSMF outperforms other state-of-the-art methods.",
"title": "Robust Bi-Stochastic Graph Regularized Matrix Factorization for Data Clustering",
"normalizedTitle": "Robust Bi-Stochastic Graph Regularized Matrix Factorization for Data Clustering",
"fno": "09134812",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Graph Theory",
"Matrix Decomposition",
"Pattern Clustering",
"Stochastic Processes",
"Robust Bi Stochastic Graph Regularized Matrix Factorization",
"Data Clustering",
"Nonnegative Matrix Factorization",
"Graph Construction",
"Graph Structure Learning",
"Adaptive Similarity Graph Learning",
"X 2113 2 1 Norm Based NMF",
"RBSMF",
"General Loss Function",
"Graph Updating",
"Robustness",
"Sparse Matrices",
"Matrix Decomposition",
"Loss Measurement",
"Task Analysis",
"Manifolds",
"Tools",
"Matrix Factorization",
"Bi Stochastic Graph",
"Data Clustering",
"Robustness"
],
"authors": [
{
"givenName": "Qi",
"surname": "Wang",
"fullName": "Qi Wang",
"affiliation": "School of Computer Science and the Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiang",
"surname": "He",
"fullName": "Xiang He",
"affiliation": "School of Computer Science and the Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xu",
"surname": "Jiang",
"fullName": "Xu Jiang",
"affiliation": "School of Computer Science and the Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuelong",
"surname": "Li",
"fullName": "Xuelong Li",
"affiliation": "School of Computer Science and the Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "390-403",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09729476",
"title": "Solving Consensus in True Partial Synchrony",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09729476/1Byafq1ui4w",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09759987",
"title": "Sparse and Flexible Projections for Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09759987/1CHsvtlNSSI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09925098",
"title": "The Proxy Step-Size Technique for Regularized Optimization on the Sphere Manifold",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09925098/1HBHVijhpLi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09003252",
"title": "Dual Hyper-Graph Regularized Supervised NMF for Selecting Differentially Expressed Genes and Tumor Classification",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09003252/1hy7T9TTKTu",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/04/09220804",
"title": "An Efficient Solution to Non-Minimal Case Essential Matrix Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2022/04/09220804/1nRLmLHvZpC",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/05/09241452",
"title": "Enhanced Group Sparse Regularized Nonconvex Regression for Face Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2022/05/09241452/1ogEy0c42R2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/10/09314042",
"title": "Adaptive Local Embedding Learning for Semi-Supervised Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2022/10/09314042/1q8U4AEHVTy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09369083",
"title": "Robust Low-Tubal-Rank Tensor Recovery From Binary Measurements",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09369083/1rFvS23KDAI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/12/09585422",
"title": "Iteratively Reweighted Minimax-Concave Penalty Minimization for Accurate Low-rank Plus Sparse Matrix Decomposition",
"doi": null,
"abstractUrl": "/journal/tp/2022/12/09585422/1y10RVTxKjC",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09145704",
"articleId": "1lE08xFSVCE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09123671",
"articleId": "1kTwIv2npW8",
"__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": "1sP16sJ7CCs",
"doi": "10.1109/TPAMI.2021.3073588",
"abstract": "Representations in the form of Symmetric Positive Definite (SPD) matrices have been popularized in a variety of visual learning applications due to their demonstrated ability to capture rich second-order statistics of visual data. There exist several similarity measures for comparing SPD matrices with documented benefits. However, selecting an appropriate measure for a given problem remains a challenge and in most cases, is the result of a trial-and-error process. In this paper, we propose to learn similarity measures in a data-driven manner. To this end, we capitalize on the <inline-formula><tex-math notation=\"LaTeX\">Z_$\\alpha \\beta$_Z</tex-math></inline-formula>-log-det divergence, which is a meta-divergence parametrized by scalars <inline-formula><tex-math notation=\"LaTeX\">Z_$\\alpha$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_$\\beta$_Z</tex-math></inline-formula>, subsuming a wide family of popular information divergences on SPD matrices for distinct and discrete values of these parameters. Our key idea is to cast these parameters in a continuum and learn them from data. We systematically extend this idea to learn vector-valued parameters, thereby increasing the expressiveness of the underlying non-linear measure. We conjoin the divergence learning problem with several standard tasks in machine learning, including supervised discriminative dictionary learning and unsupervised SPD matrix clustering. We present Riemannian gradient descent schemes for optimizing our formulations efficiently, and show the usefulness of our method on eight standard computer vision tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Representations in the form of Symmetric Positive Definite (SPD) matrices have been popularized in a variety of visual learning applications due to their demonstrated ability to capture rich second-order statistics of visual data. There exist several similarity measures for comparing SPD matrices with documented benefits. However, selecting an appropriate measure for a given problem remains a challenge and in most cases, is the result of a trial-and-error process. In this paper, we propose to learn similarity measures in a data-driven manner. To this end, we capitalize on the <inline-formula><tex-math notation=\"LaTeX\">$\\alpha \\beta$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>α</mml:mi><mml:mi>β</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"papanikolopoulos-ieq1-3073588.gif\"/></alternatives></inline-formula>-log-det divergence, which is a meta-divergence parametrized by scalars <inline-formula><tex-math notation=\"LaTeX\">$\\alpha$</tex-math><alternatives><mml:math><mml:mi>α</mml:mi></mml:math><inline-graphic xlink:href=\"papanikolopoulos-ieq2-3073588.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">$\\beta$</tex-math><alternatives><mml:math><mml:mi>β</mml:mi></mml:math><inline-graphic xlink:href=\"papanikolopoulos-ieq3-3073588.gif\"/></alternatives></inline-formula>, subsuming a wide family of popular information divergences on SPD matrices for distinct and discrete values of these parameters. Our key idea is to cast these parameters in a continuum and learn them from data. We systematically extend this idea to learn vector-valued parameters, thereby increasing the expressiveness of the underlying non-linear measure. We conjoin the divergence learning problem with several standard tasks in machine learning, including supervised discriminative dictionary learning and unsupervised SPD matrix clustering. We present Riemannian gradient descent schemes for optimizing our formulations efficiently, and show the usefulness of our method on eight standard computer vision tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Representations in the form of Symmetric Positive Definite (SPD) matrices have been popularized in a variety of visual learning applications due to their demonstrated ability to capture rich second-order statistics of visual data. There exist several similarity measures for comparing SPD matrices with documented benefits. However, selecting an appropriate measure for a given problem remains a challenge and in most cases, is the result of a trial-and-error process. In this paper, we propose to learn similarity measures in a data-driven manner. To this end, we capitalize on the --log-det divergence, which is a meta-divergence parametrized by scalars - and -, subsuming a wide family of popular information divergences on SPD matrices for distinct and discrete values of these parameters. Our key idea is to cast these parameters in a continuum and learn them from data. We systematically extend this idea to learn vector-valued parameters, thereby increasing the expressiveness of the underlying non-linear measure. We conjoin the divergence learning problem with several standard tasks in machine learning, including supervised discriminative dictionary learning and unsupervised SPD matrix clustering. We present Riemannian gradient descent schemes for optimizing our formulations efficiently, and show the usefulness of our method on eight standard computer vision tasks.",
"title": "Learning Log-Determinant Divergences for Positive Definite Matrices",
"normalizedTitle": "Learning Log-Determinant Divergences for Positive Definite Matrices",
"fno": "09405430",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computer Vision",
"Gradient Methods",
"Learning Artificial Intelligence",
"Matrix Algebra",
"Pattern Clustering",
"Vectors",
"Log Determinant Divergences",
"Symmetric Positive Definite Matrices",
"Visual Learning Applications",
"Demonstrated Ability",
"Second Order Statistics",
"Visual Data",
"Similarity Measures",
"Comparing SPD Matrices",
"Documented Benefits",
"Appropriate Measure",
"Error Process",
"Data Driven Manner",
"X 03 B 2 Log Det Divergence",
"Meta Divergence",
"Popular Information Divergences",
"Distinct Values",
"Discrete Values",
"Vector Valued Parameters",
"Underlying Nonlinear Measure",
"Divergence Learning Problem",
"Machine Learning",
"Supervised Discriminative Dictionary Learning",
"Unsupervised SPD Matrix Clustering",
"Measurement",
"Symmetric Matrices",
"Sparse Matrices",
"Covariance Matrices",
"Standards",
"Kernel",
"Geometry",
"Region Covariance Matrices",
"Positive Definite Matrices",
"Log Det Divergence",
"Action Recognition",
"Texture Recognition"
],
"authors": [
{
"givenName": "Anoop",
"surname": "Cherian",
"fullName": "Anoop Cherian",
"affiliation": "Mitsubishi Electric Research Labs (MERL), Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Panagiotis",
"surname": "Stanitsas",
"fullName": "Panagiotis Stanitsas",
"affiliation": "University of Minnesota, Minneapolis, MN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jue",
"surname": "Wang",
"fullName": "Jue Wang",
"affiliation": "Research School of Engineering, The Australian National University, Canberra, ACT, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mehrtash",
"surname": "Harandi",
"fullName": "Mehrtash Harandi",
"affiliation": "Department of Electrical and Computer Systems Engineering, Monash University, Clayton, VIC, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vassilios",
"surname": "Morellas",
"fullName": "Vassilios Morellas",
"affiliation": "University of Minnesota, Minneapolis, MN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nikolaos",
"surname": "Papanikolopoulos",
"fullName": "Nikolaos Papanikolopoulos",
"affiliation": "University of Minnesota, Minneapolis, MN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "5088-5102",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isspit/2017/4662/0/08388651",
"title": "Sparse representation based classification with intra-class variation dictionary on symmetric positive definite manifolds",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2017/08388651/12OmNqJHFte",
"parentPublication": {
"id": "proceedings/isspit/2017/4662/0",
"title": "2017 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2016/0641/0/07477621",
"title": "Image set classification by symmetric positive semi-definite matrices",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2016/07477621/12OmNx5Yv4o",
"parentPublication": {
"id": "proceedings/wacv/2016/0641/0",
"title": "2016 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034b304",
"title": "Clustering Positive Definite Matrices by Learning Information Divergences",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034b304/12OmNyv7m4v",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/08237720",
"title": "Learning Discriminative αβ-Divergences for Positive Definite Matrices",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/08237720/12OmNzmLxEW",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/03/ttp2014030592",
"title": "Tensor Sparse Coding for Positive Definite Matrices",
"doi": null,
"abstractUrl": "/journal/tp/2014/03/ttp2014030592/13rRUEgarCx",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09712412",
"title": "Centerless Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09712412/1AZKZVM8b84",
"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/tp/2022/10/09485048",
"title": "Efficient Adaptive Online Learning via Frequent Directions",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09485048/1veojcOSicw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09672718",
"title": "Efficient Variational Bayes Learning of Graphical Models With Smooth Structural Changes",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09672718/1zWzGNERf0c",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09427066",
"articleId": "1tuvzMfndhS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09431673",
"articleId": "1tB9d8z7RyU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Fz3mZ7M7HG",
"name": "ttp202209-09405430s1-supp1-3073588.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202209-09405430s1-supp1-3073588.pdf",
"extension": "pdf",
"size": "177 kB",
"__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": "1uFxm1okYhO",
"doi": "10.1109/TPAMI.2021.3091682",
"abstract": "Given a convex and differentiable objective <inline-formula><tex-math notation=\"LaTeX\">Z_$Q({\\mathbf M})$_Z</tex-math></inline-formula> for a real symmetric matrix <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf M}$_Z</tex-math></inline-formula> in the positive definite (PD) cone—used to compute Mahalanobis distances—we propose a fast general metric learning framework that is entirely projection-free. We first assume that <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf M}$_Z</tex-math></inline-formula> resides in a space <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathcal S}$_Z</tex-math></inline-formula> of generalized graph Laplacian matrices corresponding to balanced signed graphs. <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf M}\\in {\\mathcal S}$_Z</tex-math></inline-formula> that is also PD is called a graph metric matrix. Unlike low-rank metric matrices common in the literature, <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathcal S}$_Z</tex-math></inline-formula> includes the important diagonal-only matrices as a special case. The key theorem to circumvent full eigen-decomposition and enable fast metric matrix optimization is Gershgorin disc perfect alignment (GDPA): given <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf M}\\in {\\mathcal S}$_Z</tex-math></inline-formula> and diagonal matrix <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf S}$_Z</tex-math></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">Z_$S_{ii} = 1/v_i$_Z</tex-math></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf v}$_Z</tex-math></inline-formula> is the first eigenvector of <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf M}$_Z</tex-math></inline-formula>, we prove that Gershgorin disc left-ends of similarity transform <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf B}= {\\mathbf S}{\\mathbf M}{\\mathbf S}^{-1}$_Z</tex-math></inline-formula> are perfectly aligned at the smallest eigenvalue <inline-formula><tex-math notation=\"LaTeX\">Z_$\\lambda _{\\min }$_Z</tex-math></inline-formula>. Using this theorem, we replace the PD cone constraint in the metric learning problem with tightest possible linear constraints per iteration, so that the alternating optimization of the diagonal / off-diagonal terms in <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf M}$_Z</tex-math></inline-formula> can be solved efficiently as linear programs via the Frank-Wolfe method. We update <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf v}$_Z</tex-math></inline-formula> using Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) with warm start as entries in <inline-formula><tex-math notation=\"LaTeX\">Z_${\\mathbf M}$_Z</tex-math></inline-formula> are optimized successively. Experiments show that our graph metric optimization is significantly faster than cone-projection schemes, and produces competitive binary classification performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a convex and differentiable objective <inline-formula><tex-math notation=\"LaTeX\">$Q({\\mathbf M})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>Q</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant=\"bold\">M</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq1-3091682.gif\"/></alternatives></inline-formula> for a real symmetric matrix <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf M}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">M</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq2-3091682.gif\"/></alternatives></inline-formula> in the positive definite (PD) cone—used to compute Mahalanobis distances—we propose a fast general metric learning framework that is entirely projection-free. We first assume that <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf M}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">M</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq3-3091682.gif\"/></alternatives></inline-formula> resides in a space <inline-formula><tex-math notation=\"LaTeX\">${\\mathcal S}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">S</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq4-3091682.gif\"/></alternatives></inline-formula> of generalized graph Laplacian matrices corresponding to balanced signed graphs. <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf M}\\in {\\mathcal S}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"bold\">M</mml:mi><mml:mo>∈</mml:mo><mml:mi mathvariant=\"script\">S</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq5-3091682.gif\"/></alternatives></inline-formula> that is also PD is called a graph metric matrix. Unlike low-rank metric matrices common in the literature, <inline-formula><tex-math notation=\"LaTeX\">${\\mathcal S}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"script\">S</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq6-3091682.gif\"/></alternatives></inline-formula> includes the important diagonal-only matrices as a special case. The key theorem to circumvent full eigen-decomposition and enable fast metric matrix optimization is Gershgorin disc perfect alignment (GDPA): given <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf M}\\in {\\mathcal S}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"bold\">M</mml:mi><mml:mo>∈</mml:mo><mml:mi mathvariant=\"script\">S</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq7-3091682.gif\"/></alternatives></inline-formula> and diagonal matrix <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf S}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">S</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq8-3091682.gif\"/></alternatives></inline-formula>, where <inline-formula><tex-math notation=\"LaTeX\">$S_{ii} = 1/v_i$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq9-3091682.gif\"/></alternatives></inline-formula> and <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf v}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">v</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq10-3091682.gif\"/></alternatives></inline-formula> is the first eigenvector of <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf M}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">M</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq11-3091682.gif\"/></alternatives></inline-formula>, we prove that Gershgorin disc left-ends of similarity transform <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf B}= {\\mathbf S}{\\mathbf M}{\\mathbf S}^{-1}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant=\"bold\">B</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant=\"bold\">S</mml:mi><mml:mi mathvariant=\"bold\">M</mml:mi><mml:msup><mml:mrow><mml:mi mathvariant=\"bold\">S</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math><inline-graphic xlink:href=\"yang-ieq12-3091682.gif\"/></alternatives></inline-formula> are perfectly aligned at the smallest eigenvalue <inline-formula><tex-math notation=\"LaTeX\">$\\lambda _{\\min }$</tex-math><alternatives><mml:math><mml:msub><mml:mi>λ</mml:mi><mml:mo movablelimits=\"true\" form=\"prefix\">min</mml:mo></mml:msub></mml:math><inline-graphic xlink:href=\"yang-ieq13-3091682.gif\"/></alternatives></inline-formula>. Using this theorem, we replace the PD cone constraint in the metric learning problem with tightest possible linear constraints per iteration, so that the alternating optimization of the diagonal / off-diagonal terms in <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf M}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">M</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq14-3091682.gif\"/></alternatives></inline-formula> can be solved efficiently as linear programs via the Frank-Wolfe method. We update <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf v}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">v</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq15-3091682.gif\"/></alternatives></inline-formula> using Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) with warm start as entries in <inline-formula><tex-math notation=\"LaTeX\">${\\mathbf M}$</tex-math><alternatives><mml:math><mml:mi mathvariant=\"bold\">M</mml:mi></mml:math><inline-graphic xlink:href=\"yang-ieq16-3091682.gif\"/></alternatives></inline-formula> are optimized successively. Experiments show that our graph metric optimization is significantly faster than cone-projection schemes, and produces competitive binary classification performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a convex and differentiable objective - for a real symmetric matrix - in the positive definite (PD) cone—used to compute Mahalanobis distances—we propose a fast general metric learning framework that is entirely projection-free. We first assume that - resides in a space - of generalized graph Laplacian matrices corresponding to balanced signed graphs. - that is also PD is called a graph metric matrix. Unlike low-rank metric matrices common in the literature, - includes the important diagonal-only matrices as a special case. The key theorem to circumvent full eigen-decomposition and enable fast metric matrix optimization is Gershgorin disc perfect alignment (GDPA): given - and diagonal matrix -, where - and - is the first eigenvector of -, we prove that Gershgorin disc left-ends of similarity transform - are perfectly aligned at the smallest eigenvalue -. Using this theorem, we replace the PD cone constraint in the metric learning problem with tightest possible linear constraints per iteration, so that the alternating optimization of the diagonal / off-diagonal terms in - can be solved efficiently as linear programs via the Frank-Wolfe method. We update - using Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) with warm start as entries in - are optimized successively. Experiments show that our graph metric optimization is significantly faster than cone-projection schemes, and produces competitive binary classification performance.",
"title": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"normalizedTitle": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"fno": "09463735",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Conjugate Gradient Methods",
"Eigenvalues And Eigenfunctions",
"Gradient Methods",
"Graph Theory",
"Iterative Methods",
"Learning Artificial Intelligence",
"Linear Programming",
"Matrix Algebra",
"Warm Start",
"Frank Wolfe Method",
"Metric Matrix Optimization",
"Cone Projection Schemes",
"Graph Metric Optimization",
"Locally Optimal Block Preconditioned Conjugate Gradient",
"Linear Constraints",
"Metric Learning Problem",
"PD Cone Constraint",
"Diagonal Matrix",
"Diagonal Only Matrices",
"Low Rank Metric Matrices",
"Graph Metric Matrix",
"Balanced Signed Graphs",
"Generalized Graph Laplacian Matrices",
"Entirely Projection Free",
"Fast General Metric Learning Framework",
"Mahalanobis Distances",
"Positive Definite Cone",
"Symmetric Matrix",
"Differentiable Objective",
"Gershgorin Disc Perfect Alignment",
"Graph Metric Learning",
"Measurement",
"Optimization",
"Extraterrestrial Measurements",
"Laplace Equations",
"Handheld Computers",
"Symmetric Matrices",
"Sparse Matrices",
"Graph Signal Processing",
"Metric Learning",
"Gershgorin Circle Theorem",
"Convex Optimization"
],
"authors": [
{
"givenName": "Cheng",
"surname": "Yang",
"fullName": "Cheng Yang",
"affiliation": "Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gene",
"surname": "Cheung",
"fullName": "Gene Cheung",
"affiliation": "York University, Toronto, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Hu",
"fullName": "Wei Hu",
"affiliation": "Peking University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2022-10-01 00:00:00",
"pubType": "trans",
"pages": "7219-7234",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2019/04/08494787",
"title": "Better Circuits for Binary Polynomial Multiplication",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08494787/14s8M4Sn2IE",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09681162",
"title": "Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09681162/1A8c6sY0Afe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09712412",
"title": "Centerless Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09712412/1AZKZVM8b84",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09926163",
"title": "Gaussian RBF Centered Kernel Alignment (CKA) in the Large-Bandwidth Limit",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09926163/1HGJ4xvDO4E",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/04/09109708",
"title": "Unsupervised Large Graph Embedding Based on Balanced and Hierarchical K-Means",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09109708/1kpEsyACWGs",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/10/09314042",
"title": "Adaptive Local Embedding Learning for Semi-Supervised Dimensionality Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2022/10/09314042/1q8U4AEHVTy",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/04/09354552",
"title": "An Asymmetric Alignment Algorithm for Estimating Ancestor-Descendant Edit Distance for Tandem Repeats",
"doi": null,
"abstractUrl": "/journal/tb/2022/04/09354552/1reXbdTv8QM",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09405430",
"title": "Learning Log-Determinant Divergences for Positive Definite Matrices",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09405430/1sP16sJ7CCs",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09485048",
"title": "Efficient Adaptive Online Learning via Frequent Directions",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09485048/1veojcOSicw",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "09447923",
"articleId": "1ueYUxludiM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09449976",
"articleId": "1uiiNgsKInK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1GGLf2A0Tok",
"name": "ttp202210-09463735s1-supp1-3091682.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202210-09463735s1-supp1-3091682.pdf",
"extension": "pdf",
"size": "115 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzsJ7l4",
"title": "May",
"year": "2013",
"issueNum": "05",
"idPrefix": "si",
"pubType": "journal",
"volume": "21",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfI0ND",
"doi": "10.1109/TVLSI.2012.2201759",
"abstract": "As VLSI technology pushes into advanced nodes, designers and foundries have exposed a hitherto insignificant set of yield problems. To combat yield failures, the semiconductor industry has deployed new tools and methodologies commonly referred to as design for manufacturing (DFM). Most of the early DFM efforts concentrated on catastrophic failures, or physical DFM problems. Recently, there has been an increased emphasis on parametric yield issues, referred to as electrical-DFM (e-DFM). In this paper, we present a complete e-DFM solution that detects, analyzes, and fixes electrical hotspots (e-hotspots) within an analog circuit design that are caused by different process variations. Novel algorithms are proposed to implement the engines used to develop this solution. The solution is examined on a 130-nm parametrically-failing level shifter circuit, and verified with silicon wafer measurements that confirm the existence of parametric yield issues in the design. Additional experiments are applied on a 65-nm industrial operational amplifier and voltage control oscillator (VCO). E-hotspot devices with a 27.7% variation in dc current are identified. After fixing the e-hotspots, the dc current variation in these devices is dramatically reduced to 7%, which meets the designer acceptance criteria, while saving the original VCO specifications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As VLSI technology pushes into advanced nodes, designers and foundries have exposed a hitherto insignificant set of yield problems. To combat yield failures, the semiconductor industry has deployed new tools and methodologies commonly referred to as design for manufacturing (DFM). Most of the early DFM efforts concentrated on catastrophic failures, or physical DFM problems. Recently, there has been an increased emphasis on parametric yield issues, referred to as electrical-DFM (e-DFM). In this paper, we present a complete e-DFM solution that detects, analyzes, and fixes electrical hotspots (e-hotspots) within an analog circuit design that are caused by different process variations. Novel algorithms are proposed to implement the engines used to develop this solution. The solution is examined on a 130-nm parametrically-failing level shifter circuit, and verified with silicon wafer measurements that confirm the existence of parametric yield issues in the design. Additional experiments are applied on a 65-nm industrial operational amplifier and voltage control oscillator (VCO). E-hotspot devices with a 27.7% variation in dc current are identified. After fixing the e-hotspots, the dc current variation in these devices is dramatically reduced to 7%, which meets the designer acceptance criteria, while saving the original VCO specifications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As VLSI technology pushes into advanced nodes, designers and foundries have exposed a hitherto insignificant set of yield problems. To combat yield failures, the semiconductor industry has deployed new tools and methodologies commonly referred to as design for manufacturing (DFM). Most of the early DFM efforts concentrated on catastrophic failures, or physical DFM problems. Recently, there has been an increased emphasis on parametric yield issues, referred to as electrical-DFM (e-DFM). In this paper, we present a complete e-DFM solution that detects, analyzes, and fixes electrical hotspots (e-hotspots) within an analog circuit design that are caused by different process variations. Novel algorithms are proposed to implement the engines used to develop this solution. The solution is examined on a 130-nm parametrically-failing level shifter circuit, and verified with silicon wafer measurements that confirm the existence of parametric yield issues in the design. Additional experiments are applied on a 65-nm industrial operational amplifier and voltage control oscillator (VCO). E-hotspot devices with a 27.7% variation in dc current are identified. After fixing the e-hotspots, the dc current variation in these devices is dramatically reduced to 7%, which meets the designer acceptance criteria, while saving the original VCO specifications.",
"title": "Parametric DFM Solution for Analog Circuits: Electrical-Driven Hotspot Detection, Analysis, and Correction Flow",
"normalizedTitle": "Parametric DFM Solution for Analog Circuits: Electrical-Driven Hotspot Detection, Analysis, and Correction Flow",
"fno": "06275517",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Amplifiers",
"Analogue Circuits",
"Design For Manufacture",
"Failure Analysis",
"Fault Diagnosis",
"Integrated Circuit Yield",
"Nanotechnology",
"Network Synthesis",
"Semiconductor Industry",
"VLSI",
"Voltage Control",
"Parametric DFM Solution",
"Electrical Driven Hotspot Detection",
"Hotspot Analysis",
"Hotspot Correction",
"VLSI Technology",
"Yield Failure",
"Semiconductor Industry",
"Design For Manufacturing",
"Catastrophic Failure",
"Physical DFM Problem",
"Parametric Yield Issues",
"Electrical DFM",
"E DFM Solution",
"Electrical Hotspots",
"E Hotspots",
"Analog Circuit Design",
"Process Variation",
"Parametrically Failing Level Shifter Circuit",
"Silicon Wafer Measurement",
"Industrial Operational Amplifier",
"Voltage Control Oscillator",
"Dc Current Variation",
"Designer Acceptance Criteria",
"VCO Specification",
"Layout",
"Transistors",
"Engines",
"Stress",
"SPICE",
"Lithography",
"Databases",
"Design For Manufacturability DFM",
"Electrical Design For Manufacturability E DFM",
"Parametric Yield",
"Process Variations"
],
"authors": [
{
"givenName": "Haitham",
"surname": "Eissa",
"fullName": "Haitham Eissa",
"affiliation": "Mentor Graphics Corporation, Cairo, Egypt",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rami Fathy",
"surname": "Salem",
"fullName": "Rami Fathy Salem",
"affiliation": "Mentor Graphics Corporation, Cairo, Egypt",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ahmed",
"surname": "Arafa",
"fullName": "Ahmed Arafa",
"affiliation": "Mentor Graphics Corporation, Cairo, Egypt",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sherif",
"surname": "Hany",
"fullName": "Sherif Hany",
"affiliation": "Mentor Graphics Corporation, Cairo, Egypt",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Abdelrahman",
"surname": "El-Mously",
"fullName": "Abdelrahman El-Mously",
"affiliation": "Mentor Graphics Corporation, Cairo, Egypt",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mohamed",
"surname": "Dessouky",
"fullName": "Mohamed Dessouky",
"affiliation": "Mentor Graphics Corporation, Cairo, Egypt",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Nairn",
"fullName": "David Nairn",
"affiliation": "University of Waterloo, Waterloo, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mohab",
"surname": "Anis",
"fullName": "Mohab Anis",
"affiliation": "American University in Cairo, Cairo, Egypt",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2013-05-01 00:00:00",
"pubType": "trans",
"pages": "807-820",
"year": "2013",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vlsid/2017/5740/0/5740z038",
"title": "Tutorial T5: The World beyond DRC: Design for Manufacturing (DFM) - Impact on Yield & Reliability for Advanced Technology Nodes and Their Elucidations",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2017/5740z038/12OmNBOCWv0",
"parentPublication": {
"id": "proceedings/vlsid/2017/5740/0",
"title": "2017 30th International Conference on VLSI Design and 2017 16th International Conference on Embedded Systems (VLSID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccad/2006/3891/0/04110242",
"title": "Efficient Process-Hotspot Detection Using Range Pattern Matching",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/2006/04110242/12OmNCm7BBs",
"parentPublication": {
"id": "proceedings/iccad/2006/3891/0",
"title": "Computer-Aided Design, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/idt/2011/0469/0/06123104",
"title": "An electrical-aware parametric DFM solution for analog circuits",
"doi": null,
"abstractUrl": "/proceedings-article/idt/2011/06123104/12OmNyL0Tun",
"parentPublication": {
"id": "proceedings/idt/2011/0469/0",
"title": "2011 IEEE 6th International Design and Test Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/2014/6492/0/06974697",
"title": "DFM is dead - Long live DFM",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/2014/06974697/12OmNz4SOCs",
"parentPublication": {
"id": "proceedings/iccd/2014/6492/0",
"title": "2014 32nd IEEE International Conference on Computer Design (ICCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/idt/2010/292/0/05724398",
"title": "A DFM tool for analyzing lithography and stress effects on standard cells and critical path performance in 45nm digital designs",
"doi": null,
"abstractUrl": "/proceedings-article/idt/2010/05724398/12OmNzTppBU",
"parentPublication": {
"id": "proceedings/idt/2010/292/0",
"title": "2010 5th International Design and Test Workshop (IDT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2016/03/07115168",
"title": "Design-Time Reliability Enhancement Using Hotspot Identification for RF Circuits",
"doi": null,
"abstractUrl": "/journal/si/2016/03/07115168/13rRUwInvvM",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/test/2006/0291/0/04079446",
"title": "Role of Test in Yield Learning for 65nm and Beyond",
"doi": null,
"abstractUrl": "/proceedings-article/test/2006/04079446/1L1MqUeVb9e",
"parentPublication": {
"id": "proceedings/test/2006/0291/0",
"title": "2006 IEEE International Test Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06213144",
"articleId": "13rRUNvya76",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06243222",
"articleId": "13rRUxYrbJx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1CxvgvLBWI8",
"title": "March-April",
"year": "2022",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "42",
"label": "March-April",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1BocMIGbMD6",
"doi": "10.1109/MCG.2022.3155306",
"abstract": "Electrical engines are a key technology all automotive manufacturers must master to stay competitive. Engineers need to analyze an overwhelming number of engine measurements to improve the manufacturing for this technology. They are hindered in the task of analyzing large numbers of engines, however, by the following challenges: 1) Engines comprise a complex hierarchical structure of subcomponents. 2) Locating the cause of errors along manufacturing processes is a difficult procedure. 3) Large numbers of heterogeneous measurements impair the ability to explain errors in engines. We address these challenges in a design study with automotive engineers and by developing the visual analytics system Manufacturing Explorer (ManEx), which provides interactive interfaces to analyze measurements of engines across the manufacturing process. ManEx was validated by five experts. Our results suggest high usability and usefulness scores and the improvement of a real-world manufacturing process. Specifically, with ManEx, experts reduced scraped parts by over 3%.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Electrical engines are a key technology all automotive manufacturers must master to stay competitive. Engineers need to analyze an overwhelming number of engine measurements to improve the manufacturing for this technology. They are hindered in the task of analyzing large numbers of engines, however, by the following challenges: 1) Engines comprise a complex hierarchical structure of subcomponents. 2) Locating the cause of errors along manufacturing processes is a difficult procedure. 3) Large numbers of heterogeneous measurements impair the ability to explain errors in engines. We address these challenges in a design study with automotive engineers and by developing the visual analytics system Manufacturing Explorer (ManEx), which provides interactive interfaces to analyze measurements of engines across the manufacturing process. ManEx was validated by five experts. Our results suggest high usability and usefulness scores and the improvement of a real-world manufacturing process. Specifically, with ManEx, experts reduced scraped parts by over 3%.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Electrical engines are a key technology all automotive manufacturers must master to stay competitive. Engineers need to analyze an overwhelming number of engine measurements to improve the manufacturing for this technology. They are hindered in the task of analyzing large numbers of engines, however, by the following challenges: 1) Engines comprise a complex hierarchical structure of subcomponents. 2) Locating the cause of errors along manufacturing processes is a difficult procedure. 3) Large numbers of heterogeneous measurements impair the ability to explain errors in engines. We address these challenges in a design study with automotive engineers and by developing the visual analytics system Manufacturing Explorer (ManEx), which provides interactive interfaces to analyze measurements of engines across the manufacturing process. ManEx was validated by five experts. Our results suggest high usability and usefulness scores and the improvement of a real-world manufacturing process. Specifically, with ManEx, experts reduced scraped parts by over 3%.",
"title": "ManEx: The Visual Analysis of Measurements for the Assessment of Errors in Electrical Engines",
"normalizedTitle": "ManEx: The Visual Analysis of Measurements for the Assessment of Errors in Electrical Engines",
"fno": "09723551",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Automobile Industry",
"Automotive Engineering",
"Data Visualisation",
"Engines",
"Hierarchical Systems",
"Manufacturing Processes",
"Man Ex",
"Real World Manufacturing Process",
"Automotive Manufacturers",
"Overwhelming Number",
"Heterogeneous Measurements",
"Electrical Engine Measurements",
"Error Assessment",
"Complex Hierarchical Structure",
"Subcomponents",
"Visual Analytics System Manufacturing Explorer",
"Engines",
"Manufacturing",
"Manufacturing Processes",
"Data Visualization",
"Task Analysis",
"Measurement Uncertainty",
"Rotors"
],
"authors": [
{
"givenName": "Joscha",
"surname": "Eirich",
"fullName": "Joscha Eirich",
"affiliation": "University of Bamberg, Bamberg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Georgios",
"surname": "Koutroulis",
"fullName": "Georgios Koutroulis",
"affiliation": "Pro2Future GmbH, Linz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Belgin",
"surname": "Mutlu",
"fullName": "Belgin Mutlu",
"affiliation": "Pro2Future GmbH, Linz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dominik",
"surname": "Jäckle",
"fullName": "Dominik Jäckle",
"affiliation": "BMW Group, Munich, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roman",
"surname": "Kern",
"fullName": "Roman Kern",
"affiliation": "Graz University of Technology, Graz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Schreck",
"fullName": "Tobias Schreck",
"affiliation": "Graz University of Technology, Graz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jürgen",
"surname": "Bernard",
"fullName": "Jürgen Bernard",
"affiliation": "University of Zurich, Zurich, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2022-03-01 00:00:00",
"pubType": "mags",
"pages": "68-80",
"year": "2022",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/itc/2012/1594/0/06401545",
"title": "Spatial estimation of wafer measurement parameters using Gaussian process models",
"doi": null,
"abstractUrl": "/proceedings-article/itc/2012/06401545/12OmNAnMuzn",
"parentPublication": {
"id": "proceedings/itc/2012/1594/0",
"title": "2012 IEEE International Test Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wsc/2002/7614/1/01172998",
"title": "A simulation study of an automotive foundry plant manufacturing engine blocks",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/2002/01172998/12OmNCdk2Qo",
"parentPublication": {
"id": "proceedings/wsc/2002/7614/1",
"title": "Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icimp/2008/3189/0/3189a161",
"title": "An Evaluation of Major Image Search Engines on Various Query Topics",
"doi": null,
"abstractUrl": "/proceedings-article/icimp/2008/3189a161/12OmNs59K35",
"parentPublication": {
"id": "proceedings/icimp/2008/3189/0",
"title": "Internet Monitoring and Protection, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/picict/2013/4984/0/4984a099",
"title": "How Web Applications Complement Search Engines?",
"doi": null,
"abstractUrl": "/proceedings-article/picict/2013/4984a099/12OmNxQOjFo",
"parentPublication": {
"id": "proceedings/picict/2013/4984/0",
"title": "Palestinian International Conference on Information and Communication Technology (PICICT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spwhos/1999/0140/0/01400174",
"title": "In-Cylinder Pressure Estimation using Structural Vibration Measurements of Spark Ignition Engines",
"doi": null,
"abstractUrl": "/proceedings-article/spwhos/1999/01400174/12OmNz6iOkw",
"parentPublication": {
"id": "proceedings/spwhos/1999/0140/0",
"title": "Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics. SPW-HOS '99",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issst/2010/7094/0/05507715",
"title": "Greenhouse gas emission mitigation of global automotive manufacturing through clean energy supply",
"doi": null,
"abstractUrl": "/proceedings-article/issst/2010/05507715/12OmNzXFoHR",
"parentPublication": {
"id": "proceedings/issst/2010/7094/0",
"title": "IEEE International Symposium on Sustainable Systems and Technology (ISSST 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/2020/6582/0/09092358",
"title": "Elastic and Real-time Capacity Planning for Web Search Engines",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/2020/09092358/1jPb1ge3k0E",
"parentPublication": {
"id": "proceedings/pdp/2020/6582/0",
"title": "2020 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icgse-icssp/2021/1401/0/140100a022",
"title": "Challenges in the Development of Mobile Online Services in the Automotive Industry - A Case Study",
"doi": null,
"abstractUrl": "/proceedings-article/icgse-icssp/2021/140100a022/1tBbA44Wx8s",
"parentPublication": {
"id": "proceedings/icgse-icssp/2021/1401/0/",
"title": "2021 IEEE/ACM Joint 15th International Conference on Software and System Processes (ICSSP) and 16th ACM/IEEE International Conference on Global Software Engineering (ICGSE) (ICGSE-ICSSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsa/2021/6260/0/626000a162",
"title": "Exploring Web Search Engines to Find Architectural Knowledge",
"doi": null,
"abstractUrl": "/proceedings-article/icsa/2021/626000a162/1twfmxyOEAU",
"parentPublication": {
"id": "proceedings/icsa/2021/6260/0",
"title": "2021 IEEE 18th International Conference on Software Architecture (ICSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552903",
"title": "IRVINE: A Design Study on Analyzing Correlation Patterns of Electrical Engines",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552903/1xibWJujrkk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09726809",
"articleId": "1Brwx58lg1a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09756624",
"articleId": "1Cxvip0vRCg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H1gmktPnLa",
"doi": "10.1109/TVCG.2022.3209491",
"abstract": "Understanding one's audience is foundational to creating high impact visualization designs. However, individual differences and cognitive abilities influence interactions with information visualization. Different user needs and abilities suggest that an individual's background could influence cognitive performance and interactions with visuals in a systematic way. This study builds on current research in domain-specific visualization and cognition to address if domain and spatial visualization ability combine to affect performance on information visualization tasks. We measure spatial visualization and visual task performance between those with tertiary education and professional profile in business, law & political science, and math & computer science. We conducted an online study with 90 participants using an established psychometric test to assess spatial visualization ability, and bar chart layouts rotated along Cartesian and polar coordinates to assess performance on spatially rotated data. Accuracy and response times varied with domain across chart types and task difficulty. We found that accuracy and time correlate with spatial visualization level, and education in math & computer science can indicate higher spatial visualization. Additionally, we found that motivational differences between domains could contribute to increased levels of accuracy. Our findings indicate discipline not only affects user needs and interactions with data visualization, but also cognitive traits. Our results can advance inclusive practices in visualization design and add to knowledge in domain-specific visual research that can empower designers across disciplines to create effective visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Understanding one's audience is foundational to creating high impact visualization designs. However, individual differences and cognitive abilities influence interactions with information visualization. Different user needs and abilities suggest that an individual's background could influence cognitive performance and interactions with visuals in a systematic way. This study builds on current research in domain-specific visualization and cognition to address if domain and spatial visualization ability combine to affect performance on information visualization tasks. We measure spatial visualization and visual task performance between those with tertiary education and professional profile in business, law & political science, and math & computer science. We conducted an online study with 90 participants using an established psychometric test to assess spatial visualization ability, and bar chart layouts rotated along Cartesian and polar coordinates to assess performance on spatially rotated data. Accuracy and response times varied with domain across chart types and task difficulty. We found that accuracy and time correlate with spatial visualization level, and education in math & computer science can indicate higher spatial visualization. Additionally, we found that motivational differences between domains could contribute to increased levels of accuracy. Our findings indicate discipline not only affects user needs and interactions with data visualization, but also cognitive traits. Our results can advance inclusive practices in visualization design and add to knowledge in domain-specific visual research that can empower designers across disciplines to create effective visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Understanding one's audience is foundational to creating high impact visualization designs. However, individual differences and cognitive abilities influence interactions with information visualization. Different user needs and abilities suggest that an individual's background could influence cognitive performance and interactions with visuals in a systematic way. This study builds on current research in domain-specific visualization and cognition to address if domain and spatial visualization ability combine to affect performance on information visualization tasks. We measure spatial visualization and visual task performance between those with tertiary education and professional profile in business, law & political science, and math & computer science. We conducted an online study with 90 participants using an established psychometric test to assess spatial visualization ability, and bar chart layouts rotated along Cartesian and polar coordinates to assess performance on spatially rotated data. Accuracy and response times varied with domain across chart types and task difficulty. We found that accuracy and time correlate with spatial visualization level, and education in math & computer science can indicate higher spatial visualization. Additionally, we found that motivational differences between domains could contribute to increased levels of accuracy. Our findings indicate discipline not only affects user needs and interactions with data visualization, but also cognitive traits. Our results can advance inclusive practices in visualization design and add to knowledge in domain-specific visual research that can empower designers across disciplines to create effective visualizations.",
"title": "Measuring Effects of Spatial Visualization and Domain on Visualization Task Performance: A Comparative Study",
"normalizedTitle": "Measuring Effects of Spatial Visualization and Domain on Visualization Task Performance: A Comparative Study",
"fno": "09904456",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Bar Charts",
"Cognition",
"Data Visualisation",
"Psychometric Testing",
"Bar Chart Layouts",
"Cartesian Coordinates",
"Cognition",
"Cognitive Abilities",
"Cognitive Performance",
"Data Visualization",
"Domain Specific Visualization",
"High Impact Visualization Design",
"Information Visualization Tasks",
"Law Political Science",
"Math Computer Science",
"Polar Coordinates",
"Psychometric Test",
"Spatial Visualization Ability",
"Spatially Rotated Data",
"Visualization Task Performance",
"Data Visualization",
"Visualization",
"Task Analysis",
"Education",
"Psychology",
"Bars",
"Time Factors",
"Human Subjects Quantitative Studies",
"Visualization",
"Perception",
"Bar Chart",
"Discipline",
"Domain Specific",
"Education",
"Empirical Evaluation",
"Spatial Ability",
"Cognitive Abilities"
],
"authors": [
{
"givenName": "Sara",
"surname": "Tandon",
"fullName": "Sara Tandon",
"affiliation": "King's College London, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alfie",
"surname": "Abdul-Rahman",
"fullName": "Alfie Abdul-Rahman",
"affiliation": "King's College London, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rita",
"surname": "Borgo",
"fullName": "Rita Borgo",
"affiliation": "King's College London, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "668-678",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660065",
"title": "Understanding Visualization through Spatial Ability Differences",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660065/12OmNxwWoKu",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2011/468/0/06142781",
"title": "A comprehensive project utilizing spatial visualization skills",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2011/06142781/12OmNy7h354",
"parentPublication": {
"id": "proceedings/fie/2011/468/0",
"title": "2011 Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccie/2010/4026/2/4026b153",
"title": "Application of Visualization Technology in Spatial Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/ccie/2010/4026b153/12OmNzBOhXD",
"parentPublication": {
"id": "proceedings/ccie/2010/4026/2",
"title": "Computing, Control and Industrial Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532836",
"title": "Understanding visualization through spatial ability differences",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532836/12OmNzl3X0g",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539634",
"title": "VLAT: Development of a Visualization Literacy Assessment Test",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539634/13rRUxASuhE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539573",
"title": "A Fractional Cartesian Composition Model for Semi-Spatial Comparative Visualization Design",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539573/13rRUxC0SEk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08456575",
"title": "SRVis: Towards Better Spatial Integration in Ranking Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08456575/17D45VUZMTZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2022/6244/0/09962621",
"title": "The Relationship Between Spatial Skills and Sketch Quality in Solving Problems in Engineering Mechanics",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2022/09962621/1IHo32fS0dq",
"parentPublication": {
"id": "proceedings/fie/2022/6244/0",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09572234",
"title": "Professional Differences: A Comparative Study of Visualization Task Performance and Spatial Ability Across Disciplines",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09572234/1xH5FXdMnoA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2021/3827/0/382700a223",
"title": "A Taxonomy of Spatial-Temporal Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2021/382700a223/1y4oJ9f6FuU",
"parentPublication": {
"id": "proceedings/iv/2021/3827/0",
"title": "2021 25th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09925049",
"articleId": "1HBHYSHqD3a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904483",
"articleId": "1H1gfbVcpgI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9ySy4oMiA",
"name": "ttg202301-09904456s1-supp1-3209491.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09904456s1-supp1-3209491.pdf",
"extension": "pdf",
"size": "6.37 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1dia1nodZeM",
"doi": "10.1109/TVCG.2019.2934395",
"abstract": "Recent developments in technology encourage the use of head-mounted displays (HMDs) as a medium to explore visualizations in virtual realities (VRs). VR environments (VREs) enable new, more immersive visualization design spaces compared to traditional computer screens. Previous studies in different domains, such as medicine, psychology, and geology, report a positive effect of immersion, e.g., on learning performance or phobia treatment effectiveness. Our work presented in this paper assesses the applicability of those findings to a common task from the information visualization (InfoVis) domain. We conducted a quantitative user study to investigate the impact of immersion on cluster identification tasks in scatterplot visualizations. The main experiment was carried out with 18 participants in a within-subjects setting using four different visualizations, (1) a 2D scatterplot matrix on a screen, (2) a 3D scatterplot on a screen, (3) a 3D scatterplot miniature in a VRE and (4) a fully immersive 3D scatterplot in a VRE. The four visualization design spaces vary in their level of immersion, as shown in a supplementary study. The results of our main study indicate that task performance differs between the investigated visualization design spaces in terms of accuracy, efficiency, memorability, sense of orientation, and user preference. In particular, the 2D visualization on the screen performed worse compared to the 3D visualizations with regard to the measured variables. The study shows that an increased level of immersion can be a substantial benefit in the context of 3D data and cluster detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent developments in technology encourage the use of head-mounted displays (HMDs) as a medium to explore visualizations in virtual realities (VRs). VR environments (VREs) enable new, more immersive visualization design spaces compared to traditional computer screens. Previous studies in different domains, such as medicine, psychology, and geology, report a positive effect of immersion, e.g., on learning performance or phobia treatment effectiveness. Our work presented in this paper assesses the applicability of those findings to a common task from the information visualization (InfoVis) domain. We conducted a quantitative user study to investigate the impact of immersion on cluster identification tasks in scatterplot visualizations. The main experiment was carried out with 18 participants in a within-subjects setting using four different visualizations, (1) a 2D scatterplot matrix on a screen, (2) a 3D scatterplot on a screen, (3) a 3D scatterplot miniature in a VRE and (4) a fully immersive 3D scatterplot in a VRE. The four visualization design spaces vary in their level of immersion, as shown in a supplementary study. The results of our main study indicate that task performance differs between the investigated visualization design spaces in terms of accuracy, efficiency, memorability, sense of orientation, and user preference. In particular, the 2D visualization on the screen performed worse compared to the 3D visualizations with regard to the measured variables. The study shows that an increased level of immersion can be a substantial benefit in the context of 3D data and cluster detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent developments in technology encourage the use of head-mounted displays (HMDs) as a medium to explore visualizations in virtual realities (VRs). VR environments (VREs) enable new, more immersive visualization design spaces compared to traditional computer screens. Previous studies in different domains, such as medicine, psychology, and geology, report a positive effect of immersion, e.g., on learning performance or phobia treatment effectiveness. Our work presented in this paper assesses the applicability of those findings to a common task from the information visualization (InfoVis) domain. We conducted a quantitative user study to investigate the impact of immersion on cluster identification tasks in scatterplot visualizations. The main experiment was carried out with 18 participants in a within-subjects setting using four different visualizations, (1) a 2D scatterplot matrix on a screen, (2) a 3D scatterplot on a screen, (3) a 3D scatterplot miniature in a VRE and (4) a fully immersive 3D scatterplot in a VRE. The four visualization design spaces vary in their level of immersion, as shown in a supplementary study. The results of our main study indicate that task performance differs between the investigated visualization design spaces in terms of accuracy, efficiency, memorability, sense of orientation, and user preference. In particular, the 2D visualization on the screen performed worse compared to the 3D visualizations with regard to the measured variables. The study shows that an increased level of immersion can be a substantial benefit in the context of 3D data and cluster detection.",
"title": "The Impact of Immersion on Cluster Identification Tasks",
"normalizedTitle": "The Impact of Immersion on Cluster Identification Tasks",
"fno": "08836087",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Helmet Mounted Displays",
"Pattern Clustering",
"Virtual Reality",
"Virtual Realities",
"VR Environments",
"Immersive Visualization Design Spaces",
"Learning Performance",
"Information Visualization Domain",
"Cluster Identification Tasks",
"Scatterplot Visualizations",
"2 D Scatterplot Matrix",
"3 D Scatterplot Miniature",
"VRE",
"Fully Immersive 3 D Scatterplot",
"Cluster Detection",
"Head Mounted Displays",
"Info Vis Domain",
"Visualization Design Spaces",
"Data Visualization",
"Three Dimensional Displays",
"Task Analysis",
"Two Dimensional Displays",
"Visualization",
"Virtual Reality",
"Dimensionality Reduction",
"Virtual Reality",
"Evaluation",
"Visual Analytics",
"Clustering"
],
"authors": [
{
"givenName": "M.",
"surname": "Kraus",
"fullName": "M. Kraus",
"affiliation": "University of Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "N.",
"surname": "Weiler",
"fullName": "N. Weiler",
"affiliation": "University of Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "D.",
"surname": "Oelke",
"fullName": "D. Oelke",
"affiliation": "Siemens Corporate Technology, Munich, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Kehrer",
"fullName": "J. Kehrer",
"affiliation": "Siemens Corporate Technology, Munich, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "D. A.",
"surname": "Keim",
"fullName": "D. A. Keim",
"affiliation": "University of Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.",
"surname": "Fuchs",
"fullName": "J. Fuchs",
"affiliation": "University of Konstanz, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "525-535",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2011/935/0/05742379",
"title": "Impact of group size on spatial structure understanding tasks",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742379/12OmNA0vo1z",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/04/ttg2012040597",
"title": "Effects of Immersion on Visual Analysis of Volume Data",
"doi": null,
"abstractUrl": "/journal/tg/2012/04/ttg2012040597/13rRUxASuve",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539334",
"title": "GazeDx: Interactive Visual Analytics Framework for Comparative Gaze Analysis with Volumetric Medical Images",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539334/13rRUxjQyvp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539353",
"title": "Comparing Cross-Sections and 3D Renderings for Surface Matching Tasks Using Physical Ground Truths",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539353/13rRUxly8SY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017602",
"title": "Scatterplots: Tasks, Data, and Designs",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017602/13rRUy3gn7C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2018/7459/0/745900a070",
"title": "Ensuring Safety in Augmented Reality from Trade-off Between Immersion and Situation Awareness",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2018/745900a070/17D45XvMcdq",
"parentPublication": {
"id": "proceedings/ismar/2018/7459/0",
"title": "2018 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09826389",
"title": "Automatic Scatterplot Design Optimization for Clustering Identification",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09826389/1EVdDTX0i2I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08812684",
"title": "Design by Immersion: A Transdisciplinary Approach to Problem-Driven Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08812684/1cPXz3IisTK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2018/6882/0/08823618",
"title": "3De Interactive Lenses for Visualization in Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2018/08823618/1d5kwZvgfNm",
"parentPublication": {
"id": "proceedings/scivis/2018/6882/0",
"title": "2018 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/10/09096616",
"title": "Spanning Trees as Approximation of Data Structures",
"doi": null,
"abstractUrl": "/journal/tg/2021/10/09096616/1jXr5H4rT9K",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08854316",
"articleId": "1dM2fkHbAVa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08820171",
"articleId": "1eTOD009FVm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1fe9kfEsJxe",
"name": "ttg202001-08836087s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08836087s1.zip",
"extension": "zip",
"size": "48.2 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": "1volPuHGMdW",
"doi": "10.1109/TVCG.2021.3098240",
"abstract": "Knowledge of human perception has long been incorporated into visualizations to enhance their quality and effectiveness. The last decade, in particular, has shown an increase in perception-based visualization research studies. With all of this recent progress, the visualization community lacks a comprehensive guide to contextualize their results. In this report, we provide a systematic and comprehensive review of research studies on perception related to visualization. This survey reviews perception-focused visualization studies since 1980 and summarizes their research developments focusing on low-level tasks, further breaking techniques down by visual encoding and visualization type. In particular, we focus on how perception is used to evaluate the effectiveness of visualizations, to help readers understand and apply the principles of perception of their visualization designs through a task-optimized approach. We concluded our report with a summary of the weaknesses and open research questions in the area.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Knowledge of human perception has long been incorporated into visualizations to enhance their quality and effectiveness. The last decade, in particular, has shown an increase in perception-based visualization research studies. With all of this recent progress, the visualization community lacks a comprehensive guide to contextualize their results. In this report, we provide a systematic and comprehensive review of research studies on perception related to visualization. This survey reviews perception-focused visualization studies since 1980 and summarizes their research developments focusing on low-level tasks, further breaking techniques down by visual encoding and visualization type. In particular, we focus on how perception is used to evaluate the effectiveness of visualizations, to help readers understand and apply the principles of perception of their visualization designs through a task-optimized approach. We concluded our report with a summary of the weaknesses and open research questions in the area.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Knowledge of human perception has long been incorporated into visualizations to enhance their quality and effectiveness. The last decade, in particular, has shown an increase in perception-based visualization research studies. With all of this recent progress, the visualization community lacks a comprehensive guide to contextualize their results. In this report, we provide a systematic and comprehensive review of research studies on perception related to visualization. This survey reviews perception-focused visualization studies since 1980 and summarizes their research developments focusing on low-level tasks, further breaking techniques down by visual encoding and visualization type. In particular, we focus on how perception is used to evaluate the effectiveness of visualizations, to help readers understand and apply the principles of perception of their visualization designs through a task-optimized approach. We concluded our report with a summary of the weaknesses and open research questions in the area.",
"title": "A Survey of Perception-Based Visualization Studies by Task",
"normalizedTitle": "A Survey of Perception-Based Visualization Studies by Task",
"fno": "09492011",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Visual Perception",
"Comprehensive Guide",
"Human Perception",
"Low Level Tasks",
"Open Research Questions",
"Perception Based Visualization Research Studies",
"Perception Focused Visualization Studies",
"Research Developments",
"Systematic Review",
"Task Optimized Approach",
"Visual Encoding",
"Visualization Community",
"Visualization Designs",
"Data Visualization",
"Visualization",
"Task Analysis",
"Taxonomy",
"Encoding",
"Visual Analytics",
"Crowdsourcing",
"Visualization",
"Perception",
"Graphical Perception",
"Visual Analytics Tasks",
"Evaluation",
"Survey"
],
"authors": [
{
"givenName": "Ghulam Jilani",
"surname": "Quadri",
"fullName": "Ghulam Jilani Quadri",
"affiliation": "Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "Rosen",
"fullName": "Paul Rosen",
"affiliation": "Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "5026-5048",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"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": "trans/tg/2010/06/ttg2010060943",
"title": "How Information Visualization Novices Construct Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060943/13rRUwInvAZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/02/07414495",
"title": "Fauxvea: Crowdsourcing Gaze Location Estimates for Visualization Analysis Tasks",
"doi": null,
"abstractUrl": "/journal/tg/2017/02/07414495/13rRUwInvyE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/07/08356097",
"title": "Bridging Text Visualization and Mining: A Task-Driven Survey",
"doi": null,
"abstractUrl": "/journal/tg/2019/07/08356097/13rRUwbs1SC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122516",
"title": "Perception of Visual Variables on Tiled Wall-Sized Displays for Information Visualization Applications",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122516/13rRUwwJWFM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071109",
"title": "How Visualization Layout Relates to Locus of Control and Other Personality Factors",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071109/13rRUy3xY2O",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08454489",
"title": "Patterns and Pace: Quantifying Diverse Exploration Behavior with Visualizations on the Web",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08454489/17D45W1Oa3s",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08457476",
"title": "In Pursuit of Error: A Survey of Uncertainty Visualization Evaluation",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08457476/17D45WaTkcP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09495259",
"title": "AI4VIS: Survey on Artificial Intelligence Approaches for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09495259/1vyjtdJRfXO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552238",
"title": "What's the Situation with Situated Visualization? A Survey and Perspectives on Situatedness",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552238/1xic77YygOk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09411680",
"articleId": "1t0Dp5mXJM4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09495259",
"articleId": "1vyjtdJRfXO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xH5FXdMnoA",
"doi": "10.1109/TVCG.2021.3114805",
"abstract": "Problem-driven visualization work is rooted in deeply understanding the data, actors, processes, and workflows of a target domain. However, an individual's personality traits and cognitive abilities may also influence visualization use. Diverse user needs and abilities raise natural questions for specificity in visualization design: <italic>Could individuals from different domains exhibit performance differences when using visualizations? Are any systematic variations related to their cognitive abilities?</italic> This study bridges domain-specific perspectives on visualization design with those provided by cognition and perception. We measure variations in visualization task performance across chemistry, computer science, and education, and relate these differences to variations in spatial ability. We conducted an online study with over 60 domain experts consisting of tasks related to pie charts, isocontour plots, and 3D scatterplots, and grounded by a well-documented spatial ability test. Task performance (correctness) varied with profession across more complex visualizations (isocontour plots and scatterplots), but not pie charts, a comparatively common visualization. We found that correctness correlates with spatial ability, and the professions differ in terms of spatial ability. These results indicate that domains differ not only in the specifics of their data and tasks, but also in terms of how effectively their constituent members engage with visualizations and their cognitive traits. Analyzing participants' confidence and strategy comments suggests that focusing on performance neglects important nuances, such as differing approaches to engage with even common visualizations and potential skill transference. Our findings offer a fresh perspective on discipline-specific visualization with specific recommendations to help guide visualization design that celebrates the uniqueness of the disciplines and individuals we seek to serve.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Problem-driven visualization work is rooted in deeply understanding the data, actors, processes, and workflows of a target domain. However, an individual's personality traits and cognitive abilities may also influence visualization use. Diverse user needs and abilities raise natural questions for specificity in visualization design: <italic>Could individuals from different domains exhibit performance differences when using visualizations? Are any systematic variations related to their cognitive abilities?</italic> This study bridges domain-specific perspectives on visualization design with those provided by cognition and perception. We measure variations in visualization task performance across chemistry, computer science, and education, and relate these differences to variations in spatial ability. We conducted an online study with over 60 domain experts consisting of tasks related to pie charts, isocontour plots, and 3D scatterplots, and grounded by a well-documented spatial ability test. Task performance (correctness) varied with profession across more complex visualizations (isocontour plots and scatterplots), but not pie charts, a comparatively common visualization. We found that correctness correlates with spatial ability, and the professions differ in terms of spatial ability. These results indicate that domains differ not only in the specifics of their data and tasks, but also in terms of how effectively their constituent members engage with visualizations and their cognitive traits. Analyzing participants' confidence and strategy comments suggests that focusing on performance neglects important nuances, such as differing approaches to engage with even common visualizations and potential skill transference. Our findings offer a fresh perspective on discipline-specific visualization with specific recommendations to help guide visualization design that celebrates the uniqueness of the disciplines and individuals we seek to serve.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Problem-driven visualization work is rooted in deeply understanding the data, actors, processes, and workflows of a target domain. However, an individual's personality traits and cognitive abilities may also influence visualization use. Diverse user needs and abilities raise natural questions for specificity in visualization design: Could individuals from different domains exhibit performance differences when using visualizations? Are any systematic variations related to their cognitive abilities? This study bridges domain-specific perspectives on visualization design with those provided by cognition and perception. We measure variations in visualization task performance across chemistry, computer science, and education, and relate these differences to variations in spatial ability. We conducted an online study with over 60 domain experts consisting of tasks related to pie charts, isocontour plots, and 3D scatterplots, and grounded by a well-documented spatial ability test. Task performance (correctness) varied with profession across more complex visualizations (isocontour plots and scatterplots), but not pie charts, a comparatively common visualization. We found that correctness correlates with spatial ability, and the professions differ in terms of spatial ability. These results indicate that domains differ not only in the specifics of their data and tasks, but also in terms of how effectively their constituent members engage with visualizations and their cognitive traits. Analyzing participants' confidence and strategy comments suggests that focusing on performance neglects important nuances, such as differing approaches to engage with even common visualizations and potential skill transference. Our findings offer a fresh perspective on discipline-specific visualization with specific recommendations to help guide visualization design that celebrates the uniqueness of the disciplines and individuals we seek to serve.",
"title": "Professional Differences: A Comparative Study of Visualization Task Performance and Spatial Ability Across Disciplines",
"normalizedTitle": "Professional Differences: A Comparative Study of Visualization Task Performance and Spatial Ability Across Disciplines",
"fno": "09572234",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cognition",
"Computer Aided Instruction",
"Data Visualisation",
"Professional Aspects",
"Professional Differences",
"Visualization Task Performance",
"Problem Driven Visualization Work",
"Target Domain",
"Individual",
"Cognitive Abilities",
"Visualization Design",
"Study Bridges Domain Specific Perspectives",
"Cognition",
"60 Domain Experts",
"Pie Charts",
"Isocontour Plots",
"Spatial Ability Test",
"Complex Visualizations",
"Comparatively Common Visualization",
"Cognitive Traits",
"Performance Neglects Important Nuances",
"Differing Approaches",
"Common Visualizations",
"Discipline Specific Visualization",
"Data Visualization",
"Task Analysis",
"Visualization",
"Cognition",
"Training",
"Three Dimensional Displays",
"Navigation",
"Visualization",
"Spatial Ability",
"Perception",
"Task Performance",
"Discipline",
"Domain Specific",
"Empirical Evaluation"
],
"authors": [
{
"givenName": "Kyle Wm.",
"surname": "Hall",
"fullName": "Kyle Wm. Hall",
"affiliation": "Temple University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anthony",
"surname": "Kouroupis",
"fullName": "Anthony Kouroupis",
"affiliation": "Ontario Tech University, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anastasia",
"surname": "Bezerianos",
"fullName": "Anastasia Bezerianos",
"affiliation": "LRI-Université Paris-Saclay, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danielle Albers",
"surname": "Szafir",
"fullName": "Danielle Albers Szafir",
"affiliation": "University of Colorado Boulder, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher",
"surname": "Collins",
"fullName": "Christopher Collins",
"affiliation": "Ontario Tech University, Canada",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "654-664",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/infvis/1997/8189/0/00636794",
"title": "Metrics for effective information visualization",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/1997/00636794/12OmNAtstaH",
"parentPublication": {
"id": "proceedings/infvis/1997/8189/0",
"title": "Proceedings of VIZ '97: Visualization Conference, Information Visualization Symposium and Parallel Rendering Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660065",
"title": "Understanding Visualization through Spatial Ability Differences",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660065/12OmNxwWoKu",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dvis/2014/6826/0/07160096",
"title": "3D InfoVis is here to stay: Deal with it",
"doi": null,
"abstractUrl": "/proceedings-article/3dvis/2014/07160096/12OmNy5hReS",
"parentPublication": {
"id": "proceedings/3dvis/2014/6826/0",
"title": "2014 IEEE VIS International Workshop on 3DVis (3DVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2014/4258/0/4258a080",
"title": "A Nested Hierarchy of Localized Scatterplots",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2014/4258a080/12OmNy7h3e0",
"parentPublication": {
"id": "proceedings/sibgrapi/2014/4258/0",
"title": "2014 27th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532836",
"title": "Understanding visualization through spatial ability differences",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532836/12OmNzl3X0g",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/1997/8189/0/00636794",
"title": "Metrics for effective information visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/1997/00636794/1h0Jt1gK27m",
"parentPublication": {
"id": "proceedings/ieee-infovis/1997/8189/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089446",
"title": "Graphical Perception for Immersive Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089446/1jIxfA3tlUk",
"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/2021/02/09222098",
"title": "Embodied Navigation in Immersive Abstract Data Visualization: Is Overview+Detail or Zooming Better for 3D Scatterplots?",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222098/1nTrQ1hHyyA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09223669",
"title": "Personal Augmented Reality for Information Visualization on Large Interactive Displays",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09223669/1nV6cy8Xk5i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552195",
"title": "Perception! Immersion! Empowerment! Superpowers as Inspiration for Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552195/1xic0yNxnws",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552211",
"articleId": "1xic1bREyqY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09555646",
"articleId": "1xlw1u3Uiw8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBaJVCkKCQ",
"name": "ttg202201-09572234s1-tvcg-3114805-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09572234s1-tvcg-3114805-mm.zip",
"extension": "zip",
"size": "3.02 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBKEyoy",
"title": "March",
"year": "2016",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhpBE8",
"doi": "10.1109/TVCG.2015.2484343",
"abstract": "Three-dimensional symmetric tensor fields have a wide range of applications in solid and fluid mechanics. Recent advances in the (topological) analysis of 3D symmetric tensor fields focus on degenerate tensors which form curves. In this paper, we introduce a number of feature surfaces, such as neutral surfaces and traceless surfaces, into tensor field analysis, based on the notion of eigenvalue manifold. Neutral surfaces are the boundary between linear tensors and planar tensors, and the traceless surfaces are the boundary between tensors of positive traces and those of negative traces. Degenerate curves, neutral surfaces, and traceless surfaces together form a partition of the eigenvalue manifold, which provides a more complete tensor field analysis than degenerate curves alone. We also extract and visualize the isosurfaces of tensor modes, tensor isotropy, and tensor magnitude, which we have found useful for domain applications in fluid and solid mechanics. Extracting neutral and traceless surfaces using the Marching Tetrahedra method can cause the loss of geometric and topological details, which can lead to false physical interpretation. To robustly extract neutral surfaces and traceless surfaces, we develop a polynomial description of them which enables us to borrow techniques from algebraic surface extraction, a topic well-researched by the computer-aided design (CAD) community as well as the algebraic geometry community. In addition, we adapt the surface extraction technique, called A-patches, to improve the speed of finding degenerate curves. Finally, we apply our analysis to data from solid and fluid mechanics as well as scalar field analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Three-dimensional symmetric tensor fields have a wide range of applications in solid and fluid mechanics. Recent advances in the (topological) analysis of 3D symmetric tensor fields focus on degenerate tensors which form curves. In this paper, we introduce a number of feature surfaces, such as neutral surfaces and traceless surfaces, into tensor field analysis, based on the notion of eigenvalue manifold. Neutral surfaces are the boundary between linear tensors and planar tensors, and the traceless surfaces are the boundary between tensors of positive traces and those of negative traces. Degenerate curves, neutral surfaces, and traceless surfaces together form a partition of the eigenvalue manifold, which provides a more complete tensor field analysis than degenerate curves alone. We also extract and visualize the isosurfaces of tensor modes, tensor isotropy, and tensor magnitude, which we have found useful for domain applications in fluid and solid mechanics. Extracting neutral and traceless surfaces using the Marching Tetrahedra method can cause the loss of geometric and topological details, which can lead to false physical interpretation. To robustly extract neutral surfaces and traceless surfaces, we develop a polynomial description of them which enables us to borrow techniques from algebraic surface extraction, a topic well-researched by the computer-aided design (CAD) community as well as the algebraic geometry community. In addition, we adapt the surface extraction technique, called A-patches, to improve the speed of finding degenerate curves. Finally, we apply our analysis to data from solid and fluid mechanics as well as scalar field analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Three-dimensional symmetric tensor fields have a wide range of applications in solid and fluid mechanics. Recent advances in the (topological) analysis of 3D symmetric tensor fields focus on degenerate tensors which form curves. In this paper, we introduce a number of feature surfaces, such as neutral surfaces and traceless surfaces, into tensor field analysis, based on the notion of eigenvalue manifold. Neutral surfaces are the boundary between linear tensors and planar tensors, and the traceless surfaces are the boundary between tensors of positive traces and those of negative traces. Degenerate curves, neutral surfaces, and traceless surfaces together form a partition of the eigenvalue manifold, which provides a more complete tensor field analysis than degenerate curves alone. We also extract and visualize the isosurfaces of tensor modes, tensor isotropy, and tensor magnitude, which we have found useful for domain applications in fluid and solid mechanics. Extracting neutral and traceless surfaces using the Marching Tetrahedra method can cause the loss of geometric and topological details, which can lead to false physical interpretation. To robustly extract neutral surfaces and traceless surfaces, we develop a polynomial description of them which enables us to borrow techniques from algebraic surface extraction, a topic well-researched by the computer-aided design (CAD) community as well as the algebraic geometry community. In addition, we adapt the surface extraction technique, called A-patches, to improve the speed of finding degenerate curves. Finally, we apply our analysis to data from solid and fluid mechanics as well as scalar field analysis.",
"title": "Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold",
"normalizedTitle": "Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold",
"fno": "07286850",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Tensile Stress",
"Eigenvalues And Eigenfunctions",
"Manifolds",
"Three Dimensional Displays",
"Feature Extraction",
"Indexes",
"Topology",
"Scalar Fields",
"Tensor Field Visualization",
"Feature Based Visualization",
"Tensor Field Topology",
"Traceless Tensors",
"A Patches",
"Scalar Fields",
"Tensor Field Visualization",
"Feature Based Visualization",
"Tensor Field Topology",
"Traceless Tensors",
"A Patches"
],
"authors": [
{
"givenName": "Jonathan",
"surname": "Palacios",
"fullName": "Jonathan Palacios",
"affiliation": "School of Electrical Engineering and Computer Science, Oregon State University, 1148 Kelley Engineering Center, Corvallis, OR",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harry",
"surname": "Yeh",
"fullName": "Harry Yeh",
"affiliation": "School of Civil and Construction Engineering, Oregon State University, 208 Owen Hall, Corvallis, OR",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenping",
"surname": "Wang",
"fullName": "Wenping Wang",
"affiliation": "Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Zhang",
"fullName": "Yue Zhang",
"affiliation": "School of Electrical Engineering and Computer Science, Oregon State University, 3117 Kelley Engineering Center, Corvallis, OR",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert S.",
"surname": "Laramee",
"fullName": "Robert S. Laramee",
"affiliation": "Department of Computer Science, Swansea University, Wales, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ritesh",
"surname": "Sharma",
"fullName": "Ritesh Sharma",
"affiliation": "School of Electrical Engineering and Computer Science, Oregon State University, 1148 Kelley Engineering Center, Corvallis, OR",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Schultz",
"fullName": "Thomas Schultz",
"affiliation": "Institute of Computer Science, University of Bonn, Friedrich-Ebert-Allee 144, Bonn, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "School of Electrical Engineering and Computer Science, Oregon State University, 2111 Kelley Engineering Center, Corvallis, OR",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2016-03-01 00:00:00",
"pubType": "trans",
"pages": "1248-1260",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2009/4420/0/05459422",
"title": "Shape analysis with multivariate tensor-based morphometry and holomorphic differentials",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459422/12OmNAWYKFP",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532770",
"title": "2D asymmetric tensor analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532770/12OmNCw3z9K",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346326",
"title": "The topology of symmetric, second-order tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346326/12OmNvxKu1Q",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532841",
"title": "Topological structures of 3D tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532841/12OmNx5GTXp",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0094",
"title": "Interactive Tensor Field Design and Visualization on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0094/13rRUxASuG8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06933942",
"title": "A Topologically-Informed Hyperstreamline Seeding Method for Alignment Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06933942/13rRUxly8XG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08447439",
"title": "Tensor Field Visualization using Fiber Surfaces of Invariant Space",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08447439/17D45W1Oa1M",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08453873",
"title": "Robust and Fast Extraction of 3D Symmetric Tensor Field Topology",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08453873/17D45WHONif",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224154",
"title": "Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224154/1nV63QG11le",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552927",
"title": "Feature Curves and Surfaces of 3D Asymmetric Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552927/1xic6oeRxnO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07180400",
"articleId": "13rRUxNW1Zr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07346513",
"articleId": "13rRUIM2VH3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WHONif",
"doi": "10.1109/TVCG.2018.2864768",
"abstract": "3D symmetric tensor fields appear in many science and engineering fields, and topology-driven analysis is important in many of these application domains, such as solid mechanics and fluid dynamics. Degenerate curves and neutral surfaces are important topological features in 3D symmetric tensor fields. Existing methods to extract degenerate curves and neutral surfaces often miss parts of the curves and surfaces, respectively. Moreover, these methods are computationally expensive due to the lack of knowledge of structures of degenerate curves and neutral surfaces.<;/p> <;p>In this paper, we provide theoretical analysis on the geometric and topological structures of degenerate curves and neutral surfaces of 3D linear tensor fields. These structures lead to parameterizations for degenerate curves and neutral surfaces that can not only provide more robust extraction of these features but also incur less computational cost.<;/p> <;p>We demonstrate the benefits of our approach by applying our degenerate curve and neutral surface detection techniques to solid mechanics simulation data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "3D symmetric tensor fields appear in many science and engineering fields, and topology-driven analysis is important in many of these application domains, such as solid mechanics and fluid dynamics. Degenerate curves and neutral surfaces are important topological features in 3D symmetric tensor fields. Existing methods to extract degenerate curves and neutral surfaces often miss parts of the curves and surfaces, respectively. Moreover, these methods are computationally expensive due to the lack of knowledge of structures of degenerate curves and neutral surfaces.<;/p> <;p>In this paper, we provide theoretical analysis on the geometric and topological structures of degenerate curves and neutral surfaces of 3D linear tensor fields. These structures lead to parameterizations for degenerate curves and neutral surfaces that can not only provide more robust extraction of these features but also incur less computational cost.<;/p> <;p>We demonstrate the benefits of our approach by applying our degenerate curve and neutral surface detection techniques to solid mechanics simulation data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "3D symmetric tensor fields appear in many science and engineering fields, and topology-driven analysis is important in many of these application domains, such as solid mechanics and fluid dynamics. Degenerate curves and neutral surfaces are important topological features in 3D symmetric tensor fields. Existing methods to extract degenerate curves and neutral surfaces often miss parts of the curves and surfaces, respectively. Moreover, these methods are computationally expensive due to the lack of knowledge of structures of degenerate curves and neutral surfaces. In this paper, we provide theoretical analysis on the geometric and topological structures of degenerate curves and neutral surfaces of 3D linear tensor fields. These structures lead to parameterizations for degenerate curves and neutral surfaces that can not only provide more robust extraction of these features but also incur less computational cost. We demonstrate the benefits of our approach by applying our degenerate curve and neutral surface detection techniques to solid mechanics simulation data sets.",
"title": "Robust and Fast Extraction of 3D Symmetric Tensor Field Topology",
"normalizedTitle": "Robust and Fast Extraction of 3D Symmetric Tensor Field Topology",
"fno": "08453873",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Curve Fitting",
"Data Visualisation",
"Feature Extraction",
"Geometry",
"Surface Fitting",
"Tensors",
"Topology",
"Degenerate Curve",
"Neutral Surface Detection Techniques",
"3 D Symmetric Tensor Field Topology",
"Engineering Fields",
"Topology Driven Analysis",
"Geometric Structures",
"Topological Structures",
"3 D Linear Tensor Fields",
"Topological Features",
"Solid Mechanics",
"Fluid Dynamics",
"Parameterizations",
"Robust Extraction",
"Tensile Stress",
"Eigenvalues And Eigenfunctions",
"Three Dimensional Displays",
"Feature Extraction",
"Topology",
"Solids",
"Robustness",
"Tensor Field Visualization",
"3 D Symmetric Tensor Fields",
"Tensor Field Topology",
"Traceless Tensors",
"Degenerate Curve Extraction",
"Neutral Surface Extraction"
],
"authors": [
{
"givenName": "Lawrence",
"surname": "Roy",
"fullName": "Lawrence Roy",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Prashant",
"surname": "Kumar",
"fullName": "Prashant Kumar",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Zhang",
"fullName": "Yue Zhang",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1102-1111",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/01532770",
"title": "2D asymmetric tensor analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532770/12OmNCw3z9K",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346326",
"title": "The topology of symmetric, second-order tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346326/12OmNvxKu1Q",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532841",
"title": "Topological structures of 3D tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532841/12OmNx5GTXp",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/01/v0001",
"title": "The Topology of Symmetric, Second-Order 3D Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/1997/01/v0001/13rRUILc8f6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/03/ttg2013030379",
"title": "A Time-Dependent Vector Field Topology Based on Streak Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2013/03/ttg2013030379/13rRUwI5TQY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/03/07286850",
"title": "Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold",
"doi": null,
"abstractUrl": "/journal/tg/2016/03/07286850/13rRUwhpBE8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0094",
"title": "Interactive Tensor Field Design and Visualization on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0094/13rRUxASuG8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06933942",
"title": "A Topologically-Informed Hyperstreamline Seeding Method for Alignment Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06933942/13rRUxly8XG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224154",
"title": "Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224154/1nV63QG11le",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552927",
"title": "Feature Curves and Surfaces of 3D Asymmetric Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552927/1xic6oeRxnO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440052",
"articleId": "17D45XDIXW9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440056",
"articleId": "17D45Wda7ea",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4QNDj7hmg",
"name": "ttg201901-08453873s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08453873s1.mp4",
"extension": "mp4",
"size": "17.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cG4IGNd2Y8",
"doi": "10.1109/TVCG.2019.2934314",
"abstract": "Asymmetric tensor fields have found applications in many science and engineering domains, such as fluid dynamics. Recent advances in the visualization and analysis of 2D asymmetric tensor fields focus on pointwise analysis of the tensor field and effective visualization metaphors such as colors, glyphs, and hyperstreamlines. In this paper, we provide a novel multi-scale topological analysis framework for asymmetric tensor fields on surfaces. Our multi-scale framework is based on the notions of eigenvalue and eigenvector graphs. At the core of our framework are the identification of atomic operations that modify the graphs and the scale definition that guides the order in which the graphs are simplified to enable clarity and focus for the visualization of topological analysis on data of different sizes. We also provide efficient algorithms to realize these operations. Furthermore, we provide physical interpretation of these graphs. To demonstrate the utility of our system, we apply our multi-scale analysis to data in computational fluid dynamics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Asymmetric tensor fields have found applications in many science and engineering domains, such as fluid dynamics. Recent advances in the visualization and analysis of 2D asymmetric tensor fields focus on pointwise analysis of the tensor field and effective visualization metaphors such as colors, glyphs, and hyperstreamlines. In this paper, we provide a novel multi-scale topological analysis framework for asymmetric tensor fields on surfaces. Our multi-scale framework is based on the notions of eigenvalue and eigenvector graphs. At the core of our framework are the identification of atomic operations that modify the graphs and the scale definition that guides the order in which the graphs are simplified to enable clarity and focus for the visualization of topological analysis on data of different sizes. We also provide efficient algorithms to realize these operations. Furthermore, we provide physical interpretation of these graphs. To demonstrate the utility of our system, we apply our multi-scale analysis to data in computational fluid dynamics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Asymmetric tensor fields have found applications in many science and engineering domains, such as fluid dynamics. Recent advances in the visualization and analysis of 2D asymmetric tensor fields focus on pointwise analysis of the tensor field and effective visualization metaphors such as colors, glyphs, and hyperstreamlines. In this paper, we provide a novel multi-scale topological analysis framework for asymmetric tensor fields on surfaces. Our multi-scale framework is based on the notions of eigenvalue and eigenvector graphs. At the core of our framework are the identification of atomic operations that modify the graphs and the scale definition that guides the order in which the graphs are simplified to enable clarity and focus for the visualization of topological analysis on data of different sizes. We also provide efficient algorithms to realize these operations. Furthermore, we provide physical interpretation of these graphs. To demonstrate the utility of our system, we apply our multi-scale analysis to data in computational fluid dynamics.",
"title": "Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces",
"normalizedTitle": "Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces",
"fno": "08805436",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Eigenvalues And Eigenfunctions",
"Tensors",
"Topology",
"Eigenvalue Graphs",
"Eigenvector Graphs",
"Visualization Metaphors",
"Multiscale Topological Analysis Framework",
"Multiscale Analysis",
"Asymmetric Tensor Fields",
"Eigenvalues And Eigenfunctions",
"Manifolds",
"Topology",
"Two Dimensional Displays",
"Data Visualization",
"Heuristic Algorithms",
"Tensor Field Visualization",
"Tensor Field Topology",
"2 D Asymmetric Tensor Fields",
"2 D Asymmetric Tensor Field Topology",
"Eigenvalue Graphs",
"Eigenvector Graphs"
],
"authors": [
{
"givenName": "Fariba",
"surname": "Khan",
"fullName": "Fariba Khan",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lawrence",
"surname": "Roy",
"fullName": "Lawrence Roy",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Botong",
"surname": "Qu",
"fullName": "Botong Qu",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shih-Hsuan",
"surname": "Hung",
"fullName": "Shih-Hsuan Hung",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Harry",
"surname": "Yeh",
"fullName": "Harry Yeh",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert S.",
"surname": "Laramee",
"fullName": "Robert S. Laramee",
"affiliation": "Swansea University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Zhang",
"fullName": "Yue Zhang",
"affiliation": "Oregon State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "270-279",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/01532770",
"title": "2D asymmetric tensor analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532770/12OmNCw3z9K",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346326",
"title": "The topology of symmetric, second-order tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346326/12OmNvxKu1Q",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532841",
"title": "Topological structures of 3D tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532841/12OmNx5GTXp",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/03/07286850",
"title": "Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold",
"doi": null,
"abstractUrl": "/journal/tg/2016/03/07286850/13rRUwhpBE8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/01/ttg2009010106",
"title": "Asymmetric Tensor Analysis for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2009/01/ttg2009010106/13rRUwjoNwW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06933942",
"title": "A Topologically-Informed Hyperstreamline Seeding Method for Alignment Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06933942/13rRUxly8XG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121979",
"title": "Asymmetric Tensor Field Visualization for Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121979/13rRUygT7fa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1993/04/mcg1993040025",
"title": "Visualizing Second-Order Tensor Fields with Hyperstreamlines",
"doi": null,
"abstractUrl": "/magazine/cg/1993/04/mcg1993040025/13rRUyv53HF",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224154",
"title": "Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224154/1nV63QG11le",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552927",
"title": "Feature Curves and Surfaces of 3D Asymmetric Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552927/1xic6oeRxnO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08805433",
"articleId": "1cG4Bp60IQU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08805446",
"articleId": "1cG4GkzNRPG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1fe9VmwVUAM",
"name": "ttg202001-08805436s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202001-08805436s1.zip",
"extension": "zip",
"size": "89.5 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": "1nV63QG11le",
"doi": "10.1109/TVCG.2020.3030431",
"abstract": "Mode surfaces are the generalization of degenerate curves and neutral surfaces, which constitute 3D symmetric tensor field topology. Efficient analysis and visualization of mode surfaces can provide additional insight into not only degenerate curves and neutral surfaces, but also how these features transition into each other. Moreover, the geometry and topology of mode surfaces can help domain scientists better understand the tensor fields in their applications. Existing mode surface extraction methods can miss features in the surfaces. Moreover, the mode surfaces extracted from neighboring cells have gaps, which make their subsequent analysis difficult. In this paper, we provide novel analysis on the topological structures of mode surfaces, including a common parameterization of all mode surfaces of a tensor field using 2D asymmetric tensors. This allows us to not only better understand the structures in mode surfaces and their interactions with degenerate curves and neutral surfaces, but also develop an efficient algorithm to seamlessly extract mode surfaces, including neutral surfaces. The seamless mode surfaces enable efficient analysis of their geometric structures, such as the principal curvature directions. We apply our analysis and visualization to a number of solid mechanics data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Mode surfaces are the generalization of degenerate curves and neutral surfaces, which constitute 3D symmetric tensor field topology. Efficient analysis and visualization of mode surfaces can provide additional insight into not only degenerate curves and neutral surfaces, but also how these features transition into each other. Moreover, the geometry and topology of mode surfaces can help domain scientists better understand the tensor fields in their applications. Existing mode surface extraction methods can miss features in the surfaces. Moreover, the mode surfaces extracted from neighboring cells have gaps, which make their subsequent analysis difficult. In this paper, we provide novel analysis on the topological structures of mode surfaces, including a common parameterization of all mode surfaces of a tensor field using 2D asymmetric tensors. This allows us to not only better understand the structures in mode surfaces and their interactions with degenerate curves and neutral surfaces, but also develop an efficient algorithm to seamlessly extract mode surfaces, including neutral surfaces. The seamless mode surfaces enable efficient analysis of their geometric structures, such as the principal curvature directions. We apply our analysis and visualization to a number of solid mechanics data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Mode surfaces are the generalization of degenerate curves and neutral surfaces, which constitute 3D symmetric tensor field topology. Efficient analysis and visualization of mode surfaces can provide additional insight into not only degenerate curves and neutral surfaces, but also how these features transition into each other. Moreover, the geometry and topology of mode surfaces can help domain scientists better understand the tensor fields in their applications. Existing mode surface extraction methods can miss features in the surfaces. Moreover, the mode surfaces extracted from neighboring cells have gaps, which make their subsequent analysis difficult. In this paper, we provide novel analysis on the topological structures of mode surfaces, including a common parameterization of all mode surfaces of a tensor field using 2D asymmetric tensors. This allows us to not only better understand the structures in mode surfaces and their interactions with degenerate curves and neutral surfaces, but also develop an efficient algorithm to seamlessly extract mode surfaces, including neutral surfaces. The seamless mode surfaces enable efficient analysis of their geometric structures, such as the principal curvature directions. We apply our analysis and visualization to a number of solid mechanics data sets.",
"title": "Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction",
"normalizedTitle": "Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction",
"fno": "09224154",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Data Analysis",
"Data Visualisation",
"Feature Extraction",
"Solid Modelling",
"Tensors",
"Topology",
"Neutral Surfaces",
"Seamless Mode Surfaces",
"Topological Analysis",
"Seamless Extraction",
"3 D Symmetric Tensor Field Topology",
"Mode Surfaces Visualization",
"Mode Surfaces Analysis",
"Tensors",
"Surface Treatment",
"Feature Extraction",
"Topology",
"Three Dimensional Displays",
"Faces",
"Two Dimensional Displays",
"Tensor Field Visualization",
"Tensor Field Topology",
"Traceless Tensors",
"Degenerate Curve Extraction",
"Neutral Surface Extraction",
"Mode Surface Extraction"
],
"authors": [
{
"givenName": "Botong",
"surname": "Qu",
"fullName": "Botong Qu",
"affiliation": "School of Electrical Engineering and Computer Science, Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lawrence",
"surname": "Roy",
"fullName": "Lawrence Roy",
"affiliation": "School of Electrical Engineering and Computer Science, Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Zhang",
"fullName": "Yue Zhang",
"affiliation": "School of Electrical Engineering and Computer Science, Oregon State University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "School of Electrical Engineering and Computer Science, Oregon State University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "583-592",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1994/6627/0/00346326",
"title": "The topology of symmetric, second-order tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346326/12OmNvxKu1Q",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532841",
"title": "Topological structures of 3D tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532841/12OmNx5GTXp",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660070",
"title": "Topological Structures of 3D Tensor Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660070/12OmNxeusY2",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/01/v0001",
"title": "The Topology of Symmetric, Second-Order 3D Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/1997/01/v0001/13rRUILc8f6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/04/v0395",
"title": "Topological Lines in 3D Tensor Fields and Discriminant Hessian Factorization",
"doi": null,
"abstractUrl": "/journal/tg/2005/04/v0395/13rRUIM2VGT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/03/07286850",
"title": "Feature Surfaces in Symmetric Tensor Fields Based on Eigenvalue Manifold",
"doi": null,
"abstractUrl": "/journal/tg/2016/03/07286850/13rRUwhpBE8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0094",
"title": "Interactive Tensor Field Design and Visualization on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0094/13rRUxASuG8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08453873",
"title": "Robust and Fast Extraction of 3D Symmetric Tensor Field Topology",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08453873/17D45WHONif",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805436",
"title": "Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805436/1cG4IGNd2Y8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552927",
"title": "Feature Curves and Surfaces of 3D Asymmetric Tensor Fields",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552927/1xic6oeRxnO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222093",
"articleId": "1nTrExzmT5e",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09216595",
"articleId": "1nJsMuACwtG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLddPzSMdW",
"name": "ttg202102-09224154s1-supp1-3030431.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09224154s1-supp1-3030431.pdf",
"extension": "pdf",
"size": "805 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyaf7",
"doi": "10.1109/TVCG.2017.2744198",
"abstract": "Visualizations often appear in multiples, either in a single display (e.g., small multiples, dashboard) or across time or space (e.g., slideshow, set of dashboards). However, existing visualization design guidelines typically focus on single rather than multiple views. Solely following these guidelines can lead to effective yet inconsistent views (e.g., the same field has different axes domains across charts), making interpretation slow and error-prone. Moreover, little is known how consistency balances with other design considerations, making it difficult to incorporate consistency mechanisms in visualization authoring software. We present a wizard-of-oz study in which we observed how Tableau users achieve and sacrifice consistency in an exploration-to-presentation visualization design scenario. We extend (from our prior work) a set of encoding-specific constraints defining consistency across multiple views. Using the constraints as a checklist in our study, we observed cases where participants spontaneously maintained consistent encodings and warned cases where consistency was overlooked. In response to the warnings, participants either revised views for consistency or stated why they thought consistency should be overwritten. We categorize participants' actions and responses as constraint validations and exceptions, depicting the relative importance of consistency and other design considerations under various circumstances (e.g., data cardinality, available encoding resources, chart layout). We discuss automatic consistency checking as a constraint-satisfaction problem and provide design implications for communicating inconsistencies to users.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualizations often appear in multiples, either in a single display (e.g., small multiples, dashboard) or across time or space (e.g., slideshow, set of dashboards). However, existing visualization design guidelines typically focus on single rather than multiple views. Solely following these guidelines can lead to effective yet inconsistent views (e.g., the same field has different axes domains across charts), making interpretation slow and error-prone. Moreover, little is known how consistency balances with other design considerations, making it difficult to incorporate consistency mechanisms in visualization authoring software. We present a wizard-of-oz study in which we observed how Tableau users achieve and sacrifice consistency in an exploration-to-presentation visualization design scenario. We extend (from our prior work) a set of encoding-specific constraints defining consistency across multiple views. Using the constraints as a checklist in our study, we observed cases where participants spontaneously maintained consistent encodings and warned cases where consistency was overlooked. In response to the warnings, participants either revised views for consistency or stated why they thought consistency should be overwritten. We categorize participants' actions and responses as constraint validations and exceptions, depicting the relative importance of consistency and other design considerations under various circumstances (e.g., data cardinality, available encoding resources, chart layout). We discuss automatic consistency checking as a constraint-satisfaction problem and provide design implications for communicating inconsistencies to users.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualizations often appear in multiples, either in a single display (e.g., small multiples, dashboard) or across time or space (e.g., slideshow, set of dashboards). However, existing visualization design guidelines typically focus on single rather than multiple views. Solely following these guidelines can lead to effective yet inconsistent views (e.g., the same field has different axes domains across charts), making interpretation slow and error-prone. Moreover, little is known how consistency balances with other design considerations, making it difficult to incorporate consistency mechanisms in visualization authoring software. We present a wizard-of-oz study in which we observed how Tableau users achieve and sacrifice consistency in an exploration-to-presentation visualization design scenario. We extend (from our prior work) a set of encoding-specific constraints defining consistency across multiple views. Using the constraints as a checklist in our study, we observed cases where participants spontaneously maintained consistent encodings and warned cases where consistency was overlooked. In response to the warnings, participants either revised views for consistency or stated why they thought consistency should be overwritten. We categorize participants' actions and responses as constraint validations and exceptions, depicting the relative importance of consistency and other design considerations under various circumstances (e.g., data cardinality, available encoding resources, chart layout). We discuss automatic consistency checking as a constraint-satisfaction problem and provide design implications for communicating inconsistencies to users.",
"title": "Keeping Multiple Views Consistent: Constraints, Validations, and Exceptions in Visualization Authoring",
"normalizedTitle": "Keeping Multiple Views Consistent: Constraints, Validations, and Exceptions in Visualization Authoring",
"fno": "08017651",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Encoding",
"Data Visualization",
"Image Color Analysis",
"Visualization",
"Adaptation Models",
"Color",
"Guidelines",
"Visualization Design",
"Qualitative Study",
"Evaluation"
],
"authors": [
{
"givenName": "Zening",
"surname": "Qu",
"fullName": "Zening Qu",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jessica",
"surname": "Hullman",
"fullName": "Jessica Hullman",
"affiliation": "University of Washington",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "468-477",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vissoft/2015/7526/0/07332432",
"title": "SMNLV: A small-multiples node-link visualization supporting software comprehension by displaying multiple relationships in software structure",
"doi": null,
"abstractUrl": "/proceedings-article/vissoft/2015/07332432/12OmNButpY0",
"parentPublication": {
"id": "proceedings/vissoft/2015/7526/0",
"title": "2015 IEEE 3rd Working Conference on Software Visualization (VISSOFT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chinagrid/2011/0885/0/06051738",
"title": "SyncViews: Toward Consistent User Views in Cloud-Based File Synchronization Services",
"doi": null,
"abstractUrl": "/proceedings-article/chinagrid/2011/06051738/12OmNqG0SPl",
"parentPublication": {
"id": "proceedings/chinagrid/2011/0885/0",
"title": "2011 Sixth Annual Chinagrid Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a057",
"title": "Enhancing Polymetric Views with Coarse-Grained Views",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a057/12OmNqJq4BA",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/models/2017/3492/0/3492a167",
"title": "Component and Connector Views in Practice: An Experience Report",
"doi": null,
"abstractUrl": "/proceedings-article/models/2017/3492a167/12OmNwl8GGu",
"parentPublication": {
"id": "proceedings/models/2017/3492/0",
"title": "2017 ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2013/2869/0/06671758",
"title": "Adaptive ghosted views for Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2013/06671758/12OmNxR5UID",
"parentPublication": {
"id": "proceedings/ismar/2013/2869/0",
"title": "2013 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2015/7343/0/07314298",
"title": "Interactive Visual Analysis of Browsing and Authoring Behaviors in Web Media",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314298/12OmNy2rS3N",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440856",
"title": "Face to Face: Evaluating Visual Comparison",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440856/17D45WnnFWl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600s8321",
"title": "StylizedNeRF: Consistent 3D Scene Stylization as Stylized NeRF via 2D-3D Mutual Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600s8321/1H0L3Z762gU",
"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/pacificvis/2019/9226/0/922600a001",
"title": "CorFish: Coordinating Emphasis Across Multiple Views Using Spatial Distortion",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2019/922600a001/1cMF6xDCFhu",
"parentPublication": {
"id": "proceedings/pacificvis/2019/9226/0",
"title": "2019 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222301",
"title": "The Effectiveness of Interactive Visualization Techniques for Time Navigation of Dynamic Graphs on Large Displays",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222301/1nTrDxA09TG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08019876",
"articleId": "13rRUzp02oy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017580",
"articleId": "13rRUxCitJk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgPY",
"name": "ttg201801-08017651s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017651s1.zip",
"extension": "zip",
"size": "12.7 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqg",
"title": "November/December",
"year": "2009",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfI0Q3",
"doi": "10.1109/TVCG.2009.152",
"abstract": "We present an interactive framework for exploring space-time and form-function relationships in experimentally collected high-resolution biomechanical data sets. These data describe complex 3D motions (e.g. chewing, walking, flying) performed by animals and humans and captured via high-speed imaging technologies, such as biplane fluoroscopy. In analyzing these 3D biomechanical motions, interactive 3D visualizations are important, in particular, for supporting spatial analysis. However, as researchers in information visualization have pointed out, 2D visualizations can also be effective tools for multi-dimensional data analysis, especially for identifying trends over time. Our approach, therefore, combines techniques from both 3D and 2D visualizations. Specifically, it utilizes a multi-view visualization strategy including a small multiples view of motion sequences, a parallel coordinates view, and detailed 3D inspection views. The resulting framework follows an overview first, zoom and filter, then details-on-demand style of analysis, and it explicitly targets a limitation of current tools, namely, supporting analysis and comparison at the level of a collection of motions rather than sequential analysis of a single or small number of motions. Scientific motion collections appropriate for this style of analysis exist in clinical work in orthopedics and physical rehabilitation, in the study of functional morphology within evolutionary biology, and in other contexts. An application is described based on a collaboration with evolutionary biologists studying the mechanics of chewing motions in pigs. Interactive exploration of data describing a collection of more than one hundred experimentally captured pig chewing cycles is described.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an interactive framework for exploring space-time and form-function relationships in experimentally collected high-resolution biomechanical data sets. These data describe complex 3D motions (e.g. chewing, walking, flying) performed by animals and humans and captured via high-speed imaging technologies, such as biplane fluoroscopy. In analyzing these 3D biomechanical motions, interactive 3D visualizations are important, in particular, for supporting spatial analysis. However, as researchers in information visualization have pointed out, 2D visualizations can also be effective tools for multi-dimensional data analysis, especially for identifying trends over time. Our approach, therefore, combines techniques from both 3D and 2D visualizations. Specifically, it utilizes a multi-view visualization strategy including a small multiples view of motion sequences, a parallel coordinates view, and detailed 3D inspection views. The resulting framework follows an overview first, zoom and filter, then details-on-demand style of analysis, and it explicitly targets a limitation of current tools, namely, supporting analysis and comparison at the level of a collection of motions rather than sequential analysis of a single or small number of motions. Scientific motion collections appropriate for this style of analysis exist in clinical work in orthopedics and physical rehabilitation, in the study of functional morphology within evolutionary biology, and in other contexts. An application is described based on a collaboration with evolutionary biologists studying the mechanics of chewing motions in pigs. Interactive exploration of data describing a collection of more than one hundred experimentally captured pig chewing cycles is described.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an interactive framework for exploring space-time and form-function relationships in experimentally collected high-resolution biomechanical data sets. These data describe complex 3D motions (e.g. chewing, walking, flying) performed by animals and humans and captured via high-speed imaging technologies, such as biplane fluoroscopy. In analyzing these 3D biomechanical motions, interactive 3D visualizations are important, in particular, for supporting spatial analysis. However, as researchers in information visualization have pointed out, 2D visualizations can also be effective tools for multi-dimensional data analysis, especially for identifying trends over time. Our approach, therefore, combines techniques from both 3D and 2D visualizations. Specifically, it utilizes a multi-view visualization strategy including a small multiples view of motion sequences, a parallel coordinates view, and detailed 3D inspection views. The resulting framework follows an overview first, zoom and filter, then details-on-demand style of analysis, and it explicitly targets a limitation of current tools, namely, supporting analysis and comparison at the level of a collection of motions rather than sequential analysis of a single or small number of motions. Scientific motion collections appropriate for this style of analysis exist in clinical work in orthopedics and physical rehabilitation, in the study of functional morphology within evolutionary biology, and in other contexts. An application is described based on a collaboration with evolutionary biologists studying the mechanics of chewing motions in pigs. Interactive exploration of data describing a collection of more than one hundred experimentally captured pig chewing cycles is described.",
"title": "Interactive Coordinated Multiple-View Visualization of Biomechanical Motion Data",
"normalizedTitle": "Interactive Coordinated Multiple-View Visualization of Biomechanical Motion Data",
"fno": "ttg2009061383",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Scientific Visualization",
"Information Visualization",
"Coordinated Multiple Views",
"Biomechanics"
],
"authors": [
{
"givenName": "Daniel",
"surname": "Keefe",
"fullName": "Daniel Keefe",
"affiliation": "University of Minnesota",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcus",
"surname": "Ewert",
"fullName": "Marcus Ewert",
"affiliation": "University of Minnesota",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William",
"surname": "Ribarsky",
"fullName": "William Ribarsky",
"affiliation": "University of North Carolina - Charlotte",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": "University of North Carolina - Charlotte",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1383-1390",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cmv/2007/2903/0/29030072",
"title": "Coordinated Multiple Views: a Critical View",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2007/29030072/12OmNBajTJq",
"parentPublication": {
"id": "proceedings/cmv/2007/2903/0",
"title": "Coordinated and Multiple Views in Exploratory Visualization, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660018",
"title": "VisTrails: Enabling Interactive Multiple-View Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660018/12OmNBscCZd",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790159",
"title": "Building Highly-Coordinated Visualizations in Improvise",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790159/12OmNqBtiFh",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmv/2007/2903/0/29030061",
"title": "State of the Art: Coordinated & Multiple Views in Exploratory Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2007/29030061/12OmNrGb2h5",
"parentPublication": {
"id": "proceedings/cmv/2007/2903/0",
"title": "Coordinated and Multiple Views in Exploratory Visualization, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2007/2900/0/29000156",
"title": "Coordinated and Multiple Views in Augmented Reality Environment",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2007/29000156/12OmNs4S8Jo",
"parentPublication": {
"id": "proceedings/iv/2007/2900/0",
"title": "2007 11th International Conference Information Visualization (IV '07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmv/2003/2001/0/20010095",
"title": "Coordinated Views in Dynamic Interactive Documents",
"doi": null,
"abstractUrl": "/proceedings-article/cmv/2003/20010095/12OmNy5R3zQ",
"parentPublication": {
"id": "proceedings/cmv/2003/2001/0",
"title": "Coordinated and Multiple Views in Exploratory Visualization, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a246",
"title": "Coordinated and Multiple Views for Visualizing Text Collections",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a246/12OmNzBwGtI",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446062",
"title": "Biomechanical Parameters Under Curvature Gains and Bending Gains in Redirected Walking",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446062/13bd1fKQxrR",
"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/2014/12/06876050",
"title": "MovExp: A Versatile Visualization Tool for Human-Computer Interaction Studies with 3D Performance and Biomechanical Data",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876050/13rRUxDqS8j",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2018/9269/0/926900a237",
"title": "Integrating Biomechanical and Animation Motion Capture Methods in the Production of Participant Specific, Scaled Avatars",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2018/926900a237/17D45XeKgqk",
"parentPublication": {
"id": "proceedings/aivr/2018/9269/0",
"title": "2018 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061375",
"articleId": "13rRUB6Sq0v",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061391",
"articleId": "13rRUwInvsI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRYX",
"name": "ttg2009061383s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061383s.zip",
"extension": "zip",
"size": "23.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZokWw73mo",
"doi": "10.1109/TVCG.2022.3209486",
"abstract": "Pictorial visualizations portray data with figurative messages and approximate the audience to the visualization. Previous research on pictorial visualizations has developed authoring tools or generation systems, but their methods are restricted to specific visualization types and templates. Instead, we propose to augment pictorial visualization authoring with visual style transfer, enabling a more extensible approach to visualization design. To explore this, our work presents Vistylist, a design support tool that disentangles the visual style of a source pictorial visualization from its content and transfers the visual style to one or more intended pictorial visualizations. We evaluated Vistylist through a survey of example pictorial visualizations, a controlled user study, and a series of expert interviews. The results of our evaluation indicated that Vistylist is useful for creating expressive and faithful pictorial visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Pictorial visualizations portray data with figurative messages and approximate the audience to the visualization. Previous research on pictorial visualizations has developed authoring tools or generation systems, but their methods are restricted to specific visualization types and templates. Instead, we propose to augment pictorial visualization authoring with visual style transfer, enabling a more extensible approach to visualization design. To explore this, our work presents Vistylist, a design support tool that disentangles the visual style of a source pictorial visualization from its content and transfers the visual style to one or more intended pictorial visualizations. We evaluated Vistylist through a survey of example pictorial visualizations, a controlled user study, and a series of expert interviews. The results of our evaluation indicated that Vistylist is useful for creating expressive and faithful pictorial visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Pictorial visualizations portray data with figurative messages and approximate the audience to the visualization. Previous research on pictorial visualizations has developed authoring tools or generation systems, but their methods are restricted to specific visualization types and templates. Instead, we propose to augment pictorial visualization authoring with visual style transfer, enabling a more extensible approach to visualization design. To explore this, our work presents Vistylist, a design support tool that disentangles the visual style of a source pictorial visualization from its content and transfers the visual style to one or more intended pictorial visualizations. We evaluated Vistylist through a survey of example pictorial visualizations, a controlled user study, and a series of expert interviews. The results of our evaluation indicated that Vistylist is useful for creating expressive and faithful pictorial visualizations.",
"title": "Supporting Expressive and Faithful Pictorial Visualization Design with Visual Style Transfer",
"normalizedTitle": "Supporting Expressive and Faithful Pictorial Visualization Design with Visual Style Transfer",
"fno": "09903511",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Authoring Systems",
"Data Visualisation",
"Design Support Tool",
"Pictorial Visualization Authoring",
"Pictorial Visualization Design",
"Vistylist",
"Visual Style Transfer",
"Data Visualization",
"Visualization",
"Interviews",
"Image Color Analysis",
"Artificial Intelligence",
"Libraries",
"Authoring Systems",
"Pictorial Visualization",
"Data Driven Design"
],
"authors": [
{
"givenName": "Yang",
"surname": "Shi",
"fullName": "Yang Shi",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pei",
"surname": "Liu",
"fullName": "Pei Liu",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siji",
"surname": "Chen",
"fullName": "Siji Chen",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mengdi",
"surname": "Sun",
"fullName": "Mengdi Sun",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nan",
"surname": "Cao",
"fullName": "Nan Cao",
"affiliation": "Intelligent Big Data Visualization Lab, Tongji University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "236-246",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031580",
"title": "Interaction+: Interaction enhancement for web-based visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031580/12OmNyQ7FJe",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875946",
"title": "Constructing Visual Representations: Investigating the Use of Tangible Tokens",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875946/13rRUwgQpDv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2018/6884/0/08634297",
"title": "Reflecting on the Evaluation of Visualization Authoring Systems : Position Paper",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2018/08634297/17D45VTRozT",
"parentPublication": {
"id": "proceedings/beliv/2018/6884/0",
"title": "2018 IEEE Evaluation and Beyond - Methodological Approaches for Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08444072",
"title": "Narvis: Authoring Narrative Slideshows for Introducing Data Visualization Designs",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08444072/17D45WnnFX7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/08/08611113",
"title": "MARVisT: Authoring Glyph-Based Visualization in Mobile Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2020/08/08611113/17D45Wuc367",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10081398",
"title": "How Does Automation Shape the Process of Narrative Visualization: A Survey of Tools",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10081398/1LRbRjcZeLK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807226",
"title": "Critical Reflections on Visualization Authoring Systems",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807226/1cG65OkeVu8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08809832",
"title": "Searching the Visual Style and Structure of D3 Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08809832/1cHEgg8WeNW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09035622",
"title": "LADV: Deep Learning Assisted Authoring of Dashboard Visualizations From Images and Sketches",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09035622/1iaeAO11H6o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09547737",
"title": "ChartStory: Automated Partitioning, Layout, and Captioning of Charts into Comic-Style Narratives",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09547737/1x9TL0bvSlq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09908523",
"articleId": "1HbapfvixQA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904484",
"articleId": "1H1ggMqzJUQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yF35QY24",
"name": "ttg202301-09903511s1-supp1-3209486.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903511s1-supp1-3209486.pdf",
"extension": "pdf",
"size": "114 kB",
"__typename": "WebExtraType"
},
{
"id": "1J9yEUWSzDi",
"name": "ttg202301-09903511s1-supp2-3209486.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903511s1-supp2-3209486.mp4",
"extension": "mp4",
"size": "50 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": "1KmyX4gJuMg",
"doi": "10.1109/TVCG.2023.3240356",
"abstract": "Multiple-view (MV) visualizations have become ubiquitous for visual communication and exploratory data visualization. However, most existing MV visualizations are designed for the desktop, which can be unsuitable for the continuously evolving displays of varying screen sizes. In this paper, we present a two-stage adaptation framework that supports the automated retargeting and semi-automated tailoring of a desktop MV visualization for rendering on devices with displays of varying sizes. First, we cast layout retargeting as an optimization problem and propose a simulated annealing technique that can automatically preserve the layout of multiple views. Second, we enable fine-tuning for the visual appearance of each view, using a rule-based auto configuration method complemented with an interactive interface for chart-oriented encoding adjustment. To demonstrate the feasibility and expressivity of our proposed approach, we present a gallery of MV visualizations that have been adapted from the desktop to small displays. We also report the result of a user study comparing visualizations generated using our approach with those by existing methods. The outcome indicates that the participants generally prefer visualizations generated using our approach and find them to be easier to use.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multiple-view (MV) visualizations have become ubiquitous for visual communication and exploratory data visualization. However, most existing MV visualizations are designed for the desktop, which can be unsuitable for the continuously evolving displays of varying screen sizes. In this paper, we present a two-stage adaptation framework that supports the automated retargeting and semi-automated tailoring of a desktop MV visualization for rendering on devices with displays of varying sizes. First, we cast layout retargeting as an optimization problem and propose a simulated annealing technique that can automatically preserve the layout of multiple views. Second, we enable fine-tuning for the visual appearance of each view, using a rule-based auto configuration method complemented with an interactive interface for chart-oriented encoding adjustment. To demonstrate the feasibility and expressivity of our proposed approach, we present a gallery of MV visualizations that have been adapted from the desktop to small displays. We also report the result of a user study comparing visualizations generated using our approach with those by existing methods. The outcome indicates that the participants generally prefer visualizations generated using our approach and find them to be easier to use.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multiple-view (MV) visualizations have become ubiquitous for visual communication and exploratory data visualization. However, most existing MV visualizations are designed for the desktop, which can be unsuitable for the continuously evolving displays of varying screen sizes. In this paper, we present a two-stage adaptation framework that supports the automated retargeting and semi-automated tailoring of a desktop MV visualization for rendering on devices with displays of varying sizes. First, we cast layout retargeting as an optimization problem and propose a simulated annealing technique that can automatically preserve the layout of multiple views. Second, we enable fine-tuning for the visual appearance of each view, using a rule-based auto configuration method complemented with an interactive interface for chart-oriented encoding adjustment. To demonstrate the feasibility and expressivity of our proposed approach, we present a gallery of MV visualizations that have been adapted from the desktop to small displays. We also report the result of a user study comparing visualizations generated using our approach with those by existing methods. The outcome indicates that the participants generally prefer visualizations generated using our approach and find them to be easier to use.",
"title": "Semi-Automatic Layout Adaptation for Responsive Multiple-View Visualization Design",
"normalizedTitle": "Semi-Automatic Layout Adaptation for Responsive Multiple-View Visualization Design",
"fno": "10029921",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Layout",
"Mobile Handsets",
"Bars",
"Stacking",
"Design Methodology",
"Layout Adaptation",
"Mobile Devices",
"Multiple View Visualization",
"Responsive Design"
],
"authors": [
{
"givenName": "Wei",
"surname": "Zeng",
"fullName": "Wei Zeng",
"affiliation": "Hong Kong University of Science and Technology (Guangzhou) and the Hong Kong University of Science and Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xi",
"surname": "Chen",
"fullName": "Xi Chen",
"affiliation": "Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yihan",
"surname": "Hou",
"fullName": "Yihan Hou",
"affiliation": "Hong Kong University of Science and Technology (Guangzhou) and the Hong Kong University of Science and Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lingdan",
"surname": "Shao",
"fullName": "Lingdan Shao",
"affiliation": "Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhe",
"surname": "Chu",
"fullName": "Zhe Chu",
"affiliation": "Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": "Tufts University, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1-15",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2013/12/ttg2013122396",
"title": "An Interaction Model for Visualizations Beyond The Desktop",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122396/13rRUxBa5nm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08443125",
"title": "Glanceable Visualization: Studies of Data Comparison Performance on Smartwatches",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08443125/17D45XDIXRv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icst/2022/6679/0/667900a140",
"title": "Automated Repair of Responsive Web Page Layouts",
"doi": null,
"abstractUrl": "/proceedings-article/icst/2022/667900a140/1E2wEvLyhA4",
"parentPublication": {
"id": "proceedings/icst/2022/6679/0",
"title": "2022 IEEE Conference on Software Testing, Verification and Validation (ICST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904451",
"title": "Multi-View Design Patterns and Responsive Visualization for Genomics Data",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904451/1H1gfVbEsiA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904883",
"title": "Effects of View Layout on Situated Analytics for Multiple-View Representations in Immersive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904883/1H2lc7qemsg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089446",
"title": "Graphical Perception for Immersive Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089446/1jIxfA3tlUk",
"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/ismar-adjunct/2020/7675/0/767500a184",
"title": "Effects of Augmented Content’s Placement and Size on User’s Search Experience in Extended Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2020/767500a184/1pBMk7KgZHy",
"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": "trans/tg/2022/01/09552592",
"title": "An Automated Approach to Reasoning About Task-Oriented Insights in Responsive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552592/1xic0SUdCNO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555491",
"title": "Semantic Snapping for Guided Multi-View Visualization Design",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555491/1xjQX1LHQJi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a324",
"title": "Towards In-situ Authoring of AR Visualizations with Mobile Devices",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a324/1yeQJrGq6WI",
"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": "10026499",
"articleId": "1KkXscJg6vm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10034833",
"articleId": "1KpxdALb4By",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1KnSrhDcDMk",
"name": "ttg555501-010029921s1-supp1-3240356.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010029921s1-supp1-3240356.mp4",
"extension": "mp4",
"size": "22.4 MB",
"__typename": "WebExtraType"
},
{
"id": "1KnSralSqXK",
"name": "ttg555501-010029921s1-supp2-3240356.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010029921s1-supp2-3240356.pdf",
"extension": "pdf",
"size": "3.69 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cG4w5XPNUQ",
"doi": "10.1109/TVCG.2019.2934284",
"abstract": "Visualizations often encode numeric data using sequential and diverging color ramps. Effective ramps use colors that are sufficiently discriminable, align well with the data, and are aesthetically pleasing. Designers rely on years of experience to create high-quality color ramps. However, it is challenging for novice visualization developers that lack this experience to craft effective ramps as most guidelines for constructing ramps are loosely defined qualitative heuristics that are often difficult to apply. Our goal is to enable visualization developers to readily create effective color encodings using a single seed color. We do this using an algorithmic approach that models designer practices by analyzing patterns in the structure of designer-crafted color ramps. We construct these models from a corpus of 222 expert-designed color ramps, and use the results to automatically generate ramps that mimic designer practices. We evaluate our approach through an empirical study comparing the outputs of our approach with designer-crafted color ramps. Our models produce ramps that support accurate and aesthetically pleasing visualizations at least as well as designer ramps and that outperform conventional mathematical approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualizations often encode numeric data using sequential and diverging color ramps. Effective ramps use colors that are sufficiently discriminable, align well with the data, and are aesthetically pleasing. Designers rely on years of experience to create high-quality color ramps. However, it is challenging for novice visualization developers that lack this experience to craft effective ramps as most guidelines for constructing ramps are loosely defined qualitative heuristics that are often difficult to apply. Our goal is to enable visualization developers to readily create effective color encodings using a single seed color. We do this using an algorithmic approach that models designer practices by analyzing patterns in the structure of designer-crafted color ramps. We construct these models from a corpus of 222 expert-designed color ramps, and use the results to automatically generate ramps that mimic designer practices. We evaluate our approach through an empirical study comparing the outputs of our approach with designer-crafted color ramps. Our models produce ramps that support accurate and aesthetically pleasing visualizations at least as well as designer ramps and that outperform conventional mathematical approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualizations often encode numeric data using sequential and diverging color ramps. Effective ramps use colors that are sufficiently discriminable, align well with the data, and are aesthetically pleasing. Designers rely on years of experience to create high-quality color ramps. However, it is challenging for novice visualization developers that lack this experience to craft effective ramps as most guidelines for constructing ramps are loosely defined qualitative heuristics that are often difficult to apply. Our goal is to enable visualization developers to readily create effective color encodings using a single seed color. We do this using an algorithmic approach that models designer practices by analyzing patterns in the structure of designer-crafted color ramps. We construct these models from a corpus of 222 expert-designed color ramps, and use the results to automatically generate ramps that mimic designer practices. We evaluate our approach through an empirical study comparing the outputs of our approach with designer-crafted color ramps. Our models produce ramps that support accurate and aesthetically pleasing visualizations at least as well as designer ramps and that outperform conventional mathematical approaches.",
"title": "Color Crafting: Automating the Construction of Designer Quality Color Ramps",
"normalizedTitle": "Color Crafting: Automating the Construction of Designer Quality Color Ramps",
"fno": "08805429",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Encoding",
"Novice Visualization Developers",
"Color Encodings",
"Seed Color",
"Color Crafting",
"Color Ramps",
"Algorithmic Approach",
"Image Color Analysis",
"Data Visualization",
"Encoding",
"Tools",
"Guidelines",
"Interpolation",
"Visualization",
"Aesthetics In Visualization",
"Color Perception",
"Visual Design",
"Design Mining"
],
"authors": [
{
"givenName": "Stephen",
"surname": "Smart",
"fullName": "Stephen Smart",
"affiliation": "University of Colorado Boulder",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Keke",
"surname": "Wu",
"fullName": "Keke Wu",
"affiliation": "University of Colorado Boulder",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danielle Albers",
"surname": "Szafir",
"fullName": "Danielle Albers Szafir",
"affiliation": "University of Colorado Boulder",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "1215-1225",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/nicoint/2016/2305/0/2305a143",
"title": "Using Color to Improve the Discrimination and Aesthetics of Treemaps",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2016/2305a143/12OmNrYlmIZ",
"parentPublication": {
"id": "proceedings/nicoint/2016/2305/0",
"title": "2016 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2014/4284/0/4284a122",
"title": "Color Transfer into Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2014/4284a122/12OmNxxvAKJ",
"parentPublication": {
"id": "proceedings/icdh/2014/4284/0",
"title": "2014 5th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a033",
"title": "Design Tool of Color Schemes on the CIELAB Space",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a033/12OmNzb7Zv0",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017604",
"title": "Modeling Color Difference for Visualization Design",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017604/13rRUB7a1fY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539386",
"title": "Colorgorical: Creating discriminable and preferable color palettes for information visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539386/13rRUxlgy3M",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440853",
"title": "Optimizing Color Assignment for Perception of Class Separability in Multiclass Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440853/17D45VTRoxJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08546328",
"title": "Deep Conditional Color Harmony Model for Image Aesthetic Assessment",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08546328/17D45WnnFUq",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/09714170",
"title": "Aesthetics++: Refining Graphic Designs by Exploring Design Principles and Human Preference",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09714170/1B0Y0ltSIfK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09969167",
"title": "Image-Driven Harmonious Color Palette Generation for Diverse Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09969167/1IMicNIXex2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2018/6882/0/08823597",
"title": "Color Interpolation for Non-Euclidean Color Spaces",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2018/08823597/1d5kylEtwxa",
"parentPublication": {
"id": "proceedings/scivis/2018/6882/0",
"title": "2018 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08805419",
"articleId": "1cG4zWCNpu0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08809846",
"articleId": "1cHEoEeTId2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1vDhWHXEYZW",
"title": "Sept.",
"year": "2021",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1iaeAO11H6o",
"doi": "10.1109/TVCG.2020.2980227",
"abstract": "Dashboard visualizations are widely used in data-intensive applications such as business intelligence, operation monitoring, and urban planning. However, existing visualization authoring tools are inefficient in the rapid prototyping of dashboards because visualization expertise and user intention need to be integrated. We propose a novel approach to rapid conceptualization that can construct dashboard templates from exemplars to mitigate the burden of designing, implementing, and evaluating dashboard visualizations. The kernel of our approach is a novel deep learning-based model that can identify and locate charts of various categories and extract colors from an input image or sketch. We design and implement a web-based authoring tool for learning, composing, and customizing dashboard visualizations in a cloud computing environment. Examples, user studies, and user feedback from real scenarios in Alibaba Cloud verify the usability and efficiency of the proposed approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Dashboard visualizations are widely used in data-intensive applications such as business intelligence, operation monitoring, and urban planning. However, existing visualization authoring tools are inefficient in the rapid prototyping of dashboards because visualization expertise and user intention need to be integrated. We propose a novel approach to rapid conceptualization that can construct dashboard templates from exemplars to mitigate the burden of designing, implementing, and evaluating dashboard visualizations. The kernel of our approach is a novel deep learning-based model that can identify and locate charts of various categories and extract colors from an input image or sketch. We design and implement a web-based authoring tool for learning, composing, and customizing dashboard visualizations in a cloud computing environment. Examples, user studies, and user feedback from real scenarios in Alibaba Cloud verify the usability and efficiency of the proposed approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Dashboard visualizations are widely used in data-intensive applications such as business intelligence, operation monitoring, and urban planning. However, existing visualization authoring tools are inefficient in the rapid prototyping of dashboards because visualization expertise and user intention need to be integrated. We propose a novel approach to rapid conceptualization that can construct dashboard templates from exemplars to mitigate the burden of designing, implementing, and evaluating dashboard visualizations. The kernel of our approach is a novel deep learning-based model that can identify and locate charts of various categories and extract colors from an input image or sketch. We design and implement a web-based authoring tool for learning, composing, and customizing dashboard visualizations in a cloud computing environment. Examples, user studies, and user feedback from real scenarios in Alibaba Cloud verify the usability and efficiency of the proposed approach.",
"title": "LADV: Deep Learning Assisted Authoring of Dashboard Visualizations From Images and Sketches",
"normalizedTitle": "LADV: Deep Learning Assisted Authoring of Dashboard Visualizations From Images and Sketches",
"fno": "09035622",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Authoring Systems",
"Cloud Computing",
"Data Visualisation",
"Deep Learning Artificial Intelligence",
"Deep Learning Assisted Authoring",
"Data Intensive Applications",
"Visualization Authoring Tools",
"Visualization Expertise",
"Dashboard Templates",
"Dashboard Visualizations",
"User Intention",
"Images",
"Sketches",
"Cloud Computing",
"Color Extraction",
"LADV",
"Tools",
"Data Visualization",
"Image Color Analysis",
"Visualization",
"Layout",
"Task Analysis",
"Rapid Prototyping",
"Dashboard Visualization",
"Visual Design",
"Stylization",
"Deep Learning Based"
],
"authors": [
{
"givenName": "Ruixian",
"surname": "Ma",
"fullName": "Ruixian Ma",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Honghui",
"surname": "Mei",
"fullName": "Honghui Mei",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huihua",
"surname": "Guan",
"fullName": "Huihua Guan",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Huang",
"fullName": "Wei Huang",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fan",
"surname": "Zhang",
"fullName": "Fan Zhang",
"affiliation": "Senseable City Lab, Massachusetts Institute of Technology, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chengye",
"surname": "Xin",
"fullName": "Chengye Xin",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenzhuo",
"surname": "Dai",
"fullName": "Wenzhuo Dai",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiao",
"surname": "Wen",
"fullName": "Xiao Wen",
"affiliation": "Alibaba Group, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Chen",
"fullName": "Wei Chen",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2021-09-01 00:00:00",
"pubType": "trans",
"pages": "3717-3732",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/1996/7668/0/76680021",
"title": "Rapid prototyping of information visualizations using VANISH",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/1996/76680021/12OmNwpXRUe",
"parentPublication": {
"id": "proceedings/ieee-infovis/1996/7668/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017651",
"title": "Keeping Multiple Views Consistent: Constraints, Validations, and Exceptions in Visualization Authoring",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017651/13rRUNvyaf7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903511",
"title": "Supporting Expressive and Faithful Pictorial Visualization Design with Visual Style Transfer",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903511/1GZokWw73mo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903550",
"title": "Dashboard Design Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903550/1GZolSVvsPu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09911200",
"title": "MEDLEY: Intent-based Recommendations to Support Dashboard Composition<sc/>",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09911200/1Hcjm0PMkgw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09912366",
"title": "Towards Natural Language-Based Visualization Authoring",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09912366/1HeiWkRN3tC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10057994",
"title": "Dashboard Design Mining and Recommendation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10057994/1LbFmG2HHnW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222038",
"title": "Kyrix-S: Authoring Scalable Scatterplot Visualizations of Big Data",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222038/1nTq1lYLbEY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222335",
"title": "PlotThread: Creating Expressive Storyline Visualizations using Reinforcement Learning",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222335/1nTqzC75UfS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a324",
"title": "Towards In-situ Authoring of AR Visualizations with Mobile Devices",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a324/1yeQJrGq6WI",
"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": "09444198",
"articleId": "1tYnZDWXIvC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09040672",
"articleId": "1iiwYJULFF6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzl3WVX",
"title": "Nov.",
"year": "2014",
"issueNum": "11",
"idPrefix": "tk",
"pubType": "journal",
"volume": "26",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz4R",
"doi": "10.1109/TKDE.2014.2313866",
"abstract": "In some real world applications, like information retrieval and data classification, we often are confronted with the situation that the same semantic concept can be expressed using different views with similar information. Thus, how to obtain a certain Semantically Consistent Patterns (SCP) for cross-view data, which embeds the complementary information from different views, is of great importance for those applications. However, the heterogeneity among cross-view representations brings a significant challenge on mining the SCP. In this paper, we propose a general framework to discover the SCP for cross-view data. Specifically, aiming at building a feature-isomorphic space among different views, a novel Isomorphic Relevant Redundant Transformation (IRRT) isfirst proposed. The IRRT linearly maps multiple heterogeneous low-level feature spaces to a high-dimensional redundantfeature-isomorphic one, which we name as mid-level space. Thus, much more complementary information from different views can be captured. Furthermore, to mine the semantic consistency among the isomorphic representations in the mid-level space, we propose a new Correlation-based Joint Feature Learning (CJFL) model to extract a unique high-level semantic subspace shared across the feature-isomorphic data. Consequently, the SCP for cross-view data can be obtained. Comprehensive experiments on three data sets demonstrate the advantages of our framework in classification and retrieval.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In some real world applications, like information retrieval and data classification, we often are confronted with the situation that the same semantic concept can be expressed using different views with similar information. Thus, how to obtain a certain Semantically Consistent Patterns (SCP) for cross-view data, which embeds the complementary information from different views, is of great importance for those applications. However, the heterogeneity among cross-view representations brings a significant challenge on mining the SCP. In this paper, we propose a general framework to discover the SCP for cross-view data. Specifically, aiming at building a feature-isomorphic space among different views, a novel Isomorphic Relevant Redundant Transformation (IRRT) isfirst proposed. The IRRT linearly maps multiple heterogeneous low-level feature spaces to a high-dimensional redundantfeature-isomorphic one, which we name as mid-level space. Thus, much more complementary information from different views can be captured. Furthermore, to mine the semantic consistency among the isomorphic representations in the mid-level space, we propose a new Correlation-based Joint Feature Learning (CJFL) model to extract a unique high-level semantic subspace shared across the feature-isomorphic data. Consequently, the SCP for cross-view data can be obtained. Comprehensive experiments on three data sets demonstrate the advantages of our framework in classification and retrieval.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In some real world applications, like information retrieval and data classification, we often are confronted with the situation that the same semantic concept can be expressed using different views with similar information. Thus, how to obtain a certain Semantically Consistent Patterns (SCP) for cross-view data, which embeds the complementary information from different views, is of great importance for those applications. However, the heterogeneity among cross-view representations brings a significant challenge on mining the SCP. In this paper, we propose a general framework to discover the SCP for cross-view data. Specifically, aiming at building a feature-isomorphic space among different views, a novel Isomorphic Relevant Redundant Transformation (IRRT) isfirst proposed. The IRRT linearly maps multiple heterogeneous low-level feature spaces to a high-dimensional redundantfeature-isomorphic one, which we name as mid-level space. Thus, much more complementary information from different views can be captured. Furthermore, to mine the semantic consistency among the isomorphic representations in the mid-level space, we propose a new Correlation-based Joint Feature Learning (CJFL) model to extract a unique high-level semantic subspace shared across the feature-isomorphic data. Consequently, the SCP for cross-view data can be obtained. Comprehensive experiments on three data sets demonstrate the advantages of our framework in classification and retrieval.",
"title": "Mining Semantically Consistent Patterns for Cross-View Data",
"normalizedTitle": "Mining Semantically Consistent Patterns for Cross-View Data",
"fno": "06778788",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Feature Extraction",
"Semantics",
"Data Mining",
"Correlation",
"Noise Measurement",
"Joints",
"Data Models",
"Dimensionality Reduction",
"Cross View",
"Cross Media",
"Shared Subspace Learning",
"Heterogeneous Data"
],
"authors": [
{
"givenName": "Lei",
"surname": "Zhang",
"fullName": "Lei Zhang",
"affiliation": "Institute of Information Science, Beijing Jiaotong University, Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yao",
"surname": "Zhao",
"fullName": "Yao Zhao",
"affiliation": "State Key Laboratory of Rail Traffic Control and Safety, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhenfeng",
"surname": "Zhu",
"fullName": "Zhenfeng Zhu",
"affiliation": "Institute of Information Science, Beijing Jiaotong University, Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shikui",
"surname": "Wei",
"fullName": "Shikui Wei",
"affiliation": "Institute of Information Science, Beijing Jiaotong University, Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xindong",
"surname": "Wu",
"fullName": "Xindong Wu",
"affiliation": "Department of Computer Science, University of Vermont, 33 Colchester Avenue, Burlington, VT",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2014-11-01 00:00:00",
"pubType": "trans",
"pages": "2745-2758",
"year": "2014",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2016/8851/0/8851e847",
"title": "Multi-view Deep Network for Cross-View Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851e847/12OmNBpmDC1",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c649",
"title": "Cross-View Action Modeling, Learning, and Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c649/12OmNyOHFZT",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/07/08253467",
"title": "Multi-View Missing Data Completion",
"doi": null,
"abstractUrl": "/journal/tk/2018/07/08253467/13rRUxbTMzu",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900e700",
"title": "Multi-view Multi-label Canonical Correlation Analysis for Cross-modal Matching and Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900e700/1G57a4EZ0kg",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600n3750",
"title": "Cross-view Transformers for real-time Map-view Semantic Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600n3750/1H1jbqP6wmI",
"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/2022/10/09312467",
"title": "Cross-View Locality Preserved Diversity and Consensus Learning for Multi-View Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tk/2022/10/09312467/1q2gqKhKhP2",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2021/3864/0/09428184",
"title": "Cross-View Equivariant Auto-Encoder",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428184/1uilQ2tED6w",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2021/3864/0/09428284",
"title": "Learning Factorized Cross-View Fusion for Multi-View Crowd Counting",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2021/09428284/1uilYi6cAKc",
"parentPublication": {
"id": "proceedings/icme/2021/3864/0",
"title": "2021 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555226",
"title": "SightBi: Exploring Cross-View Data Relationships with Biclusters",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555226/1xjQVmm2wE0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900a557",
"title": "Cross-View Cross-Scene Multi-View Crowd Counting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900a557/1yeKfeZSsXC",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06763043",
"articleId": "13rRUyYSWtf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06720117",
"articleId": "13rRUIM2VC7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvGPE8n",
"title": "Jan.",
"year": "2016",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz9T",
"doi": "10.1109/TVCG.2015.2467813",
"abstract": "Identifying coordinated relationships is an important task in data analytics. For example, an intelligence analyst might want to discover three suspicious people who all visited the same four cities. Existing techniques that display individual relationships, such as between lists of entities, require repetitious manual selection and significant mental aggregation in cluttered visualizations to find coordinated relationships. In this paper, we present BiSet, a visual analytics technique to support interactive exploration of coordinated relationships. In BiSet, we model coordinated relationships as biclusters and algorithmically mine them from a dataset. Then, we visualize the biclusters in context as bundled edges between sets of related entities. Thus, bundles enable analysts to infer task-oriented semantic insights about potentially coordinated activities. We make bundles as first class objects and add a new layer, “in-between”, to contain these bundle objects. Based on this, bundles serve to organize entities represented in lists and visually reveal their membership. Users can interact with edge bundles to organize related entities, and vice versa, for sensemaking purposes. With a usage scenario, we demonstrate how BiSet supports the exploration of coordinated relationships in text analytics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Identifying coordinated relationships is an important task in data analytics. For example, an intelligence analyst might want to discover three suspicious people who all visited the same four cities. Existing techniques that display individual relationships, such as between lists of entities, require repetitious manual selection and significant mental aggregation in cluttered visualizations to find coordinated relationships. In this paper, we present BiSet, a visual analytics technique to support interactive exploration of coordinated relationships. In BiSet, we model coordinated relationships as biclusters and algorithmically mine them from a dataset. Then, we visualize the biclusters in context as bundled edges between sets of related entities. Thus, bundles enable analysts to infer task-oriented semantic insights about potentially coordinated activities. We make bundles as first class objects and add a new layer, “in-between”, to contain these bundle objects. Based on this, bundles serve to organize entities represented in lists and visually reveal their membership. Users can interact with edge bundles to organize related entities, and vice versa, for sensemaking purposes. With a usage scenario, we demonstrate how BiSet supports the exploration of coordinated relationships in text analytics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Identifying coordinated relationships is an important task in data analytics. For example, an intelligence analyst might want to discover three suspicious people who all visited the same four cities. Existing techniques that display individual relationships, such as between lists of entities, require repetitious manual selection and significant mental aggregation in cluttered visualizations to find coordinated relationships. In this paper, we present BiSet, a visual analytics technique to support interactive exploration of coordinated relationships. In BiSet, we model coordinated relationships as biclusters and algorithmically mine them from a dataset. Then, we visualize the biclusters in context as bundled edges between sets of related entities. Thus, bundles enable analysts to infer task-oriented semantic insights about potentially coordinated activities. We make bundles as first class objects and add a new layer, “in-between”, to contain these bundle objects. Based on this, bundles serve to organize entities represented in lists and visually reveal their membership. Users can interact with edge bundles to organize related entities, and vice versa, for sensemaking purposes. With a usage scenario, we demonstrate how BiSet supports the exploration of coordinated relationships in text analytics.",
"title": "BiSet: Semantic Edge Bundling with Biclusters for Sensemaking",
"normalizedTitle": "BiSet: Semantic Edge Bundling with Biclusters for Sensemaking",
"fno": "07192715",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Layout",
"Semantics",
"Image Edge Detection",
"Cities And Towns",
"Encoding",
"Clutter",
"Semantic Edge Bundling",
"Bicluster",
"Coordinated Relationship",
"Semantic Edge Bundling",
"Bicluster",
"Coordinated Relationship"
],
"authors": [
{
"givenName": "Maoyuan",
"surname": "Sun",
"fullName": "Maoyuan Sun",
"affiliation": "Department of Computer Science, Discovery Analytics Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peng",
"surname": "Mi",
"fullName": "Peng Mi",
"affiliation": "Department of Computer Science, Discovery Analytics Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chris",
"surname": "North",
"fullName": "Chris North",
"affiliation": "Department of Computer Science, Discovery Analytics Center",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Naren",
"surname": "Ramakrishnan",
"fullName": "Naren Ramakrishnan",
"affiliation": "Department of Computer Science, Discovery Analytics Center",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "310-319",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2010/7846/0/05571226",
"title": "An Application of Edge Bundling Techniques to the Visualization of Media Analysis Results",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571226/12OmNAThXUv",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571244",
"title": "3D Edge Bundling for Geographical Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571244/12OmNqzu6LL",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2013/4797/0/06596126",
"title": "Smooth bundling of large streaming and sequence graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596126/12OmNscfI0r",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742389",
"title": "Multilevel agglomerative edge bundling for visualizing large graphs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742389/12OmNxj233Y",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875974",
"title": "A Five-Level Design Framework for Bicluster Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875974/13rRUB6Sq0A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061277",
"title": "Geometry-Based Edge Clustering for Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061277/13rRUNvyakF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539373",
"title": "Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539373/13rRUwcS1CZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017581",
"title": "BiDots: Visual Exploration of Weighted Biclusters",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017581/13rRUxASuAA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/10/08423100",
"title": "The Effect of Edge Bundling and Seriation on Sensemaking of Biclusters in Bipartite Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2019/10/08423100/1d3e5UbWqis",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552919",
"title": "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552919/1xibXgJW32U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07192669",
"articleId": "13rRUxjQyvn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07194832",
"articleId": "13rRUxBJhFA",
"__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": "1vQzkzRdSWk",
"doi": "10.1109/TVCG.2021.3102966",
"abstract": "Due to the scale of data and the complexity of analysis tasks, insight discovery often requires coordinating multiple visualizations (views), with each view displaying different parts of data or the same data from different perspectives. For example, to analyze car sales records, a marketing analyst uses a line chart to visualize the trend of car sales, a scatterplot to inspect the price and horsepower of different cars, and a matrix to compare the transaction amounts in types of deals. To explore related information across multiple views, current visual analysis tools heavily rely on brushing and linking techniques, which may require a significant amount of user effort (e.g., many trial-and-error attempts). There may be other efficient and effective ways of displaying cross-view data relationships to support data analysis with multiple views, but currently there are no guidelines to address this design challenge. In this article, we present systematic design considerations for visualizing cross-view data relationships, which leverages <italic>descriptive aspects</italic> of relationships and <italic>usable visual context</italic> of multi-view visualizations. We discuss pros and cons of different designs for showing cross-view data relationships, and provide a set of recommendations for helping practitioners make design decisions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Due to the scale of data and the complexity of analysis tasks, insight discovery often requires coordinating multiple visualizations (views), with each view displaying different parts of data or the same data from different perspectives. For example, to analyze car sales records, a marketing analyst uses a line chart to visualize the trend of car sales, a scatterplot to inspect the price and horsepower of different cars, and a matrix to compare the transaction amounts in types of deals. To explore related information across multiple views, current visual analysis tools heavily rely on brushing and linking techniques, which may require a significant amount of user effort (e.g., many trial-and-error attempts). There may be other efficient and effective ways of displaying cross-view data relationships to support data analysis with multiple views, but currently there are no guidelines to address this design challenge. In this article, we present systematic design considerations for visualizing cross-view data relationships, which leverages <italic>descriptive aspects</italic> of relationships and <italic>usable visual context</italic> of multi-view visualizations. We discuss pros and cons of different designs for showing cross-view data relationships, and provide a set of recommendations for helping practitioners make design decisions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Due to the scale of data and the complexity of analysis tasks, insight discovery often requires coordinating multiple visualizations (views), with each view displaying different parts of data or the same data from different perspectives. For example, to analyze car sales records, a marketing analyst uses a line chart to visualize the trend of car sales, a scatterplot to inspect the price and horsepower of different cars, and a matrix to compare the transaction amounts in types of deals. To explore related information across multiple views, current visual analysis tools heavily rely on brushing and linking techniques, which may require a significant amount of user effort (e.g., many trial-and-error attempts). There may be other efficient and effective ways of displaying cross-view data relationships to support data analysis with multiple views, but currently there are no guidelines to address this design challenge. In this article, we present systematic design considerations for visualizing cross-view data relationships, which leverages descriptive aspects of relationships and usable visual context of multi-view visualizations. We discuss pros and cons of different designs for showing cross-view data relationships, and provide a set of recommendations for helping practitioners make design decisions.",
"title": "Towards Systematic Design Considerations for Visualizing Cross-View Data Relationships",
"normalizedTitle": "Towards Systematic Design Considerations for Visualizing Cross-View Data Relationships",
"fno": "09508898",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Car Sales Records",
"Current Visual Analysis Tools",
"Data Analysis",
"Different Cars",
"Multiple Visualizations",
"Multiview Visualizations",
"Towards Systematic Design Considerations",
"Usable Visual Context",
"Visualizing Cross View Data Relationships",
"Visualization",
"Data Visualization",
"Visual Analytics",
"Systematics",
"Periodic Structures",
"Computer Science",
"Cross View Data Relationship",
"Multiple Views",
"Visual Analytics"
],
"authors": [
{
"givenName": "Maoyuan",
"surname": "Sun",
"fullName": "Maoyuan Sun",
"affiliation": "Department of Computer Science, Northern Illinois University, DeKalb, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Akhil",
"surname": "Namburi",
"fullName": "Akhil Namburi",
"affiliation": "Department of Computer Science, Northern Illinois University, DeKalb, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Koop",
"fullName": "David Koop",
"affiliation": "Department of Computer Science, Northern Illinois University, DeKalb, IL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Zhao",
"fullName": "Jian Zhao",
"affiliation": "School of Computer Science, University of Waterloo, Waterloo, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tianyi",
"surname": "Li",
"fullName": "Tianyi Li",
"affiliation": "Department of Computer Information Technology, Purdue University, West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haeyong",
"surname": "Chung",
"fullName": "Haeyong Chung",
"affiliation": "Department of Computer Science, University of Alabama in Huntsville, Huntsville, AL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4741-4756",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2015/6879/0/07156373",
"title": "VisMOOC: Visualizing video clickstream data from Massive Open Online Courses",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156373/12OmNxEBzlW",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2014/6227/0/07042523",
"title": "Visualizing statistical analysis of curve datasets in ParaView",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042523/12OmNyen1mx",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csmr/2012/4666/0/4666a541",
"title": "Visualizing Arrays in the Eclipse Java IDE",
"doi": null,
"abstractUrl": "/proceedings-article/csmr/2012/4666a541/12OmNzwZ6yK",
"parentPublication": {
"id": "proceedings/csmr/2012/4666/0",
"title": "2012 16th European Conference on Software Maintenance and Reengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09729550",
"title": "Visual Exploration of Relationships and Structure in Low-Dimensional Embeddings",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09729550/1Bya8LDahDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/5555/01/09915364",
"title": "IEEE VAST Challenge 2021 Winner: Visual Analytics for Spatial-Temporal Situation Awareness",
"doi": null,
"abstractUrl": "/magazine/cg/5555/01/09915364/1HmgsIIjwsg",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a105",
"title": "Toward Systematic Design Considerations of Organizing Multiple Views",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a105/1J6hb8c5Zde",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a110",
"title": "Toward Systematic Considerations of Missingness in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a110/1J6heLU2nNS",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300h504",
"title": "Learning Relationships for Multi-View 3D Object Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h504/1hVldkkuBAA",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/10/09382844",
"title": "Interactive Visual Exploration of Longitudinal Historical Career Mobility Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/10/09382844/1saZr0JHX5C",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555226",
"title": "SightBi: Exploring Cross-View Data Relationships with Biclusters",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555226/1xjQVmm2wE0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09507307",
"articleId": "1vNfMtUqgda",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09511808",
"articleId": "1vYRHccYKDS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAPBbfM",
"title": "Oct.",
"year": "2019",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB7a1g4",
"doi": "10.1109/TVCG.2018.2864283",
"abstract": "We introduce a new method to efficiently track complex interfaces among multi-phase immiscible fluids. Unlike existing techniques, we use a mesh-based representation for global liquid surfaces while selectively modeling some local surficial regions with regional level sets (RLS) to handle complex geometries that are difficult to resolve with explicit topology operations. Such a semi-explicit surface mechanism can preserve volume, fine features and foam-like thin films under a relatively low computational expenditure. Our method processes the surface evolution by sampling the fluid domain onto a spectrally refined grid (SRG) and performs efficient grid scanning, generalized interpolations and topology operations on the basis of this grid structure. For the RLS surface part, we propose an accurate advection scheme targeted at SRG. For the explicit mesh part, we develop a fast grid-scanning technique to voxelize the meshes and introduce novel strategies to detect grid cells that contain inconsistent mesh components. A robust algorithm is proposed to construct consistent local meshes to resolve mesh penetrations, and handle the coupling between explicit mesh and RLS surficial regions. We also provide further improvement on handling complicated topological variations, and strategies for remeshing mesh/RLS interconversions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce a new method to efficiently track complex interfaces among multi-phase immiscible fluids. Unlike existing techniques, we use a mesh-based representation for global liquid surfaces while selectively modeling some local surficial regions with regional level sets (RLS) to handle complex geometries that are difficult to resolve with explicit topology operations. Such a semi-explicit surface mechanism can preserve volume, fine features and foam-like thin films under a relatively low computational expenditure. Our method processes the surface evolution by sampling the fluid domain onto a spectrally refined grid (SRG) and performs efficient grid scanning, generalized interpolations and topology operations on the basis of this grid structure. For the RLS surface part, we propose an accurate advection scheme targeted at SRG. For the explicit mesh part, we develop a fast grid-scanning technique to voxelize the meshes and introduce novel strategies to detect grid cells that contain inconsistent mesh components. A robust algorithm is proposed to construct consistent local meshes to resolve mesh penetrations, and handle the coupling between explicit mesh and RLS surficial regions. We also provide further improvement on handling complicated topological variations, and strategies for remeshing mesh/RLS interconversions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce a new method to efficiently track complex interfaces among multi-phase immiscible fluids. Unlike existing techniques, we use a mesh-based representation for global liquid surfaces while selectively modeling some local surficial regions with regional level sets (RLS) to handle complex geometries that are difficult to resolve with explicit topology operations. Such a semi-explicit surface mechanism can preserve volume, fine features and foam-like thin films under a relatively low computational expenditure. Our method processes the surface evolution by sampling the fluid domain onto a spectrally refined grid (SRG) and performs efficient grid scanning, generalized interpolations and topology operations on the basis of this grid structure. For the RLS surface part, we propose an accurate advection scheme targeted at SRG. For the explicit mesh part, we develop a fast grid-scanning technique to voxelize the meshes and introduce novel strategies to detect grid cells that contain inconsistent mesh components. A robust algorithm is proposed to construct consistent local meshes to resolve mesh penetrations, and handle the coupling between explicit mesh and RLS surficial regions. We also provide further improvement on handling complicated topological variations, and strategies for remeshing mesh/RLS interconversions.",
"title": "A Semi-Explicit Surface Tracking Mechanism for Multi-Phase Immiscible Liquids",
"normalizedTitle": "A Semi-Explicit Surface Tracking Mechanism for Multi-Phase Immiscible Liquids",
"fno": "08428445",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Computational Geometry",
"Flow Simulation",
"Interpolation",
"Mesh Generation",
"Topology",
"Two Phase Flow",
"Semiexplicit Surface Tracking Mechanism",
"Grid Scanning Technique",
"Complicated Topological Variations",
"Mesh Penetrations",
"Consistent Local Meshes",
"Inconsistent Mesh Components",
"Grid Cells",
"Explicit Mesh Part",
"Grid Structure",
"Generalized Interpolations",
"SRG",
"Spectrally Refined Grid",
"Fluid Domain",
"Surface Evolution",
"Relatively Low Computational Expenditure",
"Foam Like Thin Films",
"Fine Features",
"Explicit Topology Operations",
"Complex Geometries",
"Regional Level Sets",
"Local Surficial Regions",
"Global Liquid Surfaces",
"Mesh Based Representation",
"Multiphase Immiscible Fluids",
"Complex Interfaces",
"Multiphase Immiscible Liquids",
"Liquids",
"Computational Modeling",
"Surface Treatment",
"Level Set",
"Topology",
"Surface Reconstruction",
"Surface Waves",
"Surface Tracking",
"Explicit Mesh",
"Remeshing",
"Regional Level Set",
"Multi Material",
"Spectrally Refined Grid"
],
"authors": [
{
"givenName": "Meng",
"surname": "Yang",
"fullName": "Meng Yang",
"affiliation": "Amazon.com Inc., Seattle, WA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juntao",
"surname": "Ye",
"fullName": "Juntao Ye",
"affiliation": "National Laboratory of Pattern Recognition (NLPR), Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Frank",
"surname": "Ding",
"fullName": "Frank Ding",
"affiliation": "Light Chaser Animation Inc., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yubo",
"surname": "Zhang",
"fullName": "Yubo Zhang",
"affiliation": "nVidia, Santa Clara, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong-Ming",
"surname": "Yan",
"fullName": "Dong-Ming Yan",
"affiliation": "National Laboratory of Pattern Recognition (NLPR), Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2019-10-01 00:00:00",
"pubType": "trans",
"pages": "2873-2885",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ccats/2015/8211/0/8211a086",
"title": "Surface Roughness Measurement Application Using Multi-frame Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/ccats/2015/8211a086/12OmNvT2pgA",
"parentPublication": {
"id": "proceedings/ccats/2015/8211/0",
"title": "2015 International Conference on Computer Application Technologies (CCATS)",
"__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/ecmsm/2015/6972/0/07208696",
"title": "Drop movement analysis on inclined surface for the adhesion coefficient determination",
"doi": null,
"abstractUrl": "/proceedings-article/ecmsm/2015/07208696/12OmNyfdOTd",
"parentPublication": {
"id": "proceedings/ecmsm/2015/6972/0",
"title": "2015 IEEE International Workshop of Electronics, Control, Measurement, Signals and their application to Mechatronics (ECMSM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2016/0811/0/0811a012",
"title": "Surface Tension and Wettability Modeling for Flowing Liquids",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2016/0811a012/12OmNyuya8j",
"parentPublication": {
"id": "proceedings/cgiv/2016/0811/0",
"title": "2016 13th International Conference on Computer Graphics, Imaging and Visualization (CGiV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2014/7000/2/7000b082",
"title": "Surface Detection Using Round Cut",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2014/7000b082/12OmNywfKA7",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/01/mcg2015010074",
"title": "Toward Better Surface Tracking for Fluid Simulation",
"doi": null,
"abstractUrl": "/magazine/cg/2015/01/mcg2015010074/13rRUILLkG7",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/08/07239614",
"title": "Multiphase Interface Tracking with Fast Semi-Lagrangian Contouring",
"doi": null,
"abstractUrl": "/journal/tg/2016/08/07239614/13rRUwInvfd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/06/06658744",
"title": "Surface Meshing with Curvature Convergence",
"doi": null,
"abstractUrl": "/journal/tg/2014/06/06658744/13rRUwwaKt8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2016/02/07358132",
"title": "On Frictional Forces between the Finger and a Textured Surface during Active Touch",
"doi": null,
"abstractUrl": "/journal/th/2016/02/07358132/13rRUxZzAhO",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600n3801",
"title": "Image Based Reconstruction of Liquids from 2D Surface Detections",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600n3801/1H0LsB06x7q",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "08438908",
"articleId": "13rRUyfKIHV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i4pA3AlCzS",
"name": "ttg201910-08428445s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201910-08428445s1.mp4",
"extension": "mp4",
"size": "112 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyPQ4Dx",
"title": "Dec.",
"year": "2012",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwd9CG1",
"doi": "10.1109/TVCG.2012.211",
"abstract": "Integral flow surfaces constitute a widely used flow visualization tool due to their capability to convey important flow information such as fluid transport, mixing, and domain segmentation. Current flow surface rendering techniques limit their expressiveness, however, by focusing virtually exclusively on displacement visualization, visually neglecting the more complex notion of deformation such as shearing and stretching that is central to the field of continuum mechanics. To incorporate this information into the flow surface visualization and analysis process, we derive a metric tensor field that encodes local surface deformations as induced by the velocity gradient of the underlying flow field. We demonstrate how properties of the resulting metric tensor field are capable of enhancing present surface visualization and generation methods and develop novel surface querying, sampling, and visualization techniques. The provided results show how this step towards unifying classic flow visualization and more advanced concepts from continuum mechanics enables more detailed and improved flow analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Integral flow surfaces constitute a widely used flow visualization tool due to their capability to convey important flow information such as fluid transport, mixing, and domain segmentation. Current flow surface rendering techniques limit their expressiveness, however, by focusing virtually exclusively on displacement visualization, visually neglecting the more complex notion of deformation such as shearing and stretching that is central to the field of continuum mechanics. To incorporate this information into the flow surface visualization and analysis process, we derive a metric tensor field that encodes local surface deformations as induced by the velocity gradient of the underlying flow field. We demonstrate how properties of the resulting metric tensor field are capable of enhancing present surface visualization and generation methods and develop novel surface querying, sampling, and visualization techniques. The provided results show how this step towards unifying classic flow visualization and more advanced concepts from continuum mechanics enables more detailed and improved flow analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Integral flow surfaces constitute a widely used flow visualization tool due to their capability to convey important flow information such as fluid transport, mixing, and domain segmentation. Current flow surface rendering techniques limit their expressiveness, however, by focusing virtually exclusively on displacement visualization, visually neglecting the more complex notion of deformation such as shearing and stretching that is central to the field of continuum mechanics. To incorporate this information into the flow surface visualization and analysis process, we derive a metric tensor field that encodes local surface deformations as induced by the velocity gradient of the underlying flow field. We demonstrate how properties of the resulting metric tensor field are capable of enhancing present surface visualization and generation methods and develop novel surface querying, sampling, and visualization techniques. The provided results show how this step towards unifying classic flow visualization and more advanced concepts from continuum mechanics enables more detailed and improved flow analysis.",
"title": "Derived Metric Tensors for Flow Surface Visualization",
"normalizedTitle": "Derived Metric Tensors for Flow Surface Visualization",
"fno": "ttg2012122149",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Tensile Stress",
"Surface Treatment",
"Velocity Measurement",
"Shape Analysis",
"Trajectory",
"Deformation",
"Continuum Mechanics",
"Vector Field",
"Integral Surfaces",
"Metric Tensor",
"Deformation",
"Velocity Gradient"
],
"authors": [
{
"givenName": "Harald",
"surname": "Obermaier",
"fullName": "Harald Obermaier",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenneth I.",
"surname": "Joy",
"fullName": "Kenneth I. Joy",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2012-12-01 00:00:00",
"pubType": "trans",
"pages": "2149-2158",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ettandgrs/2008/3563/2/3563b823",
"title": "Flow Visualization Based on Rendering of 3D Surface Texture",
"doi": null,
"abstractUrl": "/proceedings-article/ettandgrs/2008/3563b823/12OmNApcugl",
"parentPublication": {
"id": "ettandgrs/2008/3563/2",
"title": "Education Technology and Training & Geoscience and Remote Sensing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/2/3859b121",
"title": "Study on Flow Unit Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859b121/12OmNBRbkuk",
"parentPublication": {
"id": "proceedings/iita/2009/3859/2",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wvm/1991/2153/0/00212777",
"title": "Egomotion from global flow field data",
"doi": null,
"abstractUrl": "/proceedings-article/wvm/1991/00212777/12OmNyQGS8b",
"parentPublication": {
"id": "proceedings/wvm/1991/2153/0",
"title": "Proceedings of the IEEE Workshop on Visual Motion",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2016/1451/0/07465255",
"title": "Comparative visualization of multiple time surfaces by planar surface reformation",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2016/07465255/12OmNyaGeK9",
"parentPublication": {
"id": "proceedings/pacificvis/2016/1451/0",
"title": "2016 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156351",
"title": "Surface flow visualization using the closest point embedding",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156351/12OmNykCceI",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2009/3946/0/3946a114",
"title": "Simulation of Mach 3 Cylinder Flow Using Kinetic and Continuum Solvers",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2009/3946a114/12OmNzdoME1",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2009/3946/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/09/07328340",
"title": "Lightness Constancy in Surface Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/09/07328340/13rRUwbs1Sx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091476",
"title": "Image-Space Texture-Based Output-Coherent Surface Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091476/13rRUwghd98",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061595",
"title": "Superquadric Glyphs for Symmetric Second-Order Tensors",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061595/13rRUxZzAhA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121979",
"title": "Asymmetric Tensor Field Visualization for Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121979/13rRUygT7fa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012122140",
"articleId": "13rRUwfI0Qa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012122159",
"articleId": "13rRUxZ0o1y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyQphh4",
"title": "Aug.",
"year": "2018",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDqS8p",
"doi": "10.1109/TVCG.2017.2720672",
"abstract": "Surface flow phenomena, such as rain water flowing down a tree trunk and progressive water front in a shower room, are common in real life. However, compared with the 3D spatial fluid flow, these surface flow problems have been much less studied in the graphics community. To tackle this research gap, we present an efficient, robust and high-fidelity simulation approach based on the shallow-water equations. Specifically, the standard shallow-water flow model is extended to general triangle meshes with a feature-based bottom friction model, and a series of coherent mathematical formulations are derived to represent the full range of physical effects that are important for real-world surface flow phenomena. In addition, by achieving compatibility with existing 3D fluid simulators and by supporting physically realistic interactions with multiple fluids and solid surfaces, the new model is flexible and readily extensible for coupled phenomena. A wide range of simulation examples are presented to demonstrate the performance of the new approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Surface flow phenomena, such as rain water flowing down a tree trunk and progressive water front in a shower room, are common in real life. However, compared with the 3D spatial fluid flow, these surface flow problems have been much less studied in the graphics community. To tackle this research gap, we present an efficient, robust and high-fidelity simulation approach based on the shallow-water equations. Specifically, the standard shallow-water flow model is extended to general triangle meshes with a feature-based bottom friction model, and a series of coherent mathematical formulations are derived to represent the full range of physical effects that are important for real-world surface flow phenomena. In addition, by achieving compatibility with existing 3D fluid simulators and by supporting physically realistic interactions with multiple fluids and solid surfaces, the new model is flexible and readily extensible for coupled phenomena. A wide range of simulation examples are presented to demonstrate the performance of the new approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Surface flow phenomena, such as rain water flowing down a tree trunk and progressive water front in a shower room, are common in real life. However, compared with the 3D spatial fluid flow, these surface flow problems have been much less studied in the graphics community. To tackle this research gap, we present an efficient, robust and high-fidelity simulation approach based on the shallow-water equations. Specifically, the standard shallow-water flow model is extended to general triangle meshes with a feature-based bottom friction model, and a series of coherent mathematical formulations are derived to represent the full range of physical effects that are important for real-world surface flow phenomena. In addition, by achieving compatibility with existing 3D fluid simulators and by supporting physically realistic interactions with multiple fluids and solid surfaces, the new model is flexible and readily extensible for coupled phenomena. A wide range of simulation examples are presented to demonstrate the performance of the new approach.",
"title": "Real-Time High-Fidelity Surface Flow Simulation",
"normalizedTitle": "Real-Time High-Fidelity Surface Flow Simulation",
"fno": "07964760",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Mathematical Model",
"Three Dimensional Displays",
"Computational Modeling",
"Two Dimensional Displays",
"Liquids",
"Solid Modeling",
"Sea Surface",
"Shallow Water Equation",
"Flow On Curved Surfaces",
"Finite Volume Method",
"Coupled Simulation"
],
"authors": [
{
"givenName": "Bo",
"surname": "Ren",
"fullName": "Bo Ren",
"affiliation": "Nankai University, Tianjin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tailing",
"surname": "Yuan",
"fullName": "Tailing Yuan",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chenfeng",
"surname": "Li",
"fullName": "Chenfeng Li",
"affiliation": "Swansea, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kun",
"surname": "Xu",
"fullName": "Kun Xu",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shi-Min",
"surname": "Hu",
"fullName": "Shi-Min Hu",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, P. R. China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2018-08-01 00:00:00",
"pubType": "trans",
"pages": "2411-2423",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isdea/2010/8333/2/05746139",
"title": "The Influence of Flow Guide Structure on Distribution of Flow Field in Separate Cooling Water Jacket of Engine",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2010/05746139/12OmNAKuoUm",
"parentPublication": {
"id": "proceedings/isdea/2010/8333/2",
"title": "2010 International Conference on Intelligent System Design and Engineering Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2010/4270/0/4270a297",
"title": "Hydraulic Flow Simulation on Dynamical Changing Terrain",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2010/4270a297/12OmNBuL152",
"parentPublication": {
"id": "proceedings/iccis/2010/4270/0",
"title": "2010 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/2/3336c882",
"title": "An Approach for 3D Water Surface Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336c882/12OmNvkGW4e",
"parentPublication": {
"id": "proceedings/csse/2008/3336/6",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvaui/2016/5870/0/5870a037",
"title": "Surface Stereo for Shallow Underwater Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/cvaui/2016/5870a037/12OmNyz5K1v",
"parentPublication": {
"id": "proceedings/cvaui/2016/5870/0",
"title": "2016 ICPR 2nd Workshop on Computer Vision for Analysis of Underwater Imagery (CVAUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019293",
"title": "Animating pictures using procedural 2.5D water flow simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019293/12OmNzvz6Hl",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/10/07132780",
"title": "Coupling 3D Eulerian, Heightfield and Particle Methods for Interactive Simulation of Large Scale Liquid Phenomena",
"doi": null,
"abstractUrl": "/journal/tg/2015/10/07132780/13rRUxlgy3K",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/05999663",
"title": "A Deformable Surface Model for Real-Time Water Drop Animation",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/05999663/13rRUyY28Ys",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071242",
"title": "Water Surface Modeling from a Single Viewpoint Video",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071242/13rRUygT7fc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a550",
"title": "Semi-Analytical Surface Tension Model for Free Surface Flows",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a550/1CJdPv2AGJi",
"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/iccv/2019/4803/0/480300h829",
"title": "Surface Normals and Shape From Water",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300h829/1hVlrmTFlcs",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07968319",
"articleId": "13rRUxBa5ns",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07930525",
"articleId": "13rRUxBrGh8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRGF",
"name": "ttg201808-07964760s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201808-07964760s1.zip",
"extension": "zip",
"size": "100 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1y11mYZWHfO",
"title": "Dec.",
"year": "2021",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1wpqubOKAne",
"doi": "10.1109/TVCG.2021.3107597",
"abstract": "Multi-scale granular materials, such as powdered materials and mudslides, are pretty common in nature. Modeling such materials and their phase transitions remains challenging since this task involves the delicate representations of various ranges of particles with multiple scales that cause their property variations among liquid, granular solid (i.e., particles), and smoke-like materials. To effectively animate the complicated yet intriguing natural phenomena involving multi-scale granular materials and their phase transitions in graphics with high fidelity, this article advocates a hybrid Euler-Lagrange solver to handle the behaviors of involved discontinuous fluid-like materials faithfully. At the algorithmic level, we present a unified framework that tightly couples the affine particle-in-cell (APIC) solver with density field to achieve the transformation spanning across granular particles, dust cloud, powders, and their natural mixtures. For example, a part of the granular particles could be transformed into dust cloud while interacting with air and being represented by density field. Meanwhile, the velocity decrease of the involved materials could also result in the transit from the density-field-driven dust to powder particles. Besides, to further enhance our modeling and simulation power to broaden the range of multi-scale materials, we introduce a moisture property for granular particles to control the transitions between particles and viscous liquid. At the geometric level, we devise an additional surface-tracking procedure to simulate the viscous liquid phase. We can arrive at delicate viscous behaviors by controlling the corresponding yield conditions. Through various experiments with the different scenes design being conducted in our unified framework, we can validate the mixed multi-scale materials’ mutual transformation processes. Our unified framework furnished with a hybrid solver can significantly enhance the modeling flexibility and the animation potential of the particle-grid hybrid materials in graphics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multi-scale granular materials, such as powdered materials and mudslides, are pretty common in nature. Modeling such materials and their phase transitions remains challenging since this task involves the delicate representations of various ranges of particles with multiple scales that cause their property variations among liquid, granular solid (i.e., particles), and smoke-like materials. To effectively animate the complicated yet intriguing natural phenomena involving multi-scale granular materials and their phase transitions in graphics with high fidelity, this article advocates a hybrid Euler-Lagrange solver to handle the behaviors of involved discontinuous fluid-like materials faithfully. At the algorithmic level, we present a unified framework that tightly couples the affine particle-in-cell (APIC) solver with density field to achieve the transformation spanning across granular particles, dust cloud, powders, and their natural mixtures. For example, a part of the granular particles could be transformed into dust cloud while interacting with air and being represented by density field. Meanwhile, the velocity decrease of the involved materials could also result in the transit from the density-field-driven dust to powder particles. Besides, to further enhance our modeling and simulation power to broaden the range of multi-scale materials, we introduce a moisture property for granular particles to control the transitions between particles and viscous liquid. At the geometric level, we devise an additional surface-tracking procedure to simulate the viscous liquid phase. We can arrive at delicate viscous behaviors by controlling the corresponding yield conditions. Through various experiments with the different scenes design being conducted in our unified framework, we can validate the mixed multi-scale materials’ mutual transformation processes. Our unified framework furnished with a hybrid solver can significantly enhance the modeling flexibility and the animation potential of the particle-grid hybrid materials in graphics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multi-scale granular materials, such as powdered materials and mudslides, are pretty common in nature. Modeling such materials and their phase transitions remains challenging since this task involves the delicate representations of various ranges of particles with multiple scales that cause their property variations among liquid, granular solid (i.e., particles), and smoke-like materials. To effectively animate the complicated yet intriguing natural phenomena involving multi-scale granular materials and their phase transitions in graphics with high fidelity, this article advocates a hybrid Euler-Lagrange solver to handle the behaviors of involved discontinuous fluid-like materials faithfully. At the algorithmic level, we present a unified framework that tightly couples the affine particle-in-cell (APIC) solver with density field to achieve the transformation spanning across granular particles, dust cloud, powders, and their natural mixtures. For example, a part of the granular particles could be transformed into dust cloud while interacting with air and being represented by density field. Meanwhile, the velocity decrease of the involved materials could also result in the transit from the density-field-driven dust to powder particles. Besides, to further enhance our modeling and simulation power to broaden the range of multi-scale materials, we introduce a moisture property for granular particles to control the transitions between particles and viscous liquid. At the geometric level, we devise an additional surface-tracking procedure to simulate the viscous liquid phase. We can arrive at delicate viscous behaviors by controlling the corresponding yield conditions. Through various experiments with the different scenes design being conducted in our unified framework, we can validate the mixed multi-scale materials’ mutual transformation processes. Our unified framework furnished with a hybrid solver can significantly enhance the modeling flexibility and the animation potential of the particle-grid hybrid materials in graphics.",
"title": "Simulating Multi-Scale, Granular Materials and Their Transitions With a Hybrid Euler-Lagrange Solver",
"normalizedTitle": "Simulating Multi-Scale, Granular Materials and Their Transitions With a Hybrid Euler-Lagrange Solver",
"fno": "09524524",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Fluid Dynamics",
"Computer Animation",
"Flow Simulation",
"Granular Materials",
"Numerical Analysis",
"Two Phase Flow",
"Granular Particles",
"Dust Cloud",
"Density Field",
"Involved Materials",
"Density Field Driven Dust",
"Powder Particles",
"Viscous Liquid Phase",
"Mixed Multiscale Materials",
"Hybrid Solver",
"Particle Grid Hybrid Materials",
"Hybrid Euler Lagrange Solver",
"Multiscale Granular Materials",
"Powdered Materials",
"Phase Transitions",
"Complicated Yet Intriguing Natural Phenomena",
"Involved Discontinuous Fluid Like",
"Affine Particle In Cell Solver",
"Liquids",
"Computational Modeling",
"Mathematical Model",
"Atmospheric Modeling",
"Moisture",
"Surface Treatment",
"Multi Scale Materials",
"Granular Particles",
"Density Field Based Dust Cloud",
"Viscous Liquid",
"APIC"
],
"authors": [
{
"givenName": "Yang",
"surname": "Gao",
"fullName": "Yang Gao",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, Beijing Advanced Innovation Center for Biomedical Engineering, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shuai",
"surname": "Li",
"fullName": "Shuai Li",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, Beijing Advanced Innovation Center for Biomedical Engineering, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aimin",
"surname": "Hao",
"fullName": "Aimin Hao",
"affiliation": "State Key Laboratory of Virtual Reality Technology and Systems, Beijing Advanced Innovation Center for Biomedical Engineering, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong",
"surname": "Qin",
"fullName": "Hong Qin",
"affiliation": "Department of Computer Science, Stony Brook University, Stony Brook, NY, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": {
"isEnabled": true,
"codeDownloadUrl": "https://github.com/gaoyangVR/MultiScale-Gracular-APIC.git",
"codeRepositoryUrl": "https://github.com/gaoyangVR/MultiScale-Gracular-APIC",
"__typename": "ArticleReplicabilityType"
},
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2021-12-01 00:00:00",
"pubType": "trans",
"pages": "4483-4494",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2008/3359/0/3359a028",
"title": "Real-Time Simulation of Granular Materials Using Graphics Hardware",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2008/3359a028/12OmNqBtiYe",
"parentPublication": {
"id": "proceedings/cgiv/2008/3359/0",
"title": "2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2010/7964/0/05576240",
"title": "An Update and an Overview on Philosophical Foundation of Granular Computing",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2010/05576240/12OmNviZluZ",
"parentPublication": {
"id": "proceedings/grc/2010/7964/0",
"title": "2010 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2014/4258/0/4258a065",
"title": "SPH Fluids for Viscous Jet Buckling",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2014/4258a065/12OmNzn38LQ",
"parentPublication": {
"id": "proceedings/sibgrapi/2014/4258/0",
"title": "2014 27th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/se4science/2018/5748/0/574801a009",
"title": "Methodology for Building Granular Testing in Multicomponent Scientific Software",
"doi": null,
"abstractUrl": "/proceedings-article/se4science/2018/574801a009/13bd1AIBM2u",
"parentPublication": {
"id": "proceedings/se4science/2018/5748/0",
"title": "2018 IEEE/ACM 13th International Workshop on Software Engineering for Science (SE4Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/05/ttg2008051110",
"title": "Visualization of Particle Interactions in Granular Media",
"doi": null,
"abstractUrl": "/journal/tg/2008/05/ttg2008051110/13rRUxC0SEb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/03/08851275",
"title": "Shallow Sand Equations: Real-Time Height Field Simulation of Dry Granular Flows",
"doi": null,
"abstractUrl": "/journal/tg/2021/03/08851275/1dFoGxhy3eM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089636",
"title": "Multiple-scale Simulation Method for Liquid with Trapped Air under Particle-based Framework",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089636/1jIx9StwsnK",
"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/csde/2019/6303/0/09162352",
"title": "Effect of Clay Content on Performance of a Crushed Rock Mix",
"doi": null,
"abstractUrl": "/proceedings-article/csde/2019/09162352/1m6hO1f0cRG",
"parentPublication": {
"id": "proceedings/csde/2019/6303/0",
"title": "2019 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222377",
"title": "Interactive Visualization of Atmospheric Effects for Celestial Bodies",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222377/1nTrHSFagNy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09645370",
"title": "Towards replacing physical testing of granular materials with a Topology-based Model",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09645370/1zc6D7Qkucw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09127881",
"articleId": "1l3ut5TpoCA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09119141",
"articleId": "1kHUKlOoA4U",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1y11r5YQhwY",
"name": "ttg202112-09524524s1-supp1-3107597.wmv",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202112-09524524s1-supp1-3107597.wmv",
"extension": "wmv",
"size": "76 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzDvSjw",
"title": "May/June",
"year": "2003",
"issueNum": "03",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "5",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2F4",
"doi": "10.1109/MCISE.2003.1196305",
"abstract": "To solve critical biosphere-level problems such as global warming, decreased biodiversity, and natural resource depletion, scientists must integrate data from many researchers. This, in turn, requires better data infrastructure and informatics tools than are currently available. The Canopy Database Project brings together computer scientists and ecologists to develop informatics tools for forest canopy research that meet such ecosystem informatics challenges.",
"abstracts": [
{
"abstractType": "Regular",
"content": "To solve critical biosphere-level problems such as global warming, decreased biodiversity, and natural resource depletion, scientists must integrate data from many researchers. This, in turn, requires better data infrastructure and informatics tools than are currently available. The Canopy Database Project brings together computer scientists and ecologists to develop informatics tools for forest canopy research that meet such ecosystem informatics challenges.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "To solve critical biosphere-level problems such as global warming, decreased biodiversity, and natural resource depletion, scientists must integrate data from many researchers. This, in turn, requires better data infrastructure and informatics tools than are currently available. The Canopy Database Project brings together computer scientists and ecologists to develop informatics tools for forest canopy research that meet such ecosystem informatics challenges.",
"title": "How trees and forests inform biodiversity and ecosystem informatics",
"normalizedTitle": "How trees and forests inform biodiversity and ecosystem informatics",
"fno": "c3032",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Ecology",
"Forestry",
"Scientific Information Systems",
"Biology Computing",
"Global Warming",
"Trees",
"Forests",
"Decreased Biodiversity",
"Natural Resource Depletion",
"Data Integration",
"Data Infrastructure",
"Informatics Tools",
"Canopy Database Project",
"Biosphere Level Problems",
"Forest Canopy Research",
"Ecosystem Informatics",
"Biodiversity Informatics",
"Biodiversity",
"Ecosystems",
"Informatics",
"Data Analysis",
"Documentation",
"Biosphere",
"Data Warehouses",
"Database Systems",
"Global Warming",
"Prototypes"
],
"authors": [
{
"givenName": "J.",
"surname": "Bayard Cushing",
"fullName": "J. Bayard Cushing",
"affiliation": "Evergreen Coll., Olympia, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "B.",
"surname": "Bond",
"fullName": "B. Bond",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Dial",
"fullName": "R. Dial",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "N.",
"surname": "Nadkarni",
"fullName": "N. Nadkarni",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2003-05-01 00:00:00",
"pubType": "mags",
"pages": "32-43",
"year": "2003",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dexa/2009/3763/0/3763a350",
"title": "A Framework for Supporting the Composition of Biodiversity Informatics Resources",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2009/3763a350/12OmNxveNOn",
"parentPublication": {
"id": "proceedings/dexa/2009/3763/0",
"title": "2009 20th International Workshop on Database and Expert Systems Application. DEXA 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "c3026",
"articleId": "13rRUxBJhio",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "c3044",
"articleId": "13rRUy0HYNw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBcj5Ep",
"title": "July-Aug.",
"year": "2017",
"issueNum": "04",
"idPrefix": "tb",
"pubType": "journal",
"volume": "14",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2Kp",
"doi": "10.1109/TCBB.2016.2535251",
"abstract": "Omic data analyses pose great informatics challenges. As an emerging subfield of bioinformatics, omics informatics focuses on analyzing multi-omic data efficiently and effectively, and is gaining momentum. There are two underlying trends in the expansion of omics informatics landscape: the explosion of scattered individual omics informatics tools with each of which focuses on a specific task in both single- and multi- omic settings, and the fast-evolving integrated software platforms such as workflow management systems that can assemble multiple tools into pipelines and streamline integrative analysis for complicated tasks. In this survey, we give a holistic view of omics informatics, from scattered individual informatics tools to integrated workflow management systems. We not only outline the landscape and challenges of omics informatics, but also sample a number of widely used and cutting-edge algorithms in omics data analysis to give readers a fine-grained view. We survey various workflow management systems (WMSs), classify them into three levels of WMSs from simple software toolkits to integrated multi-omic analytical platforms, and point out the emerging needs for developing intelligent workflow management systems. We also discuss the challenges, strategies and some existing work in systematic evaluation of omics informatics tools. We conclude by providing future perspectives of emerging fields and new frontiers in omics informatics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Omic data analyses pose great informatics challenges. As an emerging subfield of bioinformatics, omics informatics focuses on analyzing multi-omic data efficiently and effectively, and is gaining momentum. There are two underlying trends in the expansion of omics informatics landscape: the explosion of scattered individual omics informatics tools with each of which focuses on a specific task in both single- and multi- omic settings, and the fast-evolving integrated software platforms such as workflow management systems that can assemble multiple tools into pipelines and streamline integrative analysis for complicated tasks. In this survey, we give a holistic view of omics informatics, from scattered individual informatics tools to integrated workflow management systems. We not only outline the landscape and challenges of omics informatics, but also sample a number of widely used and cutting-edge algorithms in omics data analysis to give readers a fine-grained view. We survey various workflow management systems (WMSs), classify them into three levels of WMSs from simple software toolkits to integrated multi-omic analytical platforms, and point out the emerging needs for developing intelligent workflow management systems. We also discuss the challenges, strategies and some existing work in systematic evaluation of omics informatics tools. We conclude by providing future perspectives of emerging fields and new frontiers in omics informatics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Omic data analyses pose great informatics challenges. As an emerging subfield of bioinformatics, omics informatics focuses on analyzing multi-omic data efficiently and effectively, and is gaining momentum. There are two underlying trends in the expansion of omics informatics landscape: the explosion of scattered individual omics informatics tools with each of which focuses on a specific task in both single- and multi- omic settings, and the fast-evolving integrated software platforms such as workflow management systems that can assemble multiple tools into pipelines and streamline integrative analysis for complicated tasks. In this survey, we give a holistic view of omics informatics, from scattered individual informatics tools to integrated workflow management systems. We not only outline the landscape and challenges of omics informatics, but also sample a number of widely used and cutting-edge algorithms in omics data analysis to give readers a fine-grained view. We survey various workflow management systems (WMSs), classify them into three levels of WMSs from simple software toolkits to integrated multi-omic analytical platforms, and point out the emerging needs for developing intelligent workflow management systems. We also discuss the challenges, strategies and some existing work in systematic evaluation of omics informatics tools. We conclude by providing future perspectives of emerging fields and new frontiers in omics informatics.",
"title": "Omics Informatics: From Scattered Individual Software Tools to Integrated Workflow Management Systems",
"normalizedTitle": "Omics Informatics: From Scattered Individual Software Tools to Integrated Workflow Management Systems",
"fno": "07420655",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Bioinformatics",
"Genomics",
"Sequential Analysis",
"Informatics",
"Proteins",
"RNA",
"DNA",
"Omics Informatics",
"Multi Omic Integrative Analysis",
"Workflow Management Systems",
"Sequence Assembly And Alignment",
"Variant Discovery",
"Downstream Analysis"
],
"authors": [
{
"givenName": "Tianle",
"surname": "Ma",
"fullName": "Tianle Ma",
"affiliation": "Department of Computer Science and Engineering, University at Buffalo (SUNY), Buffalo, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aidong",
"surname": "Zhang",
"fullName": "Aidong Zhang",
"affiliation": "Department of Computer Science and Engineering, University at Buffalo (SUNY), Buffalo, NY",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2017-07-01 00:00:00",
"pubType": "trans",
"pages": "926-946",
"year": "2017",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hpcs/2017/3250/0/08035188",
"title": "High Performance Analysis of Omics Data: Experiences at University Magna Graecia of Catanzaro",
"doi": null,
"abstractUrl": "/proceedings-article/hpcs/2017/08035188/12OmNBSSV84",
"parentPublication": {
"id": "proceedings/hpcs/2017/3250/0",
"title": "2017 International Conference on High-Performance Computing & Simulation (HPCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc-scalcom-cbdcom-iop-smartworld/2016/2771/0/07816892",
"title": "A Cloud Solution for Multi-omics Data Integration",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom-cbdcom-iop-smartworld/2016/07816892/12OmNvD8RvR",
"parentPublication": {
"id": "proceedings/uic-atc-scalcom-cbdcom-iop-smartworld/2016/2771/0",
"title": "2016 Intl IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08218003",
"title": "A multi-omics informatics approach for identifying molecular mechanisms and biomarkers in clinical patients with endometriosis",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08218003/12OmNvxKtZf",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/1999/0368/0/03680294",
"title": "The Design of Agent-Based Tools for Bio-Informatics",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/1999/03680294/12OmNwDACuR",
"parentPublication": {
"id": "proceedings/compsac/1999/0368/0",
"title": "Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2016/1611/0/07822711",
"title": "Integrative Gene Regulatory Network inference using multi-omics data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2016/07822711/12OmNwlZu6l",
"parentPublication": {
"id": "proceedings/bibm/2016/1611/0",
"title": "2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08218028",
"title": "Development of “KBCommons” — universal informatics framework for multi-omics translational research",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08218028/12OmNx7G5Wg",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08218050",
"title": "KBCommons: A multi ‘OMICS’ integrative framework for database and informatics tools",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08218050/12OmNx9nGLa",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08218034",
"title": "Development of an informatics analytics workflow for DAP-seq data exploration and validation for auxin response factors in maize",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08218034/12OmNyL0TxS",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669481",
"title": "Recursive Multi-view Integration for Subtypes Identification of Cervical Cancer",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669481/1A9W51aQmTS",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09684949",
"title": "A Review of Fusion Methods for Omics and Imaging Data",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09684949/1Ai9r83keJi",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07447741",
"articleId": "13rRUwbs2f6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07464324",
"articleId": "13rRUxbTMxD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyOq4VG",
"title": "Sept.-Oct.",
"year": "2013",
"issueNum": "05",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "15",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy2YLOR",
"doi": "10.1109/MCSE.2013.50",
"abstract": "Given the impact of climate change, understanding the climate system is an international priority. The goal of climate informatics is to inspire collaboration between climate scientists and data scientists, in order to develop tools to analyze complex and ever-growing amounts of observed and simulated climate data, and thereby bridge the gap between data and understanding. Here, recent climate informatics work is presented, along with details of some of the remaining challenges.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given the impact of climate change, understanding the climate system is an international priority. The goal of climate informatics is to inspire collaboration between climate scientists and data scientists, in order to develop tools to analyze complex and ever-growing amounts of observed and simulated climate data, and thereby bridge the gap between data and understanding. Here, recent climate informatics work is presented, along with details of some of the remaining challenges.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given the impact of climate change, understanding the climate system is an international priority. The goal of climate informatics is to inspire collaboration between climate scientists and data scientists, in order to develop tools to analyze complex and ever-growing amounts of observed and simulated climate data, and thereby bridge the gap between data and understanding. Here, recent climate informatics work is presented, along with details of some of the remaining challenges.",
"title": "Climate Informatics: Accelerating Discovering in Climate Science with Machine Learning",
"normalizedTitle": "Climate Informatics: Accelerating Discovering in Climate Science with Machine Learning",
"fno": "mcs2013050032",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Climate Mitigation",
"Geophysics Computing",
"Learning Artificial Intelligence",
"Climate Change",
"Machine Learning",
"Climate Science",
"Climate Informatics",
"Atmospheric Measurements",
"Machine Learning",
"Meteorology",
"Climate Change",
"Informatics",
"Machine Learning",
"Climate Informatics",
"Data Mining",
"Statistics",
"Climate Science"
],
"authors": [
{
"givenName": "Claire",
"surname": "Monteleoni",
"fullName": "Claire Monteleoni",
"affiliation": "George Washington University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gavin A.",
"surname": "Schmidt",
"fullName": "Gavin A. Schmidt",
"affiliation": "NASA Goddard Institute for Space Studies",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Scott",
"surname": "McQuade",
"fullName": "Scott McQuade",
"affiliation": "George Washington University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2013-09-01 00:00:00",
"pubType": "mags",
"pages": "32-40",
"year": "2013",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/mu/2015/01/mmu2015010041",
"title": "Designing an Interactive Audio Interface for Climate Science",
"doi": null,
"abstractUrl": "/magazine/mu/2015/01/mmu2015010041/13rRUwdrdMQ",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2011/06/mso2011060032",
"title": "Guest Editors' Introduction: Climate Change - Science and Software",
"doi": null,
"abstractUrl": "/magazine/so/2011/06/mso2011060032/13rRUwgQpBi",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2014/11/mco2014110074",
"title": "Theory-Guided Data Science for Climate Change",
"doi": null,
"abstractUrl": "/magazine/co/2014/11/mco2014110074/13rRUxC0Srh",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2015/06/mcs2015060019",
"title": "Scalable Multivariate Time-Series Models for Climate Informatics",
"doi": null,
"abstractUrl": "/magazine/cs/2015/06/mcs2015060019/13rRUxD9h19",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2015/05/mcs2015050049",
"title": "Putting Regional Climate Prediction in Reach",
"doi": null,
"abstractUrl": "/magazine/cs/2015/05/mcs2015050049/13rRUy0ZzWh",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2015/06/mcs2015060043",
"title": "Can Topic Modeling Shed Light on Climate Extremes?",
"doi": null,
"abstractUrl": "/magazine/cs/2015/06/mcs2015060043/13rRUyYBlcf",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2011/05/mcs2011050036",
"title": "Climate Change Modeling: Computational Opportunities and Challenges",
"doi": null,
"abstractUrl": "/magazine/cs/2011/05/mcs2011050036/13rRUyoPSSG",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09281098",
"title": "Dynamic 3-D Visualization of Climate Model Development and Results",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09281098/1phO0N1Fhte",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/01/09325132",
"title": "Visualization of Climate Science Simulation Data",
"doi": null,
"abstractUrl": "/magazine/cg/2021/01/09325132/1qnQT22F5zq",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2021/03/09384262",
"title": "Bringing the Future Into Focus: Benefits and Challenges of High-Resolution Global Climate Change Simulations",
"doi": null,
"abstractUrl": "/magazine/cs/2021/03/09384262/1scDqsJ2diM",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2013050022",
"articleId": "13rRUwhHcLY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2013050042",
"articleId": "13rRUILLkzl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvjgWIK",
"title": "Jan.",
"year": "2014",
"issueNum": "01",
"idPrefix": "co",
"pubType": "magazine",
"volume": "47",
"label": "Jan.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUypp5bu",
"doi": "10.1109/MC.2014.22",
"abstract": "What the world needs now is a new field of study: privacy informatics. This emerging field will fill the information-awareness gap between a trusting citizenry and the emerging digital dystopia.",
"abstracts": [
{
"abstractType": "Regular",
"content": "What the world needs now is a new field of study: privacy informatics. This emerging field will fill the information-awareness gap between a trusting citizenry and the emerging digital dystopia.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "What the world needs now is a new field of study: privacy informatics. This emerging field will fill the information-awareness gap between a trusting citizenry and the emerging digital dystopia.",
"title": "Privacy Informatics: A Primer on Defensive Tactics for a Society under Siege",
"normalizedTitle": "Privacy Informatics: A Primer on Defensive Tactics for a Society under Siege",
"fno": "mco2014010078",
"hasPdf": true,
"idPrefix": "co",
"keywords": [
"Privacy",
"Computer Security",
"Browsers",
"Smart Phones",
"Information Technology",
"Informatics",
"HTTPS Everywhere",
"Do Not Track",
"Firefox",
"Privacy",
"Add On",
"Electronic Frontier Foundation",
"No Script"
],
"authors": [
{
"givenName": "Hal",
"surname": "Berghel",
"fullName": "Hal Berghel",
"affiliation": "University of Nevada, Las Vegas",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2014-01-01 00:00:00",
"pubType": "mags",
"pages": "78-82",
"year": "2014",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2015/7367/0/7367e938",
"title": "Exploring the Impact of IS Theory on Health Informatics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367e938/12OmNvTTcg4",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2013/5261/0/06685111",
"title": "Developing an interdisciplinary Health Informatics Security and privacy program",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2013/06685111/12OmNvkGW5h",
"parentPublication": {
"id": "proceedings/fie/2013/5261/0",
"title": "2013 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci/2002/1724/0/17240034",
"title": "On Cognitive Informatics",
"doi": null,
"abstractUrl": "/proceedings-article/icci/2002/17240034/12OmNzZmZkU",
"parentPublication": {
"id": "proceedings/icci/2002/1724/0",
"title": "Cognitive Informatics, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icks/2008/3128/0/3128a145",
"title": "Towards Informatics Education and Research for Knowledge-Circulating Society",
"doi": null,
"abstractUrl": "/proceedings-article/icks/2008/3128a145/12OmNzcPAeO",
"parentPublication": {
"id": "proceedings/icks/2008/3128/0",
"title": "2008 International Conference on Informatics Education and Research for Development of Knowledge Society Infrastructure",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2011/05/mex2011050016",
"title": "Brain Informatics",
"doi": null,
"abstractUrl": "/magazine/ex/2011/05/mex2011050016/13rRUEgarxj",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2017/04/07420655",
"title": "Omics Informatics: From Scattered Individual Software Tools to Integrated Workflow Management Systems",
"doi": null,
"abstractUrl": "/journal/tb/2017/04/07420655/13rRUEgs2Kp",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2010/05/mex2010050082",
"title": "AI and Security Informatics",
"doi": null,
"abstractUrl": "/magazine/ex/2010/05/mex2010050082/13rRUwx1xN3",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2012/05/mit2012050047",
"title": "Justice Informatics: Improving Knowledge Discovery for the Justice System",
"doi": null,
"abstractUrl": "/magazine/it/2012/05/mit2012050047/13rRUx0xPBj",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2018/02/mic2018020029",
"title": "Healthcare Informatics and Privacy",
"doi": null,
"abstractUrl": "/magazine/ic/2018/02/mic2018020029/13rRUygT7jz",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2018/9120/0/08612876",
"title": "Design and Development of Case Studies in Security and Privacy for Health Informatics Education",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2018/08612876/17D45Xh13vn",
"parentPublication": {
"id": "proceedings/aiccsa/2018/9120/0",
"title": "2018 IEEE/ACS 15th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mco2014010075",
"articleId": "13rRUwcAqvt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mco2014010083",
"articleId": "13rRUxN5ezo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZ0o1F",
"doi": "10.1109/TVCG.2016.2598543",
"abstract": "User-authored annotations of data can support analysts in the activity of hypothesis generation and sensemaking, where it is not only critical to document key observations, but also to communicate insights between analysts. We present annotation graphs, a dynamic graph visualization that enables meta-analysis of data based on user-authored annotations. The annotation graph topology encodes annotation semantics, which describe the content of and relations between data selections, comments, and tags. We present a mixed-initiative approach to graph layout that integrates an analyst's manual manipulations with an automatic method based on similarity inferred from the annotation semantics. Various visual graph layout styles reveal different perspectives on the annotation semantics. Annotation graphs are implemented within C8, a system that supports authoring annotations during exploratory analysis of a dataset. We apply principles of Exploratory Sequential Data Analysis (ESDA) in designing C8, and further link these to an existing task typology in the visualization literature. We develop and evaluate the system through an iterative user-centered design process with three experts, situated in the domain of analyzing HCI experiment data. The results suggest that annotation graphs are effective as a method of visually extending user-authored annotations to data meta-analysis for discovery and organization of ideas.",
"abstracts": [
{
"abstractType": "Regular",
"content": "User-authored annotations of data can support analysts in the activity of hypothesis generation and sensemaking, where it is not only critical to document key observations, but also to communicate insights between analysts. We present annotation graphs, a dynamic graph visualization that enables meta-analysis of data based on user-authored annotations. The annotation graph topology encodes annotation semantics, which describe the content of and relations between data selections, comments, and tags. We present a mixed-initiative approach to graph layout that integrates an analyst's manual manipulations with an automatic method based on similarity inferred from the annotation semantics. Various visual graph layout styles reveal different perspectives on the annotation semantics. Annotation graphs are implemented within C8, a system that supports authoring annotations during exploratory analysis of a dataset. We apply principles of Exploratory Sequential Data Analysis (ESDA) in designing C8, and further link these to an existing task typology in the visualization literature. We develop and evaluate the system through an iterative user-centered design process with three experts, situated in the domain of analyzing HCI experiment data. The results suggest that annotation graphs are effective as a method of visually extending user-authored annotations to data meta-analysis for discovery and organization of ideas.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "User-authored annotations of data can support analysts in the activity of hypothesis generation and sensemaking, where it is not only critical to document key observations, but also to communicate insights between analysts. We present annotation graphs, a dynamic graph visualization that enables meta-analysis of data based on user-authored annotations. The annotation graph topology encodes annotation semantics, which describe the content of and relations between data selections, comments, and tags. We present a mixed-initiative approach to graph layout that integrates an analyst's manual manipulations with an automatic method based on similarity inferred from the annotation semantics. Various visual graph layout styles reveal different perspectives on the annotation semantics. Annotation graphs are implemented within C8, a system that supports authoring annotations during exploratory analysis of a dataset. We apply principles of Exploratory Sequential Data Analysis (ESDA) in designing C8, and further link these to an existing task typology in the visualization literature. We develop and evaluate the system through an iterative user-centered design process with three experts, situated in the domain of analyzing HCI experiment data. The results suggest that annotation graphs are effective as a method of visually extending user-authored annotations to data meta-analysis for discovery and organization of ideas.",
"title": "Annotation Graphs: A Graph-Based Visualization for Meta-Analysis of Data Based on User-Authored Annotations",
"normalizedTitle": "Annotation Graphs: A Graph-Based Visualization for Meta-Analysis of Data Based on User-Authored Annotations",
"fno": "07536110",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Semantics",
"Layout",
"Visualization",
"Human Computer Interaction",
"Data Analysis",
"Manuals",
"Graph Based Visualization",
"Externalization User Authored Annotation",
"Exploratory Sequential Data Analysis"
],
"authors": [
{
"givenName": "Jian",
"surname": "Zhao",
"fullName": "Jian Zhao",
"affiliation": "Autodesk Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Glueck",
"fullName": "Michael Glueck",
"affiliation": "Autodesk Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Breslav",
"fullName": "Simon Breslav",
"affiliation": "Autodesk Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fanny",
"surname": "Chevalier",
"fullName": "Fanny Chevalier",
"affiliation": "INRIA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Azam",
"surname": "Khan",
"fullName": "Azam Khan",
"affiliation": "Autodesk Research",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "261-270",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fskd/2009/3735/5/3735e330",
"title": "A Novel Graph-Based Image Annotation Refinement Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735e330/12OmNBgQFGO",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/empire/2012/4363/0/06347683",
"title": "LASR: A tool for large scale annotation of software requirements",
"doi": null,
"abstractUrl": "/proceedings-article/empire/2012/06347683/12OmNqJ8tsv",
"parentPublication": {
"id": "proceedings/empire/2012/4363/0",
"title": "2012 IEEE Second International Workshop on Empirical Requirements Engineering (EmpiRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346309",
"title": "An annotation system for 3D fluid flow visualization",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346309/12OmNweBUQu",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031599",
"title": "ChartAccent: Annotation for data-driven storytelling",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031599/12OmNxEjY7F",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2004/11/k1324",
"title": "Augmenting a Conceptual Model with Geospatiotemporal Annotations",
"doi": null,
"abstractUrl": "/journal/tk/2004/11/k1324/13rRUyfKII7",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a085",
"title": "Observation and Visualization of Subjectivity-based Annotation Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a085/1KaH4xh3bLq",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600f870",
"title": "Human-in-the-Loop Video Semantic Segmentation Auto-Annotation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600f870/1LiO7MVX61O",
"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/iccvw/2019/5023/0/502300c242",
"title": "Semi-Automatic Annotation of Objects in Visual-Thermal Video",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300c242/1i5mzGcezaU",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom-workshops/2020/4716/0/09156138",
"title": "Keynote: Privacy and Security in Real-World Data Annotation",
"doi": null,
"abstractUrl": "/proceedings-article/percom-workshops/2020/09156138/1m1jEPFIOkg",
"parentPublication": {
"id": "proceedings/percom-workshops/2020/4716/0",
"title": "2020 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100b233",
"title": "Semi-Automatic Annotation For Visual Object Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100b233/1yNiEFSKK1W",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07536189",
"articleId": "13rRUwIF6dV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07536106",
"articleId": "13rRUxBa5nq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H2lc7qemsg",
"doi": "10.1109/TVCG.2022.3209475",
"abstract": "Multiple-view (MV) representations enabling multi-perspective exploration of large and complex data are often employed on 2D displays. The technique also shows great potential in addressing complex analytic tasks in immersive visualization. However, although useful, the design space of MV representations in immersive visualization lacks in deep exploration. In this paper, we propose a new perspective to this line of research, by examining the effects of view layout for MV representations on situated analytics. Specifically, we disentangle situated analytics in perspectives of <italic>situatedness</italic> regarding spatial relationship between visual representations and physical referents, and <italic>analytics</italic> regarding cross-view data analysis including filtering, refocusing, and connecting tasks. Through an in-depth analysis of existing layout paradigms, we summarize design trade-offs for achieving high situatedness and effective analytics simultaneously. We then distill a list of design requirements for a desired layout that balances situatedness and analytics, and develop a prototype system with an automatic layout adaptation method to fulfill the requirements. The method mainly includes a cylindrical paradigm for egocentric reference frame, and a force-directed method for proper view-view, view-user, and view-referent proximities and high view visibility. We conducted a formal user study that compares layouts by our method with linked and embedded layouts. Quantitative results show that participants finished filtering- and connecting-centered tasks significantly faster with our layouts, and user feedback confirms high usability of the prototype system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multiple-view (MV) representations enabling multi-perspective exploration of large and complex data are often employed on 2D displays. The technique also shows great potential in addressing complex analytic tasks in immersive visualization. However, although useful, the design space of MV representations in immersive visualization lacks in deep exploration. In this paper, we propose a new perspective to this line of research, by examining the effects of view layout for MV representations on situated analytics. Specifically, we disentangle situated analytics in perspectives of <italic>situatedness</italic> regarding spatial relationship between visual representations and physical referents, and <italic>analytics</italic> regarding cross-view data analysis including filtering, refocusing, and connecting tasks. Through an in-depth analysis of existing layout paradigms, we summarize design trade-offs for achieving high situatedness and effective analytics simultaneously. We then distill a list of design requirements for a desired layout that balances situatedness and analytics, and develop a prototype system with an automatic layout adaptation method to fulfill the requirements. The method mainly includes a cylindrical paradigm for egocentric reference frame, and a force-directed method for proper view-view, view-user, and view-referent proximities and high view visibility. We conducted a formal user study that compares layouts by our method with linked and embedded layouts. Quantitative results show that participants finished filtering- and connecting-centered tasks significantly faster with our layouts, and user feedback confirms high usability of the prototype system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multiple-view (MV) representations enabling multi-perspective exploration of large and complex data are often employed on 2D displays. The technique also shows great potential in addressing complex analytic tasks in immersive visualization. However, although useful, the design space of MV representations in immersive visualization lacks in deep exploration. In this paper, we propose a new perspective to this line of research, by examining the effects of view layout for MV representations on situated analytics. Specifically, we disentangle situated analytics in perspectives of situatedness regarding spatial relationship between visual representations and physical referents, and analytics regarding cross-view data analysis including filtering, refocusing, and connecting tasks. Through an in-depth analysis of existing layout paradigms, we summarize design trade-offs for achieving high situatedness and effective analytics simultaneously. We then distill a list of design requirements for a desired layout that balances situatedness and analytics, and develop a prototype system with an automatic layout adaptation method to fulfill the requirements. The method mainly includes a cylindrical paradigm for egocentric reference frame, and a force-directed method for proper view-view, view-user, and view-referent proximities and high view visibility. We conducted a formal user study that compares layouts by our method with linked and embedded layouts. Quantitative results show that participants finished filtering- and connecting-centered tasks significantly faster with our layouts, and user feedback confirms high usability of the prototype system.",
"title": "Effects of View Layout on Situated Analytics for Multiple-View Representations in Immersive Visualization",
"normalizedTitle": "Effects of View Layout on Situated Analytics for Multiple-View Representations in Immersive Visualization",
"fno": "09904883",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Ergonomics",
"Automatic Layout Adaptation",
"Cross View Data Analysis",
"Design Requirements",
"Design Trade Offs",
"Egocentric Reference Frame",
"Force Directed Method",
"Immersive Visualization",
"Layout Paradigms",
"Multiperspective Exploration",
"Multiple View Representations",
"MV Representations",
"Situated Analytics",
"System Usability",
"View Layout",
"View Visibility",
"View Referent Proximity",
"View User Proximity",
"View View Proximity",
"Visual Representations",
"Layout",
"Data Visualization",
"Three Dimensional Displays",
"Visualization",
"Task Analysis",
"Data Analysis",
"Prototypes",
"Situated Analytics",
"Multiple View Representations",
"View Layout",
"Immersive Visualization"
],
"authors": [
{
"givenName": "Zhen",
"surname": "Wen",
"fullName": "Zhen Wen",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Zeng",
"fullName": "Wei Zeng",
"affiliation": "The Hong Kong University of Science and Technology (Guangzhou), China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luoxuan",
"surname": "Weng",
"fullName": "Luoxuan Weng",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yihan",
"surname": "Liu",
"fullName": "Yihan Liu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mingliang",
"surname": "Xu",
"fullName": "Mingliang Xu",
"affiliation": "Zhengzhou University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Chen",
"fullName": "Wei Chen",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "440-450",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bdva/2015/7343/0/07314302",
"title": "Situated Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314302/12OmNx7G5Tt",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223352",
"title": "Using augmented reality to support situated analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223352/12OmNzhELmY",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600q6969",
"title": "Learning Object Context for Novel-view Scene Layout Generation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600q6969/1H1iU88XYyI",
"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/09961953",
"title": "Heterogeneous Graph Neural Network With Multi-View Representation Learning",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09961953/1IxvQWCOYBa",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a105",
"title": "Toward Systematic Design Considerations of Organizing Multiple Views",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a105/1J6hb8c5Zde",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10029921",
"title": "Semi-Automatic Layout Adaptation for Responsive Multiple-View Visualization Design",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10029921/1KmyX4gJuMg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222323",
"title": "Composition and Configuration Patterns in Multiple-View Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222323/1nTqTQAK47K",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555226",
"title": "SightBi: Exploring Cross-View Data Relationships with Biclusters",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555226/1xjQVmm2wE0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09556579",
"title": "STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09556579/1xlw0LJ4OTm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/03/09645242",
"title": "Labeling Out-of-View Objects in Immersive Analytics to Support Situated Visual Searching",
"doi": null,
"abstractUrl": "/journal/tg/2023/03/09645242/1zc6DjegSGY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09906965",
"articleId": "1H5F2GJ31Ly",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09903598",
"articleId": "1GZojHNSlRm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yCyA6DcI",
"name": "ttg202301-09904883s1-tvcg-3209475-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09904883s1-tvcg-3209475-mm.zip",
"extension": "zip",
"size": "136 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1cG4MsovTO0",
"doi": "10.1109/TVCG.2019.2934283",
"abstract": "Interaction is fundamental to data visualization, but what “interaction” means in the context of visualization is ambiguous and confusing. We argue that this confusion is due to a lack of consensual definition. To tackle this problem, we start by synthesizing an inclusive view of interaction in the visualization community - including insights from information visualization, visual analytics and scientific visualization, as well as the input of both senior and junior visualization researchers. Once this view takes shape, we look at how interaction is defined in the field of human-computer interaction (HCI). By extracting commonalities and differences between the views of interaction in visualization and in HCI, we synthesize a definition of interaction for visualization. Our definition is meant to be a thinking tool and inspire novel and bolder interaction design practices. We hope that by better understanding what interaction in visualization is and what it can be, we will enrich the quality of interaction in visualization systems and empower those who use them.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interaction is fundamental to data visualization, but what “interaction” means in the context of visualization is ambiguous and confusing. We argue that this confusion is due to a lack of consensual definition. To tackle this problem, we start by synthesizing an inclusive view of interaction in the visualization community - including insights from information visualization, visual analytics and scientific visualization, as well as the input of both senior and junior visualization researchers. Once this view takes shape, we look at how interaction is defined in the field of human-computer interaction (HCI). By extracting commonalities and differences between the views of interaction in visualization and in HCI, we synthesize a definition of interaction for visualization. Our definition is meant to be a thinking tool and inspire novel and bolder interaction design practices. We hope that by better understanding what interaction in visualization is and what it can be, we will enrich the quality of interaction in visualization systems and empower those who use them.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interaction is fundamental to data visualization, but what “interaction” means in the context of visualization is ambiguous and confusing. We argue that this confusion is due to a lack of consensual definition. To tackle this problem, we start by synthesizing an inclusive view of interaction in the visualization community - including insights from information visualization, visual analytics and scientific visualization, as well as the input of both senior and junior visualization researchers. Once this view takes shape, we look at how interaction is defined in the field of human-computer interaction (HCI). By extracting commonalities and differences between the views of interaction in visualization and in HCI, we synthesize a definition of interaction for visualization. Our definition is meant to be a thinking tool and inspire novel and bolder interaction design practices. We hope that by better understanding what interaction in visualization is and what it can be, we will enrich the quality of interaction in visualization systems and empower those who use them.",
"title": "What is Interaction for Data Visualization?",
"normalizedTitle": "What is Interaction for Data Visualization?",
"fno": "08805424",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Human Computer Interaction",
"Data Visualization",
"Information Visualization",
"Visual Analytics",
"Scientific Visualization",
"Human Computer Interaction",
"Interaction Design",
"Visualization Systems",
"Data Visualization",
"Human Computer Interaction",
"Pipelines",
"Current Measurement",
"Tagging",
"Visual Analytics",
"Interaction",
"Visualization",
"Data",
"Definition",
"Human Computer Interaction"
],
"authors": [
{
"givenName": "Evanthia",
"surname": "Dimara",
"fullName": "Evanthia Dimara",
"affiliation": "Sorbonne University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles",
"surname": "Perin",
"fullName": "Charles Perin",
"affiliation": "University of Victoria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "119-129",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2011/0868/0/06004062",
"title": "What is Knowledge Visualization? Perspectives on an Emerging Discipline",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004062/12OmNAsTgVr",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429617",
"title": "Advanced interaction for Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429617/12OmNBqdr33",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2011/9618/0/05718615",
"title": "Expanding the Scope: Interaction Design Perspectives for Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2011/05718615/12OmNxGSm6x",
"parentPublication": {
"id": "proceedings/hicss/2011/9618/0",
"title": "2011 44th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122908",
"title": "The User Puzzle—Explaining the Interaction with Visual Analytics Systems",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122908/13rRUIIVlcH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/04376144",
"title": "Toward a Deeper Understanding of the Role of Interaction in Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/04376144/13rRUNvyakD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122106",
"title": "WYSIWYG (What You See is What You Get) Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122106/13rRUxCitJa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1224",
"title": "Toward a Deeper Understanding of the Role of Interaction in Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1224/13rRUxD9gXy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876050",
"title": "MovExp: A Versatile Visualization Tool for Human-Computer Interaction Studies with 3D Performance and Biomechanical Data",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876050/13rRUxDqS8j",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbdss/2020/9751/0/975100a101",
"title": "Bibliometric analysis of the core thesis system of Interaction Design Research on Human-Computer Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/icbdss/2020/975100a101/1tROBd3G0De",
"parentPublication": {
"id": "proceedings/icbdss/2020/9751/0",
"title": "2020 International Conference on Big Data and Social Sciences (ICBDSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552238",
"title": "What's the Situation with Situated Visualization? A Survey and Perspectives on Situatedness",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552238/1xic77YygOk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08812684",
"articleId": "1cPXz3IisTK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08805422",
"articleId": "1cG4ylx5qbC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H5ERCYJa48",
"doi": "10.1109/TVCG.2022.3209452",
"abstract": "Experts in racket sports like tennis and badminton use tactical analysis to gain insight into competitors' playing styles. Many data-driven methods apply pattern mining to racket sports data — which is often recorded as multivariate event sequences — to uncover sports tactics. However, tactics obtained in this way are often inconsistent with those deduced by experts through their domain knowledge, which can be confusing to those experts. This work introduces RASIPAM, a RAcket-Sports Interactive PAttern Mining system, which allows experts to incorporate their knowledge into data mining algorithms to discover meaningful tactics interactively. RASIPAM consists of a constraint-based pattern mining algorithm that responds to the analysis demands of experts: Experts provide suggestions for finding tactics in intuitive written language, and these suggestions are translated into constraints to run the algorithm. RASIPAM further introduces a tailored visual interface that allows experts to compare the new tactics with the original ones and decide whether to apply a given adjustment. This interactive workflow iteratively progresses until experts are satisfied with all tactics. We conduct a quantitative experiment to show that our algorithm supports real-time interaction. Two case studies in tennis and in badminton respectively, each involving two domain experts, are conducted to show the effectiveness and usefulness of the system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Experts in racket sports like tennis and badminton use tactical analysis to gain insight into competitors' playing styles. Many data-driven methods apply pattern mining to racket sports data — which is often recorded as multivariate event sequences — to uncover sports tactics. However, tactics obtained in this way are often inconsistent with those deduced by experts through their domain knowledge, which can be confusing to those experts. This work introduces RASIPAM, a RAcket-Sports Interactive PAttern Mining system, which allows experts to incorporate their knowledge into data mining algorithms to discover meaningful tactics interactively. RASIPAM consists of a constraint-based pattern mining algorithm that responds to the analysis demands of experts: Experts provide suggestions for finding tactics in intuitive written language, and these suggestions are translated into constraints to run the algorithm. RASIPAM further introduces a tailored visual interface that allows experts to compare the new tactics with the original ones and decide whether to apply a given adjustment. This interactive workflow iteratively progresses until experts are satisfied with all tactics. We conduct a quantitative experiment to show that our algorithm supports real-time interaction. Two case studies in tennis and in badminton respectively, each involving two domain experts, are conducted to show the effectiveness and usefulness of the system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Experts in racket sports like tennis and badminton use tactical analysis to gain insight into competitors' playing styles. Many data-driven methods apply pattern mining to racket sports data — which is often recorded as multivariate event sequences — to uncover sports tactics. However, tactics obtained in this way are often inconsistent with those deduced by experts through their domain knowledge, which can be confusing to those experts. This work introduces RASIPAM, a RAcket-Sports Interactive PAttern Mining system, which allows experts to incorporate their knowledge into data mining algorithms to discover meaningful tactics interactively. RASIPAM consists of a constraint-based pattern mining algorithm that responds to the analysis demands of experts: Experts provide suggestions for finding tactics in intuitive written language, and these suggestions are translated into constraints to run the algorithm. RASIPAM further introduces a tailored visual interface that allows experts to compare the new tactics with the original ones and decide whether to apply a given adjustment. This interactive workflow iteratively progresses until experts are satisfied with all tactics. We conduct a quantitative experiment to show that our algorithm supports real-time interaction. Two case studies in tennis and in badminton respectively, each involving two domain experts, are conducted to show the effectiveness and usefulness of the system.",
"title": "RASIPAM: Interactive Pattern Mining of Multivariate Event Sequences in Racket Sports",
"normalizedTitle": "RASIPAM: Interactive Pattern Mining of Multivariate Event Sequences in Racket Sports",
"fno": "09906966",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Mining",
"Sport",
"Constraint Based Pattern Mining Algorithm",
"Data Mining Algorithms",
"Data Driven Methods",
"Domain Experts",
"Meaningful Tactics",
"Multivariate Event Sequence Interactive Pattern Mining",
"Racket Sports Data",
"Racket Sports Interactive Pattern Mining System",
"RASIPAM",
"Sports Tactics",
"Tactical Analysis",
"Sports",
"Data Mining",
"Visual Analytics",
"Games",
"Data Visualization",
"Task Analysis",
"Systems Architecture",
"Sports Analytics",
"Multivariate Event Sequence",
"Interactive Pattern Mining",
"Comparative Visual Design"
],
"authors": [
{
"givenName": "Jiang",
"surname": "Wu",
"fullName": "Jiang Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongyu",
"surname": "Liu",
"fullName": "Dongyu Liu",
"affiliation": "MIT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ziyang",
"surname": "Guo",
"fullName": "Ziyang Guo",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "940-950",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bdva/2018/9194/0/08534022",
"title": "Revealing the Invisible: Visual Analytics and Explanatory Storytelling for Advanced Team Sport Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534022/17D45WODasQ",
"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/2023/01/09906970",
"title": "Tac-Trainer: A Visual Analytics System for IoT-based Racket Sports Training",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09906970/1H5EW63diWA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807264",
"title": "Tac-Simur: Tactic-based Simulative Visual Analytics of Table Tennis",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807264/1cG6vo24hRC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/2/260702a097",
"title": "Micro-Level Analysis and Visualization of Tennis Shot Patterns with Fractal Tables",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260702a097/1cYipyP6afS",
"parentPublication": {
"id": "compsac/2019/2607/2",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222314",
"title": "PassVizor: Toward Better Understanding of the Dynamics of Soccer Passes",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222314/1nTq1FTwhtC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222313",
"title": "ShuttleSpace: Exploring and Analyzing Movement Trajectory in Immersive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222313/1nTr29xEpkk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a036",
"title": "Visual Analytics of Multivariate Event Sequence Data in Racquet Sports",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a036/1q7jwkJx00U",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552436",
"title": "TacticFlow: Visual Analytics of Ever-Changing Tactics in Racket Sports",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552436/1xibYczQBfW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552848",
"title": "Augmenting Sports Videos with VisCommentator",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552848/1xibZGigO0o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557225",
"title": "TIVEE: Visual Exploration and Explanation of Badminton Tactics in Immersive Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557225/1xlvZlGiUsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904482",
"articleId": "1H0GhtN7zkA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09906970",
"articleId": "1H5EW63diWA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9ymLUSVry",
"name": "ttg202301-09906966s1-supp1-3209452.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09906966s1-supp1-3209452.pdf",
"extension": "pdf",
"size": "418 kB",
"__typename": "WebExtraType"
},
{
"id": "1J9ymHo9DNK",
"name": "ttg202301-09906966s1-supp2-3209452.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09906966s1-supp2-3209452.mp4",
"extension": "mp4",
"size": "12.8 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": "1nTr29xEpkk",
"doi": "10.1109/TVCG.2020.3030392",
"abstract": "We present ShuttleSpace, an immersive analytics system to assist experts in analyzing trajectory data in badminton. Trajectories in sports, such as the movement of players and balls, contain rich information on player behavior and thus have been widely analyzed by coaches and analysts to improve the players' performance. However, existing visual analytics systems often present the trajectories in court diagrams that are abstractions of reality, thereby causing difficulty for the experts to imagine the situation on the court and understand why the player acted in a certain way. With recent developments in immersive technologies, such as virtual reality (VR), experts gradually have the opportunity to see, feel, explore, and understand these 3D trajectories from the player's perspective. Yet, few research has studied how to support immersive analysis of sports data from such a perspective. Specific challenges are rooted in data presentation (e.g., how to seamlessly combine 2D and 3D visualizations) and interaction (e.g., how to naturally interact with data without keyboard and mouse) in VR. To address these challenges, we have worked closely with domain experts who have worked for a top national badminton team to design ShuttleSpace. Our system leverages 1) the peripheral vision to combine the 2D and 3D visualizations and 2) the VR controller to support natural interactions via a stroke metaphor. We demonstrate the effectiveness of ShuttleSpace through three case studies conducted by the experts with useful insights. We further conduct interviews with the experts whose feedback confirms that our first-person immersive analytics system is suitable and useful for analyzing badminton data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present ShuttleSpace, an immersive analytics system to assist experts in analyzing trajectory data in badminton. Trajectories in sports, such as the movement of players and balls, contain rich information on player behavior and thus have been widely analyzed by coaches and analysts to improve the players' performance. However, existing visual analytics systems often present the trajectories in court diagrams that are abstractions of reality, thereby causing difficulty for the experts to imagine the situation on the court and understand why the player acted in a certain way. With recent developments in immersive technologies, such as virtual reality (VR), experts gradually have the opportunity to see, feel, explore, and understand these 3D trajectories from the player's perspective. Yet, few research has studied how to support immersive analysis of sports data from such a perspective. Specific challenges are rooted in data presentation (e.g., how to seamlessly combine 2D and 3D visualizations) and interaction (e.g., how to naturally interact with data without keyboard and mouse) in VR. To address these challenges, we have worked closely with domain experts who have worked for a top national badminton team to design ShuttleSpace. Our system leverages 1) the peripheral vision to combine the 2D and 3D visualizations and 2) the VR controller to support natural interactions via a stroke metaphor. We demonstrate the effectiveness of ShuttleSpace through three case studies conducted by the experts with useful insights. We further conduct interviews with the experts whose feedback confirms that our first-person immersive analytics system is suitable and useful for analyzing badminton data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present ShuttleSpace, an immersive analytics system to assist experts in analyzing trajectory data in badminton. Trajectories in sports, such as the movement of players and balls, contain rich information on player behavior and thus have been widely analyzed by coaches and analysts to improve the players' performance. However, existing visual analytics systems often present the trajectories in court diagrams that are abstractions of reality, thereby causing difficulty for the experts to imagine the situation on the court and understand why the player acted in a certain way. With recent developments in immersive technologies, such as virtual reality (VR), experts gradually have the opportunity to see, feel, explore, and understand these 3D trajectories from the player's perspective. Yet, few research has studied how to support immersive analysis of sports data from such a perspective. Specific challenges are rooted in data presentation (e.g., how to seamlessly combine 2D and 3D visualizations) and interaction (e.g., how to naturally interact with data without keyboard and mouse) in VR. To address these challenges, we have worked closely with domain experts who have worked for a top national badminton team to design ShuttleSpace. Our system leverages 1) the peripheral vision to combine the 2D and 3D visualizations and 2) the VR controller to support natural interactions via a stroke metaphor. We demonstrate the effectiveness of ShuttleSpace through three case studies conducted by the experts with useful insights. We further conduct interviews with the experts whose feedback confirms that our first-person immersive analytics system is suitable and useful for analyzing badminton data.",
"title": "ShuttleSpace: Exploring and Analyzing Movement Trajectory in Immersive Visualization",
"normalizedTitle": "ShuttleSpace: Exploring and Analyzing Movement Trajectory in Immersive Visualization",
"fno": "09222313",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Interactive Systems",
"Sport",
"Virtual Reality",
"Stroke Metaphor",
"Peripheral Vision",
"2 D Visualization",
"3 D Visualization",
"3 D Trajectories",
"Movement Trajectory Analysis",
"Badminton Data Analysis",
"First Person Immersive Analytics System",
"Natural Interactions",
"National Badminton Team",
"Domain Experts",
"Data Presentation",
"Sports Data",
"Immersive Analysis",
"VR Controller",
"Virtual Reality",
"Immersive Technologies",
"Court Diagrams",
"Visual Analytics Systems",
"Coaches",
"Player Behavior",
"Trajectory Data",
"Shuttle Space",
"Immersive Visualization",
"Trajectory",
"Three Dimensional Displays",
"Sports",
"Data Visualization",
"Two Dimensional Displays",
"Visualization",
"Games",
"Movement Trajectory",
"Badminton Analytics",
"Virtual Reality"
],
"authors": [
{
"givenName": "Shuainan",
"surname": "Ye",
"fullName": "Shuainan Ye",
"affiliation": "State Key Lab of CAD CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhutian",
"surname": "Chen",
"fullName": "Zhutian Chen",
"affiliation": "Hong Kong University of Science and Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiangtong",
"surname": "Chu",
"fullName": "Xiangtong Chu",
"affiliation": "State Key Lab of CAD CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yifan",
"surname": "Wang",
"fullName": "Yifan Wang",
"affiliation": "State Key Lab of CAD CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siwei",
"surname": "Fu",
"fullName": "Siwei Fu",
"affiliation": "Zhejiang Lab",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lejun",
"surname": "Shen",
"fullName": "Lejun Shen",
"affiliation": "Chengdu Sports University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kun",
"surname": "Zhou",
"fullName": "Kun Zhou",
"affiliation": "State Key Lab of CAD CGZhejiang University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD CGZhejiang University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "860-869",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2019/01/08440808",
"title": "FiberClay: Sculpting Three Dimensional Trajectories to Reveal Structural Insights",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440808/17D45VTRozp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08534024",
"title": "Tangible Braille Plot: Tangibly Exploring Geo-Temporal Data in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534024/17D45WgziPn",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a093",
"title": "Exploring the Design Space for Immersive Embodiment in Dance",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a093/1CJc1vWLV6w",
"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/840200a936",
"title": "[DC] Immersive Analytics for Understanding Ecosystem Services Tradeoffs",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a936/1CJcFsf3SU0",
"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/icalt/2019/3485/0/348500a150",
"title": "A Visualization Tool for Analyzing an Assembly Training in VR",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2019/348500a150/1cYi21LcNX2",
"parentPublication": {
"id": "proceedings/icalt/2019/3485/2161-377X",
"title": "2019 IEEE 19th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08854316",
"title": "Evaluating an Immersive Space-Time Cube Geovisualization for Intuitive Trajectory Data Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08854316/1dM2fkHbAVa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl-hcc/2019/0810/0/08818856",
"title": "Studying the Benefits and Challenges of Immersive Dataflow Programming",
"doi": null,
"abstractUrl": "/proceedings-article/vl-hcc/2019/08818856/1dsfTwoG4TK",
"parentPublication": {
"id": "proceedings/vl-hcc/2019/0810/0",
"title": "2019 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08998292",
"title": "Immersive Process Model Exploration in Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08998292/1hpPCy1gJoI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/05/09382916",
"title": "Exploring the SenseMaking Process through Interactions and fNIRS in Immersive Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2021/05/09382916/1saZna718yY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557225",
"title": "TIVEE: Visual Exploration and Explanation of Badminton Tactics in Immersive Visualizations",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557225/1xlvZlGiUsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09222068",
"articleId": "1nTqzVqnWU0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09222360",
"articleId": "1nTq15PBXTq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1qLffx5Vf8I",
"name": "ttg202102-09222313s1-supp1-3030392.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222313s1-supp1-3030392.mp4",
"extension": "mp4",
"size": "63.6 MB",
"__typename": "WebExtraType"
},
{
"id": "1qLfi8KtOSI",
"name": "ttg202102-09222313s1-supp2-3030392.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222313s1-supp2-3030392.pdf",
"extension": "pdf",
"size": "1.71 MB",
"__typename": "WebExtraType"
},
{
"id": "1qLfiwAdy2A",
"name": "ttg202102-09222313s1-supp3-3030392.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202102-09222313s1-supp3-3030392.mp4",
"extension": "mp4",
"size": "61.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1ECXHMu0OWc",
"title": "Aug.",
"year": "2022",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1pLFQxpKDIY",
"doi": "10.1109/TVCG.2020.3046326",
"abstract": "In this article, a VR-based basketball training system comprising a standalone VR device and a tablet is proposed. The system is intended to improve the ability of players to understand offensive tactics and practice these tactics correctly. We compare the training effectiveness of various degrees of immersion, including a conventional basketball tactic board, a 2D monitor, and virtual reality. A multi-camera-based human tracking system was designed and built around a real-world basketball court to record and analyze the running trajectory of each player during tactical execution. The accuracy of the running path and hesitation time at each tactical step were evaluated for each participant. Furthermore, we assessed several subjective measurements, including simulator sickness, presence, and sport imagery ability, to conduct a more comprehensive exploration of the feasibility of the proposed VR framework for basketball tactics training. The results indicate that the proposed system is useful for learning complex tactics. Furthermore, high VR immersion training improves athletes’ abilities with regards to strategic imagery.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this article, a VR-based basketball training system comprising a standalone VR device and a tablet is proposed. The system is intended to improve the ability of players to understand offensive tactics and practice these tactics correctly. We compare the training effectiveness of various degrees of immersion, including a conventional basketball tactic board, a 2D monitor, and virtual reality. A multi-camera-based human tracking system was designed and built around a real-world basketball court to record and analyze the running trajectory of each player during tactical execution. The accuracy of the running path and hesitation time at each tactical step were evaluated for each participant. Furthermore, we assessed several subjective measurements, including simulator sickness, presence, and sport imagery ability, to conduct a more comprehensive exploration of the feasibility of the proposed VR framework for basketball tactics training. The results indicate that the proposed system is useful for learning complex tactics. Furthermore, high VR immersion training improves athletes’ abilities with regards to strategic imagery.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this article, a VR-based basketball training system comprising a standalone VR device and a tablet is proposed. The system is intended to improve the ability of players to understand offensive tactics and practice these tactics correctly. We compare the training effectiveness of various degrees of immersion, including a conventional basketball tactic board, a 2D monitor, and virtual reality. A multi-camera-based human tracking system was designed and built around a real-world basketball court to record and analyze the running trajectory of each player during tactical execution. The accuracy of the running path and hesitation time at each tactical step were evaluated for each participant. Furthermore, we assessed several subjective measurements, including simulator sickness, presence, and sport imagery ability, to conduct a more comprehensive exploration of the feasibility of the proposed VR framework for basketball tactics training. The results indicate that the proposed system is useful for learning complex tactics. Furthermore, high VR immersion training improves athletes’ abilities with regards to strategic imagery.",
"title": "Feasibility Study on Virtual Reality Based Basketball Tactic Training",
"normalizedTitle": "Feasibility Study on Virtual Reality Based Basketball Tactic Training",
"fno": "09303392",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Based Training",
"Sport",
"Virtual Reality",
"Virtual Reality Based Basketball Tactic Training",
"VR Based Basketball Training System Comprising",
"Offensive Tactics",
"Practice These Tactics",
"Training Effectiveness",
"Conventional Basketball Tactic Board",
"Multicamera Based Human Tracking System",
"Real World Basketball Court",
"Tactical Execution",
"Running Path",
"Hesitation Time",
"Tactical Step",
"Sport Imagery Ability",
"VR Framework",
"Basketball Tactics Training",
"Complex Tactics",
"High VR Immersion Training",
"Training",
"Sports",
"Videos",
"Three Dimensional Displays",
"Visualization",
"Two Dimensional Displays",
"Trajectory",
"Virtual Reality",
"Visualization",
"Basketball Training",
"Trajectory Analysis"
],
"authors": [
{
"givenName": "Wan-Lun",
"surname": "Tsai",
"fullName": "Wan-Lun Tsai",
"affiliation": "Multimedia Information System Lab, Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tse-Yu",
"surname": "Pan",
"fullName": "Tse-Yu Pan",
"affiliation": "National Tsing Hua University, Hsinchu, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min-Chun",
"surname": "Hu",
"fullName": "Min-Chun Hu",
"affiliation": "Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "2970-2982",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2016/05/07118240",
"title": "Court Reconstruction for Camera Calibration in Broadcast Basketball Videos",
"doi": null,
"abstractUrl": "/journal/tg/2016/05/07118240/13rRUwInvl4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2021/5841/0/584100b997",
"title": "Virtual Basketball Training Platform",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2021/584100b997/1EpL9jB4V2g",
"parentPublication": {
"id": "proceedings/csci/2021/5841/0",
"title": "2021 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859960",
"title": "Learning Robust Latent Space of Basketball Player Trajectories for Tactics Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859960/1G9EGpU5iZW",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciscet/2022/6044/0/604400a138",
"title": "Auxiliary Teaching System for Basketball Shooting Training based on Cloud Platform",
"doi": null,
"abstractUrl": "/proceedings-article/iciscet/2022/604400a138/1HbbQImfG1O",
"parentPublication": {
"id": "proceedings/iciscet/2022/6044/0",
"title": "2022 International Conference on Information System, Computing and Educational Technology (ICISCET)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798309",
"title": "Improve the Decision-making Skill of Basketball Players by an Action-aware VR Training System",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798309/1cJ1adrlIoo",
"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/2020/8508/0/850800a713",
"title": "An In-Depth Exploration of the Effect of 2D/3D Views and Controller Types on First Person Shooter Games in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a713/1pysuzo9dLi",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/06/09411869",
"title": "Tac-Miner: Visual Tactic Mining for Multiple Table Tennis Matches",
"doi": null,
"abstractUrl": "/journal/tg/2021/06/09411869/1t2ii7r7RcI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2021/1838/0/255600a131",
"title": "Diegetic Tool Management in a Virtual Reality Training Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2021/255600a131/1tuAgbFhYCQ",
"parentPublication": {
"id": "proceedings/vr/2021/1838/0",
"title": "2021 IEEE Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09446582",
"title": "Performance Improvement and Skill Transfer in Table Tennis Through Training in Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09446582/1u8lz4qWghi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tcs/2021/2910/0/291000a249",
"title": "Deepening path of data algorithm in technical and tactical analysis of College Volleyball Training",
"doi": null,
"abstractUrl": "/proceedings-article/tcs/2021/291000a249/1wRIhOsdQ7C",
"parentPublication": {
"id": "proceedings/tcs/2021/2910/0",
"title": "2021 International Conference on Information Technology and Contemporary Sports (TCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09301222",
"articleId": "1pK0Opgn59m",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09307276",
"articleId": "1pOZrP70lGM",
"__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": "1t2ii7r7RcI",
"doi": "10.1109/TVCG.2021.3074576",
"abstract": "In table tennis, tactics specified by three consecutive strokes represent the high-level competition strategies in matches. Effective detection and analysis of tactics can reveal the playing styles of players, as well as their strengths and weaknesses. However, tactical analysis in table tennis is challenging as the analysts can often be overwhelmed by the large quantity and high dimension of the data. Statistical charts have been extensively used by researchers to explore and visualize table tennis data. However, these charts cannot support efficient comparative and correlation analysis of complicated tactic attributes. Besides, existing studies are limited to the analysis of one match. However, one player's strategy can change along with his/her opponents in different matches. Therefore, the data of multiple matches can support a more comprehensive tactical analysis. To address these issues, we introduced a visual analytics system called Tac-Miner to allow analysts to effectively analyze, explore, and compare tactics of multiple matches based on the advanced embedding and dimension reduction algorithms along with an interactive glyph. We evaluate our glyph's usability through a user study and demonstrate the system's usefulness through a case study with insights approved by coaches and domain experts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In table tennis, tactics specified by three consecutive strokes represent the high-level competition strategies in matches. Effective detection and analysis of tactics can reveal the playing styles of players, as well as their strengths and weaknesses. However, tactical analysis in table tennis is challenging as the analysts can often be overwhelmed by the large quantity and high dimension of the data. Statistical charts have been extensively used by researchers to explore and visualize table tennis data. However, these charts cannot support efficient comparative and correlation analysis of complicated tactic attributes. Besides, existing studies are limited to the analysis of one match. However, one player's strategy can change along with his/her opponents in different matches. Therefore, the data of multiple matches can support a more comprehensive tactical analysis. To address these issues, we introduced a visual analytics system called Tac-Miner to allow analysts to effectively analyze, explore, and compare tactics of multiple matches based on the advanced embedding and dimension reduction algorithms along with an interactive glyph. We evaluate our glyph's usability through a user study and demonstrate the system's usefulness through a case study with insights approved by coaches and domain experts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In table tennis, tactics specified by three consecutive strokes represent the high-level competition strategies in matches. Effective detection and analysis of tactics can reveal the playing styles of players, as well as their strengths and weaknesses. However, tactical analysis in table tennis is challenging as the analysts can often be overwhelmed by the large quantity and high dimension of the data. Statistical charts have been extensively used by researchers to explore and visualize table tennis data. However, these charts cannot support efficient comparative and correlation analysis of complicated tactic attributes. Besides, existing studies are limited to the analysis of one match. However, one player's strategy can change along with his/her opponents in different matches. Therefore, the data of multiple matches can support a more comprehensive tactical analysis. To address these issues, we introduced a visual analytics system called Tac-Miner to allow analysts to effectively analyze, explore, and compare tactics of multiple matches based on the advanced embedding and dimension reduction algorithms along with an interactive glyph. We evaluate our glyph's usability through a user study and demonstrate the system's usefulness through a case study with insights approved by coaches and domain experts.",
"title": "Tac-Miner: Visual Tactic Mining for Multiple Table Tennis Matches",
"normalizedTitle": "Tac-Miner: Visual Tactic Mining for Multiple Table Tennis Matches",
"fno": "09411869",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Sport",
"Statistical Analysis",
"Dimension Reduction Algorithms",
"Advanced Embedding",
"Visual Analytics System",
"Comprehensive Tactical Analysis",
"Multiple Matches",
"Different Matches",
"Player",
"Complicated Tactic Attributes",
"Correlation Analysis",
"Efficient Comparative",
"Table Tennis Data",
"Statistical Charts",
"High Level Competition Strategies",
"Consecutive Strokes",
"Tactics",
"Multiple Table Tennis Matches",
"Visual Tactic Mining",
"Tac Miner",
"Sports",
"Data Visualization",
"Games",
"Visual Analytics",
"Task Analysis",
"Pattern Matching",
"Correlation",
"Table Tennis",
"Tactic",
"Multiple Matches",
"Glyph"
],
"authors": [
{
"givenName": "Jiachen",
"surname": "Wang",
"fullName": "Jiachen Wang",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiang",
"surname": "Wu",
"fullName": "Jiang Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anqi",
"surname": "Cao",
"fullName": "Anqi Cao",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zheng",
"surname": "Zhou",
"fullName": "Zheng Zhou",
"affiliation": "Department of Sport Science, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Zhang",
"fullName": "Hui Zhang",
"affiliation": "Department of Sport Science, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2021-06-01 00:00:00",
"pubType": "trans",
"pages": "2770-2782",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2018/01/08017600",
"title": "iTTVis: Interactive Visualization of Table Tennis Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017600/13rRUyY28YD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2018/8308/0/830800a318",
"title": "Research on Generating Three Stage Data of Both Sides in Table Tennis Competition with Excel",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2018/830800a318/17D45XtvpdB",
"parentPublication": {
"id": "proceedings/icicta/2018/8308/0",
"title": "2018 11th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icise-ie/2021/3829/0/382900b210",
"title": "Application of Micro-lecture in Table Tennis Teaching for Children",
"doi": null,
"abstractUrl": "/proceedings-article/icise-ie/2021/382900b210/1C8GamvUKGI",
"parentPublication": {
"id": "proceedings/icise-ie/2021/3829/0",
"title": "2021 2nd International Conference on Information Science and Education (ICISE-IE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09906966",
"title": "RASIPAM: Interactive Pattern Mining of Multivariate Event Sequences in Racket Sports",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09906966/1H5ERCYJa48",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08807264",
"title": "Tac-Simur: Tactic-based Simulative Visual Analytics of Table Tennis",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08807264/1cG6vo24hRC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/2/260702a097",
"title": "Micro-Level Analysis and Visualization of Tennis Shot Patterns with Fractal Tables",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260702a097/1cYipyP6afS",
"parentPublication": {
"id": "compsac/2019/2607/2",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08795584",
"title": "CourtTime: Generating Actionable Insights into Tennis Matches Using Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08795584/1csHUeq7TB6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a036",
"title": "Visual Analytics of Multivariate Event Sequence Data in Racquet Sports",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a036/1q7jwkJx00U",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2021/3892/0/389200a632",
"title": "Tactical Decision System of Table Tennis Match based on C4.5 Decision Tree",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2021/389200a632/1t2nmIZ5RBe",
"parentPublication": {
"id": "proceedings/icmtma/2021/3892/0",
"title": "2021 13th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tcs/2021/2910/0/291000a533",
"title": "A Study of Liu Shiwen’s Table Tennis Techniques and Tactics Based on Computer-aided Video",
"doi": null,
"abstractUrl": "/proceedings-article/tcs/2021/291000a533/1wRIl8gP8xW",
"parentPublication": {
"id": "proceedings/tcs/2021/2910/0",
"title": "2021 International Conference on Information Technology and Contemporary Sports (TCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09430173",
"articleId": "1tzuiF6azcs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09410458",
"articleId": "1sYYubtk9va",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xibYczQBfW",
"doi": "10.1109/TVCG.2021.3114832",
"abstract": "Event sequence mining is often used to summarize patterns from hundreds of sequences but faces special challenges when handling racket sports data. In racket sports (e.g., tennis and badminton), a player hitting the ball is considered a multivariate event consisting of multiple attributes (e.g., hit technique and ball position). A rally (i.e., a series of consecutive hits beginning with one player serving the ball and ending with one player winning a point) thereby can be viewed as a multivariate event sequence. Mining frequent patterns and depicting how patterns change over time is instructive and meaningful to players who want to learn more short-term competitive strategies (i.e., tactics) that encompass multiple hits. However, players in racket sports usually change their tactics rapidly according to the opponent's reaction, resulting in ever-changing tactic progression. In this work, we introduce a tailored visualization system built on a novel multivariate sequence pattern mining algorithm to facilitate explorative identification and analysis of various tactics and tactic progression. The algorithm can mine multiple non-overlapping multivariate patterns from hundreds of sequences effectively. Based on the mined results, we propose a glyph-based Sankey diagram to visualize the ever-changing tactic progression and support interactive data exploration. Through two case studies with four domain experts in tennis and badminton, we demonstrate that our system can effectively obtain insights about tactic progression in most racket sports. We further discuss the strengths and the limitations of our system based on domain experts' feedback.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Event sequence mining is often used to summarize patterns from hundreds of sequences but faces special challenges when handling racket sports data. In racket sports (e.g., tennis and badminton), a player hitting the ball is considered a multivariate event consisting of multiple attributes (e.g., hit technique and ball position). A rally (i.e., a series of consecutive hits beginning with one player serving the ball and ending with one player winning a point) thereby can be viewed as a multivariate event sequence. Mining frequent patterns and depicting how patterns change over time is instructive and meaningful to players who want to learn more short-term competitive strategies (i.e., tactics) that encompass multiple hits. However, players in racket sports usually change their tactics rapidly according to the opponent's reaction, resulting in ever-changing tactic progression. In this work, we introduce a tailored visualization system built on a novel multivariate sequence pattern mining algorithm to facilitate explorative identification and analysis of various tactics and tactic progression. The algorithm can mine multiple non-overlapping multivariate patterns from hundreds of sequences effectively. Based on the mined results, we propose a glyph-based Sankey diagram to visualize the ever-changing tactic progression and support interactive data exploration. Through two case studies with four domain experts in tennis and badminton, we demonstrate that our system can effectively obtain insights about tactic progression in most racket sports. We further discuss the strengths and the limitations of our system based on domain experts' feedback.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Event sequence mining is often used to summarize patterns from hundreds of sequences but faces special challenges when handling racket sports data. In racket sports (e.g., tennis and badminton), a player hitting the ball is considered a multivariate event consisting of multiple attributes (e.g., hit technique and ball position). A rally (i.e., a series of consecutive hits beginning with one player serving the ball and ending with one player winning a point) thereby can be viewed as a multivariate event sequence. Mining frequent patterns and depicting how patterns change over time is instructive and meaningful to players who want to learn more short-term competitive strategies (i.e., tactics) that encompass multiple hits. However, players in racket sports usually change their tactics rapidly according to the opponent's reaction, resulting in ever-changing tactic progression. In this work, we introduce a tailored visualization system built on a novel multivariate sequence pattern mining algorithm to facilitate explorative identification and analysis of various tactics and tactic progression. The algorithm can mine multiple non-overlapping multivariate patterns from hundreds of sequences effectively. Based on the mined results, we propose a glyph-based Sankey diagram to visualize the ever-changing tactic progression and support interactive data exploration. Through two case studies with four domain experts in tennis and badminton, we demonstrate that our system can effectively obtain insights about tactic progression in most racket sports. We further discuss the strengths and the limitations of our system based on domain experts' feedback.",
"title": "TacticFlow: Visual Analytics of Ever-Changing Tactics in Racket Sports",
"normalizedTitle": "TacticFlow: Visual Analytics of Ever-Changing Tactics in Racket Sports",
"fno": "09552436",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Mining",
"Data Visualisation",
"Sport",
"Tactics",
"Event Sequence Mining",
"Racket Sports Data",
"Tennis",
"Badminton",
"Hit Technique",
"Consecutive Hits",
"Multivariate Event Sequence",
"Mining Frequent Patterns",
"Multiple Hits",
"Tactic Progression",
"Novel Multivariate Sequence Pattern Mining Algorithm",
"Nonoverlapping Multivariate Patterns",
"Mined Results",
"Sports",
"Data Visualization",
"Visual Analytics",
"Data Models",
"Usability",
"Task Analysis",
"Pipelines",
"Sports Analytics",
"Multivariate Event Sequence",
"Sequential Pattern Mining",
"Progression Analysis"
],
"authors": [
{
"givenName": "Jiang",
"surname": "Wu",
"fullName": "Jiang Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongyu",
"surname": "Liu",
"fullName": "Dongyu Liu",
"affiliation": "Massachusetts Institute of Technology, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ziyang",
"surname": "Guo",
"fullName": "Ziyang Guo",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qingyang",
"surname": "Xu",
"fullName": "Qingyang Xu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yingcai",
"surname": "Wu",
"fullName": "Yingcai Wu",
"affiliation": "State Key Lab of CAD&CG, Zhejiang University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "835-845",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ismse/2004/2217/0/22170186",
"title": "Detecting Tactics Patterns for Archiving Tennis Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/ismse/2004/22170186/12OmNBtCCBd",
"parentPublication": {
"id": "proceedings/ismse/2004/2217/0",
"title": "Multimedia Software Engineering, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2012/4687/0/4687a068",
"title": "Real-Time Classification of Sports Movement Using Adaptive Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2012/4687a068/12OmNC4eSEH",
"parentPublication": {
"id": "proceedings/cisis/2012/4687/0",
"title": "2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000b830",
"title": "Soccer: Who Has the Ball? Generating Visual Analytics and Player Statistics",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000b830/17D45VObpOM",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08534022",
"title": "Revealing the Invisible: Visual Analytics and Explanatory Storytelling for Advanced Team Sport Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534022/17D45WODasQ",
"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/2023/01/09903338",
"title": "The Quest for : Embedded Visualization for Augmenting Basketball Game Viewing Experiences<inline-graphic xlink:href=\"tvcg-lin-3209353-graphic-1-source.tif\"/><bold/>",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903338/1GZojZ9otHO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09906966",
"title": "RASIPAM: Interactive Pattern Mining of Multivariate Event Sequences in Racket Sports",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09906966/1H5ERCYJa48",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09906970",
"title": "Tac-Trainer: A Visual Analytics System for IoT-based Racket Sports Training",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09906970/1H5EW63diWA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09911988",
"title": "Sporthesia: Augmenting Sports Videos Using Natural Language",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09911988/1HeiTHl8xxe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a036",
"title": "Visual Analytics of Multivariate Event Sequence Data in Racquet Sports",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a036/1q7jwkJx00U",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552848",
"title": "Augmenting Sports Videos with VisCommentator",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552848/1xibZGigO0o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09552848",
"articleId": "1xibZGigO0o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552250",
"articleId": "1xic6GuRQ76",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.