data
dict |
|---|
{
"issue": {
"id": "12OmNBO3K4V",
"title": "August",
"year": "1989",
"issueNum": "08",
"idPrefix": "tc",
"pubType": "journal",
"volume": "38",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJkR",
"doi": "10.1109/TC.1989.10006",
"abstract": "No abstract available.",
"abstracts": [
{
"abstractType": "Regular",
"content": "No abstract available.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "No abstract available.",
"title": "Guest Editorial",
"normalizedTitle": "Guest Editorial",
"fno": "t1057",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [],
"authors": [
{
"givenName": "S.S.",
"surname": "Yau",
"fullName": "S.S. Yau",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "1989-08-01 00:00:00",
"pubType": "trans",
"pages": "1057-1058",
"year": "1989",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "t1059",
"articleId": "13rRUxNEqUK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCcKQRh",
"title": "December",
"year": "1976",
"issueNum": "04",
"idPrefix": "ts",
"pubType": "journal",
"volume": "2",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvPLb9",
"doi": "10.1109/TSE.1976.233827",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editorial",
"normalizedTitle": "Guest Editorial",
"fno": "01702378",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "04",
"pubDate": "1976-10-01 00:00:00",
"pubType": "trans",
"pages": "237",
"year": "1976",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/1989/08/t1057",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/tc/1989/08/t1057/13rRUILtJkR",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2003/05/01234394",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/si/2003/05/01234394/13rRUwbs2e6",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1975/02/06312833",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/ts/1975/02/06312833/13rRUx0PqqV",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/04/01288168",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/04/01288168/13rRUxAStYr",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2006/07/01661616",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2006/07/01661616/13rRUxC0SU3",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1980/02/01702708",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1980/02/01702708/13rRUxNW20L",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1978/03/01702516",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1978/03/01702516/13rRUxcKzWF",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/04/08428604",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/tb/2018/04/08428604/13rRUyuNsEa",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01702377",
"articleId": "13rRUwwJWHi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01702379",
"articleId": "13rRUwgQpjI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy3iFnU",
"title": "Oct.",
"year": "2003",
"issueNum": "05",
"idPrefix": "si",
"pubType": "journal",
"volume": "11",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs2e6",
"doi": "10.1109/TVLSI.2003.818875",
"abstract": null,
"abstracts": [],
"normalizedAbstract": null,
"title": "Guest editorial",
"normalizedTitle": "Guest editorial",
"fno": "01234394",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Circuits",
"Clocks",
"Energy Consumption",
"Low Power Electronics",
"System Level Design",
"CMOS Technology",
"Semiconductor Device Modeling",
"Analytical Models",
"Threshold Voltage",
"Joining Processes"
],
"authors": [
{
"givenName": null,
"surname": "Vivek De",
"fullName": "Vivek De",
"affiliation": "University of Bologna",
"__typename": "ArticleAuthorType"
},
{
"givenName": "L.",
"surname": "Benini",
"fullName": "L. Benini",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "05",
"pubDate": "2003-09-01 00:00:00",
"pubType": "trans",
"pages": "753-754",
"year": "2003",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/lpe/1996/3571/0/00547543",
"title": "Static power driven voltage scaling and delay driven buffer sizing in Mixed Swing QuadRail for sub-1 V I/O swings",
"doi": null,
"abstractUrl": "/proceedings-article/lpe/1996/00547543/12OmNAlNiL9",
"parentPublication": {
"id": "proceedings/lpe/1996/3571/0",
"title": "Proceedings of 1996 International Symposium on Low Power Electronics and Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ddecs/2008/2276/0/04538744",
"title": "Deep-Submicron MOS Transistor Matching: A Case Study",
"doi": null,
"abstractUrl": "/proceedings-article/ddecs/2008/04538744/12OmNyRg4sI",
"parentPublication": {
"id": "proceedings/ddecs/2008/2276/0",
"title": "2008 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/04/01288168",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/04/01288168/13rRUxAStYr",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/dt/2010/02/mdt2010020006",
"title": "Guest Editors' Introduction: Compact Variability Modeling in Scaled CMOS Design",
"doi": null,
"abstractUrl": "/magazine/dt/2010/02/mdt2010020006/13rRUxASuIf",
"parentPublication": {
"id": "mags/dt",
"title": "IEEE Design & Test of Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2000/03/00845890",
"title": "Guest editorial: low-power electronics and design",
"doi": null,
"abstractUrl": "/journal/si/2000/03/00845890/13rRUxC0STY",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2006/07/01661616",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2006/07/01661616/13rRUxC0SU3",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/11/01350784",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/11/01350784/13rRUxCRFTM",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmiae/2022/7396/0/739600a089",
"title": "A Low Noise and Low Dissipative Front-end Circuit for Wearable ECG",
"doi": null,
"abstractUrl": "/proceedings-article/icmiae/2022/739600a089/1JgrDE8ruM0",
"parentPublication": {
"id": "proceedings/icmiae/2022/7396/0",
"title": "2022 International Conference on Manufacturing, Industrial Automation and Electronics (ICMIAE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "01234395",
"articleId": "13rRUxASu90",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxRWI3C",
"title": "November",
"year": "1981",
"issueNum": "06",
"idPrefix": "ts",
"pubType": "journal",
"volume": "7",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhpBPb",
"doi": "10.1109/TSE.1981.231121",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editorial",
"normalizedTitle": "Guest Editorial",
"fno": "01702885",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "1981-11-01 00:00:00",
"pubType": "trans",
"pages": "530",
"year": "1981",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/ts/1976/04/01702378",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1976/04/01702378/13rRUNvPLb9",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2003/05/01234394",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/si/2003/05/01234394/13rRUwbs2e6",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1975/02/06312833",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/ts/1975/02/06312833/13rRUx0PqqV",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/04/01288168",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/04/01288168/13rRUxAStYr",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2006/07/01661616",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2006/07/01661616/13rRUxC0SU3",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1980/02/01702708",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1980/02/01702708/13rRUxNW20L",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1978/03/01702516",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1978/03/01702516/13rRUxcKzWF",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/04/08428604",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/tb/2018/04/08428604/13rRUyuNsEa",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01702884",
"articleId": "13rRUwhHcKH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01702886",
"articleId": "13rRUwwJWHk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC3XhcY",
"title": "June",
"year": "1975",
"issueNum": "02",
"idPrefix": "ts",
"pubType": "journal",
"volume": "1",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0PqqV",
"doi": "10.1109/TSE.1975.6312833",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest editorial",
"normalizedTitle": "Guest editorial",
"fno": "06312833",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1975-04-01 00:00:00",
"pubType": "trans",
"pages": "137-139",
"year": "1975",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/1989/08/t1057",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/tc/1989/08/t1057/13rRUILtJkR",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1976/04/01702378",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1976/04/01702378/13rRUNvPLb9",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2003/05/01234394",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/si/2003/05/01234394/13rRUwbs2e6",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/04/01288168",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/04/01288168/13rRUxAStYr",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2006/07/01661616",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2006/07/01661616/13rRUxC0SU3",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1980/02/01702708",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1980/02/01702708/13rRUxNW20L",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1978/03/01702516",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1978/03/01702516/13rRUxcKzWF",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/04/08428604",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/tb/2018/04/08428604/13rRUyuNsEa",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06312832",
"articleId": "13rRUwbs22j",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06312830",
"articleId": "13rRUyYjK6l",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx5Yvqx",
"title": "Nov.",
"year": "2004",
"issueNum": "11",
"idPrefix": "si",
"pubType": "journal",
"volume": "12",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCRFTM",
"doi": "10.1109/TVLSI.2004.836278",
"abstract": null,
"abstracts": [],
"normalizedAbstract": null,
"title": "Guest Editorial",
"normalizedTitle": "Guest Editorial",
"fno": "01350784",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Nanoelectronics",
"Nanoscale Devices",
"Power System Modeling",
"Aerospace Industry",
"Aerospace Materials",
"Semiconductor Nanostructures",
"Design Methodology",
"Circuits And Systems",
"Automatic Control",
"Integrated Circuit Interconnections"
],
"authors": [
{
"givenName": "P.C.-Y.",
"surname": "Wu",
"fullName": "P.C.-Y. Wu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "M.E.",
"surname": "Zaghloul",
"fullName": "M.E. Zaghloul",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "J.-Y.",
"surname": "Jou",
"fullName": "J.-Y. Jou",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "11",
"pubDate": "2004-11-01 00:00:00",
"pubType": "trans",
"pages": "1129-1131",
"year": "2004",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/si/2003/05/01234394",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/si/2003/05/01234394/13rRUwbs2e6",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017632",
"title": "Multiscale Visualization and Scale-Adaptive Modification of DNA Nanostructures",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017632/13rRUwgyOjo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/04/01288168",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/04/01288168/13rRUxAStYr",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2006/07/01661616",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2006/07/01661616/13rRUxC0SU3",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1980/02/01702708",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1980/02/01702708/13rRUxNW20L",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1978/03/01702516",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1978/03/01702516/13rRUxcKzWF",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2002/02/00994996",
"title": "Guest editorial - system-level interconnect prediction",
"doi": null,
"abstractUrl": "/journal/si/2002/02/00994996/13rRUy3gnaO",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2018/12/08554356",
"title": "Guest Editorial Memristive-Device-Based Computing",
"doi": null,
"abstractUrl": "/journal/si/2018/12/08554356/17D45WHONqK",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01350783",
"articleId": "13rRUxBrGdT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01350785",
"articleId": "13rRUEgs2qW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNANBZkg",
"title": "Aug.",
"year": "2006",
"issueNum": "08",
"idPrefix": "si",
"pubType": "journal",
"volume": "14",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNEqN3",
"doi": "10.1109/TVLSI.2006.878467",
"abstract": null,
"abstracts": [],
"normalizedAbstract": null,
"title": "Guest Editorial",
"normalizedTitle": "Guest Editorial",
"fno": "01664900",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Hardware",
"Software Systems",
"Pipelines",
"Hazards",
"Embedded System",
"Arithmetic",
"Real Time Systems",
"Delay Systems",
"Network Synthesis",
"Design Methodology"
],
"authors": [],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "08",
"pubDate": "2006-08-01 00:00:00",
"pubType": "trans",
"pages": "789-790",
"year": "2006",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/ci/2016/04/07782476",
"title": "Guest Editorial Real-Time Strategy Games",
"doi": null,
"abstractUrl": "/journal/ci/2016/04/07782476/13rRUwInvMS",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2003/05/01234394",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/si/2003/05/01234394/13rRUwbs2e6",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/04/01288168",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/04/01288168/13rRUxAStYr",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2006/07/01661616",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2006/07/01661616/13rRUxC0SU3",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/11/01350784",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/11/01350784/13rRUxCRFTM",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1980/02/01702708",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1980/02/01702708/13rRUxNW20L",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/07/01308200",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/07/01308200/13rRUytWFeP",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2021/02/09434431",
"title": "Guest Editorial Argumentation-Based Reasoning",
"doi": null,
"abstractUrl": "/magazine/ex/2021/02/09434431/1tHMXe46WkM",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01664899",
"articleId": "13rRUEgs2Ju",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01664901",
"articleId": "13rRUEgs2Jv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzUgdjK",
"title": "July-Aug.",
"year": "2018",
"issueNum": "04",
"idPrefix": "tb",
"pubType": "journal",
"volume": "15",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuNsEa",
"doi": "10.1109/TCBB.2018.2856658",
"abstract": null,
"abstracts": [],
"normalizedAbstract": null,
"title": "Guest Editorial",
"normalizedTitle": "Guest Editorial",
"fno": "08428604",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [],
"authors": [
{
"givenName": "T. M.",
"surname": "Murali",
"fullName": "T. M. Murali",
"affiliation": "Department of Computer Science, Virginia Tech, Blacksburg, VA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "04",
"pubDate": "2018-07-01 00:00:00",
"pubType": "trans",
"pages": "1036",
"year": "2018",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/1989/08/t1057",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/tc/1989/08/t1057/13rRUILtJkR",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1976/04/01702378",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1976/04/01702378/13rRUNvPLb9",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2003/05/01234394",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/si/2003/05/01234394/13rRUwbs2e6",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1975/02/06312833",
"title": "Guest editorial",
"doi": null,
"abstractUrl": "/journal/ts/1975/02/06312833/13rRUx0PqqV",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2004/04/01288168",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2004/04/01288168/13rRUxAStYr",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2006/07/01661616",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/si/2006/07/01661616/13rRUxC0SU3",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1980/02/01702708",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1980/02/01702708/13rRUxNW20L",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1978/03/01702516",
"title": "Guest Editorial",
"doi": null,
"abstractUrl": "/journal/ts/1978/03/01702516/13rRUxcKzWF",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "08341495",
"articleId": "13rRUxBa5vR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxEjY3I",
"title": "May/June",
"year": "2005",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "11",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgxO9",
"doi": "10.1109/TVCG.2005.48",
"abstract": "In AR systems, registration is one of the most difficult problems currently limiting their application. In this paper, we propose a simple registration method using projective reconstruction. This method consists of two steps: embedding and tracking. Embedding involves specifying four points to build the world coordinate system on which a virtual object will be superimposed. In tracking, a projective reconstruction technique is used to track these four specified points to compute the model view transformation for augmentation. This method is simple, as only four points need to be specified at the embedding stage and the virtual object can then be easily augmented onto a real scene from a video sequence. In addition, it can be extended to a scenario using the projective matrix that has been obtained from previous registration results using the same AR system. The proposed method has three advantages: 1) It is fast because the linear least square method can be used to estimate the related matrix in the algorithm and it is not necessary to calculate the fundamental matrix in the extended case. 2) A virtual object can still be superimposed on a related area even if some parts of the specified area are occluded during the whole process. 3) This method is robust because it remains effective even when not all the reference points are detected during the whole process, as long as at least six pairs of related reference points correspondences can be found. Some experiments have been conducted to validate the performance of the proposed method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In AR systems, registration is one of the most difficult problems currently limiting their application. In this paper, we propose a simple registration method using projective reconstruction. This method consists of two steps: embedding and tracking. Embedding involves specifying four points to build the world coordinate system on which a virtual object will be superimposed. In tracking, a projective reconstruction technique is used to track these four specified points to compute the model view transformation for augmentation. This method is simple, as only four points need to be specified at the embedding stage and the virtual object can then be easily augmented onto a real scene from a video sequence. In addition, it can be extended to a scenario using the projective matrix that has been obtained from previous registration results using the same AR system. The proposed method has three advantages: 1) It is fast because the linear least square method can be used to estimate the related matrix in the algorithm and it is not necessary to calculate the fundamental matrix in the extended case. 2) A virtual object can still be superimposed on a related area even if some parts of the specified area are occluded during the whole process. 3) This method is robust because it remains effective even when not all the reference points are detected during the whole process, as long as at least six pairs of related reference points correspondences can be found. Some experiments have been conducted to validate the performance of the proposed method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In AR systems, registration is one of the most difficult problems currently limiting their application. In this paper, we propose a simple registration method using projective reconstruction. This method consists of two steps: embedding and tracking. Embedding involves specifying four points to build the world coordinate system on which a virtual object will be superimposed. In tracking, a projective reconstruction technique is used to track these four specified points to compute the model view transformation for augmentation. This method is simple, as only four points need to be specified at the embedding stage and the virtual object can then be easily augmented onto a real scene from a video sequence. In addition, it can be extended to a scenario using the projective matrix that has been obtained from previous registration results using the same AR system. The proposed method has three advantages: 1) It is fast because the linear least square method can be used to estimate the related matrix in the algorithm and it is not necessary to calculate the fundamental matrix in the extended case. 2) A virtual object can still be superimposed on a related area even if some parts of the specified area are occluded during the whole process. 3) This method is robust because it remains effective even when not all the reference points are detected during the whole process, as long as at least six pairs of related reference points correspondences can be found. Some experiments have been conducted to validate the performance of the proposed method.",
"title": "Registration Based on Projective Reconstruction Technique for Augmented Reality Systems",
"normalizedTitle": "Registration Based on Projective Reconstruction Technique for Augmented Reality Systems",
"fno": "v0254",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Registration",
"Projective Reconstruction",
"Tracking"
],
"authors": [
{
"givenName": "M.L.",
"surname": "Yuan",
"fullName": "M.L. Yuan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.K.",
"surname": "Ong",
"fullName": "S.K. Ong",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.Y.C.",
"surname": "Nee",
"fullName": "A.Y.C. Nee",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2005-05-01 00:00:00",
"pubType": "trans",
"pages": "254-264",
"year": "2005",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1996/7258/0/72580264",
"title": "From projective to Euclidean reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1996/72580264/12OmNAWYKIb",
"parentPublication": {
"id": "proceedings/cvpr/1996/7258/0",
"title": "Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwar/1999/0359/0/03590103",
"title": "Registration with a Zoom Lens Camera for Augmented Reality Applications",
"doi": null,
"abstractUrl": "/proceedings-article/iwar/1999/03590103/12OmNBkfRhh",
"parentPublication": {
"id": "proceedings/iwar/1999/0359/0",
"title": "Augmented Reality, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1997/7822/0/78220331",
"title": "Projective registration with difference decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1997/78220331/12OmNx0RIWi",
"parentPublication": {
"id": "proceedings/cvpr/1997/7822/0",
"title": "Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscid/2008/3311/2/3311b069",
"title": "Development Actuality and Application of Registration Technology in Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2008/3311b069/12OmNxFsmHr",
"parentPublication": {
"id": "proceedings/iscid/2008/3311/2",
"title": "2008 International Symposium on Computational Intelligence and Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/1995/7128/2/71281161",
"title": "Document registration using projective geometry",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/1995/71281161/12OmNyQGRVi",
"parentPublication": {
"id": "proceedings/icdar/1995/7128/2",
"title": "Proceedings of 3rd International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wgec/2009/3899/0/3899a354",
"title": "Projective Reconstruction from Line-Correspondence Based on Image Sequence",
"doi": null,
"abstractUrl": "/proceedings-article/wgec/2009/3899a354/12OmNz2TCDC",
"parentPublication": {
"id": "proceedings/wgec/2009/3899/0",
"title": "Genetic and Evolutionary Computing, International Conference on",
"__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/tg/2006/04/v0569",
"title": "Registration Using Natural Features for Augmented Reality Systems",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0569/13rRUxBJhFn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2001/04/i0418",
"title": "Minimal Projective Reconstruction Including Missing Data",
"doi": null,
"abstractUrl": "/journal/tp/2001/04/i0418/13rRUxZzAiv",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1994/10/i1036",
"title": "Projective Reconstruction and Invariants from Multiple Images",
"doi": null,
"abstractUrl": "/journal/tp/1994/10/i1036/13rRUypp58v",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0243",
"articleId": "13rRUxYINf3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0265",
"articleId": "13rRUwjoNwO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBpEeNr",
"title": "November/December",
"year": "2002",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "22",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyp7u1m",
"doi": "10.1109/MCG.2002.1046627",
"abstract": "The authors present a computer vision system for robust real-time tracking of natural features for augmented reality. This is based on the computation of a homography or projective transformation between the current image and a previously captured image of the scene. The authors describe the robust computation of this transformation and demonstrate several applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors present a computer vision system for robust real-time tracking of natural features for augmented reality. This is based on the computation of a homography or projective transformation between the current image and a previously captured image of the scene. The authors describe the robust computation of this transformation and demonstrate several applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors present a computer vision system for robust real-time tracking of natural features for augmented reality. This is based on the computation of a homography or projective transformation between the current image and a previously captured image of the scene. The authors describe the robust computation of this transformation and demonstrate several applications.",
"title": "Augmented Reality Camera Tracking with Homographies",
"normalizedTitle": "Augmented Reality Camera Tracking with Homographies",
"fno": "mcg2002060039",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Augmented Reality Computer Vision Tracking"
],
"authors": [
{
"givenName": "Simon",
"surname": "Prince",
"fullName": "Simon Prince",
"affiliation": "National University of Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ke",
"surname": "Xu",
"fullName": "Ke Xu",
"affiliation": "National University of Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adrian",
"surname": "Cheok",
"fullName": "Adrian Cheok",
"affiliation": "National University of Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2002-11-01 00:00:00",
"pubType": "mags",
"pages": "39-45",
"year": "2002",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg2002060024",
"articleId": "13rRUB7a1ie",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2002060046",
"articleId": "13rRUEgarva",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqESuig",
"title": "May/June",
"year": "2010",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5TQU",
"doi": "10.1109/TVCG.2009.74",
"abstract": "This paper presents a new method for voxelization of solid objects containing sharp details. Voxelization is a sampling process that transforms a continuously defined object into a discrete one represented as a voxel field. The voxel field can be used for rendering or other purposes, which often involve a reconstruction of a continuous approximation of the original object. Objects to be voxelized need to fulfill certain representability conditions; otherwise, disturbing artifacts appear during reconstruction. The method proposed here extends the traditional distance-based voxelization by an a-priori detection of sharp object details and their subsequent modification in such a way that the resulting object to be voxelized fulfills the representability conditions. The resulting discrete objects are represented by means of truncated (i.e., narrow-band) distance fields, which provide reduction of memory requirements and further processing by level set techniques. This approach is exemplified by two classes of solid objects that normally contain such sharp details: implicit solids and solids resulting from CSG operations. In both cases, the sharp details are rounded to a specific curvature dictated by the sampling distance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a new method for voxelization of solid objects containing sharp details. Voxelization is a sampling process that transforms a continuously defined object into a discrete one represented as a voxel field. The voxel field can be used for rendering or other purposes, which often involve a reconstruction of a continuous approximation of the original object. Objects to be voxelized need to fulfill certain representability conditions; otherwise, disturbing artifacts appear during reconstruction. The method proposed here extends the traditional distance-based voxelization by an a-priori detection of sharp object details and their subsequent modification in such a way that the resulting object to be voxelized fulfills the representability conditions. The resulting discrete objects are represented by means of truncated (i.e., narrow-band) distance fields, which provide reduction of memory requirements and further processing by level set techniques. This approach is exemplified by two classes of solid objects that normally contain such sharp details: implicit solids and solids resulting from CSG operations. In both cases, the sharp details are rounded to a specific curvature dictated by the sampling distance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a new method for voxelization of solid objects containing sharp details. Voxelization is a sampling process that transforms a continuously defined object into a discrete one represented as a voxel field. The voxel field can be used for rendering or other purposes, which often involve a reconstruction of a continuous approximation of the original object. Objects to be voxelized need to fulfill certain representability conditions; otherwise, disturbing artifacts appear during reconstruction. The method proposed here extends the traditional distance-based voxelization by an a-priori detection of sharp object details and their subsequent modification in such a way that the resulting object to be voxelized fulfills the representability conditions. The resulting discrete objects are represented by means of truncated (i.e., narrow-band) distance fields, which provide reduction of memory requirements and further processing by level set techniques. This approach is exemplified by two classes of solid objects that normally contain such sharp details: implicit solids and solids resulting from CSG operations. In both cases, the sharp details are rounded to a specific curvature dictated by the sampling distance.",
"title": "Enhanced Voxelization and Representation of Objects with Sharp Details in Truncated Distance Fields",
"normalizedTitle": "Enhanced Voxelization and Representation of Objects with Sharp Details in Truncated Distance Fields",
"fno": "ttg2010030484",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Voxelization",
"Truncated Distance Fields",
"Run Length Compression",
"CSG Operations",
"Sharp Details",
"Implicit Solids",
"Artifacts",
"Representability"
],
"authors": [
{
"givenName": "Pavol",
"surname": "Novotný",
"fullName": "Pavol Novotný",
"affiliation": "IBL Software Engineering, Mierova and Comenius University, Bratislava",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leonid I.",
"surname": "Dimitrov",
"fullName": "Leonid I. Dimitrov",
"affiliation": "Austrian Academy of Sciences, Vienna",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miloš",
"surname": "Šrámek",
"fullName": "Miloš Šrámek",
"affiliation": "Austrian Academy of Sciences, Vienna",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2010-05-01 00:00:00",
"pubType": "trans",
"pages": "484-498",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vg/2005/26/0/01500531",
"title": "Representation of objects with sharp details in truncated distance fields",
"doi": null,
"abstractUrl": "/proceedings-article/vg/2005/01500531/12OmNC2xhyX",
"parentPublication": {
"id": "proceedings/vg/2005/26/0",
"title": "Volume Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2004/2171/0/21710370",
"title": "CSG Operations with Voxelized Solids",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2004/21710370/12OmNy2Jtay",
"parentPublication": {
"id": "proceedings/cgi/2004/2171/0",
"title": "Proceedings. Computer Graphics International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/1/81831389",
"title": "Interpolation of the DC component of coded images using a rational filter",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81831389/12OmNzdoMHY",
"parentPublication": {
"id": "proceedings/icip/1997/8183/1",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010030468",
"articleId": "13rRUxlgxOg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010030499",
"articleId": "13rRUEgarBn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzZEAy6",
"title": "July/August",
"year": "2002",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "22",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB6Sq2M",
"doi": "10.1109/MCG.2002.1016700",
"abstract": "Soft objects are those everyday objects that deform significantly in response to their normal environment. Examples include cushions, plasticine and balloons filled with treacle. We present a new physically based model for animating soft objects. The model consists of two components: an elastic surface and a compressible fluid. The surface is represented as a mass spring system. The fluid is modelled using finite difference approximations to the Navier-Stokes equations of fluid flow. Unlike models that use implicit surfaces, surface tension is a natural feature of the model. Furthermore, the model avoids the problem of volume variation that is inherent in implicit surface animation. We illustrate the behavior of the soft object in environments with gravity and collisions with planes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Soft objects are those everyday objects that deform significantly in response to their normal environment. Examples include cushions, plasticine and balloons filled with treacle. We present a new physically based model for animating soft objects. The model consists of two components: an elastic surface and a compressible fluid. The surface is represented as a mass spring system. The fluid is modelled using finite difference approximations to the Navier-Stokes equations of fluid flow. Unlike models that use implicit surfaces, surface tension is a natural feature of the model. Furthermore, the model avoids the problem of volume variation that is inherent in implicit surface animation. We illustrate the behavior of the soft object in environments with gravity and collisions with planes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Soft objects are those everyday objects that deform significantly in response to their normal environment. Examples include cushions, plasticine and balloons filled with treacle. We present a new physically based model for animating soft objects. The model consists of two components: an elastic surface and a compressible fluid. The surface is represented as a mass spring system. The fluid is modelled using finite difference approximations to the Navier-Stokes equations of fluid flow. Unlike models that use implicit surfaces, surface tension is a natural feature of the model. Furthermore, the model avoids the problem of volume variation that is inherent in implicit surface animation. We illustrate the behavior of the soft object in environments with gravity and collisions with planes.",
"title": "A Fluid-Based Soft-Object Model",
"normalizedTitle": "A Fluid-Based Soft-Object Model",
"fno": "mcg2002040068",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Soft Object",
"Modeling",
"Animation",
"Fluid Model"
],
"authors": [
{
"givenName": "Daniel",
"surname": "Nixon",
"fullName": "Daniel Nixon",
"affiliation": "Quest Computing",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Richard",
"surname": "Lobb",
"fullName": "Richard Lobb",
"affiliation": "University of Auckland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2002-07-01 00:00:00",
"pubType": "mags",
"pages": "68-75",
"year": "2002",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg2002040058",
"articleId": "13rRUyg2jQ3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2002040076",
"articleId": "13rRUIJcWno",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbj",
"title": "Sept.",
"year": "2012",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdIOUH",
"doi": "10.1109/TVCG.2011.264",
"abstract": "The explosive or volcanic scenes in motion pictures involve complex turbulent flow as its temperature and density vary in space. To simulate this turbulent flow of an inhomogeneous fluid, we propose a simple and efficient framework. Instead of explicitly computing the complex motion of this fluid dynamical instability, we first approximate the average motion of the fluid. Then, the high-resolution dynamics is computed using our new extended version of the vortex particle method with baroclinity. This baroclinity term makes turbulent effects by generating new vortex particles according to temperature/density distributions. Using our method, we efficiently simulated a complex scene with varying density and temperature.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The explosive or volcanic scenes in motion pictures involve complex turbulent flow as its temperature and density vary in space. To simulate this turbulent flow of an inhomogeneous fluid, we propose a simple and efficient framework. Instead of explicitly computing the complex motion of this fluid dynamical instability, we first approximate the average motion of the fluid. Then, the high-resolution dynamics is computed using our new extended version of the vortex particle method with baroclinity. This baroclinity term makes turbulent effects by generating new vortex particles according to temperature/density distributions. Using our method, we efficiently simulated a complex scene with varying density and temperature.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The explosive or volcanic scenes in motion pictures involve complex turbulent flow as its temperature and density vary in space. To simulate this turbulent flow of an inhomogeneous fluid, we propose a simple and efficient framework. Instead of explicitly computing the complex motion of this fluid dynamical instability, we first approximate the average motion of the fluid. Then, the high-resolution dynamics is computed using our new extended version of the vortex particle method with baroclinity. This baroclinity term makes turbulent effects by generating new vortex particles according to temperature/density distributions. Using our method, we efficiently simulated a complex scene with varying density and temperature.",
"title": "Baroclinic Turbulence with Varying Density and Temperature",
"normalizedTitle": "Baroclinic Turbulence with Varying Density and Temperature",
"fno": "06042858",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Vortices",
"Computational Fluid Dynamics",
"Computer Animation",
"Flow Instability",
"Turbulence",
"Vortex Particles",
"Baroclinic Turbulence",
"Varying Density",
"Varying Temperature",
"Volcanic Scenes",
"Motion Pictures",
"Complex Turbulent Flow",
"Inhomogeneous Fluid",
"Complex Motion",
"Fluid Dynamical Instability",
"High Resolution Dynamics",
"Vortex Particle",
"Baroclinity Term",
"Turbulent Effects",
"Mathematical Model",
"Equations",
"Computational Modeling",
"Nonhomogeneous Media",
"Force",
"Computer Graphics",
"Heating",
"Vortex Particle Method",
"Fluid Animation",
"Variable Density",
"Turbulent Flow"
],
"authors": [
{
"givenName": null,
"surname": "Seung Woo Lee",
"fullName": "Seung Woo Lee",
"affiliation": "Youngwoo CNI, Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Doyub Kim",
"fullName": "Doyub Kim",
"affiliation": "Graphics Lab., Carnegie Mellon Univ., Pittsburgh, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Oh-young Song",
"fullName": "Oh-young Song",
"affiliation": "Dept. of Digital Contents, Sejong Univ., Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Hyeong-Seok Ko",
"fullName": "Hyeong-Seok Ko",
"affiliation": "Graphics & Media Lab., Seoul Nat. Univ., Seoul, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2012-09-01 00:00:00",
"pubType": "trans",
"pages": "1488-1495",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hpcasia/1997/7901/0/79010186",
"title": "Direct numerical simulation of jets in a cross turbulent boundary layer flow",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/1997/79010186/12OmNvlPkCR",
"parentPublication": {
"id": "proceedings/hpcasia/1997/7901/0",
"title": "High Performance Computing and Grid in Asia Pacific Region, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcmp-ugc/2009/3946/0/3946a073",
"title": "Implicit LES Computations with Applications to Micro Air Vehicles",
"doi": null,
"abstractUrl": "/proceedings-article/hpcmp-ugc/2009/3946a073/12OmNwvVrCm",
"parentPublication": {
"id": "proceedings/hpcmp-ugc/2009/3946/0",
"title": "HPCMP Users Group Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcasia/1997/7901/0/79010419",
"title": "Computational Method for the Prediction of Dynamic Response of Long-Span Bridges due to Unsteady Wind Load",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/1997/79010419/12OmNxzMnPS",
"parentPublication": {
"id": "proceedings/hpcasia/1997/7901/0",
"title": "High Performance Computing and Grid in Asia Pacific Region, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2009/3634/4/3634d358",
"title": "Study on Numerical Simulation of Single-Phase Injection Device Flow Flied",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2009/3634d358/12OmNy4IEY3",
"parentPublication": {
"id": "proceedings/icic/2009/3634/4",
"title": "2009 Second International Conference on Information and Computing Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicrosp/1996/7456/0/74560279",
"title": "Active Drag Reduction using Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nicrosp/1996/74560279/12OmNyRxFs9",
"parentPublication": {
"id": "proceedings/nicrosp/1996/7456/0",
"title": "Neural Networks for Identification, Control, and Robotics, International Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1993/4340/0/01263427",
"title": "Computational fluid mechanics and massively parallel processors",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1993/01263427/12OmNzBwGre",
"parentPublication": {
"id": "proceedings/sc/1993/4340/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/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": "proceedings/icdma/2010/4286/2/4286b007",
"title": "Numerical Simulation and Analysis of Flow and Heat Transfer in the High-Pressure Vortex Tube",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2010/4286b007/12OmNzuZUxs",
"parentPublication": {
"id": "proceedings/icdma/2010/4286/2",
"title": "2010 International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/02/i0193",
"title": "Extracting 3D Vortices in Turbulent Fluid Flow",
"doi": null,
"abstractUrl": "/journal/tp/1998/02/i0193/13rRUxASuTT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0600",
"title": "Digital Marbling: A Multiscale Fluid Model",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0600/13rRUy3gn7o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06025350",
"articleId": "13rRUygBw77",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06060816",
"articleId": "13rRUwInvyv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qq",
"title": "July-September",
"year": "2001",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "7",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2ti",
"doi": "10.1109/2945.942689",
"abstract": "Abstract—The concept of fairing applied to triangular meshes with irregular connectivity has become more and more important. Previous contributions proposed a variety of fairing operators for manifolds and applied them to design multiresolution representations and editing tools for meshes. In this paper, we generalize these powerful techniques to handle nonmanifold models. We propose a method to construct fairing operators for nonmanifolds which is based on standard operators for the manifold setting. Furthermore, we describe novel approaches to guarantee volume preservation. We introduce various multiresolution techniques that allow us to represent, smooth, and edit nonmanifold models efficiently. Finally, we discuss a semiautomatic feature preservation strategy to retain important model information during the fairing process.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The concept of fairing applied to triangular meshes with irregular connectivity has become more and more important. Previous contributions proposed a variety of fairing operators for manifolds and applied them to design multiresolution representations and editing tools for meshes. In this paper, we generalize these powerful techniques to handle nonmanifold models. We propose a method to construct fairing operators for nonmanifolds which is based on standard operators for the manifold setting. Furthermore, we describe novel approaches to guarantee volume preservation. We introduce various multiresolution techniques that allow us to represent, smooth, and edit nonmanifold models efficiently. Finally, we discuss a semiautomatic feature preservation strategy to retain important model information during the fairing process.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The concept of fairing applied to triangular meshes with irregular connectivity has become more and more important. Previous contributions proposed a variety of fairing operators for manifolds and applied them to design multiresolution representations and editing tools for meshes. In this paper, we generalize these powerful techniques to handle nonmanifold models. We propose a method to construct fairing operators for nonmanifolds which is based on standard operators for the manifold setting. Furthermore, we describe novel approaches to guarantee volume preservation. We introduce various multiresolution techniques that allow us to represent, smooth, and edit nonmanifold models efficiently. Finally, we discuss a semiautomatic feature preservation strategy to retain important model information during the fairing process.",
"title": "Multiresolution Methods for Nonmanifold Models",
"normalizedTitle": "Multiresolution Methods for Nonmanifold Models",
"fno": "v0207",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Boundary Representations",
"Surface Representations",
"Nonmanifold",
"Fairing",
"Geometric Modeling",
"Triangle Decimation",
"Multiresolution Models"
],
"authors": [
{
"givenName": "Andreas",
"surname": "Hubeli",
"fullName": "Andreas Hubeli",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Gross",
"fullName": "Markus Gross",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2001-07-01 00:00:00",
"pubType": "trans",
"pages": "207-221",
"year": "2001",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2001/1227/0/12270060",
"title": "Multiresolution Interpolation Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270060/12OmNAYGlnv",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/1997/8076/0/80760330",
"title": "A new algorithm for multiresolution isosurface extraction",
"doi": null,
"abstractUrl": "/proceedings-article/iv/1997/80760330/12OmNCcbEjd",
"parentPublication": {
"id": "proceedings/iv/1997/8076/0",
"title": "Proceedings. 1997 IEEE Conference on Information Visualization (Cat. No.97TB100165)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970018",
"title": "Time Critical Multiresolution Scene Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970018/12OmNqGRGjJ",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200hubeli",
"title": "Multiresolution Feature Extraction from Unstructured Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200hubeli/12OmNvSbBFB",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780071",
"title": "Fairing of Non-Manifolds for Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780071/12OmNvT2pjr",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/2000/6478/0/00885722",
"title": "Fairing of non-manifolds for visualization",
"doi": null,
"abstractUrl": "/proceedings-article/visual/2000/00885722/12OmNvoFjRI",
"parentPublication": {
"id": "proceedings/visual/2000/6478/0",
"title": "Proceedings Visualization 2000. VIS 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2010/3999/0/3999a135",
"title": "Adaptive Keyframing Animation on the GPU Using Triangle Strips",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2010/3999a135/12OmNx0RIZW",
"parentPublication": {
"id": "proceedings/iccsa/2010/3999/0",
"title": "2010 International Conference on Computational Science and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970010",
"title": "New quadric metric for simplifying meshes with appearance attributes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970010/12OmNzhELlZ",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/04/v0352",
"title": "Multiresolution Representation and Visualization of Volume Data",
"doi": null,
"abstractUrl": "/journal/tg/1997/04/v0352/13rRUNvgzis",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/02/v0113",
"title": "Wavelet-Based Multiresolution Analysis of Irregular Surface Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2004/02/v0113/13rRUxASu0B",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0195",
"articleId": "13rRUxcsYLC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0222",
"articleId": "13rRUwwJWFE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxGAKWq",
"title": "October-December",
"year": "2003",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "October-December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPTH",
"doi": "10.1109/TVCG.2003.1260742",
"abstract": "Abstract—This paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a complete selective refinement scheme for a progressive mesh based on the transformations and compare the scheme with previous selective refinement schemes in both theoretical and experimental ways. In our comparison, we show that the complete scheme always generates selectively refined meshes with smaller numbers of vertices and faces than previous schemes for a given refinement criterion. The concept of dual pieces of the vertices in the vertex hierarchy plays a central role in the analysis of the transitive mesh space and the design of selective edge collapse and vertex split transformations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a complete selective refinement scheme for a progressive mesh based on the transformations and compare the scheme with previous selective refinement schemes in both theoretical and experimental ways. In our comparison, we show that the complete scheme always generates selectively refined meshes with smaller numbers of vertices and faces than previous schemes for a given refinement criterion. The concept of dual pieces of the vertices in the vertex hierarchy plays a central role in the analysis of the transitive mesh space and the design of selective edge collapse and vertex split transformations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a complete selective refinement scheme for a progressive mesh based on the transformations and compare the scheme with previous selective refinement schemes in both theoretical and experimental ways. In our comparison, we show that the complete scheme always generates selectively refined meshes with smaller numbers of vertices and faces than previous schemes for a given refinement criterion. The concept of dual pieces of the vertices in the vertex hierarchy plays a central role in the analysis of the transitive mesh space and the design of selective edge collapse and vertex split transformations.",
"title": "Transitive Mesh Space of a Progressive Mesh",
"normalizedTitle": "Transitive Mesh Space of a Progressive Mesh",
"fno": "v0463",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Progressive Mesh",
"Selective Refinement",
"Selectively Refined Mesh",
"Transitive Mesh Space",
"Hierarchical Partitioning Property",
"Dual Piece",
"Valid Vertex Front"
],
"authors": [
{
"givenName": "Junho",
"surname": "Kim",
"fullName": "Junho Kim",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Seungyong",
"surname": "Lee",
"fullName": "Seungyong Lee",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2003-10-01 00:00:00",
"pubType": "trans",
"pages": "463-480",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0454",
"articleId": "13rRUxASuAn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0481",
"articleId": "13rRUxOdD2u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz5apx8",
"title": "April",
"year": "2015",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAASVV",
"doi": "10.1109/TVCG.2015.2391861",
"abstract": "A simple and cost-efficient method for extending a projector's depth-of-field (DOF) is proposed. By leveraging liquid lens technology, we can periodically modulate the focal length of a projector at a frequency that is higher than the critical flicker fusion (CFF) frequency. Fast periodic focal length modulation results in forward and backward sweeping of focusing distance. Fast focal sweep projection makes the point spread function (PSF) of each projected pixel integrated over a sweep period (IPSF; integrated PSF) nearly invariant to the distance from the projector to the projection surface as long as it is positioned within sweep range. This modulation is not perceivable by human observers. Once we compensate projection images for the IPSF, the projected results can be focused at any point within the range. Consequently, the proposed method requires only a single offline PSF measurement; thus, it is an open-loop process. We have proved the approximate invariance of the projector's IPSF both numerically and experimentally. Through experiments using a prototype system, we have confirmed that the image quality of the proposed method is superior to that of normal projection with fixed focal length. In addition, we demonstrate that a structured light pattern projection technique using the proposed method can measure the shape of an object with large depth variances more accurately than normal projection techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A simple and cost-efficient method for extending a projector's depth-of-field (DOF) is proposed. By leveraging liquid lens technology, we can periodically modulate the focal length of a projector at a frequency that is higher than the critical flicker fusion (CFF) frequency. Fast periodic focal length modulation results in forward and backward sweeping of focusing distance. Fast focal sweep projection makes the point spread function (PSF) of each projected pixel integrated over a sweep period (IPSF; integrated PSF) nearly invariant to the distance from the projector to the projection surface as long as it is positioned within sweep range. This modulation is not perceivable by human observers. Once we compensate projection images for the IPSF, the projected results can be focused at any point within the range. Consequently, the proposed method requires only a single offline PSF measurement; thus, it is an open-loop process. We have proved the approximate invariance of the projector's IPSF both numerically and experimentally. Through experiments using a prototype system, we have confirmed that the image quality of the proposed method is superior to that of normal projection with fixed focal length. In addition, we demonstrate that a structured light pattern projection technique using the proposed method can measure the shape of an object with large depth variances more accurately than normal projection techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A simple and cost-efficient method for extending a projector's depth-of-field (DOF) is proposed. By leveraging liquid lens technology, we can periodically modulate the focal length of a projector at a frequency that is higher than the critical flicker fusion (CFF) frequency. Fast periodic focal length modulation results in forward and backward sweeping of focusing distance. Fast focal sweep projection makes the point spread function (PSF) of each projected pixel integrated over a sweep period (IPSF; integrated PSF) nearly invariant to the distance from the projector to the projection surface as long as it is positioned within sweep range. This modulation is not perceivable by human observers. Once we compensate projection images for the IPSF, the projected results can be focused at any point within the range. Consequently, the proposed method requires only a single offline PSF measurement; thus, it is an open-loop process. We have proved the approximate invariance of the projector's IPSF both numerically and experimentally. Through experiments using a prototype system, we have confirmed that the image quality of the proposed method is superior to that of normal projection with fixed focal length. In addition, we demonstrate that a structured light pattern projection technique using the proposed method can measure the shape of an object with large depth variances more accurately than normal projection techniques.",
"title": "Extended Depth-of-Field Projector by Fast Focal Sweep Projection",
"normalizedTitle": "Extended Depth-of-Field Projector by Fast Focal Sweep Projection",
"fno": "07014259",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Display Instrumentation",
"Lenses",
"Optical Modulation",
"Optical Projectors",
"Optical Transfer Function",
"Extended Depth Of Field Projector",
"Fast Focal Sweep Projection",
"DOF",
"Critical Flicker Fusion Frequency",
"CFF Frequency",
"Fast Periodic Focal Length Modulation",
"Backward Sweeping",
"Forward Sweeping",
"Integrated Point Spread Function",
"IPSF",
"Projection Image Compensation",
"Open Loop Process",
"Structured Light Pattern Projection Technique",
"Liquid Lens Technology",
"Focusing",
"Frequency Modulation",
"Lenses",
"Cameras",
"Computational Modeling",
"Semiconductor Device Measurement",
"Projection Display",
"Extended Depth Of Field Projector",
"Focal Sweep",
"Immersive Virtual Reality",
"Spatial Augmented Reality"
],
"authors": [
{
"givenName": "Daisuke",
"surname": "Iwai",
"fullName": "Daisuke Iwai",
"affiliation": "Osaka University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shoichiro",
"surname": "Mihara",
"fullName": "Shoichiro Mihara",
"affiliation": "Osaka University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kosuke",
"surname": "Sato",
"fullName": "Kosuke Sato",
"affiliation": "Osaka University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2015-04-01 00:00:00",
"pubType": "trans",
"pages": "462-470",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccp/2018/2526/0/08368469",
"title": "Focal sweep imaging with multi-focal diffractive optics",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2018/08368469/12OmNBV9Ii2",
"parentPublication": {
"id": "proceedings/iccp/2018/2526/0",
"title": "2018 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a202",
"title": "Non-frontal Camera Calibration Using Focal Stack Imagery",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a202/12OmNC943xl",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2010/7023/0/05585101",
"title": "Spectral Focal Sweep: Extended depth of field from chromatic aberrations",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2010/05585101/12OmNrYCXIW",
"parentPublication": {
"id": "proceedings/iccp/2010/7023/0",
"title": "2010 IEEE International Conference on Computational Photography (ICCP 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d505",
"title": "Extended Depth of Field Catadioptric Imaging Using Focal Sweep",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d505/12OmNxEjXTz",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2013/6463/0/06528302",
"title": "Focal sweep videography with deformable optics",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2013/06528302/12OmNxUMHo6",
"parentPublication": {
"id": "proceedings/iccp/2013/6463/0",
"title": "2013 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2013/6463/0/06528297",
"title": "Coded focal stack photography",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2013/06528297/12OmNzy7uUc",
"parentPublication": {
"id": "proceedings/iccp/2013/6463/0",
"title": "2013 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/11/08007248",
"title": "Simultaneous Projection and Positioning of Laser Projector Pixels",
"doi": null,
"abstractUrl": "/journal/tg/2017/11/08007248/13rRUxASupD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2019/4765/0/476500a261",
"title": "A Projector Calibration Method Using a Mobile Camera for Projection Mapping System",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2019/476500a261/1gysikN6QOQ",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2019/4765/0",
"title": "2019 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08999805",
"title": "Illuminated Focus: Vision Augmentation using Spatial Defocusing via Focal Sweep Eyeglasses and High-Speed Projector",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08999805/1hpPCtKIAaA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/11/09523847",
"title": "Multifocal Stereoscopic Projection Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09523847/1wpqmNfLX9e",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07010977",
"articleId": "13rRUxcbnHc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07064856",
"articleId": "13rRUwjGoG5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesQd",
"name": "ttg201504-07014259s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201504-07014259s1.zip",
"extension": "zip",
"size": "49.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvAiSp1",
"title": "Nov.",
"year": "2018",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14M3DZx5FZe",
"doi": "10.1109/TVCG.2018.2868597",
"abstract": "This paper introduces a novel photometric compensation technique for inter-projector luminance and chrominance variations. Although it sounds as a classical technical issue, to the best of our knowledge there is no existing solution to alleviate the spatial non-uniformity among strongly heterogeneous projectors at perceptually acceptable quality. Primary goal of our method is increasing the perceived seamlessness of the projection system by automatically generating an improved and consistent visual quality. It builds upon the existing research of multi-projection systems, but instead of working with perceptually non-uniform color spaces such as CIEXYZ, the overall computation is carried out using the RLab [10, pp. 243–254] color appearance model which models the color processing in an adaptive, perceptual manner. Besides, we propose an adaptive color gamut acquisition, spatially varying gamut mapping, and optimization framework for edge blending. The paper describes the overall workflow and detailed algorithm of each component, followed by an evaluation validating the proposed method. The experimental results both qualitatively and quantitatively show the proposed method significant improved the visual quality of projected results of a multi-projection display with projectors with severely heterogeneous color processing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces a novel photometric compensation technique for inter-projector luminance and chrominance variations. Although it sounds as a classical technical issue, to the best of our knowledge there is no existing solution to alleviate the spatial non-uniformity among strongly heterogeneous projectors at perceptually acceptable quality. Primary goal of our method is increasing the perceived seamlessness of the projection system by automatically generating an improved and consistent visual quality. It builds upon the existing research of multi-projection systems, but instead of working with perceptually non-uniform color spaces such as CIEXYZ, the overall computation is carried out using the RLab [10, pp. 243–254] color appearance model which models the color processing in an adaptive, perceptual manner. Besides, we propose an adaptive color gamut acquisition, spatially varying gamut mapping, and optimization framework for edge blending. The paper describes the overall workflow and detailed algorithm of each component, followed by an evaluation validating the proposed method. The experimental results both qualitatively and quantitatively show the proposed method significant improved the visual quality of projected results of a multi-projection display with projectors with severely heterogeneous color processing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces a novel photometric compensation technique for inter-projector luminance and chrominance variations. Although it sounds as a classical technical issue, to the best of our knowledge there is no existing solution to alleviate the spatial non-uniformity among strongly heterogeneous projectors at perceptually acceptable quality. Primary goal of our method is increasing the perceived seamlessness of the projection system by automatically generating an improved and consistent visual quality. It builds upon the existing research of multi-projection systems, but instead of working with perceptually non-uniform color spaces such as CIEXYZ, the overall computation is carried out using the RLab [10, pp. 243–254] color appearance model which models the color processing in an adaptive, perceptual manner. Besides, we propose an adaptive color gamut acquisition, spatially varying gamut mapping, and optimization framework for edge blending. The paper describes the overall workflow and detailed algorithm of each component, followed by an evaluation validating the proposed method. The experimental results both qualitatively and quantitatively show the proposed method significant improved the visual quality of projected results of a multi-projection display with projectors with severely heterogeneous color processing.",
"title": "Seamless Multi-Projection Revisited",
"normalizedTitle": "Seamless Multi-Projection Revisited",
"fno": "08497080",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Image Color Analysis",
"Color",
"Adaptation Models",
"Computational Modeling",
"Visualization",
"Optimization",
"Three Dimensional Displays",
"Projector Camera Systems",
"Colorimetric Calibration",
"3 D Stereoscopic And Multi User Entertainment"
],
"authors": [
{
"givenName": "Petar",
"surname": "Pjanic",
"fullName": "Petar Pjanic",
"affiliation": "Disney Resaerch",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Willi",
"fullName": "Simon Willi",
"affiliation": "Disney Resaerch",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daisuke",
"surname": "Iwai",
"fullName": "Daisuke Iwai",
"affiliation": "Osaka University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anselm",
"surname": "Grundhöfer",
"fullName": "Anselm Grundhöfer",
"affiliation": "Disney Resaerch",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2018-11-01 00:00:00",
"pubType": "trans",
"pages": "2963-2973",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2013/4990/0/4990a924",
"title": "Practical Non-linear Photometric Projector Compensation",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2013/4990a924/12OmNBQkwYN",
"parentPublication": {
"id": "proceedings/cvprw/2013/4990/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2010/7029/0/05543467",
"title": "Display gamut reshaping for color emulation and balancing",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2010/05543467/12OmNyr8Ynx",
"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/vr/2018/3365/0/08446481",
"title": "Light Projection-Induced Illusion for Controlling Object Color",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446481/13bd1AITnaR",
"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/2004/02/v0177",
"title": "Color Nonuniformity in Projection-Based Displays: Analysis and Solutions",
"doi": null,
"abstractUrl": "/journal/tg/2004/02/v0177/13rRUwfI0PW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061317",
"title": "Color Seamlessness in Multi-Projector Displays Using Constrained Gamut Morphing",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061317/13rRUwgQpqH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/11/08007213",
"title": "Geometric and Photometric Consistency in a Mixed Video and Galvanoscopic Scanning Laser Projection Mapping System",
"doi": null,
"abstractUrl": "/journal/tg/2017/11/08007213/13rRUxcsYLX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0658",
"title": "Multifocal Projection: A Multiprojector Technique for Increasing Focal Depth",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0658/13rRUypp57x",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a750",
"title": "Perceptually-Based Optimization for Radiometric Projector Compensation",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a750/1CJd3VypH7G",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a880",
"title": "Apparent Shape Manipulation by Light-Field Projection onto a Retroreflective Surface",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a880/1CJfoGqGJvW",
"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/vr/2019/1377/0/08798347",
"title": "Perceptual Appearance Control by Projection-Induced Illusion",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798347/1cJ0Lhi0BQk",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08456568",
"articleId": "14M3DYlhYas",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08466636",
"articleId": "14M3DZXcLXa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1CpcG1DISYM",
"title": "May",
"year": "2022",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1B0XZ5wr7na",
"doi": "10.1109/TVCG.2022.3150488",
"abstract": "Projection mapping using multiple projectors is promising for spatial augmented reality; however, it is difficult to apply it to dynamic scenes. This is because the conventional method decides all pixel intensities of multiple images simultaneously based on the global optimization method, and it is hard to reduce the latency from motion to projection. To mitigate this, we propose a novel method of controlling the intensity based on a pixel-parallel calculation for each projector in real-time with low latency. This parallel calculation leverages the insight that the projected pixels from different projectors in overlapping areas can be approximated independently if the pixel is sufficiently small relative to the surface structure. Additionally, our pixel-parallel calculation method allows a distributed system configuration, such that the number of projectors can be increased to form a network for high scalability. We demonstrate a seamless mapping into dynamic scenes at 360 fps with a 9.5-ms latency using ten cameras and four projectors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Projection mapping using multiple projectors is promising for spatial augmented reality; however, it is difficult to apply it to dynamic scenes. This is because the conventional method decides all pixel intensities of multiple images simultaneously based on the global optimization method, and it is hard to reduce the latency from motion to projection. To mitigate this, we propose a novel method of controlling the intensity based on a pixel-parallel calculation for each projector in real-time with low latency. This parallel calculation leverages the insight that the projected pixels from different projectors in overlapping areas can be approximated independently if the pixel is sufficiently small relative to the surface structure. Additionally, our pixel-parallel calculation method allows a distributed system configuration, such that the number of projectors can be increased to form a network for high scalability. We demonstrate a seamless mapping into dynamic scenes at 360 fps with a 9.5-ms latency using ten cameras and four projectors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Projection mapping using multiple projectors is promising for spatial augmented reality; however, it is difficult to apply it to dynamic scenes. This is because the conventional method decides all pixel intensities of multiple images simultaneously based on the global optimization method, and it is hard to reduce the latency from motion to projection. To mitigate this, we propose a novel method of controlling the intensity based on a pixel-parallel calculation for each projector in real-time with low latency. This parallel calculation leverages the insight that the projected pixels from different projectors in overlapping areas can be approximated independently if the pixel is sufficiently small relative to the surface structure. Additionally, our pixel-parallel calculation method allows a distributed system configuration, such that the number of projectors can be increased to form a network for high scalability. We demonstrate a seamless mapping into dynamic scenes at 360 fps with a 9.5-ms latency using ten cameras and four projectors.",
"title": "Dynamic Multi-projection Mapping Based on Parallel Intensity Control",
"normalizedTitle": "Dynamic Multi-projection Mapping Based on Parallel Intensity Control",
"fno": "09714121",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Low Latency Communication",
"Shape",
"Image Color Analysis",
"Geometry",
"Surface Structures",
"Real Time Systems",
"Projection Mapping",
"Multi Projector",
"Parallel Computing Methodologies"
],
"authors": [
{
"givenName": "Takashi",
"surname": "Nomoto",
"fullName": "Takashi Nomoto",
"affiliation": "Tokyo Institute of Technology, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wanlong",
"surname": "Li",
"fullName": "Wanlong Li",
"affiliation": "Tokyo Institute of Technology, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hao-Lun",
"surname": "Peng",
"fullName": "Hao-Lun Peng",
"affiliation": "Tokyo Institute of Technology, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yoshihiro",
"surname": "Watanabe",
"fullName": "Yoshihiro Watanabe",
"affiliation": "Tokyo Institute of Technology, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2022-05-01 00:00:00",
"pubType": "trans",
"pages": "2125-2134",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ism/2017/2937/0/2937a114",
"title": "Detecting Good Surface for Improvisatory Visual Projection",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2017/2937a114/12OmNCd2roE",
"parentPublication": {
"id": "proceedings/ism/2017/2937/0",
"title": "2017 IEEE International Symposium on Multimedia (ISM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2010/7029/0/05543463",
"title": "Dynamic projection environments for immersive visualization",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2010/05543463/12OmNqI04Pu",
"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/3dv/2015/8332/0/8332a153",
"title": "Interference-Free Epipole-Centered Structured Light Pattern for Mirror-Based Multi-view Active Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a153/12OmNwJgAF8",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2005/2459/0/01544690",
"title": "Specular reflection elimination for projection-based augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2005/01544690/12OmNy6HQUD",
"parentPublication": {
"id": "proceedings/ismar/2005/2459/0",
"title": "Fourth IEEE and ACM International Symposium on Mixed and Augmented Reality (ISMAR'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev/2013/0400/0/06572619",
"title": "Three dimensional projection-type integral imaging display system using directional projection and elemental image resizing method",
"doi": null,
"abstractUrl": "/proceedings-article/iciev/2013/06572619/12OmNz2kqgu",
"parentPublication": {
"id": "proceedings/iciev/2013/0400/0",
"title": "2013 2nd International Conference on Informatics, Electronics and Vision (ICIEV 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/2001/7201/0/00964509",
"title": "Dynamic shadow removal from front projection displays",
"doi": null,
"abstractUrl": "/proceedings-article/visual/2001/00964509/12OmNzDehdU",
"parentPublication": {
"id": "proceedings/visual/2001/7201/0",
"title": "Proceedings VIS 2001. Visualization 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870011",
"title": "Interactive Maximum Projection Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870011/12OmNzZmZv2",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/11/08007213",
"title": "Geometric and Photometric Consistency in a Mixed Video and Galvanoscopic Scanning Laser Projection Mapping System",
"doi": null,
"abstractUrl": "/journal/tg/2017/11/08007213/13rRUxcsYLX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0658",
"title": "Multifocal Projection: A Multiprojector Technique for Increasing Focal Depth",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0658/13rRUypp57x",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2021/0158/0/015800a517",
"title": "Scan&Paint: Image-based Projection Painting",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2021/015800a517/1yeD6SIJJrG",
"parentPublication": {
"id": "proceedings/ismar/2021/0158/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09714042",
"articleId": "1B0XZrABGk8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09714051",
"articleId": "1B0Y0I5xWyk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1CpcXZHk2nS",
"name": "ttg202205-09714121s1-supp2-3150488.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202205-09714121s1-supp2-3150488.mp4",
"extension": "mp4",
"size": "224 MB",
"__typename": "WebExtraType"
},
{
"id": "1CpcYlp4i3K",
"name": "ttg202205-09714121s1-supp1-3150488.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202205-09714121s1-supp1-3150488.pdf",
"extension": "pdf",
"size": "4.13 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDqsVE",
"title": "August",
"year": "2005",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "27",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInv5q",
"doi": "10.1109/TPAMI.2005.158",
"abstract": "This paper presents a technique for computing the geometry of objects with general reflectance properties from images. For surfaces with varying material properties, a full segmentation into different material types is also computed. It is assumed that the camera viewpoint is fixed, but the illumination varies over the input sequence. It is also assumed that one or more example objects with similar materials and known geometry are imaged under the same illumination conditions. Unlike most previous work in shape reconstruction, this technique can handle objects with arbitrary and spatially-varying BRDFs. Furthermore, the approach works for arbitrary distant and unknown lighting environments. Finally, almost no calibration is needed, making the approach exceptionally simple to apply.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a technique for computing the geometry of objects with general reflectance properties from images. For surfaces with varying material properties, a full segmentation into different material types is also computed. It is assumed that the camera viewpoint is fixed, but the illumination varies over the input sequence. It is also assumed that one or more example objects with similar materials and known geometry are imaged under the same illumination conditions. Unlike most previous work in shape reconstruction, this technique can handle objects with arbitrary and spatially-varying BRDFs. Furthermore, the approach works for arbitrary distant and unknown lighting environments. Finally, almost no calibration is needed, making the approach exceptionally simple to apply.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a technique for computing the geometry of objects with general reflectance properties from images. For surfaces with varying material properties, a full segmentation into different material types is also computed. It is assumed that the camera viewpoint is fixed, but the illumination varies over the input sequence. It is also assumed that one or more example objects with similar materials and known geometry are imaged under the same illumination conditions. Unlike most previous work in shape reconstruction, this technique can handle objects with arbitrary and spatially-varying BRDFs. Furthermore, the approach works for arbitrary distant and unknown lighting environments. Finally, almost no calibration is needed, making the approach exceptionally simple to apply.",
"title": "Example-Based Photometric Stereo: Shape Reconstruction with General, Varying BRDFs",
"normalizedTitle": "Example-Based Photometric Stereo: Shape Reconstruction with General, Varying BRDFs",
"fno": "i1254",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Index Terms Photometric Stereo",
"Shape Reconstruction",
"Shape From Shading",
"Bidirectional Reflectance Distribution Function BRDF",
"Specular Materials",
"Clustering Materials"
],
"authors": [
{
"givenName": "Aaron",
"surname": "Hertzmann",
"fullName": "Aaron Hertzmann",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven M.",
"surname": "Seitz",
"fullName": "Steven M. Seitz",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2005-08-01 00:00:00",
"pubType": "trans",
"pages": "1254-1264",
"year": "2005",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2003/1900/1/190010533",
"title": "Shape and Materials by Example: A Photometric Stereo Approach",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2003/190010533/12OmNAMbZH9",
"parentPublication": {
"id": "proceedings/cvpr/2003/1900/1",
"title": "2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2012/4873/0/4873a547",
"title": "Multi-view Photometric Stereo Using Semi-isometric Mappings",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2012/4873a547/12OmNAWpyrT",
"parentPublication": {
"id": "proceedings/3dimpvt/2012/4873/0",
"title": "2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cerma/2009/3799/0/3799a163",
"title": "A Mobile Data Acquisition Platform for Photometric Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cerma/2009/3799a163/12OmNBOCWyS",
"parentPublication": {
"id": "proceedings/cerma/2009/3799/0",
"title": "Electronics, Robotics and Automotive Mechanics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995603",
"title": "A theory of differential photometric stereo for unknown isotropic BRDFs",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995603/12OmNCzb9vc",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2005/2327/0/23270326",
"title": "Efficient Photometric Stereo Technique for Three-Dimensional Surfaces with Unknown BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2005/23270326/12OmNyQpgXH",
"parentPublication": {
"id": "proceedings/3dim/2005/2327/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2008/08/ttp2008081460",
"title": "Subpixel Photometric Stereo",
"doi": null,
"abstractUrl": "/journal/tp/2008/08/ttp2008081460/13rRUEgs2N4",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/06/ttp2010061060",
"title": "Shape and Spatially-Varying BRDFs from Photometric Stereo",
"doi": null,
"abstractUrl": "/journal/tp/2010/06/ttp2010061060/13rRUEgs2uq",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1996/04/i0449",
"title": "Extracting the Shape and Roughness of Specular Lobe Objects Using Four Light Photometric Stereo",
"doi": null,
"abstractUrl": "/journal/tp/1996/04/i0449/13rRUx0xPJA",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600d125",
"title": "Multi-View Photometric Stereo Revisited",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600d125/1L8qBv9YZZS",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i1239",
"articleId": "13rRUILtJAO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1265",
"articleId": "13rRUIJcWmi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstaX",
"title": "July",
"year": "1990",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "12",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyfbwrH",
"doi": "10.1109/34.56209",
"abstract": "The camera calibration process relates camera system measurements (pixels) to known reference points in a three-dimensional world coordinate system. The calibration process is viewed as consisting of two independent phases: the first is removing geometrical camera distortion so that rectangular calibration grids are straightened in the image plane, and the second is using a linear affine transformation as a map between the rectified camera coordinates and the geometrically projected coordinates on the image plane of known reference points. Phase one is camera-dependent, and in some systems may be unnecessary. Phase two is concerned with a generic model that includes 12 extrinsic variables and up to five intrinsic parameters. General methods handling additional constraints on the intrinsic variables in a manner consistent with explicit satisfaction of all six constraints on the orthogonal rotation matrix are presented. The use of coplanar and noncoplanar calibration points is described.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The camera calibration process relates camera system measurements (pixels) to known reference points in a three-dimensional world coordinate system. The calibration process is viewed as consisting of two independent phases: the first is removing geometrical camera distortion so that rectangular calibration grids are straightened in the image plane, and the second is using a linear affine transformation as a map between the rectified camera coordinates and the geometrically projected coordinates on the image plane of known reference points. Phase one is camera-dependent, and in some systems may be unnecessary. Phase two is concerned with a generic model that includes 12 extrinsic variables and up to five intrinsic parameters. General methods handling additional constraints on the intrinsic variables in a manner consistent with explicit satisfaction of all six constraints on the orthogonal rotation matrix are presented. The use of coplanar and noncoplanar calibration points is described.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The camera calibration process relates camera system measurements (pixels) to known reference points in a three-dimensional world coordinate system. The calibration process is viewed as consisting of two independent phases: the first is removing geometrical camera distortion so that rectangular calibration grids are straightened in the image plane, and the second is using a linear affine transformation as a map between the rectified camera coordinates and the geometrically projected coordinates on the image plane of known reference points. Phase one is camera-dependent, and in some systems may be unnecessary. Phase two is concerned with a generic model that includes 12 extrinsic variables and up to five intrinsic parameters. General methods handling additional constraints on the intrinsic variables in a manner consistent with explicit satisfaction of all six constraints on the orthogonal rotation matrix are presented. The use of coplanar and noncoplanar calibration points is described.",
"title": "A Unified Approach to the Linear Camera Calibration Problem",
"normalizedTitle": "A Unified Approach to the Linear Camera Calibration Problem",
"fno": "i0663",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"3 D World Coordinate Systems Geometrical Distortion Coplanar Calibration Linear Camera Calibration Image Plane Linear Affine Transformation Extrinsic Variables Intrinsic Variables Orthogonal Rotation Matrix Noncoplanar Calibration Calibration Cameras Computer Vision Picture Processing"
],
"authors": [
{
"givenName": "W.I.",
"surname": "Grosky",
"fullName": "W.I. Grosky",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "L.A.",
"surname": "Tamburino",
"fullName": "L.A. Tamburino",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "1990-07-01 00:00:00",
"pubType": "trans",
"pages": "663-671",
"year": "1990",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0658",
"articleId": "13rRUygT7yV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0671",
"articleId": "13rRUwI5Uh5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC1oT5u",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "35",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7oc",
"doi": "10.1109/TPAMI.2012.217",
"abstract": "This paper presents a comprehensive theory of photometric surface reconstruction from image derivatives in the presence of a general, unknown isotropic BRDF. We derive precise topological classes up to which the surface may be determined and specify exact priors for a full geometric reconstruction. These results are the culmination of a series of fundamental observations. First, we exploit the linearity of chain rule differentiation to discover photometric invariants that relate image derivatives to the surface geometry, regardless of the form of isotropic BRDF. For the problem of shape-from-shading, we show that a reconstruction may be performed up to isocontours of constant magnitude of the gradient. For the problem of photometric stereo, we show that just two measurements of spatial and temporal image derivatives, from unknown light directions on a circle, suffice to recover surface information from the photometric invariant. Surprisingly, the form of the invariant bears a striking resemblance to optical flow; however, it does not suffer from the aperture problem. This photometric flow is shown to determine the surface up to isocontours of constant magnitude of the surface gradient, as well as isocontours of constant depth. Further, we prove that specification of the surface normal at a single point completely determines the surface depth from these isocontours. In addition, we propose practical algorithms that require additional initial or boundary information, but recover depth from lower order derivatives. Our theoretical results are illustrated with several examples on synthetic and real data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a comprehensive theory of photometric surface reconstruction from image derivatives in the presence of a general, unknown isotropic BRDF. We derive precise topological classes up to which the surface may be determined and specify exact priors for a full geometric reconstruction. These results are the culmination of a series of fundamental observations. First, we exploit the linearity of chain rule differentiation to discover photometric invariants that relate image derivatives to the surface geometry, regardless of the form of isotropic BRDF. For the problem of shape-from-shading, we show that a reconstruction may be performed up to isocontours of constant magnitude of the gradient. For the problem of photometric stereo, we show that just two measurements of spatial and temporal image derivatives, from unknown light directions on a circle, suffice to recover surface information from the photometric invariant. Surprisingly, the form of the invariant bears a striking resemblance to optical flow; however, it does not suffer from the aperture problem. This photometric flow is shown to determine the surface up to isocontours of constant magnitude of the surface gradient, as well as isocontours of constant depth. Further, we prove that specification of the surface normal at a single point completely determines the surface depth from these isocontours. In addition, we propose practical algorithms that require additional initial or boundary information, but recover depth from lower order derivatives. Our theoretical results are illustrated with several examples on synthetic and real data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a comprehensive theory of photometric surface reconstruction from image derivatives in the presence of a general, unknown isotropic BRDF. We derive precise topological classes up to which the surface may be determined and specify exact priors for a full geometric reconstruction. These results are the culmination of a series of fundamental observations. First, we exploit the linearity of chain rule differentiation to discover photometric invariants that relate image derivatives to the surface geometry, regardless of the form of isotropic BRDF. For the problem of shape-from-shading, we show that a reconstruction may be performed up to isocontours of constant magnitude of the gradient. For the problem of photometric stereo, we show that just two measurements of spatial and temporal image derivatives, from unknown light directions on a circle, suffice to recover surface information from the photometric invariant. Surprisingly, the form of the invariant bears a striking resemblance to optical flow; however, it does not suffer from the aperture problem. This photometric flow is shown to determine the surface up to isocontours of constant magnitude of the surface gradient, as well as isocontours of constant depth. Further, we prove that specification of the surface normal at a single point completely determines the surface depth from these isocontours. In addition, we propose practical algorithms that require additional initial or boundary information, but recover depth from lower order derivatives. Our theoretical results are illustrated with several examples on synthetic and real data.",
"title": "On Differential Photometric Reconstruction for Unknown, Isotropic BRDFs",
"normalizedTitle": "On Differential Photometric Reconstruction for Unknown, Isotropic BRDFs",
"fno": "ttp2013122941",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Light Sources",
"Differential Theory",
"Image Reconstruction",
"Surface Reconstruction",
"Lighting",
"Photometric Measurements",
"Differential Theory",
"Surface Reconstruction",
"General BRDF",
"Photometric Invariants"
],
"authors": [
{
"givenName": "Manmohan",
"surname": "Chandraker",
"fullName": "Manmohan Chandraker",
"affiliation": "NEC Labs. America, Inc., Cupertino, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jiamin Bai",
"fullName": "Jiamin Bai",
"affiliation": "Electr. Eng. & Comput. Sci. Dept., Univ. of California, Berkeley, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ravi",
"surname": "Ramamoorthi",
"fullName": "Ravi Ramamoorthi",
"affiliation": "Electr. Eng. & Comput. Sci. Dept., Univ. of California, Berkeley, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2941-2955",
"year": "2013",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2014/5118/0/5118c179",
"title": "What Camera Motion Reveals about Shape with Unknown BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c179/12OmNBqMDzR",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995603",
"title": "A theory of differential photometric stereo for unknown isotropic BRDFs",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995603/12OmNCzb9vc",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1999/0149/1/01491119",
"title": "An Integral Formulation for Differential Photometric Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1999/01491119/12OmNqBKU5y",
"parentPublication": {
"id": "proceedings/cvpr/1999/0149/2",
"title": "Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/1995/7190/0/71900419",
"title": "Reduction of rank-reduced orientation-from-color problem with many unknown lights to two-image known-illuminant photometric stereo",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/1995/71900419/12OmNyGtjdd",
"parentPublication": {
"id": "proceedings/iscv/1995/7190/0",
"title": "Computer Vision, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2005/2327/0/23270326",
"title": "Efficient Photometric Stereo Technique for Three-Dimensional Surfaces with Unknown BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2005/23270326/12OmNyQpgXH",
"parentPublication": {
"id": "proceedings/3dim/2005/2327/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032f372",
"title": "Reflectance Capture Using Univariate Sampling of BRDFs",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032f372/12OmNz6iOHS",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04408881",
"title": "Toward Reconstructing Surfaces With Arbitrary Isotropic Reflectance : A Stratified Photometric Stereo Approach",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04408881/12OmNzcPAFm",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/07/07274730",
"title": "The Information Available to a Moving Observer on Shape with Unknown, Isotropic BRDFs",
"doi": null,
"abstractUrl": "/journal/tp/2016/07/07274730/13rRUB6Sq1G",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/10/07006767",
"title": "From Intensity Profile to Surface Normal: Photometric Stereo for Unknown Light Sources and Isotropic Reflectances",
"doi": null,
"abstractUrl": "/journal/tp/2015/10/07006767/13rRUxbTMAi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300b052",
"title": "A Differential Volumetric Approach to Multi-View Photometric Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300b052/1hVlAZv5zfG",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2013122930",
"articleId": "13rRUxjQywz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2013122956",
"articleId": "13rRUxlgxUz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwdL7lu",
"title": "July/August",
"year": "2006",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfZC02",
"doi": "10.1109/TVCG.2006.73",
"abstract": "Abstract—The objective of this paper is to propose an efficient model-based bit allocation process optimizing the performances of a wavelet coder for semiregular meshes. More precisely, this process should compute the best quantizers for the wavelet coefficient subbands that minimize the reconstructed mean square error for one specific target bitrate. In order to design a fast and low complex allocation process, we propose an approximation of the reconstructed mean square error relative to the coding of semiregular mesh geometry. This error is expressed directly from the quantization errors of each coefficient subband. For that purpose, we have to take into account the influence of the wavelet filters on the quantized coefficients. Furthermore, we propose a specific approximation for wavelet transforms based on lifting schemes. Experimentally, we show that, in comparison with a \"naïve” approximation (depending on the subband levels), using the proposed approximation as distortion criterion during the model-based allocation process improves the performances of a wavelet-based coder for any model, any bitrate, and any lifting scheme.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The objective of this paper is to propose an efficient model-based bit allocation process optimizing the performances of a wavelet coder for semiregular meshes. More precisely, this process should compute the best quantizers for the wavelet coefficient subbands that minimize the reconstructed mean square error for one specific target bitrate. In order to design a fast and low complex allocation process, we propose an approximation of the reconstructed mean square error relative to the coding of semiregular mesh geometry. This error is expressed directly from the quantization errors of each coefficient subband. For that purpose, we have to take into account the influence of the wavelet filters on the quantized coefficients. Furthermore, we propose a specific approximation for wavelet transforms based on lifting schemes. Experimentally, we show that, in comparison with a \"naïve” approximation (depending on the subband levels), using the proposed approximation as distortion criterion during the model-based allocation process improves the performances of a wavelet-based coder for any model, any bitrate, and any lifting scheme.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The objective of this paper is to propose an efficient model-based bit allocation process optimizing the performances of a wavelet coder for semiregular meshes. More precisely, this process should compute the best quantizers for the wavelet coefficient subbands that minimize the reconstructed mean square error for one specific target bitrate. In order to design a fast and low complex allocation process, we propose an approximation of the reconstructed mean square error relative to the coding of semiregular mesh geometry. This error is expressed directly from the quantization errors of each coefficient subband. For that purpose, we have to take into account the influence of the wavelet filters on the quantized coefficients. Furthermore, we propose a specific approximation for wavelet transforms based on lifting schemes. Experimentally, we show that, in comparison with a \"naïve” approximation (depending on the subband levels), using the proposed approximation as distortion criterion during the model-based allocation process improves the performances of a wavelet-based coder for any model, any bitrate, and any lifting scheme.",
"title": "Mean Square Error Approximation for Wavelet-Based Semiregular Mesh Compression",
"normalizedTitle": "Mean Square Error Approximation for Wavelet-Based Semiregular Mesh Compression",
"fno": "v0649",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Weighted Mean Square Error MSE",
"Biorthogonal Wavelet",
"Lifting Scheme",
"Butterfly Scheme",
"Bit Allocation",
"Geometry Coding",
"Semiregular Meshes"
],
"authors": [
{
"givenName": "Fr?d?ric",
"surname": "Payan",
"fullName": "Fr?d?ric Payan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Antonini",
"fullName": "Marc Antonini",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2006-07-01 00:00:00",
"pubType": "trans",
"pages": "649-657",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icassp/2009/2353/0/04959761",
"title": "Modeling of contours in wavelet domain for generalized lifting image compression",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2009/04959761/12OmNAoDhYX",
"parentPublication": {
"id": "proceedings/icassp/2009/2353/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ihmsc/2010/4151/1/4151a313",
"title": "Infrared Image Enhancement Based on Wavelet Transformation and Retinex",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2010/4151a313/12OmNAsTgS0",
"parentPublication": {
"id": "proceedings/ihmsc/2010/4151/1",
"title": "Intelligent Human-Machine Systems and Cybernetics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/3/01326501",
"title": "Mesh-based motion models for wavelet video coding",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326501/12OmNqBbHL9",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/3",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031b096",
"title": "Gray Image Watermark Algorithm in Integer Wavelet Transform Domain",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031b096/12OmNqBtiNo",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2007/3058/0/30580057",
"title": "Complexity Reduction and Fast Algorithm for 2-D Integer Discrete Wavelet Transform Using Symmetric Mask-Based Scheme",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2007/30580057/12OmNrAv3NX",
"parentPublication": {
"id": "proceedings/ism/2007/3058/0",
"title": "Ninth IEEE International Symposium on Multimedia (ISM 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/2005/2407/0/24070393",
"title": "Performance Comparison of SIMD Implementations of the Discrete Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2005/24070393/12OmNrYCXKH",
"parentPublication": {
"id": "proceedings/asap/2005/2407/0",
"title": "2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/is3c/2012/4655/0/4655a393",
"title": "Enhancement Speech Compression Technique Using Modern Wavelet Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/is3c/2012/4655a393/12OmNrYlmPl",
"parentPublication": {
"id": "proceedings/is3c/2012/4655/0",
"title": "Computer, Consumer and Control, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paccs/2009/3614/0/3614a698",
"title": "Based on Lifting Scheme Improve Double Adaptive Wavelet Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/paccs/2009/3614a698/12OmNxZTtI1",
"parentPublication": {
"id": "proceedings/paccs/2009/3614/0",
"title": "2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/1/4296a032",
"title": "A Design of M-Channels Lifting Wavelet Filter in Signal Processing",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296a032/12OmNzFv4eb",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/1",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0914",
"title": "√3-Subdivision-Based Biorthogonal Wavelets",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0914/13rRUxZ0o1n",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0640",
"articleId": "13rRUwhHcJc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0658",
"articleId": "13rRUypp57x",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCau3c0",
"title": "May",
"year": "2004",
"issueNum": "05",
"idPrefix": "tp",
"pubType": "journal",
"volume": "26",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7a8",
"doi": "10.1109/TPAMI.2004.1273967",
"abstract": "Abstract—This paper describes an extension of Bookstein's and Sampson's methods, for fitting conics, to the determination of epipolar geometry, both in the calibrated case, where the Essential matrix {\\bf {E}} is to be determined or in the uncalibrated case, where we seek the fundamental matrix {\\bf{F}}. We desire that the fitting of the relation be invariant to Euclidean transformations of the image, and show that there is only one suitable normalization of the coefficients and that this normalization gives rise to a quadratic form allowing eigenvector methods to be used to find {\\bf{E}} or {\\bf{F}}, or an arbitrary homography {\\bf{H}}. The resulting method has the advantage that it exhibits the improved stability of previous methods for estimating the epipolar geometry, such as the preconditioning method of Hartley, while also being invariant to equiform transformations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper describes an extension of Bookstein's and Sampson's methods, for fitting conics, to the determination of epipolar geometry, both in the calibrated case, where the Essential matrix {\\bf {E}} is to be determined or in the uncalibrated case, where we seek the fundamental matrix {\\bf{F}}. We desire that the fitting of the relation be invariant to Euclidean transformations of the image, and show that there is only one suitable normalization of the coefficients and that this normalization gives rise to a quadratic form allowing eigenvector methods to be used to find {\\bf{E}} or {\\bf{F}}, or an arbitrary homography {\\bf{H}}. The resulting method has the advantage that it exhibits the improved stability of previous methods for estimating the epipolar geometry, such as the preconditioning method of Hartley, while also being invariant to equiform transformations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper describes an extension of Bookstein's and Sampson's methods, for fitting conics, to the determination of epipolar geometry, both in the calibrated case, where the Essential matrix {\\bf {E}} is to be determined or in the uncalibrated case, where we seek the fundamental matrix {\\bf{F}}. We desire that the fitting of the relation be invariant to Euclidean transformations of the image, and show that there is only one suitable normalization of the coefficients and that this normalization gives rise to a quadratic form allowing eigenvector methods to be used to find {\\bf{E}} or {\\bf{F}}, or an arbitrary homography {\\bf{H}}. The resulting method has the advantage that it exhibits the improved stability of previous methods for estimating the epipolar geometry, such as the preconditioning method of Hartley, while also being invariant to equiform transformations.",
"title": "Invariant Fitting of Two View Geometry",
"normalizedTitle": "Invariant Fitting of Two View Geometry",
"fno": "i0648",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Least Squares Approximation",
"Least Squares Method",
"3 D Stereo Scene Analysis",
"Motion",
"Camera Calibration"
],
"authors": [
{
"givenName": "P.H.S.",
"surname": "Torr",
"fullName": "P.H.S. Torr",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "A.W.",
"surname": "Fitzgibbon",
"fullName": "A.W. Fitzgibbon",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2004-05-01 00:00:00",
"pubType": "trans",
"pages": "648-650",
"year": "2004",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0639",
"articleId": "13rRUx0geAW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0651",
"articleId": "13rRUx0geAX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNALlciD",
"title": "July-September",
"year": "2000",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "6",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWkS",
"doi": "10.1109/2945.879782",
"abstract": "Abstract—Volume renderers for interactive analysis must be sufficiently versatile to render a broad range of volume images: unsegmented “raw” images as recorded by a 3D scanner, labeled segmented images, multimodality images, or any combination of these. The usual strategy is to assign to each voxel a three component RGB color and an opacity value Z_$\\alpha$_Z. This so-called RGBZ_$\\alpha$_Z approach offers the possibility of distinguishing volume objects by color. However, these colors are connected to the objects themselves, thereby bypassing the idea that in reality the color of an object is also determined by the light source and light detectors c.q. human eyes. The physically realistic approach presented here models light interacting with the materials inside a voxel causing spectral changes in the light. The radiated spectrum falls upon a set of RGB detectors. The spectral approach is investigated to see whether it could enhance the visualization of volume data and interactive tools. For that purpose, a material is split into an absorbing part (the medium) and a scattering part (small particles). The medium is considered to be either achromatic or chromatic, while the particles are considered to scatter the light achromatically, elastically, or inelastically. It appears that inelastic scattering particles combined with an achromatic absorbing medium offer additional visual features: Objects are made visible through the surface structure of a surrounding volume object and volume and surface structures can be made visible at the same time. With one or two materials the method is faster than the RGBZ_$\\alpha$_Z approach, with three materials the performance is equal. The spectral approach can be considered as an extension of the RGBZ_$\\alpha$_Z approach with a greater visual flexibility and a better balance between quality and speed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Volume renderers for interactive analysis must be sufficiently versatile to render a broad range of volume images: unsegmented “raw” images as recorded by a 3D scanner, labeled segmented images, multimodality images, or any combination of these. The usual strategy is to assign to each voxel a three component RGB color and an opacity value $\\alpha$. This so-called RGB$\\alpha$ approach offers the possibility of distinguishing volume objects by color. However, these colors are connected to the objects themselves, thereby bypassing the idea that in reality the color of an object is also determined by the light source and light detectors c.q. human eyes. The physically realistic approach presented here models light interacting with the materials inside a voxel causing spectral changes in the light. The radiated spectrum falls upon a set of RGB detectors. The spectral approach is investigated to see whether it could enhance the visualization of volume data and interactive tools. For that purpose, a material is split into an absorbing part (the medium) and a scattering part (small particles). The medium is considered to be either achromatic or chromatic, while the particles are considered to scatter the light achromatically, elastically, or inelastically. It appears that inelastic scattering particles combined with an achromatic absorbing medium offer additional visual features: Objects are made visible through the surface structure of a surrounding volume object and volume and surface structures can be made visible at the same time. With one or two materials the method is faster than the RGB$\\alpha$ approach, with three materials the performance is equal. The spectral approach can be considered as an extension of the RGB$\\alpha$ approach with a greater visual flexibility and a better balance between quality and speed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Volume renderers for interactive analysis must be sufficiently versatile to render a broad range of volume images: unsegmented “raw” images as recorded by a 3D scanner, labeled segmented images, multimodality images, or any combination of these. The usual strategy is to assign to each voxel a three component RGB color and an opacity value -. This so-called RGB- approach offers the possibility of distinguishing volume objects by color. However, these colors are connected to the objects themselves, thereby bypassing the idea that in reality the color of an object is also determined by the light source and light detectors c.q. human eyes. The physically realistic approach presented here models light interacting with the materials inside a voxel causing spectral changes in the light. The radiated spectrum falls upon a set of RGB detectors. The spectral approach is investigated to see whether it could enhance the visualization of volume data and interactive tools. For that purpose, a material is split into an absorbing part (the medium) and a scattering part (small particles). The medium is considered to be either achromatic or chromatic, while the particles are considered to scatter the light achromatically, elastically, or inelastically. It appears that inelastic scattering particles combined with an achromatic absorbing medium offer additional visual features: Objects are made visible through the surface structure of a surrounding volume object and volume and surface structures can be made visible at the same time. With one or two materials the method is faster than the RGB- approach, with three materials the performance is equal. The spectral approach can be considered as an extension of the RGB- approach with a greater visual flexibility and a better balance between quality and speed.",
"title": "Spectral Volume Rendering",
"normalizedTitle": "Spectral Volume Rendering",
"fno": "v0196",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Volume Rendering",
"Light Matter Interaction",
"Light Spectra",
"Physical Realism",
"Visual Cues"
],
"authors": [
{
"givenName": "Herke Jan",
"surname": "Noordmans",
"fullName": "Herke Jan Noordmans",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans T.M.",
"surname": "van der Voort",
"fullName": "Hans T.M. van der Voort",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arnold W.M.",
"surname": "Smeulders",
"fullName": "Arnold W.M. Smeulders",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2000-07-01 00:00:00",
"pubType": "trans",
"pages": "196-207",
"year": "2000",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0193",
"articleId": "13rRUwdrdSo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0208",
"articleId": "13rRUyfKIHx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzVoBCx",
"title": "April",
"year": "2011",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJuxps",
"doi": "10.1109/TVCG.2010.54",
"abstract": "This paper presents a method of self-intersection detection and resolution for dynamic cylindrical-lattice-based free-form deformation (FFD). The lattice-based approach allows efficient computation of deformation of complex geometries. But excessive deformation can cause visual anomalies such as surface infiltration and distortion. This paper derives a geometrically intuitive sufficient condition to guarantee that the FFD function is a homeomorphism and there is no self-intersection. The FFD function is defined by linear and quadratic B-Spline functions with the control points of the cylindrical lattice cell. The sufficient condition is satisfied if each trilinear function of the nine prism-shaped pentahedrons derived from the cell has a positive Jacobian determinant. The positivity is satisfied if the 12 tetrahedrons derived from the pentahedron have positive volumes. Based on the sufficient condition, the proposed method converts the self-intersection problem into a point-face collision detection and response problem suitable for dynamic simulation. The efficiency and accuracy of the self-intersection detection algorithm is analyzed and compared with a previous method. The results show that the proposed technique allows simulation of excessive deformation of tubular objects in an efficient and realistic manner.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a method of self-intersection detection and resolution for dynamic cylindrical-lattice-based free-form deformation (FFD). The lattice-based approach allows efficient computation of deformation of complex geometries. But excessive deformation can cause visual anomalies such as surface infiltration and distortion. This paper derives a geometrically intuitive sufficient condition to guarantee that the FFD function is a homeomorphism and there is no self-intersection. The FFD function is defined by linear and quadratic B-Spline functions with the control points of the cylindrical lattice cell. The sufficient condition is satisfied if each trilinear function of the nine prism-shaped pentahedrons derived from the cell has a positive Jacobian determinant. The positivity is satisfied if the 12 tetrahedrons derived from the pentahedron have positive volumes. Based on the sufficient condition, the proposed method converts the self-intersection problem into a point-face collision detection and response problem suitable for dynamic simulation. The efficiency and accuracy of the self-intersection detection algorithm is analyzed and compared with a previous method. The results show that the proposed technique allows simulation of excessive deformation of tubular objects in an efficient and realistic manner.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a method of self-intersection detection and resolution for dynamic cylindrical-lattice-based free-form deformation (FFD). The lattice-based approach allows efficient computation of deformation of complex geometries. But excessive deformation can cause visual anomalies such as surface infiltration and distortion. This paper derives a geometrically intuitive sufficient condition to guarantee that the FFD function is a homeomorphism and there is no self-intersection. The FFD function is defined by linear and quadratic B-Spline functions with the control points of the cylindrical lattice cell. The sufficient condition is satisfied if each trilinear function of the nine prism-shaped pentahedrons derived from the cell has a positive Jacobian determinant. The positivity is satisfied if the 12 tetrahedrons derived from the pentahedron have positive volumes. Based on the sufficient condition, the proposed method converts the self-intersection problem into a point-face collision detection and response problem suitable for dynamic simulation. The efficiency and accuracy of the self-intersection detection algorithm is analyzed and compared with a previous method. The results show that the proposed technique allows simulation of excessive deformation of tubular objects in an efficient and realistic manner.",
"title": "Real-Time Resolution of Self-Intersection in Dynamic Cylindrical Free-Form Deformation",
"normalizedTitle": "Real-Time Resolution of Self-Intersection in Dynamic Cylindrical Free-Form Deformation",
"fno": "ttg2011040515",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Free Form Deformation",
"Self Intersection",
"Collision",
"Simulation"
],
"authors": [
{
"givenName": "Woojin",
"surname": "Ahn",
"fullName": "Woojin Ahn",
"affiliation": "Korea Advanced Institute of Science and Technology, Daejeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Doo Yong",
"surname": "Lee",
"fullName": "Doo Yong Lee",
"affiliation": "Korea Advanced Institute of Science and Technology, Daejeon",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2011-04-01 00:00:00",
"pubType": "trans",
"pages": "515-526",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/itng/2008/3099/0/3099a704",
"title": "A Search-Free Intersection Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2008/3099a704/12OmNAWH9By",
"parentPublication": {
"id": "proceedings/itng/2008/3099/0",
"title": "2008 5th International Conference on Information Technology: New Generation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2009/3893/0/3893a061",
"title": "Skeleton Driven Laplacian Volumetric Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2009/3893a061/12OmNAle6xC",
"parentPublication": {
"id": "proceedings/cvmp/2009/3893/0",
"title": "2009 Conference for Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuvr/2010/4124/0/4124a024",
"title": "Deformation and Simulation of 3D Contents for the Digilog Book",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2010/4124a024/12OmNBBhN7i",
"parentPublication": {
"id": "proceedings/isuvr/2010/4124/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2011/4362/0/4362a212",
"title": "Elastic Shape Registration Using an Incremental Free Form Deformation Approach with the ICP Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2011/4362a212/12OmNCfSqOt",
"parentPublication": {
"id": "proceedings/crv/2011/4362/0",
"title": "2011 Canadian Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2002/1862/0/18620472",
"title": "Free-Form Deformation with Automatically Generated Multiresolution Lattices",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2002/18620472/12OmNvStcOu",
"parentPublication": {
"id": "proceedings/cw/2002/1862/0",
"title": "First International Symposium on Cyber Worlds, 2002. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmp/2000/0562/0/05620408",
"title": "B-Spline Free-Form Deformation of Polygonal Objects through Fast Functional Composition",
"doi": null,
"abstractUrl": "/proceedings-article/gmp/2000/05620408/12OmNvjgWlR",
"parentPublication": {
"id": "proceedings/gmp/2000/0562/0",
"title": "Geometric Modeling and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icma/2010/4293/0/4293a087",
"title": "Constraints Based Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/icma/2010/4293a087/12OmNwE9ODE",
"parentPublication": {
"id": "proceedings/icma/2010/4293/0",
"title": "2010 International Conference on Manufacturing Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2009/3641/0/3641b068",
"title": "A Framework for Real-time Local Free-Form Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2009/3641b068/12OmNweBUIN",
"parentPublication": {
"id": "proceedings/icis/2009/3641/0",
"title": "Computer and Information Science, ACIS International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/03/v0201",
"title": "Dynamic Free-Form Deformations for Animation Synthesis",
"doi": null,
"abstractUrl": "/journal/tg/1997/03/v0201/13rRUxASuhl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/04/v0289",
"title": "Preventing Self-Intersection under Free-Form Deformation",
"doi": null,
"abstractUrl": "/journal/tg/2001/04/v0289/13rRUxly9dJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011040500",
"articleId": "13rRUILtJzt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011040527",
"articleId": "13rRUxBJhvr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRLp",
"name": "ttg2011040515s1.wmv",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011040515s1.wmv",
"extension": "wmv",
"size": "10.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7k",
"title": "May",
"year": "2011",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjGoLC",
"doi": "10.1109/TVCG.2010.86",
"abstract": "In this paper, we analyze the reproduction of light fields on multiview 3D displays. A three-way interaction between the input light field signal (which is often aliased), the joint spatioangular sampling grids of multiview 3D displays, and the interview light leakage in modern multiview 3D displays is characterized in the joint spatioangular frequency domain. Reconstruction of light fields by all physical 3D displays is prone to light leakage, which means that the reconstruction low-pass filter implemented by the display is too broad in the angular domain. As a result, 3D displays excessively attenuate angular frequencies. Our analysis shows that this reduces sharpness of the images shown in the 3D displays. In this paper, stereoscopic image recovery is recast as a problem of joint spatioangular signal reconstruction. The combination of the 3D display point spread function and human visual system provides the narrow-band low-pass filter which removes spectral replicas in the reconstructed light field on the multiview display. The nonideality of this filter is corrected with the proposed prefiltering. The proposed light field reconstruction method performs light field antialiasing as well as angular sharpening to compensate for the nonideal response of the 3D display. The union of cosets approach which has been used earlier by others is employed here to model the nonrectangular spatioangular sampling grids on a multiview display in a generic fashion. We confirm the effectiveness of our approach in simulation and in physical hardware, and demonstrate improvement over existing techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we analyze the reproduction of light fields on multiview 3D displays. A three-way interaction between the input light field signal (which is often aliased), the joint spatioangular sampling grids of multiview 3D displays, and the interview light leakage in modern multiview 3D displays is characterized in the joint spatioangular frequency domain. Reconstruction of light fields by all physical 3D displays is prone to light leakage, which means that the reconstruction low-pass filter implemented by the display is too broad in the angular domain. As a result, 3D displays excessively attenuate angular frequencies. Our analysis shows that this reduces sharpness of the images shown in the 3D displays. In this paper, stereoscopic image recovery is recast as a problem of joint spatioangular signal reconstruction. The combination of the 3D display point spread function and human visual system provides the narrow-band low-pass filter which removes spectral replicas in the reconstructed light field on the multiview display. The nonideality of this filter is corrected with the proposed prefiltering. The proposed light field reconstruction method performs light field antialiasing as well as angular sharpening to compensate for the nonideal response of the 3D display. The union of cosets approach which has been used earlier by others is employed here to model the nonrectangular spatioangular sampling grids on a multiview display in a generic fashion. We confirm the effectiveness of our approach in simulation and in physical hardware, and demonstrate improvement over existing techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we analyze the reproduction of light fields on multiview 3D displays. A three-way interaction between the input light field signal (which is often aliased), the joint spatioangular sampling grids of multiview 3D displays, and the interview light leakage in modern multiview 3D displays is characterized in the joint spatioangular frequency domain. Reconstruction of light fields by all physical 3D displays is prone to light leakage, which means that the reconstruction low-pass filter implemented by the display is too broad in the angular domain. As a result, 3D displays excessively attenuate angular frequencies. Our analysis shows that this reduces sharpness of the images shown in the 3D displays. In this paper, stereoscopic image recovery is recast as a problem of joint spatioangular signal reconstruction. The combination of the 3D display point spread function and human visual system provides the narrow-band low-pass filter which removes spectral replicas in the reconstructed light field on the multiview display. The nonideality of this filter is corrected with the proposed prefiltering. The proposed light field reconstruction method performs light field antialiasing as well as angular sharpening to compensate for the nonideal response of the 3D display. The union of cosets approach which has been used earlier by others is employed here to model the nonrectangular spatioangular sampling grids on a multiview display in a generic fashion. We confirm the effectiveness of our approach in simulation and in physical hardware, and demonstrate improvement over existing techniques.",
"title": "Spatioangular Prefiltering for Multiview 3D Displays",
"normalizedTitle": "Spatioangular Prefiltering for Multiview 3D Displays",
"fno": "ttg2011050642",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Light Field",
"3 D",
"Autostereoscopic Display",
"Lenticular",
"Parallax Barrier",
"Sampling",
"Aliasing",
"Crosstalk",
"Sharpening"
],
"authors": [
{
"givenName": "Vikas",
"surname": "Ramachandra",
"fullName": "Vikas Ramachandra",
"affiliation": "Qualcomm Inc., San Diego",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Keigo",
"surname": "Hirakawa",
"fullName": "Keigo Hirakawa",
"affiliation": "University of Dayton, Dayton",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthias",
"surname": "Zwicker",
"fullName": "Matthias Zwicker",
"affiliation": "University of California San Diego, La Jolla",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Truong",
"surname": "Nguyen",
"fullName": "Truong Nguyen",
"affiliation": "University of California San Diego, La Jolla",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2011-05-01 00:00:00",
"pubType": "trans",
"pages": "642-654",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2011/1101/0/06126303",
"title": "Multiview 3D warps",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2011/06126303/12OmNAGw16e",
"parentPublication": {
"id": "proceedings/iccv/2011/1101/0",
"title": "2011 IEEE International Conference on Computer Vision (ICCV 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2010/4268/0/4268a123",
"title": "Helium3D: A Laser-Based 3D Display with '3D+' Capability",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2010/4268a123/12OmNAoDhXO",
"parentPublication": {
"id": "proceedings/cvmp/2010/4268/0",
"title": "2010 Conference on Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apcip/2009/3699/2/3699b031",
"title": "3D Multi-view Autostereoscopic Display and Its Key Technologie",
"doi": null,
"abstractUrl": "/proceedings-article/apcip/2009/3699b031/12OmNvAS4pe",
"parentPublication": {
"id": "proceedings/apcip/2009/3699/1",
"title": "Information Processing, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2009/2353/0/04959689",
"title": "Combined image plus depth seam carving for multiview 3D images",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2009/04959689/12OmNxYbT4y",
"parentPublication": {
"id": "proceedings/icassp/2009/2353/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2013/5067/0/5067a374",
"title": "Geometric and Color Calibration of Multiview Panoramic Cameras for Life-Size 3D Immersive Video",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2013/5067a374/12OmNxwncHd",
"parentPublication": {
"id": "proceedings/3dv/2013/5067/0",
"title": "2013 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2015/7082/0/07177519",
"title": "Active crosstalk reduction system for multiview autostereoscopic displays",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2015/07177519/12OmNzgeLCa",
"parentPublication": {
"id": "proceedings/icme/2015/7082/0",
"title": "2015 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2005/08/r8031",
"title": "Autostereoscopic 3D Displays",
"doi": null,
"abstractUrl": "/magazine/co/2005/08/r8031/13rRUB7a16j",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/05/mcg2012050006",
"title": "Compressive Light Field Displays",
"doi": null,
"abstractUrl": "/magazine/cg/2012/05/mcg2012050006/13rRUNvPLcn",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0228",
"title": "Correcting Interperspective Aliasing in Autostereoscopic Displays",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0228/13rRUwgyOj8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2011/01/mco2011010017",
"title": "3D Displays without Glasses: Coming to a Screen near You",
"doi": null,
"abstractUrl": "/magazine/co/2011/01/mco2011010017/13rRUxBa5iD",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011050626",
"articleId": "13rRUwdrdSw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011050655",
"articleId": "13rRUwdrdSx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAWYKCh",
"title": "Sept.",
"year": "2017",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "39",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPV4",
"doi": "10.1109/TPAMI.2016.2616391",
"abstract": "Though many tasks in computer vision can be formulated elegantly as pixel-labeling problems, a typical challenge discouraging such a discrete formulation is often due to computational efficiency. Recent studies on fast cost volume filtering based on efficient edge-aware filters provide a fast alternative to solve discrete labeling problems, with the complexity independent of the support window size. However, these methods still have to step through the entire cost volume exhaustively, which makes the solution speed scale linearly with the label space size. When the label space is huge or even infinite, which is often the case for (subpixel-accurate) stereo and optical flow estimation, their computational complexity becomes quickly unacceptable. Developed to search approximate nearest neighbors rapidly, the PatchMatch method can significantly reduce the complexity dependency on the search space size. But, its pixel-wise randomized search and fragmented data access within the 3D cost volume seriously hinder the application of efficient cost slice filtering. This paper presents a generic and fast computational framework for general multi-labeling problems called PatchMatch Filter (PMF). We explore effective and efficient strategies to weave together these two fundamental techniques developed in isolation, i.e., PatchMatch-based randomized search and efficient edge-aware image filtering. By decompositing an image into compact superpixels, we also propose superpixel-based novel search strategies that generalize and improve the original PatchMatch method. Further motivated to improve the regularization strength, we propose a simple yet effective cross-scale consistency constraint, which handles labeling estimation for large low-textured regions more reliably than a single-scale PMF algorithm. Focusing on dense correspondence field estimation in this paper, we demonstrate PMF’s applications in stereo and optical flow. Our PMF methods achieve top-tier correspondence accuracy but run much faster than other related competing methods, often giving over 10-100 times speedup.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Though many tasks in computer vision can be formulated elegantly as pixel-labeling problems, a typical challenge discouraging such a discrete formulation is often due to computational efficiency. Recent studies on fast cost volume filtering based on efficient edge-aware filters provide a fast alternative to solve discrete labeling problems, with the complexity independent of the support window size. However, these methods still have to step through the entire cost volume exhaustively, which makes the solution speed scale linearly with the label space size. When the label space is huge or even infinite, which is often the case for (subpixel-accurate) stereo and optical flow estimation, their computational complexity becomes quickly unacceptable. Developed to search approximate nearest neighbors rapidly, the PatchMatch method can significantly reduce the complexity dependency on the search space size. But, its pixel-wise randomized search and fragmented data access within the 3D cost volume seriously hinder the application of efficient cost slice filtering. This paper presents a generic and fast computational framework for general multi-labeling problems called PatchMatch Filter (PMF). We explore effective and efficient strategies to weave together these two fundamental techniques developed in isolation, i.e., PatchMatch-based randomized search and efficient edge-aware image filtering. By decompositing an image into compact superpixels, we also propose superpixel-based novel search strategies that generalize and improve the original PatchMatch method. Further motivated to improve the regularization strength, we propose a simple yet effective cross-scale consistency constraint, which handles labeling estimation for large low-textured regions more reliably than a single-scale PMF algorithm. Focusing on dense correspondence field estimation in this paper, we demonstrate PMF’s applications in stereo and optical flow. Our PMF methods achieve top-tier correspondence accuracy but run much faster than other related competing methods, often giving over 10-100 times speedup.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Though many tasks in computer vision can be formulated elegantly as pixel-labeling problems, a typical challenge discouraging such a discrete formulation is often due to computational efficiency. Recent studies on fast cost volume filtering based on efficient edge-aware filters provide a fast alternative to solve discrete labeling problems, with the complexity independent of the support window size. However, these methods still have to step through the entire cost volume exhaustively, which makes the solution speed scale linearly with the label space size. When the label space is huge or even infinite, which is often the case for (subpixel-accurate) stereo and optical flow estimation, their computational complexity becomes quickly unacceptable. Developed to search approximate nearest neighbors rapidly, the PatchMatch method can significantly reduce the complexity dependency on the search space size. But, its pixel-wise randomized search and fragmented data access within the 3D cost volume seriously hinder the application of efficient cost slice filtering. This paper presents a generic and fast computational framework for general multi-labeling problems called PatchMatch Filter (PMF). We explore effective and efficient strategies to weave together these two fundamental techniques developed in isolation, i.e., PatchMatch-based randomized search and efficient edge-aware image filtering. By decompositing an image into compact superpixels, we also propose superpixel-based novel search strategies that generalize and improve the original PatchMatch method. Further motivated to improve the regularization strength, we propose a simple yet effective cross-scale consistency constraint, which handles labeling estimation for large low-textured regions more reliably than a single-scale PMF algorithm. Focusing on dense correspondence field estimation in this paper, we demonstrate PMF’s applications in stereo and optical flow. Our PMF methods achieve top-tier correspondence accuracy but run much faster than other related competing methods, often giving over 10-100 times speedup.",
"title": "PatchMatch Filter: Edge-Aware Filtering Meets Randomized Search for Visual Correspondence",
"normalizedTitle": "PatchMatch Filter: Edge-Aware Filtering Meets Randomized Search for Visual Correspondence",
"fno": "07588057",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Optical Filters",
"Optical Imaging",
"Estimation",
"Complexity Theory",
"Labeling",
"Computer Vision",
"Electronic Mail",
"Approximate Nearest Neighbor",
"Edge Aware Filtering",
"Stereo Matching",
"Optical Flow"
],
"authors": [
{
"givenName": "Jiangbo",
"surname": "Lu",
"fullName": "Jiangbo Lu",
"affiliation": "Advanced Digital Sciences Center, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Li",
"fullName": "Yu Li",
"affiliation": "Advanced Digital Sciences Center, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongsheng",
"surname": "Yang",
"fullName": "Hongsheng Yang",
"affiliation": "Google, Mountain View, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dongbo",
"surname": "Min",
"fullName": "Dongbo Min",
"affiliation": "Chungnam National University, Daejeon, Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiyong",
"surname": "Eng",
"fullName": "Weiyong Eng",
"affiliation": "Multimedia University, Cyberjaya, Malaysia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minh N.",
"surname": "Do",
"fullName": "Minh N. Do",
"affiliation": "University of Illinois, Urbana-Champaign, IL",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2017-09-01 00:00:00",
"pubType": "trans",
"pages": "1866-1879",
"year": "2017",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2015/8391/0/07410813",
"title": "SPM-BP: Sped-Up PatchMatch Belief Propagation for Continuous MRFs",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/07410813/12OmNBh8h1s",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118d406",
"title": "DAISY Filter Flow: A Generalized Discrete Approach to Dense Correspondences",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118d406/12OmNCd2rQ9",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/navcomp/2013/5123/0/5123a075",
"title": "Plankton Detection and Tracking Using Frequency Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/navcomp/2013/5123a075/12OmNCdTeLL",
"parentPublication": {
"id": "proceedings/navcomp/2013/5123/0",
"title": "2013 Symposium on Computer and Automation for Offshore Shipbuilding (NAVCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d406",
"title": "Mutual-Structure for Joint Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d406/12OmNCgJe5e",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2013/4989/0/4989b854",
"title": "Patch Match Filter: Efficient Edge-Aware Filtering Meets Randomized Search for Fast Correspondence Field Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989b854/12OmNvTk01e",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/07780829",
"title": "Joint Recovery of Dense Correspondence and Cosegmentation in Two Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/07780829/12OmNvjQ92V",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2017/2818/0/2818a064",
"title": "Fast Estimation of Large Displacement Optical Flow Using Dominant Motion Patterns & Sub-Volume PatchMatch Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2017/2818a064/12OmNwpoFDN",
"parentPublication": {
"id": "proceedings/crv/2017/2818/0",
"title": "2017 14th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995372",
"title": "Fast cost-volume filtering for visual correspondence and beyond",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995372/12OmNxj23iS",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/02/ttp2013020504",
"title": "Fast Cost-Volume Filtering for Visual Correspondence and Beyond",
"doi": null,
"abstractUrl": "/journal/tp/2013/02/ttp2013020504/13rRUwbaqVY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/01/08510898",
"title": "Discrete-Continuous Transformation Matching for Dense Semantic Correspondence",
"doi": null,
"abstractUrl": "/journal/tp/2020/01/08510898/14H4WOGl0Eo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07586038",
"articleId": "13rRUxcbnIr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07577857",
"articleId": "13rRUxYIMWv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBsLPeW",
"title": "Jan./Feb.",
"year": "2018",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "38",
"label": "Jan./Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvya3w",
"doi": "10.1109/MCG.2018.011461531",
"abstract": "This article discusses our experience in creating MegaMol, an open-source visualization framework for large particle-based data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article discusses our experience in creating MegaMol, an open-source visualization framework for large particle-based data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article discusses our experience in creating MegaMol, an open-source visualization framework for large particle-based data.",
"title": "10 Years of MegaMol: The Pain and Gain of Creating Your Own Visualization Framework",
"normalizedTitle": "10 Years of MegaMol: The Pain and Gain of Creating Your Own Visualization Framework",
"fno": "mcg2018010109",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Structures",
"Data Visualisation",
"Large Particle Based Data",
"Open Source Visualization Framework",
"Mega Mol",
"Data Visualization",
"Prototypes",
"Task Analysis",
"Rendering Computer Graphics",
"Programming",
"Graphics Processing Units",
"Applications",
"Visualization",
"Framework",
"Megamol",
"Computer Graphics"
],
"authors": [
{
"givenName": "Michael",
"surname": "Krone",
"fullName": "Michael Krone",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sebastian",
"surname": "Grottel",
"fullName": "Sebastian Grottel",
"affiliation": "TU Dresden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guido",
"surname": "Reina",
"fullName": "Guido Reina",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christoph",
"surname": "Müller",
"fullName": "Christoph Müller",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Ertl",
"fullName": "Thomas Ertl",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "mags",
"pages": "109-114",
"year": "2018",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isav/2016/3872/0/07836396",
"title": "In-Situ Visual Exploration of Multivariate Volume Data Based on Particle Based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/isav/2016/07836396/12OmNwHhoMV",
"parentPublication": {
"id": "proceedings/isav/2016/3872/0",
"title": "2016 Second Workshop on In-Situ Infrastructures for Enabling Extreme-Scale Analysis and Visualization (ISAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2016/3568/0/3568a424",
"title": "Interactive Visualization of the Cranio-Cerebral Correspondences for 10/20, 10/10 and 10/5 Systems",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2016/3568a424/12OmNxw5Br5",
"parentPublication": {
"id": "proceedings/sibgrapi/2016/3568/0",
"title": "2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08468065",
"title": "P4: Portable Parallel Processing Pipelines for Interactive Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08468065/13HFz2XZAUp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1037",
"title": "Analyzing Complex FTMS Simulations: a Case Study in High-Level Visualization of Ion Motions",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1037/13rRUxD9gXx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/04/v0758",
"title": "A Coherent Grid Traversal Approach to Visualizing Particle-Based Simulation Data",
"doi": null,
"abstractUrl": "/journal/tg/2007/04/v0758/13rRUxOdD8a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/02/06881728",
"title": "MegaMol—A Prototyping Framework for Particle-Based Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2015/02/06881728/13rRUygT7n0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a073",
"title": "A Flexible Pipeline to Create Different Types of Data Physicalizations",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a073/1KaH4gYfBzG",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2019/2605/0/08944267",
"title": "Interactive Rendering of Large-Scale Volumes on Multi-Core CPUs",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2019/08944267/1grOF3t2zsc",
"parentPublication": {
"id": "proceedings/ldav/2019/2605/0",
"title": "2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09079657",
"title": "Distributed Interactive Visualization Using GPU-Optimized Spark",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09079657/1jmVbp8XqZa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552900",
"title": "Probabilistic Occlusion Culling using Confidence Maps for High-Quality Rendering of Large Particle Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552900/1xic6f4Sc6I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2018010091",
"articleId": "13rRUwkfATa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2018010115",
"articleId": "13rRUxASuk5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNB9bvmq",
"title": "Jan.-Feb.",
"year": "2013",
"issueNum": "01",
"idPrefix": "tq",
"pubType": "journal",
"volume": "10",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuHJ",
"doi": "10.1109/TDSC.2012.74",
"abstract": "Open nature of peer-to-peer systems exposes them to malicious activity. Building trust relationships among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that enable a peer to reason about trustworthiness of other peers based on past interactions and recommendations. Peers create their own trust network in their proximity by using local information available and do not try to learn global trust information. Two contexts of trust, service, and recommendation contexts, are defined to measure trustworthiness in providing services and giving recommendations. Interactions and recommendations are evaluated based on importance, recentness, and peer satisfaction parameters. Additionally, recommender's trustworthiness and confidence about a recommendation are considered while evaluating recommendations. Simulation experiments on a file sharing application show that the proposed model can mitigate attacks on 16 different malicious behavior models. In the experiments, good peers were able to form trust relationships in their proximity and isolate malicious peers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Open nature of peer-to-peer systems exposes them to malicious activity. Building trust relationships among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that enable a peer to reason about trustworthiness of other peers based on past interactions and recommendations. Peers create their own trust network in their proximity by using local information available and do not try to learn global trust information. Two contexts of trust, service, and recommendation contexts, are defined to measure trustworthiness in providing services and giving recommendations. Interactions and recommendations are evaluated based on importance, recentness, and peer satisfaction parameters. Additionally, recommender's trustworthiness and confidence about a recommendation are considered while evaluating recommendations. Simulation experiments on a file sharing application show that the proposed model can mitigate attacks on 16 different malicious behavior models. In the experiments, good peers were able to form trust relationships in their proximity and isolate malicious peers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Open nature of peer-to-peer systems exposes them to malicious activity. Building trust relationships among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that enable a peer to reason about trustworthiness of other peers based on past interactions and recommendations. Peers create their own trust network in their proximity by using local information available and do not try to learn global trust information. Two contexts of trust, service, and recommendation contexts, are defined to measure trustworthiness in providing services and giving recommendations. Interactions and recommendations are evaluated based on importance, recentness, and peer satisfaction parameters. Additionally, recommender's trustworthiness and confidence about a recommendation are considered while evaluating recommendations. Simulation experiments on a file sharing application show that the proposed model can mitigate attacks on 16 different malicious behavior models. In the experiments, good peers were able to form trust relationships in their proximity and isolate malicious peers.",
"title": "SORT: A Self-ORganizing Trust Model for Peer-to-Peer Systems",
"normalizedTitle": "SORT: A Self-ORganizing Trust Model for Peer-to-Peer Systems",
"fno": "ttq2013010014",
"hasPdf": true,
"idPrefix": "tq",
"keywords": [
"Measurement",
"Peer To Peer Computing",
"Context",
"History",
"Computational Modeling",
"Fading",
"Buildings",
"Security",
"Peer To Peer Systems",
"Trust Management",
"Reputation"
],
"authors": [
{
"givenName": "Ahmet Burak",
"surname": "Can",
"fullName": "Ahmet Burak Can",
"affiliation": "Hacettepe University, Ankara",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bharat",
"surname": "Bhargava",
"fullName": "Bharat Bhargava",
"affiliation": "Purdue University, West Lafayette",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2013-01-01 00:00:00",
"pubType": "trans",
"pages": "14-27",
"year": "2013",
"issn": "1545-5971",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iwia/2004/2117/0/21170141",
"title": "A Role-Based Trust Model for Peer-to-Peer Communities and Dynamic Coalitions",
"doi": null,
"abstractUrl": "/proceedings-article/iwia/2004/21170141/12OmNB0X8ti",
"parentPublication": {
"id": "proceedings/iwia/2004/2117/0",
"title": "Second IEEE International Information Assurance Workshop (IWIA'04)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscsct/2008/3498/2/3498b175",
"title": "Hierarchical Fuzzy Trust Management for Customer-to-Customer in Peer-to-Peer eCommerce",
"doi": null,
"abstractUrl": "/proceedings-article/iscsct/2008/3498b175/12OmNBQTJfY",
"parentPublication": {
"id": "proceedings/iscsct/2008/3498/1",
"title": "2008 International Symposium on Computer Science and Computational Technology (ISCSCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/p2p/2005/2376/0/23760031",
"title": "Result Verification and Trust-Based Scheduling in Peer-to-Peer Grids",
"doi": null,
"abstractUrl": "/proceedings-article/p2p/2005/23760031/12OmNsd6vnw",
"parentPublication": {
"id": "proceedings/p2p/2005/2376/0",
"title": "Fifth IEEE International Conference on Peer-to-Peer Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2010/8387/0/05735772",
"title": "A novel feedback based fast adaptive trust model for P2P networks",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2010/05735772/12OmNvkpkUG",
"parentPublication": {
"id": "proceedings/lcn/2010/8387/0",
"title": "IEEE Local Computer Network Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-icess/2008/3352/0/3352a950",
"title": "RBTrust: A Recommendation Belief Based Distributed Trust Management Model for P2P Networks",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2008/3352a950/12OmNwE9OTA",
"parentPublication": {
"id": "proceedings/hpcc-icess/2008/3352/0",
"title": "High Performance Computing and Communication & IEEE International Conference on Embedded Software and Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc/2010/4272/0/4272a358",
"title": "Dual-EigenRep: A Reputation-Based Trust Model for P2P File-Sharing Networks",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc/2010/4272a358/12OmNwF0BY2",
"parentPublication": {
"id": "proceedings/uic-atc/2010/4272/0",
"title": "Ubiquitous, Autonomic and Trusted Computing, Symposia and Workshops on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icee/2010/3997/0/3997b687",
"title": "Trust-Based Robust Mechanism in Peer-to-peer Computing",
"doi": null,
"abstractUrl": "/proceedings-article/icee/2010/3997b687/12OmNx6xHkG",
"parentPublication": {
"id": "proceedings/icee/2010/3997/0",
"title": "International Conference on E-Business and E-Government",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/colcom/2005/0030/0/01651213",
"title": "Free riders under control through service differentiation in peer-to-peer systems",
"doi": null,
"abstractUrl": "/proceedings-article/colcom/2005/01651213/12OmNyTwRek",
"parentPublication": {
"id": "proceedings/colcom/2005/0030/0",
"title": "International Conference on Collaborative Computing: Networking, Applications and Worksharing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2010/4323/0/4323a415",
"title": "A Dynamic Self-Adaptive Trust Model for P2P E-Commerce System",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2010/4323a415/12OmNz4BdqN",
"parentPublication": {
"id": "proceedings/cse/2010/4323/0",
"title": "2010 13th IEEE International Conference on Computational Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2004/07/k0843",
"title": "PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities",
"doi": null,
"abstractUrl": "/journal/tk/2004/07/k0843/13rRUyeTVih",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttq2013010001",
"articleId": "13rRUIIVllT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttq2013010028",
"articleId": "13rRUy3xY9p",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet3i",
"name": "ttq2013010014s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttq2013010014s.pdf",
"extension": "pdf",
"size": "623 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBaT5Zh",
"title": "December",
"year": "2002",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "24",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhHcRL",
"doi": "10.1109/TPAMI.2002.1114850",
"abstract": "Abstract—A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objects belong to a class of common solids and most solid systems are based on manifold geometry. In this paper, a new method is proposed for finding faces from single 2D line drawings representing manifolds. The face identification is formulated based on a property of manifolds: each edge of a manifold is shared exactly by two faces. The two main steps in our method are 1) searching for cycles from a line drawing and 2) searching for faces from the cycles. In order to speed up the face identification procedure, a number of properties, most of which relate to planar manifold geometry in line drawings, are presented to identify most of the cycles that are or are not real faces in a drawing, thus reducing the number of unknown cycles in the second searching. Schemes to deal with manifolds with curved faces and manifolds each represented by two or more disjoint graphs are also proposed. The experimental results show that our method can handle manifolds previous methods can handle, as well as those they cannot.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objects belong to a class of common solids and most solid systems are based on manifold geometry. In this paper, a new method is proposed for finding faces from single 2D line drawings representing manifolds. The face identification is formulated based on a property of manifolds: each edge of a manifold is shared exactly by two faces. The two main steps in our method are 1) searching for cycles from a line drawing and 2) searching for faces from the cycles. In order to speed up the face identification procedure, a number of properties, most of which relate to planar manifold geometry in line drawings, are presented to identify most of the cycles that are or are not real faces in a drawing, thus reducing the number of unknown cycles in the second searching. Schemes to deal with manifolds with curved faces and manifolds each represented by two or more disjoint graphs are also proposed. The experimental results show that our method can handle manifolds previous methods can handle, as well as those they cannot.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objects belong to a class of common solids and most solid systems are based on manifold geometry. In this paper, a new method is proposed for finding faces from single 2D line drawings representing manifolds. The face identification is formulated based on a property of manifolds: each edge of a manifold is shared exactly by two faces. The two main steps in our method are 1) searching for cycles from a line drawing and 2) searching for faces from the cycles. In order to speed up the face identification procedure, a number of properties, most of which relate to planar manifold geometry in line drawings, are presented to identify most of the cycles that are or are not real faces in a drawing, thus reducing the number of unknown cycles in the second searching. Schemes to deal with manifolds with curved faces and manifolds each represented by two or more disjoint graphs are also proposed. The experimental results show that our method can handle manifolds previous methods can handle, as well as those they cannot.",
"title": "Identifying Faces in a 2D Line Drawing Representing a Manifold Object",
"normalizedTitle": "Identifying Faces in a 2D Line Drawing Representing a Manifold Object",
"fno": "i1579",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"3 D Models",
"Face Identification",
"Geometry",
"Graphs",
"Line Drawings",
"Manifolds"
],
"authors": [
{
"givenName": "Jianzhuang",
"surname": "Liu",
"fullName": "Jianzhuang Liu",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong Tsui",
"surname": "Lee",
"fullName": "Yong Tsui Lee",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wai-Kuen",
"surname": "Cham",
"fullName": "Wai-Kuen Cham",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2002-12-01 00:00:00",
"pubType": "trans",
"pages": "1579-1593",
"year": "2002",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i1565",
"articleId": "13rRUwgyOkr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1594",
"articleId": "13rRUxBa5cV",
"__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": "13rRUx0xQ0E",
"doi": "10.1109/TPAMI.2010.49",
"abstract": "Three-dimensional object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail when the geometric structure of a 3D object becomes complex. In this paper, a novel approach based on a divide-and-conquer strategy is proposed to handle the 3D reconstruction of a planar-faced complex manifold object from its 2D line drawing with hidden lines visible. The approach consists of four steps: 1) identifying the internal faces of the line drawing, 2) decomposing the line drawing into multiple simpler ones based on the internal faces, 3) reconstructing the 3D shapes from these simpler line drawings, and 4) merging the 3D shapes into one complete object represented by the original line drawing. A number of examples are provided to show that our approach can handle 3D reconstruction of more complex objects than previous methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Three-dimensional object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail when the geometric structure of a 3D object becomes complex. In this paper, a novel approach based on a divide-and-conquer strategy is proposed to handle the 3D reconstruction of a planar-faced complex manifold object from its 2D line drawing with hidden lines visible. The approach consists of four steps: 1) identifying the internal faces of the line drawing, 2) decomposing the line drawing into multiple simpler ones based on the internal faces, 3) reconstructing the 3D shapes from these simpler line drawings, and 4) merging the 3D shapes into one complete object represented by the original line drawing. A number of examples are provided to show that our approach can handle 3D reconstruction of more complex objects than previous methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Three-dimensional object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail when the geometric structure of a 3D object becomes complex. In this paper, a novel approach based on a divide-and-conquer strategy is proposed to handle the 3D reconstruction of a planar-faced complex manifold object from its 2D line drawing with hidden lines visible. The approach consists of four steps: 1) identifying the internal faces of the line drawing, 2) decomposing the line drawing into multiple simpler ones based on the internal faces, 3) reconstructing the 3D shapes from these simpler line drawings, and 4) merging the 3D shapes into one complete object represented by the original line drawing. A number of examples are provided to show that our approach can handle 3D reconstruction of more complex objects than previous methods.",
"title": "Decomposition of Complex Line Drawings with Hidden Lines for 3D Planar-Faced Manifold Object Reconstruction",
"normalizedTitle": "Decomposition of Complex Line Drawings with Hidden Lines for 3D Planar-Faced Manifold Object Reconstruction",
"fno": "ttp2011010003",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"3 D Reconstruction",
"Divide And Conquer",
"Internal Face",
"Line Drawing",
"Manifold"
],
"authors": [
{
"givenName": "Jianzhuang",
"surname": "Liu",
"fullName": "Jianzhuang Liu",
"affiliation": "The Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu",
"surname": "Chen",
"fullName": "Yu Chen",
"affiliation": "University of Cambridge, Cambridge",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoou",
"surname": "Tang",
"fullName": "Xiaoou Tang",
"affiliation": "The Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2011-01-01 00:00:00",
"pubType": "trans",
"pages": "3-15",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/apvis/2007/0808/0/04126227",
"title": "Straight-line grid drawings of planar graphs with linear area",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126227/12OmNBOCWfN",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04409059",
"title": "A Divide-and-Conquer Approach to 3D Object Reconstruction from Line Drawings",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04409059/12OmNBh8gRx",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206841",
"title": "3D reconstruction of curved objects from single 2D line drawings",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206841/12OmNwwuDPa",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995643",
"title": "Reconstruction of relief objects from line drawings",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995643/12OmNzayNy6",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/039P1A39",
"title": "Example-based 3D object reconstruction from line drawings",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/039P1A39/12OmNzwHvw4",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118a692",
"title": "Separation of Line Drawings Based on Split Faces for 3D Object Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118a692/12OmNzxyiDL",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/02/06891368",
"title": "Progressive 3D Reconstruction of Planar-Faced Manifold Objects with DRF-Based Line Drawing Decomposition",
"doi": null,
"abstractUrl": "/journal/tg/2015/02/06891368/13rRUwInuWw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2008/02/ttp2008020315",
"title": "Plane-Based Optimization for 3D Object Reconstruction from Single Line Drawings",
"doi": null,
"abstractUrl": "/journal/tp/2008/02/ttp2008020315/13rRUxC0SPD",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2008/03/ttp2008030507",
"title": "What the Back of the Object Looks Like: 3D Reconstruction from Line Drawings without Hidden Lines",
"doi": null,
"abstractUrl": "/journal/tp/2008/03/ttp2008030507/13rRUypp58H",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2005/06/i0861",
"title": "Evolutionary Search for Faces from Line Drawings",
"doi": null,
"abstractUrl": "/journal/tp/2005/06/i0861/13rRUyuvRpU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011010001",
"articleId": "13rRUxjQyis",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011010016",
"articleId": "13rRUwdrdLT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1FHlT4i4Pmw",
"doi": "10.1109/TVCG.2022.3197560",
"abstract": "Creating 3D shapes from 2D drawings is an important problem with applications in content creation for computer animation and virtual reality. We introduce a new sketch-based system, <italic>CreatureShop</italic>, that enables amateurs to create high-quality textured 3D character models from 2D drawings with ease and efficiency. CreatureShop takes an input bitmap drawing of a character (such as an animal or other creature), depicted from an arbitrary descriptive pose and viewpoint, and creates a 3D shape with plausible geometric details and textures from a small number of user annotations on the 2D drawing. Our key contributions are a novel oblique view modeling method, a set of systematic approaches for producing plausible textures on the invisible or occluded parts of the 3D character (as viewed from the direction of the input drawing), and a user-friendly interactive system. We validate our system and methods by creating numerous 3D characters from various drawings, and compare our results with related works to show the advantages of our method. We perform a user study to evaluate the usability of our system, which demonstrates that our system is a practical and efficient approach to create fully-textured 3D character models for novice users.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Creating 3D shapes from 2D drawings is an important problem with applications in content creation for computer animation and virtual reality. We introduce a new sketch-based system, <italic>CreatureShop</italic>, that enables amateurs to create high-quality textured 3D character models from 2D drawings with ease and efficiency. CreatureShop takes an input bitmap drawing of a character (such as an animal or other creature), depicted from an arbitrary descriptive pose and viewpoint, and creates a 3D shape with plausible geometric details and textures from a small number of user annotations on the 2D drawing. Our key contributions are a novel oblique view modeling method, a set of systematic approaches for producing plausible textures on the invisible or occluded parts of the 3D character (as viewed from the direction of the input drawing), and a user-friendly interactive system. We validate our system and methods by creating numerous 3D characters from various drawings, and compare our results with related works to show the advantages of our method. We perform a user study to evaluate the usability of our system, which demonstrates that our system is a practical and efficient approach to create fully-textured 3D character models for novice users.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Creating 3D shapes from 2D drawings is an important problem with applications in content creation for computer animation and virtual reality. We introduce a new sketch-based system, CreatureShop, that enables amateurs to create high-quality textured 3D character models from 2D drawings with ease and efficiency. CreatureShop takes an input bitmap drawing of a character (such as an animal or other creature), depicted from an arbitrary descriptive pose and viewpoint, and creates a 3D shape with plausible geometric details and textures from a small number of user annotations on the 2D drawing. Our key contributions are a novel oblique view modeling method, a set of systematic approaches for producing plausible textures on the invisible or occluded parts of the 3D character (as viewed from the direction of the input drawing), and a user-friendly interactive system. We validate our system and methods by creating numerous 3D characters from various drawings, and compare our results with related works to show the advantages of our method. We perform a user study to evaluate the usability of our system, which demonstrates that our system is a practical and efficient approach to create fully-textured 3D character models for novice users.",
"title": "CreatureShop: Interactive 3D Character Modeling and Texturing from a Single Color Drawing",
"normalizedTitle": "CreatureShop: Interactive 3D Character Modeling and Texturing from a Single Color Drawing",
"fno": "09852696",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Solid Modeling",
"Shape",
"Surface Texture",
"Geometry",
"Electronic Mail",
"Annotations",
"Character Modeling",
"Character Texturing",
"Interactive Techniques"
],
"authors": [
{
"givenName": "Congyi",
"surname": "Zhang",
"fullName": "Congyi Zhang",
"affiliation": "University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lei",
"surname": "Yang",
"fullName": "Lei Yang",
"affiliation": "University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nenglun",
"surname": "Chen",
"fullName": "Nenglun Chen",
"affiliation": "University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicholas",
"surname": "Vining",
"fullName": "Nicholas Vining",
"affiliation": "NVIDIA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alla",
"surname": "Sheffer",
"fullName": "Alla Sheffer",
"affiliation": "University of British Columbia, Vancouver, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Francis C.M.",
"surname": "Lau",
"fullName": "Francis C.M. Lau",
"affiliation": "University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoping",
"surname": "Wang",
"fullName": "Guoping Wang",
"affiliation": "Peking University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenping",
"surname": "Wang",
"fullName": "Wenping Wang",
"affiliation": "Texas A&M University, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "1-18",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2009/3965/0/04811229",
"title": "Poster: Spatially augmented tape drawing",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2009/04811229/12OmNASraBm",
"parentPublication": {
"id": "proceedings/3dui/2009/3965/0",
"title": "2009 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892323",
"title": "Texturing of augmented reality character based on colored drawing",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892323/12OmNCcKQu9",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/das/2014/3244/0/3244a267",
"title": "Color Descriptor for Content-Based Drawing Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/das/2014/3244a267/12OmNqFrGLO",
"parentPublication": {
"id": "proceedings/das/2014/3244/0",
"title": "2014 11th IAPR International Workshop on Document Analysis Systems (DAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2001/1227/0/12270108",
"title": "Progressive 3D Reconstruction from a Sketch Drawing",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270108/12OmNvmXJ7d",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2005/2334/1/01541267",
"title": "3D object reconstruction from a single 2D line drawing without hidden lines",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2005/01541267/12OmNwwd2Xv",
"parentPublication": {
"id": "proceedings/iccv/2005/2334/2",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206841",
"title": "3D reconstruction of curved objects from single 2D line drawings",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206841/12OmNwwuDPa",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/02/06891368",
"title": "Progressive 3D Reconstruction of Planar-Faced Manifold Objects with DRF-Based Line Drawing Decomposition",
"doi": null,
"abstractUrl": "/journal/tg/2015/02/06891368/13rRUwInuWw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2002/12/i1579",
"title": "Identifying Faces in a 2D Line Drawing Representing a Manifold Object",
"doi": null,
"abstractUrl": "/journal/tp/2002/12/i1579/13rRUwhHcRL",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200o4184",
"title": "Neural Strokes: Stylized Line Drawing of 3D Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200o4184/1BmI4k03VrG",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2022/6908/0/690800a037",
"title": "Impossible Objects of Your Choice: Designing Any 3D Objects from a 2D Line Drawing",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2022/690800a037/1FWmXYwyCpG",
"parentPublication": {
"id": "proceedings/nicoint/2022/6908/0",
"title": "2022 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09852330",
"articleId": "1FFHdt1RWHC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09852717",
"articleId": "1FHlThR8hLG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1FKFBjaiIso",
"name": "ttg555501-09852696s1-supp1-3197560.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09852696s1-supp1-3197560.mp4",
"extension": "mp4",
"size": "66.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy7Qfqa",
"title": "Feb.",
"year": "2013",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUytF41x",
"doi": "10.1109/TVCG.2012.134",
"abstract": "We describe a snake-type method for shape registration in 2D and 3D, by fitting a given polygonal template to an acquired image or volume data. The snake aspires to fit itself to the data in a shape which is locally As-Similar-As-Possible (ASAP) to the template. Our ASAP regulating force is based on the Moving Least Squares (MLS) similarity deformation. Combining this force with the traditional internal and external forces associated with a snake leads to a powerful and robust registration algorithm, capable of extracting precise shape information from image data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a snake-type method for shape registration in 2D and 3D, by fitting a given polygonal template to an acquired image or volume data. The snake aspires to fit itself to the data in a shape which is locally As-Similar-As-Possible (ASAP) to the template. Our ASAP regulating force is based on the Moving Least Squares (MLS) similarity deformation. Combining this force with the traditional internal and external forces associated with a snake leads to a powerful and robust registration algorithm, capable of extracting precise shape information from image data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a snake-type method for shape registration in 2D and 3D, by fitting a given polygonal template to an acquired image or volume data. The snake aspires to fit itself to the data in a shape which is locally As-Similar-As-Possible (ASAP) to the template. Our ASAP regulating force is based on the Moving Least Squares (MLS) similarity deformation. Combining this force with the traditional internal and external forces associated with a snake leads to a powerful and robust registration algorithm, capable of extracting precise shape information from image data.",
"title": "D-Snake: Image Registration by As-Similar-As-Possible Template Deformation",
"normalizedTitle": "D-Snake: Image Registration by As-Similar-As-Possible Template Deformation",
"fno": "ttg2013020331",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Least Squares Approximations",
"Feature Extraction",
"Image Matching",
"Image Registration",
"Image Data",
"D Snake",
"Image Registration",
"As Similar As Possible Template Deformation",
"Snake Type Method",
"2 D Shape Registration",
"3 D Shape Registration",
"Polygonal Template Fitting",
"Volume Data",
"ASAP Regulating Force",
"Moving Least Squares Similarity Deformation",
"MLS Similarity Deformation",
"Registration Algorithm",
"Precise Shape Information Extraction",
"Force",
"Shape",
"Image Edge Detection",
"Three Dimensional Displays",
"Computed Tomography",
"Lungs",
"Deformable Models",
"MLS Deformation",
"Snake",
"Registration"
],
"authors": [
{
"givenName": "Z.",
"surname": "Levi",
"fullName": "Z. Levi",
"affiliation": "Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Gotsman",
"fullName": "C. Gotsman",
"affiliation": "Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2013-02-01 00:00:00",
"pubType": "trans",
"pages": "331-343",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icig/2011/4541/0/4541a193",
"title": "Vision-Related MLS Image Deformation Using Saliency Map",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2011/4541a193/12OmNAnuTx7",
"parentPublication": {
"id": "proceedings/icig/2011/4541/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2016/1437/0/1437a549",
"title": "Population Shape Collapse in Large Deformation Registration of MR Brain Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437a549/12OmNBc1uxU",
"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/icycs/2008/3398/0/3398a677",
"title": "Transferring Landmarks to Individual Foot Using Deformable Template Models",
"doi": null,
"abstractUrl": "/proceedings-article/icycs/2008/3398a677/12OmNCeK2l3",
"parentPublication": {
"id": "proceedings/icycs/2008/3398/0",
"title": "2008 9th International Conference for Young Computer Scientists",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2011/4362/0/4362a212",
"title": "Elastic Shape Registration Using an Incremental Free Form Deformation Approach with the ICP Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2011/4362a212/12OmNCfSqOt",
"parentPublication": {
"id": "proceedings/crv/2011/4362/0",
"title": "2011 Canadian Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/1/3118a728",
"title": "Tissue Cell Boundaries Detection based on Curvelet-based Snake Model in Electrorotation Bio-chip Control System",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118a728/12OmNCulYk0",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/1",
"title": "2008 International Conference on Biomedical Engineering and Informatics (BMEI 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ihmsc/2010/4151/1/4151a213",
"title": "Boundary Reconstruction by Improved B-Snake Model to Express Precise Plasma Shape",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2010/4151a213/12OmNqBbHKv",
"parentPublication": {
"id": "proceedings/ihmsc/2010/4151/1",
"title": "Intelligent Human-Machine Systems and Cybernetics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420816",
"title": "A snake for model-based segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420816/12OmNvjgWwK",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/2/3118b238",
"title": "Segmentation of the Left Ventricle from Cardiac MR Images Based on Radial GVF Snake",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118b238/12OmNx4gUu8",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/2",
"title": "BioMedical Engineering and Informatics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2010/4258/0/4258a068",
"title": "Application of Improved Snake Model in Segmentation of Korean Pine Cone Image",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2010/4258a068/12OmNzl3WYd",
"parentPublication": {
"id": "proceedings/mines/2010/4258/0",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/03/mcg2012030037",
"title": "Nonrigid-Deformation Recovery for 3D Face Recognition Using Multiscale Registration",
"doi": null,
"abstractUrl": "/magazine/cg/2012/03/mcg2012030037/13rRUy0ZzSd",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013020319",
"articleId": "13rRUxC0SvT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013020344",
"articleId": "13rRUEgarjt",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesZr",
"name": "ttg2013020331s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013020331s.pdf",
"extension": "pdf",
"size": "43.2 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBsLPf1",
"title": "Aug.",
"year": "2020",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "42",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "18K0dyftG5q",
"doi": "10.1109/TPAMI.2019.2907850",
"abstract": "Humans implicitly rely on the properties of materials to guide our interactions. Grasping smooth materials, for example, requires more care than rough ones. We may even visually infer non-visual properties (e.g., softness is a physical material property). We refer to visually-recognizable material properties as visual material attributes. Recognizing these attributes in images can provide valuable information for scene understanding and material recognition. Unlike typical object and scene attributes, however, visual material attributes are local (i.e., “fuzziness” does not have a shape). Given full supervision, we may accurately recognize such attributes from purely local information (small image patches). Obtaining consistent full supervision at scale, however, is challenging. To solve this problem, we probe the human visual perception of materials. By asking simple yes/no questions comparing pairs of image patches, we obtain the weak supervision required to build a set of classifiers for attributes that, while unnamed, function similarly to the attributes with which we describe materials. Furthermore, we integrate this method in the end-to-end learning of a CNN that simultaneously recognizes materials and their visual attributes. Experiments show that visual material attributes serve as both a useful representation for known material categories and as a basis for transfer learning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Humans implicitly rely on the properties of materials to guide our interactions. Grasping smooth materials, for example, requires more care than rough ones. We may even visually infer non-visual properties (e.g., softness is a physical material property). We refer to visually-recognizable material properties as visual material attributes. Recognizing these attributes in images can provide valuable information for scene understanding and material recognition. Unlike typical object and scene attributes, however, visual material attributes are local (i.e., “fuzziness” does not have a shape). Given full supervision, we may accurately recognize such attributes from purely local information (small image patches). Obtaining consistent full supervision at scale, however, is challenging. To solve this problem, we probe the human visual perception of materials. By asking simple yes/no questions comparing pairs of image patches, we obtain the weak supervision required to build a set of classifiers for attributes that, while unnamed, function similarly to the attributes with which we describe materials. Furthermore, we integrate this method in the end-to-end learning of a CNN that simultaneously recognizes materials and their visual attributes. Experiments show that visual material attributes serve as both a useful representation for known material categories and as a basis for transfer learning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Humans implicitly rely on the properties of materials to guide our interactions. Grasping smooth materials, for example, requires more care than rough ones. We may even visually infer non-visual properties (e.g., softness is a physical material property). We refer to visually-recognizable material properties as visual material attributes. Recognizing these attributes in images can provide valuable information for scene understanding and material recognition. Unlike typical object and scene attributes, however, visual material attributes are local (i.e., “fuzziness” does not have a shape). Given full supervision, we may accurately recognize such attributes from purely local information (small image patches). Obtaining consistent full supervision at scale, however, is challenging. To solve this problem, we probe the human visual perception of materials. By asking simple yes/no questions comparing pairs of image patches, we obtain the weak supervision required to build a set of classifiers for attributes that, while unnamed, function similarly to the attributes with which we describe materials. Furthermore, we integrate this method in the end-to-end learning of a CNN that simultaneously recognizes materials and their visual attributes. Experiments show that visual material attributes serve as both a useful representation for known material categories and as a basis for transfer learning.",
"title": "Recognizing Material Properties from Images",
"normalizedTitle": "Recognizing Material Properties from Images",
"fno": "08675400",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computer Vision",
"Feature Extraction",
"Image Classification",
"Learning Artificial Intelligence",
"Object Recognition",
"Visual Perception",
"Smooth Materials",
"Nonvisual Properties",
"Physical Material Property",
"Visually Recognizable Material Properties",
"Visual Material Attributes",
"Scene Understanding",
"Material Recognition",
"Scene Attributes",
"Image Patches",
"Human Visual Perception",
"Simultaneously Recognizes Materials",
"Visual Attributes",
"Material Categories",
"Visualization",
"Image Recognition",
"Material Properties",
"Shape",
"Face",
"Visual Perception",
"Semantics",
"Visual Material Attributes",
"Human Material Perception",
"Material Recognition"
],
"authors": [
{
"givenName": "Gabriel",
"surname": "Schwartz",
"fullName": "Gabriel Schwartz",
"affiliation": "Department of Computer Science, Drexel University, Philadelphia, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ko",
"surname": "Nishino",
"fullName": "Ko Nishino",
"affiliation": "Department of Computer Science, Drexel University, Philadelphia, PA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2020-08-01 00:00:00",
"pubType": "trans",
"pages": "1981-1995",
"year": "2020",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmtma/2009/3583/3/3583c202",
"title": "Determination of Material Properties of Functionally Graded Hollow Cylinders Using Artificial Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583c202/12OmNAR1aRg",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2015/6964/0/07298979",
"title": "Automatically discovering local visual material attributes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2015/07298979/12OmNAZx8N5",
"parentPublication": {
"id": "proceedings/cvpr/2015/6964/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mvhi/2010/4009/0/4009a592",
"title": "Prediction of Material Mechanical Properties with Support Vector Machine",
"doi": null,
"abstractUrl": "/proceedings-article/mvhi/2010/4009a592/12OmNAlvHXp",
"parentPublication": {
"id": "proceedings/mvhi/2010/4009/0",
"title": "Machine Vision and Human-machine Interface, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbec/2016/2132/0/07458997",
"title": "Spin Coating of 3D Printed Cardiovascular Anatomical Models, Controlling Material Properties on Complex Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/sbec/2016/07458997/12OmNAtK4r8",
"parentPublication": {
"id": "proceedings/sbec/2016/2132/0",
"title": "2016 32nd Southern Biomedical Engineering Conference (SBEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2013/3022/0/3022a883",
"title": "Visual Material Traits: Recognizing Per-Pixel Material Context",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2013/3022a883/12OmNCfSqFB",
"parentPublication": {
"id": "proceedings/iccvw/2013/3022/0",
"title": "2013 IEEE International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032e393",
"title": "Learning-Based Cloth Material Recovery from Video",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032e393/12OmNCmGNUg",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ams/2011/4414/0/4414a003",
"title": "Predictive Modeling of Material Properties Using GMDH-based Abductive Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ams/2011/4414a003/12OmNscOUfx",
"parentPublication": {
"id": "proceedings/ams/2011/4414/0",
"title": "Asia International Conference on Modelling & Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cca/2000/6562/0/00897537",
"title": "Identification of layered material properties using wavelet transform of ultrasonic data",
"doi": null,
"abstractUrl": "/proceedings-article/cca/2000/00897537/12OmNzvhvub",
"parentPublication": {
"id": "proceedings/cca/2000/6562/0",
"title": "Proceedings of the 2000 IEEE International Conference on Control Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/04/07728146",
"title": "Visual Vibrometry: Estimating Material Properties from Small Motions in Video",
"doi": null,
"abstractUrl": "/journal/tp/2017/04/07728146/13rRUxYrbNC",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/02/06894217",
"title": "Space-Time Transfinite Interpolation of Volumetric Material Properties",
"doi": null,
"abstractUrl": "/journal/tg/2015/02/06894217/13rRUyoPSP7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08664165",
"articleId": "1l6O1jNPsxW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08666808",
"articleId": "18mLzzeeRsk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1l6X93FfjKo",
"name": "ttp202008-08675400s1-pami_supplemental.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202008-08675400s1-pami_supplemental.pdf",
"extension": "pdf",
"size": "91.9 kB",
"__typename": "WebExtraType"
}
],
"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": "13rRUwfZC0l",
"doi": "10.1109/TVCG.2015.2467931",
"abstract": "Uncovering the causal relations that exist among variables in multivariate datasets is one of the ultimate goals in data analytics. Causation is related to correlation but correlation does not imply causation. While a number of casual discovery algorithms have been devised that eliminate spurious correlations from a network, there are no guarantees that all of the inferred causations are indeed true. Hence, bringing a domain expert into the casual reasoning loop can be of great benefit in identifying erroneous casual relationships suggested by the discovery algorithm. To address this need we present the Visual Causal Analyst-a novel visual causal reasoning framework that allows users to apply their expertise, verify and edit causal links, and collaborate with the causal discovery algorithm to identify a valid causal network. Its interface consists of both an interactive 2D graph view and a numerical presentation of salient statistical parameters, such as regression coefficients, p-values, and others. Both help users in gaining a good understanding of the landscape of causal structures particularly when the number of variables is large. Our framework is also novel in that it can handle both numerical and categorical variables within one unified model and return plausible results. We demonstrate its use via a set of case studies using multiple practical datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Uncovering the causal relations that exist among variables in multivariate datasets is one of the ultimate goals in data analytics. Causation is related to correlation but correlation does not imply causation. While a number of casual discovery algorithms have been devised that eliminate spurious correlations from a network, there are no guarantees that all of the inferred causations are indeed true. Hence, bringing a domain expert into the casual reasoning loop can be of great benefit in identifying erroneous casual relationships suggested by the discovery algorithm. To address this need we present the Visual Causal Analyst-a novel visual causal reasoning framework that allows users to apply their expertise, verify and edit causal links, and collaborate with the causal discovery algorithm to identify a valid causal network. Its interface consists of both an interactive 2D graph view and a numerical presentation of salient statistical parameters, such as regression coefficients, p-values, and others. Both help users in gaining a good understanding of the landscape of causal structures particularly when the number of variables is large. Our framework is also novel in that it can handle both numerical and categorical variables within one unified model and return plausible results. We demonstrate its use via a set of case studies using multiple practical datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Uncovering the causal relations that exist among variables in multivariate datasets is one of the ultimate goals in data analytics. Causation is related to correlation but correlation does not imply causation. While a number of casual discovery algorithms have been devised that eliminate spurious correlations from a network, there are no guarantees that all of the inferred causations are indeed true. Hence, bringing a domain expert into the casual reasoning loop can be of great benefit in identifying erroneous casual relationships suggested by the discovery algorithm. To address this need we present the Visual Causal Analyst-a novel visual causal reasoning framework that allows users to apply their expertise, verify and edit causal links, and collaborate with the causal discovery algorithm to identify a valid causal network. Its interface consists of both an interactive 2D graph view and a numerical presentation of salient statistical parameters, such as regression coefficients, p-values, and others. Both help users in gaining a good understanding of the landscape of causal structures particularly when the number of variables is large. Our framework is also novel in that it can handle both numerical and categorical variables within one unified model and return plausible results. We demonstrate its use via a set of case studies using multiple practical datasets.",
"title": "The Visual Causality Analyst: An Interactive Interface for Causal Reasoning",
"normalizedTitle": "The Visual Causality Analyst: An Interactive Interface for Causal Reasoning",
"fno": "07192729",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Correlation",
"Visualization",
"Layout",
"Linear Regression",
"Optimization",
"Inference Algorithms",
"High Dimensional Data",
"Visual Knowledge Discovery",
"Causality",
"Hypothesis Testing",
"Visual Evidence",
"High Dimensional Data",
"Visual Knowledge Discovery",
"Causality",
"Hypothesis Testing",
"Visual Evidence"
],
"authors": [
{
"givenName": "Jun",
"surname": "Wang",
"fullName": "Jun Wang",
"affiliation": "Computer Science Department, Visual Analytics and Imaging Lab, Stony Brook, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Klaus",
"surname": "Mueller",
"fullName": "Klaus Mueller",
"affiliation": "Computer Science Department, Visual Analytics and Imaging Lab, Stony Brook, NY",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "230-239",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/caia/1990/2032/0/00089166",
"title": "A minimal connection model of abductive diagnostic reasoning",
"doi": null,
"abstractUrl": "/proceedings-article/caia/1990/00089166/12OmNBv2Ckx",
"parentPublication": {
"id": "proceedings/caia/1990/2032/0",
"title": "Sixth Conference on Artificial Intelligence for Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/coginf/2010/8042/0/05599825",
"title": "Online causal discovery",
"doi": null,
"abstractUrl": "/proceedings-article/coginf/2010/05599825/12OmNvA1hkq",
"parentPublication": {
"id": "proceedings/coginf/2010/8042/0",
"title": "2010 9th IEEE International Conference on Cognitive Informatics (ICCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2015/0481/0/07394344",
"title": "Conjunctive combined causal rules mining",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2015/07394344/12OmNvjgWCL",
"parentPublication": {
"id": "proceedings/isspit/2015/0481/0",
"title": "2015 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/1999/0281/0/02810780",
"title": "Towards the Formalization of Legal Causal Reasoning",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/1999/02810780/12OmNxGSmos",
"parentPublication": {
"id": "proceedings/dexa/1999/0281/0",
"title": "Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2010/8485/0/05635201",
"title": "Causal Reasoning with Neuron Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2010/05635201/12OmNyRPgSL",
"parentPublication": {
"id": "proceedings/vlhcc/2010/8485/0",
"title": "2010 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/12/ttp2011122436",
"title": "Causal Inference on Discrete Data Using Additive Noise Models",
"doi": null,
"abstractUrl": "/journal/tp/2011/12/ttp2011122436/13rRUwhpBP1",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585647",
"title": "Visual Causality Analysis Made Practical",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585647/17D45VTRouU",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2020/3497/0/349700a179",
"title": "SoK: Differential Privacy as a Causal Property",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2020/349700a179/1j2LfwvKKas",
"parentPublication": {
"id": "proceedings/sp/2020/3497/0/",
"title": "2020 IEEE Symposium on Security and Privacy (SP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900b740",
"title": "Shadow-Mapping for Unsupervised Neural Causal Discovery",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900b740/1yVzYG3GVFe",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900k0638",
"title": "ACRE: Abstract Causal REasoning Beyond Covariation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0638/1yeIbqfckvu",
"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": "07192705",
"articleId": "13rRUNvyaf3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07192716",
"articleId": "13rRUxlgxTo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvTBB7S",
"title": "April",
"year": "2006",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "18",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjQycd",
"doi": "10.1109/TKDE.2006.68",
"abstract": "Given a user-specified minimum correlation threshold \\theta and a market-basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with correlations above the threshold \\theta. However, when the number of items and transactions are large, the computation cost of this query can be very high. The goal of this paper is to provide computationally efficient algorithms to answer the all-strong-pairs correlation query. Indeed, we identify an upper bound of Pearson's correlation coefficient for binary variables. This upper bound is not only much cheaper to compute than Pearson's correlation coefficient, but also exhibits special monotone properties which allow pruning of many item pairs even without computing their upper bounds. A Two-step All-strong-Pairs corElation queRy (TAPER) algorithm is proposed to exploit these properties in a filter-and-refine manner. Furthermore, we provide an algebraic cost model which shows that the computation savings from pruning is independent of or improves when the number of items is increased in data sets with Zipf-like or linear rank-support distributions. Experimental results from synthetic and real-world data sets exhibit similar trends and show that the TAPER algorithm can be an order of magnitude faster than brute-force alternatives. Finally, we demonstrate that the algorithmic ideas developed in the TAPER algorithm can be extended to efficiently compute negative correlation and uncentered Pearson's correlation coefficient.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a user-specified minimum correlation threshold \\theta and a market-basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with correlations above the threshold \\theta. However, when the number of items and transactions are large, the computation cost of this query can be very high. The goal of this paper is to provide computationally efficient algorithms to answer the all-strong-pairs correlation query. Indeed, we identify an upper bound of Pearson's correlation coefficient for binary variables. This upper bound is not only much cheaper to compute than Pearson's correlation coefficient, but also exhibits special monotone properties which allow pruning of many item pairs even without computing their upper bounds. A Two-step All-strong-Pairs corElation queRy (TAPER) algorithm is proposed to exploit these properties in a filter-and-refine manner. Furthermore, we provide an algebraic cost model which shows that the computation savings from pruning is independent of or improves when the number of items is increased in data sets with Zipf-like or linear rank-support distributions. Experimental results from synthetic and real-world data sets exhibit similar trends and show that the TAPER algorithm can be an order of magnitude faster than brute-force alternatives. Finally, we demonstrate that the algorithmic ideas developed in the TAPER algorithm can be extended to efficiently compute negative correlation and uncentered Pearson's correlation coefficient.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a user-specified minimum correlation threshold \\theta and a market-basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with correlations above the threshold \\theta. However, when the number of items and transactions are large, the computation cost of this query can be very high. The goal of this paper is to provide computationally efficient algorithms to answer the all-strong-pairs correlation query. Indeed, we identify an upper bound of Pearson's correlation coefficient for binary variables. This upper bound is not only much cheaper to compute than Pearson's correlation coefficient, but also exhibits special monotone properties which allow pruning of many item pairs even without computing their upper bounds. A Two-step All-strong-Pairs corElation queRy (TAPER) algorithm is proposed to exploit these properties in a filter-and-refine manner. Furthermore, we provide an algebraic cost model which shows that the computation savings from pruning is independent of or improves when the number of items is increased in data sets with Zipf-like or linear rank-support distributions. Experimental results from synthetic and real-world data sets exhibit similar trends and show that the TAPER algorithm can be an order of magnitude faster than brute-force alternatives. Finally, we demonstrate that the algorithmic ideas developed in the TAPER algorithm can be extended to efficiently compute negative correlation and uncentered Pearson's correlation coefficient.",
"title": "TAPER: A Two-Step Approach for All-Strong-Pairs Correlation Query in Large Databases",
"normalizedTitle": "TAPER: A Two-Step Approach for All-Strong-Pairs Correlation Query in Large Databases",
"fno": "k0493",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Association Analysis",
"Data Mining",
"Pearsons Correlation Coefficient",
"Statistical Computing"
],
"authors": [
{
"givenName": "Hui",
"surname": "Xiong",
"fullName": "Hui Xiong",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shashi",
"surname": "Shekhar",
"fullName": "Shashi Shekhar",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pang-Ning",
"surname": "Tan",
"fullName": "Pang-Ning Tan",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vipin",
"surname": "Kumar",
"fullName": "Vipin Kumar",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2006-04-01 00:00:00",
"pubType": "trans",
"pages": "493-508",
"year": "2006",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icisce/2015/6850/0/6850a508",
"title": "The Research of Data Mining Analysis System Based on Pearson Relation",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2015/6850a508/12OmNAtK4ph",
"parentPublication": {
"id": "proceedings/icisce/2015/6850/0",
"title": "2015 2nd International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waim/2008/3185/0/3185a413",
"title": "Finding Correlated Item Pairs through Efficient Pruning with a Given Threshold",
"doi": null,
"abstractUrl": "/proceedings-article/waim/2008/3185a413/12OmNBDgZ1r",
"parentPublication": {
"id": "proceedings/waim/2008/3185/0",
"title": "Web-Age Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2008/3503/0/3503a275",
"title": "Mining Correlated Pairs of Patterns in Multidimensional Structured Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2008/3503a275/12OmNqOfftw",
"parentPublication": {
"id": "proceedings/icdmw/2008/3503/0",
"title": "2008 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2006/2701/0/04053172",
"title": "TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2006/04053172/12OmNwErpAD",
"parentPublication": {
"id": "proceedings/icdm/2006/2701/0",
"title": "Sixth International Conference on Data Mining (ICDM'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfcse/2011/1562/0/06041752",
"title": "Research of Mining Algorithm Based on 1NF Strongly Correlated Item Pair",
"doi": null,
"abstractUrl": "/proceedings-article/icfcse/2011/06041752/12OmNwErpCf",
"parentPublication": {
"id": "proceedings/icfcse/2011/1562/0",
"title": "2011 International Conference on Future Computer Science and Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wgec/2008/3334/0/3334a423",
"title": "Research on Improved Data-Mining Algorithm Based on Strong Correlation",
"doi": null,
"abstractUrl": "/proceedings-article/wgec/2008/3334a423/12OmNzRZpZp",
"parentPublication": {
"id": "proceedings/wgec/2008/3334/0",
"title": "2008 Second International Conference on Genetic and Evolutionary Computing (WGEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2009/3895/0/3895a239",
"title": "Efficient Discovery of Frequent Correlated Subgraph Pairs",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2009/3895a239/12OmNzxPTMV",
"parentPublication": {
"id": "proceedings/icdm/2009/3895/0",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2015/9504/0/9504a111",
"title": "Exceptionally Monotone Models -- The Rank Correlation Model Class for Exceptional Model Mining",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504a111/12OmNzyp5Xr",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/03/07903601",
"title": "Investigating Correlation between Protein Sequence Similarity and Semantic Similarity Using Gene Ontology Annotations",
"doi": null,
"abstractUrl": "/journal/tb/2018/03/07903601/13rRUxDqS6V",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0/08291940",
"title": "Identifying Dominant Amino Acid Pairs of Known Protein-Protein Interactions via K-Means Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2017/08291940/17D45XuDNGU",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "k0482",
"articleId": "13rRUwhpBOg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k0509",
"articleId": "13rRUwInvBp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCd2rts",
"title": "June",
"year": "1981",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "3",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJAq",
"doi": "10.1109/TPAMI.1981.4767172",
"abstract": "Several types of gray-weighted ``medial axes'' have been defined. This paper shows that one of them, the min-max medial axis, can be used to reconstruct good approximations to the original image based on a relatively small amount of information.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Several types of gray-weighted ``medial axes'' have been defined. This paper shows that one of them, the min-max medial axis, can be used to reconstruct good approximations to the original image based on a relatively small amount of information.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Several types of gray-weighted ``medial axes'' have been defined. This paper shows that one of them, the min-max medial axis, can be used to reconstruct good approximations to the original image based on a relatively small amount of information.",
"title": "Image Approximation from Gray Scale ``Medial Axes''",
"normalizedTitle": "Image Approximation from Gray Scale ``Medial Axes''",
"fno": "04767172",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [],
"authors": [
{
"givenName": "Shyuan",
"surname": "Wang",
"fullName": "Shyuan Wang",
"affiliation": "Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Angela Y.",
"surname": "Wu",
"fullName": "Angela Y. Wu",
"affiliation": "Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Azriel",
"surname": "Rosenfeld",
"fullName": "Azriel Rosenfeld",
"affiliation": "Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1981-11-01 00:00:00",
"pubType": "trans",
"pages": "687-696",
"year": "1981",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2004/2128/3/212830123",
"title": "Towards Surface Regularization via Medial Axis Transitions",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212830123/12OmNvSbBDk",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1999/0164/1/01640385",
"title": "On the Local Form and Transitions of Symmetry Sets, Medial Axes, and Shocks",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1999/01640385/12OmNvqEvK5",
"parentPublication": {
"id": "proceedings/iccv/1999/0164/1",
"title": "Proceedings of the Seventh IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2010/4112/0/4112a066",
"title": "The Fusion as a Novel Binary Operation on Medial Axes",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2010/4112a066/12OmNwDACkp",
"parentPublication": {
"id": "proceedings/isvd/2010/4112/0",
"title": "2010 International Symposium on Voronoi Diagrams in Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2006/2630/0/26300040",
"title": "Stable and Topology-Preserving Extraction of Medial Axes",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2006/26300040/12OmNxA3YVu",
"parentPublication": {
"id": "proceedings/isvd/2006/2630/0",
"title": "2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2002/1846/0/18460420",
"title": "Medial Axes Neuronal Codification in Topographical Maps",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2002/18460420/12OmNy6qfJq",
"parentPublication": {
"id": "proceedings/sibgrapi/2002/1846/0",
"title": "Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2009/3816/2/3816b544",
"title": "Medial Axis Extraction Using Growing Neural Gas",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2009/3816b544/12OmNyS6REf",
"parentPublication": {
"id": "proceedings/aici/2009/3816/2",
"title": "2009 International Conference on Artificial Intelligence and Computational Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2009/3781/0/3781a171",
"title": "Medial Axis Approximation with Bounded Error",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2009/3781a171/12OmNyUWR1g",
"parentPublication": {
"id": "proceedings/isvd/2009/3781/0",
"title": "2009 Sixth International Symposium on Voronoi Diagrams",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1986/04/04767815",
"title": "Shape Smoothing Using Medial Axis Properties",
"doi": null,
"abstractUrl": "/journal/tp/1986/04/04767815/13rRUwj7cpY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1999/11/i1158",
"title": "Stochastic Jump-Diffusion Process for Computing Medial Axes in Markov Random Fields",
"doi": null,
"abstractUrl": "/journal/tp/1999/11/i1158/13rRUxBJhwv",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/12/07364294",
"title": "A Robust Divide and Conquer Algorithm for Progressive Medial Axes of Planar Shapes",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07364294/13rRUxOdD2J",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04767171",
"articleId": "13rRUwwJWGs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04767173",
"articleId": "13rRUxC0SPh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzcxZoT",
"title": "November",
"year": "1999",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "21",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBJhwv",
"doi": "10.1109/34.809109",
"abstract": "Abstract—This paper proposes a statistical framework for computing medial axes of 2D shapes. In this paper, the computation of medial axes is posed as a statistical inference problem not as a mathematical transform. This paper contributes to three aspects in computing medial axes. 1) Prior knowledge is adopted for axes and junctions so that axes around junctions are regularized. 2) Multiple interpretations of axes are possible, each being assigned a probability. 3) A novel stochastic jump-diffusion process is proposed for estimating both axes and junctions in Markov random fields. We argue that the stochastic algorithm for computing medial axes is compatible with existing algorithms for image segmentation, such as region growing [31], snake [7], and region competition [26]. Thus, our method provides a new direction for computing medial axes from texture images. Experiments are demonstrated on both synthetic and real 2D shapes. This algorithm has been successfully applied to shape learning and sampling in a companion paper [30].",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper proposes a statistical framework for computing medial axes of 2D shapes. In this paper, the computation of medial axes is posed as a statistical inference problem not as a mathematical transform. This paper contributes to three aspects in computing medial axes. 1) Prior knowledge is adopted for axes and junctions so that axes around junctions are regularized. 2) Multiple interpretations of axes are possible, each being assigned a probability. 3) A novel stochastic jump-diffusion process is proposed for estimating both axes and junctions in Markov random fields. We argue that the stochastic algorithm for computing medial axes is compatible with existing algorithms for image segmentation, such as region growing [31], snake [7], and region competition [26]. Thus, our method provides a new direction for computing medial axes from texture images. Experiments are demonstrated on both synthetic and real 2D shapes. This algorithm has been successfully applied to shape learning and sampling in a companion paper [30].",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper proposes a statistical framework for computing medial axes of 2D shapes. In this paper, the computation of medial axes is posed as a statistical inference problem not as a mathematical transform. This paper contributes to three aspects in computing medial axes. 1) Prior knowledge is adopted for axes and junctions so that axes around junctions are regularized. 2) Multiple interpretations of axes are possible, each being assigned a probability. 3) A novel stochastic jump-diffusion process is proposed for estimating both axes and junctions in Markov random fields. We argue that the stochastic algorithm for computing medial axes is compatible with existing algorithms for image segmentation, such as region growing [31], snake [7], and region competition [26]. Thus, our method provides a new direction for computing medial axes from texture images. Experiments are demonstrated on both synthetic and real 2D shapes. This algorithm has been successfully applied to shape learning and sampling in a companion paper [30].",
"title": "Stochastic Jump-Diffusion Process for Computing Medial Axes in Markov Random Fields",
"normalizedTitle": "Stochastic Jump-Diffusion Process for Computing Medial Axes in Markov Random Fields",
"fno": "i1158",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Medial Axis Transform",
"Jump Diffusion Process",
"Energy Minimization",
"Markov Random Field"
],
"authors": [
{
"givenName": "Song-Chun",
"surname": "Zhu",
"fullName": "Song-Chun Zhu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "1999-11-01 00:00:00",
"pubType": "trans",
"pages": "1158-1169",
"year": "1999",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i1145",
"articleId": "13rRUwfZBW9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1170",
"articleId": "13rRUy0qnHo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04X",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1JDoWX1yfDO",
"doi": "10.1109/TPAMI.2023.3234002",
"abstract": "Recent advances in self-supervised learning (SSL) in computer vision are primarily comparative, whose goal is to preserve invariant and discriminative semantics in latent representations by comparing siamese image views. However, the preserved high-level semantics do not contain enough local information, which is vital in medical image analysis (e.g., image-based diagnosis and tumor segmentation). To mitigate the locality problem of comparative SSL, we propose to incorporate the task of pixel restoration for explicitly encoding more pixel-level information into high-level semantics. We also address the preservation of scale information, a powerful tool in aiding image understanding but has not drawn much attention in SSL. The resulting framework can be formulated as a multi-task optimization problem on the feature pyramid. Specifically, we conduct multi-scale pixel restoration and siamese feature comparison in the pyramid. In addition, we propose non-skip U-Net to build the feature pyramid and develop sub-crop to replace multi-crop in 3D medical imaging. The proposed unified SSL framework (PCRLv2) surpasses its self-supervised counterparts on various tasks, including brain tumor segmentation (BraTS 2018), chest pathology identification (ChestX-ray, CheXpert), pulmonary nodule detection (LUNA), and abdominal organ segmentation (LiTS), sometimes outperforming them by large margins with limited annotations. Codes and models are available at https://github.com/RL4M/PCRLv2.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent advances in self-supervised learning (SSL) in computer vision are primarily comparative, whose goal is to preserve invariant and discriminative semantics in latent representations by comparing siamese image views. However, the preserved high-level semantics do not contain enough local information, which is vital in medical image analysis (e.g., image-based diagnosis and tumor segmentation). To mitigate the locality problem of comparative SSL, we propose to incorporate the task of pixel restoration for explicitly encoding more pixel-level information into high-level semantics. We also address the preservation of scale information, a powerful tool in aiding image understanding but has not drawn much attention in SSL. The resulting framework can be formulated as a multi-task optimization problem on the feature pyramid. Specifically, we conduct multi-scale pixel restoration and siamese feature comparison in the pyramid. In addition, we propose non-skip U-Net to build the feature pyramid and develop sub-crop to replace multi-crop in 3D medical imaging. The proposed unified SSL framework (PCRLv2) surpasses its self-supervised counterparts on various tasks, including brain tumor segmentation (BraTS 2018), chest pathology identification (ChestX-ray, CheXpert), pulmonary nodule detection (LUNA), and abdominal organ segmentation (LiTS), sometimes outperforming them by large margins with limited annotations. Codes and models are available at https://github.com/RL4M/PCRLv2.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent advances in self-supervised learning (SSL) in computer vision are primarily comparative, whose goal is to preserve invariant and discriminative semantics in latent representations by comparing siamese image views. However, the preserved high-level semantics do not contain enough local information, which is vital in medical image analysis (e.g., image-based diagnosis and tumor segmentation). To mitigate the locality problem of comparative SSL, we propose to incorporate the task of pixel restoration for explicitly encoding more pixel-level information into high-level semantics. We also address the preservation of scale information, a powerful tool in aiding image understanding but has not drawn much attention in SSL. The resulting framework can be formulated as a multi-task optimization problem on the feature pyramid. Specifically, we conduct multi-scale pixel restoration and siamese feature comparison in the pyramid. In addition, we propose non-skip U-Net to build the feature pyramid and develop sub-crop to replace multi-crop in 3D medical imaging. The proposed unified SSL framework (PCRLv2) surpasses its self-supervised counterparts on various tasks, including brain tumor segmentation (BraTS 2018), chest pathology identification (ChestX-ray, CheXpert), pulmonary nodule detection (LUNA), and abdominal organ segmentation (LiTS), sometimes outperforming them by large margins with limited annotations. Codes and models are available at https://github.com/RL4M/PCRLv2.",
"title": "A Unified Visual Information Preservation Framework for Self-supervised Pre-training in Medical Image Analysis",
"normalizedTitle": "A Unified Visual Information Preservation Framework for Self-supervised Pre-training in Medical Image Analysis",
"fno": "10005161",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Semantics",
"Image Restoration",
"Task Analysis",
"Visualization",
"Three Dimensional Displays",
"Medical Diagnostic Imaging",
"Image Segmentation",
"Medical Image Analysis",
"Self Supervised Learning",
"Transfer Learning",
"Context Restoration",
"Feature Pyramid"
],
"authors": [
{
"givenName": "Hong-Yu",
"surname": "Zhou",
"fullName": "Hong-Yu Zhou",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chixiang",
"surname": "Lu",
"fullName": "Chixiang Lu",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chaoqi",
"surname": "Chen",
"fullName": "Chaoqi Chen",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sibei",
"surname": "Yang",
"fullName": "Sibei Yang",
"affiliation": "ShanghaiTech University and Shanghai Engineering Research Center of Intelligent Vision and Imaging, Shanghai, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yizhou",
"surname": "Yu",
"fullName": "Yizhou Yu",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icccnt/2013/3926/0/06726599",
"title": "A novel technique for medical image fusion using improved contourlet transformation with modified DFBs",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2013/06726599/12OmNCfSqH3",
"parentPublication": {
"id": "proceedings/icccnt/2013/3926/0",
"title": "2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284643",
"title": "Image Restoration with Intensity Preservation from Fluorescein Angiogram Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284643/12OmNy2ah29",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icct/2017/3030/0/08324043",
"title": "Secure medical communication using sixteen rectangle substitution cipher and information-location dependent steganography",
"doi": null,
"abstractUrl": "/proceedings-article/icct/2017/08324043/12OmNy68EKw",
"parentPublication": {
"id": "proceedings/icct/2017/3030/0",
"title": "2017 International Conference on Intelligent Communication and Computational Techniques (ICCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600u0665",
"title": "ACPL: Anti-curriculum Pseudo-labelling for Semi-supervised Medical Image Classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600u0665/1H1hJlSuLYI",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600o4607",
"title": "UniVIP: A Unified Framework for Self-Supervised Visual Pre-training",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600o4607/1H1l43AwOZi",
"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/tb/5555/01/10068814",
"title": "SSP-Net: A Siamese-based Structure-Preserving Generative Adversarial Network for Unpaired Medical Image Enhancement",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10068814/1LvvUyuCefS",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/10091165",
"title": "Efficient and Accurate Cloud-Assisted Medical Pre-Diagnosis With Privacy Preservation",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/10091165/1M2IL6xuBX2",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/5555/01/10114995",
"title": "A Dual-Stage Semi-Supervised Pre-Training Approach for Medical Image Segmentation",
"doi": null,
"abstractUrl": "/journal/ai/5555/01/10114995/1MQvuVFMn2U",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800d950",
"title": "FocalMix: Semi-Supervised Learning for 3D Medical Image Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800d950/1m3ocavojAc",
"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/cbms/2020/9429/0/942900a558",
"title": "DoubleU-Net: A Deep Convolutional Neural Network for Medical Image Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2020/942900a558/1mLMk7vS2zu",
"parentPublication": {
"id": "proceedings/cbms/2020/9429/0",
"title": "2020 IEEE 33rd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10005169",
"articleId": "1JDoWLk1xaU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10005850",
"articleId": "1JF3RfXmxHO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1KJsBx9E7uM",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "td",
"pubType": "journal",
"volume": "34",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1KkXu1QYDtu",
"doi": "10.1109/TPDS.2023.3240174",
"abstract": "Neural-like P systems are membrane computing models inspired by natural computing and are viewed as third-generation neural network models. Although real neurons have complex structures, classical neural-like P systems simplify the structures and corresponding mechanisms to two-dimensional graphs or tree-based firing and forgetting communications, which limit the real applications of these models. In this paper, we propose a hypergraph-based numerical neural-like (HNN) P system containing five types of neurons to describe the high-order correlations among neuron structures. Three new kinds of communication mechanisms among neurons are also proposed to address numerical variables and functions. Based on the new neural-like P system, a tumor/organ segmentation model for medical images is developed. The experimental results indicate that the proposed models outperform the state-of-the-art methods based on two hippocampal datasets and a multiple brain metastases dataset, thus verifying the effectiveness of the HNN P system in correctly segmenting tumors/organs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Neural-like P systems are membrane computing models inspired by natural computing and are viewed as third-generation neural network models. Although real neurons have complex structures, classical neural-like P systems simplify the structures and corresponding mechanisms to two-dimensional graphs or tree-based firing and forgetting communications, which limit the real applications of these models. In this paper, we propose a hypergraph-based numerical neural-like (HNN) P system containing five types of neurons to describe the high-order correlations among neuron structures. Three new kinds of communication mechanisms among neurons are also proposed to address numerical variables and functions. Based on the new neural-like P system, a tumor/organ segmentation model for medical images is developed. The experimental results indicate that the proposed models outperform the state-of-the-art methods based on two hippocampal datasets and a multiple brain metastases dataset, thus verifying the effectiveness of the HNN P system in correctly segmenting tumors/organs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Neural-like P systems are membrane computing models inspired by natural computing and are viewed as third-generation neural network models. Although real neurons have complex structures, classical neural-like P systems simplify the structures and corresponding mechanisms to two-dimensional graphs or tree-based firing and forgetting communications, which limit the real applications of these models. In this paper, we propose a hypergraph-based numerical neural-like (HNN) P system containing five types of neurons to describe the high-order correlations among neuron structures. Three new kinds of communication mechanisms among neurons are also proposed to address numerical variables and functions. Based on the new neural-like P system, a tumor/organ segmentation model for medical images is developed. The experimental results indicate that the proposed models outperform the state-of-the-art methods based on two hippocampal datasets and a multiple brain metastases dataset, thus verifying the effectiveness of the HNN P system in correctly segmenting tumors/organs.",
"title": "Hypergraph-Based Numerical Neural-Like P Systems for Medical Image Segmentation",
"normalizedTitle": "Hypergraph-Based Numerical Neural-Like P Systems for Medical Image Segmentation",
"fno": "10026615",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Biocomputing",
"Brain",
"Image Segmentation",
"Medical Image Processing",
"Neural Nets",
"Neurophysiology",
"Trees Mathematics",
"Tumours",
"Communication Mechanisms",
"Complex Structures",
"High Order Correlations",
"HNN P System",
"Hypergraph Based Numerical Neural Like P Systems",
"Medical Image Segmentation",
"Membrane Computing Models",
"Natural Computing",
"Neuron Structures",
"Numerical Variables",
"Third Generation Neural Network Models",
"Tree Based Firing",
"Two Dimensional Graphs",
"Neurons",
"Image Segmentation",
"Computational Modeling",
"Medical Diagnostic Imaging",
"Numerical Models",
"Hippocampus",
"Biological Neural Networks",
"Hypergraph",
"Neural Like P Systems",
"Medical Image Segmentation"
],
"authors": [
{
"givenName": "Jie",
"surname": "Xue",
"fullName": "Jie Xue",
"affiliation": "Business School, Shandong Key Laboratory of Medical Physics and Image Processing, Shandong Normal University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liwen",
"surname": "Ren",
"fullName": "Liwen Ren",
"affiliation": "Business School, Shandong Key Laboratory of Medical Physics and Image Processing, Shandong Normal University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bosheng",
"surname": "Song",
"fullName": "Bosheng Song",
"affiliation": "College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yujie",
"surname": "Guo",
"fullName": "Yujie Guo",
"affiliation": "Shandong Cancer Hospital and Institute, Shandong First Medical University and Shandong Academy of Medical Sciences, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jie",
"surname": "Lu",
"fullName": "Jie Lu",
"affiliation": "Shandong Cancer Hospital and Institute, Shandong First Medical University and Shandong Academy of Medical Sciences, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiyu",
"surname": "Liu",
"fullName": "Xiyu Liu",
"affiliation": "Business School, Shandong Key Laboratory of Medical Physics and Image Processing, Shandong Normal University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guanzhong",
"surname": "Gong",
"fullName": "Guanzhong Gong",
"affiliation": "Shandong Cancer Hospital and Institute, Shandong First Medical University and Shandong Academy of Medical Sciences, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dengwang",
"surname": "Li",
"fullName": "Dengwang Li",
"affiliation": "School of Physics and Electronics, Shandong Key Laboratory of Medical Physics and Image Processing, Shandong Institute of Industrial Technology for Health Sciences and Precision Medicine, Shandong Normal University, Jinan, Shandong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1202-1214",
"year": "2023",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/itme/2016/3906/0/3906a355",
"title": "Weighted Spiking Neural P Systems with Structural Plasticity Working in Maximum Spiking Strategy",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2016/3906a355/12OmNAOsMQD",
"parentPublication": {
"id": "proceedings/itme/2016/3906/0",
"title": "2016 8th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bic-ta/2011/4514/0/4514a296",
"title": "Spiking Neural P Systems for Arithmetic Operations",
"doi": null,
"abstractUrl": "/proceedings-article/bic-ta/2011/4514a296/12OmNvRU0sx",
"parentPublication": {
"id": "proceedings/bic-ta/2011/4514/0",
"title": "Bio-Inspired Computing: Theories and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2016/3906/0/3906a209",
"title": "Inhomogeneous Weighted Spiking Neural P Systems with Local Homogeneous",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2016/3906a209/12OmNvqEvKo",
"parentPublication": {
"id": "proceedings/itme/2016/3906/0",
"title": "2016 8th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/devlrn/2005/9226/0/01490939",
"title": "Fear-like response induced by intentional gap between neural and body-environment dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/devlrn/2005/01490939/12OmNx965Em",
"parentPublication": {
"id": "proceedings/devlrn/2005/9226/0",
"title": "International Conference on Development and Learning",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candar/2013/2796/0/06726891",
"title": "Feedback RBF GMDH-Type Neural Network Using Principal Component-Regression Analysis and Its Application to Medical Image Diagnosis of Lung Cancer",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2013/06726891/12OmNxGAKZX",
"parentPublication": {
"id": "proceedings/candar/2013/2796/0",
"title": "2013 First International Symposium on Computing and Networking - Across Practical Development and Theoretical Research (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/t4e/2011/4534/0/06004361",
"title": "An Adaptive e-Learning Environment Using Distributed Spiking Neural P Systems",
"doi": null,
"abstractUrl": "/proceedings-article/t4e/2011/06004361/12OmNyTOsnw",
"parentPublication": {
"id": "proceedings/t4e/2011/4534/0",
"title": "2011 IEEE International Conference on Technology for Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2017/2626/0/262600a026",
"title": "Numerical P Systems (After Ten Years)",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2017/262600a026/17D45Wc1IKQ",
"parentPublication": {
"id": "proceedings/synasc/2017/2626/0",
"title": "2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2023/02/09983514",
"title": "Spiking Neural P Systems With Communication on Request and Mute Rules",
"doi": null,
"abstractUrl": "/journal/td/2023/02/09983514/1J4y4ueBeQU",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300k0589",
"title": "Learning With Unsure Data for Medical Image Diagnosis",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300k0589/1hVlGpW0GEE",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/igsc/2021/7851/0/09651627",
"title": "Approaching the Area of Neuromorphic Computing Circuit and System Design",
"doi": null,
"abstractUrl": "/proceedings-article/igsc/2021/09651627/1zHI0DuAp7a",
"parentPublication": {
"id": "proceedings/igsc/2021/7851/0",
"title": "2021 12th International Green and Sustainable Computing Conference (IGSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10029903",
"articleId": "1Kmz3jRZBSg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10032558",
"articleId": "1KnSuCF1DFK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzQhP71",
"title": "Dec.",
"year": "2017",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "39",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwfZBWA",
"doi": "10.1109/TPAMI.2017.2651818",
"abstract": "Textual data such as tags, sentence descriptions are combined with visual cues to reduce the semantic gap for image retrieval applications in today's Multimodal Image Retrieval (MIR) systems. However, all tags are treated as equally important in these systems, which may result in misalignment between visual and textual modalities during MIR training. This will further lead to degenerated retrieval performance at query time. To address this issue, we investigate the problem of tag importance prediction, where the goal is to automatically predict the tag importance and use it in image retrieval. To achieve this, we first propose a method to measure the relative importance of object and scene tags from image sentence descriptions. Using this as the ground truth, we present a tag importance prediction model to jointly exploit visual, semantic and context cues. The Structural Support Vector Machine (SSVM) formulation is adopted to ensure efficient training of the prediction model. Then, the Canonical Correlation Analysis (CCA) is employed to learn the relation between the image visual feature and tag importance to obtain robust retrieval performance. Experimental results on three real-world datasets show a significant performance improvement of the proposed MIR with Tag Importance Prediction (MIR/TIP) system over other MIR systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Textual data such as tags, sentence descriptions are combined with visual cues to reduce the semantic gap for image retrieval applications in today's Multimodal Image Retrieval (MIR) systems. However, all tags are treated as equally important in these systems, which may result in misalignment between visual and textual modalities during MIR training. This will further lead to degenerated retrieval performance at query time. To address this issue, we investigate the problem of tag importance prediction, where the goal is to automatically predict the tag importance and use it in image retrieval. To achieve this, we first propose a method to measure the relative importance of object and scene tags from image sentence descriptions. Using this as the ground truth, we present a tag importance prediction model to jointly exploit visual, semantic and context cues. The Structural Support Vector Machine (SSVM) formulation is adopted to ensure efficient training of the prediction model. Then, the Canonical Correlation Analysis (CCA) is employed to learn the relation between the image visual feature and tag importance to obtain robust retrieval performance. Experimental results on three real-world datasets show a significant performance improvement of the proposed MIR with Tag Importance Prediction (MIR/TIP) system over other MIR systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Textual data such as tags, sentence descriptions are combined with visual cues to reduce the semantic gap for image retrieval applications in today's Multimodal Image Retrieval (MIR) systems. However, all tags are treated as equally important in these systems, which may result in misalignment between visual and textual modalities during MIR training. This will further lead to degenerated retrieval performance at query time. To address this issue, we investigate the problem of tag importance prediction, where the goal is to automatically predict the tag importance and use it in image retrieval. To achieve this, we first propose a method to measure the relative importance of object and scene tags from image sentence descriptions. Using this as the ground truth, we present a tag importance prediction model to jointly exploit visual, semantic and context cues. The Structural Support Vector Machine (SSVM) formulation is adopted to ensure efficient training of the prediction model. Then, the Canonical Correlation Analysis (CCA) is employed to learn the relation between the image visual feature and tag importance to obtain robust retrieval performance. Experimental results on three real-world datasets show a significant performance improvement of the proposed MIR with Tag Importance Prediction (MIR/TIP) system over other MIR systems.",
"title": "Measuring and Predicting Tag Importance for Image Retrieval",
"normalizedTitle": "Measuring and Predicting Tag Importance for Image Retrieval",
"fno": "07814315",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Visualization",
"Semantics",
"Image Retrieval",
"Predictive Models",
"Visual Databases",
"Training",
"Motorcycles",
"Multimodal Image Retrieval MIR",
"Image Retrieval",
"Semantic Gap",
"Tag Importance",
"Importance Measure",
"Importance Prediction",
"Cross Domain Learning"
],
"authors": [
{
"givenName": "Shangwen",
"surname": "Li",
"fullName": "Shangwen Li",
"affiliation": "Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sanjay",
"surname": "Purushotham",
"fullName": "Sanjay Purushotham",
"affiliation": "Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chen",
"surname": "Chen",
"fullName": "Chen Chen",
"affiliation": "Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuzhuo",
"surname": "Ren",
"fullName": "Yuzhuo Ren",
"affiliation": "Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.-C. Jay",
"surname": "Kuo",
"fullName": "C.-C. Jay Kuo",
"affiliation": "Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2017-12-01 00:00:00",
"pubType": "trans",
"pages": "2423-2436",
"year": "2017",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wism/2010/4224/1/4224a020",
"title": "Solely Tag-Based Music Genre Classification",
"doi": null,
"abstractUrl": "/proceedings-article/wism/2010/4224a020/12OmNCcbE8H",
"parentPublication": {
"id": "proceedings/wism/2010/4224/1",
"title": "Web Information Systems and Mining, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2010/3869/0/03-04-07",
"title": "Tag Clusters as Information Retrieval Interfaces",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2010/03-04-07/12OmNzayNiI",
"parentPublication": {
"id": "proceedings/hicss/2010/3869/0",
"title": "2010 43rd Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2013/0015/0/06607503",
"title": "Tag-aware image classification via Nested Deep Belief nets",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2013/06607503/12OmNzayNv9",
"parentPublication": {
"id": "proceedings/icme/2013/0015/0",
"title": "2013 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2008/2570/0/04607383",
"title": "Tagrank - Measuring tag importance for image annotation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2008/04607383/12OmNzcxZr3",
"parentPublication": {
"id": "proceedings/icme/2008/2570/0",
"title": "2008 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a417",
"title": "Tag Clustering and Refinement on Semantic Unity Graph",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a417/12OmNzsrwfR",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/03/ttp2013030716",
"title": "Tag Completion for Image Retrieval",
"doi": null,
"abstractUrl": "/journal/tp/2013/03/ttp2013030716/13rRUxC0Sx3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08257972",
"title": "Exploiting visual and textual neighborhood information to improve image-tag relevance",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08257972/17D45VTRora",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acctcs/2022/0034/0/003400a494",
"title": "Importance Sampling-Based Missing Tag Identification Protocol for Large-Scale RFID System",
"doi": null,
"abstractUrl": "/proceedings-article/acctcs/2022/003400a494/1F6UuRi47Be",
"parentPublication": {
"id": "proceedings/acctcs/2022/0034/0",
"title": "2022 2nd Asia-Pacific Conference on Communications Technology and Computer Science (ACCTCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2020/8789/0/878900a475",
"title": "desc2tag: A Reinforcement Learning Approach to Mashup Tag Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2020/878900a475/1pttVHYFYxW",
"parentPublication": {
"id": "proceedings/scc/2020/8789/0",
"title": "2020 IEEE International Conference on Services Computing (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/11/09543564",
"title": "TelecomNet: Tag-Based Weakly-Supervised Modally Cooperative Hashing Network for Image Retrieval",
"doi": null,
"abstractUrl": "/journal/tp/2022/11/09543564/1x4UJqM4kIE",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07807338",
"articleId": "13rRUwh80CI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07814339",
"articleId": "13rRUxBa5da",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRZb",
"name": "ttp201712-07814315s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201712-07814315s1.zip",
"extension": "zip",
"size": "11.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx8fieZ",
"title": "April",
"year": "2017",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "39",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuqE",
"doi": "10.1109/TPAMI.2016.2562626",
"abstract": "Low-rank recovery models have shown potential for salient object detection, where a matrix is decomposed into a low-rank matrix representing image background and a sparse matrix identifying salient objects. Two deficiencies, however, still exist. First, previous work typically assumes the elements in the sparse matrix are mutually independent, ignoring the spatial and pattern relations of image regions. Second, when the low-rank and sparse matrices are relatively coherent, e.g., when there are similarities between the salient objects and background or when the background is complicated, it is difficult for previous models to disentangle them. To address these problems, we propose a novel structured matrix decomposition model with two structural regularizations: (1) a tree-structured sparsity-inducing regularization that captures the image structure and enforces patches from the same object to have similar saliency values, and (2) a Laplacian regularization that enlarges the gaps between salient objects and the background in feature space. Furthermore, high-level priors are integrated to guide the matrix decomposition and boost the detection. We evaluate our model for salient object detection on five challenging datasets including single object, multiple objects and complex scene images, and show competitive results as compared with 24 state-of-the-art methods in terms of seven performance metrics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Low-rank recovery models have shown potential for salient object detection, where a matrix is decomposed into a low-rank matrix representing image background and a sparse matrix identifying salient objects. Two deficiencies, however, still exist. First, previous work typically assumes the elements in the sparse matrix are mutually independent, ignoring the spatial and pattern relations of image regions. Second, when the low-rank and sparse matrices are relatively coherent, e.g., when there are similarities between the salient objects and background or when the background is complicated, it is difficult for previous models to disentangle them. To address these problems, we propose a novel structured matrix decomposition model with two structural regularizations: (1) a tree-structured sparsity-inducing regularization that captures the image structure and enforces patches from the same object to have similar saliency values, and (2) a Laplacian regularization that enlarges the gaps between salient objects and the background in feature space. Furthermore, high-level priors are integrated to guide the matrix decomposition and boost the detection. We evaluate our model for salient object detection on five challenging datasets including single object, multiple objects and complex scene images, and show competitive results as compared with 24 state-of-the-art methods in terms of seven performance metrics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Low-rank recovery models have shown potential for salient object detection, where a matrix is decomposed into a low-rank matrix representing image background and a sparse matrix identifying salient objects. Two deficiencies, however, still exist. First, previous work typically assumes the elements in the sparse matrix are mutually independent, ignoring the spatial and pattern relations of image regions. Second, when the low-rank and sparse matrices are relatively coherent, e.g., when there are similarities between the salient objects and background or when the background is complicated, it is difficult for previous models to disentangle them. To address these problems, we propose a novel structured matrix decomposition model with two structural regularizations: (1) a tree-structured sparsity-inducing regularization that captures the image structure and enforces patches from the same object to have similar saliency values, and (2) a Laplacian regularization that enlarges the gaps between salient objects and the background in feature space. Furthermore, high-level priors are integrated to guide the matrix decomposition and boost the detection. We evaluate our model for salient object detection on five challenging datasets including single object, multiple objects and complex scene images, and show competitive results as compared with 24 state-of-the-art methods in terms of seven performance metrics.",
"title": "Salient Object Detection via Structured Matrix Decomposition",
"normalizedTitle": "Salient Object Detection via Structured Matrix Decomposition",
"fno": "07464858",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Feature Extraction",
"Image Representation",
"Matrix Decomposition",
"Object Detection",
"Sparse Matrices",
"Trees Mathematics",
"Salient Object Detection",
"Low Rank Recovery Model",
"Low Rank Matrix",
"Image Background Representation",
"Sparse Matrix",
"Salient Object Identification",
"Salient Object Similarity",
"Structured Matrix Decomposition Model",
"Structural Regularization",
"Tree Structured Sparsity Inducing Regularization",
"Image Structure",
"Saliency Value",
"Laplacian Regularization",
"Feature Space",
"Complex Scene Image",
"Matrix Decomposition",
"Sparse Matrices",
"Object Detection",
"Computational Modeling",
"Image Color Analysis",
"Laplace Equations",
"Image Segmentation",
"Salient Object Detection",
"Matrix Decomposition",
"Low Rank",
"Structured Sparsity",
"Subspace Learning"
],
"authors": [
{
"givenName": "Houwen",
"surname": "Peng",
"fullName": "Houwen Peng",
"affiliation": "CAS Center for Excellence in Brain Science and Intelligence Technology, National Laboratory of Pattern Recognition, Institution of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bing",
"surname": "Li",
"fullName": "Bing Li",
"affiliation": "CAS Center for Excellence in Brain Science and Intelligence Technology, National Laboratory of Pattern Recognition, Institution of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Haibin",
"surname": "Ling",
"fullName": "Haibin Ling",
"affiliation": "Department of Computer and Information Sciences, Temple University, Philadelphia, PA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiming",
"surname": "Hu",
"fullName": "Weiming Hu",
"affiliation": "CAS Center for Excellence in Brain Science and Intelligence Technology, National Laboratory of Pattern Recognition, Institution of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weihua",
"surname": "Xiong",
"fullName": "Weihua Xiong",
"affiliation": "CAS Center for Excellence in Brain Science and Intelligence Technology, National Laboratory of Pattern Recognition, Institution of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen J.",
"surname": "Maybank",
"fullName": "Stephen J. Maybank",
"affiliation": "Department of Computer Science and Information Systems, Birkbeck College, London, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2017-04-01 00:00:00",
"pubType": "trans",
"pages": "818-832",
"year": "2017",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2015/9711/0/5720a930",
"title": "Background Subtraction via Superpixel-Based Online Matrix Decomposition with Structured Foreground Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2015/5720a930/12OmNARRYot",
"parentPublication": {
"id": "proceedings/iccvw/2015/9711/0",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/108O1D04",
"title": "A unified approach to salient object detection via low rank matrix recovery",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/108O1D04/12OmNB7tUto",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2016/4400/0/4400a048",
"title": "Moving Obstacle Removal via Low Rank Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2016/4400a048/12OmNBaT5XO",
"parentPublication": {
"id": "proceedings/icdh/2016/4400/0",
"title": "2016 6th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034b871",
"title": "Background Subtraction via Fast Robust Matrix Completion",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034b871/12OmNBp52Eh",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2017/4822/0/482201a120",
"title": "Salient Object Detection Via Nonconvex Structured Matrix Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2017/482201a120/12OmNCb3fvG",
"parentPublication": {
"id": "proceedings/cis/2017/4822/0",
"title": "2017 13th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457c838",
"title": "Video Desnowing and Deraining Based on Matrix Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457c838/12OmNvonIOv",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispdc/2016/4152/0/07904320",
"title": "An Image-Based Approach to Automatic Crop Organ Extraction via Low-Rank Matrix Recovery",
"doi": null,
"abstractUrl": "/proceedings-article/ispdc/2016/07904320/12OmNxbW4Vl",
"parentPublication": {
"id": "proceedings/ispdc/2016/4152/0",
"title": "2016 15th International Symposium on Parallel and Distributed Computing (ISPDC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvaui/2014/6713/0/6713a065",
"title": "Foreground Extraction of Underwater Videos via Sparse and Low-Rank Matrix Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/cvaui/2014/6713a065/12OmNyGtjsx",
"parentPublication": {
"id": "proceedings/cvaui/2014/6713/0",
"title": "2014 ICPR Workshop on Computer Vision for Analysis of Underwater Imagery (CVAUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460748",
"title": "Foreground detection via robust low rank matrix factorization including spatial constraint with Iterative reweighted regression",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460748/12OmNzXWZM7",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__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": "07463054",
"articleId": "13rRUxASuiV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07870776",
"articleId": "13rRUwI5TYL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgAq",
"name": "ttp201704-07464858s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201704-07464858s1.zip",
"extension": "zip",
"size": "2.36 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAWYKCh",
"title": "Sept.",
"year": "2017",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "39",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYjK3Y",
"doi": "10.1109/TPAMI.2016.2609426",
"abstract": "Most existing bottom-up algorithms measure the foreground saliency of a pixel or region based on its contrast within a local context or the entire image, whereas a few methods focus on segmenting out background regions and thereby salient objects. Instead of only considering the contrast between salient objects and their surrounding regions, we consider both foreground and background cues in this work. We rank the similarity of image elements with foreground or background cues via graph-based manifold ranking. The saliency of image elements is defined based on their relevances to the given seeds or queries. We represent an image as a multi-scale graph with fine superpixels and coarse regions as nodes. These nodes are ranked based on the similarity to background and foreground queries using affinity matrices. Saliency detection is carried out in a cascade scheme to extract background regions and foreground salient objects efficiently. Experimental results demonstrate the proposed method performs well against the state-of-the-art methods in terms of accuracy and speed. We also propose a new benchmark dataset containing 5,168 images for large-scale performance evaluation of saliency detection methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most existing bottom-up algorithms measure the foreground saliency of a pixel or region based on its contrast within a local context or the entire image, whereas a few methods focus on segmenting out background regions and thereby salient objects. Instead of only considering the contrast between salient objects and their surrounding regions, we consider both foreground and background cues in this work. We rank the similarity of image elements with foreground or background cues via graph-based manifold ranking. The saliency of image elements is defined based on their relevances to the given seeds or queries. We represent an image as a multi-scale graph with fine superpixels and coarse regions as nodes. These nodes are ranked based on the similarity to background and foreground queries using affinity matrices. Saliency detection is carried out in a cascade scheme to extract background regions and foreground salient objects efficiently. Experimental results demonstrate the proposed method performs well against the state-of-the-art methods in terms of accuracy and speed. We also propose a new benchmark dataset containing 5,168 images for large-scale performance evaluation of saliency detection methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most existing bottom-up algorithms measure the foreground saliency of a pixel or region based on its contrast within a local context or the entire image, whereas a few methods focus on segmenting out background regions and thereby salient objects. Instead of only considering the contrast between salient objects and their surrounding regions, we consider both foreground and background cues in this work. We rank the similarity of image elements with foreground or background cues via graph-based manifold ranking. The saliency of image elements is defined based on their relevances to the given seeds or queries. We represent an image as a multi-scale graph with fine superpixels and coarse regions as nodes. These nodes are ranked based on the similarity to background and foreground queries using affinity matrices. Saliency detection is carried out in a cascade scheme to extract background regions and foreground salient objects efficiently. Experimental results demonstrate the proposed method performs well against the state-of-the-art methods in terms of accuracy and speed. We also propose a new benchmark dataset containing 5,168 images for large-scale performance evaluation of saliency detection methods.",
"title": "Ranking Saliency",
"normalizedTitle": "Ranking Saliency",
"fno": "07567535",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Manifolds",
"Visualization",
"Labeling",
"Computational Modeling",
"Electronic Mail",
"Image Segmentation",
"Image Color Analysis",
"Saliency Detection",
"Manifold Ranking",
"Multi Scale Graph"
],
"authors": [
{
"givenName": "Lihe",
"surname": "Zhang",
"fullName": "Lihe Zhang",
"affiliation": "School of Information and Communication Engineering, Dalian University of Technology, Dalian, Liaoning, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chuan",
"surname": "Yang",
"fullName": "Chuan Yang",
"affiliation": "Alibaba Group, Beijing, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huchuan",
"surname": "Lu",
"fullName": "Huchuan Lu",
"affiliation": "School of Information and Communication Engineering, Dalian University of Technology, Dalian, Liaoning, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiang",
"surname": "Ruan",
"fullName": "Xiang Ruan",
"affiliation": "IWAKI Co., Ltd., Chiyoda-ku, Tokyo, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ming-Hsuan",
"surname": "Yang",
"fullName": "Ming-Hsuan Yang",
"affiliation": "School of Engineering, University of California, Merced, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2017-09-01 00:00:00",
"pubType": "trans",
"pages": "1892-1904",
"year": "2017",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdh/2014/4284/0/4284a105",
"title": "Object Level Saliency by Submodular Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2014/4284a105/12OmNAMtAPA",
"parentPublication": {
"id": "proceedings/icdh/2014/4284/0",
"title": "2014 5th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2013/4989/0/4989d166",
"title": "Saliency Detection via Graph-Based Manifold Ranking",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989d166/12OmNApLGQq",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c806",
"title": "Saliency Detection on Light Field",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c806/12OmNBPtJHx",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2017/3581/0/3581a738",
"title": "Detecting Video Saliency via Local Motion Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2017/3581a738/12OmNC2fGrj",
"parentPublication": {
"id": "proceedings/aiccsa/2017/3581/0",
"title": "2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460109",
"title": "Salient region detection using local and global saliency",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460109/12OmNs4S8Fj",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/2017/4062/0/08054898",
"title": "Pattern mining based video saliency detection",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/2017/08054898/12OmNxd4tlx",
"parentPublication": {
"id": "proceedings/iscv/2017/4062/0",
"title": "2017 Intelligent Systems and Computer Vision (ISCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2015/6964/0/07298961",
"title": "Saliency-aware geodesic video object segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2015/07298961/12OmNzIl3t8",
"parentPublication": {
"id": "proceedings/cvpr/2015/6964/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2014/4717/0/06890552",
"title": "Feature selection based saliency object detection",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2014/06890552/12OmNzxgHG3",
"parentPublication": {
"id": "proceedings/icmew/2014/4717/0",
"title": "2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/08/07570181",
"title": "Saliency Detection on Light Field",
"doi": null,
"abstractUrl": "/journal/tp/2017/08/07570181/13rRUxC0SFi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0/09047464",
"title": "Saliency Detection Based on Weighted Saliency Probability",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2019/09047464/1iC6yUqkTja",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2019/4328/0",
"title": "2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07577857",
"articleId": "13rRUxYIMWv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08000767",
"articleId": "13rRUxly8YK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyr8Ysh",
"title": "May",
"year": "2016",
"issueNum": "05",
"idPrefix": "ts",
"pubType": "journal",
"volume": "42",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNmPFK",
"doi": "10.1109/TSE.2015.2494588",
"abstract": "Context. Requirements elicitation is a highly communicative activity in which human interactions play a critical role. A number of analyst characteristics or skills may influence elicitation process effectiveness. Aim. Study the influence of analyst problem domain knowledge on elicitation effectiveness. Method. We executed a controlled experiment with post-graduate students. The experimental task was to elicit requirements using open interview and consolidate the elicited information immediately afterwards. We used four different problem domains about which students had different levels of knowledge. Two tasks were used in the experiment, whereas the other two were used in an internal replication of the experiment; that is, we repeated the experiment with the same subjects but with different domains. Results. Analyst problem domain knowledge has a small but statistically significant effect on the effectiveness of the requirements elicitation activity. The interviewee has a big positive and significant influence, as does general training in requirements activities and interview experience. Conclusion. During early contacts with the customer, a key factor is the interviewee; however, training in tasks related to requirements elicitation and knowledge of the problem domain helps requirements analysts to be more effective.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Context. Requirements elicitation is a highly communicative activity in which human interactions play a critical role. A number of analyst characteristics or skills may influence elicitation process effectiveness. Aim. Study the influence of analyst problem domain knowledge on elicitation effectiveness. Method. We executed a controlled experiment with post-graduate students. The experimental task was to elicit requirements using open interview and consolidate the elicited information immediately afterwards. We used four different problem domains about which students had different levels of knowledge. Two tasks were used in the experiment, whereas the other two were used in an internal replication of the experiment; that is, we repeated the experiment with the same subjects but with different domains. Results. Analyst problem domain knowledge has a small but statistically significant effect on the effectiveness of the requirements elicitation activity. The interviewee has a big positive and significant influence, as does general training in requirements activities and interview experience. Conclusion. During early contacts with the customer, a key factor is the interviewee; however, training in tasks related to requirements elicitation and knowledge of the problem domain helps requirements analysts to be more effective.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Context. Requirements elicitation is a highly communicative activity in which human interactions play a critical role. A number of analyst characteristics or skills may influence elicitation process effectiveness. Aim. Study the influence of analyst problem domain knowledge on elicitation effectiveness. Method. We executed a controlled experiment with post-graduate students. The experimental task was to elicit requirements using open interview and consolidate the elicited information immediately afterwards. We used four different problem domains about which students had different levels of knowledge. Two tasks were used in the experiment, whereas the other two were used in an internal replication of the experiment; that is, we repeated the experiment with the same subjects but with different domains. Results. Analyst problem domain knowledge has a small but statistically significant effect on the effectiveness of the requirements elicitation activity. The interviewee has a big positive and significant influence, as does general training in requirements activities and interview experience. Conclusion. During early contacts with the customer, a key factor is the interviewee; however, training in tasks related to requirements elicitation and knowledge of the problem domain helps requirements analysts to be more effective.",
"title": "Effect of Domain Knowledge on Elicitation Effectiveness: An Internally Replicated Controlled Experiment",
"normalizedTitle": "Effect of Domain Knowledge on Elicitation Effectiveness: An Internally Replicated Controlled Experiment",
"fno": "07307191",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Interviews",
"Knowledge Engineering",
"Computer Science",
"Software Engineering",
"Requirements Engineering",
"Training",
"Internal Replication",
"Controlled Experiment",
"Domain Knowledge",
"Requirements Elicitation",
"Internal Replication",
"Controlled Experiment",
"Domain Knowledge",
"Requirements Elicitation"
],
"authors": [
{
"givenName": "Alejandrina M.",
"surname": "Aranda",
"fullName": "Alejandrina M. Aranda",
"affiliation": ", Escuela Técnica Superior de Ingenieros Informáticos, Universidad Politécnica de Madrid, Campus de Montegancedo, Boadilla del Monte, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oscar",
"surname": "Dieste",
"fullName": "Oscar Dieste",
"affiliation": ", Escuela Técnica Superior de Ingenieros Informáticos, Universidad Politécnica de Madrid, Campus de Montegancedo, Boadilla del Monte, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Natalia",
"surname": "Juristo",
"fullName": "Natalia Juristo",
"affiliation": ", Escuela Técnica Superior de Ingenieros Informáticos, Universidad Politécnica de Madrid, Campus de Montegancedo, Boadilla del Monte, Spain",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2016-05-01 00:00:00",
"pubType": "trans",
"pages": "427-451",
"year": "2016",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/aswec/2008/3100/0/3100a543",
"title": "Requirements Elicitation Using Goal-Based Organizational Model",
"doi": null,
"abstractUrl": "/proceedings-article/aswec/2008/3100a543/12OmNBhpS6q",
"parentPublication": {
"id": "proceedings/aswec/2008/3100/0",
"title": "2008 19th Australian Software Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2010/4266/0/4266a003",
"title": "Enhancing Domain Knowledge for Requirements Elicitation with Web Mining",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2010/4266a003/12OmNqG0T0x",
"parentPublication": {
"id": "proceedings/apsec/2010/4266/0",
"title": "2010 Asia Pacific Software Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2003/2011/0/20110017",
"title": "PAORE: Package Oriented Requirements Elicitation",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2003/20110017/12OmNqMPfSt",
"parentPublication": {
"id": "proceedings/apsec/2003/2011/0",
"title": "Tenth Asia-Pacific Software Engineering Conference, 2003.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2002/1435/8/14350255",
"title": "Discourse Analysis of Requirements and Knowledge Elicitation Interviews",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2002/14350255/12OmNxI0KzK",
"parentPublication": {
"id": "proceedings/hicss/2002/1435/8",
"title": "Proceedings of the 35th Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2016/4121/0/4121a056",
"title": "Ambiguity Cues in Requirements Elicitation Interviews",
"doi": null,
"abstractUrl": "/proceedings-article/re/2016/4121a056/12OmNxX3usB",
"parentPublication": {
"id": "proceedings/re/2016/4121/0",
"title": "2016 IEEE 24th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seaa/2017/2141/0/2141a141",
"title": "Requirements Elicitation Techniques Applied in Software Startups",
"doi": null,
"abstractUrl": "/proceedings-article/seaa/2017/2141a141/12OmNyuy9K5",
"parentPublication": {
"id": "proceedings/seaa/2017/2141/0",
"title": "2017 43rd Euromicro Conference on Software Engineering and Advanced Applications (SEAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2018/7418/0/741800a182",
"title": "Learning from Mistakes: An Empirical Study of Elicitation Interviews Performed by Novices",
"doi": null,
"abstractUrl": "/proceedings-article/re/2018/741800a182/17D45WIXbO7",
"parentPublication": {
"id": "proceedings/re/2018/7418/0",
"title": "2018 IEEE 26th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/d4re/2018/8418/0/841800a026",
"title": "Improving Requirements Elicitation Through Listening Research",
"doi": null,
"abstractUrl": "/proceedings-article/d4re/2018/841800a026/17D45XvMcaH",
"parentPublication": {
"id": "proceedings/d4re/2018/8418/0",
"title": "2018 1st International Workshop on Learning from other Disciplines for Requirements Engineering (D4RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2020/7438/0/09218218",
"title": "Reducing Ambiguity in Requirements Elicitation via Gamification",
"doi": null,
"abstractUrl": "/proceedings-article/re/2020/09218218/1nMQur0eGf6",
"parentPublication": {
"id": "proceedings/re/2020/7438/0",
"title": "2020 IEEE 28th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2021/2856/0/285600a233",
"title": "From Ideas to Expressed Needs: an Empirical Study on the Evolution of Requirements during Elicitation",
"doi": null,
"abstractUrl": "/proceedings-article/re/2021/285600a233/1yDjMBFVSz6",
"parentPublication": {
"id": "proceedings/re/2021/2856/0",
"title": "2021 IEEE 29th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07296670",
"articleId": "13rRUILtJhV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07299696",
"articleId": "13rRUx0xPoM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRMw",
"name": "tts201605-07307191s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/tts201605-07307191s1.zip",
"extension": "zip",
"size": "699 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xic9a4I0pi",
"doi": "10.1109/TVCG.2021.3114829",
"abstract": "For all its potential in supporting data analysis, particularly in exploratory situations, visualization also creates barriers: accessibility for blind and visually impaired individuals. Regardless of how effective a visualization is, providing equal access for blind users requires a paradigm shift for the visualization research community. To enact such a shift, it is not sufficient to treat visualization accessibility as merely another technical problem to overcome. Instead, supporting the millions of blind and visually impaired users around the world who have equally valid needs for data analysis as sighted individuals requires a respectful, equitable, and holistic approach that includes all users from the onset. In this paper, we draw on accessibility research methodologies to make inroads towards such an approach. We first identify the people who have specific insight into how blind people perceive the world: orientation and mobility (O&M) experts, who are instructors that teach blind individuals how to navigate the physical world using non-visual senses. We interview 10 O&M experts—all of them blind—to understand how best to use sensory substitution other than the visual sense for conveying spatial layouts. Finally, we investigate our qualitative findings using thematic analysis. While blind people in general tend to use both sound and touch to understand their surroundings, we focused on auditory affordances and how they can be used to make data visualizations accessible—using sonification and auralization. However, our experts recommended supporting a combination of senses—sound and touch—to make charts accessible as blind individuals may be more familiar with exploring tactile charts. We report results on both sound and touch affordances, and conclude by discussing implications for accessible visualization for blind individuals.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For all its potential in supporting data analysis, particularly in exploratory situations, visualization also creates barriers: accessibility for blind and visually impaired individuals. Regardless of how effective a visualization is, providing equal access for blind users requires a paradigm shift for the visualization research community. To enact such a shift, it is not sufficient to treat visualization accessibility as merely another technical problem to overcome. Instead, supporting the millions of blind and visually impaired users around the world who have equally valid needs for data analysis as sighted individuals requires a respectful, equitable, and holistic approach that includes all users from the onset. In this paper, we draw on accessibility research methodologies to make inroads towards such an approach. We first identify the people who have specific insight into how blind people perceive the world: orientation and mobility (O&M) experts, who are instructors that teach blind individuals how to navigate the physical world using non-visual senses. We interview 10 O&M experts—all of them blind—to understand how best to use sensory substitution other than the visual sense for conveying spatial layouts. Finally, we investigate our qualitative findings using thematic analysis. While blind people in general tend to use both sound and touch to understand their surroundings, we focused on auditory affordances and how they can be used to make data visualizations accessible—using sonification and auralization. However, our experts recommended supporting a combination of senses—sound and touch—to make charts accessible as blind individuals may be more familiar with exploring tactile charts. We report results on both sound and touch affordances, and conclude by discussing implications for accessible visualization for blind individuals.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For all its potential in supporting data analysis, particularly in exploratory situations, visualization also creates barriers: accessibility for blind and visually impaired individuals. Regardless of how effective a visualization is, providing equal access for blind users requires a paradigm shift for the visualization research community. To enact such a shift, it is not sufficient to treat visualization accessibility as merely another technical problem to overcome. Instead, supporting the millions of blind and visually impaired users around the world who have equally valid needs for data analysis as sighted individuals requires a respectful, equitable, and holistic approach that includes all users from the onset. In this paper, we draw on accessibility research methodologies to make inroads towards such an approach. We first identify the people who have specific insight into how blind people perceive the world: orientation and mobility (O&M) experts, who are instructors that teach blind individuals how to navigate the physical world using non-visual senses. We interview 10 O&M experts—all of them blind—to understand how best to use sensory substitution other than the visual sense for conveying spatial layouts. Finally, we investigate our qualitative findings using thematic analysis. While blind people in general tend to use both sound and touch to understand their surroundings, we focused on auditory affordances and how they can be used to make data visualizations accessible—using sonification and auralization. However, our experts recommended supporting a combination of senses—sound and touch—to make charts accessible as blind individuals may be more familiar with exploring tactile charts. We report results on both sound and touch affordances, and conclude by discussing implications for accessible visualization for blind individuals.",
"title": "Towards Understanding Sensory Substitution for Accessible Visualization: An Interview Study",
"normalizedTitle": "Towards Understanding Sensory Substitution for Accessible Visualization: An Interview Study",
"fno": "09552177",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Visualization",
"Interviews",
"Blindness",
"Training",
"Navigation",
"Layout",
"Accessibility",
"Blind Users",
"Sonification",
"Visualization",
"Spatial Layouts",
"Sound Perception"
],
"authors": [
{
"givenName": "Pramod",
"surname": "Chundury",
"fullName": "Pramod Chundury",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Biswaksen",
"surname": "Patnaik",
"fullName": "Biswaksen Patnaik",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yasmin",
"surname": "Reyazuddin",
"fullName": "Yasmin Reyazuddin",
"affiliation": "National Federation of the Blind, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christine",
"surname": "Tang",
"fullName": "Christine Tang",
"affiliation": "Poolesville High School, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonathan",
"surname": "Lazar",
"fullName": "Jonathan Lazar",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "1084-1094",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2015/1727/0/07223381",
"title": "Blind in a virtual world: Using sensory substitution for generically increasing the accessibility of graphical virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223381/12OmNrYCXZP",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2015/7334/0/7334a413",
"title": "Alternative Concepts for Accessible Virtual Classrooms for Blind Users",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2015/7334a413/12OmNwM6A3H",
"parentPublication": {
"id": "proceedings/icalt/2015/7334/0",
"title": "2015 IEEE 15th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vaat/2015/6518/0/07155404",
"title": "Non-visual virtual interaction: Can Sensory Substitution generically increase the accessibility of Graphical virtual reality to the blind?",
"doi": null,
"abstractUrl": "/proceedings-article/vaat/2015/07155404/12OmNywfKGA",
"parentPublication": {
"id": "proceedings/vaat/2015/6518/0",
"title": "2015 3rd IEEE VR International Workshop on Virtual and Augmented Assistive Technology (VAAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2018/08/07987041",
"title": "A Comparison of Program Comprehension Strategies by Blind and Sighted Programmers",
"doi": null,
"abstractUrl": "/journal/ts/2018/08/07987041/13rRUxjQyqR",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2018/6614/0/661400b195",
"title": "A Deep Learning Approach to Sensory Navigation Device for Blind Guidance",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2018/661400b195/183rAdzdE7f",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2018/6614/0",
"title": "2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903291",
"title": "Understanding Barriers to Network Exploration with Visualization: A Report from the Trenches",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903291/1GZojtBEfvi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a160",
"title": "Beyond Visuals: Examining the Experiences of Geoscience Professionals With Vision Disabilities in Accessing Data Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a160/1J6hbizj1Xq",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933762",
"title": "Sociotechnical Considerations for Accessible Visualization Design",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933762/1fTgGk6sRfa",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090478",
"title": "Blindness Visualizer: A Simulated Navigation Experience",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090478/1jIxmUZm4Za",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciddt/2020/0367/0/036700a410",
"title": "Tactile Navigation system For People with visual impairments In museum",
"doi": null,
"abstractUrl": "/proceedings-article/iciddt/2020/036700a410/1wutC9E2AJW",
"parentPublication": {
"id": "proceedings/iciddt/2020/0367/0",
"title": "2020 International Conference on Innovation Design and Digital Technology (ICIDDT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09555469",
"articleId": "1xjQSGhQDvO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552938",
"articleId": "1xjQYJDwaxa",
"__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": "13rRUwbs1Sw",
"doi": "10.1109/TVCG.2014.2346250",
"abstract": "We introduce a new direct manipulation technique, DimpVis, for interacting with visual items in information visualizations to enable exploration of the time dimension. DimpVis is guided by visual hint paths which indicate how a selected data item changes through the time dimension in a visualization. Temporal navigation is controlled by manipulating any data item along its hint path. All other items are updated to reflect the new time. We demonstrate how the DimpVis technique can be designed to directly manipulate position, colour, and size in familiar visualizations such as bar charts and scatter plots, as a means for temporal navigation. We present results from a comparative evaluation, showing that the DimpVis technique was subjectively preferred and quantitatively competitive with the traditional time slider, and significantly faster than small multiples for a variety of tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce a new direct manipulation technique, DimpVis, for interacting with visual items in information visualizations to enable exploration of the time dimension. DimpVis is guided by visual hint paths which indicate how a selected data item changes through the time dimension in a visualization. Temporal navigation is controlled by manipulating any data item along its hint path. All other items are updated to reflect the new time. We demonstrate how the DimpVis technique can be designed to directly manipulate position, colour, and size in familiar visualizations such as bar charts and scatter plots, as a means for temporal navigation. We present results from a comparative evaluation, showing that the DimpVis technique was subjectively preferred and quantitatively competitive with the traditional time slider, and significantly faster than small multiples for a variety of tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce a new direct manipulation technique, DimpVis, for interacting with visual items in information visualizations to enable exploration of the time dimension. DimpVis is guided by visual hint paths which indicate how a selected data item changes through the time dimension in a visualization. Temporal navigation is controlled by manipulating any data item along its hint path. All other items are updated to reflect the new time. We demonstrate how the DimpVis technique can be designed to directly manipulate position, colour, and size in familiar visualizations such as bar charts and scatter plots, as a means for temporal navigation. We present results from a comparative evaluation, showing that the DimpVis technique was subjectively preferred and quantitatively competitive with the traditional time slider, and significantly faster than small multiples for a variety of tasks.",
"title": "DimpVis: Exploring Time-varying Information Visualizations by Direct Manipulation",
"normalizedTitle": "DimpVis: Exploring Time-varying Information Visualizations by Direct Manipulation",
"fno": "06875985",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Time Varying Systems",
"Data Visualization",
"Image Color Analysis",
"Trajectory",
"Market Research",
"Motion Segmentation",
"Information Visualization",
"Time Navigation",
"Direct Manipulation"
],
"authors": [
{
"givenName": "Brittany",
"surname": "Kondo",
"fullName": "Brittany Kondo",
"affiliation": ", University of Ontario Institute of Technology",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christopher",
"surname": "Collins",
"fullName": "Christopher Collins",
"affiliation": ", University of Ontario Institute of Technology",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2003-2012",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031600",
"title": "Exploring controversy via sentiment divergences of aspects in reviews",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031600/12OmNAo45Rt",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2009/3965/0/04811199",
"title": "A direct manipulation interface for time navigation in scientific visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2009/04811199/12OmNqBtiXu",
"parentPublication": {
"id": "proceedings/3dui/2009/3965/0",
"title": "2009 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/auic/2000/0515/0/05150058",
"title": "Exploring Visualizations through Subspace Composition",
"doi": null,
"abstractUrl": "/proceedings-article/auic/2000/05150058/12OmNx5piRD",
"parentPublication": {
"id": "proceedings/auic/2000/0515/0",
"title": "Australasian User Interface Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbi/2018/7016/1/701601a070",
"title": "Exploring Users' Perception of Collaborative Explanation Styles",
"doi": null,
"abstractUrl": "/proceedings-article/cbi/2018/701601a070/13l5NWR8tNx",
"parentPublication": {
"id": "cbi/2018/7016/1",
"title": "2018 IEEE 20th Conference on Business Informatics (CBI)",
"__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/2016/12/07369992",
"title": "ThermalPlot: Visualizing Multi-Attribute Time-Series Data Using a Thermal Metaphor",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07369992/13rRUygT7yg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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": "proceedings/vis/2022/8812/0/881200a085",
"title": "Let's Get Personal: Exploring the Design of Personalized Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a085/1J6hbZrS4dG",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006014",
"title": "Time-varying Item Feature Conditional Variational Autoencoder for Collaborative Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006014/1hJrN6lZTbi",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400c653",
"title": "SubDEx: Exploring Ratings in Subjective Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400c653/1uGXR8bzgXu",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06876026",
"articleId": "13rRUNvya9l",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06875998",
"articleId": "13rRUwghd50",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCbCrUN",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwd9CLM",
"doi": "10.1109/TVCG.2013.173",
"abstract": "Rankings are a popular and universal approach to structuring otherwise unorganized collections of items by computing a rank for each item based on the value of one or more of its attributes. This allows us, for example, to prioritize tasks or to evaluate the performance of products relative to each other. While the visualization of a ranking itself is straightforward, its interpretation is not, because the rank of an item represents only a summary of a potentially complicated relationship between its attributes and those of the other items. It is also common that alternative rankings exist which need to be compared and analyzed to gain insight into how multiple heterogeneous attributes affect the rankings. Advanced visual exploration tools are needed to make this process efficient. In this paper we present a comprehensive analysis of requirements for the visualization of multi-attribute rankings. Based on these considerations, we propose LineUp - a novel and scalable visualization technique that uses bar charts. This interactive technique supports the ranking of items based on multiple heterogeneous attributes with different scales and semantics. It enables users to interactively combine attributes and flexibly refine parameters to explore the effect of changes in the attribute combination. This process can be employed to derive actionable insights as to which attributes of an item need to be modified in order for its rank to change. Additionally, through integration of slope graphs, LineUp can also be used to compare multiple alternative rankings on the same set of items, for example, over time or across different attribute combinations. We evaluate the effectiveness of the proposed multi-attribute visualization technique in a qualitative study. The study shows that users are able to successfully solve complex ranking tasks in a short period of time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rankings are a popular and universal approach to structuring otherwise unorganized collections of items by computing a rank for each item based on the value of one or more of its attributes. This allows us, for example, to prioritize tasks or to evaluate the performance of products relative to each other. While the visualization of a ranking itself is straightforward, its interpretation is not, because the rank of an item represents only a summary of a potentially complicated relationship between its attributes and those of the other items. It is also common that alternative rankings exist which need to be compared and analyzed to gain insight into how multiple heterogeneous attributes affect the rankings. Advanced visual exploration tools are needed to make this process efficient. In this paper we present a comprehensive analysis of requirements for the visualization of multi-attribute rankings. Based on these considerations, we propose LineUp - a novel and scalable visualization technique that uses bar charts. This interactive technique supports the ranking of items based on multiple heterogeneous attributes with different scales and semantics. It enables users to interactively combine attributes and flexibly refine parameters to explore the effect of changes in the attribute combination. This process can be employed to derive actionable insights as to which attributes of an item need to be modified in order for its rank to change. Additionally, through integration of slope graphs, LineUp can also be used to compare multiple alternative rankings on the same set of items, for example, over time or across different attribute combinations. We evaluate the effectiveness of the proposed multi-attribute visualization technique in a qualitative study. The study shows that users are able to successfully solve complex ranking tasks in a short period of time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rankings are a popular and universal approach to structuring otherwise unorganized collections of items by computing a rank for each item based on the value of one or more of its attributes. This allows us, for example, to prioritize tasks or to evaluate the performance of products relative to each other. While the visualization of a ranking itself is straightforward, its interpretation is not, because the rank of an item represents only a summary of a potentially complicated relationship between its attributes and those of the other items. It is also common that alternative rankings exist which need to be compared and analyzed to gain insight into how multiple heterogeneous attributes affect the rankings. Advanced visual exploration tools are needed to make this process efficient. In this paper we present a comprehensive analysis of requirements for the visualization of multi-attribute rankings. Based on these considerations, we propose LineUp - a novel and scalable visualization technique that uses bar charts. This interactive technique supports the ranking of items based on multiple heterogeneous attributes with different scales and semantics. It enables users to interactively combine attributes and flexibly refine parameters to explore the effect of changes in the attribute combination. This process can be employed to derive actionable insights as to which attributes of an item need to be modified in order for its rank to change. Additionally, through integration of slope graphs, LineUp can also be used to compare multiple alternative rankings on the same set of items, for example, over time or across different attribute combinations. We evaluate the effectiveness of the proposed multi-attribute visualization technique in a qualitative study. The study shows that users are able to successfully solve complex ranking tasks in a short period of time.",
"title": "LineUp: Visual Analysis of Multi-Attribute Rankings",
"normalizedTitle": "LineUp: Visual Analysis of Multi-Attribute Rankings",
"fno": "ttg2013122277",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rankings",
"Data Visualization",
"Encoding",
"Histograms",
"Scalability",
"Multi Faceted",
"Rankings",
"Data Visualization",
"Encoding",
"Histograms",
"Scalability",
"Stacked Bar Charts",
"Ranking Visualization",
"Ranking",
"Scoring",
"Multi Attribute",
"Multifactorial"
],
"authors": [
{
"givenName": "Samuel",
"surname": "Gratzl",
"fullName": "Samuel Gratzl",
"affiliation": "Johannes Kepler Univ. Linz, Linz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexander",
"surname": "Lex",
"fullName": "Alexander Lex",
"affiliation": "Johannes Kepler Univ. Linz, Linz, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nils",
"surname": "Gehlenborg",
"fullName": "Nils Gehlenborg",
"affiliation": "Harvard Univ., Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "Harvard Univ., Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Streit",
"fullName": "Marc Streit",
"affiliation": "Med. Sch., Harvard Univ., Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2277-2286",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmla/2009/3926/0/3926a154",
"title": "Discovering Characterization Rules from Rankings",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2009/3926a154/12OmNwE9Ou0",
"parentPublication": {
"id": "proceedings/icmla/2009/3926/0",
"title": "Machine Learning and Applications, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icss/2016/2727/0/2727a165",
"title": "A Recommendation System Based on Multi-attribute",
"doi": null,
"abstractUrl": "/proceedings-article/icss/2016/2727a165/12OmNxHryiQ",
"parentPublication": {
"id": "proceedings/icss/2016/2727/0",
"title": "2016 9th International Conference on Service Science (ICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2018/4886/0/488601b671",
"title": "Efficient Multi-attribute Similarity Learning Towards Attribute-Based Fashion Search",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2018/488601b671/12OmNyRg4fV",
"parentPublication": {
"id": "proceedings/wacv/2018/4886/0",
"title": "2018 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icgec/2010/4281/0/4281a055",
"title": "Application of Multi-Attribute Rating Matrix in Cold-start Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icgec/2010/4281a055/12OmNzYwc02",
"parentPublication": {
"id": "proceedings/icgec/2010/4281/0",
"title": "Genetic and Evolutionary Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/12/07369992",
"title": "ThermalPlot: Visualizing Multi-Attribute Time-Series Data Using a Thermal Metaphor",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07369992/13rRUygT7yg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122496",
"title": "Radial Sets: Interactive Visual Analysis of Large Overlapping Sets",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122496/13rRUytF41A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2022/8812/0/881200a065",
"title": "FairFuse: Interactive Visual Support for Fair Consensus Ranking",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2022/881200a065/1J6haP1jUt2",
"parentPublication": {
"id": "proceedings/vis/2022/8812/0",
"title": "2022 IEEE Visualization and Visual Analytics (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600a848",
"title": "Leveraging Off-the-shelf Diffusion Model for Multi-attribute Fashion Image Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600a848/1L6LCFHWC6Q",
"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/2017/11/07776926",
"title": "Submodular Attribute Selection for Visual Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2017/11/07776926/1oCiZJsBsT6",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/09288641",
"title": "Imma Sort by Two or More Attributes With Interpretable Monotonic Multi-Attribute Sorting",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/09288641/1pq6982P34Q",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122267",
"articleId": "13rRUILtJzA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122287",
"articleId": "13rRUwInv4o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgNX",
"name": "ttg2013122277s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122277s.mp4",
"extension": "mp4",
"size": "42.1 MB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTXFgNY",
"name": "ttg2013122277s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122277s.zip",
"extension": "zip",
"size": "887 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1H2l6ksKN5S",
"doi": "10.1109/TVCG.2022.3209400",
"abstract": "Stylized tubes are an established visualization primitive for line data as encountered in many scientific fields, ranging from characteristic lines in flow fields, fiber tracks reconstructed from diffusion tensor imaging, to trajectories of moving objects as they arise from cyber-physical systems in many engineering disciplines. Typical challenges include large data set sizes demanding for efficient rendering techniques as well as a large number of attributes that cannot be mapped simultaneously to the basic visual attributes provided by a tube-based visualization. In this work, we tackle both challenges with a new on-tube visualization approach. We improve recent work on high-quality GPU ray casting of Hermite spline tubes supporting ambient occlusion and extend it by a new layered procedural texturing technique. In the proposed framework, a large number of data set attributes can be mapped simultaneously to a variety of glyphs and plots that are embedded in texture space and organized in layers. Efficient rendering with minimal data transfer is achieved by generating the glyphs procedurally and drawing them in a deferred shading pass. We integrated these techniques in a prototype visualization tool that facilitates flexible mapping of data set attributes to visual tube and glyph attributes. We studied our approach on a variety of example data from different fields and found it to provide a highly adaptable and extensible toolbox to quickly craft tailor-made tube-based trajectory visualizations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Stylized tubes are an established visualization primitive for line data as encountered in many scientific fields, ranging from characteristic lines in flow fields, fiber tracks reconstructed from diffusion tensor imaging, to trajectories of moving objects as they arise from cyber-physical systems in many engineering disciplines. Typical challenges include large data set sizes demanding for efficient rendering techniques as well as a large number of attributes that cannot be mapped simultaneously to the basic visual attributes provided by a tube-based visualization. In this work, we tackle both challenges with a new on-tube visualization approach. We improve recent work on high-quality GPU ray casting of Hermite spline tubes supporting ambient occlusion and extend it by a new layered procedural texturing technique. In the proposed framework, a large number of data set attributes can be mapped simultaneously to a variety of glyphs and plots that are embedded in texture space and organized in layers. Efficient rendering with minimal data transfer is achieved by generating the glyphs procedurally and drawing them in a deferred shading pass. We integrated these techniques in a prototype visualization tool that facilitates flexible mapping of data set attributes to visual tube and glyph attributes. We studied our approach on a variety of example data from different fields and found it to provide a highly adaptable and extensible toolbox to quickly craft tailor-made tube-based trajectory visualizations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Stylized tubes are an established visualization primitive for line data as encountered in many scientific fields, ranging from characteristic lines in flow fields, fiber tracks reconstructed from diffusion tensor imaging, to trajectories of moving objects as they arise from cyber-physical systems in many engineering disciplines. Typical challenges include large data set sizes demanding for efficient rendering techniques as well as a large number of attributes that cannot be mapped simultaneously to the basic visual attributes provided by a tube-based visualization. In this work, we tackle both challenges with a new on-tube visualization approach. We improve recent work on high-quality GPU ray casting of Hermite spline tubes supporting ambient occlusion and extend it by a new layered procedural texturing technique. In the proposed framework, a large number of data set attributes can be mapped simultaneously to a variety of glyphs and plots that are embedded in texture space and organized in layers. Efficient rendering with minimal data transfer is achieved by generating the glyphs procedurally and drawing them in a deferred shading pass. We integrated these techniques in a prototype visualization tool that facilitates flexible mapping of data set attributes to visual tube and glyph attributes. We studied our approach on a variety of example data from different fields and found it to provide a highly adaptable and extensible toolbox to quickly craft tailor-made tube-based trajectory visualizations.",
"title": "On-Tube Attribute Visualization for Multivariate Trajectory Data",
"normalizedTitle": "On-Tube Attribute Visualization for Multivariate Trajectory Data",
"fno": "09905624",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biomedical MRI",
"Data Visualisation",
"Image Texture",
"Rendering Computer Graphics",
"Splines Mathematics",
"Basic Visual Attributes",
"Characteristic Lines",
"Cyber Physical Systems",
"Data Set Attributes",
"Diffusion Tensor Imaging",
"Efficient Rendering Techniques",
"Established Visualization Primitive",
"Example Data",
"Facilitates Flexible Mapping",
"Fiber Tracks",
"Flow Fields",
"Glyph Attributes",
"Glyphs",
"Hermite Spline Tubes",
"Layered Procedural Texturing Technique",
"Line Data",
"Minimal Data Transfer",
"Multivariate Trajectory Data",
"On Tube Visualization Approach",
"Prototype Visualization Tool",
"Stylized Tubes",
"Tube Attribute Visualization",
"Tube Based Visualization",
"Typical Challenges",
"Visual Tube",
"Data Visualization",
"Trajectory",
"Electron Tubes",
"Visualization",
"Image Color Analysis",
"Rendering Computer Graphics",
"Geometry",
"Visualization",
"Rendering",
"Line Data",
"Trajectories",
"Multivariate Data"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Russig",
"fullName": "Benjamin Russig",
"affiliation": "Chair of Computer Graphics and Visualization, TU Dresden, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Groß",
"fullName": "David Groß",
"affiliation": "Chair of Computer Graphics and Visualization, TU Dresden, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Raimund",
"surname": "Dachselt",
"fullName": "Raimund Dachselt",
"affiliation": "Interactive Media Lab, TU Dresden, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Gumhold",
"fullName": "Stefan Gumhold",
"affiliation": "Chair of Computer Graphics and Visualization, TU Dresden, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1288-1298",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2015/8391/0/8391b653",
"title": "Unsupervised Tube Extraction Using Transductive Learning and Dense Trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391b653/12OmNB6UIbH",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2014/4261/0/4261a768",
"title": "Research in Axis Compression Stability of Type-D Composite Tube",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a768/12OmNqJHFHJ",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev-iscmht/2017/1023/0/08338604",
"title": "On ultrasound measurement system estimating diameters of fallopian tube models",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-iscmht/2017/08338604/12OmNyQ7G2o",
"parentPublication": {
"id": "proceedings/iciev-iscmht/2017/1023/0",
"title": "2017 6th International Conference on Informatics, Electronics and Vision & 2017 7th International Symposium in Computational Medical and Health Technology (ICIEV-ISCMHT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2011/289/1/05750643",
"title": "Modeling and Simulation of Tube Bright Heat Treatment Furnace",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2011/05750643/12OmNzw8j2i",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2010/4080/1/05571103",
"title": "The Thermo-Performance Study of Automobile Tube-core-fin Radiator",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2010/05571103/13bd1gzWkPS",
"parentPublication": {
"id": "proceedings/icie/2010/4080/1",
"title": "Information Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060913",
"title": "Ambient Occlusion Effects for Combined Volumes and Tubular Geometry",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060913/13rRUy0HYRp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedme/2020/8145/0/09122218",
"title": "Cracking Failure Analysis on Waste Heat Boiler Tube",
"doi": null,
"abstractUrl": "/proceedings-article/icedme/2020/09122218/1kRSDLbv7OM",
"parentPublication": {
"id": "proceedings/icedme/2020/8145/0",
"title": "2020 3rd International Conference on Electron Device and Mechanical Engineering (ICEDME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiea/2020/8288/0/828800a453",
"title": "Failure Analysis of Tube-Burst on T91 Platen Superheater of 600 MW Supercritical Boiler",
"doi": null,
"abstractUrl": "/proceedings-article/aiea/2020/828800a453/1nTun03OGB2",
"parentPublication": {
"id": "proceedings/aiea/2020/8288/0",
"title": "2020 International Conference on Artificial Intelligence and Electromechanical Automation (AIEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a026",
"title": "GPU-based Raycasting of Hermite Spline Tubes",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a026/1qRNBBpLeeI",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a021",
"title": "High-quality real-time raycasting and raytracing of streamtubes with sparse voxel octrees",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a021/1qROrmzMErC",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09904453",
"articleId": "1H1giUQajSM",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9yobwYxEc",
"name": "ttg202301-09905624s1-tvcg-3209400-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09905624s1-tvcg-3209400-mm.zip",
"extension": "zip",
"size": "368 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAWYKCi",
"title": "May",
"year": "2018",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyoPSP9",
"doi": "10.1109/TVCG.2017.2661308",
"abstract": "We present a novel method for posing and animating botanical tree models interactively in real time. Unlike other state of the art methods which tend to produce trees that are overly flexible, bending and deforming as if they were underwater plants, our approach allows for arbitrarily high stiffness while still maintaining real-time frame rates without spurious artifacts, even on quite large trees with over ten thousand branches. This is accomplished by using an articulated rigid body model with as-stiff-as-desired rotational springs in conjunction with our newly proposed simulation technique, which is motivated both by position based dynamics and the typical Z_$O(N)$_Z algorithms for articulated rigid bodies. The efficiency of our algorithm allows us to pose and animate trees with millions of branches or alternatively simulate a small forest comprised of many highly detailed trees. Even using only a single CPU core, we can simulate ten thousand branches in real time while still maintaining quite crisp user interactivity. This has allowed us to incorporate our framework into a commodity game engine to run interactively even on a low-budget tablet. We show that our method is amenable to the incorporation of a large variety of desirable effects such as wind, leaves, fictitious forces, collisions, fracture, etc.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel method for posing and animating botanical tree models interactively in real time. Unlike other state of the art methods which tend to produce trees that are overly flexible, bending and deforming as if they were underwater plants, our approach allows for arbitrarily high stiffness while still maintaining real-time frame rates without spurious artifacts, even on quite large trees with over ten thousand branches. This is accomplished by using an articulated rigid body model with as-stiff-as-desired rotational springs in conjunction with our newly proposed simulation technique, which is motivated both by position based dynamics and the typical $O(N)$ algorithms for articulated rigid bodies. The efficiency of our algorithm allows us to pose and animate trees with millions of branches or alternatively simulate a small forest comprised of many highly detailed trees. Even using only a single CPU core, we can simulate ten thousand branches in real time while still maintaining quite crisp user interactivity. This has allowed us to incorporate our framework into a commodity game engine to run interactively even on a low-budget tablet. We show that our method is amenable to the incorporation of a large variety of desirable effects such as wind, leaves, fictitious forces, collisions, fracture, etc.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel method for posing and animating botanical tree models interactively in real time. Unlike other state of the art methods which tend to produce trees that are overly flexible, bending and deforming as if they were underwater plants, our approach allows for arbitrarily high stiffness while still maintaining real-time frame rates without spurious artifacts, even on quite large trees with over ten thousand branches. This is accomplished by using an articulated rigid body model with as-stiff-as-desired rotational springs in conjunction with our newly proposed simulation technique, which is motivated both by position based dynamics and the typical - algorithms for articulated rigid bodies. The efficiency of our algorithm allows us to pose and animate trees with millions of branches or alternatively simulate a small forest comprised of many highly detailed trees. Even using only a single CPU core, we can simulate ten thousand branches in real time while still maintaining quite crisp user interactivity. This has allowed us to incorporate our framework into a commodity game engine to run interactively even on a low-budget tablet. We show that our method is amenable to the incorporation of a large variety of desirable effects such as wind, leaves, fictitious forces, collisions, fracture, etc.",
"title": "Real-Time Interactive Tree Animation",
"normalizedTitle": "Real-Time Interactive Tree Animation",
"fno": "07836345",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Vegetation",
"Heuristic Algorithms",
"Real Time Systems",
"Springs",
"Mathematical Model",
"Computational Modeling",
"Deformable Models",
"Computer Graphics",
"Physically Based Modeling",
"Botanical Tree"
],
"authors": [
{
"givenName": "Ed",
"surname": "Quigley",
"fullName": "Ed Quigley",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Yu",
"fullName": "Yue Yu",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jingwei",
"surname": "Huang",
"fullName": "Jingwei Huang",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Winnie",
"surname": "Lin",
"fullName": "Winnie Lin",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronald",
"surname": "Fedkiw",
"fullName": "Ronald Fedkiw",
"affiliation": "Department of Computer Science, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2018-05-01 00:00:00",
"pubType": "trans",
"pages": "1717-1727",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/snpd/2009/3642/0/3642a623",
"title": "Interactive Physical Based Animation of Tree Swaying in Wind",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2009/3642a623/12OmNx7ov14",
"parentPublication": {
"id": "proceedings/snpd/2009/3642/0",
"title": "2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815002",
"title": "A Simple Method to Animate Vegetation in Images Using Simulation-Guided Grid-Based Warping",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815002/12OmNym2c8U",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2016/0641/0/07477596",
"title": "Measuring and modeling apple trees using time-of-flight data for automation of dormant pruning applications",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2016/07477596/12OmNzw8jeL",
"parentPublication": {
"id": "proceedings/wacv/2016/0641/0",
"title": "2016 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/12/07368927",
"title": "Tree Modeling with Real Tree-Parts Examples",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07368927/13rRUxlgxTp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/12/07775115",
"title": "Creative Virtual Tree Modeling Through Hierarchical Topology-Preserving Blending",
"doi": null,
"abstractUrl": "/journal/tg/2017/12/07775115/13rRUyYSWl4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/05/07959594",
"title": "Gene Tree Construction and Correction Using SuperTree and Reconciliation",
"doi": null,
"abstractUrl": "/journal/tb/2018/05/07959594/14dcDXLXNjM",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2018/9159/0/08594826",
"title": "Realization of Random Forest for Real-Time Evaluation through Tree Framing",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2018/08594826/17D45XcttmM",
"parentPublication": {
"id": "proceedings/icdm/2018/9159/0",
"title": "2018 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10122175",
"title": "A Scalable Method for Readable Tree Layouts",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10122175/1N0swtOjW4U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/01/08868219",
"title": "Consensus of All Solutions for Intractable Phylogenetic Tree Inference",
"doi": null,
"abstractUrl": "/journal/tb/2021/01/08868219/1e7BUc5cU92",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150771",
"title": "Visual 3D Reconstruction and Dynamic Simulation of Fruit Trees for Robotic Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150771/1lPH4XuKzIY",
"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": "07903744",
"articleId": "13rRUwbJD4R",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07879300",
"articleId": "13rRUxbTMyX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesYs",
"name": "ttg201805-07836345s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201805-07836345s1.zip",
"extension": "zip",
"size": "220 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbv",
"title": "Feb.",
"year": "2020",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13w3lontbPP",
"doi": "10.1109/TVCG.2018.2869784",
"abstract": "In this paper, we describe a novel procedural modeling technique for generating realistic plant models from multi-view photographs. The realism is enhanced via visual and spatial information acquired from images. In contrast to previous approaches that heavily rely on user interaction to segment plants or recover branches in images, our method automatically estimates an accurate depth map of each image and extracts a 3D dense point cloud by exploiting an efficient stereophotogrammetry approach. Taking this point cloud as a soft constraint, we fit a parametric plant representation to simulate the plant growth progress. In this way, we are able to synthesize parametric plant models from real data provided by photos and 3D point clouds. We demonstrate the robustness of the proposed approach by modeling various plants with complex branching structures and significant self-occlusions. We also demonstrate that the proposed framework can be used to reconstruct ground-covering plants, such as bushes and shrubs which have been given little attention in the literature. The effectiveness of our approach is validated by visually and quantitatively comparing with the state-of-the-art approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we describe a novel procedural modeling technique for generating realistic plant models from multi-view photographs. The realism is enhanced via visual and spatial information acquired from images. In contrast to previous approaches that heavily rely on user interaction to segment plants or recover branches in images, our method automatically estimates an accurate depth map of each image and extracts a 3D dense point cloud by exploiting an efficient stereophotogrammetry approach. Taking this point cloud as a soft constraint, we fit a parametric plant representation to simulate the plant growth progress. In this way, we are able to synthesize parametric plant models from real data provided by photos and 3D point clouds. We demonstrate the robustness of the proposed approach by modeling various plants with complex branching structures and significant self-occlusions. We also demonstrate that the proposed framework can be used to reconstruct ground-covering plants, such as bushes and shrubs which have been given little attention in the literature. The effectiveness of our approach is validated by visually and quantitatively comparing with the state-of-the-art approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we describe a novel procedural modeling technique for generating realistic plant models from multi-view photographs. The realism is enhanced via visual and spatial information acquired from images. In contrast to previous approaches that heavily rely on user interaction to segment plants or recover branches in images, our method automatically estimates an accurate depth map of each image and extracts a 3D dense point cloud by exploiting an efficient stereophotogrammetry approach. Taking this point cloud as a soft constraint, we fit a parametric plant representation to simulate the plant growth progress. In this way, we are able to synthesize parametric plant models from real data provided by photos and 3D point clouds. We demonstrate the robustness of the proposed approach by modeling various plants with complex branching structures and significant self-occlusions. We also demonstrate that the proposed framework can be used to reconstruct ground-covering plants, such as bushes and shrubs which have been given little attention in the literature. The effectiveness of our approach is validated by visually and quantitatively comparing with the state-of-the-art approaches.",
"title": "Realistic Procedural Plant Modeling from Multiple View Images",
"normalizedTitle": "Realistic Procedural Plant Modeling from Multiple View Images",
"fno": "08462802",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Biology Computing",
"Image Reconstruction",
"Solid Modelling",
"Realistic Procedural Plant Modeling",
"Multiple View Images",
"Realistic Plant Models",
"Multiview Photographs",
"Visual Information",
"Spatial Information",
"User Interaction",
"3 D Dense Point Cloud",
"Parametric Plant Representation",
"Plant Growth Progress",
"Parametric Plant Models",
"Complex Branching Structures",
"Ground Covering Plants",
"Stereophotogrammetry Approach",
"Three Dimensional Displays",
"Solid Modeling",
"Computational Modeling",
"Image Reconstruction",
"Shape",
"Geometry",
"Vegetation",
"Multi View Images",
"Dense Depth Map",
"Procedural Modeling",
"Plant Reconstruction"
],
"authors": [
{
"givenName": "Jianwei",
"surname": "Guo",
"fullName": "Jianwei Guo",
"affiliation": "National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shibiao",
"surname": "Xu",
"fullName": "Shibiao Xu",
"affiliation": "National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong-Ming",
"surname": "Yan",
"fullName": "Dong-Ming Yan",
"affiliation": "National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhanglin",
"surname": "Cheng",
"fullName": "Zhanglin Cheng",
"affiliation": "Shenzhen VisuCA Key Lab, SIAT, CAS, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Jaeger",
"fullName": "Marc Jaeger",
"affiliation": "LIRMM-ICAR, Montpellier University, Montpellier, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaopeng",
"surname": "Zhang",
"fullName": "Xiaopeng Zhang",
"affiliation": "National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2020-02-01 00:00:00",
"pubType": "trans",
"pages": "1372-1384",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bigmm/2015/8688/0/8688a366",
"title": "Approach for 3D Reconstructing Bonsai Plant",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2015/8688a366/12OmNqJq4hI",
"parentPublication": {
"id": "proceedings/bigmm/2015/8688/0",
"title": "2015 IEEE International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2015/1986/0/1986a290",
"title": "Computer Vision Based Autonomous Robotic System for 3D Plant Growth Measurement",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2015/1986a290/12OmNyuy9Mq",
"parentPublication": {
"id": "proceedings/crv/2015/1986/0",
"title": "2015 12th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2011/4484/0/4484a160",
"title": "A Visualization System for Tomato Plant Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2011/4484a160/12OmNyxFKcU",
"parentPublication": {
"id": "proceedings/cgiv/2011/4484/0",
"title": "2011 Eighth International Conference Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034c046",
"title": "Drought Stress Classification Using 3D Plant Models",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c046/12OmNzA6GKz",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2017/1230/0/1230a066",
"title": "The Landscape Plant as Spatial Element Used in the Construction of Parametric Configuration System",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2017/1230a066/12OmNzYNN34",
"parentPublication": {
"id": "proceedings/icicta/2017/1230/0",
"title": "2017 10th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/06/08334629",
"title": "Machine Vision System for 3D Plant Phenotyping",
"doi": null,
"abstractUrl": "/journal/tb/2019/06/08334629/13rRUwI5Uey",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/10/ttg2013101700",
"title": "Cylinder Detection in Large-Scale Point Cloud of Pipeline Plant",
"doi": null,
"abstractUrl": "/journal/tg/2013/10/ttg2013101700/13rRUygT7yc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2020/06/08698802",
"title": "Active Vision and Surface Reconstruction for 3D Plant Shoot Modelling",
"doi": null,
"abstractUrl": "/journal/tb/2020/06/08698802/19w8qhKJM1G",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006497",
"title": "Plant Event Detection from Time-Varying Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006497/1hJrP2OrOwM",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcmeim/2020/4109/0/410900a522",
"title": "3D reconstruction based plant-monitoring and plant-phenotyping platform",
"doi": null,
"abstractUrl": "/proceedings-article/wcmeim/2020/410900a522/1t2myB9iGac",
"parentPublication": {
"id": "proceedings/wcmeim/2020/4109/0",
"title": "2020 3rd World Conference on Mechanical Engineering and Intelligent Manufacturing (WCMEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08449116",
"articleId": "13rRUyeCkaq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08462792",
"articleId": "13w3loWnQPK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx5YvqP",
"title": "Nov.",
"year": "2020",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1bmEPJMhdOo",
"doi": "10.1109/TVCG.2019.2924430",
"abstract": "In the paper, we present a method for space-efficient representation of geometric tree models, which are provided as skeletons with radii attached to individual branch segments. The proposed approach uses a new differential 3D chain code to encode orientation changes of consecutive branch segments, which allows optimizing chain code generation for increased compressibility while maintaining control over the model reconstruction error. The presented method is the first to encode the complete branching geometry including the branch radii and provides level-of-detail construction directly from the chain code. It is demonstrated that by using interpolative encoding of the resulting tree descriptors and radii sequences, the storage requirements for geometric description of a mixed all-aged forest can be reduced to less than 15 percent of its raw size while preserving the structural fidelity of tree models.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the paper, we present a method for space-efficient representation of geometric tree models, which are provided as skeletons with radii attached to individual branch segments. The proposed approach uses a new differential 3D chain code to encode orientation changes of consecutive branch segments, which allows optimizing chain code generation for increased compressibility while maintaining control over the model reconstruction error. The presented method is the first to encode the complete branching geometry including the branch radii and provides level-of-detail construction directly from the chain code. It is demonstrated that by using interpolative encoding of the resulting tree descriptors and radii sequences, the storage requirements for geometric description of a mixed all-aged forest can be reduced to less than 15 percent of its raw size while preserving the structural fidelity of tree models.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the paper, we present a method for space-efficient representation of geometric tree models, which are provided as skeletons with radii attached to individual branch segments. The proposed approach uses a new differential 3D chain code to encode orientation changes of consecutive branch segments, which allows optimizing chain code generation for increased compressibility while maintaining control over the model reconstruction error. The presented method is the first to encode the complete branching geometry including the branch radii and provides level-of-detail construction directly from the chain code. It is demonstrated that by using interpolative encoding of the resulting tree descriptors and radii sequences, the storage requirements for geometric description of a mixed all-aged forest can be reduced to less than 15 percent of its raw size while preserving the structural fidelity of tree models.",
"title": "Efficient Representation of Geometric Tree Models with Level-of-Detail Using Compressed 3D Chain Code",
"normalizedTitle": "Efficient Representation of Geometric Tree Models with Level-of-Detail Using Compressed 3D Chain Code",
"fno": "08744364",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Complexity",
"Computational Geometry",
"Data Compression",
"Image Coding",
"Image Reconstruction",
"Image Representation",
"Interpolation",
"Trees Mathematics",
"Interpolative Encoding",
"Geometric Description",
"Geometric Tree Models",
"Space Efficient Representation",
"Consecutive Branch Segments",
"Compressibility",
"Model Reconstruction Error",
"Complete Branching Geometry",
"Branch Radii",
"Level Of Detail Construction",
"Optimized Chain Code Generation",
"Vegetation",
"Encoding",
"Three Dimensional Displays",
"Skeleton",
"Geometry",
"Data Models",
"Solid Modeling",
"Geometric Tree Model",
"Differential Chain Code",
"Interpolative Compression",
"Level Of Detail"
],
"authors": [
{
"givenName": "Damjan",
"surname": "Strnad",
"fullName": "Damjan Strnad",
"affiliation": "University of Maribor, Maribor, Slovenia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Štefan",
"surname": "Kohek",
"fullName": "Štefan Kohek",
"affiliation": "University of Maribor, Maribor, Slovenia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrej",
"surname": "Nerat",
"fullName": "Andrej Nerat",
"affiliation": "University of Maribor, Maribor, Slovenia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Borut",
"surname": "Žalik",
"fullName": "Borut Žalik",
"affiliation": "University of Maribor, Maribor, Slovenia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2020-11-01 00:00:00",
"pubType": "trans",
"pages": "3177-3188",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isspit/2006/9753/0/04042347",
"title": "A New Efficient Context-Based Relative-Directional Chain Coding",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2006/04042347/12OmNs5rkZh",
"parentPublication": {
"id": "proceedings/isspit/2006/9753/0",
"title": "2006 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2013/5045/0/5045a144",
"title": "Minimal Geometric Representation and Strawberry Stem Detection",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2013/5045a144/12OmNwe2ICp",
"parentPublication": {
"id": "proceedings/iccsa/2013/5045/0",
"title": "2013 13th International Conference on Computational Science and Its Applications (ICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pma/2006/2851/0/2851a274",
"title": "Tree Skeleton Extraction from a Single Range Image",
"doi": null,
"abstractUrl": "/proceedings-article/pma/2006/2851a274/12OmNzV70xW",
"parentPublication": {
"id": "proceedings/pma/2006/2851/0",
"title": "2006 Second International Symposium on Plant Growth Modeling, Simulation, Visualization and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2016/1853/0/07786227",
"title": "Engineering Wavelet Tree Implementations for Compressed Web Graph Representations",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2016/07786227/12OmNzVXNUl",
"parentPublication": {
"id": "proceedings/dcc/2016/1853/0",
"title": "2016 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/12/07368927",
"title": "Tree Modeling with Real Tree-Parts Examples",
"doi": null,
"abstractUrl": "/journal/tg/2016/12/07368927/13rRUxlgxTp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1989/01/i0095",
"title": "Tree Searched Chain Coding for Subpixel Reconstruction of Planar Curves",
"doi": null,
"abstractUrl": "/journal/tp/1989/01/i0095/13rRUyYjKb9",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csit/2018/4152/0/08486157",
"title": "Key Management Scheme for IoT Based Supply Chain",
"doi": null,
"abstractUrl": "/proceedings-article/csit/2018/08486157/14jQfO8LZmN",
"parentPublication": {
"id": "proceedings/csit/2018/4152/0",
"title": "2018 8th International Conference on Computer Science and Information Technology (CSIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2021/0679/0/067900a055",
"title": "3D Forest-tree Modeling Approach Based on Loading Segment Models",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2021/067900a055/1CATsJrErhC",
"parentPublication": {
"id": "proceedings/itme/2021/0679/0",
"title": "2021 11th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09837104",
"title": "Modeling of the 3D Tree Skeleton using Real-World Data: A Survey",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09837104/1FbOBmxWmRi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2021/1838/0/255600a826",
"title": "Mid-Air Finger Sketching for Tree Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2021/255600a826/1tuBbGEUWm4",
"parentPublication": {
"id": "proceedings/vr/2021/1838/0",
"title": "2021 IEEE Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08737754",
"articleId": "1bcHtOFxACQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08713940",
"articleId": "1a31n7yR8kM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1nxQTf1stPy",
"name": "ttg202011-08744364s1-lod.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202011-08744364s1-lod.mp4",
"extension": "mp4",
"size": "32.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzd7bm3",
"title": "January-March",
"year": "2001",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "7",
"label": "January-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwghd4T",
"doi": "10.1109/2945.910819",
"abstract": "Abstract—One of the most effective techniques for developing efficient isosurfacing algorithms is the reduction of visits to nonisosurface cells. Recent algorithms have drastically reduced the unnecessary cost of visiting nonisosurface cells. The experimental results show almost optimal performance in their isosurfacing processes. However, most of them have a bottleneck in that they require more than Z_$O(n)$_Z computation time for their preprocessing, where Z_$n$_Z denotes the total number of cells. In this paper, we propose an efficient isosurfacing technique, which can be applied to unstructured as well as structured volumes and which does not require more than Z_$O(n)$_Z computation time for its preprocessing. A preprocessing step generates an extrema skeleton, which consists of cells and connects all extremum points, by the volume thinning algorithm. All disjoint parts of every isosurface intersect at least one cell in the extrema skeleton. Our implementation generates isosurfaces by searching for isosurface cells in the extrema skeleton and then recursively visiting their adjacent isosurface cells, while it skips most of the nonisosurface cells. The computation time of the preprocessing is estimated as Z_$O(n)$_Z. The computation time of the isosurfacing process is estimated as Z_$O(n^{1/3} m + k)$_Z, where Z_$k$_Z denotes the number of isosurface cells and Z_$m$_Z denotes the number of extremum points since the number of cells in an extrema skeleton is estimated as Z_$O(n^{1/3} m)$_Z.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—One of the most effective techniques for developing efficient isosurfacing algorithms is the reduction of visits to nonisosurface cells. Recent algorithms have drastically reduced the unnecessary cost of visiting nonisosurface cells. The experimental results show almost optimal performance in their isosurfacing processes. However, most of them have a bottleneck in that they require more than $O(n)$ computation time for their preprocessing, where $n$ denotes the total number of cells. In this paper, we propose an efficient isosurfacing technique, which can be applied to unstructured as well as structured volumes and which does not require more than $O(n)$ computation time for its preprocessing. A preprocessing step generates an extrema skeleton, which consists of cells and connects all extremum points, by the volume thinning algorithm. All disjoint parts of every isosurface intersect at least one cell in the extrema skeleton. Our implementation generates isosurfaces by searching for isosurface cells in the extrema skeleton and then recursively visiting their adjacent isosurface cells, while it skips most of the nonisosurface cells. The computation time of the preprocessing is estimated as $O(n)$. The computation time of the isosurfacing process is estimated as $O(n^{1/3} m + k)$, where $k$ denotes the number of isosurface cells and $m$ denotes the number of extremum points since the number of cells in an extrema skeleton is estimated as $O(n^{1/3} m)$.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—One of the most effective techniques for developing efficient isosurfacing algorithms is the reduction of visits to nonisosurface cells. Recent algorithms have drastically reduced the unnecessary cost of visiting nonisosurface cells. The experimental results show almost optimal performance in their isosurfacing processes. However, most of them have a bottleneck in that they require more than - computation time for their preprocessing, where - denotes the total number of cells. In this paper, we propose an efficient isosurfacing technique, which can be applied to unstructured as well as structured volumes and which does not require more than - computation time for its preprocessing. A preprocessing step generates an extrema skeleton, which consists of cells and connects all extremum points, by the volume thinning algorithm. All disjoint parts of every isosurface intersect at least one cell in the extrema skeleton. Our implementation generates isosurfaces by searching for isosurface cells in the extrema skeleton and then recursively visiting their adjacent isosurface cells, while it skips most of the nonisosurface cells. The computation time of the preprocessing is estimated as -. The computation time of the isosurfacing process is estimated as -, where - denotes the number of isosurface cells and - denotes the number of extremum points since the number of cells in an extrema skeleton is estimated as -.",
"title": "Fast Isosurface Generation Using the Volume Thinning Algorithm",
"normalizedTitle": "Fast Isosurface Generation Using the Volume Thinning Algorithm",
"fno": "v0032",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Isosurface",
"Extremum Points",
"Volume Thinning",
"Extrema Skeleton",
"Lattice Classification"
],
"authors": [
{
"givenName": "Takayuki",
"surname": "Itoh",
"fullName": "Takayuki Itoh",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yasushi",
"surname": "Yamaguchi",
"fullName": "Yasushi Yamaguchi",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Koji",
"surname": "Koyamada",
"fullName": "Koji Koyamada",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2001-01-01 00:00:00",
"pubType": "trans",
"pages": "32-46",
"year": "2001",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0017",
"articleId": "13rRUNvgz41",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0047",
"articleId": "13rRUxASuhm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNANBZkd",
"title": "March",
"year": "2004",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "26",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuiK",
"doi": "10.1109/TPAMI.2004.1262333",
"abstract": "Abstract—For analyzing shapes of planar, closed curves, we propose differential geometric representations of curves using their direction functions and curvature functions. Shapes are represented as elements of infinite-dimensional spaces and their pairwise differences are quantified using the lengths of geodesics connecting them on these spaces. We use a Fourier basis to represent tangents to the shape spaces and then use a gradient-based shooting method to solve for the tangent that connects any two shapes via a geodesic. Using the Surrey fish database, we demonstrate some applications of this approach: 1) interpolation and extrapolations of shape changes, 2) clustering of objects according to their shapes, 3) statistics on shape spaces, and 4) Bayesian extraction of shapes in low-quality images.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—For analyzing shapes of planar, closed curves, we propose differential geometric representations of curves using their direction functions and curvature functions. Shapes are represented as elements of infinite-dimensional spaces and their pairwise differences are quantified using the lengths of geodesics connecting them on these spaces. We use a Fourier basis to represent tangents to the shape spaces and then use a gradient-based shooting method to solve for the tangent that connects any two shapes via a geodesic. Using the Surrey fish database, we demonstrate some applications of this approach: 1) interpolation and extrapolations of shape changes, 2) clustering of objects according to their shapes, 3) statistics on shape spaces, and 4) Bayesian extraction of shapes in low-quality images.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—For analyzing shapes of planar, closed curves, we propose differential geometric representations of curves using their direction functions and curvature functions. Shapes are represented as elements of infinite-dimensional spaces and their pairwise differences are quantified using the lengths of geodesics connecting them on these spaces. We use a Fourier basis to represent tangents to the shape spaces and then use a gradient-based shooting method to solve for the tangent that connects any two shapes via a geodesic. Using the Surrey fish database, we demonstrate some applications of this approach: 1) interpolation and extrapolations of shape changes, 2) clustering of objects according to their shapes, 3) statistics on shape spaces, and 4) Bayesian extraction of shapes in low-quality images.",
"title": "Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces",
"normalizedTitle": "Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces",
"fno": "i0372",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Shape Metrics",
"Geodesic Paths",
"Shape Statistics",
"Intrinsic Mean Shapes",
"Shape Based Clustering",
"Shape Interpolation"
],
"authors": [
{
"givenName": "Eric",
"surname": "Klassen",
"fullName": "Eric Klassen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anuj",
"surname": "Srivastava",
"fullName": "Anuj Srivastava",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Washington",
"surname": "Mio",
"fullName": "Washington Mio",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shantanu H.",
"surname": "Joshi",
"fullName": "Shantanu H. Joshi",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2004-03-01 00:00:00",
"pubType": "trans",
"pages": "372-383",
"year": "2004",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0354",
"articleId": "13rRUy2YLZo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0384",
"articleId": "13rRUyuvRpT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCy2L3z",
"title": "Oct.",
"year": "2012",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJqQ",
"doi": "10.1109/TVCG.2012.94",
"abstract": "Blue noise point sampling is one of the core algorithms in computer graphics. In this paper, we present a new and versatile variational framework for generating point distributions with high-quality blue noise characteristics while precisely adapting to given density functions. Different from previous approaches based on discrete settings of capacity-constrained Voronoi tessellation, we cast the blue noise sampling generation as a variational problem with continuous settings. Based on an accurate evaluation of the gradient of an energy function, an efficient optimization is developed which delivers significantly faster performance than the previous optimization-based methods. Our framework can easily be extended to generating blue noise point samples on manifold surfaces and for multi-class sampling. The optimization formulation also allows us to naturally deal with dynamic domains, such as deformable surfaces, and to yield blue noise samplings with temporal coherence. We present experimental results to validate the efficacy of our variational framework. Finally, we show a variety of applications of the proposed methods, including nonphotorealistic image stippling, color stippling, and blue noise sampling on deformable surfaces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Blue noise point sampling is one of the core algorithms in computer graphics. In this paper, we present a new and versatile variational framework for generating point distributions with high-quality blue noise characteristics while precisely adapting to given density functions. Different from previous approaches based on discrete settings of capacity-constrained Voronoi tessellation, we cast the blue noise sampling generation as a variational problem with continuous settings. Based on an accurate evaluation of the gradient of an energy function, an efficient optimization is developed which delivers significantly faster performance than the previous optimization-based methods. Our framework can easily be extended to generating blue noise point samples on manifold surfaces and for multi-class sampling. The optimization formulation also allows us to naturally deal with dynamic domains, such as deformable surfaces, and to yield blue noise samplings with temporal coherence. We present experimental results to validate the efficacy of our variational framework. Finally, we show a variety of applications of the proposed methods, including nonphotorealistic image stippling, color stippling, and blue noise sampling on deformable surfaces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Blue noise point sampling is one of the core algorithms in computer graphics. In this paper, we present a new and versatile variational framework for generating point distributions with high-quality blue noise characteristics while precisely adapting to given density functions. Different from previous approaches based on discrete settings of capacity-constrained Voronoi tessellation, we cast the blue noise sampling generation as a variational problem with continuous settings. Based on an accurate evaluation of the gradient of an energy function, an efficient optimization is developed which delivers significantly faster performance than the previous optimization-based methods. Our framework can easily be extended to generating blue noise point samples on manifold surfaces and for multi-class sampling. The optimization formulation also allows us to naturally deal with dynamic domains, such as deformable surfaces, and to yield blue noise samplings with temporal coherence. We present experimental results to validate the efficacy of our variational framework. Finally, we show a variety of applications of the proposed methods, including nonphotorealistic image stippling, color stippling, and blue noise sampling on deformable surfaces.",
"title": "Variational Blue Noise Sampling",
"normalizedTitle": "Variational Blue Noise Sampling",
"fno": "ttg2012101784",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Noise Measurement",
"Density Functional Theory",
"Optimization",
"Computer Graphics",
"Quasi Newton Method",
"Point Sampling",
"Blue Noise",
"Centroidal Voronoi Tessellation",
"Capacity Constrained"
],
"authors": [
{
"givenName": "Zhonggui",
"surname": "Chen",
"fullName": "Zhonggui Chen",
"affiliation": "Xiamen University, Xiamen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhan",
"surname": "Yuan",
"fullName": "Zhan Yuan",
"affiliation": "The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yi-King",
"surname": "Choi",
"fullName": "Yi-King Choi",
"affiliation": "The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ligang",
"surname": "Liu",
"fullName": "Ligang Liu",
"affiliation": "University of Science and Technology of China, Hefei",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenping",
"surname": "Wang",
"fullName": "Wenping Wang",
"affiliation": "The University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2012-10-01 00:00:00",
"pubType": "trans",
"pages": "1784-1796",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isqed/2008/3117/0/3117a557",
"title": "Sampling Error Estimation in High-Speed Sampling Systems Introduced by the Presence of Phase Noise in the Sampling Clock",
"doi": null,
"abstractUrl": "/proceedings-article/isqed/2008/3117a557/12OmNyGKUlQ",
"parentPublication": {
"id": "proceedings/isqed/2008/3117/0",
"title": "2008 9th International Symposium on Quality Electronic Design (ISQED '08)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1991/0003/0/00150986",
"title": "Digital halftoning using a blue noise mask",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1991/00150986/12OmNyQGSei",
"parentPublication": {
"id": "proceedings/icassp/1991/0003/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071143",
"title": "Generalized Anisotropic Stratified Surface Sampling",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071143/13rRUILc8fc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/ttg2012060914",
"title": "Efficient and Flexible Sampling with Blue Noise Properties of Triangular Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/ttg2012060914/13rRUyfbwqF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/12/07790842",
"title": "A Simple Push-Pull Algorithm for Blue-Noise Sampling",
"doi": null,
"abstractUrl": "/journal/tg/2017/12/07790842/13rRUzpzeB9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse-euc/2017/3220/2/08005978",
"title": "A Blue Noise Pattern Sampling Methods to Prevent Aliasing",
"doi": null,
"abstractUrl": "/proceedings-article/cse-euc/2017/08005978/17D45XDIXUy",
"parentPublication": {
"id": "proceedings/cse-euc/2017/3220/2",
"title": "2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995092",
"title": "An adaptive variational model for multireference alignment with mixed noise",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995092/1JC3oWLE6ZO",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b027",
"title": "Polishing Decision-Based Adversarial Noise With a Customized Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b027/1m3nhJyl59C",
"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/716800d623",
"title": "Variational-EM-Based Deep Learning for Noise-Blind Image Deblurring",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800d623/1m3nylGUUk8",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09226404",
"title": "Evaluation of Sampling Methods for Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09226404/1nYqk0TjyeY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012101771",
"articleId": "13rRUxC0SW8",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet0W",
"name": "ttg2012101784s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012101784s.pdf",
"extension": "pdf",
"size": "9.84 MB",
"__typename": "WebExtraType"
},
{
"id": "17ShDTYet0V",
"name": "ttg2012101784s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012101784s.zip",
"extension": "zip",
"size": "34.5 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUwIF6dR",
"doi": "10.1109/TVCG.2012.313",
"abstract": "Preintegrated volume rendering produces high-quality renderings without increased sampling rates. However, a look-up table of a conventional preintegrated volume rendering requires a dimensionality of two, which disturbs interactive renderings when the transfer function is changed. Furthermore, as the resolution of the volume data set increases, the memory space required is impractical or inefficient, especially on GPUs. In the past, several approximation methods have been proposed to reduce the complexity of both the time and memory requirement, but most of them do not correctly present thin opaque structures within slabs and ignore the self-attenuation. We propose an advanced interactive preintegrated volume rendering algorithm that achieves not only high-quality renderings comparable to the conventional ones, but also O(n) time and memory space requirements even with the self-attenuation within the slabs applied. The algorithm proposed in this paper decomposes the exponential term of the ray integration equation into a power series of a finite order in the form of a linear combination to build a one-dimensional look-up table. Moreover, the proposed algorithm effectively applies the self-attenuation that is caused by fully opaque isosurfaces, by introducing an opaque prediction table. Experimental results demonstrate that the proposed algorithm offers renderings visibly identical to existing preintegrated volume renderings without degrading rendering speed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Preintegrated volume rendering produces high-quality renderings without increased sampling rates. However, a look-up table of a conventional preintegrated volume rendering requires a dimensionality of two, which disturbs interactive renderings when the transfer function is changed. Furthermore, as the resolution of the volume data set increases, the memory space required is impractical or inefficient, especially on GPUs. In the past, several approximation methods have been proposed to reduce the complexity of both the time and memory requirement, but most of them do not correctly present thin opaque structures within slabs and ignore the self-attenuation. We propose an advanced interactive preintegrated volume rendering algorithm that achieves not only high-quality renderings comparable to the conventional ones, but also O(n) time and memory space requirements even with the self-attenuation within the slabs applied. The algorithm proposed in this paper decomposes the exponential term of the ray integration equation into a power series of a finite order in the form of a linear combination to build a one-dimensional look-up table. Moreover, the proposed algorithm effectively applies the self-attenuation that is caused by fully opaque isosurfaces, by introducing an opaque prediction table. Experimental results demonstrate that the proposed algorithm offers renderings visibly identical to existing preintegrated volume renderings without degrading rendering speed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Preintegrated volume rendering produces high-quality renderings without increased sampling rates. However, a look-up table of a conventional preintegrated volume rendering requires a dimensionality of two, which disturbs interactive renderings when the transfer function is changed. Furthermore, as the resolution of the volume data set increases, the memory space required is impractical or inefficient, especially on GPUs. In the past, several approximation methods have been proposed to reduce the complexity of both the time and memory requirement, but most of them do not correctly present thin opaque structures within slabs and ignore the self-attenuation. We propose an advanced interactive preintegrated volume rendering algorithm that achieves not only high-quality renderings comparable to the conventional ones, but also O(n) time and memory space requirements even with the self-attenuation within the slabs applied. The algorithm proposed in this paper decomposes the exponential term of the ray integration equation into a power series of a finite order in the form of a linear combination to build a one-dimensional look-up table. Moreover, the proposed algorithm effectively applies the self-attenuation that is caused by fully opaque isosurfaces, by introducing an opaque prediction table. Experimental results demonstrate that the proposed algorithm offers renderings visibly identical to existing preintegrated volume renderings without degrading rendering speed.",
"title": "Advanced Interactive Preintegrated Volume Rendering with a Power Series",
"normalizedTitle": "Advanced Interactive Preintegrated Volume Rendering with a Power Series",
"fno": "ttg2013081264",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Power Series",
"Preintegration",
"Direct Volume Rendering",
"Ray Casting"
],
"authors": [
{
"givenName": null,
"surname": "Byeonghun Lee",
"fullName": "Byeonghun Lee",
"affiliation": "Dept. of Comput. Eng., Sungkyunkwan Univ., Suwon, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Yeong-Gil Shin",
"fullName": "Yeong-Gil Shin",
"affiliation": "Dept. of Comput. Eng., Sungkyunkwan Univ., Suwon, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2013-08-01 00:00:00",
"pubType": "trans",
"pages": "1264-1273",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/1999/5897/0/58970030",
"title": "Mixing Translucent Polygons with Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970030/12OmNCgrD1Z",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b575",
"title": "Rapid Texture-based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b575/12OmNx7G5VW",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2011/4602/0/4602a158",
"title": "An Adaptive Sampling Based Parallel Volume Rendering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2011/4602a158/12OmNxE2mHp",
"parentPublication": {
"id": "proceedings/icvrv/2011/4602/0",
"title": "2011 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/frontiers/1995/6965/0/69650238",
"title": "An optimal parallel algorithm for volume ray casting",
"doi": null,
"abstractUrl": "/proceedings-article/frontiers/1995/69650238/12OmNxisQY8",
"parentPublication": {
"id": "proceedings/frontiers/1995/6965/0",
"title": "Frontiers of Massively Parallel Processing, Symposium on the",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/1998/9180/0/91800063",
"title": "Edge Preservation in Volume Rendering Using Splatting",
"doi": null,
"abstractUrl": "/proceedings-article/vv/1998/91800063/12OmNzJbQVc",
"parentPublication": {
"id": "proceedings/vv/1998/9180/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/03/v0270",
"title": "Multidimensional Transfer Functions for Interactive Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2002/03/v0270/13rRUB7a1fG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061533",
"title": "Efficient High-Quality Volume Rendering of SPH Data",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061533/13rRUwInvJc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/ttg2012060925",
"title": "A Versatile Optical Model for Hybrid Rendering of Volume Data",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/ttg2012060925/13rRUwjGoFX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061571",
"title": "Volume Ray Casting with Peak Finding and Differential Sampling",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061571/13rRUxBa55W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061505",
"title": "Direct Interval Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061505/13rRUxcsYLN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013081252",
"articleId": "13rRUxYrbMf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013081274",
"articleId": "13rRUxjQypc",
"__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": "13rRUxASuWB",
"doi": "10.1109/TCBB.2016.2564970",
"abstract": "We present Brain Modulyzer, an interactive visual exploration tool for functional magnetic resonance imaging (fMRI) brain scans, aimed at analyzing the correlation between different brain regions when resting or when performing mental tasks. Brain Modulyzer combines multiple coordinated views—such as heat maps, node link diagrams, and anatomical views—using brushing and linking to provide an anatomical context for brain connectivity data. Integrating methods from graph theory and analysis, e.g., community detection and derived graph measures, makes it possible to explore the modular and hierarchical organization of functional brain networks. Providing immediate feedback by displaying analysis results instantaneously while changing parameters gives neuroscientists a powerful means to comprehend complex brain structure more effectively and efficiently and supports forming hypotheses that can then be validated via statistical analysis. To demonstrate the utility of our tool, we present two case studies—exploring progressive supranuclear palsy, as well as memory encoding and retrieval.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present Brain Modulyzer, an interactive visual exploration tool for functional magnetic resonance imaging (fMRI) brain scans, aimed at analyzing the correlation between different brain regions when resting or when performing mental tasks. Brain Modulyzer combines multiple coordinated views—such as heat maps, node link diagrams, and anatomical views—using brushing and linking to provide an anatomical context for brain connectivity data. Integrating methods from graph theory and analysis, e.g., community detection and derived graph measures, makes it possible to explore the modular and hierarchical organization of functional brain networks. Providing immediate feedback by displaying analysis results instantaneously while changing parameters gives neuroscientists a powerful means to comprehend complex brain structure more effectively and efficiently and supports forming hypotheses that can then be validated via statistical analysis. To demonstrate the utility of our tool, we present two case studies—exploring progressive supranuclear palsy, as well as memory encoding and retrieval.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present Brain Modulyzer, an interactive visual exploration tool for functional magnetic resonance imaging (fMRI) brain scans, aimed at analyzing the correlation between different brain regions when resting or when performing mental tasks. Brain Modulyzer combines multiple coordinated views—such as heat maps, node link diagrams, and anatomical views—using brushing and linking to provide an anatomical context for brain connectivity data. Integrating methods from graph theory and analysis, e.g., community detection and derived graph measures, makes it possible to explore the modular and hierarchical organization of functional brain networks. Providing immediate feedback by displaying analysis results instantaneously while changing parameters gives neuroscientists a powerful means to comprehend complex brain structure more effectively and efficiently and supports forming hypotheses that can then be validated via statistical analysis. To demonstrate the utility of our tool, we present two case studies—exploring progressive supranuclear palsy, as well as memory encoding and retrieval.",
"title": "Brain Modulyzer: Interactive Visual Analysis of Functional Brain Connectivity",
"normalizedTitle": "Brain Modulyzer: Interactive Visual Analysis of Functional Brain Connectivity",
"fno": "07466855",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Data Visualization",
"Visualization",
"Organizations",
"Three Dimensional Displays",
"Correlation",
"Layout",
"Network Topology",
"Graph Visualization",
"Neuroinformatics",
"Cluster Analysis",
"Linked Views",
"Brain Imaging",
"Functional Magnetic Resonance Imaging F MRI"
],
"authors": [
{
"givenName": "Sugeerth",
"surname": "Murugesan",
"fullName": "Sugeerth Murugesan",
"affiliation": "Department of Computer Science, University of California Davis, One Shields Avenue, Davis, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kristopher",
"surname": "Bouchard",
"fullName": "Kristopher Bouchard",
"affiliation": "Computational Research Division, Lawrence Berkeley National Laboratory, One Cyclotron Road, Berkeley, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jesse A.",
"surname": "Brown",
"fullName": "Jesse A. Brown",
"affiliation": "Memory and Aging Center, University of California, San Francisco, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernd",
"surname": "Hamann",
"fullName": "Bernd Hamann",
"affiliation": "Department of Computer Science, University of California Davis, One Shields Avenue, Davis, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William W.",
"surname": "Seeley",
"fullName": "William W. Seeley",
"affiliation": "Memory and Aging Center, University of California, San Francisco, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew",
"surname": "Trujillo",
"fullName": "Andrew Trujillo",
"affiliation": "Memory and Aging Center, University of California, San Francisco, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gunther H.",
"surname": "Weber",
"fullName": "Gunther H. Weber",
"affiliation": "Department of Computer Science, University of California Davis, One Shields Avenue, Davis, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2017-07-01 00:00:00",
"pubType": "trans",
"pages": "805-818",
"year": "2017",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2013/1309/0/06732543",
"title": "Connectivity and path analysis for neuron network in the Drosophila brain",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732543/12OmNCdBDZv",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031601",
"title": "A visual analytics system for brain functional connectivity comparison across individuals, groups, and time points",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031601/12OmNxA3Z6e",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/biovis/2013/1658/0/06664349",
"title": "neuroMAP — Interactive graph-visualization of the fruit fly's neural circuit",
"doi": null,
"abstractUrl": "/proceedings-article/biovis/2013/06664349/12OmNy2agJf",
"parentPublication": {
"id": "proceedings/biovis/2013/1658/0",
"title": "2013 IEEE Symposium on Biological Data Visualization (BioVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2018/6568/0/08470321",
"title": "High-homogeneity functional parcellation of human brain for investigating robust functional connectivity",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2018/08470321/13WBGLSeNSo",
"parentPublication": {
"id": "proceedings/ssiai/2018/6568/0",
"title": "2018 IEEE Southwest Symposium on Image Analysis and Interpretation (SSIAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/03/ttg2014030471",
"title": "Three-Dimensional Mean-Shift Edge Bundling for the Visualization of Functional Connectivity in the Brain",
"doi": null,
"abstractUrl": "/journal/tg/2014/03/ttg2014030471/13rRUxBrGgY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/04/v0419",
"title": "Exploring Connectivity of the Brain's White Matter with Dynamic Queries",
"doi": null,
"abstractUrl": "/journal/tg/2005/04/v0419/13rRUy3xY2J",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/05753898",
"title": "Exploring Brain Connectivity with Two-Dimensional Neural Maps",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/05753898/13rRUyfbwqE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/skg/2018/0441/0/08703957",
"title": "Group Analysis by Visualized Distributional Representation for Resting-State Functional Brain Connectivity",
"doi": null,
"abstractUrl": "/proceedings-article/skg/2018/08703957/19JEbX7PCda",
"parentPublication": {
"id": "proceedings/skg/2018/0441/0",
"title": "2018 14th International Conference on Semantics, Knowledge and Grids (SKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09001193",
"title": "Estimating Functional Connectivity by Integration of Inherent Brain Function Activity Pattern Priors",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09001193/1hwsYtW1xqU",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a046",
"title": "PRAGMA: Interactively Constructing Functional Brain Parcellations",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a046/1qROcmsxnYA",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07434600",
"articleId": "13rRUxBJhtJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07467539",
"articleId": "13rRUy3gnbR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRHL",
"name": "ttb201704-07466855s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttb201704-07466855s1.zip",
"extension": "zip",
"size": "15.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIJqmj",
"title": "Feb.",
"year": "2014",
"issueNum": "01",
"idPrefix": "nt",
"pubType": "journal",
"volume": "22",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIIVl9B",
"doi": "10.1109/TNET.2013.2257840",
"abstract": "Swarm-based peer-to-peer streaming (SPS) mechanisms tend to generate a significant amount of costly inter-ISP traffic. Localization of overlay connectivity reduces inter-ISP traffic. However, it can adversely affect the delivered quality. In this paper, we systematically examine the performance of SPS for live video over localized overlays. We identify and discuss the fundamental bottlenecks limiting the stream quality and present OLIVES, an ISP-friendly P2P streaming mechanism for live video. OLIVES maintains a fully localized overlay to reduce the volume of inter-ISP traffic and incorporates a two-tier inter-ISP and intra-ISP scheduling scheme to maximize the delivered quality to individual peers. One important design choice is to perform basic scheduling at a substream level and to use implicit coordination among peers. This allows OLIVES to efficiently detect missing blocks and pull them into the ISP in a timely manner with a minimum in coordination overhead. Furthermore, OLIVES incorporates a shortcutting technique that limits the buffer requirements for each participating peer and effectively reduced the playout latency. Through analysis and extensive simulations, we demonstrate the ability of OLIVES to deliver high-quality streams over localized overlays in various realistic scenarios.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Swarm-based peer-to-peer streaming (SPS) mechanisms tend to generate a significant amount of costly inter-ISP traffic. Localization of overlay connectivity reduces inter-ISP traffic. However, it can adversely affect the delivered quality. In this paper, we systematically examine the performance of SPS for live video over localized overlays. We identify and discuss the fundamental bottlenecks limiting the stream quality and present OLIVES, an ISP-friendly P2P streaming mechanism for live video. OLIVES maintains a fully localized overlay to reduce the volume of inter-ISP traffic and incorporates a two-tier inter-ISP and intra-ISP scheduling scheme to maximize the delivered quality to individual peers. One important design choice is to perform basic scheduling at a substream level and to use implicit coordination among peers. This allows OLIVES to efficiently detect missing blocks and pull them into the ISP in a timely manner with a minimum in coordination overhead. Furthermore, OLIVES incorporates a shortcutting technique that limits the buffer requirements for each participating peer and effectively reduced the playout latency. Through analysis and extensive simulations, we demonstrate the ability of OLIVES to deliver high-quality streams over localized overlays in various realistic scenarios.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Swarm-based peer-to-peer streaming (SPS) mechanisms tend to generate a significant amount of costly inter-ISP traffic. Localization of overlay connectivity reduces inter-ISP traffic. However, it can adversely affect the delivered quality. In this paper, we systematically examine the performance of SPS for live video over localized overlays. We identify and discuss the fundamental bottlenecks limiting the stream quality and present OLIVES, an ISP-friendly P2P streaming mechanism for live video. OLIVES maintains a fully localized overlay to reduce the volume of inter-ISP traffic and incorporates a two-tier inter-ISP and intra-ISP scheduling scheme to maximize the delivered quality to individual peers. One important design choice is to perform basic scheduling at a substream level and to use implicit coordination among peers. This allows OLIVES to efficiently detect missing blocks and pull them into the ISP in a timely manner with a minimum in coordination overhead. Furthermore, OLIVES incorporates a shortcutting technique that limits the buffer requirements for each participating peer and effectively reduced the playout latency. Through analysis and extensive simulations, we demonstrate the ability of OLIVES to deliver high-quality streams over localized overlays in various realistic scenarios.",
"title": "ISP-Friendly Live P2P Streaming",
"normalizedTitle": "ISP-Friendly Live P2P Streaming",
"fno": "06516640",
"hasPdf": true,
"idPrefix": "nt",
"keywords": [
"Internet",
"Overlay Networks",
"Peer To Peer Computing",
"Scheduling",
"Telecommunication Traffic",
"Video Streaming",
"ISP Friendly Live P 2 P Streaming Mechanism",
"Swarm Based Peer To Peer Streaming Mechanisms",
"Inter ISP Traffic Volume Reduction",
"Overlay Connectivity Localization",
"SPS",
"Stream Quality Limitation",
"OLIVES",
"Live Video",
"Two Tier Inter ISP Scheduling Scheme",
"Two Tier Intra ISP Scheduling Scheme",
"Missing Block Detection",
"Buffer Requirement Limitation",
"Playout Latency Reduction",
"Computer Networks",
"Internet Trafiic",
"Bit Torrent",
"PP Live",
"Computer Networks",
"Communication System Software",
"Overlay Networks",
"Peer To Peer P 2 P Computing",
"Streaming Media"
],
"authors": [
{
"givenName": "Nazanin",
"surname": "Magharei",
"fullName": "Nazanin Magharei",
"affiliation": "Collage of Computing, Georgia Institute of Technology, Atlanta, GA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Reza",
"surname": "Rejaie",
"fullName": "Reza Rejaie",
"affiliation": "Department of Computer Science, University of Oregon, Eugene, OR, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ivica",
"surname": "Rimac",
"fullName": "Ivica Rimac",
"affiliation": "Bell Labs/Alcatel-Lucent Holmdel, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Volker",
"surname": "Hilt",
"fullName": "Volker Hilt",
"affiliation": "Bell Labs/Alcatel-Lucent Holmdel, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Hofmann",
"fullName": "Markus Hofmann",
"affiliation": "Bell Labs/Alcatel-Lucent Holmdel, NJ, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2014-01-01 00:00:00",
"pubType": "trans",
"pages": "244-256",
"year": "2014",
"issn": "1063-6692",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdcs/2009/3659/0/3659a413",
"title": "ISP",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2009/3659a413/12OmNAXxXaa",
"parentPublication": {
"id": "proceedings/icdcs/2009/3659/0",
"title": "2009 29th IEEE International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2012/4893/0/4893a156",
"title": "Inter-AS Traffic Volume Reduction by Localizing Delivery for P2P Live Streaming",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2012/4893a156/12OmNBSBkc0",
"parentPublication": {
"id": "proceedings/icnc/2012/4893/0",
"title": "2012 Third International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ainaw/2007/2847/2/284720195",
"title": "P2P-Leveraged Mobile Live Streaming",
"doi": null,
"abstractUrl": "/proceedings-article/ainaw/2007/284720195/12OmNs4S8FQ",
"parentPublication": {
"id": "proceedings/ainaw/2007/2847/2",
"title": "Advanced Information Networking and Applications Workshops, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2012/4651/0/4651a431",
"title": "On Randomness in ISP-friendly P2P Applications",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2012/4651a431/12OmNvDqsPg",
"parentPublication": {
"id": "proceedings/aina/2012/4651/0",
"title": "2012 IEEE 26th International Conference on Advanced Information Networking and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2014/4181/0/06888836",
"title": "Socially-Optimal ISP-Aware P2P Content Distribution via a Primal-Dual Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2014/06888836/12OmNx19jSu",
"parentPublication": {
"id": "proceedings/icdcsw/2014/4181/0",
"title": "2014 IEEE 34th International Conference on Distributed Computing Systems Workshops (ICDCSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2013/3755/0/06754995",
"title": "A traffic localization strategy for peer-to-peer live streaming",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2013/06754995/12OmNzTH0NP",
"parentPublication": {
"id": "proceedings/iscc/2013/3755/0",
"title": "2013 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2013/4893/0/06454757",
"title": "A Novel ALTO Scheme for BitTorrent-Like P2P File Sharing Systems",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2013/06454757/12OmNzTYBWZ",
"parentPublication": {
"id": "proceedings/isdea/2013/4893/0",
"title": "2013 Third International Conference on Intelligent System Design and Engineering Applications (ISDEA 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/allerton/2008/2925/0/04797661",
"title": "Design and analysis of ISP-friendly file distribution protocols",
"doi": null,
"abstractUrl": "/proceedings-article/allerton/2008/04797661/12OmNzhELoB",
"parentPublication": {
"id": "proceedings/allerton/2008/2925/0",
"title": "2008 46th Annual Allerton Conference on Communication, Control, and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2016/01/06964823",
"title": "Cache Bandwidth Allocation for P2P File-Sharing Systems to Minimize Inter-ISP Traffic",
"doi": null,
"abstractUrl": "/journal/nt/2016/01/06964823/13rRUwhpBB2",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2011/05/05712185",
"title": "On Dynamic Server Provisioning in Multichannel P2P Live Streaming",
"doi": null,
"abstractUrl": "/journal/nt/2011/05/05712185/13rRUxcKzTP",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06470733",
"articleId": "13rRUIM2Vz2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06479248",
"articleId": "13rRUwjGoIC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7f",
"title": "July",
"year": "2007",
"issueNum": "07",
"idPrefix": "tk",
"pubType": "journal",
"volume": "19",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJrl",
"doi": "10.1109/TKDE.2007.1037",
"abstract": "Nearest neighbor search and many other numerical data analysis tools most often rely on the use of the euclidean distance. When data are high dimensional, however, the euclidean distances seem to concentrate; all distances between pairs of data elements seem to be very similar. Therefore, the relevance of the euclidean distance has been questioned in the past, and fractional norms (Minkowski-like norms with an exponent less than one) were introduced to fight the concentration phenomenon. This paper justifies the use of alternative distances to fight concentration by showing that the concentration is indeed an intrinsic property of the distances and not an artifact from a finite sample. Furthermore, an estimation of the concentration as a function of the exponent of the distance and of the distribution of the data is given. It leads to the conclusion that, contrary to what is generally admitted, fractional norms are not always less concentrated than the euclidean norm; a counterexample is given to prove this claim. Theoretical arguments are presented, which show that the concentration phenomenon can appear for real data that do not match the hypotheses of the theorems, in particular, the assumption of independent and identically distributed variables. Finally, some insights about how to choose an optimal metric are given.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Nearest neighbor search and many other numerical data analysis tools most often rely on the use of the euclidean distance. When data are high dimensional, however, the euclidean distances seem to concentrate; all distances between pairs of data elements seem to be very similar. Therefore, the relevance of the euclidean distance has been questioned in the past, and fractional norms (Minkowski-like norms with an exponent less than one) were introduced to fight the concentration phenomenon. This paper justifies the use of alternative distances to fight concentration by showing that the concentration is indeed an intrinsic property of the distances and not an artifact from a finite sample. Furthermore, an estimation of the concentration as a function of the exponent of the distance and of the distribution of the data is given. It leads to the conclusion that, contrary to what is generally admitted, fractional norms are not always less concentrated than the euclidean norm; a counterexample is given to prove this claim. Theoretical arguments are presented, which show that the concentration phenomenon can appear for real data that do not match the hypotheses of the theorems, in particular, the assumption of independent and identically distributed variables. Finally, some insights about how to choose an optimal metric are given.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Nearest neighbor search and many other numerical data analysis tools most often rely on the use of the euclidean distance. When data are high dimensional, however, the euclidean distances seem to concentrate; all distances between pairs of data elements seem to be very similar. Therefore, the relevance of the euclidean distance has been questioned in the past, and fractional norms (Minkowski-like norms with an exponent less than one) were introduced to fight the concentration phenomenon. This paper justifies the use of alternative distances to fight concentration by showing that the concentration is indeed an intrinsic property of the distances and not an artifact from a finite sample. Furthermore, an estimation of the concentration as a function of the exponent of the distance and of the distribution of the data is given. It leads to the conclusion that, contrary to what is generally admitted, fractional norms are not always less concentrated than the euclidean norm; a counterexample is given to prove this claim. Theoretical arguments are presented, which show that the concentration phenomenon can appear for real data that do not match the hypotheses of the theorems, in particular, the assumption of independent and identically distributed variables. Finally, some insights about how to choose an optimal metric are given.",
"title": "The Concentration of Fractional Distances",
"normalizedTitle": "The Concentration of Fractional Distances",
"fno": "k0873",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Euclidean Distance",
"Data Analysis",
"Information Retrieval",
"Content Based Retrieval",
"Nearest Neighbor Searches",
"Databases",
"Extraterrestrial Measurements",
"Digital Cameras",
"Books",
"DNA",
"Nearest Neighbor Search",
"High Dimensional Data",
"Distance Concentration",
"Fractional Distances"
],
"authors": [
{
"givenName": "Damien",
"surname": "Fran?ois",
"fullName": "Damien Fran?ois",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vincent",
"surname": "Wertz",
"fullName": "Vincent Wertz",
"affiliation": "Department of Mathematical Engineering, Universite´ catholique de Louvain, Georges Lemaıˆtre, 4, B-1348 Louvain-la-Neuve, Belgium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michel",
"surname": "Verleysen",
"fullName": "Michel Verleysen",
"affiliation": "Microelectronic Laboratory, Place du Levant 3, B-1348 Louvain-la-Neuve, Belgium",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2007-07-01 00:00:00",
"pubType": "trans",
"pages": "873-886",
"year": "2007",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fskd/2008/3305/4/3305d076",
"title": "Methods of Chlorophyll Concentration Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2008/3305d076/12OmNBTawo0",
"parentPublication": {
"id": "proceedings/fskd/2008/3305/4",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icscse/2016/5530/0/5530a636",
"title": "Retracted: The Effects of Fountain on Negative Air Ions Concentration",
"doi": null,
"abstractUrl": "/proceedings-article/icscse/2016/5530a636/12OmNBWi6Nf",
"parentPublication": {
"id": "proceedings/icscse/2016/5530/0",
"title": "2016 International Conference on Smart City and Systems Engineering (ICSCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04760937",
"title": "3. Similarity searching: Indexing, nearest neighbor finding, dimensionality reduction, and embedding methods for applications in multimedia databases",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04760937/12OmNwnH4UD",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmecg/2010/8507/0/05628568",
"title": "PAR: Partition-Annotate-Recommend Paradigm for Improved Accessibility in Digital Libraries",
"doi": null,
"abstractUrl": "/proceedings-article/icmecg/2010/05628568/12OmNyxXliw",
"parentPublication": {
"id": "proceedings/icmecg/2010/8507/0",
"title": "2010 Fourth International Conference on Management of E-Commerce and E-Government (ICMeCG 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2003/7983/0/01227559",
"title": "Early-halting criteria for instance-based learning",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2003/01227559/12OmNzayNjf",
"parentPublication": {
"id": "proceedings/aiccsa/2003/7983/0",
"title": "ACS/IEEE International Conference on Computer Systems and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2008/2153/0/04813360",
"title": "Facial feature localization usingweighted vector concentration approach",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2008/04813360/12OmNzsJ7Fv",
"parentPublication": {
"id": "proceedings/fg/2008/2153/0",
"title": "2008 8th IEEE International Conference on Automatic Face & Gesture Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2000/06/i0583",
"title": "Classification with Nonmetric Distances: Image Retrieval and Class Representation",
"doi": null,
"abstractUrl": "/journal/tp/2000/06/i0583/13rRUNvyaa5",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2006/09/k1239",
"title": "Reverse Nearest Neighbor Search in Metric Spaces",
"doi": null,
"abstractUrl": "/journal/tk/2006/09/k1239/13rRUNvyafn",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/02/07723906",
"title": "Measuring Concentration of Distances—An Effective and Efficient Empirical Index",
"doi": null,
"abstractUrl": "/journal/tk/2017/02/07723906/13rRUwI5Ugw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2012/12/ttp2012122481",
"title": "A Fast Approximate Nearest Neighbor Search Algorithm in the Hamming Space",
"doi": null,
"abstractUrl": "/journal/tp/2012/12/ttp2012122481/13rRUxCitKz",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "k0887",
"articleId": "13rRUxly8XQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwdbUZ4",
"title": "Oct.",
"year": "2017",
"issueNum": "10",
"idPrefix": "td",
"pubType": "journal",
"volume": "28",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdrdSk",
"doi": "10.1109/TPDS.2017.2696942",
"abstract": "Computing clouds have become the platform of choice for the deployment and execution of scientific workflows. Due to the uncertainty and unpredictability of scientific exploration, the execution plan for a scientific workflow may vary from the definition. It is therefore of great significance to be able to discover actual workflows from execution histories (event logs) to reproduce experimental results and to establish provenance. However, most existing process mining techniques focus on discovering control flow-oriented business processes in a centralized environment, and thus, they are mostly inapplicable to the discovery of data flow-oriented, unstructured scientific workflows in distributed cloud environments. In this paper, we present Scientific Workflow Mining as a Service ( Z_${\\sf {SWMaaS}}$_Z ) to support both intra-cloud and inter-cloud scientific workflow mining. The approach is implemented as a Z_${\\sf {ProM}}$_Z plug-in and is evaluated on event logs derived from real-world scientific workflows. Through experimental results, we demonstrate the effectiveness and efficiency of our approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computing clouds have become the platform of choice for the deployment and execution of scientific workflows. Due to the uncertainty and unpredictability of scientific exploration, the execution plan for a scientific workflow may vary from the definition. It is therefore of great significance to be able to discover actual workflows from execution histories (event logs) to reproduce experimental results and to establish provenance. However, most existing process mining techniques focus on discovering control flow-oriented business processes in a centralized environment, and thus, they are mostly inapplicable to the discovery of data flow-oriented, unstructured scientific workflows in distributed cloud environments. In this paper, we present Scientific Workflow Mining as a Service ( ${\\sf {SWMaaS}}$ ) to support both intra-cloud and inter-cloud scientific workflow mining. The approach is implemented as a ${\\sf {ProM}}$ plug-in and is evaluated on event logs derived from real-world scientific workflows. Through experimental results, we demonstrate the effectiveness and efficiency of our approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computing clouds have become the platform of choice for the deployment and execution of scientific workflows. Due to the uncertainty and unpredictability of scientific exploration, the execution plan for a scientific workflow may vary from the definition. It is therefore of great significance to be able to discover actual workflows from execution histories (event logs) to reproduce experimental results and to establish provenance. However, most existing process mining techniques focus on discovering control flow-oriented business processes in a centralized environment, and thus, they are mostly inapplicable to the discovery of data flow-oriented, unstructured scientific workflows in distributed cloud environments. In this paper, we present Scientific Workflow Mining as a Service ( - ) to support both intra-cloud and inter-cloud scientific workflow mining. The approach is implemented as a - plug-in and is evaluated on event logs derived from real-world scientific workflows. Through experimental results, we demonstrate the effectiveness and efficiency of our approach.",
"title": "Scientific Workflow Mining in Clouds",
"normalizedTitle": "Scientific Workflow Mining in Clouds",
"fno": "07907335",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Business",
"Process Control",
"Data Mining",
"Petri Nets",
"Electronic Mail",
"Optimization",
"PROM",
"Scientific Workflow",
"Inter Cloud",
"Workflow Mining",
"Event Log",
"Direct Precedence"
],
"authors": [
{
"givenName": "Wei",
"surname": "Song",
"fullName": "Wei Song",
"affiliation": "School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fangfei",
"surname": "Chen",
"fullName": "Fangfei Chen",
"affiliation": "School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Arno",
"surname": "Jacobsen",
"fullName": "Hans-Arno Jacobsen",
"affiliation": "Middleware Systems Research Group, University of Toronto, Toronto, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoxu",
"surname": "Xia",
"fullName": "Xiaoxu Xia",
"affiliation": "School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chunyang",
"surname": "Ye",
"fullName": "Chunyang Ye",
"affiliation": "College of Information Science and Technology, Hainan University, Haikou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaoxing",
"surname": "Ma",
"fullName": "Xiaoxing Ma",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2017-10-01 00:00:00",
"pubType": "trans",
"pages": "2979-2992",
"year": "2017",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/gpc-workshops/2008/3177/0/3177a081",
"title": "Design of a Petri Net-Based Workflow Engine",
"doi": null,
"abstractUrl": "/proceedings-article/gpc-workshops/2008/3177a081/12OmNBOCWc6",
"parentPublication": {
"id": "proceedings/gpc-workshops/2008/3177/0",
"title": "GPC Workshops - 2008 3rd International Conference on Grid and Pervasive Computing Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2015/7587/0/7587a520",
"title": "Executing Large Scale Scientific Workflow Ensembles in Public Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2015/7587a520/12OmNvkpkTr",
"parentPublication": {
"id": "proceedings/icpp/2015/7587/0",
"title": "2015 44th International Conference on Parallel Processing (ICPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2016/2675/0/2675a694",
"title": "Layer-Hierarchical Scientific Workflow Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2016/2675a694/12OmNvkplkb",
"parentPublication": {
"id": "proceedings/icws/2016/2675/0",
"title": "2016 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2012/4467/0/06404435",
"title": "Service-based integration of human users in workflow-driven scientific experiments",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2012/06404435/12OmNweTvNa",
"parentPublication": {
"id": "proceedings/e-science/2012/4467/0",
"title": "2012 IEEE 8th International Conference on E-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa/2009/3747/0/3747a635",
"title": "Change Sequence Mining in Context-Aware Scientific Workflow",
"doi": null,
"abstractUrl": "/proceedings-article/ispa/2009/3747a635/12OmNxwncFn",
"parentPublication": {
"id": "proceedings/ispa/2009/3747/0",
"title": "2009 IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e-science/2016/4273/0/07870888",
"title": "A framework for scientific workflow reproducibility in the cloud",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2016/07870888/12OmNy2agWe",
"parentPublication": {
"id": "proceedings/e-science/2016/4273/0",
"title": "2016 IEEE 12th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/services/2011/4461/0/4461a169",
"title": "A Method to Mine Workflows from Provenance for Assisting Scientific Workflow Composition",
"doi": null,
"abstractUrl": "/proceedings-article/services/2011/4461a169/12OmNyjLoSI",
"parentPublication": {
"id": "proceedings/services/2011/4461/0",
"title": "2011 IEEE World Congress on Services",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2018/7250/0/725001a291",
"title": "Dynamic Resource Provisioning for Scientific Workflow Executions in Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2018/725001a291/13rRUwvT9e7",
"parentPublication": {
"id": "proceedings/scc/2018/7250/0",
"title": "2018 IEEE International Conference on Services Computing (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2018/01/07434639",
"title": "Scientific Workflow Clustering and Recommendation Leveraging Layer Hierarchical Analysis",
"doi": null,
"abstractUrl": "/journal/sc/2018/01/07434639/13rRUxNEqMV",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/12/08734698",
"title": "Scientific Workflow Protocol Discovery from Public Event Logs in Clouds",
"doi": null,
"abstractUrl": "/journal/tk/2020/12/08734698/1aM8TTL02xG",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07896612",
"articleId": "13rRUyeTVhP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07920399",
"articleId": "13rRUwgyOj1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1CpcG1DISYM",
"title": "May",
"year": "2022",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1B0XZrABGk8",
"doi": "10.1109/TVCG.2022.3150486",
"abstract": "The visual depth perception is composed of monocular and binocular depth cues. Studies show that in absence of binocular depth cues the performance of visuomotor tasks like pointing to or grasping objects is limited. Thus, binocular depth cues are of great importance for motor control required in everyday life. However, binocular depth cues like retinal disparity (basis for stereopsis) might be influenced due to developmental disorders of the visual system. For example, amblyopia in which one eye's visual input is not processed leads to loss of stereopsis. The primary amblyopia treatment is occlusion of the healthy eye to force the amblyopic eye to train. However, improvements in stereopsis are poor. Therefore, binocular treatments arose that equilibrate both eyes' visual input to enable binocular vision. However, most approaches rely on divided stimuli which do not account for loss of stereopsis. We created a Virtual Reality (VR) with reduced monocular depth cues in which a stereoscopic task is shown to both eyes simultaneously, consisting of two balls jumping towards the user. One ball appears closer to the user which must be identified. To evaluate the task performance the reaction time is measured. We validated our approach with 18 participants with stereopsis under three contrast settings including one leading to monocular vision. The number of correct responses reduces from 90% under binocular vision to 52% under monocular vision corresponding to random guessing. Our results indicate that it is possible to disable monocular depth cues and create a dynamic stereoscopic task inside a VR.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The visual depth perception is composed of monocular and binocular depth cues. Studies show that in absence of binocular depth cues the performance of visuomotor tasks like pointing to or grasping objects is limited. Thus, binocular depth cues are of great importance for motor control required in everyday life. However, binocular depth cues like retinal disparity (basis for stereopsis) might be influenced due to developmental disorders of the visual system. For example, amblyopia in which one eye's visual input is not processed leads to loss of stereopsis. The primary amblyopia treatment is occlusion of the healthy eye to force the amblyopic eye to train. However, improvements in stereopsis are poor. Therefore, binocular treatments arose that equilibrate both eyes' visual input to enable binocular vision. However, most approaches rely on divided stimuli which do not account for loss of stereopsis. We created a Virtual Reality (VR) with reduced monocular depth cues in which a stereoscopic task is shown to both eyes simultaneously, consisting of two balls jumping towards the user. One ball appears closer to the user which must be identified. To evaluate the task performance the reaction time is measured. We validated our approach with 18 participants with stereopsis under three contrast settings including one leading to monocular vision. The number of correct responses reduces from 90% under binocular vision to 52% under monocular vision corresponding to random guessing. Our results indicate that it is possible to disable monocular depth cues and create a dynamic stereoscopic task inside a VR.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The visual depth perception is composed of monocular and binocular depth cues. Studies show that in absence of binocular depth cues the performance of visuomotor tasks like pointing to or grasping objects is limited. Thus, binocular depth cues are of great importance for motor control required in everyday life. However, binocular depth cues like retinal disparity (basis for stereopsis) might be influenced due to developmental disorders of the visual system. For example, amblyopia in which one eye's visual input is not processed leads to loss of stereopsis. The primary amblyopia treatment is occlusion of the healthy eye to force the amblyopic eye to train. However, improvements in stereopsis are poor. Therefore, binocular treatments arose that equilibrate both eyes' visual input to enable binocular vision. However, most approaches rely on divided stimuli which do not account for loss of stereopsis. We created a Virtual Reality (VR) with reduced monocular depth cues in which a stereoscopic task is shown to both eyes simultaneously, consisting of two balls jumping towards the user. One ball appears closer to the user which must be identified. To evaluate the task performance the reaction time is measured. We validated our approach with 18 participants with stereopsis under three contrast settings including one leading to monocular vision. The number of correct responses reduces from 90% under binocular vision to 52% under monocular vision corresponding to random guessing. Our results indicate that it is possible to disable monocular depth cues and create a dynamic stereoscopic task inside a VR.",
"title": "Stereopsis Only: Validation of a Monocular Depth Cues Reduced Gamified Virtual Reality with Reaction Time Measurement",
"normalizedTitle": "Stereopsis Only: Validation of a Monocular Depth Cues Reduced Gamified Virtual Reality with Reaction Time Measurement",
"fno": "09714042",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Task Analysis",
"Games",
"Stereo Image Processing",
"Training",
"Headphones",
"Vision Defects",
"Software Verification And Validation",
"Virtual Reality",
"Stereo Vision",
"Visualization Design"
],
"authors": [
{
"givenName": "Wolfgang",
"surname": "Mehringer",
"fullName": "Wolfgang Mehringer",
"affiliation": "Machine Learning and Data Analytics Lab, Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Bavaria, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Wirth",
"fullName": "Markus Wirth",
"affiliation": "Machine Learning and Data Analytics Lab, Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Bavaria, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Roth",
"fullName": "Daniel Roth",
"affiliation": "Human-Centered Computing and Extended Reality, Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Bavaria, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Georg",
"surname": "Michelson",
"fullName": "Georg Michelson",
"affiliation": "Department of Ophthalmology, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Erlangen, Bavaria, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bjoern M",
"surname": "Eskofier",
"fullName": "Bjoern M Eskofier",
"affiliation": "Machine Learning and Data Analytics Lab, Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Bavaria, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2022-05-01 00:00:00",
"pubType": "trans",
"pages": "2114-2124",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icsap/2009/3594/0/05163842",
"title": "3D Reconstruction Using Level-Based Approach in Stereopsis",
"doi": null,
"abstractUrl": "/proceedings-article/icsap/2009/05163842/12OmNAo45Me",
"parentPublication": {
"id": "proceedings/icsap/2009/3594/0",
"title": "Signal Acquisition and Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/058P1B05",
"title": "Leveraging stereopsis for saliency analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/058P1B05/12OmNy50g5B",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1993/3880/0/00341001",
"title": "Stereopsis for verging systems",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341001/12OmNyoAA5e",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2003/1950/2/195021411",
"title": "Binocular Helmholtz Stereopsis",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2003/195021411/12OmNywxlJn",
"parentPublication": {
"id": "proceedings/iccv/2003/1950/2",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/is3c/2016/3071/0/3071a283",
"title": "A Study of Effects of Perceptual Cues on Presence for the Elderly in 3D Virtual Store",
"doi": null,
"abstractUrl": "/proceedings-article/is3c/2016/3071a283/12OmNzUPpta",
"parentPublication": {
"id": "proceedings/is3c/2016/3071/0",
"title": "2016 International Symposium on Computer, Consumer and Control (IS3C)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1995/12/i1213",
"title": "Performance Analysis of Stereo, Vergence, and Focus as Depth Cues for Active Vision",
"doi": null,
"abstractUrl": "/journal/tp/1995/12/i1213/13rRUwcS1DZ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/03/ttg2014030391",
"title": "An Evaluation of Depth Enhancing Perceptual Cues for Vascular Volume Visualization in Neurosurgery",
"doi": null,
"abstractUrl": "/journal/tg/2014/03/ttg2014030391/13rRUxjQybS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600b929",
"title": "ChiTransformer: Towards Reliable Stereo from Cues",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600b929/1H0O034AQuI",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a398",
"title": "Manipulation of Motion Parallax Gain Distorts Perceived Distance and Object Depth in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a398/1MNgwmXTiz6",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2019/3918/0/391800a758",
"title": "The Monocular Stereoscopic Model Based on an Ordered Wave Particle Swarm",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2019/391800a758/1gRxnxuyvDy",
"parentPublication": {
"id": "proceedings/itme/2019/3918/0",
"title": "2019 10th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09714123",
"articleId": "1B0Y0yXxNbG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09714121",
"articleId": "1B0XZ5wr7na",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1CpcYDMaz2E",
"name": "ttg202205-09714042s1-supp2-3150486.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202205-09714042s1-supp2-3150486.mp4",
"extension": "mp4",
"size": "2.3 MB",
"__typename": "WebExtraType"
},
{
"id": "1CpcYI2IIgM",
"name": "ttg202205-09714042s1-supp1-3150486.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202205-09714042s1-supp1-3150486.pdf",
"extension": "pdf",
"size": "948 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1Fp5UcDqu3K",
"doi": "10.1109/TVCG.2022.3195111",
"abstract": "In a future of pervasive augmented reality (AR), AR systems will need to be able to efficiently draw or guide the attention of the user to visual points of interest in their physical-virtual environment. Since AR imagery is overlaid on top of the user's view of their physical environment, these attention guidance techniques must not only compete with other virtual imagery, but also with distracting or attention-grabbing features in the user's physical environment. Because of the wide range of physical-virtual environments that pervasive AR users will find themselves in, it is difficult to design visual cues that “pop out” to the user without performing a visual analysis of the user's environment, and changing the appearance of the cue to stand out from its surroundings. In this paper, we present an initial investigation into the potential uses of dichoptic visual cues for optical see-through AR displays, specifically cues that involve having a difference in hue, saturation, or value between the user's eyes. These types of cues have been shown to be preattentively processed by the user when presented on other stereoscopic displays, and may also be an effective method of drawing user attention on optical see-through AR displays. We present two user studies: one that evaluates the saliency of dichoptic visual cues on optical see-through displays, and one that evaluates their subjective qualities. Our results suggest that hue-based dichoptic cues or “Forbidden Colors” may be particularly effective for these purposes, achieving significantly lower error rates in a pop out task compared to value-based and saturation-based cues.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In a future of pervasive augmented reality (AR), AR systems will need to be able to efficiently draw or guide the attention of the user to visual points of interest in their physical-virtual environment. Since AR imagery is overlaid on top of the user's view of their physical environment, these attention guidance techniques must not only compete with other virtual imagery, but also with distracting or attention-grabbing features in the user's physical environment. Because of the wide range of physical-virtual environments that pervasive AR users will find themselves in, it is difficult to design visual cues that “pop out” to the user without performing a visual analysis of the user's environment, and changing the appearance of the cue to stand out from its surroundings. In this paper, we present an initial investigation into the potential uses of dichoptic visual cues for optical see-through AR displays, specifically cues that involve having a difference in hue, saturation, or value between the user's eyes. These types of cues have been shown to be preattentively processed by the user when presented on other stereoscopic displays, and may also be an effective method of drawing user attention on optical see-through AR displays. We present two user studies: one that evaluates the saliency of dichoptic visual cues on optical see-through displays, and one that evaluates their subjective qualities. Our results suggest that hue-based dichoptic cues or “Forbidden Colors” may be particularly effective for these purposes, achieving significantly lower error rates in a pop out task compared to value-based and saturation-based cues.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In a future of pervasive augmented reality (AR), AR systems will need to be able to efficiently draw or guide the attention of the user to visual points of interest in their physical-virtual environment. Since AR imagery is overlaid on top of the user's view of their physical environment, these attention guidance techniques must not only compete with other virtual imagery, but also with distracting or attention-grabbing features in the user's physical environment. Because of the wide range of physical-virtual environments that pervasive AR users will find themselves in, it is difficult to design visual cues that “pop out” to the user without performing a visual analysis of the user's environment, and changing the appearance of the cue to stand out from its surroundings. In this paper, we present an initial investigation into the potential uses of dichoptic visual cues for optical see-through AR displays, specifically cues that involve having a difference in hue, saturation, or value between the user's eyes. These types of cues have been shown to be preattentively processed by the user when presented on other stereoscopic displays, and may also be an effective method of drawing user attention on optical see-through AR displays. We present two user studies: one that evaluates the saliency of dichoptic visual cues on optical see-through displays, and one that evaluates their subjective qualities. Our results suggest that hue-based dichoptic cues or “Forbidden Colors” may be particularly effective for these purposes, achieving significantly lower error rates in a pop out task compared to value-based and saturation-based cues.",
"title": "Analysis of the Saliency of Color-Based Dichoptic Cues in Optical See-Through Augmented Reality",
"normalizedTitle": "Analysis of the Saliency of Color-Based Dichoptic Cues in Optical See-Through Augmented Reality",
"fno": "09844860",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Task Analysis",
"Observers",
"Image Color Analysis",
"Optical Saturation",
"Optical Imaging",
"Color",
"Augmented Reality",
"Optical See Through Displays",
"Visual Perception",
"Attention Cues",
"Preattentive Cues",
"Dichoptic Cues",
"Human Computer Interaction HCI"
],
"authors": [
{
"givenName": "Austin",
"surname": "Erickson",
"fullName": "Austin Erickson",
"affiliation": "University of Central Florida, Orlando, FL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gerd",
"surname": "Bruder",
"fullName": "Gerd Bruder",
"affiliation": "University of Central Florida, Orlando, FL, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gregory F.",
"surname": "Welch",
"fullName": "Gregory F. Welch",
"affiliation": "University of Central Florida, Orlando, FL, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-07-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2015/11/07165643",
"title": "Semi-Parametric Color Reproduction Method for Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/journal/tg/2015/11/07165643/13rRUILtJzB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/04/08302393",
"title": "Driver Behavior and Performance with Augmented Reality Pedestrian Collision Warning: An Outdoor User Study",
"doi": null,
"abstractUrl": "/journal/tg/2018/04/08302393/13rRUwInvJm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a213",
"title": "Evaluating Visual Cues for Future Airborne Surveillance Using Simulated Augmented Reality Displays",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a213/1CJbS2QCX5e",
"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/840200a800",
"title": "Add-on Occlusion: An External Module for Optical See-through Augmented Reality Displays to Support Mutual Occlusion",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a800/1CJeADcapNK",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a352",
"title": "Effects of Optical See-Through Displays on Self-Avatar Appearance in Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a352/1J7WodvTPzy",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2022/5365/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a389",
"title": "Objective Measurements of Background Color Shifts Caused by Optical See-Through Head-Mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a389/1J7WuL68jAY",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2022/5365/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10077744",
"title": "A Comparative Evaluation of Optical See-through Augmented Reality in Surgical Guidance",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10077744/1LH8EZ3NEGI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/11/08827571",
"title": "Varifocal Occlusion-Capable Optical See-through Augmented Reality Display based on Focus-tunable Optics",
"doi": null,
"abstractUrl": "/journal/tg/2019/11/08827571/1dgvaPxmhbi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/08/09293392",
"title": "A Perceptual Color-Matching Method for Examining Color Blending in Augmented Reality Head-Up Display Graphics",
"doi": null,
"abstractUrl": "/journal/tg/2022/08/09293392/1pyomiXbJQs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a115",
"title": "Perceived Transparency in Optical See-Through Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a115/1yeQLPBHFBe",
"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": "09839681",
"articleId": "1FisL8u19du",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09845414",
"articleId": "1Fu4IsDCz72",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Fu4I7GI7TO",
"name": "ttg555501-09844860s1-supp1-3195111.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-09844860s1-supp1-3195111.mp4",
"extension": "mp4",
"size": "56.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRf",
"title": "Sept.",
"year": "2015",
"issueNum": "09",
"idPrefix": "tc",
"pubType": "journal",
"volume": "64",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILc8eC",
"doi": "10.1109/TC.2014.2366731",
"abstract": "This paper presents a sparse matrix partitioning strategy to improve the performance of SpMV on GPUs and multicore CPUs. This method has wide adaptability for different types of sparse matrices, and is different from existing methods which only adapt to some particular sparse matrices. In addition, our partitioning method can obtain dense blocks by analyzing the probability distribution of non-zero elements in a sparse matrix, and result in very low proportion of zero padded. We make the following significant contributions. (1) We present a partitioning strategy of sparse matrices based on probabilistic modeling of non-zero elements in a row. (2) We prove that our method has the highest mean density compared with other strategies according to certain given ratios of partition obtained from the computing powers of heterogeneous processors. (3) We develop a CPU-GPU hybrid parallel computing model for SpMV on GPUs and multicore CPUs in a heterogeneous computing platform. Our partitioning strategy has balanced load distribution and the performance of SpMV is significantly improved when a sparse matrix is partitioned into dense blocks using our method. The average performance improvement of our solution for SpMV is about 15.75 percent on multicore CPUs, compared to that of the other solutions. By considering the rows of a matrix in a unique order based on the probability mass function of the number of non-zeros in a row, the average performance improvement of our solution for SpMV is about 33.52 percent on GPUs and multicore CPUs of a heterogeneous computing platform, compared to that of the partitioning methods based on the original row order of a matrix.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a sparse matrix partitioning strategy to improve the performance of SpMV on GPUs and multicore CPUs. This method has wide adaptability for different types of sparse matrices, and is different from existing methods which only adapt to some particular sparse matrices. In addition, our partitioning method can obtain dense blocks by analyzing the probability distribution of non-zero elements in a sparse matrix, and result in very low proportion of zero padded. We make the following significant contributions. (1) We present a partitioning strategy of sparse matrices based on probabilistic modeling of non-zero elements in a row. (2) We prove that our method has the highest mean density compared with other strategies according to certain given ratios of partition obtained from the computing powers of heterogeneous processors. (3) We develop a CPU-GPU hybrid parallel computing model for SpMV on GPUs and multicore CPUs in a heterogeneous computing platform. Our partitioning strategy has balanced load distribution and the performance of SpMV is significantly improved when a sparse matrix is partitioned into dense blocks using our method. The average performance improvement of our solution for SpMV is about 15.75 percent on multicore CPUs, compared to that of the other solutions. By considering the rows of a matrix in a unique order based on the probability mass function of the number of non-zeros in a row, the average performance improvement of our solution for SpMV is about 33.52 percent on GPUs and multicore CPUs of a heterogeneous computing platform, compared to that of the partitioning methods based on the original row order of a matrix.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a sparse matrix partitioning strategy to improve the performance of SpMV on GPUs and multicore CPUs. This method has wide adaptability for different types of sparse matrices, and is different from existing methods which only adapt to some particular sparse matrices. In addition, our partitioning method can obtain dense blocks by analyzing the probability distribution of non-zero elements in a sparse matrix, and result in very low proportion of zero padded. We make the following significant contributions. (1) We present a partitioning strategy of sparse matrices based on probabilistic modeling of non-zero elements in a row. (2) We prove that our method has the highest mean density compared with other strategies according to certain given ratios of partition obtained from the computing powers of heterogeneous processors. (3) We develop a CPU-GPU hybrid parallel computing model for SpMV on GPUs and multicore CPUs in a heterogeneous computing platform. Our partitioning strategy has balanced load distribution and the performance of SpMV is significantly improved when a sparse matrix is partitioned into dense blocks using our method. The average performance improvement of our solution for SpMV is about 15.75 percent on multicore CPUs, compared to that of the other solutions. By considering the rows of a matrix in a unique order based on the probability mass function of the number of non-zeros in a row, the average performance improvement of our solution for SpMV is about 33.52 percent on GPUs and multicore CPUs of a heterogeneous computing platform, compared to that of the partitioning methods based on the original row order of a matrix.",
"title": "Performance Optimization Using Partitioned SpMV on GPUs and Multicore CPUs",
"normalizedTitle": "Performance Optimization Using Partitioned SpMV on GPUs and Multicore CPUs",
"fno": "06965639",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Sparse Matrices",
"Multicore Processing",
"Program Processors",
"Partitioning Algorithms",
"Computational Modeling",
"Vectors",
"Sparse Matrix Vector Multiplication",
"GPU",
"Matrix Partition",
"Multicore CPU",
"Probability Distribution"
],
"authors": [
{
"givenName": "Wangdong",
"surname": "Yang",
"fullName": "Wangdong Yang",
"affiliation": "College of Information Science and Engineering, Hunan University, Hunan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenli",
"surname": "Li",
"fullName": "Kenli Li",
"affiliation": "College of Information Science and Engineering, Hunan University, Hunan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zeyao",
"surname": "Mo",
"fullName": "Zeyao Mo",
"affiliation": "Institute of Applied Physics and Computational Mathematics, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Keqin",
"surname": "Li",
"fullName": "Keqin Li",
"affiliation": "College of Information Science and Engineering, Hunan University, Changsha, Hunan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2015-09-01 00:00:00",
"pubType": "trans",
"pages": "2623-2636",
"year": "2015",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hipc/2014/5976/0/07116882",
"title": "A multilevel compressed sparse row format for efficient sparse computations on multicore processors",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2014/07116882/12OmNAOsMKh",
"parentPublication": {
"id": "proceedings/hipc/2014/5976/0",
"title": "2014 21st International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2018/5555/0/555501b056",
"title": "Effective Machine Learning Based Format Selection and Performance Modeling for SpMV on GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2018/555501b056/12OmNvDI3Kv",
"parentPublication": {
"id": "proceedings/ipdpsw/2018/5555/0",
"title": "2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2015/7684/0/7684b125",
"title": "Semi-two-dimensional Partitioning for Parallel Sparse Matrix-Vector Multiplication",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2015/7684b125/12OmNwtEEAv",
"parentPublication": {
"id": "proceedings/ipdpsw/2015/7684/0",
"title": "2015 IEEE International Parallel and Distributed Processing Symposium Workshop (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2015/8488/0/8488a064",
"title": "Structural Agnostic SpMV: Adapting CSR-Adaptive for Irregular Matrices",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2015/8488a064/12OmNx3HI62",
"parentPublication": {
"id": "proceedings/hipc/2015/8488/0",
"title": "2015 IEEE 22nd International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mucocos/2013/1010/0/06633600",
"title": "Optimizing sparse matrix vector multiplication on emerging multicores",
"doi": null,
"abstractUrl": "/proceedings-article/mucocos/2013/06633600/12OmNxxdZFN",
"parentPublication": {
"id": "proceedings/mucocos/2013/1010/0",
"title": "2013 IEEE 6th International Workshop on Multi-/Many-core Computing Systems (MuCoCoS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mcsoc/2014/4305/0/4305a253",
"title": "Performance Optimization of SpMV Using CRS Format by Considering OpenMP Scheduling on CPUs and MIC",
"doi": null,
"abstractUrl": "/proceedings-article/mcsoc/2014/4305a253/12OmNyeECvK",
"parentPublication": {
"id": "proceedings/mcsoc/2014/4305/0",
"title": "2014 IEEE 8th International Symposium on Embedded Multicore/Manycore SoCs (MCSoC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2013/4971/0/4971a273",
"title": "Improving the Performance of the Symmetric Sparse Matrix-Vector Multiplication in Multicore",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2013/4971a273/12OmNzBwGAc",
"parentPublication": {
"id": "proceedings/ipdps/2013/4971/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2020/7445/0/09150338",
"title": "Scalability of Sparse Matrix Dense Vector Multiply (SpMV) on a Migrating Thread Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2020/09150338/1lPGzqv4Axy",
"parentPublication": {
"id": "proceedings/ipdpsw/2020/7445/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2021/07/09268964",
"title": "Adaptive SpMV/SpMSpV on GPUs for Input Vectors of Varied Sparsity",
"doi": null,
"abstractUrl": "/journal/td/2021/07/09268964/1p1dgq6HE8E",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgo/2021/8613/0/09370327",
"title": "Variable-Sized Blocks for Locality-Aware SpMV",
"doi": null,
"abstractUrl": "/proceedings-article/cgo/2021/09370327/1rSR4ZZKZ3i",
"parentPublication": {
"id": "proceedings/cgo/2021/8613/0",
"title": "2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06967751",
"articleId": "13rRUyuegoq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06945889",
"articleId": "13rRUxASuzX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet1G",
"name": "ttc201509-06965639s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttc201509-06965639s1.zip",
"extension": "zip",
"size": "255 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1ua08UveJMI",
"title": "April-June",
"year": "2021",
"issueNum": "02",
"idPrefix": "cc",
"pubType": "journal",
"volume": "9",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14PnyHVF0xq",
"doi": "10.1109/TCC.2018.2878838",
"abstract": "In the parallel computing framework of Hadoop/Spark, data skew is a common problem resulting in performance degradation, such as prolonging of the entire execution time and idle resources. What lies behind this issue is the partition imbalance, that causes significant differences in the amount of data processed by each reduce task. This paper proposes a key reassigning and splitting partition algorithm (SKRSP) to solve the partition skew from the source codes of Spark-core_2.11 project, which considers both the partition balance of the intermediate data and the partition balance after shuffle operators. First, we propose a step-based algorithm for sampling the input data to estimate the general key distribution of entire intermediate data. According to the types of the specific applications, we design two algorithms: hash based key reassigning algorithm (KRHP) and rang based key splitting algorithm (KSRP), which can generate appropriate strategy and implement the skew mitigation in shuffle phase. KKSRP generates the weighted bounds to split intermediate data for the type of sort-based applications while KRHP records these reassigned keys and the new reducers these keys belong to for other applications. Finally, we implement SKRSP in Spark 2.2.0 and evaluate its performance through four benchmarks exhibiting significant data skew: WordCount, Sort, Join, and PageRank. The experimental results verify that our algorithm not only can achieve a better partition balance but also reduce the execution time of reduce tasks effectively.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the parallel computing framework of Hadoop/Spark, data skew is a common problem resulting in performance degradation, such as prolonging of the entire execution time and idle resources. What lies behind this issue is the partition imbalance, that causes significant differences in the amount of data processed by each reduce task. This paper proposes a key reassigning and splitting partition algorithm (SKRSP) to solve the partition skew from the source codes of Spark-core_2.11 project, which considers both the partition balance of the intermediate data and the partition balance after shuffle operators. First, we propose a step-based algorithm for sampling the input data to estimate the general key distribution of entire intermediate data. According to the types of the specific applications, we design two algorithms: hash based key reassigning algorithm (KRHP) and rang based key splitting algorithm (KSRP), which can generate appropriate strategy and implement the skew mitigation in shuffle phase. KKSRP generates the weighted bounds to split intermediate data for the type of sort-based applications while KRHP records these reassigned keys and the new reducers these keys belong to for other applications. Finally, we implement SKRSP in Spark 2.2.0 and evaluate its performance through four benchmarks exhibiting significant data skew: WordCount, Sort, Join, and PageRank. The experimental results verify that our algorithm not only can achieve a better partition balance but also reduce the execution time of reduce tasks effectively.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the parallel computing framework of Hadoop/Spark, data skew is a common problem resulting in performance degradation, such as prolonging of the entire execution time and idle resources. What lies behind this issue is the partition imbalance, that causes significant differences in the amount of data processed by each reduce task. This paper proposes a key reassigning and splitting partition algorithm (SKRSP) to solve the partition skew from the source codes of Spark-core_2.11 project, which considers both the partition balance of the intermediate data and the partition balance after shuffle operators. First, we propose a step-based algorithm for sampling the input data to estimate the general key distribution of entire intermediate data. According to the types of the specific applications, we design two algorithms: hash based key reassigning algorithm (KRHP) and rang based key splitting algorithm (KSRP), which can generate appropriate strategy and implement the skew mitigation in shuffle phase. KKSRP generates the weighted bounds to split intermediate data for the type of sort-based applications while KRHP records these reassigned keys and the new reducers these keys belong to for other applications. Finally, we implement SKRSP in Spark 2.2.0 and evaluate its performance through four benchmarks exhibiting significant data skew: WordCount, Sort, Join, and PageRank. The experimental results verify that our algorithm not only can achieve a better partition balance but also reduce the execution time of reduce tasks effectively.",
"title": "An Intermediate Data Partition Algorithm for Skew Mitigation in Spark Computing Environment",
"normalizedTitle": "An Intermediate Data Partition Algorithm for Skew Mitigation in Spark Computing Environment",
"fno": "08516368",
"hasPdf": true,
"idPrefix": "cc",
"keywords": [
"Cluster Computing",
"Estimation Theory",
"File Organisation",
"Parallel Processing",
"Resource Allocation",
"Sorting",
"Source Code Software",
"Performance Degradation",
"Partition Imbalance",
"Splitting Partition Algorithm",
"Partition Skew",
"Step Based Algorithm",
"Hash Based Key Reassigning Algorithm",
"Key Splitting Algorithm",
"Skew Mitigation",
"Sort Based Applications",
"Data Skew",
"Intermediate Data Partition Algorithm",
"Spark Computing Environment",
"Parallel Computing Framework",
"Source Codes",
"Spark Core 2 11 Project",
"General Key Distribution Estimation",
"Spark 2 2 0",
"Hadoop",
"Partitioning Algorithms",
"Sparks",
"Task Analysis",
"Clustering Algorithms",
"Indexes",
"Approximation Algorithms",
"Cloud Computing",
"Data Sampling",
"Data Skew",
"Map Reduce",
"Partition",
"Spark"
],
"authors": [
{
"givenName": "Zhuo",
"surname": "Tang",
"fullName": "Zhuo Tang",
"affiliation": "College of Information Science and Engineering, National Supercomputing Center in Changsha, Hunan University, Changsha, Hunan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Lv",
"fullName": "Wei Lv",
"affiliation": "College of Information Science and Engineering, National Supercomputing Center in Changsha, Hunan University, Changsha, Hunan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenli",
"surname": "Li",
"fullName": "Kenli Li",
"affiliation": "College of Information Science and Engineering, National Supercomputing Center in Changsha, Hunan University, Changsha, Hunan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Keqin",
"surname": "Li",
"fullName": "Keqin Li",
"affiliation": "College of Information Science and Engineering, National Supercomputing Center in Changsha, Hunan University, Changsha, Hunan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-04-01 00:00:00",
"pubType": "trans",
"pages": "461-474",
"year": "2021",
"issn": "2168-7161",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ic2e/2016/1961/0/1961a222",
"title": "Exploring GPU Acceleration of Apache Spark",
"doi": null,
"abstractUrl": "/proceedings-article/ic2e/2016/1961a222/12OmNCzKlLZ",
"parentPublication": {
"id": "proceedings/ic2e/2016/1961/0",
"title": "2016 IEEE International Conference on Cloud Engineering (IC2E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2016/4320/0/07945631",
"title": "A scalable maximum-clique algorithm using Apache Spark",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945631/12OmNyaGeJp",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipccc/2017/6468/0/08280475",
"title": "Mitigate data skew caused stragglers through ImKP partition in MapReduce",
"doi": null,
"abstractUrl": "/proceedings-article/ipccc/2017/08280475/12OmNz4SOBY",
"parentPublication": {
"id": "proceedings/ipccc/2017/6468/0",
"title": "2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc-scalcom-cbdcom-iop-smartworld/2016/2771/0/07816911",
"title": "ETSCH: Partition-Centric Graph Processing",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom-cbdcom-iop-smartworld/2016/07816911/12OmNzWfoYi",
"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/aina/2017/6029/0/07920992",
"title": "Smart Partitioning Mechanism for Dealing with Intermediate Data Skew in Reduce Task on Cloud Computing",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2017/07920992/12OmNzcxZnx",
"parentPublication": {
"id": "proceedings/aina/2017/6029/0",
"title": "2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2017/2588/0/08291983",
"title": "A Study of Distributed MOEA/D Based on Spark Framework",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2017/08291983/17D45WaTkmI",
"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": "proceedings/hpcc-smartcity-dss/2018/6614/0/661400b213",
"title": "A Spark-Based Artificial Bee Colony Algorithm for Large-Scale Data Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2018/661400b213/183rAf23hJK",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2018/6614/0",
"title": "2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2021/0878/0/087800a556",
"title": "BSDP: A Novel Balanced Spark Data Partitioner",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2021/087800a556/1D4M1fD6Mrm",
"parentPublication": {
"id": "proceedings/icpads/2021/0878/0",
"title": "2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cipae/2020/8223/0/822300a217",
"title": "An Algorithm of Data Skew in Spark Based on Partition",
"doi": null,
"abstractUrl": "/proceedings-article/cipae/2020/822300a217/1rSRhEXapqM",
"parentPublication": {
"id": "proceedings/cipae/2020/8223/0",
"title": "2020 International Conference on Computers, Information Processing and Advanced Education (CIPAE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2020/9074/0/907400a466",
"title": "SrSpark: Skew-resilient Spark based on Adaptive Parallel Processing",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2020/907400a466/1rvCsnWxDry",
"parentPublication": {
"id": "proceedings/icpads/2020/9074/0",
"title": "2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08526339",
"articleId": "17D45WgziP7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08438964",
"articleId": "13rRUwwslBI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1JP1e1gAvYY",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vyjfa8fzPi",
"doi": "10.1109/TKDE.2021.3097998",
"abstract": "Graph computations often have to be conducted in parallel on partitioned graphs. The choice of graph partitioning strategies, however, has strong impact on the design of graph computation algorithms. A graph algorithm developed under edge-cut partitions may not work correctly under vertex-cut, and vice versa. We often have to rewrite our algorithms when we switch from, e.g., edge-cut to vertex-cut. To cope with this, we propose a notion of <italic>partition transparency</italic>, such that graph algorithms are able to work correctly under different partitions without changes and moreover, benefit from recent hybrid partitions to speed up computations. Furthermore, we identify conditions under which graph algorithms are guaranteed to be partition-transparent, in graph-centric and vertex-centric models. We show that a variety of graph algorithms can be made partition-transparent. Using real-life and synthetic graphs, we experimentally verify that partition-transparent algorithms compute correct answers under different partitions; better still, under hybrid partitions these algorithms perform better than algorithms tailored for edge-cut and vertex-cut partitions in efficiency.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graph computations often have to be conducted in parallel on partitioned graphs. The choice of graph partitioning strategies, however, has strong impact on the design of graph computation algorithms. A graph algorithm developed under edge-cut partitions may not work correctly under vertex-cut, and vice versa. We often have to rewrite our algorithms when we switch from, e.g., edge-cut to vertex-cut. To cope with this, we propose a notion of <italic>partition transparency</italic>, such that graph algorithms are able to work correctly under different partitions without changes and moreover, benefit from recent hybrid partitions to speed up computations. Furthermore, we identify conditions under which graph algorithms are guaranteed to be partition-transparent, in graph-centric and vertex-centric models. We show that a variety of graph algorithms can be made partition-transparent. Using real-life and synthetic graphs, we experimentally verify that partition-transparent algorithms compute correct answers under different partitions; better still, under hybrid partitions these algorithms perform better than algorithms tailored for edge-cut and vertex-cut partitions in efficiency.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graph computations often have to be conducted in parallel on partitioned graphs. The choice of graph partitioning strategies, however, has strong impact on the design of graph computation algorithms. A graph algorithm developed under edge-cut partitions may not work correctly under vertex-cut, and vice versa. We often have to rewrite our algorithms when we switch from, e.g., edge-cut to vertex-cut. To cope with this, we propose a notion of partition transparency, such that graph algorithms are able to work correctly under different partitions without changes and moreover, benefit from recent hybrid partitions to speed up computations. Furthermore, we identify conditions under which graph algorithms are guaranteed to be partition-transparent, in graph-centric and vertex-centric models. We show that a variety of graph algorithms can be made partition-transparent. Using real-life and synthetic graphs, we experimentally verify that partition-transparent algorithms compute correct answers under different partitions; better still, under hybrid partitions these algorithms perform better than algorithms tailored for edge-cut and vertex-cut partitions in efficiency.",
"title": "Graph Algorithms With Partition Transparency",
"normalizedTitle": "Graph Algorithms With Partition Transparency",
"fno": "09495146",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Graph Theory",
"Vertex Functions",
"Edge Cut Partitions",
"Graph Computation Algorithms",
"Graph Computations",
"Graph Partitioning Strategies",
"Graph Centric",
"Hybrid Partitions",
"Partition Transparency",
"Partition Transparent Algorithms",
"Partitioned Graphs",
"Synthetic Graphs",
"Vertex Cut Partitions",
"Partitioning Algorithms",
"Program Processors",
"Image Edge Detection",
"Switches",
"Pipelines",
"Mirrors",
"Heuristic Algorithms",
"Graph Partition",
"Partition Transparency",
"Graph Centric Algorithms",
"Vertex Centric Algorithms"
],
"authors": [
{
"givenName": "Wenfei",
"surname": "Fan",
"fullName": "Wenfei Fan",
"affiliation": "Shenzhen Institute of Computing Sciences, University of Edinburgh, Edinburgh, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Muyang",
"surname": "Liu",
"fullName": "Muyang Liu",
"affiliation": "University of Edinburgh, Edinburgh, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ping",
"surname": "Lu",
"fullName": "Ping Lu",
"affiliation": "SKLSDE, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qiang",
"surname": "Yin",
"fullName": "Qiang Yin",
"affiliation": "Shanghai Jiao Tong University, Shanghai, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1554-1566",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdcsw/2017/3292/0/6173a283",
"title": "Analysis and Evaluation of the GAS Model for Distributed Graph Computation",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2017/6173a283/12OmNAOsMIe",
"parentPublication": {
"id": "proceedings/icdcsw/2017/3292/0",
"title": "2017 IEEE 37th International Conference on Distributed Computing Systems Workshops (ICDCSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2016/1483/0/1483a118",
"title": "GrapH: Heterogeneity-Aware Graph Computation with Adaptive Partitioning",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2016/1483a118/12OmNC4wtBH",
"parentPublication": {
"id": "proceedings/icdcs/2016/1483/0",
"title": "2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2016/5510/0/07881383",
"title": "Comparison of Edge Partitioners for Graph Processing",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2016/07881383/12OmNqJZgBE",
"parentPublication": {
"id": "proceedings/csci/2016/5510/0",
"title": "2016 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpca/2018/3659/0/365901a544",
"title": "GraphP: Reducing Communication for PIM-Based Graph Processing with Efficient Data Partition",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2018/365901a544/12OmNx3ZjjW",
"parentPublication": {
"id": "proceedings/hpca/2018/3659/0",
"title": "2018 IEEE International Symposium on High Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2004/2158/2/01315237",
"title": "Multigrid and multi-level Swendsen-Wang cuts for hierarchic graph partition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315237/12OmNyRg4wC",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/2",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccgrid/2018/5815/0/581501a183",
"title": "AKIN: A Streaming Graph Partitioning Algorithm for Distributed Graph Storage Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ccgrid/2018/581501a183/12OmNzICEEY",
"parentPublication": {
"id": "proceedings/ccgrid/2018/5815/0",
"title": "2018 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1998/8707/0/87070028",
"title": "Multilevel Algorithms for Multi-Constraint Graph Partitioning",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1998/87070028/12OmNzb7ZkD",
"parentPublication": {
"id": "proceedings/sc/1998/8707/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2018/06/08263157",
"title": "GrapH: Traffic-Aware Graph Processing",
"doi": null,
"abstractUrl": "/journal/td/2018/06/08263157/13rRUIM2VGO",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/02/06823116",
"title": "PAGE: A Partition Aware Engine for Parallel Graph Computation",
"doi": null,
"abstractUrl": "/journal/tk/2015/02/06823116/13rRUwInvtd",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2019/2519/0/251900a228",
"title": "Local Graph Edge Partitioning with a Two-Stage Heuristic Method",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2019/251900a228/1ezRSlJW1HO",
"parentPublication": {
"id": "proceedings/icdcs/2019/2519/0",
"title": "2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09511493",
"articleId": "1vYRDs3EK2s",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09501971",
"articleId": "1vDhR4bAKyY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1JP1e1gAvYY",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1v2M06rH6lW",
"doi": "10.1109/TKDE.2021.3095309",
"abstract": "The large volume of open data on the Web is expected to be reused and create value. Finding the right data to reuse is a non-trivial task addressed by the recent dataset search systems, which retrieve datasets relevant to a keyword query. An important component of such systems is snippet generation, extracting data from a retrieved dataset to exemplify its content and explain its relevance to the query. Snippet generation algorithms have emerged but were mainly evaluated by user studies. More efficient and reproducible evaluation methods are needed. To meet this challenge, in this article, we present a set of quality metrics for assessing the usefulness of a snippet from different perspectives, and we select and aggregate them into quality profiles for different stages of a dataset search process. Furthermore, we create a benchmark from thousands of collected real-world data needs and datasets, on which we apply the presented quality metrics and profiles to evaluate snippets generated by two existing algorithms and three adapted algorithms. The results, which are reproducible as they are automatically computed without human interaction, show the pros and cons of the tested algorithms and highlight directions for future research. The benchmark data is publicly available.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The large volume of open data on the Web is expected to be reused and create value. Finding the right data to reuse is a non-trivial task addressed by the recent dataset search systems, which retrieve datasets relevant to a keyword query. An important component of such systems is snippet generation, extracting data from a retrieved dataset to exemplify its content and explain its relevance to the query. Snippet generation algorithms have emerged but were mainly evaluated by user studies. More efficient and reproducible evaluation methods are needed. To meet this challenge, in this article, we present a set of quality metrics for assessing the usefulness of a snippet from different perspectives, and we select and aggregate them into quality profiles for different stages of a dataset search process. Furthermore, we create a benchmark from thousands of collected real-world data needs and datasets, on which we apply the presented quality metrics and profiles to evaluate snippets generated by two existing algorithms and three adapted algorithms. The results, which are reproducible as they are automatically computed without human interaction, show the pros and cons of the tested algorithms and highlight directions for future research. The benchmark data is publicly available.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The large volume of open data on the Web is expected to be reused and create value. Finding the right data to reuse is a non-trivial task addressed by the recent dataset search systems, which retrieve datasets relevant to a keyword query. An important component of such systems is snippet generation, extracting data from a retrieved dataset to exemplify its content and explain its relevance to the query. Snippet generation algorithms have emerged but were mainly evaluated by user studies. More efficient and reproducible evaluation methods are needed. To meet this challenge, in this article, we present a set of quality metrics for assessing the usefulness of a snippet from different perspectives, and we select and aggregate them into quality profiles for different stages of a dataset search process. Furthermore, we create a benchmark from thousands of collected real-world data needs and datasets, on which we apply the presented quality metrics and profiles to evaluate snippets generated by two existing algorithms and three adapted algorithms. The results, which are reproducible as they are automatically computed without human interaction, show the pros and cons of the tested algorithms and highlight directions for future research. The benchmark data is publicly available.",
"title": "BANDAR: Benchmarking Snippet Generation Algorithms for (RDF) Dataset Search",
"normalizedTitle": "BANDAR: Benchmarking Snippet Generation Algorithms for (RDF) Dataset Search",
"fno": "09477056",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Mining",
"Internet",
"Linked Data",
"Open Data",
"Query Processing",
"BANDAR",
"Benchmarking Snippet Generation Algorithms",
"Data Extraction",
"Dataset Retrieval",
"Dataset Search Systems",
"Keyword Query",
"Open Data",
"Quality Metrics",
"RDF Dataset Search Process",
"Real World Data Collection",
"Web",
"Measurement",
"Resource Description Framework",
"Benchmark Testing",
"Metadata",
"Europe",
"Urban Areas",
"Open Data",
"Snippet Generation",
"RDF Data",
"Dataset Search",
"Benchmark"
],
"authors": [
{
"givenName": "Xiaxia",
"surname": "Wang",
"fullName": "Xiaxia Wang",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gong",
"surname": "Cheng",
"fullName": "Gong Cheng",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeff Z.",
"surname": "Pan",
"fullName": "Jeff Z. Pan",
"affiliation": "School of Informatics, University of Edinburgh, Edinburgh, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Evgeny",
"surname": "Kharlamov",
"fullName": "Evgeny Kharlamov",
"affiliation": "Department of Informatics, University of Oslo, Oslo, Norway",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuzhong",
"surname": "Qu",
"fullName": "Yuzhong Qu",
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1227-1241",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/smartcity/2015/1893/0/1893a046",
"title": "Benchmarking RDF Stores for Smart City Services",
"doi": null,
"abstractUrl": "/proceedings-article/smartcity/2015/1893a046/12OmNrJ11An",
"parentPublication": {
"id": "proceedings/smartcity/2015/1893/0",
"title": "2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdew/2013/5303/0/06547471",
"title": "Self-organizing structured RDF in MonetDB",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2013/06547471/12OmNvjgWTP",
"parentPublication": {
"id": "proceedings/icdew/2013/5303/0",
"title": "2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2016/0662/0/0662a116",
"title": "Validating RDF Data Quality Using Constraints to Direct the Development of Constraint Languages",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2016/0662a116/12OmNwK7o8D",
"parentPublication": {
"id": "proceedings/icsc/2016/0662/0",
"title": "2016 IEEE Tenth International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2015/9942/0/9942a679",
"title": "A New Method of Utilizing Video Content Structured on the Basis of the RDF: Combining Broadcasting Content with External Services Using RDF Triples",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2015/9942a679/12OmNxIzWOw",
"parentPublication": {
"id": "proceedings/nbis/2015/9942/0",
"title": "2015 18th International Conference on Network-Based Information Systems (NBiS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apscc/2011/4624/0/4624a102",
"title": "A Mechanism Generating Semi-Structured RDF Metadata from Web Documents",
"doi": null,
"abstractUrl": "/proceedings-article/apscc/2011/4624a102/12OmNymjN2o",
"parentPublication": {
"id": "proceedings/apscc/2011/4624/0",
"title": "2011 IEEE Asia -Pacific Services Computing Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/11/06720109",
"title": "Scalable Keyword Search on Large RDF Data",
"doi": null,
"abstractUrl": "/journal/tk/2014/11/06720109/13rRUwjGoGl",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/5555/01/09964067",
"title": "Optimizing Keyword Search Over Federated RDF Systems",
"doi": null,
"abstractUrl": "/journal/bd/5555/01/09964067/1IAFF9AZN16",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/04/08868210",
"title": "Optimizing Multi-Query Evaluation in Federated RDF Systems",
"doi": null,
"abstractUrl": "/journal/tk/2021/04/08868210/1e7BUVvAUJa",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2021/8899/0/889900a233",
"title": "Benchmarking RDF Metadata Representations: Reification, Singleton Property and RDF",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2021/889900a233/1rFzTSIJjoc",
"parentPublication": {
"id": "proceedings/icsc/2021/8899/0",
"title": "2021 IEEE 15th International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2020/6251/0/09378411",
"title": "Discovering Entity Profiles Candidate for Entity Resolution on Linked Open Data Halal Food Products",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2020/09378411/1s6462R4mly",
"parentPublication": {
"id": "proceedings/big-data/2020/6251/0",
"title": "2020 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09495161",
"articleId": "1vyjfx1NxjW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09511228",
"articleId": "1vXcMwbYWKA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1DGRZtSiOdy",
"title": "July",
"year": "2022",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1oHhYFwKrM4",
"doi": "10.1109/TVCG.2020.3037680",
"abstract": "Direct volume rendering (DVR) using volumetric path tracing (VPT) is a scientific visualization technique that simulates light transport with objects’ matter using physically-based lighting models. Monte Carlo (MC) path tracing is often used with surface models, yet its application for volumetric models is difficult due to the complexity of integrating MC light-paths in volumetric media with none or smooth material boundaries. Moreover, auxiliary geometry-buffers (G-buffers) produced for volumes are typically very noisy, failing to guide image denoisers relying on that information to preserve image details. This makes existing real-time denoisers, which take noise-free G-buffers as their input, less effective when denoising VPT images. We propose the necessary modifications to an image-based denoiser previously used when rendering surface models, and demonstrate effective denoising of VPT images. In particular, our denoising exploits temporal coherence between frames, without relying on noise-free G-buffers, which has been a common assumption of existing denoisers for surface-models. Our technique preserves high-frequency details through a weighted recursive least squares that handles heterogeneous noise for volumetric models. We show for various real data sets that our method improves the visual fidelity and temporal stability of VPT during classic DVR operations such as camera movements, modifications of the light sources, and editions to the volume transfer function.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Direct volume rendering (DVR) using volumetric path tracing (VPT) is a scientific visualization technique that simulates light transport with objects’ matter using physically-based lighting models. Monte Carlo (MC) path tracing is often used with surface models, yet its application for volumetric models is difficult due to the complexity of integrating MC light-paths in volumetric media with none or smooth material boundaries. Moreover, auxiliary geometry-buffers (G-buffers) produced for volumes are typically very noisy, failing to guide image denoisers relying on that information to preserve image details. This makes existing real-time denoisers, which take noise-free G-buffers as their input, less effective when denoising VPT images. We propose the necessary modifications to an image-based denoiser previously used when rendering surface models, and demonstrate effective denoising of VPT images. In particular, our denoising exploits temporal coherence between frames, without relying on noise-free G-buffers, which has been a common assumption of existing denoisers for surface-models. Our technique preserves high-frequency details through a weighted recursive least squares that handles heterogeneous noise for volumetric models. We show for various real data sets that our method improves the visual fidelity and temporal stability of VPT during classic DVR operations such as camera movements, modifications of the light sources, and editions to the volume transfer function.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Direct volume rendering (DVR) using volumetric path tracing (VPT) is a scientific visualization technique that simulates light transport with objects’ matter using physically-based lighting models. Monte Carlo (MC) path tracing is often used with surface models, yet its application for volumetric models is difficult due to the complexity of integrating MC light-paths in volumetric media with none or smooth material boundaries. Moreover, auxiliary geometry-buffers (G-buffers) produced for volumes are typically very noisy, failing to guide image denoisers relying on that information to preserve image details. This makes existing real-time denoisers, which take noise-free G-buffers as their input, less effective when denoising VPT images. We propose the necessary modifications to an image-based denoiser previously used when rendering surface models, and demonstrate effective denoising of VPT images. In particular, our denoising exploits temporal coherence between frames, without relying on noise-free G-buffers, which has been a common assumption of existing denoisers for surface-models. Our technique preserves high-frequency details through a weighted recursive least squares that handles heterogeneous noise for volumetric models. We show for various real data sets that our method improves the visual fidelity and temporal stability of VPT during classic DVR operations such as camera movements, modifications of the light sources, and editions to the volume transfer function.",
"title": "Real-Time Denoising of Volumetric Path Tracing for Direct Volume Rendering",
"normalizedTitle": "Real-Time Denoising of Volumetric Path Tracing for Direct Volume Rendering",
"fno": "09258424",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Geometry",
"Image Denoising",
"Monte Carlo Methods",
"Rendering Computer Graphics",
"Surface Models",
"Volumetric Models",
"Light Sources",
"Volume Transfer Function",
"Time Denoising",
"Volumetric Path Tracing",
"Direct Volume Rendering",
"Scientific Visualization Technique",
"Light Transport",
"Physically Based Lighting Models",
"Monte Carlo Path Tracing",
"Integrating MC Light Paths",
"Volumetric Media",
"Smooth Material Boundaries",
"Auxiliary Geometry Buffers",
"Image Denoisers",
"Image Details",
"Real Time Denoisers",
"Noise Free G Buffers",
"Denoising VPT Images",
"Image Based Denoiser",
"Rendering Surface Models",
"Effective Denoising",
"Denoising Exploits Temporal Coherence",
"Rendering Computer Graphics",
"Noise Reduction",
"Real Time Systems",
"Photonics",
"Media",
"Lighting",
"Transfer Functions",
"Volume Rendering",
"Global Illumination",
"Path Tracing",
"Participating Media",
"Image Space Filtering",
"Real Time Denoising"
],
"authors": [
{
"givenName": "Jose A.",
"surname": "Iglesias-Guitian",
"fullName": "Jose A. Iglesias-Guitian",
"affiliation": "Computer Vision Center, Universitat Autònoma de Barcelona, Bellaterra, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Prajita",
"surname": "Mane",
"fullName": "Prajita Mane",
"affiliation": "Gwangju Institute of Science and Technology, Gwangju, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bochang",
"surname": "Moon",
"fullName": "Bochang Moon",
"affiliation": "Gwangju Institute of Science and Technology, Gwangju, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2022-07-01 00:00:00",
"pubType": "trans",
"pages": "2734-2747",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300055",
"title": "High Dimensional Direct Rendering of Time-Varying Volumetric Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300055/12OmNqyUUDX",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870027",
"title": "A Hardware Acceleration Method for Volumetric Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870027/12OmNxHJ9p1",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780039",
"title": "Two-Level Volume Rendering-Fusing MIP and DVR",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780039/12OmNxzMnWP",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/12/ttg2012122364",
"title": "Historygrams: Enabling Interactive Global Illumination in Direct Volume Rendering using Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2012/12/ttg2012122364/13rRUyYjK5h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/10/08481558",
"title": "Denoising Prior Driven Deep Neural Network for Image Restoration",
"doi": null,
"abstractUrl": "/journal/tp/2019/10/08481558/146z4GFxz71",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600c017",
"title": "Blind2Unblind: Self-Supervised Image Denoising with Visible Blind Spots",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600c017/1H1iiGyD6bm",
"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/dagstuhl/1997/0503/0/01423111",
"title": "Ray-Based Data Level Comparisons of Direct Volume Rendering Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/01423111/1h0N3aF69Lq",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222376",
"title": "Deep Volumetric Ambient Occlusion",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222376/1nTqtgLjBMQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09224194",
"title": "Direct Volume Rendering with Nonparametric Models of Uncertainty",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09224194/1nV71j9G3yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a106",
"title": "FAVR - Accelerating Direct Volume Rendering for Virtual RealitySystems",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a106/1qRNBEWTyEw",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09249052",
"articleId": "1ovEVPWDI4g",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09272883",
"articleId": "1p6aQfOCcUM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1DGS8JtVTUI",
"name": "ttg202207-09258424s1-tvcg-3037680-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202207-09258424s1-tvcg-3037680-mm.zip",
"extension": "zip",
"size": "848 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxCitJi",
"doi": "10.1109/TVCG.2016.2628743",
"abstract": "We propose a concept for a lens attachment that turns a standard DSLR camera and lens into a light field camera. The attachment consists of eight low-resolution, low-quality side cameras arranged around the central high-quality SLR lens. Unlike most existing light field camera architectures, this design provides a high-quality 2D image mode, while simultaneously enabling a new high-quality light field mode with a large camera baseline but little added weight, cost, or bulk compared with the base DSLR camera. From an algorithmic point of view, the high-quality light field mode is made possible by a new light field super-resolution method that first improves the spatial resolution and image quality of the side cameras and then interpolates additional views as needed. At the heart of this process is a super-resolution method that we call iterative Patch- And Depth-based Synthesis (iPADS), which combines patch-based and depth-based synthesis in a novel fashion. Experimental results obtained for both real captured data and synthetic data confirm that our method achieves substantial improvements in super-resolution for side-view images as well as the high-quality and view-coherent rendering of dense and high-resolution light fields.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a concept for a lens attachment that turns a standard DSLR camera and lens into a light field camera. The attachment consists of eight low-resolution, low-quality side cameras arranged around the central high-quality SLR lens. Unlike most existing light field camera architectures, this design provides a high-quality 2D image mode, while simultaneously enabling a new high-quality light field mode with a large camera baseline but little added weight, cost, or bulk compared with the base DSLR camera. From an algorithmic point of view, the high-quality light field mode is made possible by a new light field super-resolution method that first improves the spatial resolution and image quality of the side cameras and then interpolates additional views as needed. At the heart of this process is a super-resolution method that we call iterative Patch- And Depth-based Synthesis (iPADS), which combines patch-based and depth-based synthesis in a novel fashion. Experimental results obtained for both real captured data and synthetic data confirm that our method achieves substantial improvements in super-resolution for side-view images as well as the high-quality and view-coherent rendering of dense and high-resolution light fields.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a concept for a lens attachment that turns a standard DSLR camera and lens into a light field camera. The attachment consists of eight low-resolution, low-quality side cameras arranged around the central high-quality SLR lens. Unlike most existing light field camera architectures, this design provides a high-quality 2D image mode, while simultaneously enabling a new high-quality light field mode with a large camera baseline but little added weight, cost, or bulk compared with the base DSLR camera. From an algorithmic point of view, the high-quality light field mode is made possible by a new light field super-resolution method that first improves the spatial resolution and image quality of the side cameras and then interpolates additional views as needed. At the heart of this process is a super-resolution method that we call iterative Patch- And Depth-based Synthesis (iPADS), which combines patch-based and depth-based synthesis in a novel fashion. Experimental results obtained for both real captured data and synthetic data confirm that our method achieves substantial improvements in super-resolution for side-view images as well as the high-quality and view-coherent rendering of dense and high-resolution light fields.",
"title": "The Light Field Attachment: Turning a DSLR into a Light Field Camera Using a Low Budget Camera Ring",
"normalizedTitle": "The Light Field Attachment: Turning a DSLR into a Light Field Camera Using a Low Budget Camera Ring",
"fno": "07744676",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cameras",
"Spatial Resolution",
"Lenses",
"Tablet Computers",
"Prototypes",
"Light Field",
"Super Resolution",
"Computational Imaging"
],
"authors": [
{
"givenName": "Yuwang",
"surname": "Wang",
"fullName": "Yuwang Wang",
"affiliation": "Department of Automation, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yebin",
"surname": "Liu",
"fullName": "Yebin Liu",
"affiliation": "Department of Automation, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wolfgang",
"surname": "Heidrich",
"fullName": "Wolfgang Heidrich",
"affiliation": "Visual Computing Center, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qionghai",
"surname": "Dai",
"fullName": "Qionghai Dai",
"affiliation": "Department of Automation, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2017-10-01 00:00:00",
"pubType": "trans",
"pages": "2357-2364",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2015/8332/0/8332a335",
"title": "Light-Field Microscopy with a Consumer Light-Field Camera",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a335/12OmNBCqbDc",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2009/4534/0/05559010",
"title": "Light field superresolution",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2009/05559010/12OmNBiygwn",
"parentPublication": {
"id": "proceedings/iccp/2009/4534/0",
"title": "IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2015/9711/0/5720a208",
"title": "Bilayer Blind Deconvolution with the Light Field Camera",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2015/5720a208/12OmNCbU2Zk",
"parentPublication": {
"id": "proceedings/iccvw/2015/9711/0",
"title": "2015 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2013/3022/0/3022a037",
"title": "External Mask Based Depth and Light Field Camera",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2013/3022a037/12OmNCctfnA",
"parentPublication": {
"id": "proceedings/iccvw/2013/3022/0",
"title": "2013 IEEE International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2014/5188/0/06831813",
"title": "A switchable light field camera architecture with Angle Sensitive Pixels and dictionary-based sparse coding",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2014/06831813/12OmNCw3zaQ",
"parentPublication": {
"id": "proceedings/iccp/2014/5188/0",
"title": "2014 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2009/4534/0/05559008",
"title": "The focused plenoptic camera",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2009/05559008/12OmNqI04FS",
"parentPublication": {
"id": "proceedings/iccp/2009/4534/0",
"title": "IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223335",
"title": "Light field projection for lighting reproduction",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223335/12OmNs0C9XZ",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2014/5188/0/06831814",
"title": "Improving resolution and depth-of-field of light field cameras using a hybrid imaging system",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2014/06831814/12OmNyaoDEw",
"parentPublication": {
"id": "proceedings/iccp/2014/5188/0",
"title": "2014 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457d757",
"title": "A Wide-Field-of-View Monocentric Light Field Camera",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457d757/12OmNzCWG6X",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/02/07432007",
"title": "Geometric Calibration of Micro-Lens-Based Light Field Cameras Using Line Features",
"doi": null,
"abstractUrl": "/journal/tp/2017/02/07432007/13rRUwjXZKZ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07707351",
"articleId": "13rRUzp02ox",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWROp",
"name": "ttg201710-07744676s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201710-07744676s1.zip",
"extension": "zip",
"size": "48.9 MB",
"__typename": "WebExtraType"
}
],
"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": "13rRUxCitzE",
"doi": "10.1109/TPAMI.2010.66",
"abstract": "The range of scene depths that appear focused in an image is known as the depth of field (DOF). Conventional cameras are limited by a fundamental trade-off between depth of field and signal-to-noise ratio (SNR). For a dark scene, the aperture of the lens must be opened up to maintain SNR, which causes the DOF to reduce. Also, today's cameras have DOFs that correspond to a single slab that is perpendicular to the optical axis. In this paper, we present an imaging system that enables one to control the DOF in new and powerful ways. Our approach is to vary the position and/or orientation of the image detector during the integration time of a single photograph. Even when the detector motion is very small (tens of microns), a large range of scene depths (several meters) is captured, both in and out of focus. Our prototype camera uses a micro-actuator to translate the detector along the optical axis during image integration. Using this device, we demonstrate four applications of flexible DOF. First, we describe extended DOF where a large depth range is captured with a very wide aperture (low noise) but with nearly depth-independent defocus blur. Deconvolving a captured image with a single blur kernel gives an image with extended DOF and high SNR. Next, we show the capture of images with discontinuous DOFs. For instance, near and far objects can be imaged with sharpness, while objects in between are severely blurred. Third, we show that our camera can capture images with tilted DOFs (Scheimpflug imaging) without tilting the image detector. Finally, we demonstrate how our camera can be used to realize nonplanar DOFs. We believe flexible DOF imaging can open a new creative dimension in photography and lead to new capabilities in scientific imaging, vision, and graphics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The range of scene depths that appear focused in an image is known as the depth of field (DOF). Conventional cameras are limited by a fundamental trade-off between depth of field and signal-to-noise ratio (SNR). For a dark scene, the aperture of the lens must be opened up to maintain SNR, which causes the DOF to reduce. Also, today's cameras have DOFs that correspond to a single slab that is perpendicular to the optical axis. In this paper, we present an imaging system that enables one to control the DOF in new and powerful ways. Our approach is to vary the position and/or orientation of the image detector during the integration time of a single photograph. Even when the detector motion is very small (tens of microns), a large range of scene depths (several meters) is captured, both in and out of focus. Our prototype camera uses a micro-actuator to translate the detector along the optical axis during image integration. Using this device, we demonstrate four applications of flexible DOF. First, we describe extended DOF where a large depth range is captured with a very wide aperture (low noise) but with nearly depth-independent defocus blur. Deconvolving a captured image with a single blur kernel gives an image with extended DOF and high SNR. Next, we show the capture of images with discontinuous DOFs. For instance, near and far objects can be imaged with sharpness, while objects in between are severely blurred. Third, we show that our camera can capture images with tilted DOFs (Scheimpflug imaging) without tilting the image detector. Finally, we demonstrate how our camera can be used to realize nonplanar DOFs. We believe flexible DOF imaging can open a new creative dimension in photography and lead to new capabilities in scientific imaging, vision, and graphics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The range of scene depths that appear focused in an image is known as the depth of field (DOF). Conventional cameras are limited by a fundamental trade-off between depth of field and signal-to-noise ratio (SNR). For a dark scene, the aperture of the lens must be opened up to maintain SNR, which causes the DOF to reduce. Also, today's cameras have DOFs that correspond to a single slab that is perpendicular to the optical axis. In this paper, we present an imaging system that enables one to control the DOF in new and powerful ways. Our approach is to vary the position and/or orientation of the image detector during the integration time of a single photograph. Even when the detector motion is very small (tens of microns), a large range of scene depths (several meters) is captured, both in and out of focus. Our prototype camera uses a micro-actuator to translate the detector along the optical axis during image integration. Using this device, we demonstrate four applications of flexible DOF. First, we describe extended DOF where a large depth range is captured with a very wide aperture (low noise) but with nearly depth-independent defocus blur. Deconvolving a captured image with a single blur kernel gives an image with extended DOF and high SNR. Next, we show the capture of images with discontinuous DOFs. For instance, near and far objects can be imaged with sharpness, while objects in between are severely blurred. Third, we show that our camera can capture images with tilted DOFs (Scheimpflug imaging) without tilting the image detector. Finally, we demonstrate how our camera can be used to realize nonplanar DOFs. We believe flexible DOF imaging can open a new creative dimension in photography and lead to new capabilities in scientific imaging, vision, and graphics.",
"title": "Flexible Depth of Field Photography",
"normalizedTitle": "Flexible Depth of Field Photography",
"fno": "ttp2011010058",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Imaging Geometry",
"Programmable Depth Of Field",
"Detector Motion",
"Depth Independent Defocus Blur"
],
"authors": [
{
"givenName": "Sujit",
"surname": "Kuthirummal",
"fullName": "Sujit Kuthirummal",
"affiliation": "Sarnoff Corporation, Princeton",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hajime",
"surname": "Nagahara",
"fullName": "Hajime Nagahara",
"affiliation": "Osaka University, Osaka",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Changyin",
"surname": "Zhou",
"fullName": "Changyin Zhou",
"affiliation": "Columbia University, New York",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shree K.",
"surname": "Nayar",
"fullName": "Shree K. Nayar",
"affiliation": "Columbia University, New York",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2011-01-01 00:00:00",
"pubType": "trans",
"pages": "58-71",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1997/7822/0/78220219",
"title": "Optimal Selection of Camera Parameters for Recovery of Depth from Defocused Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1997/78220219/12OmNC4eSDP",
"parentPublication": {
"id": "proceedings/cvpr/1997/7822/0",
"title": "Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2008/3391/0/3391a483",
"title": "A Novel Technique of Image-Based Camera Calibration in Depth-from-Defocus",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2008/3391a483/12OmNCgrCXh",
"parentPublication": {
"id": "proceedings/icinis/2008/3391/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1996/7258/0/72580431",
"title": "Minimal operator set for passive depth from defocus",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1996/72580431/12OmNwF0BYy",
"parentPublication": {
"id": "proceedings/cvpr/1996/7258/0",
"title": "Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d505",
"title": "Extended Depth of Field Catadioptric Imaging Using Focal Sweep",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d505/12OmNxEjXTz",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2003/09/i1102",
"title": "Simultaneous Estimation of Super-Resolved Scene and Depth Map from Low Resolution Defocused Observations",
"doi": null,
"abstractUrl": "/journal/tp/2003/09/i1102/13rRUwbs1TA",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1997/10/i1158",
"title": "A Variational Approach to Recovering Depth From Defocused Images",
"doi": null,
"abstractUrl": "/journal/tp/1997/10/i1158/13rRUwdIOT7",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2001/01/i0085",
"title": "Unsupervised Multiresolution Segmentation for Images with Low Depth of Field",
"doi": null,
"abstractUrl": "/journal/tp/2001/01/i0085/13rRUwhpBOU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2008/06/mcg2008060047",
"title": "Depth-of-Field Blur Effects for First-Person Navigation in Virtual Environments",
"doi": null,
"abstractUrl": "/magazine/cg/2008/06/mcg2008060047/13rRUwwslwx",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2020/1485/0/09106008",
"title": "Depth of Field Image Sequences: 3D Cuing of High Efficiency",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2020/09106008/1kwqLIDvmF2",
"parentPublication": {
"id": "proceedings/icmew/2020/1485/0",
"title": "2020 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011010043",
"articleId": "13rRUy0qnHx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011010072",
"articleId": "13rRUwInv5w",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBBzofH",
"title": "June",
"year": "2011",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyeCkad",
"doi": "10.1109/TVCG.2010.106",
"abstract": "We present a new approach to compute the approximate Boolean operations of two freeform polygonal mesh solids efficiently with the help of Layered Depth Images (LDIs). After applying the LDI sampling-based membership classification, the most challenging part, a trimmed adaptive contouring algorithm, is developed to reconstruct the mesh surface from the LDI samples near the intersected regions and stitch it to the boundary of the retained surfaces. Our method of approximate Boolean operations holds the advantage of numerical robustness as the approach uses volumetric representation. However, unlike other methods based on volumetric representation, we do not damage the facets in nonintersected regions, thus preserving geometric details much better and speeding up the computation as well. We show that the proposed method can successfully compute the Boolean operations of free-form solids with a massive number of polygons in a few seconds.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new approach to compute the approximate Boolean operations of two freeform polygonal mesh solids efficiently with the help of Layered Depth Images (LDIs). After applying the LDI sampling-based membership classification, the most challenging part, a trimmed adaptive contouring algorithm, is developed to reconstruct the mesh surface from the LDI samples near the intersected regions and stitch it to the boundary of the retained surfaces. Our method of approximate Boolean operations holds the advantage of numerical robustness as the approach uses volumetric representation. However, unlike other methods based on volumetric representation, we do not damage the facets in nonintersected regions, thus preserving geometric details much better and speeding up the computation as well. We show that the proposed method can successfully compute the Boolean operations of free-form solids with a massive number of polygons in a few seconds.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new approach to compute the approximate Boolean operations of two freeform polygonal mesh solids efficiently with the help of Layered Depth Images (LDIs). After applying the LDI sampling-based membership classification, the most challenging part, a trimmed adaptive contouring algorithm, is developed to reconstruct the mesh surface from the LDI samples near the intersected regions and stitch it to the boundary of the retained surfaces. Our method of approximate Boolean operations holds the advantage of numerical robustness as the approach uses volumetric representation. However, unlike other methods based on volumetric representation, we do not damage the facets in nonintersected regions, thus preserving geometric details much better and speeding up the computation as well. We show that the proposed method can successfully compute the Boolean operations of free-form solids with a massive number of polygons in a few seconds.",
"title": "Approximate Boolean Operations on Large Polyhedral Solids with Partial Mesh Reconstruction",
"normalizedTitle": "Approximate Boolean Operations on Large Polyhedral Solids with Partial Mesh Reconstruction",
"fno": "ttg2011060836",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Boolean Operations",
"Free Form Solids",
"Robust",
"Approximation",
"Layered Depth Images"
],
"authors": [
{
"givenName": "Charlie C.L.",
"surname": "Wang",
"fullName": "Charlie C.L. Wang",
"affiliation": "The Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2011-06-01 00:00:00",
"pubType": "trans",
"pages": "836-849",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dcc/2001/1031/0/10310331",
"title": "Compression of the Layered Depth Image",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2001/10310331/12OmNB1wkNe",
"parentPublication": {
"id": "proceedings/dcc/2001/1031/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2001/1227/0/12270198",
"title": "Integrating Physics-Based Modeling with PDE Solids for Geometric Design",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270198/12OmNBigFsJ",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1982/020/0/01585545",
"title": "Modeling Polyhedral Solids Bounded by Multi-Curved Parametric Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1982/01585545/12OmNCcbE2U",
"parentPublication": {
"id": "proceedings/dac/1982/020/0",
"title": "19th Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dpvt/2002/1521/0/15210352",
"title": "Direct and Robust Voxelization and Polygonization of Free-Form CSG Solids",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2002/15210352/12OmNviHKhK",
"parentPublication": {
"id": "proceedings/3dpvt/2002/1521/0",
"title": "3D Data Processing Visualization and Transmission, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2001/1227/0/12270234",
"title": "Accurate Surface Voxelization for Manipulating Volumetric Surfaces and Solids with Application in Simulating Musculoskeletal Surgery",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270234/12OmNz4BdqF",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091592",
"title": "Wetting of Porous Solids",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091592/13rRUNvyatj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/01/v0019",
"title": "Volume-Preserving Free-Form Solids",
"doi": null,
"abstractUrl": "/journal/tg/1996/01/v0019/13rRUwInvkY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/01/ttg2013010016",
"title": "Efficient Boundary Extraction of BSP Solids Based on Clipping Operations",
"doi": null,
"abstractUrl": "/journal/tg/2013/01/ttg2013010016/13rRUx0xPIF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1990/06/mcg1990060076",
"title": "Set Models and Boolean Operations for Solids and Assemblies",
"doi": null,
"abstractUrl": "/magazine/cg/1990/06/mcg1990060076/13rRUxNmPIn",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1989/06/mcg1989060050",
"title": "Robust Set Operations on Polyhedral Solids",
"doi": null,
"abstractUrl": "/magazine/cg/1989/06/mcg1989060050/13rRUzpzeDn",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011060822",
"articleId": "13rRUEgarBp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011060850",
"articleId": "13rRUNvgz9F",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAolH0S",
"title": "July/August",
"year": "2003",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "23",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgyOfk",
"doi": "10.1109/MCG.2003.1210863",
"abstract": "A simple technique for fast texture transfer between images can produce quality results similar to current state of the art methods but at a fraction of the cost. The article demonstrates several application of the method including artistic style transfer, image enhancement, and novel nonphotorealistic filter creation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A simple technique for fast texture transfer between images can produce quality results similar to current state of the art methods but at a fraction of the cost. The article demonstrates several application of the method including artistic style transfer, image enhancement, and novel nonphotorealistic filter creation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A simple technique for fast texture transfer between images can produce quality results similar to current state of the art methods but at a fraction of the cost. The article demonstrates several application of the method including artistic style transfer, image enhancement, and novel nonphotorealistic filter creation.",
"title": "Fast Texture Transfer",
"normalizedTitle": "Fast Texture Transfer",
"fno": "mcg2003040038",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Texture Synthesis",
"Texture Transfer",
"And Nonphotorealistic"
],
"authors": [
{
"givenName": "Michael",
"surname": "Ashikhmin",
"fullName": "Michael Ashikhmin",
"affiliation": "Stony Brook University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2003-07-01 00:00:00",
"pubType": "mags",
"pages": "38-43",
"year": "2003",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg2003040028",
"articleId": "13rRUxly97S",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2003040044",
"articleId": "13rRUwkfAT0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqBKUfM",
"title": "March",
"year": "2006",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "28",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3xY97",
"doi": "10.1109/TPAMI.2006.63",
"abstract": "In vision and graphics, advanced object models require not only 3D shape, but also surface detail. While several scanning devices exist to capture the global shape of an object, few methods concentrate on capturing the fine-scale detail. Fine-scale surface geometry (relief texture), such as surface markings, roughness, and imprints, is essential in highly realistic rendering and accurate prediction. We present a novel approach for measuring the relief texture of specular or partially specular surfaces using a specialized imaging device with a concave parabolic mirror to view multiple angles in a single image. Laser scanning typically fails for specular surfaces because of light scattering, but our method is explicitly designed for specular surfaces. Also, the spatial resolution of the measured geometry is significantly higher than standard methods, so very small surface details are captured. Furthermore, spatially varying reflectance is measured simultaneously, i.e., both texture color and texture shape are retrieved.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In vision and graphics, advanced object models require not only 3D shape, but also surface detail. While several scanning devices exist to capture the global shape of an object, few methods concentrate on capturing the fine-scale detail. Fine-scale surface geometry (relief texture), such as surface markings, roughness, and imprints, is essential in highly realistic rendering and accurate prediction. We present a novel approach for measuring the relief texture of specular or partially specular surfaces using a specialized imaging device with a concave parabolic mirror to view multiple angles in a single image. Laser scanning typically fails for specular surfaces because of light scattering, but our method is explicitly designed for specular surfaces. Also, the spatial resolution of the measured geometry is significantly higher than standard methods, so very small surface details are captured. Furthermore, spatially varying reflectance is measured simultaneously, i.e., both texture color and texture shape are retrieved.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In vision and graphics, advanced object models require not only 3D shape, but also surface detail. While several scanning devices exist to capture the global shape of an object, few methods concentrate on capturing the fine-scale detail. Fine-scale surface geometry (relief texture), such as surface markings, roughness, and imprints, is essential in highly realistic rendering and accurate prediction. We present a novel approach for measuring the relief texture of specular or partially specular surfaces using a specialized imaging device with a concave parabolic mirror to view multiple angles in a single image. Laser scanning typically fails for specular surfaces because of light scattering, but our method is explicitly designed for specular surfaces. Also, the spatial resolution of the measured geometry is significantly higher than standard methods, so very small surface details are captured. Furthermore, spatially varying reflectance is measured simultaneously, i.e., both texture color and texture shape are retrieved.",
"title": "Relief Texture from Specularities",
"normalizedTitle": "Relief Texture from Specularities",
"fno": "i0446",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Index Terms Texture",
"Relief Texture",
"BTF",
"Bidirectional Texture Function",
"3 D Texture",
"Shape From Specularity",
"Curved Mirror",
"Reflectance",
"Roughness"
],
"authors": [
{
"givenName": "Jing",
"surname": "Wang",
"fullName": "Jing Wang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kristin J.",
"surname": "Dana",
"fullName": "Kristin J. Dana",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2006-03-01 00:00:00",
"pubType": "trans",
"pages": "446-457",
"year": "2006",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2009/3992/0/05206534",
"title": "Retrographic sensing for the measurement of surface texture and shape",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206534/12OmNAnMuDL",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/1/252110587",
"title": "Using Specularities to Recover Multiple Light Sources in the Presence of Texture",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252110587/12OmNBNM96B",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2001/1143/2/114320447",
"title": "Shape from texture and integrability",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/114320447/12OmNBezSER",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2009/3883/0/3883a547",
"title": "Improved Relief Texture Mapping Using Minmax Texture",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2009/3883a547/12OmNrkjVf8",
"parentPublication": {
"id": "proceedings/icig/2009/3883/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420876",
"title": "Recovering object surfaces from viewed changes in surface texture patterns",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420876/12OmNvT2p2H",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2000/0878/0/08780219",
"title": "Image-Based Texture Analysis for Realistic Image Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2000/08780219/12OmNwfKj9c",
"parentPublication": {
"id": "proceedings/sibgrapi/2000/0878/0",
"title": "Proceedings 13th Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00878)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1997/7822/0/78221060",
"title": "The Bas-Relief Ambiguity",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1997/78221060/12OmNyRPgwe",
"parentPublication": {
"id": "proceedings/cvpr/1997/7822/0",
"title": "Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2015/7962/0/7962a001",
"title": "Meta-Relief Texture Mapping with Dynamic Texture-Space Ambient Occlusion",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2015/7962a001/12OmNyp9MiX",
"parentPublication": {
"id": "proceedings/sibgrapi/2015/7962/0",
"title": "2015 28th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/03/v0278",
"title": "Synthesis and Rendering of Bidirectional Texture Functions on Arbitrary Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2004/03/v0278/13rRUyYSWsE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1995/04/i0333",
"title": "Shape from Texture Using Local Spectral Moments",
"doi": null,
"abstractUrl": "/journal/tp/1995/04/i0333/13rRUyfKIIT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0432",
"articleId": "13rRUyuvRpX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0458",
"articleId": "13rRUwbJD60",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwENDN",
"title": "May/June",
"year": "2007",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDIth7",
"doi": "10.1109/TVCG.2007.1007",
"abstract": "Abstract—A major problem with interactive displays based on front projection is that users cast undesirable shadows on the display surface. This paper demonstrates that shadows can be muted by redundantly illuminating the display surface using multiple projectors, all mounted at different locations. However, this technique alone does not eliminate shadows: Multiple projectors create multiple dark regions on the surface (penumbral occlusions) and cast undesirable light onto the users. These problems can be solved by eliminating shadows and suppressing the light that falls on occluding users by actively modifying the projected output. This paper categorizes various methods that can be used to achieve redundant illumination, shadow elimination, and blinding light suppression and evaluates their performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—A major problem with interactive displays based on front projection is that users cast undesirable shadows on the display surface. This paper demonstrates that shadows can be muted by redundantly illuminating the display surface using multiple projectors, all mounted at different locations. However, this technique alone does not eliminate shadows: Multiple projectors create multiple dark regions on the surface (penumbral occlusions) and cast undesirable light onto the users. These problems can be solved by eliminating shadows and suppressing the light that falls on occluding users by actively modifying the projected output. This paper categorizes various methods that can be used to achieve redundant illumination, shadow elimination, and blinding light suppression and evaluates their performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—A major problem with interactive displays based on front projection is that users cast undesirable shadows on the display surface. This paper demonstrates that shadows can be muted by redundantly illuminating the display surface using multiple projectors, all mounted at different locations. However, this technique alone does not eliminate shadows: Multiple projectors create multiple dark regions on the surface (penumbral occlusions) and cast undesirable light onto the users. These problems can be solved by eliminating shadows and suppressing the light that falls on occluding users by actively modifying the projected output. This paper categorizes various methods that can be used to achieve redundant illumination, shadow elimination, and blinding light suppression and evaluates their performance.",
"title": "Shadow Elimination and Blinding Light Suppression for Interactive Projected Displays",
"normalizedTitle": "Shadow Elimination and Blinding Light Suppression for Interactive Projected Displays",
"fno": "v0508",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shadow Elimination",
"Blinding Light Suppression",
"Projector Calibration",
"Multiple Projector Display"
],
"authors": [
{
"givenName": "Jay",
"surname": "Summet",
"fullName": "Jay Summet",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Flagg",
"fullName": "Matthew Flagg",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tat-Jen",
"surname": "Cham",
"fullName": "Tat-Jen Cham",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James M.",
"surname": "Rehg",
"fullName": "James M. Rehg",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rahul",
"surname": "Sukthankar",
"fullName": "Rahul Sukthankar",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2007-05-01 00:00:00",
"pubType": "trans",
"pages": "508-517",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/uic-atc/2010/4272/0/4272a031",
"title": "An Improved Multi-Scale Retinex Algorithm for Vehicle Shadow Elimination Based on Variational Kimmel",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc/2010/4272a031/12OmNCdk2Tk",
"parentPublication": {
"id": "proceedings/uic-atc/2010/4272/0",
"title": "Ubiquitous, Autonomic and Trusted Computing, Symposia and Workshops on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2003/1900/2/190020513",
"title": "Shadow Elimination and Occluder Light Suppression for Multi-Projector Displays",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2003/190020513/12OmNvFpEvj",
"parentPublication": {
"id": "proceedings/cvpr/2003/1900/2",
"title": "2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780017",
"title": "Achieving Color Uniformity Across Multi-Projector Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780017/12OmNwlHSVv",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200jaynes",
"title": "Dynamic Shadow Removal from Front Projection Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200jaynes/12OmNxG1yQD",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2010/7029/0/05544603",
"title": "Contrasting shadow for occluder light suppression from one-shot image",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2010/05544603/12OmNy2rRXA",
"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/ismar/2005/2459/0/01544690",
"title": "Specular reflection elimination for projection-based augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2005/01544690/12OmNy6HQUD",
"parentPublication": {
"id": "proceedings/ismar/2005/2459/0",
"title": "Fourth IEEE and ACM International Symposium on Mixed and Augmented Reality (ISMAR'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2001/1272/2/127220151",
"title": "Dynamic Shadow Elimination for Multi-Projector Displays",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2001/127220151/12OmNz5JCeX",
"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/ieee-vis/2002/7498/0/7498chen",
"title": "Scalable Alignment of Large-Format Multi-Projector Displays Using Camera Homography Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498chen/12OmNzh5yZn",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwar/1999/0359/0/03590064",
"title": "Table-Top Spatially-Augmented Reality: Bringing Physical Models to Life with Projected Imagery",
"doi": null,
"abstractUrl": "/proceedings-article/iwar/1999/03590064/12OmNzhnadt",
"parentPublication": {
"id": "proceedings/iwar/1999/0359/0",
"title": "Augmented Reality, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/03/v0290",
"title": "Camera-Based Detection and Removal of Shadows from Interactive Multiprojector Displays",
"doi": null,
"abstractUrl": "/journal/tg/2004/03/v0290/13rRUxZRbnR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0494",
"articleId": "13rRUyYSWsK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0518",
"articleId": "13rRUwgyOje",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBqdrhZ",
"title": "March/April",
"year": "2006",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "26",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0Pqv3",
"doi": "10.1109/MCG.2006.34",
"abstract": "This article presents a visualization technique for log files of intrusion detection systems (IDSs), especially for a large-scale computer network connecting to thousands of computers. The technique first constructs hierarchical data of computers according to their IP addresses. It then visualizes the hierarchical data as bars and nested rectangles in a 2D display space, where bars denote computers and rectangles denote groups of computers. The technique represents the statistics of incidents for thousands of computers in one display space by mapping the number of incidents as bar heights. The technique attempts to minimize the display space; therefore, it enables the computers to be represented as clickable metaphors so that each computer's user interface presents its detail on demand. Also, the technique can help a user understand the relationship between a distribution of incidents and the organization of real society, because IP addresses are usually assigned according to the physical and organizational layouts of real society. The article introduces interesting behavior that the presented technique visualizes, including malicious accesses on real large-scale computer networks as discovered from over sixty thousands lines of a real IDS log file.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article presents a visualization technique for log files of intrusion detection systems (IDSs), especially for a large-scale computer network connecting to thousands of computers. The technique first constructs hierarchical data of computers according to their IP addresses. It then visualizes the hierarchical data as bars and nested rectangles in a 2D display space, where bars denote computers and rectangles denote groups of computers. The technique represents the statistics of incidents for thousands of computers in one display space by mapping the number of incidents as bar heights. The technique attempts to minimize the display space; therefore, it enables the computers to be represented as clickable metaphors so that each computer's user interface presents its detail on demand. Also, the technique can help a user understand the relationship between a distribution of incidents and the organization of real society, because IP addresses are usually assigned according to the physical and organizational layouts of real society. The article introduces interesting behavior that the presented technique visualizes, including malicious accesses on real large-scale computer networks as discovered from over sixty thousands lines of a real IDS log file.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article presents a visualization technique for log files of intrusion detection systems (IDSs), especially for a large-scale computer network connecting to thousands of computers. The technique first constructs hierarchical data of computers according to their IP addresses. It then visualizes the hierarchical data as bars and nested rectangles in a 2D display space, where bars denote computers and rectangles denote groups of computers. The technique represents the statistics of incidents for thousands of computers in one display space by mapping the number of incidents as bar heights. The technique attempts to minimize the display space; therefore, it enables the computers to be represented as clickable metaphors so that each computer's user interface presents its detail on demand. Also, the technique can help a user understand the relationship between a distribution of incidents and the organization of real society, because IP addresses are usually assigned according to the physical and organizational layouts of real society. The article introduces interesting behavior that the presented technique visualizes, including malicious accesses on real large-scale computer networks as discovered from over sixty thousands lines of a real IDS log file.",
"title": "Hierarchical Visualization of Network Intrusion Detection Data",
"normalizedTitle": "Hierarchical Visualization of Network Intrusion Detection Data",
"fno": "mcg2006020040",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Hierarchical Data Visualization",
"Rectangle Packing",
"Intrusion Detection System",
"IP Address Space"
],
"authors": [
{
"givenName": "Takayuki",
"surname": "Itoh",
"fullName": "Takayuki Itoh",
"affiliation": "Ochanomizu University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hiroki",
"surname": "Takakura",
"fullName": "Hiroki Takakura",
"affiliation": "Kyoto University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Atsushi",
"surname": "Sawada",
"fullName": "Atsushi Sawada",
"affiliation": "Kyoto University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Koji",
"surname": "Koyamada",
"fullName": "Koji Koyamada",
"affiliation": "Kyoto University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2006-03-01 00:00:00",
"pubType": "mags",
"pages": "40-47",
"year": "2006",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ictai/2003/2038/0/20380570",
"title": "A Comparative Study of Techniques for Intrusion Detection",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2003/20380570/12OmNAnuTx9",
"parentPublication": {
"id": "proceedings/ictai/2003/2038/0",
"title": "Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icitcs/2013/2845/0/06717779",
"title": "A Network-Based Internet Worm Intrusion Detection and Prevention System",
"doi": null,
"abstractUrl": "/proceedings-article/icitcs/2013/06717779/12OmNBtl1EW",
"parentPublication": {
"id": "proceedings/icitcs/2013/2845/0",
"title": "2013 International Conference on IT Convergence and Security (ICITCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icetet/2008/3267/0/3267b272",
"title": "Network Intrusion Detection System (NIDS)",
"doi": null,
"abstractUrl": "/proceedings-article/icetet/2008/3267b272/12OmNvF83r0",
"parentPublication": {
"id": "proceedings/icetet/2008/3267/0",
"title": "Emerging Trends in Engineering & Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieec/2009/3686/0/3686a150",
"title": "Reason for Hierarchical Self Organized Map-Based Intrusion Detection System Incapable of Increasing Detection Rate",
"doi": null,
"abstractUrl": "/proceedings-article/ieec/2009/3686a150/12OmNvsDHGn",
"parentPublication": {
"id": "proceedings/ieec/2009/3686/0",
"title": "2009 International Symposium on Information Engineering and Electronic Commerce (IEEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispan/2008/3125/0/3125a167",
"title": "Growing Hierarchical Self-Organizing Map for Filtering Intrusion Detection Alarms",
"doi": null,
"abstractUrl": "/proceedings-article/ispan/2008/3125a167/12OmNxXUhUF",
"parentPublication": {
"id": "proceedings/ispan/2008/3125/0",
"title": "Parallel Architectures, Algorithms, and Networks, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a220",
"title": "Improving Visualization of Large Hierarchical Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a220/12OmNy314jf",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icons/2009/3551/0/3551a243",
"title": "Implementation of Intrusion Detection System for Automation Devices within Virtual Automation Network",
"doi": null,
"abstractUrl": "/proceedings-article/icons/2009/3551a243/12OmNyv7mo7",
"parentPublication": {
"id": "proceedings/icons/2009/3551/0",
"title": "2009 Fourth International Conference on Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2012/4745/0/4745a209",
"title": "A Practical Network-Based Intrusion Detection and Prevention System",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2012/4745a209/12OmNzE54BT",
"parentPublication": {
"id": "proceedings/trustcom/2012/4745/0",
"title": "2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a082",
"title": "CAT: A Hierarchical Image Browser Using a Rectangle Packing Technique",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a082/12OmNzRZpU4",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/03/v0302",
"title": "Hierarchical Data Visualization Using a Fast Rectangle-Packing Algorithm",
"doi": null,
"abstractUrl": "/journal/tg/2004/03/v0302/13rRUwInvym",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2006020028",
"articleId": "13rRUwhpBQ1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2006020048",
"articleId": "13rRUwwslyB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqJZgIv",
"title": "Jan.-Feb.",
"year": "2017",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "37",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3gn3C",
"doi": "10.1109/MCG.2015.96",
"abstract": "One of the most challenging problems in robot-assisted surgical systems is to provide surgical realism at interactive simulation rates. The proposed visual tracking system can track and register object deformations in real time using a physically based formulation, despite the occlusions produced by the robotic system itself. The results obtained provide an accurate visual representation of the deformed solid and will thus enable new assistance approaches to help surgeons during surgical procedures.",
"abstracts": [
{
"abstractType": "Regular",
"content": "One of the most challenging problems in robot-assisted surgical systems is to provide surgical realism at interactive simulation rates. The proposed visual tracking system can track and register object deformations in real time using a physically based formulation, despite the occlusions produced by the robotic system itself. The results obtained provide an accurate visual representation of the deformed solid and will thus enable new assistance approaches to help surgeons during surgical procedures.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "One of the most challenging problems in robot-assisted surgical systems is to provide surgical realism at interactive simulation rates. The proposed visual tracking system can track and register object deformations in real time using a physically based formulation, despite the occlusions produced by the robotic system itself. The results obtained provide an accurate visual representation of the deformed solid and will thus enable new assistance approaches to help surgeons during surgical procedures.",
"title": "Real-Time Visual Tracking of Deformable Objects in Robot-Assisted Surgery",
"normalizedTitle": "Real-Time Visual Tracking of Deformable Objects in Robot-Assisted Surgery",
"fno": "mcg2017010056",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Computational Modeling",
"Deformable Models",
"Medical Robots",
"Finite Element Analysis",
"Surgery",
"Visualization",
"Biological System Modeling",
"Deformable 3 D Objects",
"Computer Graphics",
"Visual Tracking",
"Medical Robotics",
"Finite Element Method",
"Interactive Simulation"
],
"authors": [
{
"givenName": "Ibai",
"surname": "Leizea",
"fullName": "Ibai Leizea",
"affiliation": "IK4-Ideko",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ainitze",
"surname": "Mendizabal",
"fullName": "Ainitze Mendizabal",
"affiliation": "CEIT-IK4",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hugo",
"surname": "Alvarez",
"fullName": "Hugo Alvarez",
"affiliation": "Vicomtech-IK4",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Iker",
"surname": "Aguinaga",
"fullName": "Iker Aguinaga",
"affiliation": "CEIT-IK4 and University of Navarra",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Diego",
"surname": "Borro",
"fullName": "Diego Borro",
"affiliation": "CEIT-IK4 and University of Navarra",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Emilio",
"surname": "Sanchez",
"fullName": "Emilio Sanchez",
"affiliation": "CEIT-IK4 and University of Navarra",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "mags",
"pages": "56-68",
"year": "2017",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ca/2001/7237/0/00982397",
"title": "Real-time simulation of deformable objects: tools and application",
"doi": null,
"abstractUrl": "/proceedings-article/ca/2001/00982397/12OmNBuL1b1",
"parentPublication": {
"id": "proceedings/ca/2001/7237/0",
"title": "Proceedings Computer Animation 2001. Fourteenth Conference on Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icas/2010/3970/0/3970a064",
"title": "Autonomous High Precision Positioning of Surgical Instruments in Robot-Assisted Minimally Invasive Surgery under Visual Guidance",
"doi": null,
"abstractUrl": "/proceedings-article/icas/2010/3970a064/12OmNvT2oSF",
"parentPublication": {
"id": "proceedings/icas/2010/3970/0",
"title": "Autonomic and Autonomous Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2006/0226/0/01627099",
"title": "A Displacement Driven Real-Time Deformable Model For Haptic Surgery Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2006/01627099/12OmNx1IwaC",
"parentPublication": {
"id": "proceedings/haptics/2006/0226/0",
"title": "2006 14th Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciis/1999/0446/0/04460126",
"title": "Automated MRI Driven Image Guided Robotic Brain Surgery",
"doi": null,
"abstractUrl": "/proceedings-article/iciis/1999/04460126/12OmNxvO073",
"parentPublication": {
"id": "proceedings/iciis/1999/0446/0",
"title": "Information, Intelligence, and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2006/0226/0/02260075",
"title": "A Displacement Driven Real-Time Deformable Model For Haptic Surgery",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2006/02260075/12OmNxwENJC",
"parentPublication": {
"id": "proceedings/haptics/2006/0226/0",
"title": "2006 14th Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/03/v0314",
"title": "Real-Time Finite Element Modeling for Surgery Simulation: An Application to Virtual Suturing",
"doi": null,
"abstractUrl": "/journal/tg/2004/03/v0314/13rRUxASuG7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089445",
"title": "Analysing usability and presence of a virtual reality operating room (VOR) simulator during laparoscopic surgery training",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089445/1jIxcxivs8o",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089572",
"title": "Real-time VR Simulation of Laparoscopic Cholecystectomy based on Parallel Position-based Dynamics in GPU",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089572/1jIxeVsy9yg",
"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/springsim/2020/370/0/09185412",
"title": "“Surgical Gps” Proof of Concept for Scoliosis Surgery",
"doi": null,
"abstractUrl": "/proceedings-article/springsim/2020/09185412/1mP63bCGUjm",
"parentPublication": {
"id": "proceedings/springsim/2020/370/0",
"title": "2020 Spring Simulation Conference (SpringSim)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/irc/2020/5237/0/523700a041",
"title": "Securing Robot-assisted Minimally Invasive Surgery through Perception Complementarities",
"doi": null,
"abstractUrl": "/proceedings-article/irc/2020/523700a041/1pP3RFSVe6s",
"parentPublication": {
"id": "proceedings/irc/2020/5237/0",
"title": "2020 Fourth IEEE International Conference on Robotic Computing (IRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2017010044",
"articleId": "13rRUxASuk4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2017010069",
"articleId": "13rRUxAStUE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzayN28",
"title": "Nov.-Dec.",
"year": "2010",
"issueNum": "06",
"idPrefix": "ex",
"pubType": "magazine",
"volume": "25",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUytF45s",
"doi": "10.1109/MIS.2010.151",
"abstract": "In a broad sense, social media refers to a conversational, distributed mode of content generation, dissemination, and communication among communities. Different from broadcast-based traditional and industrial media, social media has torn down the boundaries between authorship and readership, while the information consumption and dissemination process is becoming intrinsically intertwined with the process of generating and sharing information. This special issue samples the state of the art in social media analytics and intelligence research that has direct relevance to the AI subfield from either an methodological or domain perspective.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In a broad sense, social media refers to a conversational, distributed mode of content generation, dissemination, and communication among communities. Different from broadcast-based traditional and industrial media, social media has torn down the boundaries between authorship and readership, while the information consumption and dissemination process is becoming intrinsically intertwined with the process of generating and sharing information. This special issue samples the state of the art in social media analytics and intelligence research that has direct relevance to the AI subfield from either an methodological or domain perspective.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In a broad sense, social media refers to a conversational, distributed mode of content generation, dissemination, and communication among communities. Different from broadcast-based traditional and industrial media, social media has torn down the boundaries between authorship and readership, while the information consumption and dissemination process is becoming intrinsically intertwined with the process of generating and sharing information. This special issue samples the state of the art in social media analytics and intelligence research that has direct relevance to the AI subfield from either an methodological or domain perspective.",
"title": "Social Media Analytics and Intelligence",
"normalizedTitle": "Social Media Analytics and Intelligence",
"fno": "mex2010060013",
"hasPdf": true,
"idPrefix": "ex",
"keywords": [
"Intelligent Systems",
"Social Media",
"Social Media Analytics",
"Social Media Intelligence",
"User Generated Content",
"Agent Based Markets",
"Social Media Streams",
"Stream Reasoning",
"Virtual Worlds",
"Collaborative Tagging"
],
"authors": [
{
"givenName": "Daniel",
"surname": "Zeng",
"fullName": "Daniel Zeng",
"affiliation": "Chinese Academy of Sciences and University of Arizona",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hsinchun",
"surname": "Chen",
"fullName": "Hsinchun Chen",
"affiliation": "University of Arizona",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Lusch",
"fullName": "Robert Lusch",
"affiliation": "University of Arizona",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shu-Hsing",
"surname": "Li",
"fullName": "Shu-Hsing Li",
"affiliation": "National Taiwan University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2010-11-01 00:00:00",
"pubType": "mags",
"pages": "13-16",
"year": "2010",
"issn": "1541-1672",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2014/6227/0/07042495",
"title": "Integrating predictive analytics and social media",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2014/07042495/12OmNANTAwO",
"parentPublication": {
"id": "proceedings/vast/2014/6227/0",
"title": "2014 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2012/4711/0/4711a055",
"title": "Media Lifecycle and Content Analysis in Social Media Communities",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2012/4711a055/12OmNBSjIRW",
"parentPublication": {
"id": "proceedings/icme/2012/4711/0",
"title": "2012 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892d108",
"title": "Introduction to Mining and Analyzing Social Media Minitrack",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892d108/12OmNs59JYH",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2010/4279/3/4279c509",
"title": "An Impact of Social Media on Online Travel Information Search in China",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2010/4279c509/12OmNvDqsQ7",
"parentPublication": {
"id": "proceedings/iciii/2010/4279/3",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2012/4654/0/4654a702",
"title": "Health Intelligence Model for Evaluation of Social Media Outcomes",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2012/4654a702/12OmNx7ov3T",
"parentPublication": {
"id": "proceedings/itng/2012/4654/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2015/0478/0/07507091",
"title": "Building holistic social media strategy refering to social intelligence and digital maturity",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2015/07507091/12OmNxwncIX",
"parentPublication": {
"id": "proceedings/aiccsa/2015/0478/0",
"title": "2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892b569",
"title": "Introduction to Social Media and Data Analytics Minitrack",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892b569/12OmNyywxyP",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cts/2016/2300/0/07871041",
"title": "The Role of Social Media in National Discourse and Mobilization of Citizens",
"doi": null,
"abstractUrl": "/proceedings-article/cts/2016/07871041/12OmNzsJ7BU",
"parentPublication": {
"id": "proceedings/cts/2016/2300/0",
"title": "2016 International Conference on Collaboration Technologies and Systems (CTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2013/4892/0/4892a718",
"title": "The Key to Social Media Implementation: Bridging Customer Relationship Management to Social Media",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2013/4892a718/12OmNzw8jez",
"parentPublication": {
"id": "proceedings/hicss/2013/4892/0",
"title": "2013 46th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2021/3827/0/382700a218",
"title": "Visualisation for social media analytics: landscape of R packages",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2021/382700a218/1y4oIPnbyYU",
"parentPublication": {
"id": "proceedings/iv/2021/3827/0",
"title": "2021 25th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mex2010060008",
"articleId": "13rRUx0xPNe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mex2010060017",
"articleId": "13rRUB7a0WV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCbCrUN",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuegp5",
"doi": "10.1109/TVCG.2013.223",
"abstract": "Social network analysis (SNA) is becoming increasingly concerned not only with actors and their relations, but also with distinguishing between different types of such entities. For example, social scientists may want to investigate asymmetric relations in organizations with strict chains of command, or incorporate non-actors such as conferences and projects when analyzing coauthorship patterns. Multimodal social networks are those where actors and relations belong to different types, or modes, and multimodal social network analysis (mSNA) is accordingly SNA for such networks. In this paper, we present a design study that we conducted with several social scientist collaborators on how to support mSNA using visual analytics tools. Based on an openended, formative design process, we devised a visual representation called parallel node-link bands (PNLBs) that splits modes into separate bands and renders connections between adjacent ones, similar to the list view in Jigsaw. We then used the tool in a qualitative evaluation involving five social scientists whose feedback informed a second design phase that incorporated additional network metrics. Finally, we conducted a second qualitative evaluation with our social scientist collaborators that provided further insights on the utility of the PNLBs representation and the potential of visual analytics for mSNA.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Social network analysis (SNA) is becoming increasingly concerned not only with actors and their relations, but also with distinguishing between different types of such entities. For example, social scientists may want to investigate asymmetric relations in organizations with strict chains of command, or incorporate non-actors such as conferences and projects when analyzing coauthorship patterns. Multimodal social networks are those where actors and relations belong to different types, or modes, and multimodal social network analysis (mSNA) is accordingly SNA for such networks. In this paper, we present a design study that we conducted with several social scientist collaborators on how to support mSNA using visual analytics tools. Based on an openended, formative design process, we devised a visual representation called parallel node-link bands (PNLBs) that splits modes into separate bands and renders connections between adjacent ones, similar to the list view in Jigsaw. We then used the tool in a qualitative evaluation involving five social scientists whose feedback informed a second design phase that incorporated additional network metrics. Finally, we conducted a second qualitative evaluation with our social scientist collaborators that provided further insights on the utility of the PNLBs representation and the potential of visual analytics for mSNA.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Social network analysis (SNA) is becoming increasingly concerned not only with actors and their relations, but also with distinguishing between different types of such entities. For example, social scientists may want to investigate asymmetric relations in organizations with strict chains of command, or incorporate non-actors such as conferences and projects when analyzing coauthorship patterns. Multimodal social networks are those where actors and relations belong to different types, or modes, and multimodal social network analysis (mSNA) is accordingly SNA for such networks. In this paper, we present a design study that we conducted with several social scientist collaborators on how to support mSNA using visual analytics tools. Based on an openended, formative design process, we devised a visual representation called parallel node-link bands (PNLBs) that splits modes into separate bands and renders connections between adjacent ones, similar to the list view in Jigsaw. We then used the tool in a qualitative evaluation involving five social scientists whose feedback informed a second design phase that incorporated additional network metrics. Finally, we conducted a second qualitative evaluation with our social scientist collaborators that provided further insights on the utility of the PNLBs representation and the potential of visual analytics for mSNA.",
"title": "Visual Analytics for Multimodal Social Network Analysis: A Design Study with Social Scientists",
"normalizedTitle": "Visual Analytics for Multimodal Social Network Analysis: A Design Study with Social Scientists",
"fno": "ttg2013122032",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Social Network Services",
"Visual Analytics",
"Data Visualization",
"Complexity Theory",
"Design Methodology",
"User Centered Design",
"Interaction",
"Social Network Services",
"Visual Analytics",
"Data Visualization",
"Complexity Theory",
"Design Methodology",
"User Centered Design",
"Qualitative Evaluation",
"Design Study",
"User Centered Design",
"Node Link Diagrams",
"Multimodal Graphs"
],
"authors": [
{
"givenName": "Sohaib",
"surname": "Ghani",
"fullName": "Sohaib Ghani",
"affiliation": "Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Bum Chul Kwon",
"fullName": "Bum Chul Kwon",
"affiliation": "Sch. of Ind. Eng., Purdue Univ., West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Seungyoon Lee",
"fullName": "Seungyoon Lee",
"affiliation": "Brian Lamb Sch. of Commun., Purdue Univ., West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Ji Soo Yi",
"fullName": "Ji Soo Yi",
"affiliation": "Sch. of Ind. Eng., Purdue Univ., West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2032-2041",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cts/2016/2300/0/07870996",
"title": "Be the Data: Social Meetings with Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/cts/2016/07870996/12OmNAnMuEx",
"parentPublication": {
"id": "proceedings/cts/2016/2300/0",
"title": "2016 International Conference on Collaboration Technologies and Systems (CTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2014/2504/0/2504b364",
"title": "Studying Animation for Real-Time Visual Analytics: A Design Study of Social Media Analytics in Emergency Management",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2014/2504b364/12OmNBrlPzK",
"parentPublication": {
"id": "proceedings/hicss/2014/2504/0",
"title": "2014 47th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2009/3823/4/3823e332",
"title": "First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2009/3823e332/12OmNwoPtjX",
"parentPublication": {
"id": "proceedings/cse/2009/3823/2",
"title": "2009 International Conference on Computational Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/04/mcg2013040088",
"title": "Visual Matrix Clustering of Social Networks",
"doi": null,
"abstractUrl": "/magazine/cg/2013/04/mcg2013040088/13rRUx0xPCH",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/04/mcg2012040063",
"title": "The Top 10 Challenges in Extreme-Scale Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2012/04/mcg2012040063/13rRUxC0SGA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2017/3163/0/08585638",
"title": "E-Map: A Visual Analytics Approach for Exploring Significant Event Evolutions in Social Media",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2017/08585638/17D45WrVg7l",
"parentPublication": {
"id": "proceedings/vast/2017/3163/0",
"title": "2017 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805463",
"title": "VASSL: A Visual Analytics Toolkit for Social Spambot Labeling",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805463/1cG4JtVNK2A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a216",
"title": "Compositional Microservices for Immersive Social Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a216/1cMFalENINq",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2019/2605/0/08944264",
"title": "VAMD: Visual Analytics for Multimodal Data",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2019/08944264/1grOFlKsRPO",
"parentPublication": {
"id": "proceedings/ldav/2019/2605/0",
"title": "2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vizsec/2021/2085/0/208500a015",
"title": "BUCEPHALUS: a BUsiness CEntric cybersecurity Platform for proActive anaLysis Using visual analyticS",
"doi": null,
"abstractUrl": "/proceedings-article/vizsec/2021/208500a015/1z93LFcAXXa",
"parentPublication": {
"id": "proceedings/vizsec/2021/2085/0",
"title": "2021 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122022",
"articleId": "13rRUwhHcJh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122042",
"articleId": "13rRUxNW1TS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyv7moE",
"title": "February",
"year": "2008",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "30",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwJWGR",
"doi": "10.1109/TPAMI.2007.1162",
"abstract": "This paper develops a theory of frequency domain invariants in computer vision. We derive novel identities using spherical harmonics, which are the angular frequency domain analog to common spatial domain invariants such as reflectance ratios. These invariants are derived from the spherical harmonic convolution framework for reflection from a curved surface. Our identities apply in a number of canonical cases, including single and multiple images of objects under the same and different lighting conditions. One important case we consider is two different glossy objects in two different lighting environments. For this case, we derive a novel identity, independent of the specific lighting configurations or BRDFs, that allows us to directly estimate the fourth image if the other three are available. The identity can also be used as an invariant to detecttampering in the images.While this paper is primarily theoretical, it has the potential to lay the mathematical foundations for two important practical applications. First, we can develop more general algorithms for inverse rendering problems, which can directly relight and change material properties by transferring the BRDF or lighting from another object or illumination. Second, we can check the consistency of an image, to detect tampering or image splicing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper develops a theory of frequency domain invariants in computer vision. We derive novel identities using spherical harmonics, which are the angular frequency domain analog to common spatial domain invariants such as reflectance ratios. These invariants are derived from the spherical harmonic convolution framework for reflection from a curved surface. Our identities apply in a number of canonical cases, including single and multiple images of objects under the same and different lighting conditions. One important case we consider is two different glossy objects in two different lighting environments. For this case, we derive a novel identity, independent of the specific lighting configurations or BRDFs, that allows us to directly estimate the fourth image if the other three are available. The identity can also be used as an invariant to detecttampering in the images.While this paper is primarily theoretical, it has the potential to lay the mathematical foundations for two important practical applications. First, we can develop more general algorithms for inverse rendering problems, which can directly relight and change material properties by transferring the BRDF or lighting from another object or illumination. Second, we can check the consistency of an image, to detect tampering or image splicing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper develops a theory of frequency domain invariants in computer vision. We derive novel identities using spherical harmonics, which are the angular frequency domain analog to common spatial domain invariants such as reflectance ratios. These invariants are derived from the spherical harmonic convolution framework for reflection from a curved surface. Our identities apply in a number of canonical cases, including single and multiple images of objects under the same and different lighting conditions. One important case we consider is two different glossy objects in two different lighting environments. For this case, we derive a novel identity, independent of the specific lighting configurations or BRDFs, that allows us to directly estimate the fourth image if the other three are available. The identity can also be used as an invariant to detecttampering in the images.While this paper is primarily theoretical, it has the potential to lay the mathematical foundations for two important practical applications. First, we can develop more general algorithms for inverse rendering problems, which can directly relight and change material properties by transferring the BRDF or lighting from another object or illumination. Second, we can check the consistency of an image, to detect tampering or image splicing.",
"title": "A Theory Of Frequency Domain Invariants: Spherical Harmonic Identities for BRDF/Lighting Transfer and Image Consistency",
"normalizedTitle": "A Theory Of Frequency Domain Invariants: Spherical Harmonic Identities for BRDF/Lighting Transfer and Image Consistency",
"fno": "ttp2008020197",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Frequency Domain Invariants",
"Spherical Harmonic Identities",
"Convolution",
"Inverse Rendering",
"Relighting",
"Tampering",
"Image Forensics"
],
"authors": [
{
"givenName": "Dhruv",
"surname": "Mahajan",
"fullName": "Dhruv Mahajan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ravi",
"surname": "Ramamoorthi",
"fullName": "Ravi Ramamoorthi",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian",
"surname": "Curless",
"fullName": "Brian Curless",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2008-02-01 00:00:00",
"pubType": "trans",
"pages": "197-213",
"year": "2008",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacific-graphics/2010/4205/0/4205a024",
"title": "Fast Height-Field Rendering under Image-Based Lighting",
"doi": null,
"abstractUrl": "/proceedings-article/pacific-graphics/2010/4205a024/12OmNs0C9Uf",
"parentPublication": {
"id": "proceedings/pacific-graphics/2010/4205/0",
"title": "Pacific Conference on Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itcc/2003/1916/0/19160541",
"title": "ESTIMATION OF MOTION FROM A SEQUENCE OF IMAGES USING SPHERICAL PROJECTIVE GEOMETRY",
"doi": null,
"abstractUrl": "/proceedings-article/itcc/2003/19160541/12OmNxiKsdn",
"parentPublication": {
"id": "proceedings/itcc/2003/1916/0",
"title": "Information Technology: Coding and Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2013/4989/0/4989c523",
"title": "What Object Motion Reveals about Shape with Unknown BRDF and Lighting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989c523/12OmNyVes24",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/03/i0351",
"title": "Face Recognition from a Single Training Image under Arbitrary Unknown Lighting Using Spherical Harmonics",
"doi": null,
"abstractUrl": "/journal/tp/2006/03/i0351/13rRUwIF6aq",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0254",
"title": "Noise-Resistant Fitting for Spherical Harmonics",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0254/13rRUwhHcQL",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2002/10/i1322",
"title": "Analytic PCA Construction for Theoretical Analysis of Lighting Variability in Images of a Lambertian Object",
"doi": null,
"abstractUrl": "/journal/tp/2002/10/i1322/13rRUxDqS9l",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/01/ttg2010010043",
"title": "All-Frequency Lighting with Multiscale Spherical Radial Basis Functions",
"doi": null,
"abstractUrl": "/journal/tg/2010/01/ttg2010010043/13rRUxjQybO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/11/ttp2009111968",
"title": "Face Relighting from a Single Image under Arbitrary Unknown Lighting Conditions",
"doi": null,
"abstractUrl": "/journal/tp/2009/11/ttp2009111968/13rRUytF42w",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0197",
"title": "Geometry-Dependent Lighting",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0197/13rRUyuegoX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200m2810",
"title": "Sparse Needlets for Lighting Estimation with Spherical Transport Loss",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2810/1BmL7SYcA2k",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2008020195",
"articleId": "13rRUyYSWm6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2008020214",
"articleId": "13rRUxBa5t0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7b",
"title": "May/June",
"year": "2004",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "10",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjGoLw",
"doi": "10.1109/TVCG.2004.1272731",
"abstract": "Abstract—We present a new construction of lifted biorthogonal wavelets on surfaces of arbitrary two-manifold topology for compression and multiresolution representation. Our method combines three approaches: subdivision surfaces of arbitrary topology, B-spline wavelets, and the lifting scheme for biorthogonal wavelet construction. The simple building blocks of our wavelet transform are local lifting operations performed on polygonal meshes with subdivision hierarchy. Starting with a coarse, irregular polyhedral base mesh, our transform creates a subdivision hierarchy of meshes converging to a smooth limit surface. At every subdivision level, geometric detail can be expanded from wavelet coefficients and added to the surface. We present wavelet constructions for bilinear, bicubic, and biquintic B-Spline subdivision. While the bilinear and bicubic constructions perform well in numerical experiments, the biquintic construction turns out to be unstable. For lossless compression, our transform can be computed in integer arithmetic, mapping integer coordinates of control points to integer wavelet coefficients. Our approach provides a highly efficient and progressive representation for complex geometries of arbitrary topology.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We present a new construction of lifted biorthogonal wavelets on surfaces of arbitrary two-manifold topology for compression and multiresolution representation. Our method combines three approaches: subdivision surfaces of arbitrary topology, B-spline wavelets, and the lifting scheme for biorthogonal wavelet construction. The simple building blocks of our wavelet transform are local lifting operations performed on polygonal meshes with subdivision hierarchy. Starting with a coarse, irregular polyhedral base mesh, our transform creates a subdivision hierarchy of meshes converging to a smooth limit surface. At every subdivision level, geometric detail can be expanded from wavelet coefficients and added to the surface. We present wavelet constructions for bilinear, bicubic, and biquintic B-Spline subdivision. While the bilinear and bicubic constructions perform well in numerical experiments, the biquintic construction turns out to be unstable. For lossless compression, our transform can be computed in integer arithmetic, mapping integer coordinates of control points to integer wavelet coefficients. Our approach provides a highly efficient and progressive representation for complex geometries of arbitrary topology.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We present a new construction of lifted biorthogonal wavelets on surfaces of arbitrary two-manifold topology for compression and multiresolution representation. Our method combines three approaches: subdivision surfaces of arbitrary topology, B-spline wavelets, and the lifting scheme for biorthogonal wavelet construction. The simple building blocks of our wavelet transform are local lifting operations performed on polygonal meshes with subdivision hierarchy. Starting with a coarse, irregular polyhedral base mesh, our transform creates a subdivision hierarchy of meshes converging to a smooth limit surface. At every subdivision level, geometric detail can be expanded from wavelet coefficients and added to the surface. We present wavelet constructions for bilinear, bicubic, and biquintic B-Spline subdivision. While the bilinear and bicubic constructions perform well in numerical experiments, the biquintic construction turns out to be unstable. For lossless compression, our transform can be computed in integer arithmetic, mapping integer coordinates of control points to integer wavelet coefficients. Our approach provides a highly efficient and progressive representation for complex geometries of arbitrary topology.",
"title": "Generalized B-Spline Subdivision-Surface Wavelets for Geometry Compression",
"normalizedTitle": "Generalized B-Spline Subdivision-Surface Wavelets for Geometry Compression",
"fno": "v0326",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Arbitrary Topology Meshes",
"Biorthogonal Wavelets",
"Geometry Compression",
"Multiresolution Methods",
"Subdivision Surfaces"
],
"authors": [
{
"givenName": "Martin",
"surname": "Bertram",
"fullName": "Martin Bertram",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark A.",
"surname": "Duchaineau",
"fullName": "Mark A. Duchaineau",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bernd",
"surname": "Hamann",
"fullName": "Bernd Hamann",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kenneth I.",
"surname": "Joy",
"fullName": "Kenneth I. Joy",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2004-05-01 00:00:00",
"pubType": "trans",
"pages": "326-338",
"year": "2004",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/smi/2002/1546/0/15460007",
"title": "Local Subdivision Process with Doo-Sabin Subdivision Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2002/15460007/12OmNAP1Z1g",
"parentPublication": {
"id": "proceedings/smi/2002/1546/0",
"title": "Proceedings SMI. Shape Modeling International 2002",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/1997/8076/0/80760064",
"title": "Multiresolution data modelling for irregular data fields based on wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/iv/1997/80760064/12OmNBziB9g",
"parentPublication": {
"id": "proceedings/iv/1997/8076/0",
"title": "Proceedings. 1997 IEEE Conference on Information Visualization (Cat. No.97TB100165)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvgip/2008/3476/0/3476a025",
"title": "Image Denoising Using Matched Biorthogonal Wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/icvgip/2008/3476a025/12OmNrAMEXr",
"parentPublication": {
"id": "proceedings/icvgip/2008/3476/0",
"title": "Computer Vision, Graphics & Image Processing, Indian Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/3/3859c632",
"title": "Design and Properties of Two-direction Compactly Supported Wavelet Packets with an Integer Dilation Factor",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859c632/12OmNwDACkF",
"parentPublication": {
"id": "proceedings/iita/2009/3859/3",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacific-graphics/2010/4205/0/4205a032",
"title": "Computing Efficient Matrix-valued Wavelets for Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/pacific-graphics/2010/4205a032/12OmNwekjFg",
"parentPublication": {
"id": "proceedings/pacific-graphics/2010/4205/0",
"title": "Pacific Conference on Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780069",
"title": "Bicubic Subdivision-Surface Wavelets for Large-Scale Isosurface Representation and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780069/12OmNxzuMNT",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2008/3304/4/3304d120",
"title": "Construction of Biorthogonal Compactly Supported Vector-Valued Wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2008/3304d120/12OmNyRg4hX",
"parentPublication": {
"id": "proceedings/icnc/2008/3304/4",
"title": "2008 Fourth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/3/3682c505",
"title": "Existence and Design of a Kind of Biorthogonal Vector-Valued Wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682c505/12OmNzTYC23",
"parentPublication": {
"id": "proceedings/esiat/2009/3682/3",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcis/2009/3571/3/3571c170",
"title": "Construction of Filter Banks of Biorthogonal Vector-valued Compactly Supported Wavelets with Three-Scale",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2009/3571c170/12OmNzayN9j",
"parentPublication": {
"id": "proceedings/gcis/2009/3571/3",
"title": "2009 WRI Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0914",
"title": "√3-Subdivision-Based Biorthogonal Wavelets",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0914/13rRUxZ0o1n",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0314",
"articleId": "13rRUxASuG7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0339",
"articleId": "13rRUxD9gXw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxETa6I",
"title": "October",
"year": "1995",
"issueNum": "10",
"idPrefix": "tp",
"pubType": "journal",
"volume": "17",
"label": "October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZRboZ",
"doi": "10.1109/34.464561",
"abstract": "Abstract—The use of spherical harmonics for rigid and nonrigid shape representation is well known. This paper extends the method to surface harmonics defined on domains other than the sphere and to four-dimensional spherical harmonics. These harmonics enable us to represent shapes which cannot be represented as a global function in spherical coordinates, but can be in other coordinate systems. Prolate and oblate spheroidal harmonics and cylindrical harmonics are examples of surface harmonics which we find useful. Nonrigid shapes are represented as functions of space and time either by including the time-dependence as a separate factor or by using four-dimensional spherical harmonics. This paper compares the errors of fitting various surface harmonics to an assortment of synthetic and real data samples, both rigid and nonrigid. In all cases we use a linear least-squares approach to find the best fit to given range data. It is found that for some shapes there is a variation among geometries in the number of harmonics functions needed to achieve a desired accuracy. In particular, it was found that four-dimensional spherical harmonics provide an improved model of the motion of the left ventricle of the heart.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—The use of spherical harmonics for rigid and nonrigid shape representation is well known. This paper extends the method to surface harmonics defined on domains other than the sphere and to four-dimensional spherical harmonics. These harmonics enable us to represent shapes which cannot be represented as a global function in spherical coordinates, but can be in other coordinate systems. Prolate and oblate spheroidal harmonics and cylindrical harmonics are examples of surface harmonics which we find useful. Nonrigid shapes are represented as functions of space and time either by including the time-dependence as a separate factor or by using four-dimensional spherical harmonics. This paper compares the errors of fitting various surface harmonics to an assortment of synthetic and real data samples, both rigid and nonrigid. In all cases we use a linear least-squares approach to find the best fit to given range data. It is found that for some shapes there is a variation among geometries in the number of harmonics functions needed to achieve a desired accuracy. In particular, it was found that four-dimensional spherical harmonics provide an improved model of the motion of the left ventricle of the heart.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—The use of spherical harmonics for rigid and nonrigid shape representation is well known. This paper extends the method to surface harmonics defined on domains other than the sphere and to four-dimensional spherical harmonics. These harmonics enable us to represent shapes which cannot be represented as a global function in spherical coordinates, but can be in other coordinate systems. Prolate and oblate spheroidal harmonics and cylindrical harmonics are examples of surface harmonics which we find useful. Nonrigid shapes are represented as functions of space and time either by including the time-dependence as a separate factor or by using four-dimensional spherical harmonics. This paper compares the errors of fitting various surface harmonics to an assortment of synthetic and real data samples, both rigid and nonrigid. In all cases we use a linear least-squares approach to find the best fit to given range data. It is found that for some shapes there is a variation among geometries in the number of harmonics functions needed to achieve a desired accuracy. In particular, it was found that four-dimensional spherical harmonics provide an improved model of the motion of the left ventricle of the heart.",
"title": "The Use of Three- and Four-Dimensional Surface Harmonics for Rigid and Nonrigid Shape Recovery and Representation",
"normalizedTitle": "The Use of Three- and Four-Dimensional Surface Harmonics for Rigid and Nonrigid Shape Recovery and Representation",
"fno": "i0967",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Spherical Harmonics",
"Surface Harmonics",
"Nonrigid Motion",
"Shape Recovery",
"Shape Representation"
],
"authors": [
{
"givenName": "Art",
"surname": "Matheny",
"fullName": "Art Matheny",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dmitry B.",
"surname": "Goldgof",
"fullName": "Dmitry B. Goldgof",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "1995-10-01 00:00:00",
"pubType": "trans",
"pages": "967-981",
"year": "1995",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0955",
"articleId": "13rRUwwJWGB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0982",
"articleId": "13rRUIM2VI0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqIhFOo",
"title": "Dec.",
"year": "2015",
"issueNum": "12",
"idPrefix": "si",
"pubType": "journal",
"volume": "23",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwh80Ay",
"doi": "10.1109/TVLSI.2014.2382134",
"abstract": "Increasing demand of high-speed portable modules for multimedia applications has motivated the development of hardware-based solutions for image processing applications. Most of the nonrigid image registration algorithms are found to be unsuitable for hardware implementation because of their nonlinearity and computationally intensive nature. In this paper, an algorithm for nonrigid image registration based on Demons approximation is proposed. The algorithm has been simulated in MATLAB and results show a 15% improvement in peak-signal-to-noise-ratio with a 17% reduction in registration time for 256 × 256 image over the original Demons algorithm. The proposed algorithm is synthesized in Virtex6-xc6vlx760-2-ff1760 and maximum synthesized frequency is found to be 174 MHz. The proposed architecture provides the low cost, high-speed solution for the registration process, which is also helpful for making a portable system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Increasing demand of high-speed portable modules for multimedia applications has motivated the development of hardware-based solutions for image processing applications. Most of the nonrigid image registration algorithms are found to be unsuitable for hardware implementation because of their nonlinearity and computationally intensive nature. In this paper, an algorithm for nonrigid image registration based on Demons approximation is proposed. The algorithm has been simulated in MATLAB and results show a 15% improvement in peak-signal-to-noise-ratio with a 17% reduction in registration time for 256 × 256 image over the original Demons algorithm. The proposed algorithm is synthesized in Virtex6-xc6vlx760-2-ff1760 and maximum synthesized frequency is found to be 174 MHz. The proposed architecture provides the low cost, high-speed solution for the registration process, which is also helpful for making a portable system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Increasing demand of high-speed portable modules for multimedia applications has motivated the development of hardware-based solutions for image processing applications. Most of the nonrigid image registration algorithms are found to be unsuitable for hardware implementation because of their nonlinearity and computationally intensive nature. In this paper, an algorithm for nonrigid image registration based on Demons approximation is proposed. The algorithm has been simulated in MATLAB and results show a 15% improvement in peak-signal-to-noise-ratio with a 17% reduction in registration time for 256 × 256 image over the original Demons algorithm. The proposed algorithm is synthesized in Virtex6-xc6vlx760-2-ff1760 and maximum synthesized frequency is found to be 174 MHz. The proposed architecture provides the low cost, high-speed solution for the registration process, which is also helpful for making a portable system.",
"title": "VLSI-assisted nonrigid registration using modified demons algorithm",
"normalizedTitle": "VLSI-assisted nonrigid registration using modified demons algorithm",
"fno": "07010022",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Image Registration",
"Mathematics Computing",
"Monte Carlo Methods",
"Multimedia Systems",
"VLSI",
"VLSI Assisted Nonrigid Image Registration",
"Demons Algorithm",
"High Speed Portable Modules",
"Multimedia Applications",
"Hardware Based Solution Development",
"Image Processing Applications",
"Demons Approximation",
"MATLAB",
"Peak Signal To Noise Ratio",
"Virtex 6 Xc 6 Vlx 760 2 Ff 1760",
"Vectors",
"Image Registration",
"PSNR",
"Optical Imaging",
"Mathematical Model",
"Force",
"Nonlinear Optics",
"Demons Algorithm",
"Image Registration",
"Nonrigid Registration",
"Demons Algorithm",
"Image Registration",
"Nonrigid Registration"
],
"authors": [
{
"givenName": "Ashutosh",
"surname": "Mishra",
"fullName": "Ashutosh Mishra",
"affiliation": "Department of Electronics and Electrical Communication Engineering, IIT Kharagpur, Kharagpur, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pulak",
"surname": "Mondal",
"fullName": "Pulak Mondal",
"affiliation": "Department of Electronics and Electrical Communication Engineering, IIT Kharagpur, Kharagpur, India",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Swapna",
"surname": "Banerjee",
"fullName": "Swapna Banerjee",
"affiliation": "Department of Electronics and Electrical Communication Engineering, IIT Kharagpur, Kharagpur, India",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2015-12-01 00:00:00",
"pubType": "trans",
"pages": "2913-2921",
"year": "2015",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hpcc-icess/2012/4749/0/4749b321",
"title": "Demons Kernel Computation with Single-pass Stream Processing on FPGA",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2012/4749b321/12OmNA0dMGI",
"parentPublication": {
"id": "proceedings/hpcc-icess/2012/4749/0",
"title": "High Performance Computing and Communication & IEEE International Conference on Embedded Software and Systems, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2005/2405/0/24050820",
"title": "Performance Study of Nonrigid Registration Algorithm for Investigating Lung Disease on Clusters",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2005/24050820/12OmNAIvcXR",
"parentPublication": {
"id": "proceedings/pdcat/2005/2405/0",
"title": "Sixth International Conference on Parallel and Distributed Computing Applications and Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciip/2015/0148/0/07414757",
"title": "Modified demons registration for highly deformed medical images",
"doi": null,
"abstractUrl": "/proceedings-article/iciip/2015/07414757/12OmNBCHML7",
"parentPublication": {
"id": "proceedings/iciip/2015/0148/0",
"title": "2015 Third International Conference on Image Information Processing (ICIIP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1996/7258/0/72580245",
"title": "Non-Rigid Matching Using Demons",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1996/72580245/12OmNBSjJ1s",
"parentPublication": {
"id": "proceedings/cvpr/1996/7258/0",
"title": "Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__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/iccsa/2008/3243/0/3243a223",
"title": "Fast Deformable Registration on the GPU: A CUDA Implementation of Demons",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2008/3243a223/12OmNxeut4x",
"parentPublication": {
"id": "proceedings/iccsa/2008/3243/0",
"title": "2008 International Conference on Computational Sciences and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2016/9036/0/9036a124",
"title": "An Effective Non-rigid Image Registration Method Based on Active Demons Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2016/9036a124/12OmNxzMnKK",
"parentPublication": {
"id": "proceedings/cbms/2016/9036/0",
"title": "2016 IEEE 29th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2014/4435/0/4435a481",
"title": "2D/3D Non-rigid Image Registration by an Efficient Demons Approach",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2014/4435a481/12OmNzxPTKo",
"parentPublication": {
"id": "proceedings/cbms/2014/4435/0",
"title": "2014 IEEE 27th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071199",
"title": "Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071199/13rRUwI5U2E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/03/mcg2012030037",
"title": "Nonrigid-Deformation Recovery for 3D Face Recognition Using Multiscale Registration",
"doi": null,
"abstractUrl": "/magazine/cg/2012/03/mcg2012030037/13rRUy0ZzSd",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07050265",
"articleId": "13rRUxAASYJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06999942",
"articleId": "13rRUxlgy1u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04o",
"title": "July",
"year": "1991",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "13",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYjK3C",
"doi": "10.1109/34.85661",
"abstract": "The authors introduce a physically correct model of elastic nonrigid motion. This model is based on the finite element method, but decouples the degrees of freedom by breaking down object motion into rigid and nonrigid vibration or deformation modes. The result is an accurate representation for both rigid and nonrigid motion that has greatly reduced dimensionality, capturing the intuition that nonrigid motion is normally coherent and not chaotic. Because of the small number of parameters involved, this representation is used to obtain accurate overstrained estimates of both rigid and nonrigid global motion. It is also shown that these estimates can be integrated over time by use of an extended Kalman filter, resulting in stable and accurate estimates of both three-dimensional shape and three-dimensional velocity. The formulation is then extended to include constrained nonrigid motion. Examples of tracking single nonrigid objects and multiple constrained objects are presented.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors introduce a physically correct model of elastic nonrigid motion. This model is based on the finite element method, but decouples the degrees of freedom by breaking down object motion into rigid and nonrigid vibration or deformation modes. The result is an accurate representation for both rigid and nonrigid motion that has greatly reduced dimensionality, capturing the intuition that nonrigid motion is normally coherent and not chaotic. Because of the small number of parameters involved, this representation is used to obtain accurate overstrained estimates of both rigid and nonrigid global motion. It is also shown that these estimates can be integrated over time by use of an extended Kalman filter, resulting in stable and accurate estimates of both three-dimensional shape and three-dimensional velocity. The formulation is then extended to include constrained nonrigid motion. Examples of tracking single nonrigid objects and multiple constrained objects are presented.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors introduce a physically correct model of elastic nonrigid motion. This model is based on the finite element method, but decouples the degrees of freedom by breaking down object motion into rigid and nonrigid vibration or deformation modes. The result is an accurate representation for both rigid and nonrigid motion that has greatly reduced dimensionality, capturing the intuition that nonrigid motion is normally coherent and not chaotic. Because of the small number of parameters involved, this representation is used to obtain accurate overstrained estimates of both rigid and nonrigid global motion. It is also shown that these estimates can be integrated over time by use of an extended Kalman filter, resulting in stable and accurate estimates of both three-dimensional shape and three-dimensional velocity. The formulation is then extended to include constrained nonrigid motion. Examples of tracking single nonrigid objects and multiple constrained objects are presented.",
"title": "Recovery of Nonrigid Motion and Structure",
"normalizedTitle": "Recovery of Nonrigid Motion and Structure",
"fno": "i0730",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Nonrigid Motion Recovery 3 D Shape Nonrigid Structure Recovery 3 D Velocity Picture Processing Finite Element Method Deformation Modes Kalman Filter Filtering And Prediction Theory Finite Element Analysis Kalman Filters Picture Processing"
],
"authors": [
{
"givenName": "A.",
"surname": "Pentland",
"fullName": "A. Pentland",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "B.",
"surname": "Horowitz",
"fullName": "B. Horowitz",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "1991-07-01 00:00:00",
"pubType": "trans",
"pages": "730-742",
"year": "1991",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0715",
"articleId": "13rRUxcbnDk",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz2C1Bi",
"title": "June",
"year": "1993",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "15",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyfKIEe",
"doi": "10.1109/34.216732",
"abstract": "A physically based modeling method that uses adaptive-size meshes to model surfaces of rigid and nonrigid objects is presented. The initial model uses an a priori determined mesh size. However, the mesh size increases or decreases dynamically during surface reconstruction to locate nodes near surface areas of interest (like high curvature points) and to optimize the fitting error. Further, presented with multiple 3-D data frames, the mesh size varies as the data surface undergoes nonrigid motion. This model is used to reconstruct 3-D surfaces, analyze the nonrigid motion, track the corresponding points in nonrigid motion, and create graphic animation and visualization. The method was tested on real range data, on simulated nonrigid motion, and on real data for the left ventricular motion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A physically based modeling method that uses adaptive-size meshes to model surfaces of rigid and nonrigid objects is presented. The initial model uses an a priori determined mesh size. However, the mesh size increases or decreases dynamically during surface reconstruction to locate nodes near surface areas of interest (like high curvature points) and to optimize the fitting error. Further, presented with multiple 3-D data frames, the mesh size varies as the data surface undergoes nonrigid motion. This model is used to reconstruct 3-D surfaces, analyze the nonrigid motion, track the corresponding points in nonrigid motion, and create graphic animation and visualization. The method was tested on real range data, on simulated nonrigid motion, and on real data for the left ventricular motion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A physically based modeling method that uses adaptive-size meshes to model surfaces of rigid and nonrigid objects is presented. The initial model uses an a priori determined mesh size. However, the mesh size increases or decreases dynamically during surface reconstruction to locate nodes near surface areas of interest (like high curvature points) and to optimize the fitting error. Further, presented with multiple 3-D data frames, the mesh size varies as the data surface undergoes nonrigid motion. This model is used to reconstruct 3-D surfaces, analyze the nonrigid motion, track the corresponding points in nonrigid motion, and create graphic animation and visualization. The method was tested on real range data, on simulated nonrigid motion, and on real data for the left ventricular motion.",
"title": "Adaptive-Size Meshes for Rigid and Nonrigid Shape Analysis and Synthesis",
"normalizedTitle": "Adaptive-Size Meshes for Rigid and Nonrigid Shape Analysis and Synthesis",
"fno": "i0611",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Reconstruction Solid Modelling Finite Element Analysis Rigid Shape Shape Synthesis Shape Analysis Physically Based Modeling Method Adaptive Size Meshes Nonrigid Objects Surface Reconstruction Multiple 3 D Data Frames Nonrigid Motion Graphic Animation Visualization Left Ventricular Motion Finite Element Analysis Image Reconstruction Solid Modelling"
],
"authors": [
{
"givenName": "W.C.",
"surname": "Huang",
"fullName": "W.C. Huang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "D.B.",
"surname": "Goldgof",
"fullName": "D.B. Goldgof",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1993-06-01 00:00:00",
"pubType": "trans",
"pages": "611-616",
"year": "1993",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0605",
"articleId": "13rRUIJcWm7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0617",
"articleId": "13rRUwvT9hb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzQhP6P",
"title": "November",
"year": "2011",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUytF42E",
"doi": "10.1109/TPAMI.2011.93",
"abstract": "This paper addresses the problem of matting motion blurred objects from a single image. Existing single image matting methods are designed to extract static objects that have fractional pixel occupancy. This arises because the physical scene object has a finer resolution than the discrete image pixel and therefore only occupies a fraction of the pixel. For a motion blurred object, however, fractional pixel occupancy is attributed to the object's motion over the exposure period. While conventional matting techniques can be used to matte motion blurred objects, they are not formulated in a manner that considers the object's motion and tend to work only when the object is on a homogeneous background. We show how to obtain better alpha mattes by introducing a regularization term in the matting formulation to account for the object's motion. In addition, we outline a method for estimating local object motion based on local gradient statistics from the original image. For the sake of completeness, we also discuss how user markup can be used to denote the local direction in lieu of motion estimation. Improvements to alpha mattes computed with our regularization are demonstrated on a variety of examples.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper addresses the problem of matting motion blurred objects from a single image. Existing single image matting methods are designed to extract static objects that have fractional pixel occupancy. This arises because the physical scene object has a finer resolution than the discrete image pixel and therefore only occupies a fraction of the pixel. For a motion blurred object, however, fractional pixel occupancy is attributed to the object's motion over the exposure period. While conventional matting techniques can be used to matte motion blurred objects, they are not formulated in a manner that considers the object's motion and tend to work only when the object is on a homogeneous background. We show how to obtain better alpha mattes by introducing a regularization term in the matting formulation to account for the object's motion. In addition, we outline a method for estimating local object motion based on local gradient statistics from the original image. For the sake of completeness, we also discuss how user markup can be used to denote the local direction in lieu of motion estimation. Improvements to alpha mattes computed with our regularization are demonstrated on a variety of examples.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper addresses the problem of matting motion blurred objects from a single image. Existing single image matting methods are designed to extract static objects that have fractional pixel occupancy. This arises because the physical scene object has a finer resolution than the discrete image pixel and therefore only occupies a fraction of the pixel. For a motion blurred object, however, fractional pixel occupancy is attributed to the object's motion over the exposure period. While conventional matting techniques can be used to matte motion blurred objects, they are not formulated in a manner that considers the object's motion and tend to work only when the object is on a homogeneous background. We show how to obtain better alpha mattes by introducing a regularization term in the matting formulation to account for the object's motion. In addition, we outline a method for estimating local object motion based on local gradient statistics from the original image. For the sake of completeness, we also discuss how user markup can be used to denote the local direction in lieu of motion estimation. Improvements to alpha mattes computed with our regularization are demonstrated on a variety of examples.",
"title": "Motion Regularization for Matting Motion Blurred Objects",
"normalizedTitle": "Motion Regularization for Matting Motion Blurred Objects",
"fno": "ttp2011112329",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Matting",
"Regularization",
"Motion Direction Estimation",
"Motion Blur"
],
"authors": [
{
"givenName": "Hai Ting",
"surname": "Lin",
"fullName": "Hai Ting Lin",
"affiliation": "National University of Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu-Wing",
"surname": "Tai",
"fullName": "Yu-Wing Tai",
"affiliation": "Korean Advanced Institute of Science and Technology, Daejeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael S.",
"surname": "Brown",
"fullName": "Michael S. Brown",
"affiliation": "National University of Singapore, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2011-11-01 00:00:00",
"pubType": "trans",
"pages": "2329-2336",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2011/0394/0/05995495",
"title": "A global sampling method for alpha matting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995495/12OmNBhpS8q",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2009/3883/0/3883a103",
"title": "Joint Matting and Gradient-Domain Deringing for Image Deblurring",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2009/3883a103/12OmNqG0SJJ",
"parentPublication": {
"id": "proceedings/icig/2009/3883/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2011/4559/0/4559a041",
"title": "Effective Pretreatment in Identification of Motion-Blur Direction",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2011/4559a041/12OmNwCsdP2",
"parentPublication": {
"id": "proceedings/mines/2011/4559/0",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2008/3494/1/3494a669",
"title": "Identification of Blurred Extent with Rotation Motion Blurred Image",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a669/12OmNxFJXAK",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2013/3211/0/3211a201",
"title": "Motion Estimation in Blurred Frames Using Phase Correlation",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2013/3211a201/12OmNxeut0e",
"parentPublication": {
"id": "proceedings/sitis/2013/3211/0",
"title": "2013 International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2009/3651/0/3651a001",
"title": "Optical Flow from Motion Blurred Color Images",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2009/3651a001/12OmNySosIy",
"parentPublication": {
"id": "proceedings/crv/2009/3651/0",
"title": "2009 Canadian Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2009/3583/1/3583a453",
"title": "Direction Parameter Identification of Motion-Blurred Image Based on Three Second Order Frequency Moments",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583a453/12OmNzZmZrV",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/3",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/08/ttp2011081603",
"title": "Richardson-Lucy Deblurring for Scenes under a Projective Motion Path",
"doi": null,
"abstractUrl": "/journal/tp/2011/08/ttp2011081603/13rRUIM2VIc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2004/06/i0689",
"title": "Motion-Based Motion Deblurring",
"doi": null,
"abstractUrl": "/journal/tp/2004/06/i0689/13rRUwdIOVO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600p5969",
"title": "Motion-from-Blur: 3D Shape and Motion Estimation of Motion-blurred Objects in Videos",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600p5969/1H1lSCn4Y24",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011112321",
"articleId": "13rRUwbaqMH",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAkWvGf",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "36",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBJhnT",
"doi": "10.1109/TPAMI.2014.2330611",
"abstract": "Image completion involves filling missing parts in images. In this paper we address this problem through novel statistics of similar patches. We observe that if we match similar patches in the image and obtain their offsets (relative positions), the statistics of these offsets are sparsely distributed. We further observe that a few dominant offsets provide reliable information for completing the image. Such statistics can be incorporated into both matching-based and graph-based methods for image completion. Experiments show that our method yields better results in various challenging cases, and is faster than existing state-of-the-art methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Image completion involves filling missing parts in images. In this paper we address this problem through novel statistics of similar patches. We observe that if we match similar patches in the image and obtain their offsets (relative positions), the statistics of these offsets are sparsely distributed. We further observe that a few dominant offsets provide reliable information for completing the image. Such statistics can be incorporated into both matching-based and graph-based methods for image completion. Experiments show that our method yields better results in various challenging cases, and is faster than existing state-of-the-art methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Image completion involves filling missing parts in images. In this paper we address this problem through novel statistics of similar patches. We observe that if we match similar patches in the image and obtain their offsets (relative positions), the statistics of these offsets are sparsely distributed. We further observe that a few dominant offsets provide reliable information for completing the image. Such statistics can be incorporated into both matching-based and graph-based methods for image completion. Experiments show that our method yields better results in various challenging cases, and is faster than existing state-of-the-art methods.",
"title": "Image Completion Approaches Using the Statistics of Similar Patches",
"normalizedTitle": "Image Completion Approaches Using the Statistics of Similar Patches",
"fno": "06853394",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Color Analysis",
"Coherence",
"Histograms",
"Reliability",
"Cost Function",
"Sun",
"Semantics",
"Natural Image Statistics",
"Image Completion",
"Image Inpainting"
],
"authors": [
{
"givenName": "Kaiming",
"surname": "He",
"fullName": "Kaiming He",
"affiliation": "Visual Computing Group, Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Sun",
"fullName": "Jian Sun",
"affiliation": "Visual Computing Group, Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2423-2435",
"year": "2014",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2017/2610/0/261001a383",
"title": "Learning Quadrangulated Patches for 3D Shape Parameterization and Completion",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a383/12OmNApcuxi",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2011/4353/2/05750952",
"title": "Image Completion Using Constrained Delaunay Triangulation",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2011/05750952/12OmNBNM8Sj",
"parentPublication": {
"id": "icicta/2011/4353/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fit/2016/5300/0/5300a252",
"title": "Scene Completion Using Top-1 Similar Image",
"doi": null,
"abstractUrl": "/proceedings-article/fit/2016/5300a252/12OmNCf1DwX",
"parentPublication": {
"id": "proceedings/fit/2016/5300/0",
"title": "2016 International Conference on Frontiers of Information Technology (FIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d191",
"title": "Activity Auto-Completion: Predicting Human Activities from Partial Videos",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d191/12OmNCvumTl",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2012/4873/0/4873a555",
"title": "PatchMatch-Based Content Completion of Stereo Image Pairs",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2012/4873a555/12OmNrkBwy5",
"parentPublication": {
"id": "proceedings/3dimpvt/2012/4873/0",
"title": "2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995401",
"title": "Internal statistics of a single natural image",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995401/12OmNxaeu2D",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eidwt/2013/2141/0/5044a696",
"title": "Exemplar Image Completion Based on Evolutionary Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/eidwt/2013/5044a696/12OmNyrIatO",
"parentPublication": {
"id": "proceedings/eidwt/2013/2141/0",
"title": "2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2014/7000/1/7000a353",
"title": "3D Model Retargeting Using Offset Statistics",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2014/7000a353/12OmNzBOhO4",
"parentPublication": {
"id": "proceedings/3dv/2014/7000/2",
"title": "2014 2nd International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000b848",
"title": "Disentangling Structure and Aesthetics for Style-Aware Image Completion",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000b848/17D45VTRovJ",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2019/1975/0/197500b886",
"title": "Good Similar Patches for Image Denoising",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500b886/18j8OcUzs8U",
"parentPublication": {
"id": "proceedings/wacv/2019/1975/0",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06816038",
"articleId": "13rRUxNEqRl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06816032",
"articleId": "13rRUxC0Sx6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzd7bmn",
"title": "June",
"year": "2016",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "38",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBJhwK",
"doi": "10.1109/TPAMI.2015.2484342",
"abstract": "The bag-of-words (BoW) model treats images as sets of local descriptors and represents them by visual word histograms. The Fisher vector (FV) representation extends BoW, by considering the first and second order statistics of local descriptors. In both representations local descriptors are assumed to be identically and independently distributed (iid), which is a poor assumption from a modeling perspective. It has been experimentally observed that the performance of BoW and FV representations can be improved by employing discounting transformations such as power normalization. In this paper, we introduce non-iid models by treating the model parameters as latent variables which are integrated out, rendering all local regions dependent. Using the Fisher kernel principle we encode an image by the gradient of the data log-likelihood w.r.t. the model hyper-parameters. Our models naturally generate discounting effects in the representations; suggesting that such transformations have proven successful because they closely correspond to the representations obtained for non-iid models. To enable tractable computation, we rely on variational free-energy bounds to learn the hyper-parameters and to compute approximate Fisher kernels. Our experimental evaluation results validate that our models lead to performance improvements comparable to using power normalization, as employed in state-of-the-art feature aggregation methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The bag-of-words (BoW) model treats images as sets of local descriptors and represents them by visual word histograms. The Fisher vector (FV) representation extends BoW, by considering the first and second order statistics of local descriptors. In both representations local descriptors are assumed to be identically and independently distributed (iid), which is a poor assumption from a modeling perspective. It has been experimentally observed that the performance of BoW and FV representations can be improved by employing discounting transformations such as power normalization. In this paper, we introduce non-iid models by treating the model parameters as latent variables which are integrated out, rendering all local regions dependent. Using the Fisher kernel principle we encode an image by the gradient of the data log-likelihood w.r.t. the model hyper-parameters. Our models naturally generate discounting effects in the representations; suggesting that such transformations have proven successful because they closely correspond to the representations obtained for non-iid models. To enable tractable computation, we rely on variational free-energy bounds to learn the hyper-parameters and to compute approximate Fisher kernels. Our experimental evaluation results validate that our models lead to performance improvements comparable to using power normalization, as employed in state-of-the-art feature aggregation methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The bag-of-words (BoW) model treats images as sets of local descriptors and represents them by visual word histograms. The Fisher vector (FV) representation extends BoW, by considering the first and second order statistics of local descriptors. In both representations local descriptors are assumed to be identically and independently distributed (iid), which is a poor assumption from a modeling perspective. It has been experimentally observed that the performance of BoW and FV representations can be improved by employing discounting transformations such as power normalization. In this paper, we introduce non-iid models by treating the model parameters as latent variables which are integrated out, rendering all local regions dependent. Using the Fisher kernel principle we encode an image by the gradient of the data log-likelihood w.r.t. the model hyper-parameters. Our models naturally generate discounting effects in the representations; suggesting that such transformations have proven successful because they closely correspond to the representations obtained for non-iid models. To enable tractable computation, we rely on variational free-energy bounds to learn the hyper-parameters and to compute approximate Fisher kernels. Our experimental evaluation results validate that our models lead to performance improvements comparable to using power normalization, as employed in state-of-the-art feature aggregation methods.",
"title": "Approximate Fisher Kernels of Non-iid Image Models for Image Categorization",
"normalizedTitle": "Approximate Fisher Kernels of Non-iid Image Models for Image Categorization",
"fno": "07286858",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Kernel",
"Computational Modeling",
"Visualization",
"Approximation Methods",
"Histograms",
"Image Representation",
"Analytical Models",
"Fisher Kernels",
"Statistical Image Representations",
"Object Recognition",
"Image Classification",
"Fisher Kernels",
"Statistical Image Representations",
"Object Recognition",
"Image Classification"
],
"authors": [
{
"givenName": "Ramazan Gokberk",
"surname": "Cinbis",
"fullName": "Ramazan Gokberk Cinbis",
"affiliation": ", Milsoft, Ankara, Turkey",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jakob",
"surname": "Verbeek",
"fullName": "Jakob Verbeek",
"affiliation": "LEAR team, Inria Grenoble Rhône-Alpes, Laboratoire Jean Kuntzmann, CNRS, University Grenoble Alpes, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cordelia",
"surname": "Schmid",
"fullName": "Cordelia Schmid",
"affiliation": "LEAR team, Inria Grenoble Rhône-Alpes, Laboratoire Jean Kuntzmann, CNRS, University Grenoble Alpes, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2016-06-01 00:00:00",
"pubType": "trans",
"pages": "1084-1098",
"year": "2016",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2012/2216/0/06460165",
"title": "Contextual Fisher kernels for human action recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460165/12OmNBziBaq",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2012/4711/0/4711a979",
"title": "Evaluating Gaussian Like Image Representations over Local Features",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2012/4711a979/12OmNCulYjm",
"parentPublication": {
"id": "proceedings/icme/2012/4711/0",
"title": "2012 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2007/1179/0/04270291",
"title": "Fisher Kernels on Visual Vocabularies for Image Categorization",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2007/04270291/12OmNqJHFL3",
"parentPublication": {
"id": "proceedings/cvpr/2007/1179/0",
"title": "2007 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/276P2C14",
"title": "Image categorization using Fisher kernels of non-iid image models",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/276P2C14/12OmNqNosbV",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2009/3725/0/3725a106",
"title": "Fisher Kernels for Handwritten Word-spotting",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2009/3725a106/12OmNrYCXJm",
"parentPublication": {
"id": "proceedings/icdar/2009/3725/0",
"title": "2009 10th International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118b402",
"title": "Deep Fisher Kernels -- End to End Learning of the Fisher Kernel GMM Parameters",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118b402/12OmNwp74K6",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2015/8332/0/8332a135",
"title": "Convolutional Fisher Kernels for RGB-D Object Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a135/12OmNx6PiCe",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2013/5053/0/06474994",
"title": "Large-scale web video event classification by use of Fisher Vectors",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2013/06474994/12OmNxd4ttg",
"parentPublication": {
"id": "proceedings/wacv/2013/5053/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2011/1101/0/06126406",
"title": "Modeling spatial layout with fisher vectors for image categorization",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2011/06126406/12OmNybfr8B",
"parentPublication": {
"id": "proceedings/iccv/2011/1101/0",
"title": "2011 IEEE International Conference on Computer Vision (ICCV 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209d588",
"title": "Label Consistent Fisher Vectors for Supervised Feature Aggregation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209d588/12OmNznkK0G",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07254213",
"articleId": "13rRUy0HYL3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07254191",
"articleId": "13rRUwhHcKr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6QH",
"title": "Sept.",
"year": "2014",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "36",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUypp58N",
"doi": "10.1109/TPAMI.2014.2299809",
"abstract": "This paper is aimed at obtaining the statistics as a probabilistic model pertaining to the geometric, topological and photometric structure of natural images. The image structure is represented by its segmentation graph derived from the low-level hierarchical multiscale image segmentation. We first estimate the statistics of a number of segmentation graph properties from a large number of images. Our estimates confirm some findings reported in the past work, as well as provide some new ones. We then obtain a Markov random field based model of the segmentation graph which subsumes the observed statistics. To demonstrate the value of the model and the statistics, we show how its use as a prior impacts three applications: image classification, semantic image segmentation and object detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper is aimed at obtaining the statistics as a probabilistic model pertaining to the geometric, topological and photometric structure of natural images. The image structure is represented by its segmentation graph derived from the low-level hierarchical multiscale image segmentation. We first estimate the statistics of a number of segmentation graph properties from a large number of images. Our estimates confirm some findings reported in the past work, as well as provide some new ones. We then obtain a Markov random field based model of the segmentation graph which subsumes the observed statistics. To demonstrate the value of the model and the statistics, we show how its use as a prior impacts three applications: image classification, semantic image segmentation and object detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper is aimed at obtaining the statistics as a probabilistic model pertaining to the geometric, topological and photometric structure of natural images. The image structure is represented by its segmentation graph derived from the low-level hierarchical multiscale image segmentation. We first estimate the statistics of a number of segmentation graph properties from a large number of images. Our estimates confirm some findings reported in the past work, as well as provide some new ones. We then obtain a Markov random field based model of the segmentation graph which subsumes the observed statistics. To demonstrate the value of the model and the statistics, we show how its use as a prior impacts three applications: image classification, semantic image segmentation and object detection.",
"title": "Low-Level Hierarchical Multiscale Segmentation Statistics of Natural Images",
"normalizedTitle": "Low-Level Hierarchical Multiscale Segmentation Statistics of Natural Images",
"fno": "06710173",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Segmentation",
"Histograms",
"Computational Modeling",
"Vectors",
"Image Edge Detection",
"Markov Processes",
"Gray Scale",
"Markov Random Field",
"Natural Image Statistics",
"Low Level Hierarchical Segmentation"
],
"authors": [
{
"givenName": "Emre",
"surname": "Akbas",
"fullName": "Emre Akbas",
"affiliation": "Department of Psychological and Brain Sciences, University of California Santa Barbara, Santa Barbara,",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Narendra",
"surname": "Ahuja",
"fullName": "Narendra Ahuja",
"affiliation": "Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana,",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2014-09-01 00:00:00",
"pubType": "trans",
"pages": "1900-1906",
"year": "2014",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2010/8420/0/05720384",
"title": "Image Segmentation Using Component Tree and Normalized Cut",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720384/12OmNApLGSk",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2007/2909/2/290920187",
"title": "Study on Statistics Iterative Thresholding Segmentation Based on Aviation Image",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2007/290920187/12OmNBSSVrI",
"parentPublication": {
"id": "proceedings/snpd/2007/2909/2",
"title": "Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2003/1950/2/195021259",
"title": "Natural Image Statistics for Natural Image Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2003/195021259/12OmNwekjCC",
"parentPublication": {
"id": "proceedings/iccv/2003/1950/2",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2004/2158/1/01315039",
"title": "Segmentation using multiscale cues",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315039/12OmNxaw5br",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/1",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460613",
"title": "HDP-MRF: A hierarchical Nonparametric model for image segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460613/12OmNyKJime",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761590",
"title": "A fast hierarchical approach to image segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761590/12OmNyaGeK5",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2015/6850/0/6850a466",
"title": "Self-Adaptive Threshold Based on Differential Evolution for Image Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2015/6850a466/12OmNzaQoiw",
"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/2013/07/ttg2013071228",
"title": "Visualizing Natural Image Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071228/13rRUxASuMB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/12/06853394",
"title": "Image Completion Approaches Using the Statistics of Similar Patches",
"doi": null,
"abstractUrl": "/journal/tp/2014/12/06853394/13rRUxBJhnT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06740859",
"articleId": "13rRUxcbnDL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06868333",
"articleId": "13rRUxNEqRk",
"__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": "13rRUy3gn7z",
"doi": "10.1109/TVCG.2015.2448105",
"abstract": "The Finite Element Method (FEM) is commonly used to simulate isotropic deformable objects in computer graphics. Several applications (wood, plants, muscles) require modeling the directional dependence of the material elastic properties in three orthogonal directions. We investigate linear orthotropic materials, a special class of linear anisotropic materials where the shear stresses are decoupled from normal stresses, as well as general linear (non-orthotropic) anisotropic materials. Orthotropic materials generalize transversely isotropic materials, by exhibiting different stiffness in three orthogonal directions. Orthotropic materials are, however, parameterized by nine values that are difficult to tune in practice, as poorly adjusted settings easily lead to simulation instabilities. We present a user-friendly approach to setting these parameters that is guaranteed to be stable. Our approach is intuitive as it extends the familiar intuition known from isotropic materials. Similarly to linear orthotropic materials, we also derive a stability condition for a subset of general linear anisotropic materials, and give intuitive approaches to tuning them. In order to simulate large deformations, we augment linear corotational FEM simulations with our orthotropic and general anisotropic materials.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Finite Element Method (FEM) is commonly used to simulate isotropic deformable objects in computer graphics. Several applications (wood, plants, muscles) require modeling the directional dependence of the material elastic properties in three orthogonal directions. We investigate linear orthotropic materials, a special class of linear anisotropic materials where the shear stresses are decoupled from normal stresses, as well as general linear (non-orthotropic) anisotropic materials. Orthotropic materials generalize transversely isotropic materials, by exhibiting different stiffness in three orthogonal directions. Orthotropic materials are, however, parameterized by nine values that are difficult to tune in practice, as poorly adjusted settings easily lead to simulation instabilities. We present a user-friendly approach to setting these parameters that is guaranteed to be stable. Our approach is intuitive as it extends the familiar intuition known from isotropic materials. Similarly to linear orthotropic materials, we also derive a stability condition for a subset of general linear anisotropic materials, and give intuitive approaches to tuning them. In order to simulate large deformations, we augment linear corotational FEM simulations with our orthotropic and general anisotropic materials.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Finite Element Method (FEM) is commonly used to simulate isotropic deformable objects in computer graphics. Several applications (wood, plants, muscles) require modeling the directional dependence of the material elastic properties in three orthogonal directions. We investigate linear orthotropic materials, a special class of linear anisotropic materials where the shear stresses are decoupled from normal stresses, as well as general linear (non-orthotropic) anisotropic materials. Orthotropic materials generalize transversely isotropic materials, by exhibiting different stiffness in three orthogonal directions. Orthotropic materials are, however, parameterized by nine values that are difficult to tune in practice, as poorly adjusted settings easily lead to simulation instabilities. We present a user-friendly approach to setting these parameters that is guaranteed to be stable. Our approach is intuitive as it extends the familiar intuition known from isotropic materials. Similarly to linear orthotropic materials, we also derive a stability condition for a subset of general linear anisotropic materials, and give intuitive approaches to tuning them. In order to simulate large deformations, we augment linear corotational FEM simulations with our orthotropic and general anisotropic materials.",
"title": "Stable Anisotropic Materials",
"normalizedTitle": "Stable Anisotropic Materials",
"fno": "07130660",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Animation",
"Elasticity",
"Finite Element Analysis",
"Mechanical Engineering Computing",
"Mechanical Stability",
"Stable Anisotropic Materials",
"Finite Element Method",
"Computer Graphics",
"Material Elastic Properties",
"Linear Orthotropic Materials",
"Shear Stresses",
"Normal Stresses",
"General Linear Anisotropic Materials",
"Stability Condition",
"Linear Corotational FEM Simulations",
"Anisotropic Magnetoresistance",
"Strain",
"Stability Analysis",
"Tensile Stress",
"Elasticity",
"Symmetric Matrices",
"Computer Graphics",
"Animation",
"Orthotropic Materials",
"Anisotropic Materials",
"Finite Element Method",
"Computer Graphics",
"Animation",
"Orthotropic Materials",
"Anisotropic Materials",
"Finite Element Method"
],
"authors": [
{
"givenName": "Yijing",
"surname": "Li",
"fullName": "Yijing Li",
"affiliation": "Department of Computer Science, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jernej",
"surname": "Barbič",
"fullName": "Jernej Barbič",
"affiliation": "Department of Computer Science, University of Southern California, Los Angeles, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2015-10-01 00:00:00",
"pubType": "trans",
"pages": "1129-1137",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2015/7568/0/7568a392",
"title": "Simulation and Visualization of Deformation with Anisotropic Materials",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a392/12OmNAOKnXL",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2014/4284/0/4284a111",
"title": "Adaptive Anisotropic Diffusion for Image Denoising Based on Structure Tensor",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2014/4284a111/12OmNAS9zBg",
"parentPublication": {
"id": "proceedings/icdh/2014/4284/0",
"title": "2014 5th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/reldis/1991/2260/0/00145403",
"title": "A statistical clock synchronization algorithm for anisotropic networks",
"doi": null,
"abstractUrl": "/proceedings-article/reldis/1991/00145403/12OmNBhHt9f",
"parentPublication": {
"id": "proceedings/reldis/1991/2260/0",
"title": "Proceedings Tenth Symposium on Reliable Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2004/2158/1/01315086",
"title": "Scale selection for anisotropic scale-space: application to volumetric tumor characterization",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315086/12OmNyKJikE",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/1",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2010/7259/0/05521462",
"title": "Reversely Anisotropic Quad-dominant Remeshing",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2010/05521462/12OmNywxlVm",
"parentPublication": {
"id": "proceedings/smi/2010/7259/0",
"title": "Shape Modeling International (SMI 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459425",
"title": "Image compression with anisotropic triangulations",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459425/12OmNzlly5j",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07194844",
"title": "Anisotropic Ambient Volume Shading",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07194844/13rRUB7a1fT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/07/ttg2013071143",
"title": "Generalized Anisotropic Stratified Surface Sampling",
"doi": null,
"abstractUrl": "/journal/tg/2013/07/ttg2013071143/13rRUILc8fc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/11/ttg2013111782",
"title": "Anisotropic Sampling of Planar and Two-Manifold Domains for Texture Generation and Glyph Distribution",
"doi": null,
"abstractUrl": "/journal/tg/2013/11/ttg2013111782/13rRUNvgziE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933592",
"title": "Visualization of Symmetries in Fourth-Order Stiffness Tensors",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933592/1fTgHrkjNWE",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07132780",
"articleId": "13rRUxlgy3K",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07127098",
"articleId": "13rRUxcsYLP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet4K",
"name": "ttg201510-07130660s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201510-07130660s1.zip",
"extension": "zip",
"size": "28.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnV",
"title": "Feb.",
"year": "2014",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYrbUH",
"doi": "10.1109/TVCG.2013.108",
"abstract": "Origamic architecture (OA) is a form of papercraft that involves cutting and folding a single sheet of paper to produce a 3D pop-up, and is commonly used to depict architectural structures. Because of the strict geometric and physical constraints, OA design requires considerable skill and effort. In this paper, we present a method to automatically generate an OA design that closely depicts an input 3D model. Our algorithm is guided by a novel set of geometric conditions to guarantee the foldability and stability of the generated pop-ups. The generality of the conditions allows our algorithm to generate valid pop-up structures that are previously not accounted for by other algorithms. Our method takes a novel image-domain approach to convert the input model to an OA design. It performs surface segmentation of the input model in the image domain, and carefully represents each surface with a set of parallel patches. Patches are then modified to make the entire structure foldable and stable. Visual and quantitative comparisons of results have shown our algorithm to be significantly better than the existing methods in the preservation of contours, surfaces, and volume. The designs have also been shown to more closely resemble those created by real artists.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Origamic architecture (OA) is a form of papercraft that involves cutting and folding a single sheet of paper to produce a 3D pop-up, and is commonly used to depict architectural structures. Because of the strict geometric and physical constraints, OA design requires considerable skill and effort. In this paper, we present a method to automatically generate an OA design that closely depicts an input 3D model. Our algorithm is guided by a novel set of geometric conditions to guarantee the foldability and stability of the generated pop-ups. The generality of the conditions allows our algorithm to generate valid pop-up structures that are previously not accounted for by other algorithms. Our method takes a novel image-domain approach to convert the input model to an OA design. It performs surface segmentation of the input model in the image domain, and carefully represents each surface with a set of parallel patches. Patches are then modified to make the entire structure foldable and stable. Visual and quantitative comparisons of results have shown our algorithm to be significantly better than the existing methods in the preservation of contours, surfaces, and volume. The designs have also been shown to more closely resemble those created by real artists.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Origamic architecture (OA) is a form of papercraft that involves cutting and folding a single sheet of paper to produce a 3D pop-up, and is commonly used to depict architectural structures. Because of the strict geometric and physical constraints, OA design requires considerable skill and effort. In this paper, we present a method to automatically generate an OA design that closely depicts an input 3D model. Our algorithm is guided by a novel set of geometric conditions to guarantee the foldability and stability of the generated pop-ups. The generality of the conditions allows our algorithm to generate valid pop-up structures that are previously not accounted for by other algorithms. Our method takes a novel image-domain approach to convert the input model to an OA design. It performs surface segmentation of the input model in the image domain, and carefully represents each surface with a set of parallel patches. Patches are then modified to make the entire structure foldable and stable. Visual and quantitative comparisons of results have shown our algorithm to be significantly better than the existing methods in the preservation of contours, surfaces, and volume. The designs have also been shown to more closely resemble those created by real artists.",
"title": "Surface and contour-preserving origamic architecture paper pop-ups",
"normalizedTitle": "Surface and contour-preserving origamic architecture paper pop-ups",
"fno": "ttg2014020276",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Algorithm Design And Analysis",
"Solid Modeling",
"Stability Analysis",
"Shape",
"Computer Architecture",
"Layout",
"Computational Modeling",
"Pop Up Stability",
"Computer Art",
"Papercraft",
"Paper Architecture",
"Surface Segmentation",
"Shape Abstraction",
"Pop Up Foldability"
],
"authors": [
{
"givenName": "Sang N.",
"surname": "Le",
"fullName": "Sang N. Le",
"affiliation": "Sch. of Comput., Nat. Univ. of Singapore, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Su-Jun Leow",
"fullName": "Su-Jun Leow",
"affiliation": "Sch. of Comput., Nat. Univ. of Singapore, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Tuong-Vu Le-Nguyen",
"fullName": "Tuong-Vu Le-Nguyen",
"affiliation": "Sch. of Comput., Nat. Univ. of Singapore, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Conrado",
"surname": "Ruiz",
"fullName": "Conrado Ruiz",
"affiliation": "Sch. of Comput., Nat. Univ. of Singapore, Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Kok-Lim Low",
"fullName": "Kok-Lim Low",
"affiliation": "Sch. of Comput., Nat. Univ. of Singapore, Singapore, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2014-02-01 00:00:00",
"pubType": "trans",
"pages": "276-288",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2012/1204/0/06184168",
"title": "An interactive augmented reality coloring book",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2012/06184168/12OmNAIMO6Y",
"parentPublication": {
"id": "proceedings/3dui/2012/1204/0",
"title": "2012 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2011/2183/0/06162906",
"title": "An interactive augmented reality coloring book",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2011/06162906/12OmNx6xHl0",
"parentPublication": {
"id": "proceedings/ismar/2011/2183/0",
"title": "2011 10th IEEE International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1992/2855/0/00223169",
"title": "Contour matching using local affine transformations",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223169/12OmNyrIarm",
"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/tg/2013/11/ttg2013111795",
"title": "Automatic Paper Sliceform Design from 3D Solid Models",
"doi": null,
"abstractUrl": "/journal/tg/2013/11/ttg2013111795/13rRUxlgy3H",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2018/5710/0/08524711",
"title": "Method for Speeding a Differential Operational Amplifier in the Invert Connection Circuit",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2018/08524711/17D45Wc1IKu",
"parentPublication": {
"id": "proceedings/ewdts/2018/5710/0",
"title": "2018 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/091500d917",
"title": "PoP-Net: Pose over Parts Network for Multi-Person 3D Pose Estimation from a Depth Image",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500d917/1B13ndNQ3N6",
"parentPublication": {
"id": "proceedings/wacv/2022/0915/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09825626",
"title": "Image-Based OA-style Paper Pop-up Design via Mixed-Integer Programming",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09825626/1EQeZhjlQDm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/08/09296787",
"title": "Blending Surface Segmentation and Editing for 3D Models",
"doi": null,
"abstractUrl": "/journal/tg/2022/08/09296787/1pDnA5z2Kdy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2020/8961/0/09274002",
"title": "Pop-up Makerspace Module in Undergraduate Studies Inculcating Entrepreneurial Mindset",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2020/09274002/1phRNShZ3Z6",
"parentPublication": {
"id": "proceedings/fie/2020/8961/0",
"title": "2020 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mipr/2021/1865/0/186500a223",
"title": "Pop’n Food: 3D Food Model Estimation System from a Single Image",
"doi": null,
"abstractUrl": "/proceedings-article/mipr/2021/186500a223/1xPsodJpVfi",
"parentPublication": {
"id": "proceedings/mipr/2021/1865/0",
"title": "2021 IEEE 4th International Conference on Multimedia Information Processing and Retrieval (MIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2014020262",
"articleId": "13rRUxcKzVl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2014020289",
"articleId": "13rRUxBrGgX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1ECXHMu0OWc",
"title": "Aug.",
"year": "2022",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1pDnA5z2Kdy",
"doi": "10.1109/TVCG.2020.3045450",
"abstract": "Recognizing and fitting shape primitives from underlying 3D models are key components of many computer graphics and computer vision applications. Although a vast number of structural recovery methods are available, they usually fail to identify blending surfaces, which corresponds to small transitional regions among relatively large primary patches. To address this issue, we present a novel approach for automatic segmentation and surface fitting with accurate geometric parameters from 3D models, especially mechanical parts. Overall, we formulate the structural segmentation as a Markov random field (MRF) labeling problem. In contrast to existing techniques, we first propose a new clustering algorithm to build superfacets by incorporating 3D local geometric information. This algorithm extracts the general quadric and rolling-ball blending regions, and improves the robustness of further segmentation. Next, we apply a specially designed MRF framework to efficiently partition the original model into different meaningful patches of known surface types by defining the multilabel energy function on the superfacets. Furthermore, we present an iterative optimization algorithm based on skeleton extraction to fit rolling-ball blending patches by recovering the parameters of the rolling center trajectories and ball radius. Experiments on different complex models demonstrate the effectiveness and robustness of the proposed method, and the superiority of our method is also verified through comparisons with state-of-the-art approaches. We further apply our algorithm in applications such as mesh editing by changing the radius of the rolling balls.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recognizing and fitting shape primitives from underlying 3D models are key components of many computer graphics and computer vision applications. Although a vast number of structural recovery methods are available, they usually fail to identify blending surfaces, which corresponds to small transitional regions among relatively large primary patches. To address this issue, we present a novel approach for automatic segmentation and surface fitting with accurate geometric parameters from 3D models, especially mechanical parts. Overall, we formulate the structural segmentation as a Markov random field (MRF) labeling problem. In contrast to existing techniques, we first propose a new clustering algorithm to build superfacets by incorporating 3D local geometric information. This algorithm extracts the general quadric and rolling-ball blending regions, and improves the robustness of further segmentation. Next, we apply a specially designed MRF framework to efficiently partition the original model into different meaningful patches of known surface types by defining the multilabel energy function on the superfacets. Furthermore, we present an iterative optimization algorithm based on skeleton extraction to fit rolling-ball blending patches by recovering the parameters of the rolling center trajectories and ball radius. Experiments on different complex models demonstrate the effectiveness and robustness of the proposed method, and the superiority of our method is also verified through comparisons with state-of-the-art approaches. We further apply our algorithm in applications such as mesh editing by changing the radius of the rolling balls.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recognizing and fitting shape primitives from underlying 3D models are key components of many computer graphics and computer vision applications. Although a vast number of structural recovery methods are available, they usually fail to identify blending surfaces, which corresponds to small transitional regions among relatively large primary patches. To address this issue, we present a novel approach for automatic segmentation and surface fitting with accurate geometric parameters from 3D models, especially mechanical parts. Overall, we formulate the structural segmentation as a Markov random field (MRF) labeling problem. In contrast to existing techniques, we first propose a new clustering algorithm to build superfacets by incorporating 3D local geometric information. This algorithm extracts the general quadric and rolling-ball blending regions, and improves the robustness of further segmentation. Next, we apply a specially designed MRF framework to efficiently partition the original model into different meaningful patches of known surface types by defining the multilabel energy function on the superfacets. Furthermore, we present an iterative optimization algorithm based on skeleton extraction to fit rolling-ball blending patches by recovering the parameters of the rolling center trajectories and ball radius. Experiments on different complex models demonstrate the effectiveness and robustness of the proposed method, and the superiority of our method is also verified through comparisons with state-of-the-art approaches. We further apply our algorithm in applications such as mesh editing by changing the radius of the rolling balls.",
"title": "Blending Surface Segmentation and Editing for 3D Models",
"normalizedTitle": "Blending Surface Segmentation and Editing for 3D Models",
"fno": "09296787",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Approximation Theory",
"Computational Geometry",
"Computer Vision",
"Graph Theory",
"Image Segmentation",
"Iterative Methods",
"Markov Processes",
"Mesh Generation",
"Optimisation",
"Solid Modelling",
"Surface Fitting",
"Computer Vision Applications",
"Structural Recovery Methods",
"Transitional Regions",
"Relatively Large Primary Patches",
"Automatic Segmentation",
"Surface Fitting",
"Accurate Geometric Parameters",
"Mechanical Parts",
"Structural Segmentation",
"Markov Random Field Labeling Problem",
"Clustering Algorithm",
"Superfacets",
"Incorporating 3 D Local Geometric Information",
"General Quadric",
"Rolling Ball Blending Regions",
"Specially Designed MRF Framework",
"Different Meaningful Patches",
"Known Surface Types",
"Multilabel Energy Function",
"Iterative Optimization Algorithm",
"Skeleton Extraction",
"Rolling Ball Blending Patches",
"Rolling Center Trajectories",
"Ball Radius",
"Different Complex Models",
"Mesh Editing",
"Rolling Balls",
"Blending Surface Segmentation",
"Shape Primitives",
"Computer Graphics",
"Three Dimensional Displays",
"Solid Modeling",
"Shape",
"Surface Morphology",
"Clustering Algorithms",
"Trajectory",
"Partitioning Algorithms",
"Mesh Segmentation",
"Structure Recovery",
"Superfacets",
"Rolling Ball Blending Surface",
"Markov Random Field"
],
"authors": [
{
"givenName": "Long",
"surname": "Zhang",
"fullName": "Long Zhang",
"affiliation": "School of Artificial Intelligence, University of Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianwei",
"surname": "Guo",
"fullName": "Jianwei Guo",
"affiliation": "NLPR, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Xiao",
"fullName": "Jun Xiao",
"affiliation": "School of Artificial Intelligence, University of Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaopeng",
"surname": "Zhang",
"fullName": "Xiaopeng Zhang",
"affiliation": "NLPR, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong-Ming",
"surname": "Yan",
"fullName": "Dong-Ming Yan",
"affiliation": "NLPR, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "2879-2894",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2003/2028/0/20280093",
"title": "G2 Blending of Corners with Piecewise Algebraic Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2003/20280093/12OmNAOsMJ2",
"parentPublication": {
"id": "proceedings/pg/2003/2028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/1997/8028/0/80280091",
"title": "Modification of n-sided patches based on variation of blending functions",
"doi": null,
"abstractUrl": "/proceedings-article/pg/1997/80280091/12OmNAsTgQO",
"parentPublication": {
"id": "proceedings/pg/1997/8028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730085",
"title": "Surface blending with curvature continuity",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730085/12OmNBCHMN0",
"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/gmp/2000/0562/0/05620385",
"title": "Gn-Blending with Rolling Ball Contact Curves",
"doi": null,
"abstractUrl": "/proceedings-article/gmp/2000/05620385/12OmNvA1hrc",
"parentPublication": {
"id": "proceedings/gmp/2000/0562/0",
"title": "Geometric Modeling and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmap/2000/0562/0/00838270",
"title": "Blending between right circular cylinders with parabolic cyclides",
"doi": null,
"abstractUrl": "/proceedings-article/gmap/2000/00838270/12OmNvAiSpD",
"parentPublication": {
"id": "proceedings/gmap/2000/0562/0",
"title": "Proceedings Geometric Modeling and Processing 2000. Theory and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmp/2000/0562/0/05620390",
"title": "Blending Between Right Circular Cylinders with Parabolic Cyclides",
"doi": null,
"abstractUrl": "/proceedings-article/gmp/2000/05620390/12OmNyjtNIa",
"parentPublication": {
"id": "proceedings/gmp/2000/0562/0",
"title": "Geometric Modeling and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2013/5050/0/5050a701",
"title": "Filling Free-Form n-Sided Holes toward Blending and Decoration",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a701/12OmNz5apJL",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmp/2002/1674/0/16740053",
"title": "Construct Piecewise Hermite Interpolation Surface with Blending Methods",
"doi": null,
"abstractUrl": "/proceedings-article/gmp/2002/16740053/12OmNzBOi1X",
"parentPublication": {
"id": "proceedings/gmp/2002/1674/0",
"title": "Geometric Modeling and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmap/2000/0562/0/00838269",
"title": "G/sup n/-blending with rolling ball contact curves",
"doi": null,
"abstractUrl": "/proceedings-article/gmap/2000/00838269/12OmNzYwc8t",
"parentPublication": {
"id": "proceedings/gmap/2000/0562/0",
"title": "Proceedings Geometric Modeling and Processing 2000. Theory and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2010/7259/0/05521457",
"title": "RBF Dipole Surface Evolution",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2010/05521457/12OmNzlly3I",
"parentPublication": {
"id": "proceedings/smi/2010/7259/0",
"title": "Shape Modeling International (SMI 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09318559",
"articleId": "1qdT8m4QLIY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09275364",
"articleId": "1pcOzhi9WUg",
"__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": "1wJl1PkCw4o",
"doi": "10.1109/TVCG.2021.3110658",
"abstract": "This article addresses the problem of mesh super-resolution such that the geometry details which are not well represented in the low-resolution models can be recovered and well represented in the generated high-quality models. The main challenges of this problem are the nonregularity of 3D mesh representation and the high complexity of 3D shapes. We propose a deep neural network called GDR-Net to solve this ill-posed problem, which resolves the two challenges simultaneously. First, to overcome the nonregularity, we regress a displacement in radial basis function parameter space instead of the vertex-wise coordinates in the euclidean space. Second, to overcome the high complexity, we apply the detail recovery process to small surface patches extracted from the input surface and obtain the overall high-quality mesh by fusing the refined surface patches. To train the network, we constructed a dataset composed of both real-world and synthetic scanned models, including high/low-quality pairs. Our experimental results demonstrate that GDR-Net works well for general models and outperforms previous methods for recovering geometric details.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article addresses the problem of mesh super-resolution such that the geometry details which are not well represented in the low-resolution models can be recovered and well represented in the generated high-quality models. The main challenges of this problem are the nonregularity of 3D mesh representation and the high complexity of 3D shapes. We propose a deep neural network called GDR-Net to solve this ill-posed problem, which resolves the two challenges simultaneously. First, to overcome the nonregularity, we regress a displacement in radial basis function parameter space instead of the vertex-wise coordinates in the euclidean space. Second, to overcome the high complexity, we apply the detail recovery process to small surface patches extracted from the input surface and obtain the overall high-quality mesh by fusing the refined surface patches. To train the network, we constructed a dataset composed of both real-world and synthetic scanned models, including high/low-quality pairs. Our experimental results demonstrate that GDR-Net works well for general models and outperforms previous methods for recovering geometric details.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article addresses the problem of mesh super-resolution such that the geometry details which are not well represented in the low-resolution models can be recovered and well represented in the generated high-quality models. The main challenges of this problem are the nonregularity of 3D mesh representation and the high complexity of 3D shapes. We propose a deep neural network called GDR-Net to solve this ill-posed problem, which resolves the two challenges simultaneously. First, to overcome the nonregularity, we regress a displacement in radial basis function parameter space instead of the vertex-wise coordinates in the euclidean space. Second, to overcome the high complexity, we apply the detail recovery process to small surface patches extracted from the input surface and obtain the overall high-quality mesh by fusing the refined surface patches. To train the network, we constructed a dataset composed of both real-world and synthetic scanned models, including high/low-quality pairs. Our experimental results demonstrate that GDR-Net works well for general models and outperforms previous methods for recovering geometric details.",
"title": "GDR-Net: A Geometric Detail Recovering Network for 3D Scanned Objects",
"normalizedTitle": "GDR-Net: A Geometric Detail Recovering Network for 3D Scanned Objects",
"fno": "09531524",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Geometry",
"Image Reconstruction",
"Image Representation",
"Image Resolution",
"Mesh Generation",
"Neural Nets",
"Radial Basis Function Networks",
"Solid Modelling",
"3 D Mesh Representation",
"3 D Scanned Objects",
"Deep Neural Network",
"Detail Recovery Process",
"Euclidean Space",
"GDR Net Works",
"Geometric Detail Recovering Network",
"Geometric Details",
"Geometry Details",
"High Quality Mesh",
"High Quality Models",
"Input Surface",
"Low Resolution Models",
"Mesh Super Resolution",
"Nonregularity",
"Radial Basis Function Parameter Space",
"Refined Surface Patches",
"Vertex Wise Coordinates",
"Three Dimensional Displays",
"Mesh Networks",
"Surface Reconstruction",
"Geometry",
"Computational Modeling",
"Solid Modeling",
"Surface Representation",
"Geometric Detail Recovery",
"3 D Scanning",
"Mesh Reconstruction"
],
"authors": [
{
"givenName": "Wanquan",
"surname": "Feng",
"fullName": "Wanquan Feng",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juyong",
"surname": "Zhang",
"fullName": "Juyong Zhang",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuanfeng",
"surname": "Zhou",
"fullName": "Yuanfeng Zhou",
"affiliation": "School of Software, Shandong University, Jinan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shiqing",
"surname": "Xin",
"fullName": "Shiqing Xin",
"affiliation": "School of Software, Shandong University, Jinan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "3959-3973",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isvd/2011/4483/0/4483a015",
"title": "2-Manifold Surface Sampling and Quality Estimation of Reconstructed Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2011/4483a015/12OmNAle6Cs",
"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/iccv/2015/8391/0/8391a846",
"title": "Photogeometric Scene Flow for High-Detail Dynamic 3D Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a846/12OmNAtst5T",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457a199",
"title": "3DMatch: Learning Local Geometric Descriptors from RGB-D Reconstructions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a199/12OmNBOllq4",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2015/7673/0/7673a130",
"title": "Research on the Algorithm for Grid-Based Hexahedral Mesh Generation of CAD Assembly Models",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2015/7673a130/12OmNBSBk1p",
"parentPublication": {
"id": "proceedings/icvrv/2015/7673/0",
"title": "2015 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780057",
"title": "Geometric Compression for Interactive Transmission",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780057/12OmNwMFMki",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2000/0868/0/08680202",
"title": "Subdivision Surface Fitting Using QEM-Based Mesh Simplification and Reconstruction of Approximated B-Spline Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680202/12OmNy49sFt",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific 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": "trans/tp/2011/04/ttp2011040823",
"title": "Topology-Adaptive Mesh Deformation for Surface Evolution, Morphing, and Multiview Reconstruction",
"doi": null,
"abstractUrl": "/journal/tp/2011/04/ttp2011040823/13rRUx0gew5",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/01/ttg2008010200",
"title": "A Sharpness-Dependent Filter for Recovering Sharp Features in Repaired 3D Mesh Models",
"doi": null,
"abstractUrl": "/journal/tg/2008/01/ttg2008010200/13rRUxly9dN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "09535237",
"articleId": "1wMEPqxIx9u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1HGJ6XQen96",
"title": "Nov.",
"year": "2022",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1Gv8Ze0xuJG",
"doi": "10.1109/TVCG.2022.3203095",
"abstract": "Rapidly developing Redirected Walking (ROW) technologies have enabled VR applications to immerse users in large virtual environments (VE) while actually walking in relatively small physical environments (PE). When an unavoidable collision emerges in a PE, the ROW controller suspends the user's immersive experience and resets the user to a new direction in PE. Existing ROW methods mainly aim to reduce the number of resets. However, from the perspective of the user experience, when users are about to reach a point of interest (POI) in a VE, reset interruptions are more likely to have an impact on user experience. In this paper, we propose a new ROW method, aiming to keep resets occurring at a longer distance from the virtual target, as well as to reduce the number of resets. Simulation experiments and real user studies demonstrate that our method outperforms state-of-the-art ROW methods in the number of resets and dramatically increases the distance between the reset locations and the virtual targets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Rapidly developing Redirected Walking (ROW) technologies have enabled VR applications to immerse users in large virtual environments (VE) while actually walking in relatively small physical environments (PE). When an unavoidable collision emerges in a PE, the ROW controller suspends the user's immersive experience and resets the user to a new direction in PE. Existing ROW methods mainly aim to reduce the number of resets. However, from the perspective of the user experience, when users are about to reach a point of interest (POI) in a VE, reset interruptions are more likely to have an impact on user experience. In this paper, we propose a new ROW method, aiming to keep resets occurring at a longer distance from the virtual target, as well as to reduce the number of resets. Simulation experiments and real user studies demonstrate that our method outperforms state-of-the-art ROW methods in the number of resets and dramatically increases the distance between the reset locations and the virtual targets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Rapidly developing Redirected Walking (ROW) technologies have enabled VR applications to immerse users in large virtual environments (VE) while actually walking in relatively small physical environments (PE). When an unavoidable collision emerges in a PE, the ROW controller suspends the user's immersive experience and resets the user to a new direction in PE. Existing ROW methods mainly aim to reduce the number of resets. However, from the perspective of the user experience, when users are about to reach a point of interest (POI) in a VE, reset interruptions are more likely to have an impact on user experience. In this paper, we propose a new ROW method, aiming to keep resets occurring at a longer distance from the virtual target, as well as to reduce the number of resets. Simulation experiments and real user studies demonstrate that our method outperforms state-of-the-art ROW methods in the number of resets and dramatically increases the distance between the reset locations and the virtual targets.",
"title": "Making Resets away from Targets: POI aware Redirected Walking",
"normalizedTitle": "Making Resets away from Targets: POI aware Redirected Walking",
"fno": "09881577",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"User Experience",
"Virtual Reality",
"Physical Environments",
"POI",
"Point Of Interest",
"Redirected Walking",
"Reset Interruptions",
"Reset Locations",
"ROW Controller",
"User Immersive Experience",
"VE",
"Virtual Environments",
"Virtual Target",
"VR",
"Legged Locomotion",
"Virtual Environments",
"Reinforcement Learning",
"Visualization",
"User Experience",
"Portals",
"Distortion",
"Virtual Reality",
"Redirected Walking",
"Reset",
"POI"
],
"authors": [
{
"givenName": "Sen-Zhe",
"surname": "Xu",
"fullName": "Sen-Zhe Xu",
"affiliation": "YMSC, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tian-Qi",
"surname": "Liu",
"fullName": "Tian-Qi Liu",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jia-Hong",
"surname": "Liu",
"fullName": "Jia-Hong Liu",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefanie",
"surname": "Zollmann",
"fullName": "Stefanie Zollmann",
"affiliation": "Department of Computer Science, University of Otago, Dunedin, New Zealand",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Song-Hai",
"surname": "Zhang",
"fullName": "Song-Hai Zhang",
"affiliation": "Department of Computer Science and Technology, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "3778-3787",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2017/6647/0/07892373",
"title": "Application of redirected walking in room-scale VR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892373/12OmNxG1ySA",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446442",
"title": "Path Prediction Using LSTM Network for Redirected Walking",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446442/13bd1eSlysD",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08448288",
"title": "Experiencing an Invisible World War I Battlefield Through Narrative-Driven Redirected Walking in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08448288/13bd1fZBGdu",
"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/2019/05/08645818",
"title": "Multi-User Redirected Walking and Resetting Using Artificial Potential Fields",
"doi": null,
"abstractUrl": "/journal/tg/2019/05/08645818/17PYEiVyc2v",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09733261",
"title": "One-step out-of-place resetting for redirected walking in VR",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09733261/1BENJyPkx5S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a655",
"title": "Optimal Pose Guided Redirected Walking with Pose Score Precomputation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a655/1CJbHdnVzd6",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10049511",
"title": "Redirected Walking On Omnidirectional Treadmill",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10049511/1KYoAYFd0m4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10058042",
"title": "Multi-User Redirected Walking in Separate Physical Spaces for Online VR Scenarios",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10058042/1LbFn8YmYjC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798121",
"title": "Real-time Optimal Planning for Redirected Walking Using Deep Q-Learning",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798121/1cJ17Y60ruM",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089532",
"title": "Optimal Planning for Redirected Walking Based on Reinforcement Learning in Multi-user Environment with Irregularly Shaped Physical Space",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089532/1jIx7m6wYKc",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09873971",
"articleId": "1GjwLJt4CaI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09874390",
"articleId": "1GjwKHZsfIc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HGJdZTMWVW",
"name": "ttg202211-09881577s1-supp1-3203095.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202211-09881577s1-supp1-3203095.mp4",
"extension": "mp4",
"size": "198 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwudQUj",
"title": "March",
"year": "2014",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "36",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyY28ZD",
"doi": "10.1109/TPAMI.2013.157",
"abstract": "This paper presents a fast and efficient computational approach to higher order spectral graph matching. Exploiting the redundancy in a tensor representing the affinity between feature points, we approximate the affinity tensor with the linear combination of Kronecker products between bases and index tensors. The bases and index tensors are highly compressed representations of the approximated affinity tensor, requiring much smaller memory than in previous methods, which store the full affinity tensor. We compute the principal eigenvector of the approximated affinity tensor using the small bases and index tensors without explicitly storing the approximated tensor. To compensate for the loss of matching accuracy by the approximation, we also adopt and incorporate a marginalization scheme that maps a higher order tensor to matrix as well as a one-to-one mapping constraint into the eigenvector computation process. The experimental results show that the proposed method is faster and requires smaller memory than the existing methods with little or no loss of accuracy.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a fast and efficient computational approach to higher order spectral graph matching. Exploiting the redundancy in a tensor representing the affinity between feature points, we approximate the affinity tensor with the linear combination of Kronecker products between bases and index tensors. The bases and index tensors are highly compressed representations of the approximated affinity tensor, requiring much smaller memory than in previous methods, which store the full affinity tensor. We compute the principal eigenvector of the approximated affinity tensor using the small bases and index tensors without explicitly storing the approximated tensor. To compensate for the loss of matching accuracy by the approximation, we also adopt and incorporate a marginalization scheme that maps a higher order tensor to matrix as well as a one-to-one mapping constraint into the eigenvector computation process. The experimental results show that the proposed method is faster and requires smaller memory than the existing methods with little or no loss of accuracy.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a fast and efficient computational approach to higher order spectral graph matching. Exploiting the redundancy in a tensor representing the affinity between feature points, we approximate the affinity tensor with the linear combination of Kronecker products between bases and index tensors. The bases and index tensors are highly compressed representations of the approximated affinity tensor, requiring much smaller memory than in previous methods, which store the full affinity tensor. We compute the principal eigenvector of the approximated affinity tensor using the small bases and index tensors without explicitly storing the approximated tensor. To compensate for the loss of matching accuracy by the approximation, we also adopt and incorporate a marginalization scheme that maps a higher order tensor to matrix as well as a one-to-one mapping constraint into the eigenvector computation process. The experimental results show that the proposed method is faster and requires smaller memory than the existing methods with little or no loss of accuracy.",
"title": "Fast and Scalable Approximate Spectral Matching for Higher Order Graph Matching",
"normalizedTitle": "Fast and Scalable Approximate Spectral Matching for Higher Order Graph Matching",
"fno": "ttp2014030479",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Tensile Stress",
"Approximation Methods",
"Indexes",
"Sparse Matrices",
"Vectors",
"Redundancy",
"Pattern Matching",
"Approximation Algorithm",
"Higher Order Graph Matching",
"Spectral Relaxation"
],
"authors": [
{
"givenName": null,
"surname": "Soonyong Park",
"fullName": "Soonyong Park",
"affiliation": "Future IT R&D Center, Samsung Adv. Inst. of Technol., Yongin, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Sung-Kee Park",
"fullName": "Sung-Kee Park",
"affiliation": "Center for Bionics, Korea Inst. of Sci. & Technol., Seoul, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Martial",
"surname": "Hebert",
"fullName": "Martial Hebert",
"affiliation": "Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2014-03-01 00:00:00",
"pubType": "trans",
"pages": "479-492",
"year": "2014",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdps/2017/3914/0/07967195",
"title": "Model-Driven Sparse CP Decomposition for Higher-Order Tensors",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2017/07967195/12OmNBeRtOY",
"parentPublication": {
"id": "proceedings/ipdps/2017/3914/0",
"title": "2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851f395",
"title": "Sparse Coding for Third-Order Super-Symmetric Tensor Descriptors with Application to Texture Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851f395/12OmNx6xHre",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2013/5108/0/5108b199",
"title": "Non-negative Multiple Tensor Factorization",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108b199/12OmNxdDFM3",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532773",
"title": "HOT-lines: tracking lines in higher order tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532773/12OmNzWx07T",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2019/04/08310010",
"title": "Secure Tensor Decomposition for Big Data Using Transparent Computing Paradigm",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08310010/13rRUwghd8A",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/12/ttp2010122205",
"title": "Efficient High Order Matching",
"doi": null,
"abstractUrl": "/journal/tp/2010/12/ttp2010122205/13rRUx0xPJM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/07/ttp2013071660",
"title": "Higher Order Partial Least Squares (HOPLS): A Generalized Multilinear Regression Method",
"doi": null,
"abstractUrl": "/journal/tp/2013/07/ttp2013071660/13rRUxjQyiw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545450",
"title": "Online Multi-Target Tracking with Tensor-Based High-Order Graph Matching",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545450/17D45XzbnLk",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09737134",
"title": "Visualizing Higher-Order 3D Tensors by Multipole Lines",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09737134/1BQidsAhMnS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101753",
"title": "D-Tucker: Fast and Memory-Efficient Tucker Decomposition for Dense Tensors",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101753/1kaMMmraclq",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2014030466",
"articleId": "13rRUIIVllF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2014030493",
"articleId": "13rRUwhpBFd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAPjA9W",
"title": "May-June",
"year": "2016",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "36",
"label": "May-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxN5evL",
"doi": "10.1109/MCG.2016.59",
"abstract": "The healthcare industry's widespread digitization efforts are reshaping one of the largest sectors of the world's economy. This transformation is enabling systems that promise to use ever-improving data-driven evidence to help doctors make more precise diagnoses, institutions identify at risk patients for intervention, clinicians develop more personalized treatment plans, and researchers better understand medical outcomes within complex patient populations. Given the scale and complexity of the data required to achieve these goals, advanced data visualization tools have the potential to play a critical role. This article reviews a number of visualization challenges unique to the healthcare discipline.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The healthcare industry's widespread digitization efforts are reshaping one of the largest sectors of the world's economy. This transformation is enabling systems that promise to use ever-improving data-driven evidence to help doctors make more precise diagnoses, institutions identify at risk patients for intervention, clinicians develop more personalized treatment plans, and researchers better understand medical outcomes within complex patient populations. Given the scale and complexity of the data required to achieve these goals, advanced data visualization tools have the potential to play a critical role. This article reviews a number of visualization challenges unique to the healthcare discipline.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The healthcare industry's widespread digitization efforts are reshaping one of the largest sectors of the world's economy. This transformation is enabling systems that promise to use ever-improving data-driven evidence to help doctors make more precise diagnoses, institutions identify at risk patients for intervention, clinicians develop more personalized treatment plans, and researchers better understand medical outcomes within complex patient populations. Given the scale and complexity of the data required to achieve these goals, advanced data visualization tools have the potential to play a critical role. This article reviews a number of visualization challenges unique to the healthcare discipline.",
"title": "Data-Driven Healthcare: Challenges and Opportunities for Interactive Visualization",
"normalizedTitle": "Data-Driven Healthcare: Challenges and Opportunities for Interactive Visualization",
"fno": "mcg2016030090",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualization",
"Medical Services",
"Sociology",
"Statistics",
"Medical Diagnostic Imaging",
"Visualization",
"Data Visualization",
"Computer Graphics",
"Visualization",
"Healthcare Visualization"
],
"authors": [
{
"givenName": "David",
"surname": "Gotz",
"fullName": "David Gotz",
"affiliation": "University of North Carolina at Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Borland",
"fullName": "David Borland",
"affiliation": "University of North Carolina at Chapel Hill",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2016-05-01 00:00:00",
"pubType": "mags",
"pages": "90-96",
"year": "2016",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ichi/2016/6117/0/6117a380",
"title": "Evaluating EHR Data Availability for Cohort Selection in Retrospective Studies",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2016/6117a380/12OmNAoUTks",
"parentPublication": {
"id": "proceedings/ichi/2016/6117/0",
"title": "2016 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2016/2179/0/2179a377",
"title": "National Representatively Healthcare Database and the Application",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2016/2179a377/12OmNqEji1c",
"parentPublication": {
"id": "proceedings/bigmm/2016/2179/0",
"title": "2016 IEEE Second International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2015/9548/0/9548a578",
"title": "Information Technology Challenges for Mobile Integrated Healthcare",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2015/9548a578/12OmNrYCXG5",
"parentPublication": {
"id": "proceedings/ichi/2015/9548/0",
"title": "2015 International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isads/2017/4042/0/07940217",
"title": "Improving Usability through Enhanced Visualization in Healthcare",
"doi": null,
"abstractUrl": "/proceedings-article/isads/2017/07940217/12OmNvJXeD1",
"parentPublication": {
"id": "proceedings/isads/2017/4042/0",
"title": "2017 IEEE 13th International Symposium on Autonomous Decentralized System (ISADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmb/2007/2803/0/28030050",
"title": "Mobile Healthcare: Opportunities and Challenges",
"doi": null,
"abstractUrl": "/proceedings-article/icmb/2007/28030050/12OmNyeWdAT",
"parentPublication": {
"id": "proceedings/icmb/2007/2803/0",
"title": "2007 International Conference on the Management of Mobile Business",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vahc/2017/3187/0/08387494",
"title": "Patient-provider geographic map: An interactive visualization tool of patients' selection of health care providers",
"doi": null,
"abstractUrl": "/proceedings-article/vahc/2017/08387494/12OmNzcPAKL",
"parentPublication": {
"id": "proceedings/vahc/2017/3187/0",
"title": "2017 IEEE Workshop on Visual Analytics in Healthcare (VAHC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/05/mco2013050058",
"title": "Improving Healthcare with Interactive Visualization",
"doi": null,
"abstractUrl": "/magazine/co/2013/05/mco2013050058/13rRUwgyOgw",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/05/06687159",
"title": "GazeVis: Interactive 3D Gaze Visualization for Contiguous Cross-Sectional Medical Images",
"doi": null,
"abstractUrl": "/journal/tg/2014/05/06687159/13rRUyfbwqK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlcss/2022/5493/0/549300a171",
"title": "IoT for Smart Healthcare: Opportunities, Challenges and Technology",
"doi": null,
"abstractUrl": "/proceedings-article/mlcss/2022/549300a171/1LSOXORT33y",
"parentPublication": {
"id": "proceedings/mlcss/2022/5493/0",
"title": "2022 International Conference on Machine Learning, Computer Systems and Security (MLCSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcom/2019/4024/0/402400a303",
"title": "Healthcare Expenditure Prediction for Crowd with Co-existing Medical Conditions",
"doi": null,
"abstractUrl": "/proceedings-article/bigcom/2019/402400a303/1f8MSKwJ9Ly",
"parentPublication": {
"id": "proceedings/bigcom/2019/4024/0",
"title": "2019 5th International Conference on Big Data Computing and Communications (BIGCOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2016030084",
"articleId": "13rRUB7a19s",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg20160300c3",
"articleId": "13rRUy0qnJ2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCbCrUN",
"title": "Dec.",
"year": "2013",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgarBu",
"doi": "10.1109/TVCG.2013.159",
"abstract": "We propose a novel GPU-based approach to render virtual X-ray projections of deformable tetrahedral meshes. These meshes represent the shape and the internal density distribution of a particular anatomical structure and are derived from statistical shape and intensity models (SSIMs). We apply our method to improve the geometric reconstruction of 3D anatomy (e.g. pelvic bone) from 2D X-ray images. For that purpose, shape and density of a tetrahedral mesh are varied and virtual X-ray projections are generated within an optimization process until the similarity between the computed virtual X-ray and the respective anatomy depicted in a given clinical X-ray is maximized. The OpenGL implementation presented in this work deforms and projects tetrahedral meshes of high resolution (200.000+ tetrahedra) at interactive rates. It generates virtual X-rays that accurately depict the density distribution of an anatomy of interest. Compared to existing methods that accumulate X-ray attenuation in deformable meshes, our novel approach significantly boosts the deformation/projection performance. The proposed projection algorithm scales better with respect to mesh resolution and complexity of the density distribution, and the combined deformation and projection on the GPU scales better with respect to the number of deformation parameters. The gain in performance allows for a larger number of cycles in the optimization process. Consequently, it reduces the risk of being stuck in a local optimum. We believe that our approach will improve treatments in orthopedics, where 3D anatomical information is essential.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a novel GPU-based approach to render virtual X-ray projections of deformable tetrahedral meshes. These meshes represent the shape and the internal density distribution of a particular anatomical structure and are derived from statistical shape and intensity models (SSIMs). We apply our method to improve the geometric reconstruction of 3D anatomy (e.g. pelvic bone) from 2D X-ray images. For that purpose, shape and density of a tetrahedral mesh are varied and virtual X-ray projections are generated within an optimization process until the similarity between the computed virtual X-ray and the respective anatomy depicted in a given clinical X-ray is maximized. The OpenGL implementation presented in this work deforms and projects tetrahedral meshes of high resolution (200.000+ tetrahedra) at interactive rates. It generates virtual X-rays that accurately depict the density distribution of an anatomy of interest. Compared to existing methods that accumulate X-ray attenuation in deformable meshes, our novel approach significantly boosts the deformation/projection performance. The proposed projection algorithm scales better with respect to mesh resolution and complexity of the density distribution, and the combined deformation and projection on the GPU scales better with respect to the number of deformation parameters. The gain in performance allows for a larger number of cycles in the optimization process. Consequently, it reduces the risk of being stuck in a local optimum. We believe that our approach will improve treatments in orthopedics, where 3D anatomical information is essential.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a novel GPU-based approach to render virtual X-ray projections of deformable tetrahedral meshes. These meshes represent the shape and the internal density distribution of a particular anatomical structure and are derived from statistical shape and intensity models (SSIMs). We apply our method to improve the geometric reconstruction of 3D anatomy (e.g. pelvic bone) from 2D X-ray images. For that purpose, shape and density of a tetrahedral mesh are varied and virtual X-ray projections are generated within an optimization process until the similarity between the computed virtual X-ray and the respective anatomy depicted in a given clinical X-ray is maximized. The OpenGL implementation presented in this work deforms and projects tetrahedral meshes of high resolution (200.000+ tetrahedra) at interactive rates. It generates virtual X-rays that accurately depict the density distribution of an anatomy of interest. Compared to existing methods that accumulate X-ray attenuation in deformable meshes, our novel approach significantly boosts the deformation/projection performance. The proposed projection algorithm scales better with respect to mesh resolution and complexity of the density distribution, and the combined deformation and projection on the GPU scales better with respect to the number of deformation parameters. The gain in performance allows for a larger number of cycles in the optimization process. Consequently, it reduces the risk of being stuck in a local optimum. We believe that our approach will improve treatments in orthopedics, where 3D anatomical information is essential.",
"title": "Fast Generation of Virtual X-ray Images for Reconstruction of 3D Anatomy",
"normalizedTitle": "Fast Generation of Virtual X-ray Images for Reconstruction of 3D Anatomy",
"fno": "ttg2013122673",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"X Ray Imaging",
"Deformable Models",
"Shape Analysis",
"Image Reconstruction",
"Three Dimensional Displays",
"Graphics Processing Units",
"Attenuation",
"Image Registration",
"X Ray Imaging",
"Deformable Models",
"Shape Analysis",
"Image Reconstruction",
"Three Dimensional Displays",
"Graphics Processing Units",
"Attenuation",
"GPU Acceleration",
"Digitally Reconstructed Radiographs",
"Volume Rendering",
"Mesh Deformation",
"Statistical Shape And Intensity Models"
],
"authors": [
{
"givenName": "Moritz",
"surname": "Ehlke",
"fullName": "Moritz Ehlke",
"affiliation": "Zuse Inst. Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Heiko",
"surname": "Ramm",
"fullName": "Heiko Ramm",
"affiliation": "Zuse Inst. Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans",
"surname": "Lamecker",
"fullName": "Hans Lamecker",
"affiliation": "Zuse Inst. Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hans-Christian",
"surname": "Hege",
"fullName": "Hans-Christian Hege",
"affiliation": "Zuse Inst. Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Zachow",
"fullName": "Stefan Zachow",
"affiliation": "Zuse Inst. Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2673-2682",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cimsim/2011/4562/0/4562a253",
"title": "Merging Scheme-based Classification of Medical X-ray Images",
"doi": null,
"abstractUrl": "/proceedings-article/cimsim/2011/4562a253/12OmNB1wkGi",
"parentPublication": {
"id": "proceedings/cimsim/2011/4562/0",
"title": "Computational Intelligence, Modelling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2017/4822/0/07926666",
"title": "X-Ray Scattering Image Classification Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2017/07926666/12OmNBPtJHg",
"parentPublication": {
"id": "proceedings/wacv/2017/4822/0",
"title": "2017 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gtsd/2016/3638/0/3638a161",
"title": "Phase Quantitative Computation for Multi-Phase Materials by Means of X-Ray Diffraction",
"doi": null,
"abstractUrl": "/proceedings-article/gtsd/2016/3638a161/12OmNBp52GE",
"parentPublication": {
"id": "proceedings/gtsd/2016/3638/0",
"title": "2016 3rd International Conference on Green Technology and Sustainable Development (GTSD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2014/6184/0/06948433",
"title": "Improved interventional X-ray appearance",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2014/06948433/12OmNsd6vpH",
"parentPublication": {
"id": "proceedings/ismar/2014/6184/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2011/2135/0/06121045",
"title": "Automated Inspection Using X-Ray Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2011/06121045/12OmNwDSdFg",
"parentPublication": {
"id": "proceedings/trustcom/2011/2135/0",
"title": "2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2014/4985/0/06836004",
"title": "Materials discovery: Fine-grained classification of X-ray scattering images",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2014/06836004/12OmNxcdFVL",
"parentPublication": {
"id": "proceedings/wacv/2014/4985/0",
"title": "2014 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2009/3583/1/3583a483",
"title": "Image Reconstruction Using an Improved MAP-EM Method in X-ray CT",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583a483/12OmNyfvpU3",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/3",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2014/7000/1/7000a345",
"title": "Multimodal Calibration of Portable X-Ray Capture Systems for 3D Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2014/7000a345/12OmNzdoN5I",
"parentPublication": {
"id": "proceedings/3dv/2014/7000/2",
"title": "2014 2nd International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/01/mcg2010010017",
"title": "Knowledge-Assisted Reconstruction of the Human Rib Cage and Lungs",
"doi": null,
"abstractUrl": "/magazine/cg/2010/01/mcg2010010017/13rRUxNmPIw",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000j059",
"title": "Generating Synthetic X-Ray Images of a Person from the Surface Geometry",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000j059/17D45VsBTVU",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122663",
"articleId": "13rRUxAASTa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122683",
"articleId": "13rRUxNW1TT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgH8",
"name": "ttg2013122673s.webm",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122673s.webm",
"extension": "webm",
"size": "25.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1L8lPE0ODrG",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zJiKkgGIaQ",
"doi": "10.1109/TVCG.2021.3139031",
"abstract": "Agent-based synthetic crowd simulation affords the cost-effective large-scale simulation and animation of interacting digital humans. Model-based approaches have successfully generated a plethora of simulators with a variety of foundations. However, prior approaches have been based on statically defined models predicated on simplifying assumptions, limited video-based datasets, or homogeneous policies. Recent works have applied reinforcement learning to learn policies for navigation. However, these approaches may learn static homogeneous rules, are typically limited in their generalization to trained scenarios, and limited in their usability in synthetic crowd domains. In this article, we present a multi-agent reinforcement learning-based approach that learns a parametric predictive collision avoidance and steering policy. We show that training over a parameter space produces a flexible model across crowd configurations. That is, our goal-conditioned approach learns a parametric policy that affords heterogeneous synthetic crowds. We propose a model-free approach without centralization of internal agent information, control signals, or agent communication. The model is extensively evaluated. The results show policy generalization across unseen scenarios, agent parameters, and out-of-distribution parameterizations. The learned model has comparable computational performance to traditional methods. Qualitatively the model produces both expected (laminar flow, shuffling, bottleneck) and unexpected (side-stepping) emergent qualitative behaviours, and quantitatively the approach is performant across measures of movement quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Agent-based synthetic crowd simulation affords the cost-effective large-scale simulation and animation of interacting digital humans. Model-based approaches have successfully generated a plethora of simulators with a variety of foundations. However, prior approaches have been based on statically defined models predicated on simplifying assumptions, limited video-based datasets, or homogeneous policies. Recent works have applied reinforcement learning to learn policies for navigation. However, these approaches may learn static homogeneous rules, are typically limited in their generalization to trained scenarios, and limited in their usability in synthetic crowd domains. In this article, we present a multi-agent reinforcement learning-based approach that learns a parametric predictive collision avoidance and steering policy. We show that training over a parameter space produces a flexible model across crowd configurations. That is, our goal-conditioned approach learns a parametric policy that affords heterogeneous synthetic crowds. We propose a model-free approach without centralization of internal agent information, control signals, or agent communication. The model is extensively evaluated. The results show policy generalization across unseen scenarios, agent parameters, and out-of-distribution parameterizations. The learned model has comparable computational performance to traditional methods. Qualitatively the model produces both expected (laminar flow, shuffling, bottleneck) and unexpected (side-stepping) emergent qualitative behaviours, and quantitatively the approach is performant across measures of movement quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Agent-based synthetic crowd simulation affords the cost-effective large-scale simulation and animation of interacting digital humans. Model-based approaches have successfully generated a plethora of simulators with a variety of foundations. However, prior approaches have been based on statically defined models predicated on simplifying assumptions, limited video-based datasets, or homogeneous policies. Recent works have applied reinforcement learning to learn policies for navigation. However, these approaches may learn static homogeneous rules, are typically limited in their generalization to trained scenarios, and limited in their usability in synthetic crowd domains. In this article, we present a multi-agent reinforcement learning-based approach that learns a parametric predictive collision avoidance and steering policy. We show that training over a parameter space produces a flexible model across crowd configurations. That is, our goal-conditioned approach learns a parametric policy that affords heterogeneous synthetic crowds. We propose a model-free approach without centralization of internal agent information, control signals, or agent communication. The model is extensively evaluated. The results show policy generalization across unseen scenarios, agent parameters, and out-of-distribution parameterizations. The learned model has comparable computational performance to traditional methods. Qualitatively the model produces both expected (laminar flow, shuffling, bottleneck) and unexpected (side-stepping) emergent qualitative behaviours, and quantitatively the approach is performant across measures of movement quality.",
"title": "Heterogeneous Crowd Simulation Using Parametric Reinforcement Learning",
"normalizedTitle": "Heterogeneous Crowd Simulation Using Parametric Reinforcement Learning",
"fno": "09665307",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Collision Avoidance",
"Computer Animation",
"Multi Agent Systems",
"Reinforcement Learning",
"Agent Communication",
"Agent Based Synthetic Crowd Simulation",
"Cost Effective Large Scale Simulation",
"Crowd Configurations",
"Goal Conditioned Approach",
"Heterogeneous Synthetic Crowd Simulation",
"Homogeneous Policies",
"Interacting Digital Human Animation",
"Internal Agent Information",
"Model Based Approaches",
"Model Free Approach",
"Multiagent Reinforcement Learning Based Approach",
"Parametric Policy",
"Parametric Predictive Collision Avoidance",
"Parametric Reinforcement Learning",
"Policy Generalization",
"Static Homogeneous Rules",
"Statically Defined Models",
"Steering Policy",
"Video Based Datasets",
"Computational Modeling",
"Reinforcement Learning",
"Neural Networks",
"Collision Avoidance",
"Training",
"Predictive Models",
"Navigation",
"Multi Agent Navigation",
"Crowd Simulation",
"Reinforcement Learning",
"Parametric Policy Learning"
],
"authors": [
{
"givenName": "Kaidong",
"surname": "Hu",
"fullName": "Kaidong Hu",
"affiliation": "Computer Science Department, Rutgers University, New Brunswick, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brandon",
"surname": "Haworth",
"fullName": "Brandon Haworth",
"affiliation": "Department of Computer Science, University of Victoria, Victoria, BC, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Glen",
"surname": "Berseth",
"fullName": "Glen Berseth",
"affiliation": "Department of Computer Science and Operations Research, University of Montreal and a member of MILA, Montreal, Quebec, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vladimir",
"surname": "Pavlovic",
"fullName": "Vladimir Pavlovic",
"affiliation": "Computer Science Department, Rutgers University, New Brunswick, NJ, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Petros",
"surname": "Faloutsos",
"fullName": "Petros Faloutsos",
"affiliation": "Department of Electrical Engineering & Computer Science, York University, Toronto, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mubbasir",
"surname": "Kapadia",
"fullName": "Mubbasir Kapadia",
"affiliation": "Computer Science Department, Rutgers University, New Brunswick, NJ, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "2036-2052",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icimt/2009/3922/0/3922a388",
"title": "A Review of Collision Avoidance Technique for Crowd Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icimt/2009/3922a388/12OmNxE2mNV",
"parentPublication": {
"id": "proceedings/icimt/2009/3922/0",
"title": "Information and Multimedia Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2016/2303/0/2303a175",
"title": "Dynamic Crowd Emotion Contagion Simulation with GPU Acceleration",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2016/2303a175/12OmNyL0TMW",
"parentPublication": {
"id": "proceedings/cw/2016/2303/0",
"title": "2016 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2014/6854/0/6854a103",
"title": "Crowd Simulation for Evacuation Behaviors Based on Multi-agent System and Cellular Automaton",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2014/6854a103/12OmNzZmZme",
"parentPublication": {
"id": "proceedings/icvrv/2014/6854/0",
"title": "2014 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2011/4467/0/4467a038",
"title": "An Information-Based Perception Model for Agent-Based Crowd and Egress Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2011/4467a038/12OmNzlUKgE",
"parentPublication": {
"id": "proceedings/cw/2011/4467/0",
"title": "2011 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/07/06613491",
"title": "Hybrid Long-Range Collision Avoidance for Crowd Simulation",
"doi": null,
"abstractUrl": "/journal/tg/2014/07/06613491/13rRUEgs2BX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/02/ttg2014020159",
"title": "A Whole Surface Approach to Crowd Simulation on Arbitrary Topologies",
"doi": null,
"abstractUrl": "/journal/tg/2014/02/ttg2014020159/13rRUwInvl2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2011/05/mcg2011050054",
"title": "Context-Aware Motion Diversification for Crowd Simulation",
"doi": null,
"abstractUrl": "/magazine/cg/2011/05/mcg2011050054/13rRUxjyXcP",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/5555/01/09964278",
"title": "Emotional Contagion-Aware Deep Reinforcement Learning for Antagonistic Crowd Simulation",
"doi": null,
"abstractUrl": "/journal/ta/5555/01/09964278/1IFEw2Sw2Zi",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cecit/2022/3197/0/319700a228",
"title": "Interactive Robot Navigation in Crowded Pedestrian Environments Based on Deep Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cecit/2022/319700a228/1M66MeSqPyE",
"parentPublication": {
"id": "proceedings/cecit/2022/3197/0",
"title": "2022 3rd International Conference on Electronics, Communications and Information Technology (CECIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2020/9228/0/922800a532",
"title": "Multi-Robot Collision Avoidance with Map-based Deep Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a532/1pP3uTsDzQQ",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09665344",
"articleId": "1zJiL9lDkoE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09668999",
"articleId": "1zTfZzq1wqY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1L8lSxq9DBS",
"name": "ttg202304-09665307s1-supp1-3139031.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202304-09665307s1-supp1-3139031.pdf",
"extension": "pdf",
"size": "154 kB",
"__typename": "WebExtraType"
},
{
"id": "1L8lRDz9oIM",
"name": "ttg202304-09665307s1-supp2-3139031.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202304-09665307s1-supp2-3139031.mp4",
"extension": "mp4",
"size": "357 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyvY9o8",
"title": "April",
"year": "2013",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "25",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7fD",
"doi": "10.1109/TKDE.2011.221",
"abstract": "Clustering on uncertain data, one of the essential tasks in mining uncertain data, posts significant challenges on both modeling similarity between uncertain objects and developing efficient computational methods. The previous methods extend traditional partitioning clustering methods like Z_$(k)$_Z-means and density-based clustering methods like DBSCAN to uncertain data, thus rely on geometric distances between objects. Such methods cannot handle uncertain objects that are geometrically indistinguishable, such as products with the same mean but very different variances in customer ratings. Surprisingly, probability distributions, which are essential characteristics of uncertain objects, have not been considered in measuring similarity between uncertain objects. In this paper, we systematically model uncertain objects in both continuous and discrete domains, where an uncertain object is modeled as a continuous and discrete random variable, respectively. We use the well-known Kullback-Leibler divergence to measure similarity between uncertain objects in both the continuous and discrete cases, and integrate it into partitioning and density-based clustering methods to cluster uncertain objects. Nevertheless, a naïve implementation is very costly. Particularly, computing exact KL divergence in the continuous case is very costly or even infeasible. To tackle the problem, we estimate KL divergence in the continuous case by kernel density estimation and employ the fast Gauss transform technique to further speed up the computation. Our extensive experiment results verify the effectiveness, efficiency, and scalability of our approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering on uncertain data, one of the essential tasks in mining uncertain data, posts significant challenges on both modeling similarity between uncertain objects and developing efficient computational methods. The previous methods extend traditional partitioning clustering methods like $(k)$-means and density-based clustering methods like DBSCAN to uncertain data, thus rely on geometric distances between objects. Such methods cannot handle uncertain objects that are geometrically indistinguishable, such as products with the same mean but very different variances in customer ratings. Surprisingly, probability distributions, which are essential characteristics of uncertain objects, have not been considered in measuring similarity between uncertain objects. In this paper, we systematically model uncertain objects in both continuous and discrete domains, where an uncertain object is modeled as a continuous and discrete random variable, respectively. We use the well-known Kullback-Leibler divergence to measure similarity between uncertain objects in both the continuous and discrete cases, and integrate it into partitioning and density-based clustering methods to cluster uncertain objects. Nevertheless, a naïve implementation is very costly. Particularly, computing exact KL divergence in the continuous case is very costly or even infeasible. To tackle the problem, we estimate KL divergence in the continuous case by kernel density estimation and employ the fast Gauss transform technique to further speed up the computation. Our extensive experiment results verify the effectiveness, efficiency, and scalability of our approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering on uncertain data, one of the essential tasks in mining uncertain data, posts significant challenges on both modeling similarity between uncertain objects and developing efficient computational methods. The previous methods extend traditional partitioning clustering methods like --means and density-based clustering methods like DBSCAN to uncertain data, thus rely on geometric distances between objects. Such methods cannot handle uncertain objects that are geometrically indistinguishable, such as products with the same mean but very different variances in customer ratings. Surprisingly, probability distributions, which are essential characteristics of uncertain objects, have not been considered in measuring similarity between uncertain objects. In this paper, we systematically model uncertain objects in both continuous and discrete domains, where an uncertain object is modeled as a continuous and discrete random variable, respectively. We use the well-known Kullback-Leibler divergence to measure similarity between uncertain objects in both the continuous and discrete cases, and integrate it into partitioning and density-based clustering methods to cluster uncertain objects. Nevertheless, a naïve implementation is very costly. Particularly, computing exact KL divergence in the continuous case is very costly or even infeasible. To tackle the problem, we estimate KL divergence in the continuous case by kernel density estimation and employ the fast Gauss transform technique to further speed up the computation. Our extensive experiment results verify the effectiveness, efficiency, and scalability of our approaches.",
"title": "Clustering Uncertain Data Based on Probability Distribution Similarity",
"normalizedTitle": "Clustering Uncertain Data Based on Probability Distribution Similarity",
"fno": "ttk2013040751",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Probability Distribution",
"Clustering Algorithms",
"Cameras",
"Random Variables",
"Kernel",
"Measurement Uncertainty",
"Educational Institutions",
"Fast Gauss Transform",
"Clustering",
"Uncertain Data",
"Probabilistic Distribution",
"Density Estimation"
],
"authors": [
{
"givenName": "Bin",
"surname": "Jiang",
"fullName": "Bin Jiang",
"affiliation": "Simon Fraser University, Burnaby",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Pei",
"fullName": "Jian Pei",
"affiliation": "Simon Fraser Univeristy, Burnaby",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yufei",
"surname": "Tao",
"fullName": "Yufei Tao",
"affiliation": "Chinese University of Hong Kong, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuemin",
"surname": "Lin",
"fullName": "Xuemin Lin",
"affiliation": "The University of New South Wales, Sydney and East China Normal University, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2013-04-01 00:00:00",
"pubType": "trans",
"pages": "751-763",
"year": "2013",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/csse/2008/3336/4/3336g474",
"title": "Density-Based Probabilistic Clustering of Uncertain Data",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g474/12OmNA0vnYr",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545b625",
"title": "Clustering Uncertain Data with Possible Worlds",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b625/12OmNAq3hEt",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584b357",
"title": "Similarity Matching over Uncertain Time Series",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584b357/12OmNqH9hdK",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2009/3545/0/3545b152",
"title": "On High Dimensional Projected Clustering of Uncertain Data Streams",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2009/3545b152/12OmNwO5LXR",
"parentPublication": {
"id": "proceedings/icde/2009/3545/0",
"title": "2009 IEEE 25th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2008/3502/0/3502a333",
"title": "Clustering Uncertain Data Using Voronoi Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2008/3502a333/12OmNyuPLnQ",
"parentPublication": {
"id": "proceedings/icdm/2008/3502/0",
"title": "2008 Eighth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2008/3502/0/3502a821",
"title": "A Hierarchical Algorithm for Clustering Uncertain Data via an Information-Theoretic Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2008/3502a821/12OmNzb7Zkb",
"parentPublication": {
"id": "proceedings/icdm/2008/3502/0",
"title": "2008 Eighth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wkdd/2010/5397/0/05432721",
"title": "Customized DBSCAN for Clustering Uncertain Objects",
"doi": null,
"abstractUrl": "/proceedings-article/wkdd/2010/05432721/12OmNzkuKEZ",
"parentPublication": {
"id": "proceedings/wkdd/2010/5397/0",
"title": "2010 3rd International Conference on Knowledge Discovery and Data Mining (WKDD 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/09/ttk2010091234",
"title": "Scalable Probabilistic Similarity Ranking in Uncertain Databases",
"doi": null,
"abstractUrl": "/journal/tk/2010/09/ttk2010091234/13rRUxAASTw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/09/ttk2010091247",
"title": "Effectively Indexing the Uncertain Space",
"doi": null,
"abstractUrl": "/journal/tk/2010/09/ttk2010091247/13rRUxOvea6",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2013/01/ttk2013010119",
"title": "Maximum Likelihood Estimation from Uncertain Data in the Belief Function Framework",
"doi": null,
"abstractUrl": "/journal/tk/2013/01/ttk2013010119/13rRUzphDyq",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2013040734",
"articleId": "13rRUwInvJH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2013040764",
"articleId": "13rRUNvyatE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwxlrjb",
"title": "Jan.",
"year": "2016",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7yx",
"doi": "10.1109/TKDE.2015.2462357",
"abstract": "Querying uncertain data has become a prominent application due to the proliferation of user-generated content from social media and of data streams from sensors. When data ambiguity cannot be reduced algorithmically, crowdsourcing proves a viable approach, which consists of posting tasks to humans and harnessing their judgment for improving the confidence about data values or relationships. This paper tackles the problem of processing top- Z_$K$_Z queries over uncertain data with the help of crowdsourcing for quickly converging to the realordering of relevant results. Several offline and online approaches for addressing questions to a crowd are defined and contrasted on both synthetic and real data sets, with the aim of minimizing the crowd interactions necessary to find the realordering of the result set.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Querying uncertain data has become a prominent application due to the proliferation of user-generated content from social media and of data streams from sensors. When data ambiguity cannot be reduced algorithmically, crowdsourcing proves a viable approach, which consists of posting tasks to humans and harnessing their judgment for improving the confidence about data values or relationships. This paper tackles the problem of processing top- $K$ queries over uncertain data with the help of crowdsourcing for quickly converging to the realordering of relevant results. Several offline and online approaches for addressing questions to a crowd are defined and contrasted on both synthetic and real data sets, with the aim of minimizing the crowd interactions necessary to find the realordering of the result set.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Querying uncertain data has become a prominent application due to the proliferation of user-generated content from social media and of data streams from sensors. When data ambiguity cannot be reduced algorithmically, crowdsourcing proves a viable approach, which consists of posting tasks to humans and harnessing their judgment for improving the confidence about data values or relationships. This paper tackles the problem of processing top- - queries over uncertain data with the help of crowdsourcing for quickly converging to the realordering of relevant results. Several offline and online approaches for addressing questions to a crowd are defined and contrasted on both synthetic and real data sets, with the aim of minimizing the crowd interactions necessary to find the realordering of the result set.",
"title": "Crowdsourcing for Top-K Query Processing over Uncertain Data",
"normalizedTitle": "Crowdsourcing for Top-K Query Processing over Uncertain Data",
"fno": "07172551",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Uncertainty",
"Measurement Uncertainty",
"Probability Density Function",
"Crowdsourcing",
"Query Processing",
"Entropy",
"Sensors",
"User Machine Systems",
"Query Processing",
"User Machine Systems"
],
"authors": [
{
"givenName": "Eleonora",
"surname": "Ciceri",
"fullName": "Eleonora Ciceri",
"affiliation": "Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Piero",
"surname": "Fraternali",
"fullName": "Piero Fraternali",
"affiliation": "Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Davide",
"surname": "Martinenghi",
"fullName": "Davide Martinenghi",
"affiliation": "Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marco",
"surname": "Tagliasacchi",
"fullName": "Marco Tagliasacchi",
"affiliation": "Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "41-53",
"year": "2016",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2007/0802/0/04221738",
"title": "Top-k Query Processing in Uncertain Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2007/04221738/12OmNAfy7KT",
"parentPublication": {
"id": "proceedings/icde/2007/0802/0",
"title": "2007 IEEE 23rd International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2016/2020/0/07498370",
"title": "Crowdsourcing for top-K query processing over uncertain data",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2016/07498370/12OmNx8OurU",
"parentPublication": {
"id": "proceedings/icde/2016/2020/0",
"title": "2016 IEEE 32nd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2015/7964/0/07113268",
"title": "Cleaning uncertain data with a noisy crowd",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2015/07113268/12OmNyQGSpr",
"parentPublication": {
"id": "proceedings/icde/2015/7964/0",
"title": "2015 IEEE 31st International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2016/2020/0/07498417",
"title": "CrowdOp: Query optimization for declarative crowdsourcing systems",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2016/07498417/12OmNzkMlQP",
"parentPublication": {
"id": "proceedings/icde/2016/2020/0",
"title": "2016 IEEE 32nd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/07/06857331",
"title": "Crowdsourcing Enumeration Queries: Estimators and Interfaces",
"doi": null,
"abstractUrl": "/journal/tk/2015/07/06857331/13rRUEgaroe",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/08/07052378",
"title": "CrowdOp: Query Optimization for Declarative Crowdsourcing Systems",
"doi": null,
"abstractUrl": "/journal/tk/2015/08/07052378/13rRUwjGoM2",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/10/07954652",
"title": "Reducing Uncertainty of Probabilistic Top-Z_$k$_Z Ranking via Pairwise Crowdsourcing",
"doi": null,
"abstractUrl": "/journal/tk/2017/10/07954652/13rRUxASuGN",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000b757",
"title": "Reducing Uncertainty of Probabilistic Top-k Ranking via Pairwise Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000b757/14Fq0VdrN9U",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/01/08533346",
"title": "Reducing Uncertainty of Schema Matching via Crowdsourcing with Accuracy Rates",
"doi": null,
"abstractUrl": "/journal/tk/2020/01/08533346/17D45XreC6p",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/08/09210063",
"title": "Cleaning Uncertain Data With Crowdsourcing - A General Model With Diverse Accuracy Rates",
"doi": null,
"abstractUrl": "/journal/tk/2022/08/09210063/1nxQ8znqVIQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07163594",
"articleId": "13rRUytWF9J",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07164333",
"articleId": "13rRUxOdD37",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy3iFo1",
"title": "October-December",
"year": "2009",
"issueNum": "04",
"idPrefix": "th",
"pubType": "journal",
"volume": "2",
"label": "October-December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0qnGr",
"doi": "10.1109/TOH.2009.23",
"abstract": "We examine a crucial aspect of a tool intended to support designing for feel: the ability of an objective physical-model identification method to capture perceptually relevant parameters, relative to human identification performance. The feel of manual controls, such as knobs, sliders, and buttons, becomes critical when these controls are used in certain settings. Appropriate feel enables designers to create consistent control behaviors that lead to improved usability and safety. For example, a heavy knob with stiff detents for a power plant boiler setting may afford better feedback and safer operations, whereas subtle detents in an automobile radio volume knob may afford improved ergonomics and driver attention to the road. To assess the quality of our identification method, we compared previously reported automated model captures for five real mechanical reference knobs with captures by novice and expert human participants who were asked to adjust four parameters of a rendered knob model to match the feel of each reference knob. Participants indicated their satisfaction with the matches their renderings produced. We observed similar relative inertia, friction, detent strength, and detent spacing parameterizations by human experts and our automatic estimation methods. Qualitative results provided insight on users' strategies and confidence. While experts (but not novices) were better able to ascertain an underlying model in the presence of unmodeled dynamics, the objective algorithm outperformed all humans when an appropriate physical model was used. Our studies demonstrate that automated model identification can capture knob dynamics as perceived by a human, and they also establish limits to that ability; they comprise a step towards pragmatic design guidelines for embedded physical interfaces in which methodological expedience is informed by human perceptual requirements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We examine a crucial aspect of a tool intended to support designing for feel: the ability of an objective physical-model identification method to capture perceptually relevant parameters, relative to human identification performance. The feel of manual controls, such as knobs, sliders, and buttons, becomes critical when these controls are used in certain settings. Appropriate feel enables designers to create consistent control behaviors that lead to improved usability and safety. For example, a heavy knob with stiff detents for a power plant boiler setting may afford better feedback and safer operations, whereas subtle detents in an automobile radio volume knob may afford improved ergonomics and driver attention to the road. To assess the quality of our identification method, we compared previously reported automated model captures for five real mechanical reference knobs with captures by novice and expert human participants who were asked to adjust four parameters of a rendered knob model to match the feel of each reference knob. Participants indicated their satisfaction with the matches their renderings produced. We observed similar relative inertia, friction, detent strength, and detent spacing parameterizations by human experts and our automatic estimation methods. Qualitative results provided insight on users' strategies and confidence. While experts (but not novices) were better able to ascertain an underlying model in the presence of unmodeled dynamics, the objective algorithm outperformed all humans when an appropriate physical model was used. Our studies demonstrate that automated model identification can capture knob dynamics as perceived by a human, and they also establish limits to that ability; they comprise a step towards pragmatic design guidelines for embedded physical interfaces in which methodological expedience is informed by human perceptual requirements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We examine a crucial aspect of a tool intended to support designing for feel: the ability of an objective physical-model identification method to capture perceptually relevant parameters, relative to human identification performance. The feel of manual controls, such as knobs, sliders, and buttons, becomes critical when these controls are used in certain settings. Appropriate feel enables designers to create consistent control behaviors that lead to improved usability and safety. For example, a heavy knob with stiff detents for a power plant boiler setting may afford better feedback and safer operations, whereas subtle detents in an automobile radio volume knob may afford improved ergonomics and driver attention to the road. To assess the quality of our identification method, we compared previously reported automated model captures for five real mechanical reference knobs with captures by novice and expert human participants who were asked to adjust four parameters of a rendered knob model to match the feel of each reference knob. Participants indicated their satisfaction with the matches their renderings produced. We observed similar relative inertia, friction, detent strength, and detent spacing parameterizations by human experts and our automatic estimation methods. Qualitative results provided insight on users' strategies and confidence. While experts (but not novices) were better able to ascertain an underlying model in the presence of unmodeled dynamics, the objective algorithm outperformed all humans when an appropriate physical model was used. Our studies demonstrate that automated model identification can capture knob dynamics as perceived by a human, and they also establish limits to that ability; they comprise a step towards pragmatic design guidelines for embedded physical interfaces in which methodological expedience is informed by human perceptual requirements.",
"title": "Designing for Feel: Contrasts between Human and Automated Parametric Capture of Knob Physics",
"normalizedTitle": "Designing for Feel: Contrasts between Human and Automated Parametric Capture of Knob Physics",
"fno": "tth2009040200",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Haptic I O",
"Evaluation Methodology",
"Human Factors",
"Software Psychology"
],
"authors": [
{
"givenName": "Colin",
"surname": "Swindells",
"fullName": "Colin Swindells",
"affiliation": "University of Victoria, Victoria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karon E.",
"surname": "MacLean",
"fullName": "Karon E. MacLean",
"affiliation": "University of British Columbia, Vancouver",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kellogg S.",
"surname": "Booth",
"fullName": "Kellogg S. Booth",
"affiliation": "University of British Columbia, Vancouver",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2009-10-01 00:00:00",
"pubType": "trans",
"pages": "200-211",
"year": "2009",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/haptics/2002/1489/0/14890342",
"title": "Rotary Haptic Knob for Vehicular Instrument Controls",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2002/14890342/12OmNAo45Dk",
"parentPublication": {
"id": "proceedings/haptics/2002/1489/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2006/0226/0/02260058",
"title": "Performance Enhancement of a Haptic Arm Exoskeleton",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2006/02260058/12OmNscxj93",
"parentPublication": {
"id": "proceedings/haptics/2006/0226/0",
"title": "2006 14th Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2006/0226/0/02260062",
"title": "Analysis of Spatially Constrained Reaching Movements in Haptic Environments",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2006/02260062/12OmNyp9Mn4",
"parentPublication": {
"id": "proceedings/haptics/2006/0226/0",
"title": "2006 14th Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/whc/2007/2738/0/04145158",
"title": "Human Performance in a Knob-Turning Task",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2007/04145158/12OmNzd7bBO",
"parentPublication": {
"id": "proceedings/whc/2007/2738/0",
"title": "2007 2nd Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environments and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2010/01/tta2010010060",
"title": "Empathic Touch by Relational Agents",
"doi": null,
"abstractUrl": "/journal/ta/2010/01/tta2010010060/13rRUwI5Ujg",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/01/v0103",
"title": "Predictive Haptic Guidance: Intelligent User Assistance for the Control of Dynamic Tasks",
"doi": null,
"abstractUrl": "/journal/tg/2006/01/v0103/13rRUwcS1CJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2008/01/tth2008010009",
"title": "Asymmetric Oscillation Distorts the Perceived Heaviness of Handheld Objects",
"doi": null,
"abstractUrl": "/journal/th/2008/01/tth2008010009/13rRUxASubF",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/02/tth2010020078",
"title": "Field-Based Validation of a Tactile Navigation Device",
"doi": null,
"abstractUrl": "/journal/th/2010/02/tth2010020078/13rRUxly8T8",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2012/03/tth2012030274",
"title": "Supporting Negotiation Behavior with Haptics-Enabled Human-Computer Interfaces",
"doi": null,
"abstractUrl": "/journal/th/2012/03/tth2012030274/13rRUzphDy5",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/04/09099981",
"title": "Do You Feel Like Flying? A Study of Flying Perception in Virtual Reality for Future Game Development",
"doi": null,
"abstractUrl": "/magazine/cg/2020/04/09099981/1k93o1dO9WM",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tth2009040189",
"articleId": "13rRUEgarsN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tth2009040212",
"articleId": "13rRUxly8T7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqb",
"title": "November/December",
"year": "2005",
"issueNum": "06",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "25",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwgQpwS",
"doi": "10.1109/MCG.2005.133",
"abstract": "With the increasing use of high-dynamic-range (HDR) images, their storage and transmission motivate a careful study of appropriate data compression techniques. This article explores the use of JPEG 2000 in the compression of HDR still images. The authors first map the pixels from original floating-point values in the logarithm domain into integer values, and then encode the image using JPEG 2000 codec. This approach can compress an HDR image anywhere in the spectrum from very low bit rate to visually lossless. Our experiments demonstrate this to be a simple, effective and practical tool for HDR image encoding. At low bit rates, its compression quality is superior to other currently published techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the increasing use of high-dynamic-range (HDR) images, their storage and transmission motivate a careful study of appropriate data compression techniques. This article explores the use of JPEG 2000 in the compression of HDR still images. The authors first map the pixels from original floating-point values in the logarithm domain into integer values, and then encode the image using JPEG 2000 codec. This approach can compress an HDR image anywhere in the spectrum from very low bit rate to visually lossless. Our experiments demonstrate this to be a simple, effective and practical tool for HDR image encoding. At low bit rates, its compression quality is superior to other currently published techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the increasing use of high-dynamic-range (HDR) images, their storage and transmission motivate a careful study of appropriate data compression techniques. This article explores the use of JPEG 2000 in the compression of HDR still images. The authors first map the pixels from original floating-point values in the logarithm domain into integer values, and then encode the image using JPEG 2000 codec. This approach can compress an HDR image anywhere in the spectrum from very low bit rate to visually lossless. Our experiments demonstrate this to be a simple, effective and practical tool for HDR image encoding. At low bit rates, its compression quality is superior to other currently published techniques.",
"title": "High-Dynamic-Range Still-Image Encoding in JPEG 2000",
"normalizedTitle": "High-Dynamic-Range Still-Image Encoding in JPEG 2000",
"fno": "mcg2005060057",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"High Dynamic Range Image",
"JPEG 2000",
"Image Compression"
],
"authors": [
{
"givenName": "Ruifeng",
"surname": "Xu",
"fullName": "Ruifeng Xu",
"affiliation": "University of Central Florida",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sumanta N.",
"surname": "Pattanaik",
"fullName": "Sumanta N. Pattanaik",
"affiliation": "University of Central Florida",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles E.",
"surname": "Hughes",
"fullName": "Charles E. Hughes",
"affiliation": "University of Central Florida",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2005-11-01 00:00:00",
"pubType": "mags",
"pages": "57-64",
"year": "2005",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isspit/2005/9313/0/01577213",
"title": "Recovery of damaged code blocks in LL sub-band of JPEG 2000 images",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2005/01577213/12OmNCzsKGb",
"parentPublication": {
"id": "proceedings/isspit/2005/9313/0",
"title": "2005 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2006/2687/0/26870140",
"title": "A Novel Implementation of JPEG 2000 Lossless Coding Based on LZMA",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2006/26870140/12OmNxRnvRd",
"parentPublication": {
"id": "proceedings/cit/2006/2687/0",
"title": "The Sixth IEEE International Conference on Computer and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiri/2009/3758/0/3758a413",
"title": "JPEG 2000 and Digital Watermarking Technique Using in Medical Image",
"doi": null,
"abstractUrl": "/proceedings-article/ssiri/2009/3758a413/12OmNy2rRT1",
"parentPublication": {
"id": "proceedings/ssiri/2009/3758/0",
"title": "Secure System Integration and Reliability Improvement",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2008/3497/1/3497a418",
"title": "Detection of Double-Compression in JPEG2000 Images",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2008/3497a418/12OmNyQGS78",
"parentPublication": {
"id": "proceedings/iita/2008/3497/3",
"title": "2008 Second International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2012/4656/0/4656a013",
"title": "Compressing JPEG 2000 JPIP Cache State Information",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2012/4656a013/12OmNyRxFyn",
"parentPublication": {
"id": "proceedings/dcc/2012/4656/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2005/9331/0/01521362",
"title": "A Reversible Watermarking Scheme for JPEG-2000 Compressed Images",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2005/01521362/12OmNyxXllF",
"parentPublication": {
"id": "proceedings/icme/2005/9331/0",
"title": "2005 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2000/0592/0/05920523",
"title": "An Overview of JPEG-2000",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2000/05920523/12OmNzkMlR4",
"parentPublication": {
"id": "proceedings/dcc/2000/0592/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2009/3592/0/3592a401",
"title": "A MS-SSIM Optimal JPEG 2000 Encoder",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2009/3592a401/12OmNzyYiaI",
"parentPublication": {
"id": "proceedings/dcc/2009/3592/0",
"title": "2009 Data Compression Conference. DCC 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2011/05/ttc2011050628",
"title": "Design of an Error-Tolerance Scheme for Discrete Wavelet Transform in JPEG 2000 Encoder",
"doi": null,
"abstractUrl": "/journal/tc/2011/05/ttc2011050628/13rRUwdIOTW",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2005/01/q0057",
"title": "Fault Tolerance Design in JPEG 2000 Image Compression System",
"doi": null,
"abstractUrl": "/journal/tq/2005/01/q0057/13rRUxBa5yQ",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2005060048",
"articleId": "13rRUwghdbu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2005060066",
"articleId": "13rRUxYIMXu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwNwzNc",
"title": "June",
"year": "2015",
"issueNum": "06",
"idPrefix": "tp",
"pubType": "journal",
"volume": "37",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgxXH",
"doi": "10.1109/TPAMI.2014.2361338",
"abstract": "This paper introduces a new high dynamic range (HDR) imaging algorithm which utilizes rank minimization. Assuming a camera responses linearly to scene radiance, the input low dynamic range (LDR) images captured with different exposure time exhibit a linear dependency and form a rank-1 matrix when stacking intensity of each corresponding pixel together. In practice, misalignments caused by camera motion, presences of moving objects, saturations and image noise break the rank-1 structure of the LDR images. To address these problems, we present a rank minimization algorithm which simultaneously aligns LDR images and detects outliers for robust HDR generation. We evaluate the performances of our algorithm systematically using synthetic examples and qualitatively compare our results with results from the state-of-the-art HDR algorithms using challenging real world examples.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces a new high dynamic range (HDR) imaging algorithm which utilizes rank minimization. Assuming a camera responses linearly to scene radiance, the input low dynamic range (LDR) images captured with different exposure time exhibit a linear dependency and form a rank-1 matrix when stacking intensity of each corresponding pixel together. In practice, misalignments caused by camera motion, presences of moving objects, saturations and image noise break the rank-1 structure of the LDR images. To address these problems, we present a rank minimization algorithm which simultaneously aligns LDR images and detects outliers for robust HDR generation. We evaluate the performances of our algorithm systematically using synthetic examples and qualitatively compare our results with results from the state-of-the-art HDR algorithms using challenging real world examples.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces a new high dynamic range (HDR) imaging algorithm which utilizes rank minimization. Assuming a camera responses linearly to scene radiance, the input low dynamic range (LDR) images captured with different exposure time exhibit a linear dependency and form a rank-1 matrix when stacking intensity of each corresponding pixel together. In practice, misalignments caused by camera motion, presences of moving objects, saturations and image noise break the rank-1 structure of the LDR images. To address these problems, we present a rank minimization algorithm which simultaneously aligns LDR images and detects outliers for robust HDR generation. We evaluate the performances of our algorithm systematically using synthetic examples and qualitatively compare our results with results from the state-of-the-art HDR algorithms using challenging real world examples.",
"title": "Robust High Dynamic Range Imaging by Rank Minimization",
"normalizedTitle": "Robust High Dynamic Range Imaging by Rank Minimization",
"fno": "06915885",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Cameras",
"Minimization",
"Dynamic Range",
"Robustness",
"Heuristic Algorithms",
"Image Reconstruction",
"Alignment",
"High Dynamic Range Image",
"Rank Minimization",
"RPCA",
"Matrix Completion",
"Multi Exposure Fusion",
"Alignment",
"High Dynamic Range Image",
"Rank Minimization",
"RPCA",
"Matrix Completion",
"Multi Exposure Fusion"
],
"authors": [
{
"givenName": "Tae-Hyun",
"surname": "Oh",
"fullName": "Tae-Hyun Oh",
"affiliation": "Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joon-Young",
"surname": "Lee",
"fullName": "Joon-Young Lee",
"affiliation": "Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu-Wing",
"surname": "Tai",
"fullName": "Yu-Wing Tai",
"affiliation": "Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "In So",
"surname": "Kweon",
"fullName": "In So Kweon",
"affiliation": "Department of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2015-06-01 00:00:00",
"pubType": "trans",
"pages": "1219-1232",
"year": "2015",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ism/2015/0379/0/0379a289",
"title": "Evaluation of Feature Detection in HDR Based Imaging Under Changes in Illumination Conditions",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2015/0379a289/12OmNrFBPVE",
"parentPublication": {
"id": "proceedings/ism/2015/0379/0",
"title": "2015 IEEE International Symposium on Multimedia (ISM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/12/08481592",
"title": "Rank Minimization for Snapshot Compressive Imaging",
"doi": null,
"abstractUrl": "/journal/tp/2019/12/08481592/146z4FBGCW2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2019/1975/0/197500a041",
"title": "Multi-Scale Dense Networks for Deep High Dynamic Range Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500a041/18j8GO2zHcA",
"parentPublication": {
"id": "proceedings/wacv/2019/1975/0",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900b182",
"title": "Bidirectional Motion Estimation with Cyclic Cost Volume for High Dynamic Range Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900b182/1G56AFpQBri",
"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/cvprw/2022/8739/0/873900a546",
"title": "Multi-Bracket High Dynamic Range Imaging with Event Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900a546/1G56FK3UGPe",
"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/cvprw/2022/8739/0/873900b031",
"title": "Gamma-enhanced Spatial Attention Network for Efficient High Dynamic Range Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900b031/1G56nGzWShG",
"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/icpr/2022/9062/0/09956659",
"title": "DeepHS-HDRVideo: Deep High Speed High Dynamic Range Video Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956659/1IHpfcAcNUc",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2021/04/08930095",
"title": "Subjective Evaluation of High Dynamic Range Imaging for Face Matching",
"doi": null,
"abstractUrl": "/journal/ec/2021/04/08930095/1fCCON8Dwwo",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900a550",
"title": "A Two-stage Deep Network for High Dynamic Range Image Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900a550/1yJYflzAa2I",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900a691",
"title": "NTIRE 2021 Challenge on High Dynamic Range Imaging: Dataset, Methods and Results",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900a691/1yJYojK19i8",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06915721",
"articleId": "13rRUwInv5H",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06915738",
"articleId": "13rRUy3xY9h",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRTO",
"name": "ttp201506-06915885s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201506-06915885s1.zip",
"extension": "zip",
"size": "83.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.