data
dict |
|---|
{
"issue": {
"id": "12OmNzICEFs",
"title": "Sept.",
"year": "2012",
"issueNum": "09",
"idPrefix": "co",
"pubType": "magazine",
"volume": "45",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0geD3",
"doi": "10.1109/MC.2012.77",
"abstract": "The increased degrees of freedom in a multitouch interface help users control 4D worlds with intuitive gestures. Relative to a specialized mouse-based interface, a multitouch interface is easier to learn, and 4D object manipulation is up to 1.5 times faster.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The increased degrees of freedom in a multitouch interface help users control 4D worlds with intuitive gestures. Relative to a specialized mouse-based interface, a multitouch interface is easier to learn, and 4D object manipulation is up to 1.5 times faster.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The increased degrees of freedom in a multitouch interface help users control 4D worlds with intuitive gestures. Relative to a specialized mouse-based interface, a multitouch interface is easier to learn, and 4D object manipulation is up to 1.5 times faster.",
"title": "Multitouching the Fourth Dimension",
"normalizedTitle": "Multitouching the Fourth Dimension",
"fno": "mco2012090080",
"hasPdf": true,
"idPrefix": "co",
"keywords": [
"Fourth Dimensional Displays",
"User Interfaces",
"Haptics",
"Hypercubes",
"Mouse Computers",
"Visualization",
"User Interaction",
"4 D Visualization",
"Multitouch Technology"
],
"authors": [
{
"givenName": "Xiaoqi",
"surname": "Yan",
"fullName": "Xiaoqi Yan",
"affiliation": "Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Wing",
"surname": "Fu",
"fullName": "Chi-Wing Fu",
"affiliation": "Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew J.",
"surname": "Hanson",
"fullName": "Andrew J. Hanson",
"affiliation": "Indiana University Bloomington",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2012-09-01 00:00:00",
"pubType": "mags",
"pages": "80-88",
"year": "2012",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmtma/2010/3962/2/3962c907",
"title": "Porting Mu-C/GUI to LCD and VGA in Nios II System",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962c907/12OmNvTTcdl",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/2",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2008/2047/0/04476599",
"title": "Tech-note: 4Record ",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2008/04476599/12OmNvwTGCb",
"parentPublication": {
"id": "proceedings/3dui/2008/2047/0",
"title": "2008 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/digitel/2012/4663/0/4663a150",
"title": "Proposal and Development Prototype of Markers-type Mouse System with Considering Practical and Entertainment",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2012/4663a150/12OmNwE9OH2",
"parentPublication": {
"id": "proceedings/digitel/2012/4663/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2011/4543/0/4543a153",
"title": "The Construction and Application of Multitouch Interactive Platform Based on Touchlib",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2011/4543a153/12OmNwNOaNP",
"parentPublication": {
"id": "proceedings/icinis/2011/4543/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660034",
"title": "Multimodal Exploration of the Fourth Dimension",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660034/12OmNyTfg9Y",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isbast/2012/4696/0/4696a009",
"title": "A New Non-intrusive Authentication Approach for Data Protection Based on Mouse Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/isbast/2012/4696a009/12OmNyugz3I",
"parentPublication": {
"id": "proceedings/isbast/2012/4696/0",
"title": "Biometrics and Security Technologies, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1991/2245/0/00175821",
"title": "Visualizing the fourth dimension using geometry and light",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1991/00175821/12OmNzlD9i8",
"parentPublication": {
"id": "proceedings/visual/1991/2245/0",
"title": "1991 Proceeding Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532804",
"title": "Multimodal exploration of the fourth dimension",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532804/12OmNzmclAo",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/05/mcg2006050036",
"title": "Informing the Design of Direct-Touch Tabletops",
"doi": null,
"abstractUrl": "/magazine/cg/2006/05/mcg2006050036/13rRUwvT9iE",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2011/03/tlt2011030222",
"title": "Benefits of a Tangible Interface for Collaborative Learning and Interaction",
"doi": null,
"abstractUrl": "/journal/lt/2011/03/tlt2011030222/13rRUy08MuQ",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mco2012090072",
"articleId": "13rRUxC0SHA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mco2012090089",
"articleId": "13rRUy3gmYv",
"__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": "13rRUxlgy3E",
"doi": "10.1109/TVCG.2011.283",
"abstract": "We present Interactive Slice World-in-Miniature (WIM), a framework for navigating and interrogating volumetric data sets using an interface enabled by a virtual reality environment made of two display surfaces: an interactive multitouch table, and a stereoscopic display wall. The framework addresses two current challenges in immersive visualization: 1) providing an appropriate overview+detail style of visualization while navigating through volume data, and 2) supporting interactive querying and data exploration, i.e., interrogating volume data. The approach extends the WIM metaphor, simultaneously displaying a large-scale detailed data visualization and an interactive miniature. Leveraging the table+wall hardware, horizontal slices are projected (like a shadow) down onto the table surface, providing a useful 2D data overview to complement the 3D views as well as a data context for interpreting 2D multitouch gestures made on the table. In addition to enabling effective navigation through complex geometries, extensions to the core Slice WIM technique support interacting with a set of multiple slices that persist on the table even as the user navigates around a scene and annotating and measuring data via points, paths, and volumes specified using interactive slices. Applications of the interface to two volume data sets are presented, and design decisions, limitations, and user feedback are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present Interactive Slice World-in-Miniature (WIM), a framework for navigating and interrogating volumetric data sets using an interface enabled by a virtual reality environment made of two display surfaces: an interactive multitouch table, and a stereoscopic display wall. The framework addresses two current challenges in immersive visualization: 1) providing an appropriate overview+detail style of visualization while navigating through volume data, and 2) supporting interactive querying and data exploration, i.e., interrogating volume data. The approach extends the WIM metaphor, simultaneously displaying a large-scale detailed data visualization and an interactive miniature. Leveraging the table+wall hardware, horizontal slices are projected (like a shadow) down onto the table surface, providing a useful 2D data overview to complement the 3D views as well as a data context for interpreting 2D multitouch gestures made on the table. In addition to enabling effective navigation through complex geometries, extensions to the core Slice WIM technique support interacting with a set of multiple slices that persist on the table even as the user navigates around a scene and annotating and measuring data via points, paths, and volumes specified using interactive slices. Applications of the interface to two volume data sets are presented, and design decisions, limitations, and user feedback are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present Interactive Slice World-in-Miniature (WIM), a framework for navigating and interrogating volumetric data sets using an interface enabled by a virtual reality environment made of two display surfaces: an interactive multitouch table, and a stereoscopic display wall. The framework addresses two current challenges in immersive visualization: 1) providing an appropriate overview+detail style of visualization while navigating through volume data, and 2) supporting interactive querying and data exploration, i.e., interrogating volume data. The approach extends the WIM metaphor, simultaneously displaying a large-scale detailed data visualization and an interactive miniature. Leveraging the table+wall hardware, horizontal slices are projected (like a shadow) down onto the table surface, providing a useful 2D data overview to complement the 3D views as well as a data context for interpreting 2D multitouch gestures made on the table. In addition to enabling effective navigation through complex geometries, extensions to the core Slice WIM technique support interacting with a set of multiple slices that persist on the table even as the user navigates around a scene and annotating and measuring data via points, paths, and volumes specified using interactive slices. Applications of the interface to two volume data sets are presented, and design decisions, limitations, and user feedback are discussed.",
"title": "Interactive Slice WIM: Navigating and Interrogating Volume Data Sets Using a Multisurface, Multitouch VR Interface",
"normalizedTitle": "Interactive Slice WIM: Navigating and Interrogating Volume Data Sets Using a Multisurface, Multitouch VR Interface",
"fno": "ttg2012101614",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Data Visualization",
"Navigation",
"Stereo Image Processing",
"Two Dimensional Displays",
"Solid Modeling",
"3 D User Interface",
"World In Miniature",
"Virtual Reality",
"Multitouch",
"Overview Detail",
"Volume Visualization"
],
"authors": [
{
"givenName": "Dane",
"surname": "Coffey",
"fullName": "Dane Coffey",
"affiliation": "University of Minnesota, Minneapolis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicholas",
"surname": "Malbraaten",
"fullName": "Nicholas Malbraaten",
"affiliation": "University of Minnesota, Minneapolis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Trung Bao",
"surname": "Le",
"fullName": "Trung Bao Le",
"affiliation": "University of Minnesota, Minneapolis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Iman",
"surname": "Borazjani",
"fullName": "Iman Borazjani",
"affiliation": "SUNY University at Buffalo, Buffalo",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fotis",
"surname": "Sotiropoulos",
"fullName": "Fotis Sotiropoulos",
"affiliation": "University of Minnesota, Minneapolis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arthur G.",
"surname": "Erdman",
"fullName": "Arthur G. Erdman",
"affiliation": "University of Minnesota, Minneapolis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel F.",
"surname": "Keefe",
"fullName": "Daniel F. Keefe",
"affiliation": "University of Minnesota, Minneapolis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2012-10-01 00:00:00",
"pubType": "trans",
"pages": "1614-1626",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cw/2012/4814/0/4814a144",
"title": "New Ways of Accessing Information Spaces Using 3D Multitouch Tables",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2012/4814a144/12OmNBpVPUJ",
"parentPublication": {
"id": "proceedings/cw/2012/4814/0",
"title": "2012 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2011/4543/0/4543a153",
"title": "The Construction and Application of Multitouch Interactive Platform Based on Touchlib",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2011/4543a153/12OmNwNOaNP",
"parentPublication": {
"id": "proceedings/icinis/2011/4543/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2008/1971/0/04480805",
"title": "HOG on a WIM",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2008/04480805/12OmNyQ7FCw",
"parentPublication": {
"id": "proceedings/vr/2008/1971/0",
"title": "IEEE Virtual Reality 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030369",
"title": "Integrality and Separability of Multitouch Interaction Techniques in 3D Manipulation Tasks",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030369/13rRUx0gepW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a920",
"title": "Clean the Ocean: An Immersive VR Experience Proposing New Modifications to Go-Go and WiM Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a920/1CJettpbljW",
"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/840200a900",
"title": "Spatial Exploration with a WiM for Capturing 3D Dioramic Snapshots",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a900/1CJeviyT4cw",
"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/536500a118",
"title": "L-WiM: Collaborative Exploration in Immersive Environments",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a118/1J7Wu6cLbMI",
"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/icvrv/2019/4752/0/09212896",
"title": "Interactive Modeling of Trees Using VR Devices",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2019/09212896/1nHRRssduko",
"parentPublication": {
"id": "proceedings/icvrv/2019/4752/0",
"title": "2019 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/08/09373930",
"title": "SANet: A Slice-Aware Network for Pulmonary Nodule Detection",
"doi": null,
"abstractUrl": "/journal/tp/2022/08/09373930/1rPt5kyZYaI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900l1531",
"title": "SliceNet: deep dense depth estimation from a single indoor panorama using a slice-based representation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900l1531/1yeJUadMogM",
"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": "ttg2012101603",
"articleId": "13rRUxC0SvS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012101627",
"articleId": "13rRUyYjKad",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRVb",
"name": "ttg2012101614s.m4v",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2012101614s.m4v",
"extension": "m4v",
"size": "41 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWx",
"title": "September",
"year": "2011",
"issueNum": "09",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB7a10Y",
"doi": "10.1109/TVCG.2011.33",
"abstract": "In this paper, we present a novel technique to calibrate multiple casually aligned projectors on fiducial-free piecewise smooth vertically extruded surfaces using a single camera. Such surfaces include cylindrical displays and CAVEs, common in immersive virtual reality systems. We impose two priors to the display surface. We assume the surface is a piecewise smooth vertically extruded surface for which the aspect ratio of the rectangle formed by the four corners of the surface is known and the boundary is visible and segmentable. Using these priors, we can estimate the display's 3D geometry and camera extrinsic parameters using a nonlinear optimization technique from a single image without any explicit display to camera correspondences. Using the estimated camera and display properties, the intrinsic and extrinsic parameters of each projector are recovered using a single projected pattern seen by the camera. This in turn is used to register the images on the display from any arbitrary viewpoint making it appropriate for virtual reality systems. The fast convergence and robustness of this method is achieved via a novel dimension reduction technique for camera parameter estimation and a novel deterministic technique for projector property estimation. This simplicity, efficiency, and robustness of our method enable several coveted features for nonplanar projection-based displays. First, it allows fast recalibration in the face of projector, display or camera movements and even change in display shape. Second, this opens up, for the first time, the possibility of allowing multiple projectors to overlap on the corners of the CAVE—a popular immersive VR display system. Finally, this opens up the possibility of easily deploying multiprojector displays on aesthetic novel shapes for edutainment and digital signage applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a novel technique to calibrate multiple casually aligned projectors on fiducial-free piecewise smooth vertically extruded surfaces using a single camera. Such surfaces include cylindrical displays and CAVEs, common in immersive virtual reality systems. We impose two priors to the display surface. We assume the surface is a piecewise smooth vertically extruded surface for which the aspect ratio of the rectangle formed by the four corners of the surface is known and the boundary is visible and segmentable. Using these priors, we can estimate the display's 3D geometry and camera extrinsic parameters using a nonlinear optimization technique from a single image without any explicit display to camera correspondences. Using the estimated camera and display properties, the intrinsic and extrinsic parameters of each projector are recovered using a single projected pattern seen by the camera. This in turn is used to register the images on the display from any arbitrary viewpoint making it appropriate for virtual reality systems. The fast convergence and robustness of this method is achieved via a novel dimension reduction technique for camera parameter estimation and a novel deterministic technique for projector property estimation. This simplicity, efficiency, and robustness of our method enable several coveted features for nonplanar projection-based displays. First, it allows fast recalibration in the face of projector, display or camera movements and even change in display shape. Second, this opens up, for the first time, the possibility of allowing multiple projectors to overlap on the corners of the CAVE—a popular immersive VR display system. Finally, this opens up the possibility of easily deploying multiprojector displays on aesthetic novel shapes for edutainment and digital signage applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a novel technique to calibrate multiple casually aligned projectors on fiducial-free piecewise smooth vertically extruded surfaces using a single camera. Such surfaces include cylindrical displays and CAVEs, common in immersive virtual reality systems. We impose two priors to the display surface. We assume the surface is a piecewise smooth vertically extruded surface for which the aspect ratio of the rectangle formed by the four corners of the surface is known and the boundary is visible and segmentable. Using these priors, we can estimate the display's 3D geometry and camera extrinsic parameters using a nonlinear optimization technique from a single image without any explicit display to camera correspondences. Using the estimated camera and display properties, the intrinsic and extrinsic parameters of each projector are recovered using a single projected pattern seen by the camera. This in turn is used to register the images on the display from any arbitrary viewpoint making it appropriate for virtual reality systems. The fast convergence and robustness of this method is achieved via a novel dimension reduction technique for camera parameter estimation and a novel deterministic technique for projector property estimation. This simplicity, efficiency, and robustness of our method enable several coveted features for nonplanar projection-based displays. First, it allows fast recalibration in the face of projector, display or camera movements and even change in display shape. Second, this opens up, for the first time, the possibility of allowing multiple projectors to overlap on the corners of the CAVE—a popular immersive VR display system. Finally, this opens up the possibility of easily deploying multiprojector displays on aesthetic novel shapes for edutainment and digital signage applications.",
"title": "Autocalibrating Tiled Projectors on Piecewise Smooth Vertically Extruded Surfaces",
"normalizedTitle": "Autocalibrating Tiled Projectors on Piecewise Smooth Vertically Extruded Surfaces",
"fno": "ttg2011091209",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Tiled Displays",
"Autocalibration",
"Geometric Registration",
"Cylindrical Displays",
"CAVES"
],
"authors": [
{
"givenName": "Behzad",
"surname": "Sajadi",
"fullName": "Behzad Sajadi",
"affiliation": "University of California, Irvine, Irvine",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aditi",
"surname": "Majumder",
"fullName": "Aditi Majumder",
"affiliation": "University of California, Irvine, Irvine",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2011-09-01 00:00:00",
"pubType": "trans",
"pages": "1209-1222",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3pgcic/2011/4531/0/4531a299",
"title": "Experiment on Multi-video Transmission with Multipoint Tiled Display Wall",
"doi": null,
"abstractUrl": "/proceedings-article/3pgcic/2011/4531a299/12OmNAXPye0",
"parentPublication": {
"id": "proceedings/3pgcic/2011/4531/0",
"title": "P2P, Parallel, Grid, Cloud, and Internet Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2003/1991/0/19910217",
"title": "Multi-projectors for arbitrary surfaces without explicit calibration nor reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2003/19910217/12OmNAoDhVM",
"parentPublication": {
"id": "proceedings/3dim/2003/1991/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04285089",
"title": "A High Resolution Video Display System by Seamlessly Tiling Multiple Projectors",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04285089/12OmNB9bvdW",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2009/3639/0/3639a554",
"title": "An Experiment on Tele-immersive Communication with Tiled Displays Wall over JGN2plus Network",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2009/3639a554/12OmNqJ8tuG",
"parentPublication": {
"id": "proceedings/waina/2009/3639/0",
"title": "2009 International Conference on Advanced Information Networking and Applications Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444797",
"title": "Auto-calibration of cylindrical multi-projector systems",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444797/12OmNviHKkd",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__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": "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/2010/06/ttg2010061623",
"title": "A Scalable Distributed Paradigm for Multi-User Interaction with Tiled Rear Projection Display Walls",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061623/13rRUxYrbUB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061307",
"title": "Markerless View-Independent Registration of Multiple Distorted Projectors on Extruded Surfaces Using an Uncalibrated Camera",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061307/13rRUy0HYRj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030381",
"title": "Autocalibration of Multiprojector CAVE-Like Immersive Environments",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030381/13rRUy0qnLF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011091195",
"articleId": "13rRUB7a10X",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011091223",
"articleId": "13rRUwwaKt4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyxXlp2",
"title": "July",
"year": "2014",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2BX",
"doi": "10.1109/TVCG.2013.235",
"abstract": "Local collision avoidance algorithms in crowd simulation often ignore agents beyond a neighborhood of a certain size. This cutoff can result in sharp changes in trajectory when large groups of agents enter or exit these neighborhoods. In this work, we exploit the insight that exact collision avoidance is not necessary between agents at such large distances, and propose a novel algorithm for extending existing collision avoidance algorithms to perform approximate, long-range collision avoidance. Our formulation performs long-range collision avoidance for distant agent groups to efficiently compute trajectories that are smoother than those obtained with state-of-the-art techniques and at faster rates. Comparison to real-world data demonstrates that crowds simulated with our algorithm exhibit an improved speed sensitivity to density similar to human crowds. Another issue often sidestepped in existing work is that discrete and continuum collision avoidance algorithms have different regions of applicability. For example, low-density crowds cannot be modeled as a continuum, while high-density crowds can be expensive to model using discrete methods. We formulate a hybrid technique for crowd simulation which can accurately and efficiently simulate crowds at any density with seamless transitions between continuum and discrete representations. Our approach blends results from continuum and discrete algorithms, based on local density and velocity variance. In addition to being robust across a variety of group scenarios, it is also highly efficient, running at interactive rates for thousands of agents on portable systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Local collision avoidance algorithms in crowd simulation often ignore agents beyond a neighborhood of a certain size. This cutoff can result in sharp changes in trajectory when large groups of agents enter or exit these neighborhoods. In this work, we exploit the insight that exact collision avoidance is not necessary between agents at such large distances, and propose a novel algorithm for extending existing collision avoidance algorithms to perform approximate, long-range collision avoidance. Our formulation performs long-range collision avoidance for distant agent groups to efficiently compute trajectories that are smoother than those obtained with state-of-the-art techniques and at faster rates. Comparison to real-world data demonstrates that crowds simulated with our algorithm exhibit an improved speed sensitivity to density similar to human crowds. Another issue often sidestepped in existing work is that discrete and continuum collision avoidance algorithms have different regions of applicability. For example, low-density crowds cannot be modeled as a continuum, while high-density crowds can be expensive to model using discrete methods. We formulate a hybrid technique for crowd simulation which can accurately and efficiently simulate crowds at any density with seamless transitions between continuum and discrete representations. Our approach blends results from continuum and discrete algorithms, based on local density and velocity variance. In addition to being robust across a variety of group scenarios, it is also highly efficient, running at interactive rates for thousands of agents on portable systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Local collision avoidance algorithms in crowd simulation often ignore agents beyond a neighborhood of a certain size. This cutoff can result in sharp changes in trajectory when large groups of agents enter or exit these neighborhoods. In this work, we exploit the insight that exact collision avoidance is not necessary between agents at such large distances, and propose a novel algorithm for extending existing collision avoidance algorithms to perform approximate, long-range collision avoidance. Our formulation performs long-range collision avoidance for distant agent groups to efficiently compute trajectories that are smoother than those obtained with state-of-the-art techniques and at faster rates. Comparison to real-world data demonstrates that crowds simulated with our algorithm exhibit an improved speed sensitivity to density similar to human crowds. Another issue often sidestepped in existing work is that discrete and continuum collision avoidance algorithms have different regions of applicability. For example, low-density crowds cannot be modeled as a continuum, while high-density crowds can be expensive to model using discrete methods. We formulate a hybrid technique for crowd simulation which can accurately and efficiently simulate crowds at any density with seamless transitions between continuum and discrete representations. Our approach blends results from continuum and discrete algorithms, based on local density and velocity variance. In addition to being robust across a variety of group scenarios, it is also highly efficient, running at interactive rates for thousands of agents on portable systems.",
"title": "Hybrid Long-Range Collision Avoidance for Crowd Simulation",
"normalizedTitle": "Hybrid Long-Range Collision Avoidance for Crowd Simulation",
"fno": "06613491",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Collision Avoidance",
"Computational Modeling",
"Uncertainty",
"Approximation Algorithms",
"Planning",
"Navigation",
"Computational Efficiency",
"Hybrid Algorithms",
"Crowd Simulation",
"Collision Avoidance",
"Lookahead"
],
"authors": [
{
"givenName": "Abhinav",
"surname": "Golas",
"fullName": "Abhinav Golas",
"affiliation": "Univ. of North Carolina at Chapel Hill, Chapel Hill, NC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rahul",
"surname": "Narain",
"fullName": "Rahul Narain",
"affiliation": "Univ. of California, Berkeley, Berkeley, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sean",
"surname": "Curtis",
"fullName": "Sean Curtis",
"affiliation": "Univ. of North Carolina at Chapel Hill, Chapel Hill, NC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ming C.",
"surname": "Lin",
"fullName": "Ming C. Lin",
"affiliation": "Univ. of North Carolina at Chapel Hill, Chapel Hill, NC, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2014-07-01 00:00:00",
"pubType": "trans",
"pages": "1022-1034",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cicsyn/2010/4158/0/4158a152",
"title": "Study on Performance of Some Typical Tag Collision Avoidance Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/cicsyn/2010/4158a152/12OmNAtaRWs",
"parentPublication": {
"id": "proceedings/cicsyn/2010/4158/0",
"title": "Computational Intelligence, Communication Systems and Networks, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2011/4559/0/4559a155",
"title": "Research on Collision Avoidance Mechanisms of Broadcasting MAC Protocol",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2011/4559a155/12OmNBBhN5Q",
"parentPublication": {
"id": "proceedings/mines/2011/4559/0",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev-iscmht/2017/1023/0/08338524",
"title": "Information for safe navigation and the concept of collision avoidance",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-iscmht/2017/08338524/12OmNqFrGAc",
"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/iciicii/2016/3575/0/3575a232",
"title": "Research of Automatic Collision Avoidance Based on Ship Maneuvering",
"doi": null,
"abstractUrl": "/proceedings-article/iciicii/2016/3575a232/12OmNsbGvDR",
"parentPublication": {
"id": "proceedings/iciicii/2016/3575/0",
"title": "2016 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/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/crv/2015/1986/0/1986a297",
"title": "Vision-Based Collision Avoidance for Personal Aerial Vehicles Using Dynamic Potential Fields",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2015/1986a297/12OmNzcPAAt",
"parentPublication": {
"id": "proceedings/crv/2015/1986/0",
"title": "2015 12th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0/07847192",
"title": "Ship Automatic Collision Avoidance by Altering Course Based on Ship Dynamic Domain",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2016/07847192/12OmNzw8jhm",
"parentPublication": {
"id": "proceedings/trustcom-bigdatase-i-spa/2016/3205/0",
"title": "2016 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446180",
"title": "Effect of Virtual Human Gaze Behaviour During an Orthogonal Collision Avoidance Walking Task",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446180/13bd1sv5NyE",
"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/seaa/2020/9532/0/09226299",
"title": "Scenario-based Testing of a Ship Collision Avoidance System",
"doi": null,
"abstractUrl": "/proceedings-article/seaa/2020/09226299/1nYsTBBRZdu",
"parentPublication": {
"id": "proceedings/seaa/2020/9532/0",
"title": "2020 46th Euromicro Conference on Software Engineering and Advanced Applications (SEAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2020/7303/0/730300a001",
"title": "Comparison of Collision Avoidance Algorithms for Autonomous Multi-agent Systems",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2020/730300a001/1nkDgBsnh3q",
"parentPublication": {
"id": "proceedings/compsac/2020/7303/0",
"title": "2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06658758",
"articleId": "13rRUwInvJg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06654163",
"articleId": "13rRUygBwhK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqHItJa",
"title": "May",
"year": "2012",
"issueNum": "05",
"idPrefix": "tp",
"pubType": "journal",
"volume": "34",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwI5U91",
"doi": "10.1109/TPAMI.2011.176",
"abstract": "Building upon state-of-the-art algorithms for pedestrian detection and multi-object tracking, and inspired by sociological models of human collective behavior, we automatically detect small groups of individuals who are traveling together. These groups are discovered by bottom-up hierarchical clustering using a generalized, symmetric Hausdorff distance defined with respect to pairwise proximity and velocity. We validate our results quantitatively and qualitatively on videos of real-world pedestrian scenes. Where human-coded ground truth is available, we find substantial statistical agreement between our results and the human-perceived small group structure of the crowd. Results from our automated crowd analysis also reveal interesting patterns governing the shape of pedestrian groups. These discoveries complement current research in crowd dynamics, and may provide insights to improve evacuation planning and real-time situation awareness during public disturbances.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Building upon state-of-the-art algorithms for pedestrian detection and multi-object tracking, and inspired by sociological models of human collective behavior, we automatically detect small groups of individuals who are traveling together. These groups are discovered by bottom-up hierarchical clustering using a generalized, symmetric Hausdorff distance defined with respect to pairwise proximity and velocity. We validate our results quantitatively and qualitatively on videos of real-world pedestrian scenes. Where human-coded ground truth is available, we find substantial statistical agreement between our results and the human-perceived small group structure of the crowd. Results from our automated crowd analysis also reveal interesting patterns governing the shape of pedestrian groups. These discoveries complement current research in crowd dynamics, and may provide insights to improve evacuation planning and real-time situation awareness during public disturbances.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Building upon state-of-the-art algorithms for pedestrian detection and multi-object tracking, and inspired by sociological models of human collective behavior, we automatically detect small groups of individuals who are traveling together. These groups are discovered by bottom-up hierarchical clustering using a generalized, symmetric Hausdorff distance defined with respect to pairwise proximity and velocity. We validate our results quantitatively and qualitatively on videos of real-world pedestrian scenes. Where human-coded ground truth is available, we find substantial statistical agreement between our results and the human-perceived small group structure of the crowd. Results from our automated crowd analysis also reveal interesting patterns governing the shape of pedestrian groups. These discoveries complement current research in crowd dynamics, and may provide insights to improve evacuation planning and real-time situation awareness during public disturbances.",
"title": "Vision-Based Analysis of Small Groups in Pedestrian Crowds",
"normalizedTitle": "Vision-Based Analysis of Small Groups in Pedestrian Crowds",
"fno": "05989835",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Statistical Analysis",
"Image Recognition",
"Object Tracking",
"Pattern Clustering",
"Pedestrians",
"Real Time Situation Awareness",
"Vision Based Analysis",
"Pedestrian Crowd Dynamics",
"Multiobject Tracking",
"Sociological Model",
"Human Collective Behavior",
"Small Group Detection",
"Bottom Up Hierarchical Clustering",
"Generalized Symmetric Hausdortf Distance",
"Pairwise Proximity",
"Pairwise Velocity",
"Real World Pedestrian Scene",
"Human Coded Ground Truth",
"Substantial Statistical Agreement",
"Human Perceived Small Group Structure",
"Crowd Structure",
"Automated Crowd Analysis",
"Pedestrian Group",
"Trajectory",
"Videos",
"Target Tracking",
"Humans",
"Legged Locomotion",
"Clustering Algorithms",
"Crowd Dynamics",
"Pedestrian Detection And Tracking",
"Pedestrian Groups"
],
"authors": [
{
"givenName": "R. T.",
"surname": "Collins",
"fullName": "R. T. Collins",
"affiliation": "Dept. of Comput. Sci. & Eng., Penn State Univ., University Park, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Weina Ge",
"fullName": "Weina Ge",
"affiliation": "Comput. Vision Lab., GE Global Res., Niskayuna, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R. B.",
"surname": "Ruback",
"fullName": "R. B. Ruback",
"affiliation": "Dept. of Sociology, Penn State Univ., University Park, PA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2012-05-01 00:00:00",
"pubType": "trans",
"pages": "1003-1016",
"year": "2012",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iscid/2008/3311/2/3311b157",
"title": "Data-Driven Macroscopic Crowd Animation Synthesis Method using Velocity Fields",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2008/3311b157/12OmNBBQZmt",
"parentPublication": {
"id": "proceedings/iscid/2008/3311/2",
"title": "2008 International Symposium on Computational Intelligence and Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2011/0844/0/06027326",
"title": "Automatic detection of dangerous motion behavior in human crowds",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2011/06027326/12OmNBtl1Ep",
"parentPublication": {
"id": "proceedings/avss/2011/0844/0",
"title": "2011 8th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031b478",
"title": "Pedestrian Tracking Using Particle Filter Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031b478/12OmNvjgWzO",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ams/2009/3648/0/3648a520",
"title": "Modeling Groups of Pedestrians in Least Effort Crowd Movements Using Cellular Automata",
"doi": null,
"abstractUrl": "/proceedings-article/ams/2009/3648a520/12OmNwp74us",
"parentPublication": {
"id": "proceedings/ams/2009/3648/0",
"title": "Asia International Conference on Modelling & Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2009/3883/0/3883a836",
"title": "A Simulation Based on Emotions Model for Virtual Human Crowds",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2009/3883a836/12OmNxiKrWA",
"parentPublication": {
"id": "proceedings/icig/2009/3883/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2015/6964/0/07298971",
"title": "Understanding pedestrian behaviors from stationary crowd groups",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2015/07298971/12OmNyugyWw",
"parentPublication": {
"id": "proceedings/cvpr/2015/6964/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a275",
"title": "A Local Behavior Model for Small Pedestrian Groups",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a275/12OmNzC5SEo",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uksim/2010/4016/0/4016a428",
"title": "Simulating Crowd Movements Using Fine Grid Cellular Automata",
"doi": null,
"abstractUrl": "/proceedings-article/uksim/2010/4016a428/12OmNzDNtsS",
"parentPublication": {
"id": "proceedings/uksim/2010/4016/0",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/363O3A04",
"title": "Understanding collective crowd behaviors: Learning a Mixture model of Dynamic pedestrian-Agents",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/363O3A04/12OmNzayNgD",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ams/2008/3136/0/3136a654",
"title": "Multi-Agent Simulation of Circular Pedestrian Movements Using Cellular Automata",
"doi": null,
"abstractUrl": "/proceedings-article/ams/2008/3136a654/12OmNzhELji",
"parentPublication": {
"id": "proceedings/ams/2008/3136/0",
"title": "Asia International Conference on Modelling & Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2012050918",
"articleId": "13rRUxDqS5e",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06035718",
"articleId": "13rRUwbs1TH",
"__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": "13rRUyY28YB",
"doi": "10.1109/TVCG.2015.2391862",
"abstract": "When avoiding a group, a walker has two possibilities: either he goes through it or around it. Going through very dense groups or around huge ones would not seem natural and could break any sense of presence in a virtual environment. This paper aims to enable crowd simulators to handle such situations correctly. To this end, we need to understand how real humans decide to go through or around groups. As a first hypothesis, we apply the Principle of Minimum Energy (PME) on different group sizes and density. According to this principle, a walker should go around small and dense groups whereas he should go through large and sparse groups. Such principle has already been used for crowd simulation; the novelty here is to apply it to decide on a global avoidance strategy instead of local adaptations only. Our study quantifies decision thresholds. However, PME leaves some inconclusive situations for which the two solutions paths have similar energetic costs. In a second part, we propose an experiment to corroborate PME decisions thresholds with real observations. As controlling the factors of an experiment with many people is extremely hard, we propose to use Virtual Reality as a new method to observe human behavior. This work represents the first crowd simulation algorithm component directly designed from a VR-based study. We also consider the role of secondary factors in inconclusive situations. We show the influence of the group appearance and direction of relative motion in the decision process. Finally, we draw some guidelines to integrate our conclusions to existing crowd simulators and show an example of such integration. We evaluate the achieved improvements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "When avoiding a group, a walker has two possibilities: either he goes through it or around it. Going through very dense groups or around huge ones would not seem natural and could break any sense of presence in a virtual environment. This paper aims to enable crowd simulators to handle such situations correctly. To this end, we need to understand how real humans decide to go through or around groups. As a first hypothesis, we apply the Principle of Minimum Energy (PME) on different group sizes and density. According to this principle, a walker should go around small and dense groups whereas he should go through large and sparse groups. Such principle has already been used for crowd simulation; the novelty here is to apply it to decide on a global avoidance strategy instead of local adaptations only. Our study quantifies decision thresholds. However, PME leaves some inconclusive situations for which the two solutions paths have similar energetic costs. In a second part, we propose an experiment to corroborate PME decisions thresholds with real observations. As controlling the factors of an experiment with many people is extremely hard, we propose to use Virtual Reality as a new method to observe human behavior. This work represents the first crowd simulation algorithm component directly designed from a VR-based study. We also consider the role of secondary factors in inconclusive situations. We show the influence of the group appearance and direction of relative motion in the decision process. Finally, we draw some guidelines to integrate our conclusions to existing crowd simulators and show an example of such integration. We evaluate the achieved improvements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "When avoiding a group, a walker has two possibilities: either he goes through it or around it. Going through very dense groups or around huge ones would not seem natural and could break any sense of presence in a virtual environment. This paper aims to enable crowd simulators to handle such situations correctly. To this end, we need to understand how real humans decide to go through or around groups. As a first hypothesis, we apply the Principle of Minimum Energy (PME) on different group sizes and density. According to this principle, a walker should go around small and dense groups whereas he should go through large and sparse groups. Such principle has already been used for crowd simulation; the novelty here is to apply it to decide on a global avoidance strategy instead of local adaptations only. Our study quantifies decision thresholds. However, PME leaves some inconclusive situations for which the two solutions paths have similar energetic costs. In a second part, we propose an experiment to corroborate PME decisions thresholds with real observations. As controlling the factors of an experiment with many people is extremely hard, we propose to use Virtual Reality as a new method to observe human behavior. This work represents the first crowd simulation algorithm component directly designed from a VR-based study. We also consider the role of secondary factors in inconclusive situations. We show the influence of the group appearance and direction of relative motion in the decision process. Finally, we draw some guidelines to integrate our conclusions to existing crowd simulators and show an example of such integration. We evaluate the achieved improvements.",
"title": "Going Through, Going Around: A Study on Individual Avoidance of Groups",
"normalizedTitle": "Going Through, Going Around: A Study on Individual Avoidance of Groups",
"fno": "07014249",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Animation",
"Decision Making",
"Virtual Reality",
"Individual Avoidance Strategy",
"Crowd Simulation Algorithm",
"Principle Of Minimum Energy",
"PME Decision Threshold",
"Virtual Reality",
"VR",
"Trajectory",
"Virtual Environments",
"Solid Modeling",
"Collision Avoidance",
"Algorithm Design And Analysis",
"Biological System Modeling",
"Crowd Simulation",
"Interaction",
"Perception",
"Action",
"Groups",
"Virtual Reality"
],
"authors": [
{
"givenName": "Julien",
"surname": "Bruneau",
"fullName": "Julien Bruneau",
"affiliation": "INRIA Rennes, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anne-Hélène",
"surname": "Olivier",
"fullName": "Anne-Hélène Olivier",
"affiliation": "INRIA Rennes, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Pettré",
"fullName": "Julien Pettré",
"affiliation": "INRIA Rennes, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2015-04-01 00:00:00",
"pubType": "trans",
"pages": "520-528",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2014/4761/0/06890138",
"title": "Profiling stationary crowd groups",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2014/06890138/12OmNAmVH8b",
"parentPublication": {
"id": "proceedings/icme/2014/4761/0",
"title": "2014 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2014/4677/0/4677a077",
"title": "Minimizing Collision among Social Groups in Wide-Open Spaces",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2014/4677a077/12OmNAsBFMG",
"parentPublication": {
"id": "proceedings/cw/2014/4677/0",
"title": "2014 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/cadgraphics/2011/4497/0/4497a275",
"title": "A Local Behavior Model for Small Pedestrian Groups",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a275/12OmNzC5SEo",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446180",
"title": "Effect of Virtual Human Gaze Behaviour During an Orthogonal Collision Avoidance Walking Task",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446180/13bd1sv5NyE",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/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/2018/07/07946183",
"title": "Walking with Virtual People: Evaluation of Locomotion Interfaces in Dynamic Environments",
"doi": null,
"abstractUrl": "/journal/tg/2018/07/07946183/13rRUEgs2C2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/07/07955099",
"title": "Collision Avoidance Behavior between Walkers: Global and Local Motion Cues",
"doi": null,
"abstractUrl": "/journal/tg/2018/07/07955099/13rRUxcbnHk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/11/ttg2013111935",
"title": "Video-Based Crowd Synthesis",
"doi": null,
"abstractUrl": "/journal/tg/2013/11/ttg2013111935/13rRUy2YLYv",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089637",
"title": "Eye-Gaze Activity in Crowds: Impact of Virtual Reality and Density",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089637/1jIx9WIWd5C",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07014272",
"articleId": "13rRUwIF6l8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07014255",
"articleId": "13rRUwdIOUP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesUi",
"name": "ttg201504-07014249s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201504-07014249s1.zip",
"extension": "zip",
"size": "51.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxWuinf",
"title": "May",
"year": "2012",
"issueNum": "05",
"idPrefix": "tc",
"pubType": "journal",
"volume": "61",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgarsb",
"doi": "10.1109/TC.2011.78",
"abstract": "This paper describes a new method to speed up {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_p-arithmetic in hardware for pairing-friendly curves, such as the well-known Barreto-Naehrig (BN) curves. We explore the characteristics of the modulus defined by these curves and choose curve parameters such that {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_p multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a polynomial ring combined with a coefficient reduction phase using a pseudo-Mersenne number. As an application, we show that the performance of pairings on BN curves in hardware can be significantly improved, resulting in a factor 2.5 speedup compared with state-of-the-art hardware implementations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper describes a new method to speed up {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_p-arithmetic in hardware for pairing-friendly curves, such as the well-known Barreto-Naehrig (BN) curves. We explore the characteristics of the modulus defined by these curves and choose curve parameters such that {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_p multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a polynomial ring combined with a coefficient reduction phase using a pseudo-Mersenne number. As an application, we show that the performance of pairings on BN curves in hardware can be significantly improved, resulting in a factor 2.5 speedup compared with state-of-the-art hardware implementations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper describes a new method to speed up {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_p-arithmetic in hardware for pairing-friendly curves, such as the well-known Barreto-Naehrig (BN) curves. We explore the characteristics of the modulus defined by these curves and choose curve parameters such that {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_p multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a polynomial ring combined with a coefficient reduction phase using a pseudo-Mersenne number. As an application, we show that the performance of pairings on BN curves in hardware can be significantly improved, resulting in a factor 2.5 speedup compared with state-of-the-art hardware implementations.",
"title": "Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves",
"normalizedTitle": "Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves",
"fno": "ttc2012050676",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Pairing Friendly Curves",
"Modular Reduction"
],
"authors": [
{
"givenName": "Junfeng",
"surname": "Fan",
"fullName": "Junfeng Fan",
"affiliation": "Katholieke Universiteit Leuven and IBBT, ESAT/SCD-COSIC, Leuven-Heverlee",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Frederik",
"surname": "Vercauteren",
"fullName": "Frederik Vercauteren",
"affiliation": "Katholieke Universiteit Leuven and IBBT, ESAT/SCD-COSIC, Leuven-Heverlee",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ingrid",
"surname": "Verbauwhede",
"fullName": "Ingrid Verbauwhede",
"affiliation": "Katholieke Universiteit Leuven and IBBT, ESAT/SCD-COSIC, Leuven-Heverlee",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2012-05-01 00:00:00",
"pubType": "trans",
"pages": "676-685",
"year": "2012",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/imis/2011/4372/0/4372a603",
"title": "A Multiplicative Extension for Discrete Logarithms on Ordinary Pairing-Friendly Curves of Embedding Degree",
"doi": null,
"abstractUrl": "/proceedings-article/imis/2011/4372a603/12OmNBOllkR",
"parentPublication": {
"id": "proceedings/imis/2011/4372/0",
"title": "Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2010/4167/0/4167a552",
"title": "Accelerating Cross Twisted Ate Pairing with Ordinary Pairing Friendly Curve of Composite Order That Has Two Large Prime Factors",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2010/4167a552/12OmNCzKlLv",
"parentPublication": {
"id": "proceedings/nbis/2010/4167/0",
"title": "2010 13th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicis/2011/1561/0/06063228",
"title": "Constructing Pairing-friendly Elliptic Curves with Small rho",
"doi": null,
"abstractUrl": "/proceedings-article/icicis/2011/06063228/12OmNqBbHCg",
"parentPublication": {
"id": "proceedings/icicis/2011/1561/0",
"title": "2011 International Conference on Internet Computing and Information Services (ICICIS 2011)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2011/4337/0/4337a090",
"title": "Experimantal Analysis of Cheon's Algorithm Against Pairing-Friendly Curves",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2011/4337a090/12OmNqC2v0k",
"parentPublication": {
"id": "proceedings/aina/2011/4337/0",
"title": "2011 IEEE International Conference on Advanced Information Networking and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candar/2015/9797/0/9797a477",
"title": "Constructing Pairing-Friendly Elliptic Curves Using Global Number Fields",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2015/9797a477/12OmNvJXeDT",
"parentPublication": {
"id": "proceedings/candar/2015/9797/0",
"title": "2015 Third International Symposium on Computing and Networking (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2010/4297/0/4297a390",
"title": "Some New Optimal Pairings",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a390/12OmNvjgWTD",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2010/4324/0/4324a065",
"title": "An x-Coordinate Point Compression Method for Elliptic Curves over Fp",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2010/4324a065/12OmNxH9X98",
"parentPublication": {
"id": "proceedings/synasc/2010/4324/0",
"title": "2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/07/ttp2011071415",
"title": "Shape Analysis of Elastic Curves in Euclidean Spaces",
"doi": null,
"abstractUrl": "/journal/tp/2011/07/ttp2011071415/13rRUEgs2us",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2009/10/ttc2009101411",
"title": "Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields",
"doi": null,
"abstractUrl": "/journal/tc/2009/10/ttc2009101411/13rRUNvgzhT",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2006/09/t1167",
"title": "Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation",
"doi": null,
"abstractUrl": "/journal/tc/2006/09/t1167/13rRUytF40T",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttc2012050738",
"articleId": "13rRUxASuoV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttc2012050686",
"articleId": "13rRUxZzAgS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCfAPy8",
"title": "July",
"year": "2011",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2ur",
"doi": "10.1109/TPAMI.2010.219",
"abstract": "Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^2 and {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^3. This paper studies affine registration in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^m with m typically ranging from 4 to 12. To justify breaking of this dimension barrier, the first part of the paper describes three novel matching problems that can be formulated and solved as affine point-set registration problems in dimensions greater than three: stereo correspondence under motion, image set matching, and covariant point-set matching, problems that are not only interesting in their own right but also have potential for important vision applications. Unfortunately, most of the existing affine registration algorithms do not generalize easily to higher dimensions due to their inefficiency. Therefore, the second part of this paper develops a novel algorithm for estimating the affine transform between two point sets in {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^m. Specifically, the algorithm follows the common approach of iteratively solving the correspondences and transform. The initial correspondences are determined using the novel notion of local spectral features, features constructed from local distance matrices. Unlike many correspondence-based methods, the proposed algorithm is capable of registering point sets of different size, and the use of local features provides some degree of robustness against noise and outliers. The proposed algorithm is validated on a variety of synthetic point sets in different dimensions with varying degrees of deformation and noise, and the paper also shows experimentally that several instances of the aforementioned three matching problems can indeed be solved satisfactorily using the proposed affine registration algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^2 and {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^3. This paper studies affine registration in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^m with m typically ranging from 4 to 12. To justify breaking of this dimension barrier, the first part of the paper describes three novel matching problems that can be formulated and solved as affine point-set registration problems in dimensions greater than three: stereo correspondence under motion, image set matching, and covariant point-set matching, problems that are not only interesting in their own right but also have potential for important vision applications. Unfortunately, most of the existing affine registration algorithms do not generalize easily to higher dimensions due to their inefficiency. Therefore, the second part of this paper develops a novel algorithm for estimating the affine transform between two point sets in {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^m. Specifically, the algorithm follows the common approach of iteratively solving the correspondences and transform. The initial correspondences are determined using the novel notion of local spectral features, features constructed from local distance matrices. Unlike many correspondence-based methods, the proposed algorithm is capable of registering point sets of different size, and the use of local features provides some degree of robustness against noise and outliers. The proposed algorithm is validated on a variety of synthetic point sets in different dimensions with varying degrees of deformation and noise, and the paper also shows experimentally that several instances of the aforementioned three matching problems can indeed be solved satisfactorily using the proposed affine registration algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^2 and {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^3. This paper studies affine registration in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^m with m typically ranging from 4 to 12. To justify breaking of this dimension barrier, the first part of the paper describes three novel matching problems that can be formulated and solved as affine point-set registration problems in dimensions greater than three: stereo correspondence under motion, image set matching, and covariant point-set matching, problems that are not only interesting in their own right but also have potential for important vision applications. Unfortunately, most of the existing affine registration algorithms do not generalize easily to higher dimensions due to their inefficiency. Therefore, the second part of this paper develops a novel algorithm for estimating the affine transform between two point sets in {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^m. Specifically, the algorithm follows the common approach of iteratively solving the correspondences and transform. The initial correspondences are determined using the novel notion of local spectral features, features constructed from local distance matrices. Unlike many correspondence-based methods, the proposed algorithm is capable of registering point sets of different size, and the use of local features provides some degree of robustness against noise and outliers. The proposed algorithm is validated on a variety of synthetic point sets in different dimensions with varying degrees of deformation and noise, and the paper also shows experimentally that several instances of the aforementioned three matching problems can indeed be solved satisfactorily using the proposed affine registration algorithm.",
"title": "Higher-Dimensional Affine Registration and Vision Applications",
"normalizedTitle": "Higher-Dimensional Affine Registration and Vision Applications",
"fno": "ttp2011071324",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Affine Registration",
"Point Matching",
"Stereo Correspondence"
],
"authors": [
{
"givenName": "S.M.",
"surname": "Shahed Nejhum",
"fullName": "S.M. Shahed Nejhum",
"affiliation": "University of Florida, Gainesville",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu-Tseh",
"surname": "Chi",
"fullName": "Yu-Tseh Chi",
"affiliation": "University of Florida, Gainesville",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey",
"surname": "Ho",
"fullName": "Jeffrey Ho",
"affiliation": "University of Florida, Gainesville",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ming-Hsuan",
"surname": "Yang",
"fullName": "Ming-Hsuan Yang",
"affiliation": "University of California at Merced, Merced",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2011-07-01 00:00:00",
"pubType": "trans",
"pages": "1324-1338",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2012/05/ttc2012050676",
"title": "Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves",
"doi": null,
"abstractUrl": "/journal/tc/2012/05/ttc2012050676/13rRUEgarsb",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2013/07/ttc2013071467",
"title": "Multiway Splitting Method for Toeplitz Matrix Vector Product",
"doi": null,
"abstractUrl": "/journal/tc/2013/07/ttc2013071467/13rRUIM2VB8",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2004/08/l0687",
"title": "Finding r-Dominating Sets and p-Centers of Trees in Parallel",
"doi": null,
"abstractUrl": "/journal/td/2004/08/l0687/13rRUIM2VBg",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030407",
"title": "Streamline Embedding for 3D Vector Field Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030407/13rRUwInvsM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2006/08/t0929",
"title": "Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation",
"doi": null,
"abstractUrl": "/journal/tc/2006/08/t0929/13rRUy3xY7m",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/02/ttp2010020304",
"title": "Linear Sequence-to-Sequence Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2010/02/ttp2010020304/13rRUy3xY9c",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0231",
"title": "Artifacts Caused by Simplicial Subdivision",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0231/13rRUyYSWsI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/02/v0097",
"title": "A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids",
"doi": null,
"abstractUrl": "/journal/tg/2001/02/v0097/13rRUyft7CX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2006/08/t0974",
"title": "Software Multiplication Using Gaussian Normal Bases",
"doi": null,
"abstractUrl": "/journal/tc/2006/08/t0974/13rRUygBwdS",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/07/ttp2010071227",
"title": "Spectral Symmetry Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2010/07/ttp2010071227/13rRUygT7gu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011071310",
"articleId": "13rRUyfbwrZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011071339",
"articleId": "13rRUB6Sq1A",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwNwzN9",
"title": "July",
"year": "2013",
"issueNum": "07",
"idPrefix": "tc",
"pubType": "journal",
"volume": "62",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VB8",
"doi": "10.1109/TC.2012.95",
"abstract": "Computing the product of a Toeplitz matrix and a vector arises in various applications including cryptography. In this paper, we consider Toeplitz matrices and vectors with entries in Z_$({\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_2)$_Z. For improved efficiency in such computations, large Toeplitz matrices and vectors are recursively split and special formulas with subquadratic arithmetic complexity are applied. To this end, we first present a formula for the five-way splitting and then provide a generalization for the Z_$(k)$_Z-way splitting, where Z_$(k)$_Z is an arbitrary integer. These formulas can be used to compute a Toeplitz matrix-vector product (TMVP) of size Z_$(n)$_Z with an arithmetic complexity of Z_$(O(n^{\\log_k(k(k+1)/2)}))$_Z.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computing the product of a Toeplitz matrix and a vector arises in various applications including cryptography. In this paper, we consider Toeplitz matrices and vectors with entries in $({\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_2)$. For improved efficiency in such computations, large Toeplitz matrices and vectors are recursively split and special formulas with subquadratic arithmetic complexity are applied. To this end, we first present a formula for the five-way splitting and then provide a generalization for the $(k)$-way splitting, where $(k)$ is an arbitrary integer. These formulas can be used to compute a Toeplitz matrix-vector product (TMVP) of size $(n)$ with an arithmetic complexity of $(O(n^{\\log_k(k(k+1)/2)}))$.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computing the product of a Toeplitz matrix and a vector arises in various applications including cryptography. In this paper, we consider Toeplitz matrices and vectors with entries in -. For improved efficiency in such computations, large Toeplitz matrices and vectors are recursively split and special formulas with subquadratic arithmetic complexity are applied. To this end, we first present a formula for the five-way splitting and then provide a generalization for the --way splitting, where - is an arbitrary integer. These formulas can be used to compute a Toeplitz matrix-vector product (TMVP) of size - with an arithmetic complexity of -.",
"title": "Multiway Splitting Method for Toeplitz Matrix Vector Product",
"normalizedTitle": "Multiway Splitting Method for Toeplitz Matrix Vector Product",
"fno": "ttc2013071467",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Strontium",
"Vectors",
"Complexity Theory",
"Approximation Methods",
"Logic Gates",
"Delay",
"Indexes",
"Toeplitz Matrix Vector Product",
"Toeplitz Matrices",
"Computational Complexity",
"Cryptography",
"Recursive Estimation",
"TMVP",
"Multiway Splitting Method",
"Toeplitz Matrix Vector Product",
"Cryptography",
"Toeplitz Matrices",
"Recursively Split",
"Special Formulas",
"Subquadratic Arithmetic Complexity",
"Five Way Splitting",
"Arbitrary Integer",
"Strontium",
"Vectors",
"Complexity Theory",
"Approximation Methods",
"Logic Gates",
"Delay",
"Indexes",
"Subquadratic Complexity",
"Strontium",
"Vectors",
"Complexity Theory",
"Approximation Methods",
"Logic Gates",
"Delay",
"Indexes",
"Parallel Multiplier"
],
"authors": [
{
"givenName": "M.",
"surname": "Anwar Hasan",
"fullName": "M. Anwar Hasan",
"affiliation": "Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "C.",
"surname": "Negre",
"fullName": "C. Negre",
"affiliation": "Equipe DALI, Univ. de Perpignan, Perpignan, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2013-07-01 00:00:00",
"pubType": "trans",
"pages": "1467-1471",
"year": "2013",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sc/1990/2056/0/00130023",
"title": "Computation of large scale constrained matrix problems: the splitting equilibration algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1990/00130023/12OmNwKoZg3",
"parentPublication": {
"id": "proceedings/sc/1990/2056/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icgec/2011/4449/0/4449a232",
"title": "Speeding up Subquadratic Finite Field Multiplier over GF(2m) Generated by Trinomials Using Toeplitz Matrix-Vector with Inner Product Formula",
"doi": null,
"abstractUrl": "/proceedings-article/icgec/2011/4449a232/12OmNzEmFHO",
"parentPublication": {
"id": "proceedings/icgec/2011/4449/0",
"title": "Genetic and Evolutionary Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/arith/2009/3670/0/3670a067",
"title": "Subquadratic Space Complexity Multiplier for a Class of Binary Fields Using Toeplitz Matrix Approach",
"doi": null,
"abstractUrl": "/proceedings-article/arith/2009/3670a067/12OmNzVXNRx",
"parentPublication": {
"id": "proceedings/arith/2009/3670/0",
"title": "Computer Arithmetic, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2012/03/05713833",
"title": "Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials",
"doi": null,
"abstractUrl": "/journal/si/2012/03/05713833/13rRUwI5UiG",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1993/05/l0559",
"title": "Parallel Median Splitting and k-Splitting with Application to Merging and Sorting",
"doi": null,
"abstractUrl": "/journal/td/1993/05/l0559/13rRUwgQpqm",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2017/02/07575684",
"title": "Low-complexity digit-serial multiplier over GF(2m) based on efficient Toeplitz block Toeplitz matrix-vector product decomposition",
"doi": null,
"abstractUrl": "/journal/si/2017/02/07575684/13rRUwkxc3y",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2013/07/ttc2013071345",
"title": "Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products",
"doi": null,
"abstractUrl": "/journal/tc/2013/07/ttc2013071345/13rRUxDqS7E",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2012/02/ttc2012020151",
"title": "Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product",
"doi": null,
"abstractUrl": "/journal/tc/2012/02/ttc2012020151/13rRUygBw6v",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2016/01/07056429",
"title": "Comments on “Multiway Splitting Method for Toeplitz Matrix Vector Product”",
"doi": null,
"abstractUrl": "/journal/tc/2016/01/07056429/13rRUypp571",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2018/12/08359428",
"title": "Subquadratic Space Complexity Multiplier Using Even Type GNB Based on Efficient Toeplitz Matrix-Vector Product",
"doi": null,
"abstractUrl": "/journal/tc/2018/12/08359428/17D45WXIkH7",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttc2013071460",
"articleId": "13rRUytF411",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttc2013071472",
"articleId": "13rRUxASuFv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrIaeca",
"title": "August",
"year": "2004",
"issueNum": "08",
"idPrefix": "td",
"pubType": "journal",
"volume": "15",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VBg",
"doi": "10.1109/TPDS.2004.36",
"abstract": "Abstract—Let T=(V, E) be an edge-weighted tree with |V|=n vertices embedded in the Euclidean plane. Let {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}} denote the set of all points on the edges of T. Let X and Y be two subsets of {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}} and let r be a positive real number. A subset D\\subseteq X is an X/Y/r{\\hbox{-}}dominating set if every point in Y is within distance r of a point in D. The X/Y/r{\\hbox{-}}dominating set problem is to find an X/Y/r{\\hbox{-}}{\\rm{dominating}} set D^* with minimum cardinality. Let p\\ge 1 be an integer. The X/Y/p{\\hbox{-}}centerproblem is to find a subset C^*\\subseteq X of p points such that the maximum distance of any point in Y from C^* is minimized. Let X and Y be either V or {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}}. In this paper, efficient parallel algorithms on the EREW PRAM are first presented for the X/Y/r{\\hbox{-}}{\\rm{dominating}} set problem. The presented algorithms require O(\\log^2n) time for all cases of X and Y. Parallel algorithms on the EREW PRAM are then developed for the X/Y/p{\\hbox{-}}{\\rm{center}} problem. The presented algorithms require O(\\log^3n) time for all cases of X and Y. Previously, sequential algorithms for these two problems had been extensively studied in the literature. However, parallel solutions with polylogarithmic time existed only for their special cases. The algorithms presented in this paper are obtained by using an interesting approach which we call the dependency-tree approach. Our results are examples of parallelizing sequential dynamic-programming algorithms by using the approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Let T=(V, E) be an edge-weighted tree with |V|=n vertices embedded in the Euclidean plane. Let {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}} denote the set of all points on the edges of T. Let X and Y be two subsets of {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}} and let r be a positive real number. A subset D\\subseteq X is an X/Y/r{\\hbox{-}}dominating set if every point in Y is within distance r of a point in D. The X/Y/r{\\hbox{-}}dominating set problem is to find an X/Y/r{\\hbox{-}}{\\rm{dominating}} set D^* with minimum cardinality. Let p\\ge 1 be an integer. The X/Y/p{\\hbox{-}}centerproblem is to find a subset C^*\\subseteq X of p points such that the maximum distance of any point in Y from C^* is minimized. Let X and Y be either V or {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}}. In this paper, efficient parallel algorithms on the EREW PRAM are first presented for the X/Y/r{\\hbox{-}}{\\rm{dominating}} set problem. The presented algorithms require O(\\log^2n) time for all cases of X and Y. Parallel algorithms on the EREW PRAM are then developed for the X/Y/p{\\hbox{-}}{\\rm{center}} problem. The presented algorithms require O(\\log^3n) time for all cases of X and Y. Previously, sequential algorithms for these two problems had been extensively studied in the literature. However, parallel solutions with polylogarithmic time existed only for their special cases. The algorithms presented in this paper are obtained by using an interesting approach which we call the dependency-tree approach. Our results are examples of parallelizing sequential dynamic-programming algorithms by using the approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Let T=(V, E) be an edge-weighted tree with |V|=n vertices embedded in the Euclidean plane. Let {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}} denote the set of all points on the edges of T. Let X and Y be two subsets of {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}} and let r be a positive real number. A subset D\\subseteq X is an X/Y/r{\\hbox{-}}dominating set if every point in Y is within distance r of a point in D. The X/Y/r{\\hbox{-}}dominating set problem is to find an X/Y/r{\\hbox{-}}{\\rm{dominating}} set D^* with minimum cardinality. Let p\\ge 1 be an integer. The X/Y/p{\\hbox{-}}centerproblem is to find a subset C^*\\subseteq X of p points such that the maximum distance of any point in Y from C^* is minimized. Let X and Y be either V or {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{E}}}}. In this paper, efficient parallel algorithms on the EREW PRAM are first presented for the X/Y/r{\\hbox{-}}{\\rm{dominating}} set problem. The presented algorithms require O(\\log^2n) time for all cases of X and Y. Parallel algorithms on the EREW PRAM are then developed for the X/Y/p{\\hbox{-}}{\\rm{center}} problem. The presented algorithms require O(\\log^3n) time for all cases of X and Y. Previously, sequential algorithms for these two problems had been extensively studied in the literature. However, parallel solutions with polylogarithmic time existed only for their special cases. The algorithms presented in this paper are obtained by using an interesting approach which we call the dependency-tree approach. Our results are examples of parallelizing sequential dynamic-programming algorithms by using the approach.",
"title": "Finding r-Dominating Sets and p-Centers of Trees in Parallel",
"normalizedTitle": "Finding r-Dominating Sets and p-Centers of Trees in Parallel",
"fno": "l0687",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Trees",
"R Hbox Rm Dominating Sets",
"P Hbox Rm Centers",
"Network Location Theory",
"Parallel Algorithms",
"PRAM"
],
"authors": [
{
"givenName": "Biing-Feng",
"surname": "Wang",
"fullName": "Biing-Feng Wang",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2004-08-01 00:00:00",
"pubType": "trans",
"pages": "687-398",
"year": "2004",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpads/2002/1760/0/17600117",
"title": "Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2002/17600117/12OmNCga1TT",
"parentPublication": {
"id": "proceedings/icpads/2002/1760/0",
"title": "Proceedings of the Ninth International Conference on Parallel and Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2002/1477/0/14770092",
"title": "Zero-Error Source Coding with Maximum Distortion Criterion",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2002/14770092/12OmNxWuigW",
"parentPublication": {
"id": "proceedings/dcc/2002/1477/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccc/2000/0674/0/06740054",
"title": "The Query Complexity of Order-Finding",
"doi": null,
"abstractUrl": "/proceedings-article/ccc/2000/06740054/12OmNy2rRXv",
"parentPublication": {
"id": "proceedings/ccc/2000/0674/0",
"title": "Proceedings 15th Annual IEEE Conference on Computational Complexity",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsm/2001/1278/0/12780073",
"title": "Stability of image restoration by minimizing regularized objective functions",
"doi": null,
"abstractUrl": "/proceedings-article/vlsm/2001/12780073/12OmNyxXlxx",
"parentPublication": {
"id": "proceedings/vlsm/2001/1278/0",
"title": "Proceedings of 1st IEEE Workshop on Variational and Level Set Methods in Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584a115",
"title": "Optimality Conditions for Fractional Programming with B (p, r, a) Invex Functions",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584a115/12OmNz3bdMU",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2012/4799/0/4799b355",
"title": "On the T-graph of a Commutative Ring",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2012/4799b355/12OmNzlUKxv",
"parentPublication": {
"id": "proceedings/asonam/2012/4799/0",
"title": "2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2003/06/k1561",
"title": "Adaptive and Incremental Processing for Distance Join Queries",
"doi": null,
"abstractUrl": "/journal/tk/2003/06/k1561/13rRUEgarnZ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2006/08/t0929",
"title": "Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation",
"doi": null,
"abstractUrl": "/journal/tc/2006/08/t0929/13rRUy3xY7m",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2002/04/l0413",
"title": "Permutation-Based Range-Join Algorithms on N-Dimensional Meshes",
"doi": null,
"abstractUrl": "/journal/td/2002/04/l0413/13rRUyY294c",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "l0673",
"articleId": "13rRUwvBy8B",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "l0699",
"articleId": "13rRUzpzeAv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbb",
"title": "August",
"year": "2006",
"issueNum": "08",
"idPrefix": "tc",
"pubType": "journal",
"volume": "55",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3xY7m",
"doi": "10.1109/TC.2006.124",
"abstract": "A symbol permutation invariant balanced (SPI-balanced) code over the alphabet {\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}_m=\\{0,1,\\ldots,m-1\\} is a block code over {\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}_m such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason, every permutation among the symbols of the alphabet changes an SPI-balanced code into an SPI-balanced code. This means that SPI--balanced words are \"the most balanced” among all possible m{\\hbox{-}}\\rm ary balanced word types and this property makes them very attractive from the application perspective. In particular, they can be used to achieve m{\\hbox{-}}\\rm ary DC-free communication, to detect/correct asymmetric/unidirectional errors on the m{\\hbox{-}}\\rm ary asymmetric/unidirectional channel, to achieve delay-insensitive communication, to maintain data integrity in digital optical disks, and so on. This paper gives some efficient methods to convert (encode) m{\\hbox{-}}\\rm ary information sequences into m{\\hbox{-}}\\rm ary SPI-balanced codes whose redundancy is equal to roughly double the minimum possible redundancy r_{min}. It is proven that r_{min} \\simeq [(m-1)/2]\\log_{m}n-(1/2)[1-(1/\\log_{2\\pi}m)]m-(1/\\log_{2\\pi}m) for any code which converts k information digits into an SPI-balanced code of length n=k+r. For example, the first method given in the paper encodes k information digits into an SPI-balanced code of length n=k+r, with r=(m-1)\\log_{m}k+O(m\\log_{m}\\log_{m}k). A second method is a recursive method, which uses the first as base code and encodes k digits into an SPI-balanced code of length n=k+r, with r\\simeq(m-1)\\log_{m}n-\\log_{m}[(m-1)!].",
"abstracts": [
{
"abstractType": "Regular",
"content": "A symbol permutation invariant balanced (SPI-balanced) code over the alphabet {\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}_m=\\{0,1,\\ldots,m-1\\} is a block code over {\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}_m such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason, every permutation among the symbols of the alphabet changes an SPI-balanced code into an SPI-balanced code. This means that SPI--balanced words are \"the most balanced” among all possible m{\\hbox{-}}\\rm ary balanced word types and this property makes them very attractive from the application perspective. In particular, they can be used to achieve m{\\hbox{-}}\\rm ary DC-free communication, to detect/correct asymmetric/unidirectional errors on the m{\\hbox{-}}\\rm ary asymmetric/unidirectional channel, to achieve delay-insensitive communication, to maintain data integrity in digital optical disks, and so on. This paper gives some efficient methods to convert (encode) m{\\hbox{-}}\\rm ary information sequences into m{\\hbox{-}}\\rm ary SPI-balanced codes whose redundancy is equal to roughly double the minimum possible redundancy r_{min}. It is proven that r_{min} \\simeq [(m-1)/2]\\log_{m}n-(1/2)[1-(1/\\log_{2\\pi}m)]m-(1/\\log_{2\\pi}m) for any code which converts k information digits into an SPI-balanced code of length n=k+r. For example, the first method given in the paper encodes k information digits into an SPI-balanced code of length n=k+r, with r=(m-1)\\log_{m}k+O(m\\log_{m}\\log_{m}k). A second method is a recursive method, which uses the first as base code and encodes k digits into an SPI-balanced code of length n=k+r, with r\\simeq(m-1)\\log_{m}n-\\log_{m}[(m-1)!].",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A symbol permutation invariant balanced (SPI-balanced) code over the alphabet {\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}_m=\\{0,1,\\ldots,m-1\\} is a block code over {\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}_m such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason, every permutation among the symbols of the alphabet changes an SPI-balanced code into an SPI-balanced code. This means that SPI--balanced words are \"the most balanced” among all possible m{\\hbox{-}}\\rm ary balanced word types and this property makes them very attractive from the application perspective. In particular, they can be used to achieve m{\\hbox{-}}\\rm ary DC-free communication, to detect/correct asymmetric/unidirectional errors on the m{\\hbox{-}}\\rm ary asymmetric/unidirectional channel, to achieve delay-insensitive communication, to maintain data integrity in digital optical disks, and so on. This paper gives some efficient methods to convert (encode) m{\\hbox{-}}\\rm ary information sequences into m{\\hbox{-}}\\rm ary SPI-balanced codes whose redundancy is equal to roughly double the minimum possible redundancy r_{min}. It is proven that r_{min} \\simeq [(m-1)/2]\\log_{m}n-(1/2)[1-(1/\\log_{2\\pi}m)]m-(1/\\log_{2\\pi}m) for any code which converts k information digits into an SPI-balanced code of length n=k+r. For example, the first method given in the paper encodes k information digits into an SPI-balanced code of length n=k+r, with r=(m-1)\\log_{m}k+O(m\\log_{m}\\log_{m}k). A second method is a recursive method, which uses the first as base code and encodes k digits into an SPI-balanced code of length n=k+r, with r\\simeq(m-1)\\log_{m}n-\\log_{m}[(m-1)!].",
"title": "Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation",
"normalizedTitle": "Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation",
"fno": "t0929",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Coding And Information Theory",
"Error Control Codes",
"Balanced Codes",
"Constant Weight Codes",
"Digital Communication",
"M Hbox Rm Ary Communication",
"Line Codes",
"DC Free Communication",
"Delay Insensitive Communication"
],
"authors": [
{
"givenName": "Raffaele",
"surname": "Mascella",
"fullName": "Raffaele Mascella",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luca G.",
"surname": "Tallini",
"fullName": "Luca G. Tallini",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2006-08-01 00:00:00",
"pubType": "trans",
"pages": "929-946",
"year": "2006",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/1999/08/t0794",
"title": "Balanced Codes with Parallel Encoding and Decoding",
"doi": null,
"abstractUrl": "/journal/tc/1999/08/t0794/13rRUIM2VAR",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2005/05/k0678",
"title": "epsilon-SSVR: A Smooth Support Vector Machine for epsilon-Insensitive Regression",
"doi": null,
"abstractUrl": "/journal/tk/2005/05/k0678/13rRUwI5TXP",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2004/02/t0159",
"title": "A Class of M-Ary Asymmetric Symbol Error Correcting Codes for Data Entry Devices",
"doi": null,
"abstractUrl": "/journal/tc/2004/02/t0159/13rRUwh80tO",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2004/03/l0257",
"title": "Exploiting Global Knowledge to Achieve Self-Tuned Congestion Control for k-Ary n-Cube Networks",
"doi": null,
"abstractUrl": "/journal/td/2004/03/l0257/13rRUxBa5bt",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2002/04/l0413",
"title": "Permutation-Based Range-Join Algorithms on N-Dimensional Meshes",
"doi": null,
"abstractUrl": "/journal/td/2002/04/l0413/13rRUyY294c",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "t0947",
"articleId": "13rRUxOdD7u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBVrjqW",
"title": "March/April",
"year": "2006",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWsI",
"doi": "10.1109/TVCG.2006.22",
"abstract": "Abstract—We review schemes for dividing cubic cells into simplices (tetrahedra) for interpolating from sampled data to {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^3, present visual and geometric artifacts generated in isosurfaces and volume renderings, and discuss how these artifacts relate to the filter kernels corresponding to the subdivision schemes. ",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We review schemes for dividing cubic cells into simplices (tetrahedra) for interpolating from sampled data to {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^3, present visual and geometric artifacts generated in isosurfaces and volume renderings, and discuss how these artifacts relate to the filter kernels corresponding to the subdivision schemes. ",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We review schemes for dividing cubic cells into simplices (tetrahedra) for interpolating from sampled data to {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}^3, present visual and geometric artifacts generated in isosurfaces and volume renderings, and discuss how these artifacts relate to the filter kernels corresponding to the subdivision schemes. ",
"title": "Artifacts Caused by Simplicial Subdivision",
"normalizedTitle": "Artifacts Caused by Simplicial Subdivision",
"fno": "v0231",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Interpolation",
"Approximation Of Surfaces And Contours",
"Image Representation",
"Volumetric Representation",
"Visualization Techniques And Methodologies",
"Volume Visualization"
],
"authors": [
{
"givenName": "Hamish",
"surname": "Carr",
"fullName": "Hamish Carr",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Torsten",
"surname": "M?ller",
"fullName": "Torsten M?ller",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jack",
"surname": "Snoeyink",
"fullName": "Jack Snoeyink",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2006-03-01 00:00:00",
"pubType": "trans",
"pages": "231-242",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2001/7200/0/7200carr",
"title": "Simplicial Subdivisions and Sampling Artifacts",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200carr/12OmNvAiSIr",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsm/2001/1278/0/12780073",
"title": "Stability of image restoration by minimizing regularized objective functions",
"doi": null,
"abstractUrl": "/proceedings-article/vlsm/2001/12780073/12OmNyxXlxx",
"parentPublication": {
"id": "proceedings/vlsm/2001/1278/0",
"title": "Proceedings of 1st IEEE Workshop on Variational and Level Set Methods in Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2008/05/mcs2008050017",
"title": "nanoHUB.org: Advancing Education and Research in Nanotechnology",
"doi": null,
"abstractUrl": "/magazine/cs/2008/05/mcs2008050017/13rRUIJuxyX",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0219",
"articleId": "13rRUyYjK5b",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0243",
"articleId": "13rRUwInvAT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzFdtbV",
"title": "April-June",
"year": "2001",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "7",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyft7CX",
"doi": "10.1109/2945.928163",
"abstract": "Abstract—This paper presents an algorithm to trace discrete straight lines in regular grids of any dimension. Most known line tracing algorithms have been developed in Z_${\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}^{2}$_Z and Z_${\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}^{3}$_Z orthogonal grids. The contribution of this paper is the definition of a method to trace lines in nonorthogonal grids in any dimension. This method is not restricted to being used with a specific grid connectivity as other widespread methods are. Good performance can be achieved because only additions are used during line tracing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper presents an algorithm to trace discrete straight lines in regular grids of any dimension. Most known line tracing algorithms have been developed in ${\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}^{2}$ and ${\\hbox{\\rlap{Z}\\kern 2.0pt{\\hbox{Z}}}}^{3}$ orthogonal grids. The contribution of this paper is the definition of a method to trace lines in nonorthogonal grids in any dimension. This method is not restricted to being used with a specific grid connectivity as other widespread methods are. Good performance can be achieved because only additions are used during line tracing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper presents an algorithm to trace discrete straight lines in regular grids of any dimension. Most known line tracing algorithms have been developed in - and - orthogonal grids. The contribution of this paper is the definition of a method to trace lines in nonorthogonal grids in any dimension. This method is not restricted to being used with a specific grid connectivity as other widespread methods are. Good performance can be achieved because only additions are used during line tracing.",
"title": "A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids",
"normalizedTitle": "A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids",
"fno": "v0097",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Discrete Line Tracing",
"Digital Topology",
"Discrete Geometry"
],
"authors": [
{
"givenName": "Luis",
"surname": "Ibáñez",
"fullName": "Luis Ibáñez",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chafiaâ",
"surname": "Hamitouche",
"fullName": "Chafiaâ Hamitouche",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christian",
"surname": "Roux",
"fullName": "Christian Roux",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2001-04-01 00:00:00",
"pubType": "trans",
"pages": "97-108",
"year": "2001",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "v0109",
"articleId": "13rRUx0geff",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAtstbb",
"title": "August",
"year": "2006",
"issueNum": "08",
"idPrefix": "tc",
"pubType": "journal",
"volume": "55",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygBwdS",
"doi": "10.1109/TC.2006.132",
"abstract": "Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over binary fields {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_{2^m}. In this paper, we present new software algorithms for efficient multiplication over {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_{2^m} that use a Gaussian normal basis representation. Two approaches are presented, direct normal basis multiplication and a method that exploits a mapping to a ring where fast polynomial-based techniques can be employed. Our analysis, including experimental results on an Intel Pentium family processor, shows that the new algorithms are faster and can use memory more efficiently than previous methods. Despite significant improvements, we conclude that the penalty in multiplication is still sufficiently large to discourage the use of normal bases in software implementations of elliptic curve systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over binary fields {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_{2^m}. In this paper, we present new software algorithms for efficient multiplication over {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_{2^m} that use a Gaussian normal basis representation. Two approaches are presented, direct normal basis multiplication and a method that exploits a mapping to a ring where fast polynomial-based techniques can be employed. Our analysis, including experimental results on an Intel Pentium family processor, shows that the new algorithms are faster and can use memory more efficiently than previous methods. Despite significant improvements, we conclude that the penalty in multiplication is still sufficiently large to discourage the use of normal bases in software implementations of elliptic curve systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over binary fields {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_{2^m}. In this paper, we present new software algorithms for efficient multiplication over {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{F}}}}_{2^m} that use a Gaussian normal basis representation. Two approaches are presented, direct normal basis multiplication and a method that exploits a mapping to a ring where fast polynomial-based techniques can be employed. Our analysis, including experimental results on an Intel Pentium family processor, shows that the new algorithms are faster and can use memory more efficiently than previous methods. Despite significant improvements, we conclude that the penalty in multiplication is still sufficiently large to discourage the use of normal bases in software implementations of elliptic curve systems.",
"title": "Software Multiplication Using Gaussian Normal Bases",
"normalizedTitle": "Software Multiplication Using Gaussian Normal Bases",
"fno": "t0974",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Multiplication In Hbox Rlap I Kern 2 0 Pt Hbox F 2 M",
"Gaussian Normal Basis",
"Elliptic Curve Cryptography"
],
"authors": [
{
"givenName": "Ricardo",
"surname": "Dahab",
"fullName": "Ricardo Dahab",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Darrel",
"surname": "Hankerson",
"fullName": "Darrel Hankerson",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fei",
"surname": "Hu",
"fullName": "Fei Hu",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Men",
"surname": "Long",
"fullName": "Men Long",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julio",
"surname": "L?pez",
"fullName": "Julio L?pez",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alfred",
"surname": "Menezes",
"fullName": "Alfred Menezes",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2006-08-01 00:00:00",
"pubType": "trans",
"pages": "974-984",
"year": "2006",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tc/2012/05/ttc2012050676",
"title": "Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves",
"doi": null,
"abstractUrl": "/journal/tc/2012/05/ttc2012050676/13rRUEgarsb",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/07/ttp2011071324",
"title": "Higher-Dimensional Affine Registration and Vision Applications",
"doi": null,
"abstractUrl": "/journal/tp/2011/07/ttp2011071324/13rRUEgs2ur",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2004/08/l0687",
"title": "Finding r-Dominating Sets and p-Centers of Trees in Parallel",
"doi": null,
"abstractUrl": "/journal/td/2004/08/l0687/13rRUIM2VBg",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2009/10/ttc2009101411",
"title": "Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields",
"doi": null,
"abstractUrl": "/journal/tc/2009/10/ttc2009101411/13rRUNvgzhT",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030407",
"title": "Streamline Embedding for 3D Vector Field Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030407/13rRUwInvsM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2006/01/t0034",
"title": "Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases",
"doi": null,
"abstractUrl": "/journal/tc/2006/01/t0034/13rRUwhHcQc",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2006/08/t0929",
"title": "Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation",
"doi": null,
"abstractUrl": "/journal/tc/2006/08/t0929/13rRUy3xY7m",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0231",
"title": "Artifacts Caused by Simplicial Subdivision",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0231/13rRUyYSWsI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/02/v0097",
"title": "A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids",
"doi": null,
"abstractUrl": "/journal/tg/2001/02/v0097/13rRUyft7CX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/07/ttp2010071227",
"title": "Spectral Symmetry Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2010/07/ttp2010071227/13rRUygT7gu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "t0962",
"articleId": "13rRUxNW1YB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "t0985",
"articleId": "13rRUwbs2fI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgJw",
"title": "July",
"year": "2010",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "32",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7gu",
"doi": "10.1109/TPAMI.2009.121",
"abstract": "We present a spectral approach for detecting and analyzing rotational and reflectional symmetries in n-dimensions. Our main contribution is the derivation of a symmetry detection and analysis scheme for sets of points in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^{n} and its extension to image analysis by way of local features. Each object is represented by a set of points S\\in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^{n}, where the symmetry is manifested by the multiple self-alignments of S. The alignment problem is formulated as a quadratic binary optimization problem, with an efficient solution via spectral relaxation. For symmetric objects, this results in a multiplicity of eigenvalues whose corresponding eigenvectors allow the detection and analysis of both types of symmetry. We improve the scheme's robustness by incorporating geometrical constraints into the spectral analysis. Our approach is experimentally verified by applying it to 2D and 3D synthetic objects as well as real images.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a spectral approach for detecting and analyzing rotational and reflectional symmetries in n-dimensions. Our main contribution is the derivation of a symmetry detection and analysis scheme for sets of points in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^{n} and its extension to image analysis by way of local features. Each object is represented by a set of points S\\in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^{n}, where the symmetry is manifested by the multiple self-alignments of S. The alignment problem is formulated as a quadratic binary optimization problem, with an efficient solution via spectral relaxation. For symmetric objects, this results in a multiplicity of eigenvalues whose corresponding eigenvectors allow the detection and analysis of both types of symmetry. We improve the scheme's robustness by incorporating geometrical constraints into the spectral analysis. Our approach is experimentally verified by applying it to 2D and 3D synthetic objects as well as real images.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a spectral approach for detecting and analyzing rotational and reflectional symmetries in n-dimensions. Our main contribution is the derivation of a symmetry detection and analysis scheme for sets of points in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^{n} and its extension to image analysis by way of local features. Each object is represented by a set of points S\\in {{\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}}^{n}, where the symmetry is manifested by the multiple self-alignments of S. The alignment problem is formulated as a quadratic binary optimization problem, with an efficient solution via spectral relaxation. For symmetric objects, this results in a multiplicity of eigenvalues whose corresponding eigenvectors allow the detection and analysis of both types of symmetry. We improve the scheme's robustness by incorporating geometrical constraints into the spectral analysis. Our approach is experimentally verified by applying it to 2D and 3D synthetic objects as well as real images.",
"title": "Spectral Symmetry Analysis",
"normalizedTitle": "Spectral Symmetry Analysis",
"fno": "ttp2010071227",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computer Vision",
"Symmetry Detection",
"Optimization",
"Spectral Relaxation"
],
"authors": [
{
"givenName": "Michael",
"surname": "Chertok",
"fullName": "Michael Chertok",
"affiliation": "Bar-Ilan University, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yosi",
"surname": "Keller",
"fullName": "Yosi Keller",
"affiliation": "Bar-Ilan University, Israel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2010-07-01 00:00:00",
"pubType": "trans",
"pages": "1227-1238",
"year": "2010",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vlsm/2001/1278/0/12780073",
"title": "Stability of image restoration by minimizing regularized objective functions",
"doi": null,
"abstractUrl": "/proceedings-article/vlsm/2001/12780073/12OmNyxXlxx",
"parentPublication": {
"id": "proceedings/vlsm/2001/1278/0",
"title": "Proceedings of 1st IEEE Workshop on Variational and Level Set Methods in Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2012/05/ttc2012050676",
"title": "Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves",
"doi": null,
"abstractUrl": "/journal/tc/2012/05/ttc2012050676/13rRUEgarsb",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/07/ttp2011071324",
"title": "Higher-Dimensional Affine Registration and Vision Applications",
"doi": null,
"abstractUrl": "/journal/tp/2011/07/ttp2011071324/13rRUEgs2ur",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2004/08/l0687",
"title": "Finding r-Dominating Sets and p-Centers of Trees in Parallel",
"doi": null,
"abstractUrl": "/journal/td/2004/08/l0687/13rRUIM2VBg",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030407",
"title": "Streamline Embedding for 3D Vector Field Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030407/13rRUwInvsM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/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/tc/2006/08/t0929",
"title": "Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation",
"doi": null,
"abstractUrl": "/journal/tc/2006/08/t0929/13rRUy3xY7m",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0231",
"title": "Artifacts Caused by Simplicial Subdivision",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0231/13rRUyYSWsI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/02/v0097",
"title": "A Vectorial Algorithm for Tracing Discrete Straight Lines in N-Dimensional Generalized Grids",
"doi": null,
"abstractUrl": "/journal/tg/2001/02/v0097/13rRUyft7CX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2006/08/t0974",
"title": "Software Multiplication Using Gaussian Normal Bases",
"doi": null,
"abstractUrl": "/journal/tc/2006/08/t0974/13rRUygBwdS",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2010071211",
"articleId": "13rRUxDqS5c",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2010071239",
"articleId": "13rRUyogGBj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRYN",
"name": "ttp2010071227s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp2010071227s.pdf",
"extension": "pdf",
"size": "16.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqIhFTk",
"title": "September/October",
"year": "2005",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "25",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB6Sq2N",
"doi": "10.1109/MCG.2005.106",
"abstract": "Procedural encoding of scattered and unstructured scalar datasets using radial basis functions (RBFs) is an active area of research with great potential for compactly representing large data sets. This reduced storage requirement lets the compressed data sets completely reside in the local memory of the graphics card, enabling accurate and efficient processing and visualization without data transfer problems. The article presents a new hierarchical technique that effectively encodes data on arbitrary grids including volumetric scalar, vector, and multifield data. Once the RBF representation is transferred to texture memory, GPU-based visualization using particle advection, cutting planes, isosurfaces, and volume rendering can be performed by functional reconstruction of the encoded data in the fragment pipeline. By eliminating the need for storing and processing mesh information, this approach is particularly attractive for large scattered and irregular structured data sets, as well as data sets created by the emerging field of meshless simulation techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Procedural encoding of scattered and unstructured scalar datasets using radial basis functions (RBFs) is an active area of research with great potential for compactly representing large data sets. This reduced storage requirement lets the compressed data sets completely reside in the local memory of the graphics card, enabling accurate and efficient processing and visualization without data transfer problems. The article presents a new hierarchical technique that effectively encodes data on arbitrary grids including volumetric scalar, vector, and multifield data. Once the RBF representation is transferred to texture memory, GPU-based visualization using particle advection, cutting planes, isosurfaces, and volume rendering can be performed by functional reconstruction of the encoded data in the fragment pipeline. By eliminating the need for storing and processing mesh information, this approach is particularly attractive for large scattered and irregular structured data sets, as well as data sets created by the emerging field of meshless simulation techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Procedural encoding of scattered and unstructured scalar datasets using radial basis functions (RBFs) is an active area of research with great potential for compactly representing large data sets. This reduced storage requirement lets the compressed data sets completely reside in the local memory of the graphics card, enabling accurate and efficient processing and visualization without data transfer problems. The article presents a new hierarchical technique that effectively encodes data on arbitrary grids including volumetric scalar, vector, and multifield data. Once the RBF representation is transferred to texture memory, GPU-based visualization using particle advection, cutting planes, isosurfaces, and volume rendering can be performed by functional reconstruction of the encoded data in the fragment pipeline. By eliminating the need for storing and processing mesh information, this approach is particularly attractive for large scattered and irregular structured data sets, as well as data sets created by the emerging field of meshless simulation techniques.",
"title": "Hardware-Assisted Feature Analysis and Visualization of Procedurally Encoded Multifield Volumetric Data",
"normalizedTitle": "Hardware-Assisted Feature Analysis and Visualization of Procedurally Encoded Multifield Volumetric Data",
"fno": "mcg2005050072",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Procedural Encoding",
"Volume Rendering",
"Meshless Representation",
"Feature Detection",
"Radial Basis Functions",
"RBF",
"Flow Visualization"
],
"authors": [
{
"givenName": "Manfred",
"surname": "Weiler",
"fullName": "Manfred Weiler",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ralf",
"surname": "Botchen",
"fullName": "Ralf Botchen",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Stegmaier",
"fullName": "Simon Stegmaier",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Thomas",
"surname": "Ertl",
"fullName": "Thomas Ertl",
"affiliation": "University of Stuttgart",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jingshu",
"surname": "Huang",
"fullName": "Jingshu Huang",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yun",
"surname": "Jang",
"fullName": "Yun Jang",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David S.",
"surname": "Ebert",
"fullName": "David S. Ebert",
"affiliation": "Purdue University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kelly P.",
"surname": "Gaither",
"fullName": "Kelly P. Gaither",
"affiliation": "University of Texas",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2005-09-01 00:00:00",
"pubType": "mags",
"pages": "72-81",
"year": "2005",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660040",
"title": "Prefiltered Gaussian Reconstruction for High-Quality Rendering of Volumetric Data sampled on a Body-Centered Cubic Grid",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660040/12OmNAfy7Ky",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300057",
"title": "Hierarchical Splatting of Scattered Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300057/12OmNCga1TU",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a262",
"title": "A Hierarchical Approach to 3D Scattered Data Interpolation with Radial Basis Functions",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a262/12OmNwMFMkz",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300043",
"title": "Hierarchical Clustering for Unstructured Volumetric Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300043/12OmNwe2IxX",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2009/3931/1/3931a381",
"title": "A Locally Gaussian Mixture Based RBF Network for Classification of Chinese Herbal Infrared Spectrum Fingerprint",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2009/3931a381/12OmNwlHSST",
"parentPublication": {
"id": "proceedings/cis/2009/3931/1",
"title": "2009 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200lum",
"title": "Texture Hardware Assisted Rendering of Time-Varying Volume Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200lum/12OmNzDvSpf",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/05/ttg2009050734",
"title": "Distribution-Driven Visualization of Volume Data",
"doi": null,
"abstractUrl": "/journal/tg/2009/05/ttg2009050734/13rRUNvgyWi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/03/ttg2009030395",
"title": "Semiautomatic Transfer Function Initialization for Abdominal Visualization Using Self-Generating Hierarchical Radial Basis Function Networks",
"doi": null,
"abstractUrl": "/journal/tg/2009/03/ttg2009030395/13rRUwIF6dI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030421",
"title": "Time-Varying Data Visualization Using Functional Representations",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030421/13rRUx0xPi6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/04/ttg2009040670",
"title": "Hardware Accelerated Segmentation of Complex Volumetric Filament Networks",
"doi": null,
"abstractUrl": "/journal/tg/2009/04/ttg2009040670/13rRUxjQyp9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2005050049",
"articleId": "13rRUxC0SGt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2005050093",
"articleId": "13rRUwInv6O",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz6iOyg",
"title": "March/April",
"year": "2003",
"issueNum": "02",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "5",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNmPJy",
"doi": "10.1109/MCISE.2003.1182960",
"abstract": "Interactive visualization aids to our ability to understand the vast amount of data from large-scale simulations of complex, transient phenomena. This article reviews the most effective strategies developed so far for enabling interactive visualization of volume data from time-varying simulations with a focus on the encoding, feature extraction, and rendering issues. We also identify and discuss emerging trends in time-varying data visualization research and their potential impacts on scientific research community.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactive visualization aids to our ability to understand the vast amount of data from large-scale simulations of complex, transient phenomena. This article reviews the most effective strategies developed so far for enabling interactive visualization of volume data from time-varying simulations with a focus on the encoding, feature extraction, and rendering issues. We also identify and discuss emerging trends in time-varying data visualization research and their potential impacts on scientific research community.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactive visualization aids to our ability to understand the vast amount of data from large-scale simulations of complex, transient phenomena. This article reviews the most effective strategies developed so far for enabling interactive visualization of volume data from time-varying simulations with a focus on the encoding, feature extraction, and rendering issues. We also identify and discuss emerging trends in time-varying data visualization research and their potential impacts on scientific research community.",
"title": "Visualizing Time-Varying Volume Data",
"normalizedTitle": "Visualizing Time-Varying Volume Data",
"fno": "c2034",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Encoding",
"Feature Extraction And Tracking",
"Graphics Hardware Interactive Visualization",
"Parallel Processing",
"Scientific Visualization Time Varying Data",
"Volume Rendering",
"High Dimensional Data"
],
"authors": [
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2003-03-01 00:00:00",
"pubType": "mags",
"pages": "34-42",
"year": "2003",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "c2026",
"articleId": "13rRUyeCkdd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "c2044",
"articleId": "13rRUx0xQ3s",
"__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": "13rRUxlgy3r",
"doi": "10.1109/TVCG.2003.1260749",
"abstract": "Abstract—In this paper, we present a Java-based software architecture for real-time visualization that utilizes a cluster of conventional PCs to generate high-quality interactive graphics. Normally, a large multiprocessor computer would be needed for interactive visualization tasks requiring more processing power than a single PC can provide. By using clusters of PCs, enormous cost savings can be realized, and proprietary “high-end” hardware is no longer necessary for these tasks. Our architecture minimizes the amount of synchronization needed between PCs, resulting in excellent scalability. It provides a modular framework that can accommodate a wide variety of rendering algorithms and data formats, provided that the rendering algorithms can generate pixels individually and the data is duplicated on each PC. Demonstration modules that implement ray tracing, fractal rendering, and volume rendering algorithms were developed to evaluate the architecture. Results are encouraging—using 15 PCs connected to a standard 100 Megabit/s Ethernet network, the system can interactively render simple to moderately complex data sets at modest resolution. Excellent scalability is achieved; however, our tests were limited to a cluster of 15 PCs. Results also demonstrate that Java is a viable platform for real-time distributed visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In this paper, we present a Java-based software architecture for real-time visualization that utilizes a cluster of conventional PCs to generate high-quality interactive graphics. Normally, a large multiprocessor computer would be needed for interactive visualization tasks requiring more processing power than a single PC can provide. By using clusters of PCs, enormous cost savings can be realized, and proprietary “high-end” hardware is no longer necessary for these tasks. Our architecture minimizes the amount of synchronization needed between PCs, resulting in excellent scalability. It provides a modular framework that can accommodate a wide variety of rendering algorithms and data formats, provided that the rendering algorithms can generate pixels individually and the data is duplicated on each PC. Demonstration modules that implement ray tracing, fractal rendering, and volume rendering algorithms were developed to evaluate the architecture. Results are encouraging—using 15 PCs connected to a standard 100 Megabit/s Ethernet network, the system can interactively render simple to moderately complex data sets at modest resolution. Excellent scalability is achieved; however, our tests were limited to a cluster of 15 PCs. Results also demonstrate that Java is a viable platform for real-time distributed visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In this paper, we present a Java-based software architecture for real-time visualization that utilizes a cluster of conventional PCs to generate high-quality interactive graphics. Normally, a large multiprocessor computer would be needed for interactive visualization tasks requiring more processing power than a single PC can provide. By using clusters of PCs, enormous cost savings can be realized, and proprietary “high-end” hardware is no longer necessary for these tasks. Our architecture minimizes the amount of synchronization needed between PCs, resulting in excellent scalability. It provides a modular framework that can accommodate a wide variety of rendering algorithms and data formats, provided that the rendering algorithms can generate pixels individually and the data is duplicated on each PC. Demonstration modules that implement ray tracing, fractal rendering, and volume rendering algorithms were developed to evaluate the architecture. Results are encouraging—using 15 PCs connected to a standard 100 Megabit/s Ethernet network, the system can interactively render simple to moderately complex data sets at modest resolution. Excellent scalability is achieved; however, our tests were limited to a cluster of 15 PCs. Results also demonstrate that Java is a viable platform for real-time distributed visualization.",
"title": "An Architecture for Java-Based Real-Time Distributed Visualization",
"normalizedTitle": "An Architecture for Java-Based Real-Time Distributed Visualization",
"fno": "v0570",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Real Time Rendering",
"Distributed Computing",
"Java",
"Volume Rendering",
"Ray Tracing",
"Fractals"
],
"authors": [
{
"givenName": "Jeffrey",
"surname": "Mahovsky",
"fullName": "Jeffrey Mahovsky",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luigi",
"surname": "Benedicenti",
"fullName": "Luigi Benedicenti",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2003-10-01 00:00:00",
"pubType": "trans",
"pages": "570-579",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0551",
"articleId": "13rRUxOve9A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0580",
"articleId": "13rRUxBa5bG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCm7Bxu",
"title": "July",
"year": "2011",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIM2VBC",
"doi": "10.1109/TVCG.2010.90",
"abstract": "Interactive visualization applications benefit from simplification techniques that generate good-quality coarse meshes from high-resolution meshes that represent the domain. These meshes often contain interesting substructures, called embedded structures, and it is desirable to preserve the topology of the embedded structures during simplification, in addition to preserving the topology of the domain. This paper describes a proof that link conditions, proposed earlier, are sufficient to ensure that edge contractions preserve the topology of the embedded structures and the domain. Excluding two specific configurations, the link conditions are also shown to be necessary for topology preservation. Repeated application of edge contraction on an extended complex produces a coarser representation of the domain and the embedded structures. An extension of the quadric error metric is used to schedule edge contractions, resulting in a good-quality coarse mesh that closely approximates the input domain and the embedded structures.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Interactive visualization applications benefit from simplification techniques that generate good-quality coarse meshes from high-resolution meshes that represent the domain. These meshes often contain interesting substructures, called embedded structures, and it is desirable to preserve the topology of the embedded structures during simplification, in addition to preserving the topology of the domain. This paper describes a proof that link conditions, proposed earlier, are sufficient to ensure that edge contractions preserve the topology of the embedded structures and the domain. Excluding two specific configurations, the link conditions are also shown to be necessary for topology preservation. Repeated application of edge contraction on an extended complex produces a coarser representation of the domain and the embedded structures. An extension of the quadric error metric is used to schedule edge contractions, resulting in a good-quality coarse mesh that closely approximates the input domain and the embedded structures.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Interactive visualization applications benefit from simplification techniques that generate good-quality coarse meshes from high-resolution meshes that represent the domain. These meshes often contain interesting substructures, called embedded structures, and it is desirable to preserve the topology of the embedded structures during simplification, in addition to preserving the topology of the domain. This paper describes a proof that link conditions, proposed earlier, are sufficient to ensure that edge contractions preserve the topology of the embedded structures and the domain. Excluding two specific configurations, the link conditions are also shown to be necessary for topology preservation. Repeated application of edge contraction on an extended complex produces a coarser representation of the domain and the embedded structures. An extension of the quadric error metric is used to schedule edge contractions, resulting in a good-quality coarse mesh that closely approximates the input domain and the embedded structures.",
"title": "Link Conditions for Simplifying Meshes with Embedded Structures",
"normalizedTitle": "Link Conditions for Simplifying Meshes with Embedded Structures",
"fno": "ttg2011071007",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Embedded Structures",
"Extended Complex",
"Link Conditions",
"Mesh Simplification",
"Topology Preservation",
"Quadric Error Metric"
],
"authors": [
{
"givenName": "Dilip Mathew",
"surname": "Thomas",
"fullName": "Dilip Mathew Thomas",
"affiliation": "Indian Institute of Science, Bengaluru",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vijay",
"surname": "Natarajan",
"fullName": "Vijay Natarajan",
"affiliation": "Indian Institute of Science, Bengaluru",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Georges-Pierre",
"surname": "Bonneau",
"fullName": "Georges-Pierre Bonneau",
"affiliation": "LJK, INRIA Grenoble and and the University of Grenoble, Rhone-Alpes, Montbonnot",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2011-07-01 00:00:00",
"pubType": "trans",
"pages": "1007-1019",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/spdp/1990/2087/0/00143655",
"title": "Mapping binary precedence trees to hypercubes and meshes",
"doi": null,
"abstractUrl": "/proceedings-article/spdp/1990/00143655/12OmNAolGXp",
"parentPublication": {
"id": "proceedings/spdp/1990/2087/0",
"title": "Parallel and Distributed Processing, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csie/2009/3507/2/3507b679",
"title": "Mesh Simplification with Global Contour Feature Preservation",
"doi": null,
"abstractUrl": "/proceedings-article/csie/2009/3507b679/12OmNBh8gSp",
"parentPublication": {
"id": "proceedings/csie/2009/3507/2",
"title": "Computer Science and Information Engineering, World Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2002/1784/0/17840477",
"title": "Subdivision Surface Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840477/12OmNviZldv",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1998/9176/0/91760264",
"title": "Simplifying Surfaces with Color and Texture Using Quadric Error Metrics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760264/12OmNvvLi3O",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2012/4829/0/4829a110",
"title": "ESQ: Editable SQuad Representation for Triangle Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2012/4829a110/12OmNxR5UPg",
"parentPublication": {
"id": "proceedings/sibgrapi/2012/4829/0",
"title": "2012 25th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dmamh/2007/3065/0/30650025",
"title": "A Novel Blind Robust Digital Watermarking on 3D Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/dmamh/2007/30650025/12OmNyQ7G1n",
"parentPublication": {
"id": "proceedings/dmamh/2007/3065/0",
"title": "Digital Media and its Application in Museum & Heritage/Digital Media and its Application in Museum & Heritage, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1998/9176/0/91760059",
"title": "A General Method for Preserving Attribute Values on Simplified Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760059/12OmNzUxOgJ",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200shaffer",
"title": "Efficient Adaptive Simplification of Massive Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200shaffer/12OmNzV70Bx",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030434",
"title": "Automated Construction of Low-Resolution, Texture-Mapped, Class-Optimal Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030434/13rRUwI5TQV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0139",
"title": "A Multiresolution Representation for Massive Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0139/13rRUwcAqq4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011070993",
"articleId": "13rRUIJuxvh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011071020",
"articleId": "13rRUEgarBq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx9nGHn",
"title": "March/April",
"year": "2005",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "11",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcAqq4",
"doi": "10.1109/TVCG.2005.18",
"abstract": "We present a new external memory multiresolution surface representation for massive polygonal meshes. Previous methods for building such data structures have relied on resampled surface data or employed memory intensive construction algorithms that do not scale well. Our proposed representation combines efficient access to sampled surface data with access to the original surface. The construction algorithm for the surface representation exhibits memory requirements that are insensitive to the size of the input mesh, allowing it to process meshes containing hundreds of millions of polygons. The multiresolution nature of the surface representation has allowed us to develop efficient algorithms for view-dependent rendering, approximate collision detection, and adaptive simplification of massive meshes. The empirical performance of these algorithms demonstrates that the underlying data structure is a powerful and flexible tool for operating on massive geometric data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new external memory multiresolution surface representation for massive polygonal meshes. Previous methods for building such data structures have relied on resampled surface data or employed memory intensive construction algorithms that do not scale well. Our proposed representation combines efficient access to sampled surface data with access to the original surface. The construction algorithm for the surface representation exhibits memory requirements that are insensitive to the size of the input mesh, allowing it to process meshes containing hundreds of millions of polygons. The multiresolution nature of the surface representation has allowed us to develop efficient algorithms for view-dependent rendering, approximate collision detection, and adaptive simplification of massive meshes. The empirical performance of these algorithms demonstrates that the underlying data structure is a powerful and flexible tool for operating on massive geometric data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new external memory multiresolution surface representation for massive polygonal meshes. Previous methods for building such data structures have relied on resampled surface data or employed memory intensive construction algorithms that do not scale well. Our proposed representation combines efficient access to sampled surface data with access to the original surface. The construction algorithm for the surface representation exhibits memory requirements that are insensitive to the size of the input mesh, allowing it to process meshes containing hundreds of millions of polygons. The multiresolution nature of the surface representation has allowed us to develop efficient algorithms for view-dependent rendering, approximate collision detection, and adaptive simplification of massive meshes. The empirical performance of these algorithms demonstrates that the underlying data structure is a powerful and flexible tool for operating on massive geometric data.",
"title": "A Multiresolution Representation for Massive Meshes",
"normalizedTitle": "A Multiresolution Representation for Massive Meshes",
"fno": "v0139",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Hierarchical Data Structures",
"Level Of Detail",
"Mesh Simplification",
"Out Of Core Algorithms"
],
"authors": [
{
"givenName": "Eric",
"surname": "Shaffer",
"fullName": "Eric Shaffer",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Garland",
"fullName": "Michael Garland",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2005-03-01 00:00:00",
"pubType": "trans",
"pages": "139-148",
"year": "2005",
"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/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/2003/2030/0/20300061",
"title": "Large Mesh Simplification using Processing Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300061/12OmNweBUR1",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300021",
"title": "Real-Time Refinement and Simplification of Adaptive Triangular Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300021/12OmNwp74DZ",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__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/2001/7200/0/7200shaffer",
"title": "Efficient Adaptive Simplification of Massive Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200shaffer/12OmNzV70Bx",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498decoro",
"title": "XFastMesh: Fast View-dependent Meshing from External Memory",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498decoro/12OmNzVGcTe",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/03/v0353",
"title": "Efficient Implementation of Real-Time View-Dependent Multiresolution Meshing",
"doi": null,
"abstractUrl": "/journal/tg/2004/03/v0353/13rRUwfI0PX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/04/v0525",
"title": "External Memory Management and Simplification of Huge Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2003/04/v0525/13rRUxjQyp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/02/v0145",
"title": "Constructing Hierarchies for Triangle Meshes",
"doi": null,
"abstractUrl": "/journal/tg/1998/02/v0145/13rRUy0qnGc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0126",
"articleId": "13rRUxNEqPC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0149",
"articleId": "13rRUyp7tWM",
"__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": "13rRUxjQyp4",
"doi": "10.1109/TVCG.2003.1260746",
"abstract": "Abstract—Very large triangle meshes, i.e., meshes composed of millions of faces, are becoming common in many applications. Obviously, processing, rendering, transmission, and archiving of these meshes are not simple tasks. Mesh simplification and LOD management are a rather mature technology that, in many cases, can efficiently manage complex data. But, only a few available systems can manage meshes characterized by a huge size: RAM size is often a severe bottleneck. In this paper, we present a data structure called Octree-based External Memory Mesh (OEMM). It supports external memory management of complex meshes, loading dynamically in main memory only the selected sections and preserving data consistency during local updates. The functionalities implemented on this data structure (simplification, detail preservation, mesh editing, visualization, and inspection) can be applied to huge triangles meshes on low-cost PC platforms. The time overhead due to the external memory management is affordable. Results of the test of our system on complex meshes are presented.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Very large triangle meshes, i.e., meshes composed of millions of faces, are becoming common in many applications. Obviously, processing, rendering, transmission, and archiving of these meshes are not simple tasks. Mesh simplification and LOD management are a rather mature technology that, in many cases, can efficiently manage complex data. But, only a few available systems can manage meshes characterized by a huge size: RAM size is often a severe bottleneck. In this paper, we present a data structure called Octree-based External Memory Mesh (OEMM). It supports external memory management of complex meshes, loading dynamically in main memory only the selected sections and preserving data consistency during local updates. The functionalities implemented on this data structure (simplification, detail preservation, mesh editing, visualization, and inspection) can be applied to huge triangles meshes on low-cost PC platforms. The time overhead due to the external memory management is affordable. Results of the test of our system on complex meshes are presented.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Very large triangle meshes, i.e., meshes composed of millions of faces, are becoming common in many applications. Obviously, processing, rendering, transmission, and archiving of these meshes are not simple tasks. Mesh simplification and LOD management are a rather mature technology that, in many cases, can efficiently manage complex data. But, only a few available systems can manage meshes characterized by a huge size: RAM size is often a severe bottleneck. In this paper, we present a data structure called Octree-based External Memory Mesh (OEMM). It supports external memory management of complex meshes, loading dynamically in main memory only the selected sections and preserving data consistency during local updates. The functionalities implemented on this data structure (simplification, detail preservation, mesh editing, visualization, and inspection) can be applied to huge triangles meshes on low-cost PC platforms. The time overhead due to the external memory management is affordable. Results of the test of our system on complex meshes are presented.",
"title": "External Memory Management and Simplification of Huge Meshes",
"normalizedTitle": "External Memory Management and Simplification of Huge Meshes",
"fno": "v0525",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Out Of Core Algorithms",
"Hierarchical Data Structures",
"Mesh Simplification",
"Level Of Detail",
"3 D Scanning",
"Texture Synthesis"
],
"authors": [
{
"givenName": "Paolo",
"surname": "Cignoni",
"fullName": "Paolo Cignoni",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Claudio",
"surname": "Montani",
"fullName": "Claudio Montani",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Claudio",
"surname": "Rocchini",
"fullName": "Claudio Rocchini",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roberto",
"surname": "Scopigno",
"fullName": "Roberto Scopigno",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2003-10-01 00:00:00",
"pubType": "trans",
"pages": "525-537",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0512",
"articleId": "13rRUEgarsB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0538",
"articleId": "13rRUIJuxvc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBVrjqW",
"title": "March/April",
"year": "2006",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SvL",
"doi": "10.1109/TVCG.2006.33",
"abstract": "Abstract—In many applications, volumetric data sets are examined by displaying isosurfaces, surfaces where the data, or some function of the data, takes on a given value. Interactive applications typically use local lighting models to render such surfaces. This work introduces a method to precompute or lazily compute global illumination to improve interactive isosurface renderings. The precomputed illumination resides in a separate volume and includes direct light, shadows, and interreflections. Using this volume, interactive globally illuminated renderings of isosurfaces become feasible while still allowing dynamic manipulation of lighting, viewpoint and isovalue.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In many applications, volumetric data sets are examined by displaying isosurfaces, surfaces where the data, or some function of the data, takes on a given value. Interactive applications typically use local lighting models to render such surfaces. This work introduces a method to precompute or lazily compute global illumination to improve interactive isosurface renderings. The precomputed illumination resides in a separate volume and includes direct light, shadows, and interreflections. Using this volume, interactive globally illuminated renderings of isosurfaces become feasible while still allowing dynamic manipulation of lighting, viewpoint and isovalue.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In many applications, volumetric data sets are examined by displaying isosurfaces, surfaces where the data, or some function of the data, takes on a given value. Interactive applications typically use local lighting models to render such surfaces. This work introduces a method to precompute or lazily compute global illumination to improve interactive isosurface renderings. The precomputed illumination resides in a separate volume and includes direct light, shadows, and interreflections. Using this volume, interactive globally illuminated renderings of isosurfaces become feasible while still allowing dynamic manipulation of lighting, viewpoint and isovalue.",
"title": "Interactive Display of Isosurfaces with Global Illumination",
"normalizedTitle": "Interactive Display of Isosurfaces with Global Illumination",
"fno": "v0186",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Path Tracing",
"Isosurface",
"Visualization",
"Rendering",
"Global Illumination",
"Precomputed Radiance Transfer"
],
"authors": [
{
"givenName": "Chris",
"surname": "Wyman",
"fullName": "Chris Wyman",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Steven",
"surname": "Parker",
"fullName": "Steven Parker",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Shirley",
"fullName": "Peter Shirley",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charles",
"surname": "Hansen",
"fullName": "Charles Hansen",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2006-03-01 00:00:00",
"pubType": "trans",
"pages": "186-196",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vs-games/2011/4419/0/4419a055",
"title": "Approximate Visibility Grids for Interactive Indirect Illumination",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2011/4419a055/12OmNqBKTM9",
"parentPublication": {
"id": "proceedings/vs-games/2011/4419/0",
"title": "Games and Virtual Worlds for Serious Applications, Conference in",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2007/3009/0/30090077",
"title": "Interactive Global Illumination Using Implicit Visibility",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2007/30090077/12OmNrJRPi7",
"parentPublication": {
"id": "proceedings/pg/2007/3009/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2003/2028/0/20280450",
"title": "Interactive Global Illumination in Dynamic Environments Using Commodity Graphics Hardware",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2003/20280450/12OmNrY3LAu",
"parentPublication": {
"id": "proceedings/pg/2003/2028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2008/1966/0/04475455",
"title": "Interactive Exploration of Remote Isosurfaces with Point-Based Non-Photorealistic Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2008/04475455/12OmNy49sGe",
"parentPublication": {
"id": "proceedings/pacificvis/2008/1966/0",
"title": "IEEE Pacific Visualization Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061595",
"title": "Decoupling Illumination from Isosurface Generation Using 4D Light Transport",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061595/13rRUwInvf0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2007/01/c1048",
"title": "Fast Global Illumination for Visualizing Isosurfaces with a 3D Illumination Grid",
"doi": null,
"abstractUrl": "/magazine/cs/2007/01/c1048/13rRUwh80L1",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/05/v0562",
"title": "Faster Isosurface Ray Tracing Using Implicit KD-Trees",
"doi": null,
"abstractUrl": "/journal/tg/2005/05/v0562/13rRUwkfAZ5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030447",
"title": "Efficient Visibility Encoding for Dynamic Illumination in Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030447/13rRUxAATgu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/05/ttg2010050729",
"title": "Interactive Indirect Illumination Using Adaptive Multiresolution Splatting",
"doi": null,
"abstractUrl": "/journal/tg/2010/05/ttg2010050729/13rRUxD9h53",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/01/08951772",
"title": "Origins of Global Illumination",
"doi": null,
"abstractUrl": "/magazine/cg/2020/01/08951772/1goL8Hzhdcs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "01580466",
"articleId": "13rRUwghd4V",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0197",
"articleId": "13rRUyuegoX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNviZlCL",
"title": "January",
"year": "2011",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxAAT0N",
"doi": "10.1109/TVCG.2010.25",
"abstract": "Artists use different means of stylization to control the focus on different objects in the scene. This allows them to portray complex meaning and achieve certain artistic effects. Most prior work on painterly rendering of videos, however, uses only a single painting style, with fixed global parameters, irrespective of objects and their layout in the images. This often leads to inadequate artistic control. Moreover, brush stroke orientation is typically assumed to follow an everywhere continuous directional field. In this paper, we propose a video painting system that accounts for the spatial support of objects in the images or videos, and uses this information to specify style parameters and stroke orientation for painterly rendering. Since objects occupy distinct image locations and move relatively smoothly from one video frame to another, our object-based painterly rendering approach is characterized by style parameters that coherently vary in space and time. Space-time-varying style parameters enable more artistic freedom, such as emphasis/de-emphasis, increase or decrease of contrast, exaggeration or abstraction of different objects in the scene in a temporally coherent fashion.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Artists use different means of stylization to control the focus on different objects in the scene. This allows them to portray complex meaning and achieve certain artistic effects. Most prior work on painterly rendering of videos, however, uses only a single painting style, with fixed global parameters, irrespective of objects and their layout in the images. This often leads to inadequate artistic control. Moreover, brush stroke orientation is typically assumed to follow an everywhere continuous directional field. In this paper, we propose a video painting system that accounts for the spatial support of objects in the images or videos, and uses this information to specify style parameters and stroke orientation for painterly rendering. Since objects occupy distinct image locations and move relatively smoothly from one video frame to another, our object-based painterly rendering approach is characterized by style parameters that coherently vary in space and time. Space-time-varying style parameters enable more artistic freedom, such as emphasis/de-emphasis, increase or decrease of contrast, exaggeration or abstraction of different objects in the scene in a temporally coherent fashion.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Artists use different means of stylization to control the focus on different objects in the scene. This allows them to portray complex meaning and achieve certain artistic effects. Most prior work on painterly rendering of videos, however, uses only a single painting style, with fixed global parameters, irrespective of objects and their layout in the images. This often leads to inadequate artistic control. Moreover, brush stroke orientation is typically assumed to follow an everywhere continuous directional field. In this paper, we propose a video painting system that accounts for the spatial support of objects in the images or videos, and uses this information to specify style parameters and stroke orientation for painterly rendering. Since objects occupy distinct image locations and move relatively smoothly from one video frame to another, our object-based painterly rendering approach is characterized by style parameters that coherently vary in space and time. Space-time-varying style parameters enable more artistic freedom, such as emphasis/de-emphasis, increase or decrease of contrast, exaggeration or abstraction of different objects in the scene in a temporally coherent fashion.",
"title": "Video Painting with Space-Time-Varying Style Parameters",
"normalizedTitle": "Video Painting with Space-Time-Varying Style Parameters",
"fno": "ttg2011010074",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Nonphotorealistic Rendering",
"Video Painting",
"Multistyle Painting",
"Tensor Field Design"
],
"authors": [
{
"givenName": "Mizuki",
"surname": "Kagaya",
"fullName": "Mizuki Kagaya",
"affiliation": "Oregon State University, Corvallis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "William",
"surname": "Brendel",
"fullName": "William Brendel",
"affiliation": "Oregon State University, Corvallis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qingqing",
"surname": "Deng",
"fullName": "Qingqing Deng",
"affiliation": "Oregon State University, Corvallis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Todd",
"surname": "Kesterson",
"fullName": "Todd Kesterson",
"affiliation": "Oregon State University, Corvallis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sinisa",
"surname": "Todorovic",
"fullName": "Sinisa Todorovic",
"affiliation": "Oregon State University, Corvallis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Patrick J.",
"surname": "Neill",
"fullName": "Patrick J. Neill",
"affiliation": "NVidia, Santa Clara",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eugene",
"surname": "Zhang",
"fullName": "Eugene Zhang",
"affiliation": "Oregon State University, Corvallis",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2011-01-01 00:00:00",
"pubType": "trans",
"pages": "74-87",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457g997",
"title": "Deep Photo Style Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457g997/12OmNs59JSE",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmvit/2017/4993/0/07878716",
"title": "Generation of Stereo Oil Paintings from RGBD Images",
"doi": null,
"abstractUrl": "/proceedings-article/cmvit/2017/07878716/12OmNxT56Bx",
"parentPublication": {
"id": "proceedings/cmvit/2017/4993/0",
"title": "2017 International Conference on Machine Vision and Information Technology (CMVIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/psivt/2010/4285/0/4285a462",
"title": "Artistic Emulation - Filter Blending for Painterly Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/psivt/2010/4285a462/12OmNyRg48N",
"parentPublication": {
"id": "proceedings/psivt/2010/4285/0",
"title": "Image and Video Technology, Pacific-Rim Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2009/3789/0/3789a089",
"title": "Artwork-Based 3D Ink Style Modeling and Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a089/12OmNzlUKmq",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/01/ttg2012010058",
"title": "Video Painting Based on a Stabilized Time-Varying Flow Field",
"doi": null,
"abstractUrl": "/journal/tg/2012/01/ttg2012010058/13rRUwInv4m",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/04/v0443",
"title": "Cubist Style Rendering from Photographs",
"doi": null,
"abstractUrl": "/journal/tg/2003/04/v0443/13rRUx0gev0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050866",
"title": "State of the \"Art”: A Taxonomy of Artistic Stylization Techniques for Images and Video",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050866/13rRUxBa561",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030475",
"title": "AniPaint: Interactive Painterly Animation from Video",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030475/13rRUygT7sB",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccst/2020/8138/0/813800a284",
"title": "Real-time Rendering of 3D Animal Models in Chinese Ink Painting Style",
"doi": null,
"abstractUrl": "/proceedings-article/iccst/2020/813800a284/1p1grC3XnGw",
"parentPublication": {
"id": "proceedings/iccst/2020/8138/0",
"title": "2020 International Conference on Culture-oriented Science & Technology (ICCST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a156",
"title": "GDot: Drawing Graphs with Dots and Circles",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a156/1tTtp2Lclna",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011010064",
"articleId": "13rRUxZ0o1u",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011010088",
"articleId": "13rRUNvgziB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrYlmwq",
"title": "March/April",
"year": "2007",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuSC",
"doi": "10.1109/TVCG.2007.41",
"abstract": "Abstract—This paper proposes an image-based painterly rendering algorithm for automatically synthesizing an image with color ink diffusion. We suggest a mathematical model with a physical base to simulate the phenomenon of color colloidal ink diffusing into absorbent paper. Our algorithm contains three main parts: a feature extraction phase, a Kubelka-Munk (KM) color mixing phase, and a color ink diffusion synthesis phase. In the feature extraction phase, the information of the reference image is simplified by luminance division and color segmentation. In the color mixing phase, the KM theory is employed to approximate the result when one pigment is painted upon another pigment layer. Then, in the color ink diffusion synthesis phase, the physically-based model that we propose is employed to simulate the result of color ink diffusion in absorbent paper using a texture synthesis technique. Our image-based ink diffusing rendering (IBCIDR) algorithm eliminates the drawback of conventional Chinese ink simulations, which are limited to the black ink domain, and our approach demonstrates that, without using any strokes, a color image can be automatically converted to the diffused ink style with a visually pleasing appearance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper proposes an image-based painterly rendering algorithm for automatically synthesizing an image with color ink diffusion. We suggest a mathematical model with a physical base to simulate the phenomenon of color colloidal ink diffusing into absorbent paper. Our algorithm contains three main parts: a feature extraction phase, a Kubelka-Munk (KM) color mixing phase, and a color ink diffusion synthesis phase. In the feature extraction phase, the information of the reference image is simplified by luminance division and color segmentation. In the color mixing phase, the KM theory is employed to approximate the result when one pigment is painted upon another pigment layer. Then, in the color ink diffusion synthesis phase, the physically-based model that we propose is employed to simulate the result of color ink diffusion in absorbent paper using a texture synthesis technique. Our image-based ink diffusing rendering (IBCIDR) algorithm eliminates the drawback of conventional Chinese ink simulations, which are limited to the black ink domain, and our approach demonstrates that, without using any strokes, a color image can be automatically converted to the diffused ink style with a visually pleasing appearance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper proposes an image-based painterly rendering algorithm for automatically synthesizing an image with color ink diffusion. We suggest a mathematical model with a physical base to simulate the phenomenon of color colloidal ink diffusing into absorbent paper. Our algorithm contains three main parts: a feature extraction phase, a Kubelka-Munk (KM) color mixing phase, and a color ink diffusion synthesis phase. In the feature extraction phase, the information of the reference image is simplified by luminance division and color segmentation. In the color mixing phase, the KM theory is employed to approximate the result when one pigment is painted upon another pigment layer. Then, in the color ink diffusion synthesis phase, the physically-based model that we propose is employed to simulate the result of color ink diffusion in absorbent paper using a texture synthesis technique. Our image-based ink diffusing rendering (IBCIDR) algorithm eliminates the drawback of conventional Chinese ink simulations, which are limited to the black ink domain, and our approach demonstrates that, without using any strokes, a color image can be automatically converted to the diffused ink style with a visually pleasing appearance.",
"title": "Image-Based Color Ink Diffusion Rendering",
"normalizedTitle": "Image-Based Color Ink Diffusion Rendering",
"fno": "v0235",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Chinese Ink",
"Ink Diffusion",
"Image Based",
"Painterly Rendering",
"Nonphotorealistic Rendering",
"Kubelka Munk Theory"
],
"authors": [
{
"givenName": "Chung-Ming",
"surname": "Wang",
"fullName": "Chung-Ming Wang",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ren-Jie",
"surname": "Wang",
"fullName": "Ren-Jie Wang",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2007-03-01 00:00:00",
"pubType": "trans",
"pages": "235-246",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ca/1995/7062/0/70620098",
"title": "A diffusion model for computer animation of diffuse ink painting",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1995/70620098/12OmNCbU2S0",
"parentPublication": {
"id": "proceedings/ca/1995/7062/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2003/1946/0/19460152",
"title": "\"Nijimi\" Rendering Algorithm for Creating Quality Black Ink Paintings",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2003/19460152/12OmNqG0SMZ",
"parentPublication": {
"id": "proceedings/cgi/2003/1946/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mediacom/2010/4136/0/4136a153",
"title": "A Survey of Rendering of Chinese Painting",
"doi": null,
"abstractUrl": "/proceedings-article/mediacom/2010/4136a153/12OmNrJ11w2",
"parentPublication": {
"id": "proceedings/mediacom/2010/4136/0",
"title": "2010 International Conference on Multimedia Communications (Mediacom 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/3/73103121",
"title": "Error diffusion with ink reduction for high quality and high resolution ink jet printing",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73103121/12OmNvjgWnj",
"parentPublication": {
"id": "proceedings/icip/1995/7310/3",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2007/2994/1/29940329",
"title": "Effective Color Ink Diffusion Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2007/29940329/12OmNxaNGpd",
"parentPublication": {
"id": "iih-msp/2007/2994/1",
"title": "Intelligent Information Hiding and Multimedia Signal Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis/2005/2296/0/22960598",
"title": "Oriental Color Ink Rendering for Landscape",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2005/22960598/12OmNxisR2n",
"parentPublication": {
"id": "proceedings/icis/2005/2296/0",
"title": "Proceedings. Fourth Annual ACIS International Conference on Computer and Information Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2009/4830/0/05255155",
"title": "Non-photorealistic rendering of ink painting style diffusion",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2009/05255155/12OmNyFU7aU",
"parentPublication": {
"id": "proceedings/grc/2009/4830/0",
"title": "2009 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fbie/2008/3561/0/3561a090",
"title": "Image Auto-generation of Brush Modeling and Ink Diffusion Chinese Ink Paintin",
"doi": null,
"abstractUrl": "/proceedings-article/fbie/2008/3561a090/12OmNyv7mea",
"parentPublication": {
"id": "proceedings/fbie/2008/3561/0",
"title": "2008 International Seminar on Future Biomedical Information Engineering (FBIE 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2005/2392/0/23920317",
"title": "Physical Modeling of \"Xuan\" Paper in the Simulation of Chinese Ink-Wash Drawing",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2005/23920317/12OmNzTppDM",
"parentPublication": {
"id": "proceedings/cgiv/2005/2392/0",
"title": "International Conference on Computer Graphics, Imaging and Visualization (CGIV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icime/2018/7616/0/761600a205",
"title": "A Method for Ink-Wash Painting Rendering for 3D Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/icime/2018/761600a205/17D45WGGoLy",
"parentPublication": {
"id": "proceedings/icime/2018/7616/0",
"title": "2018 International Joint Conference on Information, Media and Engineering (ICIME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0213",
"articleId": "13rRUyogGA3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0247",
"articleId": "13rRUwIF69c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBcj5E9",
"title": "January/February",
"year": "2006",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBJhFm",
"doi": "10.1109/TVCG.2006.14",
"abstract": "Abstract—This paper presents a novel system framework for interactive, three-dimensional, stylized, abstract painterly rendering. In this framework, the input models are first represented using 3D point sets and then this point-based representation is used to build a multiresolution bounding sphere hierarchy. From the leaf to root nodes, spheres of various sizes are rendered into multiple-size strokes on the canvas. The proposed sphere hierarchy is developed using multiscale region segmentation. This segmentation task assembles spheres with similar attribute regularities into a meaningful region hierarchy. These attributes include colors, positions, and curvatures. This hierarchy is very useful in the following respects: 1) it ensures the screen-space stroke density, 2) controls different input model abstractions, 3) maintains region structures such as the edges/boundaries at different scales, and 4) renders models interactively. By choosing suitable abstractions, brush stroke, and lighting parameters, we can interactively generate various painterly styles. We also propose a novel scheme that reduces the popping effect in animation sequences. Many different stylized images can be generated using the proposed framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper presents a novel system framework for interactive, three-dimensional, stylized, abstract painterly rendering. In this framework, the input models are first represented using 3D point sets and then this point-based representation is used to build a multiresolution bounding sphere hierarchy. From the leaf to root nodes, spheres of various sizes are rendered into multiple-size strokes on the canvas. The proposed sphere hierarchy is developed using multiscale region segmentation. This segmentation task assembles spheres with similar attribute regularities into a meaningful region hierarchy. These attributes include colors, positions, and curvatures. This hierarchy is very useful in the following respects: 1) it ensures the screen-space stroke density, 2) controls different input model abstractions, 3) maintains region structures such as the edges/boundaries at different scales, and 4) renders models interactively. By choosing suitable abstractions, brush stroke, and lighting parameters, we can interactively generate various painterly styles. We also propose a novel scheme that reduces the popping effect in animation sequences. Many different stylized images can be generated using the proposed framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper presents a novel system framework for interactive, three-dimensional, stylized, abstract painterly rendering. In this framework, the input models are first represented using 3D point sets and then this point-based representation is used to build a multiresolution bounding sphere hierarchy. From the leaf to root nodes, spheres of various sizes are rendered into multiple-size strokes on the canvas. The proposed sphere hierarchy is developed using multiscale region segmentation. This segmentation task assembles spheres with similar attribute regularities into a meaningful region hierarchy. These attributes include colors, positions, and curvatures. This hierarchy is very useful in the following respects: 1) it ensures the screen-space stroke density, 2) controls different input model abstractions, 3) maintains region structures such as the edges/boundaries at different scales, and 4) renders models interactively. By choosing suitable abstractions, brush stroke, and lighting parameters, we can interactively generate various painterly styles. We also propose a novel scheme that reduces the popping effect in animation sequences. Many different stylized images can be generated using the proposed framework.",
"title": "Stylized and Abstract Painterly Rendering System Using a Multiscale Segmented Sphere Hierarchy",
"normalizedTitle": "Stylized and Abstract Painterly Rendering System Using a Multiscale Segmented Sphere Hierarchy",
"fno": "v0061",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Painterly Rendering",
"Bounding Sphere Hierarchy",
"Multiscale Region Segmentation",
"Stylization And Abstraction",
"Stroke Based Rendering"
],
"authors": [
{
"givenName": "Ming-Te",
"surname": "Chi",
"fullName": "Ming-Te Chi",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tong-Yee",
"surname": "Lee",
"fullName": "Tong-Yee Lee",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2006-01-01 00:00:00",
"pubType": "trans",
"pages": "61-72",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wgec/2009/3899/0/3899a335",
"title": "Simplification of Scattered Point Cloud Based on Feature Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/wgec/2009/3899a335/12OmNB8kHTv",
"parentPublication": {
"id": "proceedings/wgec/2009/3899/0",
"title": "Genetic and Evolutionary Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2012/4525/0/4525c573",
"title": "Social Capital and the Networked Public Sphere: Implications for Political Social Media Sites",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2012/4525c573/12OmNBQkwXe",
"parentPublication": {
"id": "proceedings/hicss/2012/4525/0",
"title": "2012 45th Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/achi/2009/3529/0/3529a136",
"title": "A Hybrid Bounding Volume Algorithm to Detect Collisions between Deformable Objects",
"doi": null,
"abstractUrl": "/proceedings-article/achi/2009/3529a136/12OmNC3FG9c",
"parentPublication": {
"id": "proceedings/achi/2009/3529/0",
"title": "International Conference on Advances in Computer-Human Interaction",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifita/2010/4115/3/4115c185",
"title": "Efficient Collision Detection Using a Dual K-DOP-Sphere Bounding Volume Hierarchy",
"doi": null,
"abstractUrl": "/proceedings-article/ifita/2010/4115c185/12OmNvwTGGt",
"parentPublication": {
"id": "proceedings/ifita/2010/4115/1",
"title": "Information Technology and Applications, International Forum on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031605",
"title": "Implicit Sphere Shadow Maps",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031605/12OmNxcMShN",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/psivt/2010/4285/0/4285a462",
"title": "Artistic Emulation - Filter Blending for Painterly Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/psivt/2010/4285a462/12OmNyRg48N",
"parentPublication": {
"id": "proceedings/psivt/2010/4285/0",
"title": "Image and Video Technology, Pacific-Rim Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvgip/2008/3476/0/3476a568",
"title": "Real-Time Painterly Rendering of Terrains",
"doi": null,
"abstractUrl": "/proceedings-article/icvgip/2008/3476a568/12OmNyen1vF",
"parentPublication": {
"id": "proceedings/icvgip/2008/3476/0",
"title": "Computer Vision, Graphics & Image Processing, Indian Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2005/8929/0/01492774",
"title": "Stylized augmented reality for improved immersion",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2005/01492774/12OmNylbotS",
"parentPublication": {
"id": "proceedings/vr/2005/8929/0",
"title": "IEEE Virtual Reality 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/02/ttg2008020468",
"title": "Stylized Rendering Using Samples of a Painted Image",
"doi": null,
"abstractUrl": "/journal/tg/2008/02/ttg2008020468/13rRUEgs2BO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900b440",
"title": "Pulsar: Efficient Sphere-based Neural Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900b440/1yeJSYxaxKo",
"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": "v0036",
"articleId": "13rRUNvyat7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0073",
"articleId": "13rRUygT7f0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCwUmsT",
"title": "July-September",
"year": "2010",
"issueNum": "03",
"idPrefix": "th",
"pubType": "journal",
"volume": "3",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJr1",
"doi": "10.1109/TOH.2010.21",
"abstract": "We present a wearable haptic feedback device that imparts rotational skin stretch to the hairy skin, along with the results of psychophysical tests to determine its resolution and accuracy for motion display. Tracking experiments with visual markers reveal the pattern of skin motion and strain imparted by the device, confirming subjective impressions that the design represents a trade-off between perception at low stimulus levels and comfort at maximum stimulus levels. In an isolated environment, users were able to discriminate between different rotational displacements of stretch within two to five degrees, depending on the reference stimulus. In a more realistic setting, subjects were able to use feedback from the device to control the positioning of a virtual object within six degrees or \\pm 6.5 degrees of the total range of motion. When subjects were passive and exposed to arbitrary rotations of the device, the accuracy was poorer, although it improved with training. The results suggest that wearable skin stretch devices can be an effective means of providing feedback about a user's controlled joint or limb motions for motion training and similar applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a wearable haptic feedback device that imparts rotational skin stretch to the hairy skin, along with the results of psychophysical tests to determine its resolution and accuracy for motion display. Tracking experiments with visual markers reveal the pattern of skin motion and strain imparted by the device, confirming subjective impressions that the design represents a trade-off between perception at low stimulus levels and comfort at maximum stimulus levels. In an isolated environment, users were able to discriminate between different rotational displacements of stretch within two to five degrees, depending on the reference stimulus. In a more realistic setting, subjects were able to use feedback from the device to control the positioning of a virtual object within six degrees or \\pm 6.5 degrees of the total range of motion. When subjects were passive and exposed to arbitrary rotations of the device, the accuracy was poorer, although it improved with training. The results suggest that wearable skin stretch devices can be an effective means of providing feedback about a user's controlled joint or limb motions for motion training and similar applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a wearable haptic feedback device that imparts rotational skin stretch to the hairy skin, along with the results of psychophysical tests to determine its resolution and accuracy for motion display. Tracking experiments with visual markers reveal the pattern of skin motion and strain imparted by the device, confirming subjective impressions that the design represents a trade-off between perception at low stimulus levels and comfort at maximum stimulus levels. In an isolated environment, users were able to discriminate between different rotational displacements of stretch within two to five degrees, depending on the reference stimulus. In a more realistic setting, subjects were able to use feedback from the device to control the positioning of a virtual object within six degrees or \\pm 6.5 degrees of the total range of motion. When subjects were passive and exposed to arbitrary rotations of the device, the accuracy was poorer, although it improved with training. The results suggest that wearable skin stretch devices can be an effective means of providing feedback about a user's controlled joint or limb motions for motion training and similar applications.",
"title": "Rotational Skin Stretch Feedback: A Wearable Haptic Display for Motion",
"normalizedTitle": "Rotational Skin Stretch Feedback: A Wearable Haptic Display for Motion",
"fno": "tth2010030166",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Skin Stretch",
"Skin Strain",
"Proprioception",
"Wearable",
"Haptics"
],
"authors": [
{
"givenName": "Karlin",
"surname": "Bark",
"fullName": "Karlin Bark",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jason",
"surname": "Wheeler",
"fullName": "Jason Wheeler",
"affiliation": "Sandia National Laboratories",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pete",
"surname": "Shull",
"fullName": "Pete Shull",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joan",
"surname": "Savall",
"fullName": "Joan Savall",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark",
"surname": "Cutkosky",
"fullName": "Mark Cutkosky",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2010-07-01 00:00:00",
"pubType": "trans",
"pages": "166-176",
"year": "2010",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/haptics/2008/2005/0/04479916",
"title": "Comparison of Skin Stretch and Vibrotactile Stimulation for Feedback of Proprioceptive Information",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2008/04479916/12OmNAhOUNW",
"parentPublication": {
"id": "proceedings/haptics/2008/2005/0",
"title": "IEEE Haptics Symposium 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/whc/2009/3858/0/04810850",
"title": "A wearable skin stretch device for haptic feedback",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2009/04810850/12OmNClQ0Bc",
"parentPublication": {
"id": "proceedings/whc/2009/3858/0",
"title": "World Haptics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/whc/2007/2738/0/27380373",
"title": "Effects of Longitudinal Skin Stretch on the Perception of Friction",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2007/27380373/12OmNs0kyyj",
"parentPublication": {
"id": "proceedings/whc/2007/2738/0",
"title": "2007 2nd Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environments and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444675",
"title": "Skin nonlinearities and their effect on user perception for rotational skin stretch",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444675/12OmNwEJ0H8",
"parentPublication": {
"id": "proceedings/haptics/2010/6821/0",
"title": "2010 IEEE Haptics Symposium (Formerly known as Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/whc/2009/3858/0/04810804",
"title": "Communication of direction through lateral skin stretch at the fingertip",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2009/04810804/12OmNzxyiO3",
"parentPublication": {
"id": "proceedings/whc/2009/3858/0",
"title": "World Haptics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/04/tth2010040297",
"title": "Design of a Fingertip-Mounted Tactile Display with Tangential Skin Displacement Feedback",
"doi": null,
"abstractUrl": "/journal/th/2010/04/tth2010040297/13rRUxASuhL",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/03/tth2010030177",
"title": "Perception of Direction for Applied Tangential Skin Displacement: Effects of Speed, Displacement, and Repetition",
"doi": null,
"abstractUrl": "/journal/th/2010/03/tth2010030177/13rRUxBa5xr",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2016/01/07377107",
"title": "Lower Extremity Lateral Skin Stretch Perception for Haptic Feedback",
"doi": null,
"abstractUrl": "/journal/th/2016/01/07377107/13rRUxDIthq",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2009/04/tth2009040212",
"title": "Fingerpad Skin Stretch Increases the Perception of Virtual Friction",
"doi": null,
"abstractUrl": "/journal/th/2009/04/tth2009040212/13rRUxly8T7",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2014/02/06714450",
"title": "Planar Hand Motion Guidance Using Fingertip Skin-Stretch Feedback",
"doi": null,
"abstractUrl": "/journal/th/2014/02/06714450/13rRUzp02oB",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tth2010030155",
"articleId": "13rRUyueghf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tth2010030177",
"articleId": "13rRUxBa5xr",
"__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": "13rRUxly8T7",
"doi": "10.1109/TOH.2009.34",
"abstract": "This research focuses on the relative importance of fingerpad skin stretch on the perception of friction. It is hypothesized that the perceived magnitude of friction rendered by traditional force feedback can be increased through the addition of fingertip skin stretch. Perceptual data are presented from two separate tests performed on nine male subjects. The first experiment determines the perceptual thresholds for friction based on a modified Karnopp friction model where friction is rendered as purely a kinesthetic resistance via a PHANToM force feedback device. JNDs of 0.056-0.150 corresponding to static coefficients for friction of \\mu_s = 0.2\\hbox{-}0.8 were established. The second experiment evaluates possible changes in the perceived friction magnitude due to imposing small amounts of tangential skin stretch (0.25-0.75 mm) to the fingerpad in combination with force feedback (kinesthetic resistance). Our results show that even these small amounts of skin stretch lead to a statistically significant increase in perceived friction ({\\rm p} < 0.01). This significant finding will enable the hapticians to more realistically and accurately render friction via a combination of kinesthetic resistance and tactile feedback.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This research focuses on the relative importance of fingerpad skin stretch on the perception of friction. It is hypothesized that the perceived magnitude of friction rendered by traditional force feedback can be increased through the addition of fingertip skin stretch. Perceptual data are presented from two separate tests performed on nine male subjects. The first experiment determines the perceptual thresholds for friction based on a modified Karnopp friction model where friction is rendered as purely a kinesthetic resistance via a PHANToM force feedback device. JNDs of 0.056-0.150 corresponding to static coefficients for friction of \\mu_s = 0.2\\hbox{-}0.8 were established. The second experiment evaluates possible changes in the perceived friction magnitude due to imposing small amounts of tangential skin stretch (0.25-0.75 mm) to the fingerpad in combination with force feedback (kinesthetic resistance). Our results show that even these small amounts of skin stretch lead to a statistically significant increase in perceived friction ({\\rm p} < 0.01). This significant finding will enable the hapticians to more realistically and accurately render friction via a combination of kinesthetic resistance and tactile feedback.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This research focuses on the relative importance of fingerpad skin stretch on the perception of friction. It is hypothesized that the perceived magnitude of friction rendered by traditional force feedback can be increased through the addition of fingertip skin stretch. Perceptual data are presented from two separate tests performed on nine male subjects. The first experiment determines the perceptual thresholds for friction based on a modified Karnopp friction model where friction is rendered as purely a kinesthetic resistance via a PHANToM force feedback device. JNDs of 0.056-0.150 corresponding to static coefficients for friction of \\mu_s = 0.2\\hbox{-}0.8 were established. The second experiment evaluates possible changes in the perceived friction magnitude due to imposing small amounts of tangential skin stretch (0.25-0.75 mm) to the fingerpad in combination with force feedback (kinesthetic resistance). Our results show that even these small amounts of skin stretch lead to a statistically significant increase in perceived friction ({\\rm p} < 0.01). This significant finding will enable the hapticians to more realistically and accurately render friction via a combination of kinesthetic resistance and tactile feedback.",
"title": "Fingerpad Skin Stretch Increases the Perception of Virtual Friction",
"normalizedTitle": "Fingerpad Skin Stretch Increases the Perception of Virtual Friction",
"fno": "tth2009040212",
"hasPdf": true,
"idPrefix": "th",
"keywords": [
"Tactile Display",
"Perception And Psychophysics",
"Haptic Rendering",
"Friction",
"Skin Stretch"
],
"authors": [
{
"givenName": "William R.",
"surname": "Provancher",
"fullName": "William R. Provancher",
"affiliation": "University of Utah, Salt Lake City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicholas D.",
"surname": "Sylvester",
"fullName": "Nicholas D. Sylvester",
"affiliation": "University of Utah, Salt Lake City and IM Flash Technology Corp., Lehi",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2009-10-01 00:00:00",
"pubType": "trans",
"pages": "212-223",
"year": "2009",
"issn": "1939-1412",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/whc/2007/2738/0/27380373",
"title": "Effects of Longitudinal Skin Stretch on the Perception of Friction",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2007/27380373/12OmNs0kyyj",
"parentPublication": {
"id": "proceedings/whc/2007/2738/0",
"title": "2007 2nd Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environments and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444675",
"title": "Skin nonlinearities and their effect on user perception for rotational skin stretch",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444675/12OmNwEJ0H8",
"parentPublication": {
"id": "proceedings/haptics/2010/6821/0",
"title": "2010 IEEE Haptics Symposium (Formerly known as Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/whc/2009/3858/0/04810804",
"title": "Communication of direction through lateral skin stretch at the fingertip",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2009/04810804/12OmNzxyiO3",
"parentPublication": {
"id": "proceedings/whc/2009/3858/0",
"title": "World Haptics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/03/tth2010030166",
"title": "Rotational Skin Stretch Feedback: A Wearable Haptic Display for Motion",
"doi": null,
"abstractUrl": "/journal/th/2010/03/tth2010030166/13rRUILtJr1",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2015/02/07027232",
"title": "Sensory Substitution and Augmentation Using 3-Degree-of-Freedom Skin Deformation Feedback",
"doi": null,
"abstractUrl": "/journal/th/2015/02/07027232/13rRUx0geA3",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/04/tth2010040297",
"title": "Design of a Fingertip-Mounted Tactile Display with Tangential Skin Displacement Feedback",
"doi": null,
"abstractUrl": "/journal/th/2010/04/tth2010040297/13rRUxASuhL",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/03/tth2010030177",
"title": "Perception of Direction for Applied Tangential Skin Displacement: Effects of Speed, Displacement, and Repetition",
"doi": null,
"abstractUrl": "/journal/th/2010/03/tth2010030177/13rRUxBa5xr",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2016/01/07377107",
"title": "Lower Extremity Lateral Skin Stretch Perception for Haptic Feedback",
"doi": null,
"abstractUrl": "/journal/th/2016/01/07377107/13rRUxDIthq",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2017/03/07862267",
"title": "Three-Dimensional Skin Deformation as Force Substitution: Wearable Device Design and Performance During Haptic Exploration of Virtual Environments",
"doi": null,
"abstractUrl": "/journal/th/2017/03/07862267/13rRUyfbwqU",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2014/02/06714450",
"title": "Planar Hand Motion Guidance Using Fingertip Skin-Stretch Feedback",
"doi": null,
"abstractUrl": "/journal/th/2014/02/06714450/13rRUzp02oB",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tth2009040200",
"articleId": "13rRUy0qnGr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tth2009040224",
"articleId": "13rRUyuvRoU",
"__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": "1JYZ6TXyjgk",
"doi": "10.1109/TVCG.2023.3235538",
"abstract": "For 3D animators, choreography with artificial intelligence has attracted more attention recently. However, most existing deep learning methods mainly rely on music for dance generation and lack sufficient control over generated dance motions. To address this issue, we introduce the idea of keyframe interpolation for music-driven dance generation and present a novel transition generation technique for choreography. Specifically, this technique synthesizes visually diverse and plausible dance motions by using normalizing flows to learn the probability distribution of dance motions conditioned on a piece of music and a sparse set of key poses. Thus, the generated dance motions respect both the input musical beats and the key poses. To achieve a robust transition of varying lengths between the key poses, we introduce a time embedding at each timestep as an additional condition. Extensive experiments show that our model generates more realistic, diverse, and beat-matching dance motions than the compared state-of-the-art methods, both qualitatively and quantitatively. Our experimental results demonstrate the superiority of the keyframe-based control for improving the diversity of the generated dance motions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For 3D animators, choreography with artificial intelligence has attracted more attention recently. However, most existing deep learning methods mainly rely on music for dance generation and lack sufficient control over generated dance motions. To address this issue, we introduce the idea of keyframe interpolation for music-driven dance generation and present a novel transition generation technique for choreography. Specifically, this technique synthesizes visually diverse and plausible dance motions by using normalizing flows to learn the probability distribution of dance motions conditioned on a piece of music and a sparse set of key poses. Thus, the generated dance motions respect both the input musical beats and the key poses. To achieve a robust transition of varying lengths between the key poses, we introduce a time embedding at each timestep as an additional condition. Extensive experiments show that our model generates more realistic, diverse, and beat-matching dance motions than the compared state-of-the-art methods, both qualitatively and quantitatively. Our experimental results demonstrate the superiority of the keyframe-based control for improving the diversity of the generated dance motions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For 3D animators, choreography with artificial intelligence has attracted more attention recently. However, most existing deep learning methods mainly rely on music for dance generation and lack sufficient control over generated dance motions. To address this issue, we introduce the idea of keyframe interpolation for music-driven dance generation and present a novel transition generation technique for choreography. Specifically, this technique synthesizes visually diverse and plausible dance motions by using normalizing flows to learn the probability distribution of dance motions conditioned on a piece of music and a sparse set of key poses. Thus, the generated dance motions respect both the input musical beats and the key poses. To achieve a robust transition of varying lengths between the key poses, we introduce a time embedding at each timestep as an additional condition. Extensive experiments show that our model generates more realistic, diverse, and beat-matching dance motions than the compared state-of-the-art methods, both qualitatively and quantitatively. Our experimental results demonstrate the superiority of the keyframe-based control for improving the diversity of the generated dance motions.",
"title": "Keyframe Control of Music-driven 3D Dance Generation",
"normalizedTitle": "Keyframe Control of Music-driven 3D Dance Generation",
"fno": "10018173",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Humanities",
"Animation",
"Three Dimensional Displays",
"Deep Learning",
"Probabilistic Logic",
"Interpolation",
"Task Analysis",
"3 D Animation",
"Generative Flows",
"Multi Modal",
"Music Driven",
"Choreography"
],
"authors": [
{
"givenName": "Zhipeng",
"surname": "Yang",
"fullName": "Zhipeng Yang",
"affiliation": "Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yu-Hui",
"surname": "Wen",
"fullName": "Yu-Hui Wen",
"affiliation": "CS Dept, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shu-Yu",
"surname": "Chen",
"fullName": "Shu-Yu Chen",
"affiliation": "Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiao",
"surname": "Liu",
"fullName": "Xiao Liu",
"affiliation": "Tomorrow Advancing Life Education Group, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuan",
"surname": "Gao",
"fullName": "Yuan Gao",
"affiliation": "Tomorrow Advancing Life Education Group, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yong-Jin",
"surname": "Liu",
"fullName": "Yong-Jin Liu",
"affiliation": "CS Dept, BNRist, Tsinghua University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lin",
"surname": "Gao",
"fullName": "Lin Gao",
"affiliation": "Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongbo",
"surname": "Fu",
"fullName": "Hongbo Fu",
"affiliation": "School of Creative Media, City 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-12",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cw/2015/9403/0/9403a200",
"title": "Automatic Composition by Body-Part Motion Synthesis for Supporting Dance Creation",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2015/9403a200/12OmNyOq55Y",
"parentPublication": {
"id": "proceedings/cw/2015/9403/0",
"title": "2015 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2014/4677/0/4677a253",
"title": "Sketch-Based Dance Choreography",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2014/4677a253/12OmNzaQoBR",
"parentPublication": {
"id": "proceedings/cw/2014/4677/0",
"title": "2014 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/03/ttg2012030501",
"title": "Example-Based Automatic Music-Driven Conventional Dance Motion Synthesis",
"doi": null,
"abstractUrl": "/journal/tg/2012/03/ttg2012030501/13rRUwwaKt6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200n3381",
"title": "AI Choreographer: Music Conditioned 3D Dance Generation with AIST++",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200n3381/1BmJ1TiWSB2",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09745335",
"title": "Rhythm is a Dancer: Music-Driven Motion Synthesis with Global Structure",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09745335/1CagHUR61pe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2022/6908/0/690800a104",
"title": "Prototype System of Dance Movement Creation by VR Experience of Augmented Human Body",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2022/690800a104/1FWn0mibOE0",
"parentPublication": {
"id": "proceedings/nicoint/2022/6908/0",
"title": "2022 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600l1040",
"title": "Bailando: 3D Dance Generation by Actor-Critic GPT with Choreographic Memory",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600l1040/1H1kphKCKPu",
"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/694600d480",
"title": "A Brand New Dance Partner: Music-Conditioned Pluralistic Dancing Controlled by Multiple Dance Genres",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600d480/1H1lISb1OjS",
"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/isaiam/2021/3260/0/326000a055",
"title": "AutoDance: Music Driven Dance Generation",
"doi": null,
"abstractUrl": "/proceedings-article/isaiam/2021/326000a055/1wiQVBNgFhe",
"parentPublication": {
"id": "proceedings/isaiam/2021/3260/0",
"title": "2021 International Symposium on Artificial Intelligence and its Application on Media (ISAIAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mipr/2021/1865/0/186500a348",
"title": "Dance to Music: Generative Choreography with Music using Mixture Density Networks",
"doi": null,
"abstractUrl": "/proceedings-article/mipr/2021/186500a348/1xPslGYA8Gk",
"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": "10015807",
"articleId": "1JSl47Z1P7q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10018537",
"articleId": "1K0DFSXIg5W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1K0DFltTHS8",
"name": "ttg555501-010018173s1-supp1-3235538.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010018173s1-supp1-3235538.mp4",
"extension": "mp4",
"size": "78.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCaLEju",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzp02oy",
"doi": "10.1109/TVCG.2017.2745941",
"abstract": "We report on a controlled user study comparing three visualization environments for common 3D exploration. Our environments differ in how they exploit natural human perception and interaction capabilities. We compare an augmented-reality head-mounted display (Microsoft HoloLens), a handheld tablet, and a desktop setup. The novel head-mounted HoloLens display projects stereoscopic images of virtual content into a user's real world and allows for interaction in-situ at the spatial position of the 3D hologram. The tablet is able to interact with 3D content through touch, spatial positioning, and tangible markers, however, 3D content is still presented on a 2D surface. Our hypothesis is that visualization environments that match human perceptual and interaction capabilities better to the task at hand improve understanding of 3D visualizations. To better understand the space of display and interaction modalities in visualization environments, we first propose a classification based on three dimensions: perception, interaction, and the spatial and cognitive proximity of the two. Each technique in our study is located at a different position along these three dimensions. We asked 15 participants to perform four tasks, each task having different levels of difficulty for both spatial perception and degrees of freedom for interaction. Our results show that each of the tested environments is more effective for certain tasks, but that generally the desktop environment is still fastest and most precise in almost all cases.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We report on a controlled user study comparing three visualization environments for common 3D exploration. Our environments differ in how they exploit natural human perception and interaction capabilities. We compare an augmented-reality head-mounted display (Microsoft HoloLens), a handheld tablet, and a desktop setup. The novel head-mounted HoloLens display projects stereoscopic images of virtual content into a user's real world and allows for interaction in-situ at the spatial position of the 3D hologram. The tablet is able to interact with 3D content through touch, spatial positioning, and tangible markers, however, 3D content is still presented on a 2D surface. Our hypothesis is that visualization environments that match human perceptual and interaction capabilities better to the task at hand improve understanding of 3D visualizations. To better understand the space of display and interaction modalities in visualization environments, we first propose a classification based on three dimensions: perception, interaction, and the spatial and cognitive proximity of the two. Each technique in our study is located at a different position along these three dimensions. We asked 15 participants to perform four tasks, each task having different levels of difficulty for both spatial perception and degrees of freedom for interaction. Our results show that each of the tested environments is more effective for certain tasks, but that generally the desktop environment is still fastest and most precise in almost all cases.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We report on a controlled user study comparing three visualization environments for common 3D exploration. Our environments differ in how they exploit natural human perception and interaction capabilities. We compare an augmented-reality head-mounted display (Microsoft HoloLens), a handheld tablet, and a desktop setup. The novel head-mounted HoloLens display projects stereoscopic images of virtual content into a user's real world and allows for interaction in-situ at the spatial position of the 3D hologram. The tablet is able to interact with 3D content through touch, spatial positioning, and tangible markers, however, 3D content is still presented on a 2D surface. Our hypothesis is that visualization environments that match human perceptual and interaction capabilities better to the task at hand improve understanding of 3D visualizations. To better understand the space of display and interaction modalities in visualization environments, we first propose a classification based on three dimensions: perception, interaction, and the spatial and cognitive proximity of the two. Each technique in our study is located at a different position along these three dimensions. We asked 15 participants to perform four tasks, each task having different levels of difficulty for both spatial perception and degrees of freedom for interaction. Our results show that each of the tested environments is more effective for certain tasks, but that generally the desktop environment is still fastest and most precise in almost all cases.",
"title": "The Hologram in My Hand: How Effective is Interactive Exploration of 3D Visualizations in Immersive Tangible Augmented Reality?",
"normalizedTitle": "The Hologram in My Hand: How Effective is Interactive Exploration of 3D Visualizations in Immersive Tangible Augmented Reality?",
"fno": "08019876",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Data Visualization",
"Two Dimensional Displays",
"Augmented Reality",
"Stereo Image Processing",
"Visualization",
"Mice",
"Augmented Reality",
"3 D Interaction",
"User Study",
"Immersive Displays"
],
"authors": [
{
"givenName": "Benjamin",
"surname": "Bach",
"fullName": "Benjamin Bach",
"affiliation": "Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronell",
"surname": "Sicat",
"fullName": "Ronell Sicat",
"affiliation": "Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Johanna",
"surname": "Beyer",
"fullName": "Johanna Beyer",
"affiliation": "Harvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maxime",
"surname": "Cordeil",
"fullName": "Maxime Cordeil",
"affiliation": "Monash University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "Harvard University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "457-467",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/svr/2017/3588/0/3588a169",
"title": "An Immersive Visualization Study on Molecules Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2017/3588a169/12OmNApcubh",
"parentPublication": {
"id": "proceedings/svr/2017/3588/0",
"title": "2017 19th Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2012/1204/0/06184195",
"title": "Comparison of a two-handed interface to a wand interface and a mouse interface for fundamental 3D tasks",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2012/06184195/12OmNwIHow8",
"parentPublication": {
"id": "proceedings/3dui/2012/1204/0",
"title": "2012 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2014/3624/0/06798842",
"title": "HybridSpace: Integrating 3D freehand input and stereo viewing into traditional desktop applications",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2014/06798842/12OmNyUnEGq",
"parentPublication": {
"id": "proceedings/3dui/2014/3624/0",
"title": "2014 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2015/7343/0/07314295",
"title": "Hybrid-Dimensional Visualization and Interaction - Integrating 2D and 3D Visualization with Semi-Immersive Navigation Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2015/07314295/12OmNzBOi7E",
"parentPublication": {
"id": "proceedings/bdva/2015/7343/0",
"title": "2015 Big Data Visual Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/07/07390081",
"title": "A Study of Layout, Rendering, and Interaction Methods for Immersive Graph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/07/07390081/13rRUxly8XJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a258",
"title": "Layouts of 3D Data Visualizations Small Multiples around Users in Immersive Environments",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a258/1J7WxzHZHry",
"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/2022/5325/0/532500a460",
"title": "Selection Techniques for 3D Extended Desktop Workstation with AR HMD",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2022/532500a460/1JrR6BnYp6U",
"parentPublication": {
"id": "proceedings/ismar/2022/5325/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10024310",
"title": "Path Tracing in 2D, 3D, and Physicalized Networks",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10024310/1KaBaMU2Iog",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797869",
"title": "Feel the Globe: Enhancing the Perception of Immersive Spherical Visualizations with Tangible Proxies",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797869/1cJ0LTyanRu",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797887",
"title": "Sphere in Hand: Exploring Tangible Interaction with Immersive Spherical Visualizations",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797887/1cJ15YywtBS",
"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": "08017624",
"articleId": "13rRUIM2VH5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017651",
"articleId": "13rRUNvyaf7",
"__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": "1oDXGKprxPG",
"doi": "10.1109/TVCG.2020.3037226",
"abstract": "In this contribution we consider the visualization of global, deep Earth volume datasets for display and researcher interaction. While the algorithms and data analysis techniques that produce such volumetric results have become more sophisticated, the manner of visualizing these findings can be improved. We address the challenge of making an illustrative, exploratory visualization of a global geoscience dataset using a combined seismic tomography result, the primary means by which geoscientists infer structure and process in the deep Earth. We present a novel, interactive graphical application suite and associated workflow that uses an intuitive 2.5D layer compositing approach. This allows the user to adjust the separation between data-slices, control graphics variables such as color mapping, opacity and compositing, and facilitate exploration and annotation of the architecture of the lithosphere. Graphics outputs from our applications are enabled for immersive systems such as dome displays. In a case study we visualize the deep Earth structure beneath the Indian Ocean region. We anticipate that the application methodology will find use in the visualization of multiple datasets representing aspects of the Earth's deep interior and atmosphere, and in the interaction with the increasing number of rich datasets from missions to our neighboring planets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this contribution we consider the visualization of global, deep Earth volume datasets for display and researcher interaction. While the algorithms and data analysis techniques that produce such volumetric results have become more sophisticated, the manner of visualizing these findings can be improved. We address the challenge of making an illustrative, exploratory visualization of a global geoscience dataset using a combined seismic tomography result, the primary means by which geoscientists infer structure and process in the deep Earth. We present a novel, interactive graphical application suite and associated workflow that uses an intuitive 2.5D layer compositing approach. This allows the user to adjust the separation between data-slices, control graphics variables such as color mapping, opacity and compositing, and facilitate exploration and annotation of the architecture of the lithosphere. Graphics outputs from our applications are enabled for immersive systems such as dome displays. In a case study we visualize the deep Earth structure beneath the Indian Ocean region. We anticipate that the application methodology will find use in the visualization of multiple datasets representing aspects of the Earth's deep interior and atmosphere, and in the interaction with the increasing number of rich datasets from missions to our neighboring planets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this contribution we consider the visualization of global, deep Earth volume datasets for display and researcher interaction. While the algorithms and data analysis techniques that produce such volumetric results have become more sophisticated, the manner of visualizing these findings can be improved. We address the challenge of making an illustrative, exploratory visualization of a global geoscience dataset using a combined seismic tomography result, the primary means by which geoscientists infer structure and process in the deep Earth. We present a novel, interactive graphical application suite and associated workflow that uses an intuitive 2.5D layer compositing approach. This allows the user to adjust the separation between data-slices, control graphics variables such as color mapping, opacity and compositing, and facilitate exploration and annotation of the architecture of the lithosphere. Graphics outputs from our applications are enabled for immersive systems such as dome displays. In a case study we visualize the deep Earth structure beneath the Indian Ocean region. We anticipate that the application methodology will find use in the visualization of multiple datasets representing aspects of the Earth's deep interior and atmosphere, and in the interaction with the increasing number of rich datasets from missions to our neighboring planets.",
"title": "Exploratory Volumetric Deep Earth Visualization by 2.5D Interactive Compositing",
"normalizedTitle": "Exploratory Volumetric Deep Earth Visualization by 2.5D Interactive Compositing",
"fno": "09253688",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Earth Mantle",
"Geophysical Prospecting",
"Geophysics Computing",
"Seismology",
"Global Geoscience Dataset",
"Combined Seismic Tomography Result",
"Interactive Graphical Application Suite",
"2 5 D Layer Compositing Approach",
"Data Slices",
"Control Graphics Variables",
"Opacity",
"Dome Displays",
"Deep Earth Structure",
"Multiple Datasets",
"Atmosphere",
"Rich Datasets",
"Exploratory Volumetric Deep Earth Visualization",
"2 5 D Interactive Compositing",
"Global Earth Volume Datasets",
"Deep Earth Volume Datasets",
"Researcher Interaction",
"Data Analysis Techniques",
"Volumetric Results",
"Illustrative Visualization",
"Exploratory Visualization",
"Data Visualization",
"Earth",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Rendering Computer Graphics",
"Image Color Analysis",
"Solid Modeling",
"Color Mapping",
"Interactive Visualization",
"Seismic Tomography",
"Solid Earth Geophysics",
"Volume Visualization"
],
"authors": [
{
"givenName": "Peter E.",
"surname": "Morse",
"fullName": "Peter E. Morse",
"affiliation": "Department of Earth Sciences, Private Bag 79, University of Tasmania, Hobart, TAS, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anya M.",
"surname": "Reading",
"fullName": "Anya M. Reading",
"affiliation": "Department of Physics, Private Bag 37, University of Tasmania, Hobart, TAS, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Stål",
"fullName": "Tobias Stål",
"affiliation": "Department of Earth Sciences and the Institute for Marine and Antarctic Studies, Private Bag 79, University of Tasmania, Hobart, TAS, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2022-07-01 00:00:00",
"pubType": "trans",
"pages": "2641-2653",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pma/2009/3988/0/3988a445",
"title": "Landscape Visualization on Google Earth",
"doi": null,
"abstractUrl": "/proceedings-article/pma/2009/3988a445/12OmNAoDhYv",
"parentPublication": {
"id": "proceedings/pma/2009/3988/0",
"title": "Plant Growth Modeling and Applications, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pvg/2003/2091/0/20910006",
"title": "SLIC: Scheduled Linear Image Compositing for Parallel Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/pvg/2003/20910006/12OmNCdBDUq",
"parentPublication": {
"id": "proceedings/pvg/2003/2091/0",
"title": "Parallel and Large-Data Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pvgs/2003/8122/0/01249040",
"title": "SLIC: scheduled linear image compositing for parallel volume rendering",
"doi": null,
"abstractUrl": "/proceedings-article/pvgs/2003/01249040/12OmNrIrPk2",
"parentPublication": {
"id": "proceedings/pvgs/2003/8122/0",
"title": "IEEE Symposium on Parallel and Large-Data Visualization and Graphics 2003",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smap/2011/4524/0/4524a068",
"title": "EVISUGE: Event Visualization on Google Earth",
"doi": null,
"abstractUrl": "/proceedings-article/smap/2011/4524a068/12OmNwwMeXy",
"parentPublication": {
"id": "proceedings/smap/2011/4524/0",
"title": "Semantic Media Adaptation and Personalization, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2017/0831/0/0831a164",
"title": "Mixed-Projection Treemaps: A Novel Approach Mixing 2D and 2.5D Treemaps",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2017/0831a164/12OmNxWLTmv",
"parentPublication": {
"id": "proceedings/iv/2017/0831/0",
"title": "2017 21st International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2008/2835/0/05219060",
"title": "Massively parallel volume rendering using 2–3 swap image compositing",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2008/05219060/12OmNzn38PY",
"parentPublication": {
"id": "proceedings/sc/2008/2835/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/04/v0798",
"title": "NPU-Based Image Compositing in a Distributed Visualization System",
"doi": null,
"abstractUrl": "/journal/tg/2007/04/v0798/13rRUwI5U2x",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccgiv/2022/9250/0/925000a183",
"title": "Ellipsoidal ray casting algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccgiv/2022/925000a183/1LxfqGjszTi",
"parentPublication": {
"id": "proceedings/iccgiv/2022/9250/0",
"title": "2022 2nd International Conference on Computer Graphics, Image and Virtualization (ICCGIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2022/7729/0/10092236",
"title": "A comparison of features Synthetic WAMI and GES of the same location",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2022/10092236/1MepMt0x7cA",
"parentPublication": {
"id": "proceedings/aipr/2022/7729/0",
"title": "2022 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/clei/2018/0437/0/043700a612",
"title": "Multiple-Volume Volumetric Rendering Using Graphic Accelerator",
"doi": null,
"abstractUrl": "/proceedings-article/clei/2018/043700a612/1cdP4WszOq4",
"parentPublication": {
"id": "proceedings/clei/2018/0437/0",
"title": "2018 XLIV Latin American Computer Conference (CLEI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09257096",
"articleId": "1oFCDuG0ysg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09264699",
"articleId": "1oSTZCzu3YI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1DGS1ELsnyo",
"name": "ttg202207-09253688s1-supp3-3037226.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202207-09253688s1-supp3-3037226.mp4",
"extension": "mp4",
"size": "86.1 MB",
"__typename": "WebExtraType"
},
{
"id": "1DGS2IzgY5G",
"name": "ttg202207-09253688s1-supp2-3037226.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202207-09253688s1-supp2-3037226.mp4",
"extension": "mp4",
"size": "86.1 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": "13rRUIJcWln",
"doi": "10.1109/TVCG.2012.132",
"abstract": "We propose a novel technique that allows one to conserve energy using the time integration scheme of one's choice. Traditionally, the time integration methods that deal with energy conservation, such as symplectic, geometric, and variational integrators, have aimed to include damping in a manner independent of the size of the time step, stating that this gives more control over the look and feel of the simulation. Generally speaking, damping adds to the overall aesthetics and appeal of a numerical simulation, especially since it damps out the high frequency oscillations that occur on the level of the discretization mesh. We propose an alternative technique that allows one to use damping as a material parameter to obtain the desired look and feel of a numerical simulation, while still exactly conserving the total energy-in stark contrast to previous methods in which adding damping effects necessarily removes energy from the mesh. This allows, for example, a deformable bouncing ball with aesthetically pleasing damping (and even undergoing collision) to collide with the ground and return to its original height exactly conserving energy, as shown in Fig. 2. Furthermore, since our method works with any time integration scheme, the user can choose their favorite time integration method with regards to aesthetics and simply apply our method as a postprocess to conserve all or as much of the energy as desired.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a novel technique that allows one to conserve energy using the time integration scheme of one's choice. Traditionally, the time integration methods that deal with energy conservation, such as symplectic, geometric, and variational integrators, have aimed to include damping in a manner independent of the size of the time step, stating that this gives more control over the look and feel of the simulation. Generally speaking, damping adds to the overall aesthetics and appeal of a numerical simulation, especially since it damps out the high frequency oscillations that occur on the level of the discretization mesh. We propose an alternative technique that allows one to use damping as a material parameter to obtain the desired look and feel of a numerical simulation, while still exactly conserving the total energy-in stark contrast to previous methods in which adding damping effects necessarily removes energy from the mesh. This allows, for example, a deformable bouncing ball with aesthetically pleasing damping (and even undergoing collision) to collide with the ground and return to its original height exactly conserving energy, as shown in Fig. 2. Furthermore, since our method works with any time integration scheme, the user can choose their favorite time integration method with regards to aesthetics and simply apply our method as a postprocess to conserve all or as much of the energy as desired.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a novel technique that allows one to conserve energy using the time integration scheme of one's choice. Traditionally, the time integration methods that deal with energy conservation, such as symplectic, geometric, and variational integrators, have aimed to include damping in a manner independent of the size of the time step, stating that this gives more control over the look and feel of the simulation. Generally speaking, damping adds to the overall aesthetics and appeal of a numerical simulation, especially since it damps out the high frequency oscillations that occur on the level of the discretization mesh. We propose an alternative technique that allows one to use damping as a material parameter to obtain the desired look and feel of a numerical simulation, while still exactly conserving the total energy-in stark contrast to previous methods in which adding damping effects necessarily removes energy from the mesh. This allows, for example, a deformable bouncing ball with aesthetically pleasing damping (and even undergoing collision) to collide with the ground and return to its original height exactly conserving energy, as shown in Fig. 2. Furthermore, since our method works with any time integration scheme, the user can choose their favorite time integration method with regards to aesthetics and simply apply our method as a postprocess to conserve all or as much of the energy as desired.",
"title": "Energy Conservation for the Simulation of Deformable Bodies",
"normalizedTitle": "Energy Conservation for the Simulation of Deformable Bodies",
"fno": "ttg2013020189",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Numerical Analysis",
"Computer Graphics",
"Digital Simulation",
"Energy Conservation",
"Mesh Generation",
"Deformable Bouncing Ball",
"Energy Conservation",
"Deformable Body Simulation",
"Time Integration Scheme",
"Symplectic Integrator",
"Geometric Integrator",
"Variational Integrators",
"Numerical Simulation",
"High Frequency Oscillations",
"Discretization Mesh",
"Damping Effects",
"Springs",
"Damping",
"Equations",
"Energy Conservation",
"Mathematical Model",
"Gravity",
"Physically Based Modeling",
"Computer Graphics"
],
"authors": [
{
"givenName": "J.",
"surname": "Su",
"fullName": "J. Su",
"affiliation": "Comput. Sci. Dept., Stanford Univ., Stanford, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Sheth",
"fullName": "R. Sheth",
"affiliation": "Comput. Sci. Dept., Stanford Univ., Stanford, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "R.",
"surname": "Fedkiw",
"fullName": "R. Fedkiw",
"affiliation": "Comput. Sci. Dept., Stanford Univ., Stanford, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2013-02-01 00:00:00",
"pubType": "trans",
"pages": "189-200",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icee/2010/3997/0/3997d586",
"title": "A Study on Energy Management Contracting Pattern in Existing Building Energy Conservation",
"doi": null,
"abstractUrl": "/proceedings-article/icee/2010/3997d586/12OmNAle6ZT",
"parentPublication": {
"id": "proceedings/icee/2010/3997/0",
"title": "International Conference on E-Business and E-Government",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mncapps/2012/4720/0/4720a001",
"title": "Energy conservation in wireless communication systems with relays",
"doi": null,
"abstractUrl": "/proceedings-article/mncapps/2012/4720a001/12OmNBW0vDj",
"parentPublication": {
"id": "proceedings/mncapps/2012/4720/0",
"title": "2012 International Conference on Advances in Mobile Network, Communication and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sustainit/2017/99/0/08379794",
"title": "The energy piggy bank — A serious game for energy conservation",
"doi": null,
"abstractUrl": "/proceedings-article/sustainit/2017/08379794/12OmNBuL1mt",
"parentPublication": {
"id": "proceedings/sustainit/2017/99/0",
"title": "2017 Sustainable Internet and ICT for Sustainability (SustainIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccet/2009/3521/2/3521b548",
"title": "Energy Conservation Diagnosis Based on Neural Network and Statistical Computing",
"doi": null,
"abstractUrl": "/proceedings-article/iccet/2009/3521b548/12OmNC8dgj3",
"parentPublication": {
"id": "proceedings/iccet/2009/3521/1",
"title": "Computer Engineering and Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc/2012/4843/0/4843a906",
"title": "GreenTech: A Case Study for Using the Web of Things in Household Energy Conservation",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc/2012/4843a906/12OmNqIzh4B",
"parentPublication": {
"id": "proceedings/uic-atc/2012/4843/0",
"title": "Ubiquitous, Autonomic and Trusted Computing, Symposia and Workshops on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfn/2010/3940/0/3940a299",
"title": "A Wireless Sensor Network Based Green Marketplace for Electrical Appliances",
"doi": null,
"abstractUrl": "/proceedings-article/icfn/2010/3940a299/12OmNs0TKUZ",
"parentPublication": {
"id": "proceedings/icfn/2010/3940/0",
"title": "Future Networks, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2010/4279/3/4279c656",
"title": "Use TBEC Software to Calculate and Analyze the Building Energy Conservation",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2010/4279c656/12OmNwcCIWc",
"parentPublication": {
"id": "proceedings/iciii/2010/4279/3",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013b258",
"title": "Study on Elastic SDOF System Viscous Damping Coefficient Based on Energy Balance Principle",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013b258/12OmNxwncsU",
"parentPublication": {
"id": "proceedings/icisce/2017/3013/0",
"title": "2017 4th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/greencom-cpscom/2010/4331/0/4331a155",
"title": "Analysis of Parallel Algorithms for Energy Conservation with GPU",
"doi": null,
"abstractUrl": "/proceedings-article/greencom-cpscom/2010/4331a155/12OmNzTH11F",
"parentPublication": {
"id": "proceedings/greencom-cpscom/2010/4331/0",
"title": "IEEE-ACM International Conference on Green Computing and Communications and International Conference on Cyber, Physical and Social Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/08/08399552",
"title": "Average Vector Field Integration for St. Venant-Kirchhoff Deformable Models",
"doi": null,
"abstractUrl": "/journal/tg/2019/08/08399552/13rRUxCitJm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013020178",
"articleId": "13rRUxAAST8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013020201",
"articleId": "13rRUxNEqPQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRPP",
"name": "ttg2013020189s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013020189s.mp4",
"extension": "mp4",
"size": "40.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC0PGNr",
"title": "January-March",
"year": "1997",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "3",
"label": "January-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuMt",
"doi": "10.1109/2945.582343",
"abstract": "Abstract—This paper presents a general approach for designing and animating complex deformable models with implicit surfaces. Implicit surfaces are introduced as an extra layer coating any kind of structure that moves and deforms over time. Offering a compact definition of a smooth surface around an object, they provide an efficient collision detection mechanism. The implicit layer deforms in order to generate exact contact surfaces between colliding bodies. A simple physically based model approximating elastic behavior is then used for computing collision response. The implicit formulation also eases the control of the object's volume with a new method based on local controllers.We present two different applications that illustrate the benefits of these techniques. First, the animation of simple characters made of articulated skeletons coated with implicit flesh exploits the compactness and enhanced control of the model. The second builds on the specific properties of implicit surfaces for modeling soft inelastic substances capable of separation and fusion that maintain a constant volume when animated.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper presents a general approach for designing and animating complex deformable models with implicit surfaces. Implicit surfaces are introduced as an extra layer coating any kind of structure that moves and deforms over time. Offering a compact definition of a smooth surface around an object, they provide an efficient collision detection mechanism. The implicit layer deforms in order to generate exact contact surfaces between colliding bodies. A simple physically based model approximating elastic behavior is then used for computing collision response. The implicit formulation also eases the control of the object's volume with a new method based on local controllers.We present two different applications that illustrate the benefits of these techniques. First, the animation of simple characters made of articulated skeletons coated with implicit flesh exploits the compactness and enhanced control of the model. The second builds on the specific properties of implicit surfaces for modeling soft inelastic substances capable of separation and fusion that maintain a constant volume when animated.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper presents a general approach for designing and animating complex deformable models with implicit surfaces. Implicit surfaces are introduced as an extra layer coating any kind of structure that moves and deforms over time. Offering a compact definition of a smooth surface around an object, they provide an efficient collision detection mechanism. The implicit layer deforms in order to generate exact contact surfaces between colliding bodies. A simple physically based model approximating elastic behavior is then used for computing collision response. The implicit formulation also eases the control of the object's volume with a new method based on local controllers.We present two different applications that illustrate the benefits of these techniques. First, the animation of simple characters made of articulated skeletons coated with implicit flesh exploits the compactness and enhanced control of the model. The second builds on the specific properties of implicit surfaces for modeling soft inelastic substances capable of separation and fusion that maintain a constant volume when animated.",
"title": "Animation of Deformable Models Using Implicit Surfaces",
"normalizedTitle": "Animation of Deformable Models Using Implicit Surfaces",
"fno": "v0039",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Animation",
"Implicit Surfaces",
"Deformable Models",
"Collision Detection",
"Collision Response",
"Inelasticity"
],
"authors": [
{
"givenName": "Marie-Paule",
"surname": "Cani-Gascuel",
"fullName": "Marie-Paule Cani-Gascuel",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mathieu",
"surname": "Desbrun",
"fullName": "Mathieu Desbrun",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1997-01-01 00:00:00",
"pubType": "trans",
"pages": "39-50",
"year": "1997",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0023",
"articleId": "13rRUy2YLST",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0051",
"articleId": "13rRUyYSWkR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzd7bIN",
"title": "March",
"year": "2012",
"issueNum": "01",
"idPrefix": "ci",
"pubType": "journal",
"volume": "4",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhpBGJ",
"doi": "10.1109/TCIAIG.2012.2186810",
"abstract": "Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work.",
"title": "A Survey of Monte Carlo Tree Search Methods",
"normalizedTitle": "A Survey of Monte Carlo Tree Search Methods",
"fno": "06145622",
"hasPdf": true,
"idPrefix": "ci",
"keywords": [
"Game Theory",
"Monte Carlo Methods",
"Tree Searching",
"Monte Carlo Tree Search Methods",
"Random Sampling Generality",
"Computer Go",
"MCTS Research",
"Key Game",
"Nongame Domains",
"Games",
"Monte Carlo Methods",
"Artificial Intelligence",
"Game Theory",
"Computers",
"Markov Processes",
"Decision Theory",
"Artificial Intelligence AI",
"Bandit Based Methods",
"Computer Go",
"Game Search",
"Monte Carlo Tree Search MCTS",
"Upper Confidence Bounds UCB",
"Upper Confidence Bounds For Trees UCT"
],
"authors": [
{
"givenName": "Cameron B.",
"surname": "Browne",
"fullName": "Cameron B. Browne",
"affiliation": "Department of Computing, Imperial College London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Edward",
"surname": "Powley",
"fullName": "Edward Powley",
"affiliation": "School of Computing, Informatics and Media, University of Bradford, Bradford, West Yorkshire, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Whitehouse",
"fullName": "Daniel Whitehouse",
"affiliation": "School of Computing, Informatics and Media, University of Bradford, Bradford, West Yorkshire, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon M.",
"surname": "Lucas",
"fullName": "Simon M. Lucas",
"affiliation": "School of Computer Science and Electronic Engineering, University of Essex, Colchester, Essex, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter I.",
"surname": "Cowling",
"fullName": "Peter I. Cowling",
"affiliation": "School of Computing, Informatics and Media, University of Bradford, Bradford, West Yorkshire, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Philipp",
"surname": "Rohlfshagen",
"fullName": "Philipp Rohlfshagen",
"affiliation": "School of Computer Science and Electronic Engineering, University of Essex, Colchester, Essex, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stephen",
"surname": "Tavener",
"fullName": "Stephen Tavener",
"affiliation": "Department of Computing, Imperial College London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Diego",
"surname": "Perez",
"fullName": "Diego Perez",
"affiliation": "School of Computer Science and Electronic Engineering, University of Essex, Colchester, Essex, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Spyridon",
"surname": "Samothrakis",
"fullName": "Spyridon Samothrakis",
"affiliation": "School of Computer Science and Electronic Engineering, University of Essex, Colchester, Essex, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Colton",
"fullName": "Simon Colton",
"affiliation": "Department of Computing, Imperial College London, London, U.K.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2012-01-01 00:00:00",
"pubType": "trans",
"pages": "1-43",
"year": "2012",
"issn": "1943-068X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ictai/2014/6572/0/6572a997",
"title": "Knowledge Complement for Monte Carlo Tree Search: An Application to Combinatorial Games",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a997/12OmNxzMnWd",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sustainit/2015/8270/0/07101360",
"title": "Collaborative, parallel Monte Carlo Tree Search for autonomous electricity demand management",
"doi": null,
"abstractUrl": "/proceedings-article/sustainit/2015/07101360/12OmNyrqznQ",
"parentPublication": {
"id": "proceedings/sustainit/2015/8270/0",
"title": "2015 Sustainable Internet and ICT for Sustainability (SustainIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013a545",
"title": "Point-Based Incremental Pruning for Monte-Carlo Tree Search",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013a545/12OmNyvoXg0",
"parentPublication": {
"id": "proceedings/icisce/2017/3013/0",
"title": "2017 4th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/02/06203567",
"title": "Information Set Monte Carlo Tree Search",
"doi": null,
"abstractUrl": "/journal/ci/2012/02/06203567/13rRUB7a1io",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2011/02/05740585",
"title": "Two-Stage Monte Carlo Tree Search for Connect6",
"doi": null,
"abstractUrl": "/journal/ci/2011/02/05740585/13rRUx0ge8t",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2013/04/06468079",
"title": "Incentive Learning in Monte Carlo Tree Search",
"doi": null,
"abstractUrl": "/journal/ci/2013/04/06468079/13rRUxDqSb5",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icss/2022/9861/0/986100a241",
"title": "Game difficulty prediction algorithm based on improved Monte Carlo tree",
"doi": null,
"abstractUrl": "/proceedings-article/icss/2022/986100a241/1G6jDApSSDm",
"parentPublication": {
"id": "proceedings/icss/2022/9861/0",
"title": "2022 International Conference on Service Science (ICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fpl/2022/7390/0/739000a176",
"title": "Accelerating Monte-Carlo Tree Search on CPU-FPGA Heterogeneous Platform",
"doi": null,
"abstractUrl": "/proceedings-article/fpl/2022/739000a176/1KJwHttuiYM",
"parentPublication": {
"id": "proceedings/fpl/2022/7390/0",
"title": "2022 32nd International Conference on Field-Programmable Logic and Applications (FPL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2019/4194/0/419400a048",
"title": "Monte-Carlo Tree Search and Reinforcement Learning for Reconfiguring Data Stream Processing on Edge Computing",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2019/419400a048/1fHkqW3V7tS",
"parentPublication": {
"id": "proceedings/sbac-pad/2019/4194/0",
"title": "2019 31st International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09580584",
"title": "A-MCTS: Adaptive Monte Carlo Tree Search for Temporal Path Discovery",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09580584/1xPnZKw8LDi",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06169182",
"articleId": "13rRUxbCblf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06129491",
"articleId": "13rRUyYBljl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxUv6hw",
"title": "Dec.",
"year": "2013",
"issueNum": "04",
"idPrefix": "ci",
"pubType": "journal",
"volume": "5",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDqSb5",
"doi": "10.1109/TCIAIG.2013.2248086",
"abstract": "Monte Carlo tree search (MCTS) is a search paradigm that has been remarkably successful in computer games like Go. It uses Monte Carlo simulation to evaluate the values of nodes in a search tree. The node values are then used to select the actions during subsequent simulations. The performance of MCTS heavily depends on the quality of its default policy, which guides the simulations beyond the search tree. In this paper, we propose an MCTS improvement, called incentive learning, which learns the default policy online. This new default policy learning scheme is based on ideas from combinatorial game theory, and hence is particularly useful when the underlying game is a sum of games. To illustrate the efficiency of incentive learning, we describe a game named Heap-Go and present experimental results on the game.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Monte Carlo tree search (MCTS) is a search paradigm that has been remarkably successful in computer games like Go. It uses Monte Carlo simulation to evaluate the values of nodes in a search tree. The node values are then used to select the actions during subsequent simulations. The performance of MCTS heavily depends on the quality of its default policy, which guides the simulations beyond the search tree. In this paper, we propose an MCTS improvement, called incentive learning, which learns the default policy online. This new default policy learning scheme is based on ideas from combinatorial game theory, and hence is particularly useful when the underlying game is a sum of games. To illustrate the efficiency of incentive learning, we describe a game named Heap-Go and present experimental results on the game.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Monte Carlo tree search (MCTS) is a search paradigm that has been remarkably successful in computer games like Go. It uses Monte Carlo simulation to evaluate the values of nodes in a search tree. The node values are then used to select the actions during subsequent simulations. The performance of MCTS heavily depends on the quality of its default policy, which guides the simulations beyond the search tree. In this paper, we propose an MCTS improvement, called incentive learning, which learns the default policy online. This new default policy learning scheme is based on ideas from combinatorial game theory, and hence is particularly useful when the underlying game is a sum of games. To illustrate the efficiency of incentive learning, we describe a game named Heap-Go and present experimental results on the game.",
"title": "Incentive Learning in Monte Carlo Tree Search",
"normalizedTitle": "Incentive Learning in Monte Carlo Tree Search",
"fno": "06468079",
"hasPdf": true,
"idPrefix": "ci",
"keywords": [
"Learning Artificial Intelligence",
"Monte Carlo Methods",
"Tree Searching",
"Combinatorial Game Theory",
"Policy Learning",
"Policy Online",
"Node Values",
"Search Tree",
"Monte Carlo Simulation",
"Computer Games",
"MCTS",
"Monte Carlo Tree Search",
"Incentive Learning",
"Games",
"Temperature Measurement",
"Radiation Detectors",
"Game Theory",
"Monte Carlo Methods",
"Size Measurement",
"Computers",
"Artificial Intelligence",
"Combinatorial Games",
"Computational Intelligence",
"Computer Games",
"Reinforcement Learning"
],
"authors": [
{
"givenName": "Kuo-Yuan",
"surname": "Kao",
"fullName": "Kuo-Yuan Kao",
"affiliation": "Department of Information Management, National Penghu University, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "I-Chen",
"surname": "Wu",
"fullName": "I-Chen Wu",
"affiliation": "Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shi-Jim",
"surname": "Yen",
"fullName": "Shi-Jim Yen",
"affiliation": "Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yi-Chang",
"surname": "Shan",
"fullName": "Yi-Chang Shan",
"affiliation": "Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2013-10-01 00:00:00",
"pubType": "trans",
"pages": "346-352",
"year": "2013",
"issn": "1943-068X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ictai/2014/6572/0/6572a997",
"title": "Knowledge Complement for Monte Carlo Tree Search: An Application to Combinatorial Games",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a997/12OmNxzMnWd",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sustainit/2015/8270/0/07101360",
"title": "Collaborative, parallel Monte Carlo Tree Search for autonomous electricity demand management",
"doi": null,
"abstractUrl": "/proceedings-article/sustainit/2015/07101360/12OmNyrqznQ",
"parentPublication": {
"id": "proceedings/sustainit/2015/8270/0",
"title": "2015 Sustainable Internet and ICT for Sustainability (SustainIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013a545",
"title": "Point-Based Incremental Pruning for Monte-Carlo Tree Search",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013a545/12OmNyvoXg0",
"parentPublication": {
"id": "proceedings/icisce/2017/3013/0",
"title": "2017 4th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/02/06203567",
"title": "Information Set Monte Carlo Tree Search",
"doi": null,
"abstractUrl": "/journal/ci/2012/02/06203567/13rRUB7a1io",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/01/06145622",
"title": "A Survey of Monte Carlo Tree Search Methods",
"doi": null,
"abstractUrl": "/journal/ci/2012/01/06145622/13rRUwhpBGJ",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2011/02/05740585",
"title": "Two-Stage Monte Carlo Tree Search for Connect6",
"doi": null,
"abstractUrl": "/journal/ci/2011/02/05740585/13rRUx0ge8t",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2014/03/06731713",
"title": "Real-Time Monte Carlo Tree Search in Ms Pac-Man",
"doi": null,
"abstractUrl": "/journal/ci/2014/03/06731713/13rRUxly989",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2013/01/06307831",
"title": "Monte Carlo Tree Search for Collaboration Control of Ghosts in Ms. Pac-Man",
"doi": null,
"abstractUrl": "/journal/ci/2013/01/06307831/13rRUygT7cQ",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/04/06266709",
"title": "Monte Carlo Tree Search for the Hide-and-seek Game Scotland Yard",
"doi": null,
"abstractUrl": "/journal/ci/2012/04/06266709/13rRUzpzeF5",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icss/2022/9861/0/986100a241",
"title": "Game difficulty prediction algorithm based on improved Monte Carlo tree",
"doi": null,
"abstractUrl": "/proceedings-article/icss/2022/986100a241/1G6jDApSSDm",
"parentPublication": {
"id": "proceedings/icss/2022/9861/0",
"title": "2022 International Conference on Service Science (ICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06571199",
"articleId": "13rRUwciPhX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06681932",
"articleId": "13rRUx0xPOk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBO3K5h",
"title": "Dec.",
"year": "2012",
"issueNum": "04",
"idPrefix": "ci",
"pubType": "journal",
"volume": "4",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYrbOM",
"doi": "10.1109/TCIAIG.2012.2204883",
"abstract": "In this paper, we examine the use of Monte Carlo tree search (MCTS) for a variant of one of the most popular and profitable games in the world: the card game Magic: The Gathering (M:TG). The game tree for M:TG has a range of distinctive features, which we discuss here; it has incomplete information through the opponent's hidden cards and randomness through card drawing from a shuffled deck. We investigate a wide range of approaches that use determinization, where all hidden and random information is assumed known to all players, alongside MCTS. We consider a number of variations to the rollout strategy using a range of levels of sophistication and expert knowledge, and decaying reward to encourage play urgency. We examine the effect of utilizing various pruning strategies in order to increase the information gained from each determinization, alongside methods that increase the relevance of random choices. Additionally, we deconstruct the move generation procedure into a binary yes/no decision tree and apply MCTS to this finer grained decision process. We compare our modifications to a basic MCTS approach for M:TG using fixed decks, and show that significant improvements in playing strength can be obtained.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we examine the use of Monte Carlo tree search (MCTS) for a variant of one of the most popular and profitable games in the world: the card game Magic: The Gathering (M:TG). The game tree for M:TG has a range of distinctive features, which we discuss here; it has incomplete information through the opponent's hidden cards and randomness through card drawing from a shuffled deck. We investigate a wide range of approaches that use determinization, where all hidden and random information is assumed known to all players, alongside MCTS. We consider a number of variations to the rollout strategy using a range of levels of sophistication and expert knowledge, and decaying reward to encourage play urgency. We examine the effect of utilizing various pruning strategies in order to increase the information gained from each determinization, alongside methods that increase the relevance of random choices. Additionally, we deconstruct the move generation procedure into a binary yes/no decision tree and apply MCTS to this finer grained decision process. We compare our modifications to a basic MCTS approach for M:TG using fixed decks, and show that significant improvements in playing strength can be obtained.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we examine the use of Monte Carlo tree search (MCTS) for a variant of one of the most popular and profitable games in the world: the card game Magic: The Gathering (M:TG). The game tree for M:TG has a range of distinctive features, which we discuss here; it has incomplete information through the opponent's hidden cards and randomness through card drawing from a shuffled deck. We investigate a wide range of approaches that use determinization, where all hidden and random information is assumed known to all players, alongside MCTS. We consider a number of variations to the rollout strategy using a range of levels of sophistication and expert knowledge, and decaying reward to encourage play urgency. We examine the effect of utilizing various pruning strategies in order to increase the information gained from each determinization, alongside methods that increase the relevance of random choices. Additionally, we deconstruct the move generation procedure into a binary yes/no decision tree and apply MCTS to this finer grained decision process. We compare our modifications to a basic MCTS approach for M:TG using fixed decks, and show that significant improvements in playing strength can be obtained.",
"title": "Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering",
"normalizedTitle": "Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering",
"fno": "06218176",
"hasPdf": true,
"idPrefix": "ci",
"keywords": [
"Binary Decision Diagrams",
"Decision Trees",
"Games Of Skill",
"Monte Carlo Methods",
"Random Processes",
"Tree Searching",
"Monte Carlo Tree Search",
"Game Tree",
"Card Drawing",
"Shuffled Deck",
"Hidden Information",
"Random Information",
"MCTS",
"Pruning Strategies",
"Move Generation Procedure",
"Binary Yes No Decision Tree",
"Finer Grained Decision Process",
"Fixed Decks",
"Card Game Magic The Gathering",
"Imperfect Information Card Game M TG",
"Ensemble Determinization",
"Games",
"Monte Carlo Methods",
"Artificial Intelligence",
"Humans",
"Decision Trees",
"Educational Institutions",
"Industries",
"Card Games",
"Determinization",
"Imperfect Information",
"Magic The Gathering M TG",
"Monte Carlo Tree Search MCTS",
"Parallelization"
],
"authors": [
{
"givenName": "Peter I.",
"surname": "Cowling",
"fullName": "Peter I. Cowling",
"affiliation": "Artificial Intelligence Research Centre, School of Computing, Informatics and Media, University of Bradford, Bradford, West Yorkshire, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Colin D.",
"surname": "Ward",
"fullName": "Colin D. Ward",
"affiliation": "Artificial Intelligence Research Centre, School of Computing, Informatics and Media, University of Bradford, Bradford, West Yorkshire, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Edward J.",
"surname": "Powley",
"fullName": "Edward J. Powley",
"affiliation": "Artificial Intelligence Research Centre, School of Computing, Informatics and Media, University of Bradford, Bradford, West Yorkshire, U.K.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2012-10-01 00:00:00",
"pubType": "trans",
"pages": "241-257",
"year": "2012",
"issn": "1943-068X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ictai/2014/6572/0/6572a997",
"title": "Knowledge Complement for Monte Carlo Tree Search: An Application to Combinatorial Games",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a997/12OmNxzMnWd",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sustainit/2015/8270/0/07101360",
"title": "Collaborative, parallel Monte Carlo Tree Search for autonomous electricity demand management",
"doi": null,
"abstractUrl": "/proceedings-article/sustainit/2015/07101360/12OmNyrqznQ",
"parentPublication": {
"id": "proceedings/sustainit/2015/8270/0",
"title": "2015 Sustainable Internet and ICT for Sustainability (SustainIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/02/06203567",
"title": "Information Set Monte Carlo Tree Search",
"doi": null,
"abstractUrl": "/journal/ci/2012/02/06203567/13rRUB7a1io",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2011/02/05740585",
"title": "Two-Stage Monte Carlo Tree Search for Connect6",
"doi": null,
"abstractUrl": "/journal/ci/2011/02/05740585/13rRUx0ge8t",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2015/04/06876158",
"title": "Distributed Monte Carlo tree search: A novel technique and its application to Computer Go",
"doi": null,
"abstractUrl": "/journal/ci/2015/04/06876158/13rRUxBJhxP",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2013/04/06468079",
"title": "Incentive Learning in Monte Carlo Tree Search",
"doi": null,
"abstractUrl": "/journal/ci/2013/04/06468079/13rRUxDqSb5",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/04/06266709",
"title": "Monte Carlo Tree Search for the Hide-and-seek Game Scotland Yard",
"doi": null,
"abstractUrl": "/journal/ci/2012/04/06266709/13rRUzpzeF5",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2022/5155/0/515500a011",
"title": "Seriema: RDMA-based Remote Invocation with a Case-Study on Monte-Carlo Tree Search",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2022/515500a011/1Jgrx1Cdqx2",
"parentPublication": {
"id": "proceedings/sbac-pad/2022/5155/0",
"title": "2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fpl/2022/7390/0/739000a176",
"title": "Accelerating Monte-Carlo Tree Search on CPU-FPGA Heterogeneous Platform",
"doi": null,
"abstractUrl": "/proceedings-article/fpl/2022/739000a176/1KJwHttuiYM",
"parentPublication": {
"id": "proceedings/fpl/2022/7390/0",
"title": "2022 32nd International Conference on Field-Programmable Logic and Applications (FPL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09580584",
"title": "A-MCTS: Adaptive Monte Carlo Tree Search for Temporal Path Discovery",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09580584/1xPnZKw8LDi",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06378433",
"articleId": "13rRUxEhFv7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06243194",
"articleId": "13rRUynZ5ql",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwMob9v",
"title": "Sept.",
"year": "2014",
"issueNum": "03",
"idPrefix": "ci",
"pubType": "journal",
"volume": "6",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly989",
"doi": "10.1109/TCIAIG.2013.2291577",
"abstract": "In this paper, Monte Carlo tree search (MCTS) is introduced for controlling the Pac-Man character in the real-time game Ms Pac-Man. MCTS is used to find an optimal path for an agent at each turn, determining the move to make based on the results of numerous randomized simulations. Several enhancements are introduced in order to adapt MCTS to the real-time domain. Ms Pac-Man is an arcade game, in which the protagonist has several goals but no conclusive terminal state. Unlike games such as Chess or Go there is no state in which the player wins the game. Instead, the game has two subgoals, 1) surviving and 2) scoring as many points as possible. Decisions must be made in a strict time constraint of 40 ms. The Pac-Man agent has to compete with a range of different ghost teams, hence limited assumptions can be made about their behavior. In order to expand the capabilities of existing MCTS agents, four enhancements are discussed: 1) a variable-depth tree; 2) simulation strategies for the ghost team and Pac-Man; 3) including long-term goals in scoring; and 4) reusing the search tree for several moves with a decay factor γ. The agent described in this paper was entered in both the 2012 World Congress on Computational Intelligence (WCCI'12, Brisbane, Qld., Australia) and the 2012 IEEE Conference on Computational Intelligence and Games (CIG'12, Granada, Spain) Pac-Man Versus Ghost Team competitions, where it achieved second and first places, respectively. In the experiments, we show that using MCTS is a viable technique for the Pac-Man agent. Moreover, the enhancements improve overall performance against four different ghost teams.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, Monte Carlo tree search (MCTS) is introduced for controlling the Pac-Man character in the real-time game Ms Pac-Man. MCTS is used to find an optimal path for an agent at each turn, determining the move to make based on the results of numerous randomized simulations. Several enhancements are introduced in order to adapt MCTS to the real-time domain. Ms Pac-Man is an arcade game, in which the protagonist has several goals but no conclusive terminal state. Unlike games such as Chess or Go there is no state in which the player wins the game. Instead, the game has two subgoals, 1) surviving and 2) scoring as many points as possible. Decisions must be made in a strict time constraint of 40 ms. The Pac-Man agent has to compete with a range of different ghost teams, hence limited assumptions can be made about their behavior. In order to expand the capabilities of existing MCTS agents, four enhancements are discussed: 1) a variable-depth tree; 2) simulation strategies for the ghost team and Pac-Man; 3) including long-term goals in scoring; and 4) reusing the search tree for several moves with a decay factor γ. The agent described in this paper was entered in both the 2012 World Congress on Computational Intelligence (WCCI'12, Brisbane, Qld., Australia) and the 2012 IEEE Conference on Computational Intelligence and Games (CIG'12, Granada, Spain) Pac-Man Versus Ghost Team competitions, where it achieved second and first places, respectively. In the experiments, we show that using MCTS is a viable technique for the Pac-Man agent. Moreover, the enhancements improve overall performance against four different ghost teams.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, Monte Carlo tree search (MCTS) is introduced for controlling the Pac-Man character in the real-time game Ms Pac-Man. MCTS is used to find an optimal path for an agent at each turn, determining the move to make based on the results of numerous randomized simulations. Several enhancements are introduced in order to adapt MCTS to the real-time domain. Ms Pac-Man is an arcade game, in which the protagonist has several goals but no conclusive terminal state. Unlike games such as Chess or Go there is no state in which the player wins the game. Instead, the game has two subgoals, 1) surviving and 2) scoring as many points as possible. Decisions must be made in a strict time constraint of 40 ms. The Pac-Man agent has to compete with a range of different ghost teams, hence limited assumptions can be made about their behavior. In order to expand the capabilities of existing MCTS agents, four enhancements are discussed: 1) a variable-depth tree; 2) simulation strategies for the ghost team and Pac-Man; 3) including long-term goals in scoring; and 4) reusing the search tree for several moves with a decay factor γ. The agent described in this paper was entered in both the 2012 World Congress on Computational Intelligence (WCCI'12, Brisbane, Qld., Australia) and the 2012 IEEE Conference on Computational Intelligence and Games (CIG'12, Granada, Spain) Pac-Man Versus Ghost Team competitions, where it achieved second and first places, respectively. In the experiments, we show that using MCTS is a viable technique for the Pac-Man agent. Moreover, the enhancements improve overall performance against four different ghost teams.",
"title": "Real-Time Monte Carlo Tree Search in Ms Pac-Man",
"normalizedTitle": "Real-Time Monte Carlo Tree Search in Ms Pac-Man",
"fno": "06731713",
"hasPdf": true,
"idPrefix": "ci",
"keywords": [
"Computer Games",
"Digital Simulation",
"Monte Carlo Methods",
"Tree Searching",
"Real Time Monte Carlo Tree Search",
"Ms Pac Man",
"MCTS",
"Arcade Game",
"Surviving",
"Scoring",
"Pac Man Agent",
"Variable Depth Tree",
"Simulation Strategies",
"2012 World Congress On Computational Intelligence",
"2012 IEEE Conference On Computational Intelligence And Games",
"Pac Man Ghost Team Competitions",
"Time 40 Ms",
"Games",
"Real Time Systems",
"Junctions",
"Monte Carlo Methods",
"Artificial Intelligence",
"Computational Intelligence",
"Planning",
"Monte Carlo",
"Monte Carlo Tree Search MCTS",
"Pac Man",
"Real Time"
],
"authors": [
{
"givenName": "Tom",
"surname": "Pepels",
"fullName": "Tom Pepels",
"affiliation": "Games and AI Group, Department of Knowledge Engineering, Faculty of Humanities, Maastricht University, Maastricht, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark H. M.",
"surname": "Winands",
"fullName": "Mark H. M. Winands",
"affiliation": "Games and AI Group, Department of Knowledge Engineering, Faculty of Humanities and Sciences, Maastricht University, Maastricht, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marc",
"surname": "Lanctot",
"fullName": "Marc Lanctot",
"affiliation": "Games and AI Group, Department of Knowledge Engineering, Faculty of Humanities and Sciences, Maastricht University, Maastricht, The Netherlands",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2014-07-01 00:00:00",
"pubType": "trans",
"pages": "245-257",
"year": "2014",
"issn": "1943-068X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/igic/2011/0258/0/06114952",
"title": "Applying Monte-Carlo Tree Search to collaboratively controlling of a Ghost Team in Ms Pac-Man",
"doi": null,
"abstractUrl": "/proceedings-article/igic/2011/06114952/12OmNAXPyoO",
"parentPublication": {
"id": "proceedings/igic/2011/0258/0",
"title": "International Games Innovation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2009/3736/5/3736e598",
"title": "To Create Intelligent Adaptive Game Opponent by Using Monte-Carlo for the Game of Pac-Man",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736e598/12OmNroijgS",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/5",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icitbs/2018/4201/0/420101a686",
"title": "PAC-MAN Game Based on SAPF Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icitbs/2018/420101a686/12OmNvC0sVD",
"parentPublication": {
"id": "proceedings/icitbs/2018/4201/0",
"title": "2018 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/02/06203567",
"title": "Information Set Monte Carlo Tree Search",
"doi": null,
"abstractUrl": "/journal/ci/2012/02/06203567/13rRUB7a1io",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2011/02/05740585",
"title": "Two-Stage Monte Carlo Tree Search for Connect6",
"doi": null,
"abstractUrl": "/journal/ci/2011/02/05740585/13rRUx0ge8t",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2017/02/07395335",
"title": "A Model-Based Approach to Optimizing Ms. Pac-Man Game Strategies in Real Time",
"doi": null,
"abstractUrl": "/journal/ci/2017/02/07395335/13rRUxBa5zR",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2016/03/07093170",
"title": "Comparing Heterogeneous and Homogeneous Flocking Strategies for the Ghost Team in the Game of Ms. Pac-Man",
"doi": null,
"abstractUrl": "/journal/ci/2016/03/07093170/13rRUxNmPLm",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2011/02/05752830",
"title": "Fast Approximate Max-n Monte Carlo Tree Search for Ms Pac-Man",
"doi": null,
"abstractUrl": "/journal/ci/2011/02/05752830/13rRUy3gn3E",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2013/01/06307831",
"title": "Monte Carlo Tree Search for Collaboration Control of Ghosts in Ms. Pac-Man",
"doi": null,
"abstractUrl": "/journal/ci/2013/01/06307831/13rRUygT7cQ",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/04/06266709",
"title": "Monte Carlo Tree Search for the Hide-and-seek Game Scotland Yard",
"doi": null,
"abstractUrl": "/journal/ci/2012/04/06266709/13rRUzpzeF5",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06895363",
"articleId": "13rRUxbCbsM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06644281",
"articleId": "13rRUx0xPOl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBO3K5h",
"title": "Dec.",
"year": "2012",
"issueNum": "04",
"idPrefix": "ci",
"pubType": "journal",
"volume": "4",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzpzeF5",
"doi": "10.1109/TCIAIG.2012.2210424",
"abstract": "This paper describes how Monte Carlo tree search (MCTS) can be applied to the hide-and-seek game Scotland Yard. This game is essentially a two-player game in which the players are moving on a graph-based map. First, we discuss how determinization is applied to handle the imperfect information in the game. We show how using determinization in a single tree performs better than using separate trees for each determinization. We also propose a new technique, called location categorization, that biases the possible locations of the hider. The experimental results reveal that location categorization is a robust technique, and significantly increases the performance of the seekers. Next, we describe how to handle the coalition of the seekers by using coalition reduction. This technique balances each seeker's participation in the coalition. Coalition reduction improves the performance of the seekers significantly. Furthermore, we explain how domain knowledge is incorporated by applying ε-greedy playouts and move filtering. Finally, we compare the MCTS players to minimax-based players, and we test the performance of our MCTS player against a commercial Scotland Yard program on the Nintendo DS. Based on the results, we may conclude that the MCTS-based hider and seekers play at a strong level.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper describes how Monte Carlo tree search (MCTS) can be applied to the hide-and-seek game Scotland Yard. This game is essentially a two-player game in which the players are moving on a graph-based map. First, we discuss how determinization is applied to handle the imperfect information in the game. We show how using determinization in a single tree performs better than using separate trees for each determinization. We also propose a new technique, called location categorization, that biases the possible locations of the hider. The experimental results reveal that location categorization is a robust technique, and significantly increases the performance of the seekers. Next, we describe how to handle the coalition of the seekers by using coalition reduction. This technique balances each seeker's participation in the coalition. Coalition reduction improves the performance of the seekers significantly. Furthermore, we explain how domain knowledge is incorporated by applying ε-greedy playouts and move filtering. Finally, we compare the MCTS players to minimax-based players, and we test the performance of our MCTS player against a commercial Scotland Yard program on the Nintendo DS. Based on the results, we may conclude that the MCTS-based hider and seekers play at a strong level.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper describes how Monte Carlo tree search (MCTS) can be applied to the hide-and-seek game Scotland Yard. This game is essentially a two-player game in which the players are moving on a graph-based map. First, we discuss how determinization is applied to handle the imperfect information in the game. We show how using determinization in a single tree performs better than using separate trees for each determinization. We also propose a new technique, called location categorization, that biases the possible locations of the hider. The experimental results reveal that location categorization is a robust technique, and significantly increases the performance of the seekers. Next, we describe how to handle the coalition of the seekers by using coalition reduction. This technique balances each seeker's participation in the coalition. Coalition reduction improves the performance of the seekers significantly. Furthermore, we explain how domain knowledge is incorporated by applying ε-greedy playouts and move filtering. Finally, we compare the MCTS players to minimax-based players, and we test the performance of our MCTS player against a commercial Scotland Yard program on the Nintendo DS. Based on the results, we may conclude that the MCTS-based hider and seekers play at a strong level.",
"title": "Monte Carlo Tree Search for the Hide-and-seek Game Scotland Yard",
"normalizedTitle": "Monte Carlo Tree Search for the Hide-and-seek Game Scotland Yard",
"fno": "06266709",
"hasPdf": true,
"idPrefix": "ci",
"keywords": [
"Computer Games",
"Monte Carlo Methods",
"Search Problems",
"Monte Carlo Tree Search",
"Hide And Seek Game",
"Scotland Yard",
"MCTS",
"Two Player Game",
"Graph Based Map",
"Location Categorization",
"Coalition Reduction",
"Domain Knowledge",
"Ε Greedy Playouts",
"Move Filtering",
"Nintendo DS",
"Games",
"Monte Carlo Methods",
"Image Edge Detection",
"History",
"Computers",
"Artificial Intelligence",
"Reliability",
"Cooperation In Games",
"Imperfect Information",
"Monte Carlo Tree Search MCTS",
"Scotland Yard"
],
"authors": [
{
"givenName": "Pim",
"surname": "Nijssen",
"fullName": "Pim Nijssen",
"affiliation": "Department of Knowledge Engineering, Faculty of Humanities and Sciences, Maastricht University, Maastricht, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mark H. M.",
"surname": "Winands",
"fullName": "Mark H. M. Winands",
"affiliation": "Department of Knowledge Engineering, Faculty of Humanities and Sciences, Maastricht University, Maastricht, The Netherlands",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2012-10-01 00:00:00",
"pubType": "trans",
"pages": "282-294",
"year": "2012",
"issn": "1943-068X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/trustcom-bigdatase-i-spa/2015/7952/3/07345631",
"title": "Parallel Monte Carlo Tree Search from Multi-core to Many-core Processors",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2015/07345631/12OmNxAlA7u",
"parentPublication": {
"id": "trustcom-bigdatase-i-spa/2015/7952/3",
"title": "2015 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a997",
"title": "Knowledge Complement for Monte Carlo Tree Search: An Application to Combinatorial Games",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a997/12OmNxzMnWd",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sustainit/2015/8270/0/07101360",
"title": "Collaborative, parallel Monte Carlo Tree Search for autonomous electricity demand management",
"doi": null,
"abstractUrl": "/proceedings-article/sustainit/2015/07101360/12OmNyrqznQ",
"parentPublication": {
"id": "proceedings/sustainit/2015/8270/0",
"title": "2015 Sustainable Internet and ICT for Sustainability (SustainIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/02/06203567",
"title": "Information Set Monte Carlo Tree Search",
"doi": null,
"abstractUrl": "/journal/ci/2012/02/06203567/13rRUB7a1io",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/01/06145622",
"title": "A Survey of Monte Carlo Tree Search Methods",
"doi": null,
"abstractUrl": "/journal/ci/2012/01/06145622/13rRUwhpBGJ",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2011/02/05740585",
"title": "Two-Stage Monte Carlo Tree Search for Connect6",
"doi": null,
"abstractUrl": "/journal/ci/2011/02/05740585/13rRUx0ge8t",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2013/04/06468079",
"title": "Incentive Learning in Monte Carlo Tree Search",
"doi": null,
"abstractUrl": "/journal/ci/2013/04/06468079/13rRUxDqSb5",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2012/04/06218176",
"title": "Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering",
"doi": null,
"abstractUrl": "/journal/ci/2012/04/06218176/13rRUxYrbOM",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2013/01/06307831",
"title": "Monte Carlo Tree Search for Collaboration Control of Ghosts in Ms. Pac-Man",
"doi": null,
"abstractUrl": "/journal/ci/2013/01/06307831/13rRUygT7cQ",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icss/2022/9861/0/986100a241",
"title": "Game difficulty prediction algorithm based on improved Monte Carlo tree",
"doi": null,
"abstractUrl": "/proceedings-article/icss/2022/986100a241/1G6jDApSSDm",
"parentPublication": {
"id": "proceedings/icss/2022/9861/0",
"title": "2022 International Conference on Service Science (ICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06249736",
"articleId": "13rRUwhpBQ9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06262464",
"articleId": "13rRUzpzeDF",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1AlHmdyOjAc",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "qe",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1MhE7jnSMBG",
"doi": "10.1109/TQE.2023.3265709",
"abstract": "Quantum algorithms based on variational approaches are one of the most promising methods to construct quantum solutions and have found a myriad of applications in the last few years. Despite the adaptability and simplicity, their scalability and the selection of suitable ansatzes remain key challenges. In this work, we report an algorithmic framework based on nested Monte-Carlo Tree Search (MCTS) coupled with the combinatorial multi-armed bandit (CMAB) model for the automated design of quantum circuits. Through numerical experiments, we demonstrate our algorithm applied to various kinds of problems, including the ground energy problem in quantum chemistry, quantum optimisation on a graph, solving systems of linear equations, and finding encoding circuits for quantum error detection codes. Compared to the existing approaches, the results indicate that our circuit design algorithm can explore larger search spaces and optimise quantum circuits for larger systems, showing both versatility and scalability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Quantum algorithms based on variational approaches are one of the most promising methods to construct quantum solutions and have found a myriad of applications in the last few years. Despite the adaptability and simplicity, their scalability and the selection of suitable ansatzes remain key challenges. In this work, we report an algorithmic framework based on nested Monte-Carlo Tree Search (MCTS) coupled with the combinatorial multi-armed bandit (CMAB) model for the automated design of quantum circuits. Through numerical experiments, we demonstrate our algorithm applied to various kinds of problems, including the ground energy problem in quantum chemistry, quantum optimisation on a graph, solving systems of linear equations, and finding encoding circuits for quantum error detection codes. Compared to the existing approaches, the results indicate that our circuit design algorithm can explore larger search spaces and optimise quantum circuits for larger systems, showing both versatility and scalability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Quantum algorithms based on variational approaches are one of the most promising methods to construct quantum solutions and have found a myriad of applications in the last few years. Despite the adaptability and simplicity, their scalability and the selection of suitable ansatzes remain key challenges. In this work, we report an algorithmic framework based on nested Monte-Carlo Tree Search (MCTS) coupled with the combinatorial multi-armed bandit (CMAB) model for the automated design of quantum circuits. Through numerical experiments, we demonstrate our algorithm applied to various kinds of problems, including the ground energy problem in quantum chemistry, quantum optimisation on a graph, solving systems of linear equations, and finding encoding circuits for quantum error detection codes. Compared to the existing approaches, the results indicate that our circuit design algorithm can explore larger search spaces and optimise quantum circuits for larger systems, showing both versatility and scalability.",
"title": "Automated Quantum Circuit Design with Nested Monte Carlo Tree Search",
"normalizedTitle": "Automated Quantum Circuit Design with Nested Monte Carlo Tree Search",
"fno": "10100911",
"hasPdf": true,
"idPrefix": "qe",
"keywords": [
"Search Problems",
"Quantum Circuit",
"Optimization",
"Artificial Intelligence",
"Task Analysis",
"Monte Carlo Methods",
"Mathematical Models",
"Artificial Intelligence",
"Monte Carlo Tree Search",
"Quantum Machine Learning",
"Quantum Neural Networks",
"Variational Quantum Circuits"
],
"authors": [
{
"givenName": "Peiyong",
"surname": "Wang",
"fullName": "Peiyong Wang",
"affiliation": "School of Computing and Information Systems, Faculty of Engineering and Information Technology, The University of Melbourne, Melbourne, VIC, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Muhammad",
"surname": "Usman",
"fullName": "Muhammad Usman",
"affiliation": "School of Physics, The University of Melbourne, Parkville, VIC, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Udaya",
"surname": "Parampalli",
"fullName": "Udaya Parampalli",
"affiliation": "School of Computing and Information Systems, Faculty of Engineering and Information Technology, The University of Melbourne, Melbourne, VIC, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lloyd C. L.",
"surname": "Hollenberg",
"fullName": "Lloyd C. L. Hollenberg",
"affiliation": "School of Physics, The University of Melbourne, Parkville, VIC, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Casey R.",
"surname": "Myers",
"fullName": "Casey R. Myers",
"affiliation": "School of Computing and Information Systems, Faculty of Engineering and Information Technology, The University of Melbourne, Melbourne, VIC, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-25",
"year": "5555",
"issn": "2689-1808",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hipc/2012/2372/0/06507509",
"title": "A global address space approach to automated data management for parallel Quantum Monte Carlo applications",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2012/06507509/12OmNwIHov1",
"parentPublication": {
"id": "proceedings/hipc/2012/2372/0",
"title": "20th Annual International Conference on High Performance Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmens/2009/3938/0/3938a213",
"title": "Computational Experience with Nano-material Science Quantum Monte Carlo Modeling on BlueGene/L",
"doi": null,
"abstractUrl": "/proceedings-article/icmens/2009/3938a213/12OmNyPQ4Ow",
"parentPublication": {
"id": "proceedings/icmens/2009/3938/0",
"title": "MEMS, NANO, and Smart Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sustainit/2015/8270/0/07101360",
"title": "Collaborative, parallel Monte Carlo Tree Search for autonomous electricity demand management",
"doi": null,
"abstractUrl": "/proceedings-article/sustainit/2015/07101360/12OmNyrqznQ",
"parentPublication": {
"id": "proceedings/sustainit/2015/8270/0",
"title": "2015 Sustainable Internet and ICT for Sustainability (SustainIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2011/02/05740585",
"title": "Two-Stage Monte Carlo Tree Search for Connect6",
"doi": null,
"abstractUrl": "/journal/ci/2011/02/05740585/13rRUx0ge8t",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2010/01/mcs2010010064",
"title": "A Zero-Temperature Quantum Monte Carlo Algorithm and Quantum Spin Glasses",
"doi": null,
"abstractUrl": "/magazine/cs/2010/01/mcs2010010064/13rRUy3xYew",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2021/8442/0/09910128",
"title": "Overcoming Barriers to Scalability in Variational Quantum Monte Carlo",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2021/09910128/1HzByzANk5y",
"parentPublication": {
"id": "proceedings/sc/2021/8442/0",
"title": "SC21: International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2022/9113/0/911300a509",
"title": "Approximate Quantum Circuit Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2022/911300a509/1IvLYJDx7DG",
"parentPublication": {
"id": "proceedings/qce/2022/9113/0",
"title": "2022 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2022/9113/0/911300a788",
"title": "Gravitational wave matched filtering by quantum Monte Carlo integration and quantum amplitude amplification",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2022/911300a788/1IvLuM6vVrG",
"parentPublication": {
"id": "proceedings/qce/2022/9113/0",
"title": "2022 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2021/1691/0/169100a454",
"title": "Quantum algorithms for Monte Carlo integration using pseudo-random numbers",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2021/169100a454/1yEZ7a8QPm0",
"parentPublication": {
"id": "proceedings/qce/2021/1691/0",
"title": "2021 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900n3799",
"title": "Monte Carlo Scene Search for 3D Scene Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900n3799/1yeJ3a5CJhe",
"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": "10094014",
"articleId": "1M80HPlPnDq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10104156",
"articleId": "1MrBv3WcRRS",
"__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": "1wRE7UAvlrq",
"doi": "10.1109/TVCG.2021.3111146",
"abstract": "Extracting and analyzing crime patterns in big cities is a challenging spatiotemporal problem. The hardness of the problem is linked to two main factors, the sparse nature of the crime activity and its spread in large spatial areas. Sparseness hampers most time series (crime time series) comparison methods from working properly, while the handling of large urban areas tends to render the computational costs of such methods impractical. Visualizing different patterns hidden in crime time series data is another issue in this context, mainly due to the number of patterns that can show up in the time series analysis. In this article, we present a new methodology to deal with the issues above, enabling the analysis of spatiotemporal crime patterns in a street-level of detail. Our approach is made up of two main components designed to handle the spatial sparsity and spreading of crimes in large areas of the city. The first component relies on a stochastic mechanism from which one can visually analyze probable×intensive crime hotspots. Such analysis reveals important patterns that can not be observed in the typical intensity-based hotspot visualization. The second component builds upon a deep learning mechanism to embed crime time series in Cartesian space. From the embedding, one can identify spatial locations where the crime time series have similar behavior. The two components have been integrated into a web-based analytical tool called CriPAV (Crime Pattern Analysis and Visualization), which enables global as well as a street-level view of crime patterns. Developed in close collaboration with domain experts, CriPAV has been validated through a set of case studies with real crime data in São Paulo - Brazil. The provided experiments and case studies reveal the effectiveness of CriPAV in identifying patterns such as locations where crimes are not intense but highly probable to occur as well as locations that are far apart from each other but bear similar crime patterns.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Extracting and analyzing crime patterns in big cities is a challenging spatiotemporal problem. The hardness of the problem is linked to two main factors, the sparse nature of the crime activity and its spread in large spatial areas. Sparseness hampers most time series (crime time series) comparison methods from working properly, while the handling of large urban areas tends to render the computational costs of such methods impractical. Visualizing different patterns hidden in crime time series data is another issue in this context, mainly due to the number of patterns that can show up in the time series analysis. In this article, we present a new methodology to deal with the issues above, enabling the analysis of spatiotemporal crime patterns in a street-level of detail. Our approach is made up of two main components designed to handle the spatial sparsity and spreading of crimes in large areas of the city. The first component relies on a stochastic mechanism from which one can visually analyze probable×intensive crime hotspots. Such analysis reveals important patterns that can not be observed in the typical intensity-based hotspot visualization. The second component builds upon a deep learning mechanism to embed crime time series in Cartesian space. From the embedding, one can identify spatial locations where the crime time series have similar behavior. The two components have been integrated into a web-based analytical tool called CriPAV (Crime Pattern Analysis and Visualization), which enables global as well as a street-level view of crime patterns. Developed in close collaboration with domain experts, CriPAV has been validated through a set of case studies with real crime data in São Paulo - Brazil. The provided experiments and case studies reveal the effectiveness of CriPAV in identifying patterns such as locations where crimes are not intense but highly probable to occur as well as locations that are far apart from each other but bear similar crime patterns.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Extracting and analyzing crime patterns in big cities is a challenging spatiotemporal problem. The hardness of the problem is linked to two main factors, the sparse nature of the crime activity and its spread in large spatial areas. Sparseness hampers most time series (crime time series) comparison methods from working properly, while the handling of large urban areas tends to render the computational costs of such methods impractical. Visualizing different patterns hidden in crime time series data is another issue in this context, mainly due to the number of patterns that can show up in the time series analysis. In this article, we present a new methodology to deal with the issues above, enabling the analysis of spatiotemporal crime patterns in a street-level of detail. Our approach is made up of two main components designed to handle the spatial sparsity and spreading of crimes in large areas of the city. The first component relies on a stochastic mechanism from which one can visually analyze probable×intensive crime hotspots. Such analysis reveals important patterns that can not be observed in the typical intensity-based hotspot visualization. The second component builds upon a deep learning mechanism to embed crime time series in Cartesian space. From the embedding, one can identify spatial locations where the crime time series have similar behavior. The two components have been integrated into a web-based analytical tool called CriPAV (Crime Pattern Analysis and Visualization), which enables global as well as a street-level view of crime patterns. Developed in close collaboration with domain experts, CriPAV has been validated through a set of case studies with real crime data in São Paulo - Brazil. The provided experiments and case studies reveal the effectiveness of CriPAV in identifying patterns such as locations where crimes are not intense but highly probable to occur as well as locations that are far apart from each other but bear similar crime patterns.",
"title": "CriPAV: Street-Level Crime Patterns Analysis and Visualization",
"normalizedTitle": "CriPAV: Street-Level Crime Patterns Analysis and Visualization",
"fno": "09536407",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Criminal Law",
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Geographic Information Systems",
"Internet",
"Learning Artificial Intelligence",
"Police Data Processing",
"Probability",
"Social Sciences Computing",
"Time Series",
"Crime Activity",
"Crime Data",
"Crime Pattern Analysis",
"Crime Time Series Data",
"Crimes",
"Cri PAV",
"Important Patterns",
"Probable X 00 D 7 Intensive Crime Hotspots",
"Similar Crime Patterns",
"Spatiotemporal Crime Patterns",
"Street Level Crime Patterns Analysis",
"Time Series Analysis",
"Time Series Comparison Methods",
"Typical Intensity Based Hotspot Visualization",
"Data Visualization",
"Time Series Analysis",
"Urban Areas",
"Spatiotemporal Phenomena",
"Stochastic Processes",
"Deep Learning",
"Visual Analytics",
"Criminal Law",
"Crime Data",
"Spatio Temporal Data",
"Visual Analytics",
"Crime Hotspots",
"Stochastic Matrix"
],
"authors": [
{
"givenName": "Germain",
"surname": "García-Zanabria",
"fullName": "Germain García-Zanabria",
"affiliation": "ICMC-USP, São Carlos, SP, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcos M.",
"surname": "Raimundo",
"fullName": "Marcos M. Raimundo",
"affiliation": "Fundação Getúlio Vargas, Florianópolis, SC, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jorge",
"surname": "Poco",
"fullName": "Jorge Poco",
"affiliation": "Fundação Getúlio Vargas, Florianópolis, SC, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcelo Batista",
"surname": "Nery",
"fullName": "Marcelo Batista Nery",
"affiliation": "RIDC -FAPESP and Institute of Advanced Studies – Global Cities Program, São Paulo, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cláudio T.",
"surname": "Silva",
"fullName": "Cláudio T. Silva",
"affiliation": "New York University, New York, NY, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sergio",
"surname": "Adorno",
"fullName": "Sergio Adorno",
"affiliation": "NEV-CEPID/USP, São Paulo, Brazil",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luis Gustavo",
"surname": "Nonato",
"fullName": "Luis Gustavo Nonato",
"affiliation": "ICMC-USP, São Carlos, SP, Brazil",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "4000-4015",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wi-iatw/2006/2749/0/27490041",
"title": "Crime Pattern Detection Using Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iatw/2006/27490041/12OmNC4wtz1",
"parentPublication": {
"id": "proceedings/wi-iatw/2006/2749/0",
"title": "Web Intelligence and Intelligent Agent Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartcomp/2018/4705/0/470501a017",
"title": "A Data-Driven Approach for Spatio-Temporal Crime Predictions in Smart Cities",
"doi": null,
"abstractUrl": "/proceedings-article/smartcomp/2018/470501a017/12OmNvTBB8k",
"parentPublication": {
"id": "proceedings/smartcomp/2018/4705/0",
"title": "2018 IEEE International Conference on Smart Computing (SMARTCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2016/2857/0/07870197",
"title": "Filtering Estimated Crime Series Based on Route Calculations on Spatio-temporal Data",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2016/07870197/12OmNvq5jub",
"parentPublication": {
"id": "proceedings/eisic/2016/2857/0",
"title": "2016 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2016/3566/0/07839608",
"title": "An Ontology for Property Crime Based on Events from UFO-B Foundational Ontology",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2016/07839608/12OmNwBjP6k",
"parentPublication": {
"id": "proceedings/bracis/2016/3566/0",
"title": "2016 5th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2017/2385/0/2385a001",
"title": "Detecting Crime Series Based on Route Estimation and Behavioral Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2017/2385a001/12OmNy3Agu7",
"parentPublication": {
"id": "proceedings/eisic/2017/2385/0",
"title": "2017 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wiiatw/2006/2749/0/04053200",
"title": "Crime Pattern Detection Using Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/wiiatw/2006/04053200/12OmNzSh13t",
"parentPublication": {
"id": "proceedings/wiiatw/2006/2749/0",
"title": "2006 IEEE/WIC/ACM International Conference on Web Intelligence International Intelligence Agent Technology Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eisic/2018/9400/0/08752959",
"title": "Multi-Expert Estimations of Burglars' Risk Exposure and Level of Pre-Crime Preparation Using Coded Crime Scene Data: Work in Progress",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2018/08752959/1bolVuBx5HW",
"parentPublication": {
"id": "proceedings/eisic/2018/9400/0",
"title": "2018 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08869805",
"title": "CrimAnalyzer: Understanding Crime Patterns in São Paulo",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08869805/1e9hb0tlqpy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2020/1054/0/09191384",
"title": "Studying the impact of streetlights on street crime rate using geo-statistics",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2020/09191384/1n0IvuKWGWY",
"parentPublication": {
"id": "proceedings/iri/2020/1054/0",
"title": "2020 IEEE 21st International Conference on Information Reuse and Integration for Data Science (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsecs-icocsim/2021/1407/0/140700a453",
"title": "Bangladesh Crime Reports Analysis and Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icsecs-icocsim/2021/140700a453/1wYlA5ZjdrG",
"parentPublication": {
"id": "proceedings/icsecs-icocsim/2021/1407/0",
"title": "2021 International Conference on Software Engineering & Computer Systems and 4th International Conference on Computational Science and Information Management (ICSECS-ICOCSIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09535226",
"articleId": "1wMEQ9trRGE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09536434",
"articleId": "1wREa2FncUE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1HMOyyH869a",
"name": "ttg202212-09536407s1-supp1-3111146.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202212-09536407s1-supp1-3111146.pdf",
"extension": "pdf",
"size": "112 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0gezV",
"doi": "10.1109/TVCG.2016.2598866",
"abstract": "We introduce the use of decals for multivariate visualization design. Decals are visual representations that are used for communication; for example, a pattern, a text, a glyph, or a symbol, transferred from a 2D-image to a surface upon contact. By creating what we define as decal-maps, we can design a set of images or patterns that represent one or more data attributes. We place decals on the surface considering the data pertaining to the locations we choose. We propose a (texture mapping) local parametrization that allows placing decals on arbitrary surfaces interactively, even when dealing with a high number of decals. Moreover, we extend the concept of layering to allow the co-visualization of an increased number of attributes on arbitrary surfaces. By combining decal-maps, color-maps and a layered visualization, we aim to facilitate and encourage the creative process of designing multivariate visualizations. Finally, we demonstrate the general applicability of our technique by providing examples of its use in a variety of contexts.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce the use of decals for multivariate visualization design. Decals are visual representations that are used for communication; for example, a pattern, a text, a glyph, or a symbol, transferred from a 2D-image to a surface upon contact. By creating what we define as decal-maps, we can design a set of images or patterns that represent one or more data attributes. We place decals on the surface considering the data pertaining to the locations we choose. We propose a (texture mapping) local parametrization that allows placing decals on arbitrary surfaces interactively, even when dealing with a high number of decals. Moreover, we extend the concept of layering to allow the co-visualization of an increased number of attributes on arbitrary surfaces. By combining decal-maps, color-maps and a layered visualization, we aim to facilitate and encourage the creative process of designing multivariate visualizations. Finally, we demonstrate the general applicability of our technique by providing examples of its use in a variety of contexts.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce the use of decals for multivariate visualization design. Decals are visual representations that are used for communication; for example, a pattern, a text, a glyph, or a symbol, transferred from a 2D-image to a surface upon contact. By creating what we define as decal-maps, we can design a set of images or patterns that represent one or more data attributes. We place decals on the surface considering the data pertaining to the locations we choose. We propose a (texture mapping) local parametrization that allows placing decals on arbitrary surfaces interactively, even when dealing with a high number of decals. Moreover, we extend the concept of layering to allow the co-visualization of an increased number of attributes on arbitrary surfaces. By combining decal-maps, color-maps and a layered visualization, we aim to facilitate and encourage the creative process of designing multivariate visualizations. Finally, we demonstrate the general applicability of our technique by providing examples of its use in a variety of contexts.",
"title": "Decal-Maps: Real-Time Layering of Decals on Surfaces for Multivariate Visualization",
"normalizedTitle": "Decal-Maps: Real-Time Layering of Decals on Surfaces for Multivariate Visualization",
"fno": "07539320",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Two Dimensional Displays",
"Surface Treatment",
"Image Color Analysis",
"Visualization",
"Surface Texture",
"Geology",
"Design",
"Multivariate",
"Visualization",
"Real Time",
"Decal",
"Surface",
"Layering"
],
"authors": [
{
"givenName": "Allan",
"surname": "Rocha",
"fullName": "Allan Rocha",
"affiliation": "University of Calgary",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Usman",
"surname": "Alim",
"fullName": "Usman Alim",
"affiliation": "University of Calgary",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julio Daniel",
"surname": "Silva",
"fullName": "Julio Daniel Silva",
"affiliation": "University of Calgary",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mario Costa",
"surname": "Sousa",
"fullName": "Mario Costa Sousa",
"affiliation": "University of Calgary",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "821-830",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300017",
"title": "Image Based Flow Visualization for Curved Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300017/12OmNBE7MqI",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300018",
"title": "Image Space Based Visualization of Unsteady Flow on Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300018/12OmNxH9Xhw",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815040",
"title": "Illusory Motions on Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815040/12OmNxXCGKC",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06887357",
"title": "Visualization of Regular Maps: The Chase Continues",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06887357/13rRUwI5U2I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/06/v0637",
"title": "ISA and IBFVS: Image Space-Based Visualization of Flow on Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0637/13rRUwInuWn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091438",
"title": "Bristle Maps: A Multivariate Abstraction Technique for Geovisualization",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091438/13rRUxASuGk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539285",
"title": "Molecular Surface Maps",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539285/13rRUxASuvj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/08/08396300",
"title": "Decal-Lenses: Interactive Lenses on Surfaces for Multivariate Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/08/08396300/13rRUyeCkap",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440089",
"title": "Recirculation Surfaces for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440089/17D45Vw15xs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/01/08440120",
"title": "Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps",
"doi": null,
"abstractUrl": "/journal/tg/2019/01/08440120/17D45Wuc38E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539561",
"articleId": "13rRUxC0SvY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539342",
"articleId": "13rRUxYIN4d",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyQphh4",
"title": "Aug.",
"year": "2018",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwwaKte",
"doi": "10.1109/TVCG.2017.2730877",
"abstract": "Finding similar points in globally or locally similar shapes has been studied extensively through the use of various point descriptors or shape-matching methods. However, little work exists on finding similar points in dissimilar shapes. In this paper, we present the results of a study where users were given two dissimilar two-dimensional shapes and asked to map a given point in the first shape to the point in the second shape they consider most similar. We find that user mappings in this study correlate strongly with simple geometric relationships between points and shapes. To predict the probability distribution of user mappings between any pair of simple two-dimensional shapes, two distinct statistical models are defined using these relationships. We perform a thorough validation of the accuracy of these predictions and compare our models qualitatively and quantitatively to well-known shape-matching methods. Using our predictive models, we propose an approach to map objects or procedural content between different shapes in different design scenarios.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Finding similar points in globally or locally similar shapes has been studied extensively through the use of various point descriptors or shape-matching methods. However, little work exists on finding similar points in dissimilar shapes. In this paper, we present the results of a study where users were given two dissimilar two-dimensional shapes and asked to map a given point in the first shape to the point in the second shape they consider most similar. We find that user mappings in this study correlate strongly with simple geometric relationships between points and shapes. To predict the probability distribution of user mappings between any pair of simple two-dimensional shapes, two distinct statistical models are defined using these relationships. We perform a thorough validation of the accuracy of these predictions and compare our models qualitatively and quantitatively to well-known shape-matching methods. Using our predictive models, we propose an approach to map objects or procedural content between different shapes in different design scenarios.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Finding similar points in globally or locally similar shapes has been studied extensively through the use of various point descriptors or shape-matching methods. However, little work exists on finding similar points in dissimilar shapes. In this paper, we present the results of a study where users were given two dissimilar two-dimensional shapes and asked to map a given point in the first shape to the point in the second shape they consider most similar. We find that user mappings in this study correlate strongly with simple geometric relationships between points and shapes. To predict the probability distribution of user mappings between any pair of simple two-dimensional shapes, two distinct statistical models are defined using these relationships. We perform a thorough validation of the accuracy of these predictions and compare our models qualitatively and quantitatively to well-known shape-matching methods. Using our predictive models, we propose an approach to map objects or procedural content between different shapes in different design scenarios.",
"title": "How Do Users Map Points Between Dissimilar Shapes?",
"normalizedTitle": "How Do Users Map Points Between Dissimilar Shapes?",
"fno": "07990196",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Shape Recognition",
"User Mappings",
"Shape Matching Methods",
"Similar Points",
"Locally Similar Shapes",
"Point Descriptors",
"Geometric Relationships",
"Globally Similar Shapes",
"Dissimilar Two Dimensional Shapes",
"Statistical Models",
"Shape",
"Predictive Models",
"Correlation",
"Semantics",
"Two Dimensional Displays",
"Three Dimensional Displays",
"Computational Modeling",
"2 D Mappings",
"Shape Matching",
"Shape Similarity",
"Transformations",
"User Studies"
],
"authors": [
{
"givenName": "Michael",
"surname": "Hecher",
"fullName": "Michael Hecher",
"affiliation": "TU Wien, Wien, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul",
"surname": "Guerrero",
"fullName": "Paul Guerrero",
"affiliation": "UCL, London, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Wonka",
"fullName": "Peter Wonka",
"affiliation": "KAUST, Thuwal, Saudi Arabia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Wimmer",
"fullName": "Michael Wimmer",
"affiliation": "TU Wien, Wien, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2018-08-01 00:00:00",
"pubType": "trans",
"pages": "2327-2338",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457d615",
"title": "Learning Barycentric Representations of 3D Shapes for Sketch-Based 3D Shape Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457d615/12OmNB0FxiX",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851f676",
"title": "A Field Model for Repairing 3D Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851f676/12OmNvTjZY8",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2016/7258/0/07552991",
"title": "Approximate convex decomposition for 2D shapes based on visibility range",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2016/07552991/12OmNySosM9",
"parentPublication": {
"id": "proceedings/icme/2016/7258/0",
"title": "2016 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851f431",
"title": "Structured Prediction of Unobserved Voxels from a Single Depth Image",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851f431/12OmNyo1nWC",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000b936",
"title": "Matryoshka Networks: Predicting 3D Geometry via Nested Shape Layers",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000b936/17D45WYQJ9j",
"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/cvpr/2018/6420/0/642000f216",
"title": "Disentangling Features in 3D Face Shapes for Joint Face Reconstruction and Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000f216/17D45WrVgfL",
"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/197500a303",
"title": "Euclidean Invariant Recognition of 2D Shapes Using Histograms of Magnitudes of Local Fourier-Mellin Descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500a303/18j8KYiZFK0",
"parentPublication": {
"id": "proceedings/wacv/2019/1975/0",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/04/08883058",
"title": "Weakly-Supervised Learning of Category-Specific 3D Object Shapes",
"doi": null,
"abstractUrl": "/journal/tp/2021/04/08883058/1epRQBbBei4",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800l1910",
"title": "DOPS: Learning to Detect 3D Objects and Predict Their 3D Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800l1910/1m3ngpg5m5W",
"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/3dv/2020/8128/0/812800a593",
"title": "Better Patch Stitching for Parametric Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2020/812800a593/1qyxiGCusus",
"parentPublication": {
"id": "proceedings/3dv/2020/8128/0",
"title": "2020 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07974776",
"articleId": "13rRUy0HYRx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07968338",
"articleId": "13rRUxBrGh9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesTM",
"name": "ttg201808-07990196s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201808-07990196s1.zip",
"extension": "zip",
"size": "4.99 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK2",
"title": "November",
"year": "2004",
"issueNum": "11",
"idPrefix": "tk",
"pubType": "journal",
"volume": "16",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJzK",
"doi": "10.1109/TKDE.2004.77",
"abstract": "Sequential pattern mining is an important data mining problem with broad applications. However, it is also a difficult problem since the mining may have to generate or examine a combinatorially explosive number of intermediate subsequences. Most of the previously developed sequential pattern mining methods, such as GSP, explore a candidate generation-and-test approach [1] to reduce the number of candidates to be examined. However, this approach may not be efficient in mining large sequence databases having numerous patterns and/or long patterns. In this paper, we propose a projection-based, sequential pattern-growth approach for efficient mining of sequential patterns. In this approach, a sequence database is recursively projected into a set of smaller projected databases, and sequential patterns are grown in each projected database by exploring only locally frequent fragments. Based on an initial study of the pattern growth-based sequential pattern mining, FreeSpan [8], we propose a more efficient method, called PSP, which offers ordered growth and reduced projected databases. To further improve the performance, a pseudoprojection technique is developed in PrefixSpan. A comprehensive performance study shows that PrefixSpan, in most cases, outperforms the a priori-based algorithm GSP, FreeSpan, and SPADE [29] (a sequential pattern mining algorithm that adopts vertical data format), and PrefixSpan integrated with pseudoprojection is the fastest among all the tested algorithms. Furthermore, this mining methodology can be extended to mining sequential patterns with user-specified constraints. The high promise of the pattern-growth approach may lead to its further extension toward efficient mining of other kinds of frequent patterns, such as frequent substructures.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Sequential pattern mining is an important data mining problem with broad applications. However, it is also a difficult problem since the mining may have to generate or examine a combinatorially explosive number of intermediate subsequences. Most of the previously developed sequential pattern mining methods, such as GSP, explore a candidate generation-and-test approach [1] to reduce the number of candidates to be examined. However, this approach may not be efficient in mining large sequence databases having numerous patterns and/or long patterns. In this paper, we propose a projection-based, sequential pattern-growth approach for efficient mining of sequential patterns. In this approach, a sequence database is recursively projected into a set of smaller projected databases, and sequential patterns are grown in each projected database by exploring only locally frequent fragments. Based on an initial study of the pattern growth-based sequential pattern mining, FreeSpan [8], we propose a more efficient method, called PSP, which offers ordered growth and reduced projected databases. To further improve the performance, a pseudoprojection technique is developed in PrefixSpan. A comprehensive performance study shows that PrefixSpan, in most cases, outperforms the a priori-based algorithm GSP, FreeSpan, and SPADE [29] (a sequential pattern mining algorithm that adopts vertical data format), and PrefixSpan integrated with pseudoprojection is the fastest among all the tested algorithms. Furthermore, this mining methodology can be extended to mining sequential patterns with user-specified constraints. The high promise of the pattern-growth approach may lead to its further extension toward efficient mining of other kinds of frequent patterns, such as frequent substructures.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Sequential pattern mining is an important data mining problem with broad applications. However, it is also a difficult problem since the mining may have to generate or examine a combinatorially explosive number of intermediate subsequences. Most of the previously developed sequential pattern mining methods, such as GSP, explore a candidate generation-and-test approach [1] to reduce the number of candidates to be examined. However, this approach may not be efficient in mining large sequence databases having numerous patterns and/or long patterns. In this paper, we propose a projection-based, sequential pattern-growth approach for efficient mining of sequential patterns. In this approach, a sequence database is recursively projected into a set of smaller projected databases, and sequential patterns are grown in each projected database by exploring only locally frequent fragments. Based on an initial study of the pattern growth-based sequential pattern mining, FreeSpan [8], we propose a more efficient method, called PSP, which offers ordered growth and reduced projected databases. To further improve the performance, a pseudoprojection technique is developed in PrefixSpan. A comprehensive performance study shows that PrefixSpan, in most cases, outperforms the a priori-based algorithm GSP, FreeSpan, and SPADE [29] (a sequential pattern mining algorithm that adopts vertical data format), and PrefixSpan integrated with pseudoprojection is the fastest among all the tested algorithms. Furthermore, this mining methodology can be extended to mining sequential patterns with user-specified constraints. The high promise of the pattern-growth approach may lead to its further extension toward efficient mining of other kinds of frequent patterns, such as frequent substructures.",
"title": "Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach",
"normalizedTitle": "Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach",
"fno": "k1424",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Data Mining Algorithm",
"Sequential Pattern",
"Frequent Pattern",
"Transaction Database",
"Sequence Database",
"Scalability",
"Performance Analysis"
],
"authors": [
{
"givenName": "Jian",
"surname": "Pei",
"fullName": "Jian Pei",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiawei",
"surname": "Han",
"fullName": "Jiawei Han",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Behzad",
"surname": "Mortazavi-Asl",
"fullName": "Behzad Mortazavi-Asl",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianyong",
"surname": "Wang",
"fullName": "Jianyong Wang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helen",
"surname": "Pinto",
"fullName": "Helen Pinto",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qiming",
"surname": "Chen",
"fullName": "Qiming Chen",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Umeshwar",
"surname": "Dayal",
"fullName": "Umeshwar Dayal",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mei-Chun",
"surname": "Hsu",
"fullName": "Mei-Chun Hsu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2004-11-01 00:00:00",
"pubType": "trans",
"pages": "1424-1440",
"year": "2004",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdew/2005/2657/0/22851222",
"title": "LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2005/22851222/12OmNrAv3Wf",
"parentPublication": {
"id": "proceedings/icdew/2005/2657/0",
"title": "21st International Conference on Data Engineering Workshops (ICDEW'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waimw/2006/2705/0/04027178",
"title": "Mining Frequent Induced Subtrees by Prefix-Tree-Projected Pattern Growth",
"doi": null,
"abstractUrl": "/proceedings-article/waimw/2006/04027178/12OmNrYlmEm",
"parentPublication": {
"id": "proceedings/waimw/2006/2705/0",
"title": "2006 Seventh International Conference on Web-Age Information Management Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2014/5880/0/07051967",
"title": "Timed sequential pattern mining based on confidence in accumulated intervals",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2014/07051967/12OmNwErpwX",
"parentPublication": {
"id": "proceedings/iri/2014/5880/0",
"title": "2014 IEEE International Conference on Information Reuse and Integration (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2008/3503/0/3503a583",
"title": "An Efficient Sequential Pattern Mining Algorithm Based on the 2-Sequence Matrix",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2008/3503a583/12OmNwnYG2v",
"parentPublication": {
"id": "proceedings/icdmw/2008/3503/0",
"title": "2008 IEEE International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2009/3557/3/3557e448",
"title": "Application of PrefixSpan* Algorithm in Malware Detection Expert System",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557e448/12OmNyQGRX5",
"parentPublication": {
"id": "proceedings/etcs/2009/3557/3",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncm/2009/3769/0/3769c006",
"title": "Fast and Effective Generation of Candidate-Sequences for Sequential Pattern Mining",
"doi": null,
"abstractUrl": "/proceedings-article/ncm/2009/3769c006/12OmNz61dxJ",
"parentPublication": {
"id": "proceedings/ncm/2009/3769/0",
"title": "Networked Computing and Advanced Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/4/3336g348",
"title": "Parallel Research of Sequential Pattern Data Mining Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g348/12OmNz6iOKL",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2001/1001/0/10010215",
"title": "PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2001/10010215/12OmNzQR1s8",
"parentPublication": {
"id": "proceedings/icde/2001/1001/0",
"title": "Proceedings 17th International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2010/07/ttk2010070913",
"title": "An UpDown Directed Acyclic Graph Approach for Sequential Pattern Mining",
"doi": null,
"abstractUrl": "/journal/tk/2010/07/ttk2010070913/13rRUNvgz4I",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "k1411",
"articleId": "13rRUxASuAO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "k1441",
"articleId": "13rRUIIVlkC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwWoNH",
"title": "July/August",
"year": "2009",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuegp3",
"doi": "10.1109/TVCG.2009.12",
"abstract": "We present an interactive algorithm for continuous collision detection between deformable models. We introduce multiple techniques to improve the culling efficiency and the overall performance of continuous collision detection. First, we present a novel formulation for continuous normal cones and use these normal cones to efficiently cull large regions of the mesh as part of self-collision tests. Second, we introduce the concept of “procedural representative triangles” to remove all redundant elementary tests between nonadjacent triangles. Finally, we exploit the mesh connectivity and introduce the concept of “orphan sets” to eliminate redundant elementary tests between adjacent triangle primitives. In practice, we can reduce the number of elementary tests by two orders of magnitude. These culling techniques have been combined with bounding volume hierarchies and can result in one order of magnitude performance improvement as compared to prior collision detection algorithms for deformable models. We highlight the performance of our algorithm on several benchmarks, including cloth simulations, N-body simulations, and breaking objects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an interactive algorithm for continuous collision detection between deformable models. We introduce multiple techniques to improve the culling efficiency and the overall performance of continuous collision detection. First, we present a novel formulation for continuous normal cones and use these normal cones to efficiently cull large regions of the mesh as part of self-collision tests. Second, we introduce the concept of “procedural representative triangles” to remove all redundant elementary tests between nonadjacent triangles. Finally, we exploit the mesh connectivity and introduce the concept of “orphan sets” to eliminate redundant elementary tests between adjacent triangle primitives. In practice, we can reduce the number of elementary tests by two orders of magnitude. These culling techniques have been combined with bounding volume hierarchies and can result in one order of magnitude performance improvement as compared to prior collision detection algorithms for deformable models. We highlight the performance of our algorithm on several benchmarks, including cloth simulations, N-body simulations, and breaking objects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an interactive algorithm for continuous collision detection between deformable models. We introduce multiple techniques to improve the culling efficiency and the overall performance of continuous collision detection. First, we present a novel formulation for continuous normal cones and use these normal cones to efficiently cull large regions of the mesh as part of self-collision tests. Second, we introduce the concept of “procedural representative triangles” to remove all redundant elementary tests between nonadjacent triangles. Finally, we exploit the mesh connectivity and introduce the concept of “orphan sets” to eliminate redundant elementary tests between adjacent triangle primitives. In practice, we can reduce the number of elementary tests by two orders of magnitude. These culling techniques have been combined with bounding volume hierarchies and can result in one order of magnitude performance improvement as compared to prior collision detection algorithms for deformable models. We highlight the performance of our algorithm on several benchmarks, including cloth simulations, N-body simulations, and breaking objects.",
"title": "ICCD: Interactive Continuous Collision Detection between Deformable Models Using Connectivity-Based Culling",
"normalizedTitle": "ICCD: Interactive Continuous Collision Detection between Deformable Models Using Connectivity-Based Culling",
"fno": "ttg2009040544",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Continuous Collision Detection",
"Deformable Models",
"Continuous Normal Cones",
"Orphan Set",
"Self Collision",
"Bounding Volume Hierarchies"
],
"authors": [
{
"givenName": "Min",
"surname": "Tang",
"fullName": "Min Tang",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sean",
"surname": "Curtis",
"fullName": "Sean Curtis",
"affiliation": "University of North Carolina, Chapel Hill",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sung-Eui",
"surname": "Yoon",
"fullName": "Sung-Eui Yoon",
"affiliation": "Korea Advanced Institute of Science and Technology, DaeJeon",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dinesh",
"surname": "Manocha",
"fullName": "Dinesh Manocha",
"affiliation": "University of North Carolina, Chapel Hill",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2009-07-01 00:00:00",
"pubType": "trans",
"pages": "544-557",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccsee/2012/4647/3/4647c557",
"title": "Collision Detection Research for Deformable Objects",
"doi": null,
"abstractUrl": "/proceedings-article/iccsee/2012/4647c557/12OmNAXxWYc",
"parentPublication": {
"id": "proceedings/iccsee/2012/4647/3",
"title": "Computer Science and Electronics Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icecs/2009/3937/0/3937a436",
"title": "Bounding-Volume Hierarchies Technique for Detecting Object Interference in Urban Environment Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icecs/2009/3937a436/12OmNAndiev",
"parentPublication": {
"id": "proceedings/icecs/2009/3937/0",
"title": "Environmental and Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2015/8020/0/07450271",
"title": "A Simple Filtering Algorithm for Continuous Collision Detection Using Taylor Models",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2015/07450271/12OmNBTawni",
"parentPublication": {
"id": "proceedings/cad-graphics/2015/8020/0",
"title": "2015 14th International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/2/3962c853",
"title": "Optimization of Collision Detection Algorithm Based on OBB",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962c853/12OmNCwCLou",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/2",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifcsta/2009/3930/3/3930c410",
"title": "A Collision Detection Method Based on the Virtual Occluders",
"doi": null,
"abstractUrl": "/proceedings-article/ifcsta/2009/3930c410/12OmNzVGcNi",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icctd/2009/3892/2/3892b430",
"title": "On Faster Bounding Volume Hierarchy Construction for Avatar Collision Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icctd/2009/3892b430/12OmNzyp63p",
"parentPublication": {
"id": "proceedings/icctd/2009/3892/2",
"title": "Computer Technology and Development, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/01/v0021",
"title": "Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs",
"doi": null,
"abstractUrl": "/journal/tg/1998/01/v0021/13rRUNvgyW9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/06/v0649",
"title": "Image-Based Collision Detection for Deformable Cloth Models",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0649/13rRUNvgz9z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0143",
"title": "Fast and Reliable Collision Culling Using Graphics Hardware",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0143/13rRUwgyOjb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/07/ttg2012071146",
"title": "Simple Culling Methods for Continuous Collision Detection of Deforming Triangles",
"doi": null,
"abstractUrl": "/journal/tg/2012/07/ttg2012071146/13rRUxcKzVj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009040530",
"articleId": "13rRUwInvsG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009040558",
"articleId": "13rRUxZ0o1q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzA6GUu",
"title": "Sept.",
"year": "2018",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "40",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcbnDR",
"doi": "10.1109/TPAMI.2017.2750687",
"abstract": "Most approaches to face alignment treat the face as a 2D object, which fails to represent depth variation and is vulnerable to loss of shape consistency when the face rotates along a 3D axis. Because faces commonly rotate three dimensionally, 2D approaches are vulnerable to significant error. 3D morphable models, employed as a second step in 2D+3D approaches are robust to face rotation but are computationally too expensive for many applications, yet their ability to maintain viewpoint consistency is unknown. We present an alternative approach that estimates 3D face landmarks in a single face image. The method uses a regression forest-based algorithm that adds a third dimension to the common cascade pipeline. 3D face landmarks are estimated directly, which avoids fitting a 3D morphable model. The proposed method achieves viewpoint consistency in a computationally efficient manner that is robust to 3D face rotation. To train and test our approach, we introduce the Multi-PIE Viewpoint Consistent database. In empirical tests, the proposed method achieved simple yet effective head pose estimation and viewpoint consistency on multiple measures relative to alternative approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most approaches to face alignment treat the face as a 2D object, which fails to represent depth variation and is vulnerable to loss of shape consistency when the face rotates along a 3D axis. Because faces commonly rotate three dimensionally, 2D approaches are vulnerable to significant error. 3D morphable models, employed as a second step in 2D+3D approaches are robust to face rotation but are computationally too expensive for many applications, yet their ability to maintain viewpoint consistency is unknown. We present an alternative approach that estimates 3D face landmarks in a single face image. The method uses a regression forest-based algorithm that adds a third dimension to the common cascade pipeline. 3D face landmarks are estimated directly, which avoids fitting a 3D morphable model. The proposed method achieves viewpoint consistency in a computationally efficient manner that is robust to 3D face rotation. To train and test our approach, we introduce the Multi-PIE Viewpoint Consistent database. In empirical tests, the proposed method achieved simple yet effective head pose estimation and viewpoint consistency on multiple measures relative to alternative approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most approaches to face alignment treat the face as a 2D object, which fails to represent depth variation and is vulnerable to loss of shape consistency when the face rotates along a 3D axis. Because faces commonly rotate three dimensionally, 2D approaches are vulnerable to significant error. 3D morphable models, employed as a second step in 2D+3D approaches are robust to face rotation but are computationally too expensive for many applications, yet their ability to maintain viewpoint consistency is unknown. We present an alternative approach that estimates 3D face landmarks in a single face image. The method uses a regression forest-based algorithm that adds a third dimension to the common cascade pipeline. 3D face landmarks are estimated directly, which avoids fitting a 3D morphable model. The proposed method achieves viewpoint consistency in a computationally efficient manner that is robust to 3D face rotation. To train and test our approach, we introduce the Multi-PIE Viewpoint Consistent database. In empirical tests, the proposed method achieved simple yet effective head pose estimation and viewpoint consistency on multiple measures relative to alternative approaches.",
"title": "Viewpoint-Consistent 3D Face Alignment",
"normalizedTitle": "Viewpoint-Consistent 3D Face Alignment",
"fno": "08031057",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Face Recognition",
"Image Morphing",
"Pose Estimation",
"Regression Analysis",
"Solid Modelling",
"Depth Variation",
"Shape Consistency",
"3 D Morphable Model",
"Face Image",
"Viewpoint Consistent 3 D Face Alignment",
"3 D Face Landmark",
"3 D Face Rotation",
"Head Pose Estimation",
"Multi PIE Viewpoint Consistent Database",
"Regression Forest Based Algorithm",
"Viewpoint Consistency",
"Face",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Shape",
"Solid Modeling",
"Active Appearance Model",
"Customer Relationship Management",
"Face Alignment",
"3 D Face Shape",
"Morphable Model"
],
"authors": [
{
"givenName": "Sergey",
"surname": "Tulyakov",
"fullName": "Sergey Tulyakov",
"affiliation": "Snapchat Research, Venice, CA90291",
"__typename": "ArticleAuthorType"
},
{
"givenName": "László A.",
"surname": "Jeni",
"fullName": "László A. Jeni",
"affiliation": "Robotics Institute, Carnegie Mellon University, Pittsburgh, PA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey F.",
"surname": "Cohn",
"fullName": "Jeffrey F. Cohn",
"affiliation": "Robotics Institute, Carnegie Mellon University, Pittsburgh, PA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicu",
"surname": "Sebe",
"fullName": "Nicu Sebe",
"affiliation": "Department of Information Engineering and Computer Science, University of Trento, Trento, TN, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2018-09-01 00:00:00",
"pubType": "trans",
"pages": "2250-2264",
"year": "2018",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bdcloud/2015/7183/0/7183a191",
"title": "The Research of Human-Computer Interaction Model Based on the Morhpable Model Based 3D Face Synthesis in the Speech Rehabilitation for Deaf Children",
"doi": null,
"abstractUrl": "/proceedings-article/bdcloud/2015/7183a191/12OmNBV9Ii5",
"parentPublication": {
"id": "proceedings/bdcloud/2015/7183/0",
"title": "2015 IEEE Fifth International Conference on Big Data and Cloud Computing (BDCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034c512",
"title": "Pix2Face: Direct 3D Face Model Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c512/12OmNxWuiy8",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/03/08571265",
"title": "Joint Face Alignment and 3D Face Reconstruction with Application to Face Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2020/03/08571265/17D45WnnFYh",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000f216",
"title": "Disentangling Features in 3D Face Shapes for Joint Face Reconstruction and Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000f216/17D45WrVgfL",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/01/08122025",
"title": "Face Alignment in Full Pose Range: A 3D Total Solution",
"doi": null,
"abstractUrl": "/journal/tp/2019/01/08122025/17D45XDIXWd",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000h346",
"title": "Nonlinear 3D Face Morphable Model",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000h346/17D45Xi9rWU",
"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/mlbdbi/2019/5094/0/509400a057",
"title": "A Survey for 2D and 3D Face Alignment",
"doi": null,
"abstractUrl": "/proceedings-article/mlbdbi/2019/509400a057/1gjRJeUDXjO",
"parentPublication": {
"id": "proceedings/mlbdbi/2019/5094/0",
"title": "2019 International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2019/5023/0/502300a504",
"title": "Dual Attention MobDenseNet(DAMDNet) for Robust 3D Face Alignment",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300a504/1i5mJNuBDeE",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2020/3079/0/307900a762",
"title": "Learning Monocular Face Reconstruction using Multi-View Supervision",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a762/1kecIWq8r60",
"parentPublication": {
"id": "proceedings/fg/2020/3079/0/",
"title": "2020 15th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2020) (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412196",
"title": "Joint Face Alignment and 3D Face Reconstruction with Efficient Convolution Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412196/1tmhXlPBJM4",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08030083",
"articleId": "13rRUxYrbNF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08048554",
"articleId": "13rRUxly8Um",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1KsRWKKVV7i",
"title": "March",
"year": "2023",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DgjxKYUUpi",
"doi": "10.1109/TPAMI.2022.3174072",
"abstract": "Detecting objects and estimating their viewpoints in images are key tasks of 3D scene understanding. Recent approaches have achieved excellent results on very large benchmarks for object detection and viewpoint estimation. However, performances are still lagging behind for novel object categories with few samples. In this paper, we tackle the problems of few-shot object detection and few-shot viewpoint estimation. We demonstrate on both tasks the benefits of guiding the network prediction with class-representative features extracted from data in different modalities: image patches for object detection, and aligned 3D models for viewpoint estimation. Despite its simplicity, our method outperforms state-of-the-art methods by a large margin on a range of datasets, including PASCAL and COCO for few-shot object detection, and Pascal3D+ and ObjectNet3D for few-shot viewpoint estimation. Furthermore, when the 3D model is not available, we introduce a simple category-agnostic viewpoint estimation method by exploiting geometrical similarities and consistent pose labeling across different classes. While it moderately reduces performance, this approach still obtains better results than previous methods in this setting. Last, for the first time, we tackle the combination of both few-shot tasks, on three challenging benchmarks for viewpoint estimation in the wild, ObjectNet3D, Pascal3D+ and Pix3D, showing very promising results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Detecting objects and estimating their viewpoints in images are key tasks of 3D scene understanding. Recent approaches have achieved excellent results on very large benchmarks for object detection and viewpoint estimation. However, performances are still lagging behind for novel object categories with few samples. In this paper, we tackle the problems of few-shot object detection and few-shot viewpoint estimation. We demonstrate on both tasks the benefits of guiding the network prediction with class-representative features extracted from data in different modalities: image patches for object detection, and aligned 3D models for viewpoint estimation. Despite its simplicity, our method outperforms state-of-the-art methods by a large margin on a range of datasets, including PASCAL and COCO for few-shot object detection, and Pascal3D+ and ObjectNet3D for few-shot viewpoint estimation. Furthermore, when the 3D model is not available, we introduce a simple category-agnostic viewpoint estimation method by exploiting geometrical similarities and consistent pose labeling across different classes. While it moderately reduces performance, this approach still obtains better results than previous methods in this setting. Last, for the first time, we tackle the combination of both few-shot tasks, on three challenging benchmarks for viewpoint estimation in the wild, ObjectNet3D, Pascal3D+ and Pix3D, showing very promising results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Detecting objects and estimating their viewpoints in images are key tasks of 3D scene understanding. Recent approaches have achieved excellent results on very large benchmarks for object detection and viewpoint estimation. However, performances are still lagging behind for novel object categories with few samples. In this paper, we tackle the problems of few-shot object detection and few-shot viewpoint estimation. We demonstrate on both tasks the benefits of guiding the network prediction with class-representative features extracted from data in different modalities: image patches for object detection, and aligned 3D models for viewpoint estimation. Despite its simplicity, our method outperforms state-of-the-art methods by a large margin on a range of datasets, including PASCAL and COCO for few-shot object detection, and Pascal3D+ and ObjectNet3D for few-shot viewpoint estimation. Furthermore, when the 3D model is not available, we introduce a simple category-agnostic viewpoint estimation method by exploiting geometrical similarities and consistent pose labeling across different classes. While it moderately reduces performance, this approach still obtains better results than previous methods in this setting. Last, for the first time, we tackle the combination of both few-shot tasks, on three challenging benchmarks for viewpoint estimation in the wild, ObjectNet3D, Pascal3D+ and Pix3D, showing very promising results.",
"title": "Few-Shot Object Detection and Viewpoint Estimation for Objects in the Wild",
"normalizedTitle": "Few-Shot Object Detection and Viewpoint Estimation for Objects in the Wild",
"fno": "09772268",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computer Vision",
"Feature Extraction",
"Image Reconstruction",
"Image Representation",
"Image Sampling",
"Learning Artificial Intelligence",
"Object Detection",
"Object Recognition",
"Pose Estimation",
"Solid Modelling",
"Supervised Learning",
"3 D Scene Understanding",
"Few Shot Object Detection",
"Few Shot Tasks",
"Few Shot Viewpoint Estimation",
"Object Categories",
"Simple Category Agnostic Viewpoint Estimation Method",
"Estimation",
"Three Dimensional Displays",
"Object Detection",
"Feature Extraction",
"Task Analysis",
"Solid Modeling",
"Training",
"Few Shot Learning",
"Meta Learning",
"Object Detection",
"Viewpoint Estimation"
],
"authors": [
{
"givenName": "Yang",
"surname": "Xiao",
"fullName": "Yang Xiao",
"affiliation": "LIGM, Ecole des Ponts, CNRS, Université Gustave Eiffel, Marne-la-Vallée, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Vincent",
"surname": "Lepetit",
"fullName": "Vincent Lepetit",
"affiliation": "LIGM, Ecole des Ponts, CNRS, Université Gustave Eiffel, Marne-la-Vallée, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Renaud",
"surname": "Marlet",
"fullName": "Renaud Marlet",
"affiliation": "LIGM, Ecole des Ponts, CNRS, Université Gustave Eiffel, Marne-la-Vallée, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "3090-3106",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2015/6759/0/07301358",
"title": "3D object class detection in the wild",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2015/07301358/12OmNAndiqi",
"parentPublication": {
"id": "proceedings/cvprw/2015/6759/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2014/4985/0/06836101",
"title": "Beyond PASCAL: A benchmark for 3D object detection in the wild",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2014/06836101/12OmNxETai1",
"parentPublication": {
"id": "proceedings/wacv/2014/4985/0",
"title": "2014 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000d022",
"title": "3D Pose Estimation and 3D Model Retrieval for Objects in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000d022/17D45WK5Akz",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200k0398",
"title": "ViewNet: Unsupervised Viewpoint Estimation from Conditional Generation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200k0398/1BmFemyWFnW",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwecai/2022/7997/0/799700a047",
"title": "Viewpoint estimation of image object based on parameters sharing network",
"doi": null,
"abstractUrl": "/proceedings-article/iwecai/2022/799700a047/1CuguZI4sJG",
"parentPublication": {
"id": "proceedings/iwecai/2022/7997/0",
"title": "2022 3rd International Conference on Electronic Communication and Artificial Intelligence (IWECAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g804",
"title": "FS6D: Few-Shot 6D Pose Estimation of Novel Objects",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g804/1H0NF0SAxag",
"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/694600g825",
"title": "OSOP: A Multi-Stage One Shot Object Pose Estimation Framework",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g825/1H1l85bTJqE",
"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/icmew/2021/4989/0/09455981",
"title": "Contrastive Representation For Few-Shot Vehicle Footprint Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2021/09455981/1uCgtbuFDc4",
"parentPublication": {
"id": "proceedings/icmew/2021/4989/0",
"title": "2021 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900i869",
"title": "Few-shot 3D Point Cloud Semantic Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900i869/1yeK4j84g7e",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800a074",
"title": "PoseContrast: Class-Agnostic Object Viewpoint Estimation in the Wild with Pose-Aware Contrastive Learning",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800a074/1zWE5gXwM5q",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10036241",
"articleId": "1KsSlMLBA9W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09772949",
"articleId": "1DhYywdGbwk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7sA",
"doi": "10.1109/TVCG.2011.220",
"abstract": "Multidimensional projection techniques have experienced many improvements lately, mainly regarding computational times and accuracy. However, existing methods do not yet provide flexible enough mechanisms for visualization-oriented fully interactive applications. This work presents a new multidimensional projection technique designed to be more flexible and versatile than other methods. This novel approach, called Local Affine Multidimensional Projection (LAMP), relies on orthogonal mapping theory to build accurate local transformations that can be dynamically modified according to user knowledge. The accuracy, flexibility and computational efficiency of LAMP is confirmed by a comprehensive set of comparisons. LAMP's versatility is exploited in an application which seeks to correlate data that, in principle, has no connection as well as in visual exploration of textual documents.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multidimensional projection techniques have experienced many improvements lately, mainly regarding computational times and accuracy. However, existing methods do not yet provide flexible enough mechanisms for visualization-oriented fully interactive applications. This work presents a new multidimensional projection technique designed to be more flexible and versatile than other methods. This novel approach, called Local Affine Multidimensional Projection (LAMP), relies on orthogonal mapping theory to build accurate local transformations that can be dynamically modified according to user knowledge. The accuracy, flexibility and computational efficiency of LAMP is confirmed by a comprehensive set of comparisons. LAMP's versatility is exploited in an application which seeks to correlate data that, in principle, has no connection as well as in visual exploration of textual documents.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multidimensional projection techniques have experienced many improvements lately, mainly regarding computational times and accuracy. However, existing methods do not yet provide flexible enough mechanisms for visualization-oriented fully interactive applications. This work presents a new multidimensional projection technique designed to be more flexible and versatile than other methods. This novel approach, called Local Affine Multidimensional Projection (LAMP), relies on orthogonal mapping theory to build accurate local transformations that can be dynamically modified according to user knowledge. The accuracy, flexibility and computational efficiency of LAMP is confirmed by a comprehensive set of comparisons. LAMP's versatility is exploited in an application which seeks to correlate data that, in principle, has no connection as well as in visual exploration of textual documents.",
"title": "Local Affine Multidimensional Projection",
"normalizedTitle": "Local Affine Multidimensional Projection",
"fno": "ttg2011122563",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Multidimensional Projection",
"High Dimensional Data",
"Visual Data Mining"
],
"authors": [
{
"givenName": "Paulo",
"surname": "Joia",
"fullName": "Paulo Joia",
"affiliation": "Universidade de São Paulo (USP)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danilo",
"surname": "Coimbra",
"fullName": "Danilo Coimbra",
"affiliation": "Universidade de São Paulo (USP)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "José A.",
"surname": "Cuminato",
"fullName": "José A. Cuminato",
"affiliation": "Universidade de São Paulo (USP)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fernando V.",
"surname": "Paulovich",
"fullName": "Fernando V. Paulovich",
"affiliation": "Universidade de São Paulo (USP)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luis G.",
"surname": "Nonato",
"fullName": "Luis G. Nonato",
"affiliation": "Universidade de São Paulo (USP)",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2563-2571",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2012/4829/0/4829a032",
"title": "Colorization by Multidimensional Projection",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2012/4829a032/12OmNBsLPdX",
"parentPublication": {
"id": "proceedings/sibgrapi/2012/4829/0",
"title": "2012 25th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmc/2009/3501/1/3501a424",
"title": "Comparative Performance Analysis of Three Sub-Optimal Projection Techniques for Multidimensional Signal Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cmc/2009/3501a424/12OmNCd2rD8",
"parentPublication": {
"id": "cmc/2009/3501/1",
"title": "Communications and Mobile Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2017/2219/0/2219a351",
"title": "An Approach to Perform Local Analysis on Multidimensional Projection",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2017/2219a351/12OmNx4Q6AV",
"parentPublication": {
"id": "proceedings/sibgrapi/2017/2219/0",
"title": "2017 30th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1988/9999/0/00197233",
"title": "Optimal projection for multidimensional signal detection",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1988/00197233/12OmNxYtu77",
"parentPublication": {
"id": "proceedings/icassp/1988/9999/0",
"title": "ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2011/4548/0/4548a125",
"title": "Projection-Based Image Retrieval Using Class-Specific Metrics",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2011/4548a125/12OmNyQ7FZw",
"parentPublication": {
"id": "proceedings/sibgrapi/2011/4548/0",
"title": "2011 24th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2007/2996/0/29960027",
"title": "The Projection Explorer: A Flexible Tool for Projection-based Multidimensional Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2007/29960027/12OmNz4SOz6",
"parentPublication": {
"id": "proceedings/sibgrapi/2007/2996/0",
"title": "XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2012/4752/0/06400489",
"title": "iLAMP: Exploring high-dimensional spacing through backward multidimensional projection",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2012/06400489/12OmNzFMFqy",
"parentPublication": {
"id": "proceedings/vast/2012/4752/0",
"title": "2012 IEEE Conference on Visual Analytics Science and Technology (VAST 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/04/mcs2012040074",
"title": "User-Centered Multidimensional Projection Techniques",
"doi": null,
"abstractUrl": "/magazine/cs/2012/04/mcs2012040074/13rRUy3gn1n",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061281",
"title": "Two-Phase Mapping for Projecting Massive Data Sets",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061281/13rRUynHuj5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222353",
"title": "Implicit Multidimensional Projection of Local Subspaces",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222353/1nTqcxPMEIE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122555",
"articleId": "13rRUyYjKac",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122572",
"articleId": "13rRUxD9h55",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRZP",
"name": "ttg2011122563s1.wmv",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2011122563s1.wmv",
"extension": "wmv",
"size": "11.4 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1zBamVZHyne",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "28",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xic9jxItoI",
"doi": "10.1109/TVCG.2021.3114833",
"abstract": "We propose Steadiness and Cohesiveness, two novel metrics to measure the inter-cluster reliability of multidimensional projection (MDP), specifically how well the inter-cluster structures are preserved between the original high-dimensional space and the low-dimensional projection space. Measuring inter-cluster reliability is crucial as it directly affects how well inter-cluster tasks (e.g., identifying cluster relationships in the original space from a projected view) can be conducted; however, despite the importance of inter-cluster tasks, we found that previous metrics, such as Trustworthiness and Continuity, fail to measure inter-cluster reliability. Our metrics consider two aspects of the inter-cluster reliability: Steadiness measures the extent to which clusters in the projected space form clusters in the original space, and Cohesiveness measures the opposite. They extract random clusters with arbitrary shapes and positions in one space and evaluate how much the clusters are stretched or dispersed in the other space. Furthermore, our metrics can quantify pointwise distortions, allowing for the visualization of inter-cluster reliability in a projection, which we call a reliability map. Through quantitative experiments, we verify that our metrics precisely capture the distortions that harm inter-cluster reliability while previous metrics have difficulty capturing the distortions. A case study also demonstrates that our metrics and the reliability map 1) support users in selecting the proper projection techniques or hyperparameters and 2) prevent misinterpretation while performing inter-cluster tasks, thus allow an adequate identification of inter-cluster structure.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose Steadiness and Cohesiveness, two novel metrics to measure the inter-cluster reliability of multidimensional projection (MDP), specifically how well the inter-cluster structures are preserved between the original high-dimensional space and the low-dimensional projection space. Measuring inter-cluster reliability is crucial as it directly affects how well inter-cluster tasks (e.g., identifying cluster relationships in the original space from a projected view) can be conducted; however, despite the importance of inter-cluster tasks, we found that previous metrics, such as Trustworthiness and Continuity, fail to measure inter-cluster reliability. Our metrics consider two aspects of the inter-cluster reliability: Steadiness measures the extent to which clusters in the projected space form clusters in the original space, and Cohesiveness measures the opposite. They extract random clusters with arbitrary shapes and positions in one space and evaluate how much the clusters are stretched or dispersed in the other space. Furthermore, our metrics can quantify pointwise distortions, allowing for the visualization of inter-cluster reliability in a projection, which we call a reliability map. Through quantitative experiments, we verify that our metrics precisely capture the distortions that harm inter-cluster reliability while previous metrics have difficulty capturing the distortions. A case study also demonstrates that our metrics and the reliability map 1) support users in selecting the proper projection techniques or hyperparameters and 2) prevent misinterpretation while performing inter-cluster tasks, thus allow an adequate identification of inter-cluster structure.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose Steadiness and Cohesiveness, two novel metrics to measure the inter-cluster reliability of multidimensional projection (MDP), specifically how well the inter-cluster structures are preserved between the original high-dimensional space and the low-dimensional projection space. Measuring inter-cluster reliability is crucial as it directly affects how well inter-cluster tasks (e.g., identifying cluster relationships in the original space from a projected view) can be conducted; however, despite the importance of inter-cluster tasks, we found that previous metrics, such as Trustworthiness and Continuity, fail to measure inter-cluster reliability. Our metrics consider two aspects of the inter-cluster reliability: Steadiness measures the extent to which clusters in the projected space form clusters in the original space, and Cohesiveness measures the opposite. They extract random clusters with arbitrary shapes and positions in one space and evaluate how much the clusters are stretched or dispersed in the other space. Furthermore, our metrics can quantify pointwise distortions, allowing for the visualization of inter-cluster reliability in a projection, which we call a reliability map. Through quantitative experiments, we verify that our metrics precisely capture the distortions that harm inter-cluster reliability while previous metrics have difficulty capturing the distortions. A case study also demonstrates that our metrics and the reliability map 1) support users in selecting the proper projection techniques or hyperparameters and 2) prevent misinterpretation while performing inter-cluster tasks, thus allow an adequate identification of inter-cluster structure.",
"title": "Measuring and Explaining the Inter-Cluster Reliability of Multidimensional Projections",
"normalizedTitle": "Measuring and Explaining the Inter-Cluster Reliability of Multidimensional Projections",
"fno": "09552206",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Distortion",
"Reliability",
"Measurement",
"Distortion Measurement",
"Task Analysis",
"Data Visualization",
"Extraterrestrial Measurements",
"Multidimensional Projections",
"MDP Distortions",
"Inter Cluster Tasks",
"Inter Cluster Reliability",
"Distortion Metrics"
],
"authors": [
{
"givenName": "Hyeon",
"surname": "Jeon",
"fullName": "Hyeon Jeon",
"affiliation": "Seoul National University, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hyung-Kwon",
"surname": "Ko",
"fullName": "Hyung-Kwon Ko",
"affiliation": "Seoul National University, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jaemin",
"surname": "Jo",
"fullName": "Jaemin Jo",
"affiliation": "Sungkyunkwan University, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Youngtaek",
"surname": "Kim",
"fullName": "Youngtaek Kim",
"affiliation": "Seoul National University, South Korea",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jinwook",
"surname": "Seo",
"fullName": "Jinwook Seo",
"affiliation": "Seoul National University, South Korea",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "551-561",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/issre/1991/2143/0/00145346",
"title": "The use of software complexity metrics in software reliability modeling",
"doi": null,
"abstractUrl": "/proceedings-article/issre/1991/00145346/12OmNBgQFNh",
"parentPublication": {
"id": "proceedings/issre/1991/2143/0",
"title": "Proceedings. 1991 International Symposium on Software Reliability Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/1992/2975/0/00285897",
"title": "Software quality metrics in space systems",
"doi": null,
"abstractUrl": "/proceedings-article/issre/1992/00285897/12OmNqJq4hg",
"parentPublication": {
"id": "proceedings/issre/1992/2975/0",
"title": "Proceedings Third International Symposium on Software Reliability Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-icess/2010/4214/0/4214a573",
"title": "A Trade-Off Between Reliability and Energy Efficiency for Inter-cluster Communication in Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-icess/2010/4214a573/12OmNrYCY06",
"parentPublication": {
"id": "proceedings/hpcc-icess/2010/4214/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/icassp/2004/8484/1/01326030",
"title": "Predicting foreground SH, SL and BNH DAM scores for multidimensional objective measure of speech quality",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326030/12OmNro0I2c",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/1",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2015/7568/0/7568a133",
"title": "Simplified Stress and Simplified Silhouette Coefficient to a Faster Quality Evaluation of Multidimensional Projection Techniques and Feature Spaces",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2015/7568a133/12OmNscOUa1",
"parentPublication": {
"id": "proceedings/iv/2015/7568/0",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118202",
"title": "Measuring image structures using a multiscale orientation field",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118202/12OmNvjgWA4",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ats/2016/3809/0/3809a240",
"title": "Modeling Residual Lifetime of an IC Considering Spatial and Inter-Temporal Temperature Variations",
"doi": null,
"abstractUrl": "/proceedings-article/ats/2016/3809a240/12OmNzA6GKq",
"parentPublication": {
"id": "proceedings/ats/2016/3809/0",
"title": "2016 IEEE 25th Asian Test Symposium (ATS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/091500c763",
"title": "A Riemannian Framework for Analysis of Human Body Surface",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500c763/1B131rXOZDq",
"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/2022/12/09448469",
"title": "A Topological Similarity Measure Between Multi-Resolution Reeb Spaces",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09448469/1ugE7gaINC8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900i581",
"title": "Passive Inter-Photon Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900i581/1yeJuqwiGWs",
"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": "09552929",
"articleId": "1xic3zJwVwI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09552224",
"articleId": "1xibZvRmYzm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1zBb3VjZlKw",
"name": "ttg202201-09552206s1-supp2-3114833.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552206s1-supp2-3114833.pdf",
"extension": "pdf",
"size": "10.6 MB",
"__typename": "WebExtraType"
},
{
"id": "1zBb3kw615S",
"name": "ttg202201-09552206s1-supp1-3114833.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552206s1-supp1-3114833.mp4",
"extension": "mp4",
"size": "91.7 MB",
"__typename": "WebExtraType"
},
{
"id": "1zBb42t5bNe",
"name": "ttg202201-09552206s1-supp3-3114833.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202201-09552206s1-supp3-3114833.pdf",
"extension": "pdf",
"size": "4.52 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDY",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1dgdXsKkxeo",
"doi": "10.1109/TVCG.2019.2934261",
"abstract": "The performance of deep learning models is dependent on the precise configuration of many layers and parameters. However, there are currently few systematic guidelines for how to configure a successful model. This means model builders often have to experiment with different configurations by manually programming different architectures (which is tedious and time consuming) or rely on purely automated approaches to generate and train the architectures (which is expensive). In this paper, we present Rapid Exploration of Model Architectures and Parameters, or REMAP, a visual analytics tool that allows a model builder to discover a deep learning model quickly via exploration and rapid experimentation of neural network architectures. In REMAP, the user explores the large and complex parameter space for neural network architectures using a combination of global inspection and local experimentation. Through a visual overview of a set of models, the user identifies interesting clusters of architectures. Based on their findings, the user can run ablation and variation experiments to identify the effects of adding, removing, or replacing layers in a given architecture and generate new models accordingly. They can also handcraft new models using a simple graphical interface. As a result, a model builder can build deep learning models quickly, efficiently, and without manual programming. We inform the design of REMAP through a design study with four deep learning model builders. Through a use case, we demonstrate that REMAP allows users to discover performant neural network architectures efficiently using visual exploration and user-defined semi-automated searches through the model space.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The performance of deep learning models is dependent on the precise configuration of many layers and parameters. However, there are currently few systematic guidelines for how to configure a successful model. This means model builders often have to experiment with different configurations by manually programming different architectures (which is tedious and time consuming) or rely on purely automated approaches to generate and train the architectures (which is expensive). In this paper, we present Rapid Exploration of Model Architectures and Parameters, or REMAP, a visual analytics tool that allows a model builder to discover a deep learning model quickly via exploration and rapid experimentation of neural network architectures. In REMAP, the user explores the large and complex parameter space for neural network architectures using a combination of global inspection and local experimentation. Through a visual overview of a set of models, the user identifies interesting clusters of architectures. Based on their findings, the user can run ablation and variation experiments to identify the effects of adding, removing, or replacing layers in a given architecture and generate new models accordingly. They can also handcraft new models using a simple graphical interface. As a result, a model builder can build deep learning models quickly, efficiently, and without manual programming. We inform the design of REMAP through a design study with four deep learning model builders. Through a use case, we demonstrate that REMAP allows users to discover performant neural network architectures efficiently using visual exploration and user-defined semi-automated searches through the model space.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The performance of deep learning models is dependent on the precise configuration of many layers and parameters. However, there are currently few systematic guidelines for how to configure a successful model. This means model builders often have to experiment with different configurations by manually programming different architectures (which is tedious and time consuming) or rely on purely automated approaches to generate and train the architectures (which is expensive). In this paper, we present Rapid Exploration of Model Architectures and Parameters, or REMAP, a visual analytics tool that allows a model builder to discover a deep learning model quickly via exploration and rapid experimentation of neural network architectures. In REMAP, the user explores the large and complex parameter space for neural network architectures using a combination of global inspection and local experimentation. Through a visual overview of a set of models, the user identifies interesting clusters of architectures. Based on their findings, the user can run ablation and variation experiments to identify the effects of adding, removing, or replacing layers in a given architecture and generate new models accordingly. They can also handcraft new models using a simple graphical interface. As a result, a model builder can build deep learning models quickly, efficiently, and without manual programming. We inform the design of REMAP through a design study with four deep learning model builders. Through a use case, we demonstrate that REMAP allows users to discover performant neural network architectures efficiently using visual exploration and user-defined semi-automated searches through the model space.",
"title": "Ablate, Variate, and Contemplate: Visual Analytics for Discovering Neural Architectures",
"normalizedTitle": "Ablate, Variate, and Contemplate: Visual Analytics for Discovering Neural Architectures",
"fno": "08827593",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Analysis",
"Data Visualisation",
"Learning Artificial Intelligence",
"Neural Net Architecture",
"Graphical Interface",
"Rapid Exploration Of Model Architectures And Parameters",
"Visual Analytics Tool",
"Neural Network Architectures",
"Deep Learning Model Builders",
"REMAP",
"Neural Networks",
"Computer Architecture",
"Tools",
"Training",
"Visual Analytics",
"Machine Learning",
"Visual Analytics",
"Neural Networks",
"Parameter Space Exploration"
],
"authors": [
{
"givenName": "Dylan",
"surname": "Cashman",
"fullName": "Dylan Cashman",
"affiliation": "Tufts University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adam",
"surname": "Perer",
"fullName": "Adam Perer",
"affiliation": "Carnegie Mellon University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Remco",
"surname": "Chang",
"fullName": "Remco Chang",
"affiliation": "Tufts University, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hendrik",
"surname": "Strobelt",
"fullName": "Hendrik Strobelt",
"affiliation": "MIT IBM Watson AI Lab, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "863-873",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2017/5738/0/08031598",
"title": "Aeonium: Visual analytics to support collaborative qualitative coding",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031598/12OmNvwTGDl",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/08/mco2013080090",
"title": "Bixplorer: Visual Analytics with Biclusters",
"doi": null,
"abstractUrl": "/magazine/co/2013/08/mco2013080090/13rRUwcAqvs",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/08/08371286",
"title": "Visual Analytics in Deep Learning: An Interrogative Survey for the Next Frontiers",
"doi": null,
"abstractUrl": "/journal/tg/2019/08/08371286/13rRUxD9gXQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08534019",
"title": "Multiple Workspaces in Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534019/17D45W9KVIu",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvlsi/2022/6605/0/660500a158",
"title": "Performance Evaluation of Video Analytics Workloads on Emerging Processing-In-Memory Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/isvlsi/2022/660500a158/1HzC6bIfTQA",
"parentPublication": {
"id": "proceedings/isvlsi/2022/6605/0",
"title": "2022 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlui/2018/4063/0/10075647",
"title": "HyperTuner: Visual Analytics for Hyperparameter Tuning by Professionals",
"doi": null,
"abstractUrl": "/proceedings-article/mlui/2018/10075647/1LIRyBc2BXi",
"parentPublication": {
"id": "proceedings/mlui/2018/4063/0",
"title": "2018 IEEE Workshop on Machine Learning from User Interaction for Visualization and Analytics (MLUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805420",
"title": "FairSight: Visual Analytics for Fairness in Decision Making",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805420/1cG4psmkNQA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08812988",
"title": "Explaining Vulnerabilities to Adversarial Machine Learning through Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08812988/1cOhCfAgaZO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vizsec/2019/3876/0/09161563",
"title": "A Visual Analytics Framework for Adversarial Text Generation",
"doi": null,
"abstractUrl": "/proceedings-article/vizsec/2019/09161563/1m6hHu2C1LG",
"parentPublication": {
"id": "proceedings/vizsec/2019/3876/0",
"title": "2019 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2020/8009/0/800900a012",
"title": "Diagnosing Concept Drift with Visual Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2020/800900a012/1q7jvQC41gs",
"parentPublication": {
"id": "proceedings/vast/2020/8009/0",
"title": "2020 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08805448",
"articleId": "1cG4Az22lFe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08805463",
"articleId": "1cG4JtVNK2A",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwkR5xn",
"title": "March",
"year": "1982",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "4",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5cN",
"doi": "10.1109/TPAMI.1982.4767255",
"abstract": "A sound notion of the neighborhood of a point is essential for analyzing dot patterns. The past work in this direction has concentrated on identifying pairs of points that are neighbors. Examples of such methods include those based on a fixed radius, k-nearest neighbors, minimal spanning tree, relative neighborhood graph, and the Gabriel graph. This correspondence considers the use of the region enclosed by a point's Voronoi polygon as its neighborhood. It is argued that the Voronoi polygons possess intuitively appealing characteristics, as would be expected from the neighborhood of a point. Geometrical characteristics of the Voronoi neighborhood are used as features in dot pattern processing. Procedures for segmentation, matching, and perceptual border extraction using the Voronoi neighborhood are outlined. Extensions of the Voronoi definition to other domains are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A sound notion of the neighborhood of a point is essential for analyzing dot patterns. The past work in this direction has concentrated on identifying pairs of points that are neighbors. Examples of such methods include those based on a fixed radius, k-nearest neighbors, minimal spanning tree, relative neighborhood graph, and the Gabriel graph. This correspondence considers the use of the region enclosed by a point's Voronoi polygon as its neighborhood. It is argued that the Voronoi polygons possess intuitively appealing characteristics, as would be expected from the neighborhood of a point. Geometrical characteristics of the Voronoi neighborhood are used as features in dot pattern processing. Procedures for segmentation, matching, and perceptual border extraction using the Voronoi neighborhood are outlined. Extensions of the Voronoi definition to other domains are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A sound notion of the neighborhood of a point is essential for analyzing dot patterns. The past work in this direction has concentrated on identifying pairs of points that are neighbors. Examples of such methods include those based on a fixed radius, k-nearest neighbors, minimal spanning tree, relative neighborhood graph, and the Gabriel graph. This correspondence considers the use of the region enclosed by a point's Voronoi polygon as its neighborhood. It is argued that the Voronoi polygons possess intuitively appealing characteristics, as would be expected from the neighborhood of a point. Geometrical characteristics of the Voronoi neighborhood are used as features in dot pattern processing. Procedures for segmentation, matching, and perceptual border extraction using the Voronoi neighborhood are outlined. Extensions of the Voronoi definition to other domains are discussed.",
"title": "Dot Pattern Processing Using Voronoi Neighborhoods",
"normalizedTitle": "Dot Pattern Processing Using Voronoi Neighborhoods",
"fno": "04767255",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [],
"authors": [
{
"givenName": "Narendra",
"surname": "Ahuja",
"fullName": "Narendra Ahuja",
"affiliation": "Coordinated Science Laboratory, Department of Electrical Engineering, University of Illinois, Urbana, IL 61801.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1982-05-01 00:00:00",
"pubType": "trans",
"pages": "336-343",
"year": "1982",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1992/2915/0/00201728",
"title": "Supervised classification of early perceptual structure in dot patterns",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201728/12OmNA0vnUx",
"parentPublication": {
"id": "proceedings/icpr/1992/2915/0",
"title": "11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2009/3852/0/3852a445",
"title": "Qualitative Path Based on Voronoi Diagram",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2009/3852a445/12OmNAXPynq",
"parentPublication": {
"id": "proceedings/icinis/2009/3852/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pbg/2005/20/0/01500315",
"title": "Voronoi rasterization of sparse point sets",
"doi": null,
"abstractUrl": "/proceedings-article/pbg/2005/01500315/12OmNBfZSmM",
"parentPublication": {
"id": "proceedings/pbg/2005/20/0",
"title": "Point-Based Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2015/7143/0/7143a006",
"title": "A Faster Algorithm of Higher Order Voronoi Diagrams",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2015/7143a006/12OmNvHoQr7",
"parentPublication": {
"id": "proceedings/icmtma/2015/7143/0",
"title": "2015 Seventh International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118226",
"title": "Dot image matching using local affine transformation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118226/12OmNxEBz4j",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2010/3999/0/3999a074",
"title": "Hyperbolic Voronoi Diagrams Made Easy",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2010/3999a074/12OmNxVDuKN",
"parentPublication": {
"id": "proceedings/iccsa/2010/3999/0",
"title": "2010 International Conference on Computational Science and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icise/2009/3887/0/pid980426",
"title": "Research on Reverse Nearest Neighbor Queries Using Ranked Voronoi Diagram",
"doi": null,
"abstractUrl": "/proceedings-article/icise/2009/pid980426/12OmNyp9Mpv",
"parentPublication": {
"id": "proceedings/icise/2009/3887/0",
"title": "Information Science and Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/services/2009/3708/0/3708a740",
"title": "Composite Service Selection Based on Dot Pattern Mining",
"doi": null,
"abstractUrl": "/proceedings-article/services/2009/3708a740/12OmNzxgHEw",
"parentPublication": {
"id": "proceedings/services/2009/3708/0",
"title": "2009 Congress on Services - I",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1983/01/04767353",
"title": "Segmenting Dot Patterns by Voronoi Diagram Concavity",
"doi": null,
"abstractUrl": "/journal/tp/1983/01/04767353/13rRUNvgzjc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1975/11/01672737",
"title": "An Alternative Definition for \"Neighborhood of a Point\"",
"doi": null,
"abstractUrl": "/journal/tc/1975/11/01672737/13rRUwd9CEL",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04767254",
"articleId": "13rRUxASucg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04767256",
"articleId": "13rRUy3xY3q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyQphh3",
"title": "March",
"year": "2018",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "40",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjXZL3",
"doi": "10.1109/TPAMI.2017.2679193",
"abstract": "We propose a novel approach to generate a binary descriptor optimized for each image patch independently. The approach is inspired by the linear discriminant embedding that simultaneously increases inter and decreases intra class distances. A set of discriminative and uncorrelated binary tests is established from all possible tests in an offline training process. The patch adapted descriptors are then efficiently built online from a subset of features which lead to lower intra-class distances and thus, to a more robust descriptor. We perform experiments on three widely used benchmarks and demonstrate improvements in matching performance, and illustrate that per-patch optimization outperforms global optimization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a novel approach to generate a binary descriptor optimized for each image patch independently. The approach is inspired by the linear discriminant embedding that simultaneously increases inter and decreases intra class distances. A set of discriminative and uncorrelated binary tests is established from all possible tests in an offline training process. The patch adapted descriptors are then efficiently built online from a subset of features which lead to lower intra-class distances and thus, to a more robust descriptor. We perform experiments on three widely used benchmarks and demonstrate improvements in matching performance, and illustrate that per-patch optimization outperforms global optimization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a novel approach to generate a binary descriptor optimized for each image patch independently. The approach is inspired by the linear discriminant embedding that simultaneously increases inter and decreases intra class distances. A set of discriminative and uncorrelated binary tests is established from all possible tests in an offline training process. The patch adapted descriptors are then efficiently built online from a subset of features which lead to lower intra-class distances and thus, to a more robust descriptor. We perform experiments on three widely used benchmarks and demonstrate improvements in matching performance, and illustrate that per-patch optimization outperforms global optimization.",
"title": "Binary Online Learned Descriptors",
"normalizedTitle": "Binary Online Learned Descriptors",
"fno": "07882718",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Matching",
"Learning Artificial Intelligence",
"Optimisation",
"Binary Online Learned Descriptors",
"Binary Online",
"Global Optimization",
"Per Patch Optimization",
"Robust Descriptor",
"Descriptors",
"Offline Training Process",
"Uncorrelated Binary Tests",
"Discriminative Tests",
"Intra Class Distances",
"Linear Discriminant",
"Image Patch",
"Binary Descriptor",
"Hamming Distance",
"Training",
"Optimization",
"Feature Extraction",
"Robustness",
"Benchmark Testing",
"Context",
"Learning Feature Descriptors",
"Binary Descriptors",
"Feature Matching",
"Image Matching"
],
"authors": [
{
"givenName": "Vassileios",
"surname": "Balntas",
"fullName": "Vassileios Balntas",
"affiliation": "Department of Electrical and Electronic Engineering, Imperial College London, London, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lilian",
"surname": "Tang",
"fullName": "Lilian Tang",
"affiliation": "Department of Computer Science, University of Surrey, Guildford, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Krystian",
"surname": "Mikolajczyk",
"fullName": "Krystian Mikolajczyk",
"affiliation": "Department of Electrical and Electronic Engineering, Imperial College London, London, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2018-03-01 00:00:00",
"pubType": "trans",
"pages": "555-567",
"year": "2018",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmew/2016/1552/0/07574762",
"title": "On aggregation of local binary descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2016/07574762/12OmNBuL1nc",
"parentPublication": {
"id": "proceedings/icmew/2016/1552/0",
"title": "2016 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118a772",
"title": "Range-Sample Depth Feature for Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118a772/12OmNCdk2Oz",
"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/2015/6964/0/07298850",
"title": "BOLD - Binary online learned descriptor for efficient image matching",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2015/07298850/12OmNqFJhUJ",
"parentPublication": {
"id": "proceedings/cvpr/2015/6964/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a821",
"title": "DRINK: Discrete Robust Invariant Keypoints",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a821/12OmNrkT7Gt",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032d334",
"title": "DeepCD: Learning Deep Complementary Descriptors for Patch Representations",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032d334/12OmNvD8RtE",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/07410833",
"title": "An NMF Perspective on Binary Hashing",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/07410833/12OmNx8Outy",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815020",
"title": "A Binary Descriptor Structured on More Spatial Information",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815020/12OmNzC5SH5",
"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/cvpr/2013/4989/0/4989c874",
"title": "Boosting Binary Keypoint Descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989c874/12OmNzVoBTR",
"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/2014/01/ttp2014010188",
"title": "Local Difference Binary for Ultrafast and Distinctive Feature Description",
"doi": null,
"abstractUrl": "/journal/tp/2014/01/ttp2014010188/13rRUxASuUe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300c969",
"title": "Learning Local Descriptors With a CDF-Based Dynamic Soft Margin",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300c969/1hVlosNsUow",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07895141",
"articleId": "13rRUIM2VCN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07886354",
"articleId": "13rRUygT7u6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyp9Mqu",
"title": "Jan.",
"year": "2014",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "36",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuUe",
"doi": "10.1109/TPAMI.2013.150",
"abstract": "The efficiency and quality of a feature descriptor are critical to the user experience of many computer vision applications. However, the existing descriptors are either too computationally expensive to achieve real-time performance, or not sufficiently distinctive to identify correct matches from a large database with various transformations. In this paper, we propose a highly efficient and distinctive binary descriptor, called local difference binary (LDB). LDB directly computes a binary string for an image patch using simple intensity and gradient difference tests on pairwise grid cells within the patch. A multiple-gridding strategy and a salient bit-selection method are applied to capture the distinct patterns of the patch at different spatial granularities. Experimental results demonstrate that compared to the existing state-of-the-art binary descriptors, primarily designed for speed, LDB has similar construction efficiency, while achieving a greater accuracy and faster speed for mobile object recognition and tracking tasks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The efficiency and quality of a feature descriptor are critical to the user experience of many computer vision applications. However, the existing descriptors are either too computationally expensive to achieve real-time performance, or not sufficiently distinctive to identify correct matches from a large database with various transformations. In this paper, we propose a highly efficient and distinctive binary descriptor, called local difference binary (LDB). LDB directly computes a binary string for an image patch using simple intensity and gradient difference tests on pairwise grid cells within the patch. A multiple-gridding strategy and a salient bit-selection method are applied to capture the distinct patterns of the patch at different spatial granularities. Experimental results demonstrate that compared to the existing state-of-the-art binary descriptors, primarily designed for speed, LDB has similar construction efficiency, while achieving a greater accuracy and faster speed for mobile object recognition and tracking tasks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The efficiency and quality of a feature descriptor are critical to the user experience of many computer vision applications. However, the existing descriptors are either too computationally expensive to achieve real-time performance, or not sufficiently distinctive to identify correct matches from a large database with various transformations. In this paper, we propose a highly efficient and distinctive binary descriptor, called local difference binary (LDB). LDB directly computes a binary string for an image patch using simple intensity and gradient difference tests on pairwise grid cells within the patch. A multiple-gridding strategy and a salient bit-selection method are applied to capture the distinct patterns of the patch at different spatial granularities. Experimental results demonstrate that compared to the existing state-of-the-art binary descriptors, primarily designed for speed, LDB has similar construction efficiency, while achieving a greater accuracy and faster speed for mobile object recognition and tracking tasks.",
"title": "Local Difference Binary for Ultrafast and Distinctive Feature Description",
"normalizedTitle": "Local Difference Binary for Ultrafast and Distinctive Feature Description",
"fno": "ttp2014010188",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Robustness",
"Training",
"Real Time Systems",
"Face",
"Training Data",
"Detectors",
"Databases",
"Augmented Reality",
"Binary Feature Descriptor",
"Mobile Devices",
"Object Recognition",
"Tracking"
],
"authors": [
{
"givenName": null,
"surname": "Xin Yang",
"fullName": "Xin Yang",
"affiliation": "Electr. & Comput. Eng. Dept., Univ. of California, Santa Barbara, Santa Barbara, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Kwang-Ting Cheng",
"fullName": "Kwang-Ting Cheng",
"affiliation": "Electr. & Comput. Eng. Dept., Univ. of California, Santa Barbara, Santa Barbara, CA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2014-01-01 00:00:00",
"pubType": "trans",
"pages": "188-194",
"year": "2014",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2014/5209/0/5209d987",
"title": "Local Binary Patterns Calculated over Gaussian Derivative Images",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209d987/12OmNqJHFAR",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2013/2246/0/2246a175",
"title": "Effective Feature Description Using Intensity Order Local Binary Pattern",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2013/2246a175/12OmNrJRPkC",
"parentPublication": {
"id": "proceedings/cw/2013/2246/0",
"title": "2013 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2012/4660/0/06402537",
"title": "LDB: An ultra-fast feature for scalable Augmented Reality on mobile devices",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2012/06402537/12OmNscfI2m",
"parentPublication": {
"id": "proceedings/ismar/2012/4660/0",
"title": "2012 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2006/2591/0/25910018",
"title": "Selecting Distinctive 3D Shape Descriptors for Similarity Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2006/25910018/12OmNyo1nR4",
"parentPublication": {
"id": "proceedings/smi/2006/2591/0",
"title": "IEEE International Conference on Shape Modeling and Applications 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815020",
"title": "A Binary Descriptor Structured on More Spatial Information",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815020/12OmNzC5SH5",
"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/cvpr/2004/2158/2/01315206",
"title": "PCA-SIFT: a more distinctive representation for local image descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315206/12OmNzgwmJF",
"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": "trans/tp/2018/03/07882718",
"title": "Binary Online Learned Descriptors",
"doi": null,
"abstractUrl": "/journal/tp/2018/03/07882718/13rRUwjXZL3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/06/06671918",
"title": "Learning Optimized Local Difference Binaries for Scalable Augmented Reality on Mobile Devices",
"doi": null,
"abstractUrl": "/journal/tg/2014/06/06671918/13rRUxOdD2E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/03/08276625",
"title": "Compressive Binary Patterns: Designing a Robust Binary Face Descriptor with Random-Field Eigenfilters",
"doi": null,
"abstractUrl": "/journal/tp/2019/03/08276625/17D45WaTkmt",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956083",
"title": "A circular shifting binary descriptor for efficient rotation invariant image matching",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956083/1IHqB24DBmg",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2014010181",
"articleId": "13rRUxBa5or",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2014010195",
"articleId": "13rRUy2YLU6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrAMF5R",
"title": "March",
"year": "2019",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "41",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WaTkmt",
"doi": "10.1109/TPAMI.2018.2800008",
"abstract": "A binary descriptor typically consists of three stages: image filtering, binarization, and spatial histogram. This paper first demonstrates that the binary code of the maximum-variance filtering responses leads to the lowest bit error rate under Gaussian noise. Then, an optimal eigenfilter bank is derived from a universal assumption on the local stationary random field. Finally, compressive binary patterns (CBP) is designed by replacing the local derivative filters of local binary patterns (LBP) with these novel random-field eigenfilters, which leads to a compact and robust binary descriptor that characterizes the most stable local structures that are resistant to image noise and degradation. A scattering-like operator is subsequently applied to enhance the distinctiveness of the descriptor. Surprisingly, the results obtained from experiments on the FERET, LFW, and PaSC databases show that the scattering CBP (SCBP) descriptor, which is handcrafted by only 6 optimal eigenfilters under restrictive assumptions, outperforms the state-of-the-art learning-based face descriptors in terms of both matching accuracy and robustness. In particular, on probe images degraded with noise, blur, JPEG compression, and reduced resolution, SCBP outperforms other descriptors by a greater than 10 percent accuracy margin.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A binary descriptor typically consists of three stages: image filtering, binarization, and spatial histogram. This paper first demonstrates that the binary code of the maximum-variance filtering responses leads to the lowest bit error rate under Gaussian noise. Then, an optimal eigenfilter bank is derived from a universal assumption on the local stationary random field. Finally, compressive binary patterns (CBP) is designed by replacing the local derivative filters of local binary patterns (LBP) with these novel random-field eigenfilters, which leads to a compact and robust binary descriptor that characterizes the most stable local structures that are resistant to image noise and degradation. A scattering-like operator is subsequently applied to enhance the distinctiveness of the descriptor. Surprisingly, the results obtained from experiments on the FERET, LFW, and PaSC databases show that the scattering CBP (SCBP) descriptor, which is handcrafted by only 6 optimal eigenfilters under restrictive assumptions, outperforms the state-of-the-art learning-based face descriptors in terms of both matching accuracy and robustness. In particular, on probe images degraded with noise, blur, JPEG compression, and reduced resolution, SCBP outperforms other descriptors by a greater than 10 percent accuracy margin.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A binary descriptor typically consists of three stages: image filtering, binarization, and spatial histogram. This paper first demonstrates that the binary code of the maximum-variance filtering responses leads to the lowest bit error rate under Gaussian noise. Then, an optimal eigenfilter bank is derived from a universal assumption on the local stationary random field. Finally, compressive binary patterns (CBP) is designed by replacing the local derivative filters of local binary patterns (LBP) with these novel random-field eigenfilters, which leads to a compact and robust binary descriptor that characterizes the most stable local structures that are resistant to image noise and degradation. A scattering-like operator is subsequently applied to enhance the distinctiveness of the descriptor. Surprisingly, the results obtained from experiments on the FERET, LFW, and PaSC databases show that the scattering CBP (SCBP) descriptor, which is handcrafted by only 6 optimal eigenfilters under restrictive assumptions, outperforms the state-of-the-art learning-based face descriptors in terms of both matching accuracy and robustness. In particular, on probe images degraded with noise, blur, JPEG compression, and reduced resolution, SCBP outperforms other descriptors by a greater than 10 percent accuracy margin.",
"title": "Compressive Binary Patterns: Designing a Robust Binary Face Descriptor with Random-Field Eigenfilters",
"normalizedTitle": "Compressive Binary Patterns: Designing a Robust Binary Face Descriptor with Random-Field Eigenfilters",
"fno": "08276625",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Binary Codes",
"Error Statistics",
"Face Recognition",
"Filtering Theory",
"Gaussian Noise",
"Image Matching",
"Image Resolution",
"Learning Artificial Intelligence",
"Image Filtering",
"Binary Code",
"Maximum Variance Filtering Responses",
"Gaussian Noise",
"Optimal Eigenfilter Bank",
"Local Derivative Filters",
"Local Binary Patterns",
"Random Field Eigenfilters",
"Robust Binary Descriptor",
"Image Noise",
"Scattering CBP Descriptor",
"Robust Binary Face Descriptor",
"Bit Error Rate",
"Learning Based Face Descriptors",
"Efficiency 10 0 Percent",
"Robustness",
"Binary Codes",
"Face",
"Image Coding",
"Histograms",
"Degradation",
"Correlation",
"Face Recognition",
"Local Binary Patterns",
"Binary Code Learning",
"Face Descriptor"
],
"authors": [
{
"givenName": "Weihong",
"surname": "Deng",
"fullName": "Weihong Deng",
"affiliation": "Pattern Recognition and Intelligent System Laboratory, Beijing University of Posts and Telecommunications, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiani",
"surname": "Hu",
"fullName": "Jiani Hu",
"affiliation": "Pattern Recognition and Intelligent System Laboratory, Beijing University of Posts and Telecommunications, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Guo",
"fullName": "Jun Guo",
"affiliation": "Pattern Recognition and Intelligent System Laboratory, Beijing University of Posts and Telecommunications, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2019-03-01 00:00:00",
"pubType": "trans",
"pages": "758-767",
"year": "2019",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457e857",
"title": "Learning Deep Binary Descriptor with Multi-quantization",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457e857/12OmNrJRPdd",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ems/2016/4971/0/07920225",
"title": "Kernel-Based Fuzzy Local Binary Pattern for Gait Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/ems/2016/07920225/12OmNvA1hrb",
"parentPublication": {
"id": "proceedings/ems/2016/4971/0",
"title": "2016 European Modelling Symposium (EMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2008/3304/4/3304d115",
"title": "Centralized Binary Patterns Embedded with Image Euclidean Distance for Facial Expression Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2008/3304d115/12OmNx5Yvs6",
"parentPublication": {
"id": "proceedings/icnc/2008/3304/4",
"title": "2008 Fourth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2012/4899/0/4899a117",
"title": "B-SIFT: A Binary SIFT Based Local Image Feature Descriptor",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2012/4899a117/12OmNxGSmhL",
"parentPublication": {
"id": "proceedings/icdh/2012/4899/0",
"title": "4th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/05/07936534",
"title": "Context-Aware Local Binary Feature Learning for Face Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2018/05/07936534/13rRUwd9CHk",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/08/07299652",
"title": "Structure-Preserving Binary Representations for RGB-D Action Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2016/08/07299652/13rRUxC0Sx9",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/10/07053942",
"title": "Learning Compact Binary Face Descriptor for Face Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2015/10/07053942/13rRUxYIN5x",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2018/1737/0/08486520",
"title": "Towards Compact Visual Descriptor via Deep Fisher Network with Binary Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2018/08486520/14jQfQ4h77X",
"parentPublication": {
"id": "proceedings/icme/2018/1737/0",
"title": "2018 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545438",
"title": "Completed Grayscale-Inversion and Rotation Invariant Local Binary Pattern for Texture Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545438/17D45WODaql",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/08/08417979",
"title": "Learning Deep Binary Descriptor with Multi-Quantization",
"doi": null,
"abstractUrl": "/journal/tp/2019/08/08417979/1bhEjgNNlGU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08315047",
"articleId": "17D45Vw15wU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08292943",
"articleId": "17D45XuDNFS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyxXlpa",
"title": "April",
"year": "2019",
"issueNum": "04",
"idPrefix": "si",
"pubType": "journal",
"volume": "27",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45Wt3Ex3",
"doi": "10.1109/TVLSI.2018.2881105",
"abstract": "Feature matching is a fundamental step in many real-time computer vision applications such as simultaneous localization and mapping, motion analysis, and stereo correspondence. The performance of these applications depends on the distinctiveness of the visual feature descriptors used, and the speed at which they can be extracted from video frames. When combined with standard key-point detectors, the rotation-aware binary robust independent elementary features (rBRIEF) descriptor has been shown to outperform its counterparts. In this paper, we present a deep-pipelined stream processing architecture that is capable of extracting rBRIEF features from high-throughput video frames. To achieve high processing rate and low complexity hardware, the proposed architecture incorporates an enhanced moving summation strategy to calculate the key-points’ patch moments and employs approximate computations to achieve patch rotation. Multiplier-less circuitry is introduced throughout the architecture to avoid the use of costly multipliers. Implementation on the Altera Aria V device demonstrates that the proposed architecture leads to 53.3% reduction in hardware resources (adaptive logic modules), while achieving 50% higher accuracy (in terms of average Hamming distance) when compared to the state-of-the-art architecture. In addition, the proposed architecture is able to process high-resolution (<inline-formula> <tex-math notation=\"LaTeX\">Z_$1920 \\times 1080$_Z</tex-math></inline-formula>) images at 60 fps, while consuming only 456.15 mW power.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Feature matching is a fundamental step in many real-time computer vision applications such as simultaneous localization and mapping, motion analysis, and stereo correspondence. The performance of these applications depends on the distinctiveness of the visual feature descriptors used, and the speed at which they can be extracted from video frames. When combined with standard key-point detectors, the rotation-aware binary robust independent elementary features (rBRIEF) descriptor has been shown to outperform its counterparts. In this paper, we present a deep-pipelined stream processing architecture that is capable of extracting rBRIEF features from high-throughput video frames. To achieve high processing rate and low complexity hardware, the proposed architecture incorporates an enhanced moving summation strategy to calculate the key-points’ patch moments and employs approximate computations to achieve patch rotation. Multiplier-less circuitry is introduced throughout the architecture to avoid the use of costly multipliers. Implementation on the Altera Aria V device demonstrates that the proposed architecture leads to 53.3% reduction in hardware resources (adaptive logic modules), while achieving 50% higher accuracy (in terms of average Hamming distance) when compared to the state-of-the-art architecture. In addition, the proposed architecture is able to process high-resolution (<inline-formula> <tex-math notation=\"LaTeX\">$1920 \\times 1080$ </tex-math></inline-formula>) images at 60 fps, while consuming only 456.15 mW power.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Feature matching is a fundamental step in many real-time computer vision applications such as simultaneous localization and mapping, motion analysis, and stereo correspondence. The performance of these applications depends on the distinctiveness of the visual feature descriptors used, and the speed at which they can be extracted from video frames. When combined with standard key-point detectors, the rotation-aware binary robust independent elementary features (rBRIEF) descriptor has been shown to outperform its counterparts. In this paper, we present a deep-pipelined stream processing architecture that is capable of extracting rBRIEF features from high-throughput video frames. To achieve high processing rate and low complexity hardware, the proposed architecture incorporates an enhanced moving summation strategy to calculate the key-points’ patch moments and employs approximate computations to achieve patch rotation. Multiplier-less circuitry is introduced throughout the architecture to avoid the use of costly multipliers. Implementation on the Altera Aria V device demonstrates that the proposed architecture leads to 53.3% reduction in hardware resources (adaptive logic modules), while achieving 50% higher accuracy (in terms of average Hamming distance) when compared to the state-of-the-art architecture. In addition, the proposed architecture is able to process high-resolution (-) images at 60 fps, while consuming only 456.15 mW power.",
"title": "High-Throughput and Area-Optimized Architecture for rBRIEF Feature Extraction",
"normalizedTitle": "High-Throughput and Area-Optimized Architecture for rBRIEF Feature Extraction",
"fno": "08565982",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Feature Extraction",
"Computer Architecture",
"Hardware",
"Complexity Theory",
"Simultaneous Localization And Mapping",
"Streaming Media",
"Detectors",
"Computer Vision",
"Feature Extraction",
"Motion Analysis",
"Simultaneous Localization And Mapping",
"Stereo Vision"
],
"authors": [
{
"givenName": "Thinh Hung",
"surname": "Pham",
"fullName": "Thinh Hung Pham",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Phong",
"surname": "Tran",
"fullName": "Phong Tran",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Siew-Kei",
"surname": "Lam",
"fullName": "Siew-Kei Lam",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2019-04-01 00:00:00",
"pubType": "trans",
"pages": "747-756",
"year": "2019",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/si/2022/06/09751236",
"title": "Memristors Enabled Computing Correlation Parameter In-Memory System: A Potential Alternative to Von Neumann Architecture",
"doi": null,
"abstractUrl": "/journal/si/2022/06/09751236/1CnxPa7I1gc",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2022/09/09805676",
"title": "A New Pathway Toward Implementing a Fully Integrated Band-Switchable CMOS Power Amplifier Utilizing Bit Optimized Reconfigurable Network (BORN)",
"doi": null,
"abstractUrl": "/journal/si/2022/09/09805676/1ErlpQMI7RK",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2022/10/09854906",
"title": "Power-On Reset Circuit in 180-nm CMOS With Brownout Detection, Stable Switching Points, Long Reset Pulse Duration, and Resilience to Switching Noise",
"doi": null,
"abstractUrl": "/journal/si/2022/10/09854906/1FKFCw9Of3a",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09861690",
"title": "Optimizing Partial Area Under the Top-k Curve: Theory and Practice",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09861690/1FWhV30RnNe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ai/5555/01/10050725",
"title": "Patch-Mixing Contrastive Regularization for Few-Label Semi-Supervised Learning",
"doi": null,
"abstractUrl": "/journal/ai/5555/01/10050725/1L03jrlQzRe",
"parentPublication": {
"id": "trans/ai",
"title": "IEEE Transactions on Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09423594",
"title": "Mutual Information Regularized Feature-Level Frankenstein for Discriminative Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09423594/1tkybJ3cwmY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/06/09540319",
"title": "Extraction of Long <italic>k</italic>-mers Using Spaced Seeds",
"doi": null,
"abstractUrl": "/journal/tb/2022/06/09540319/1wWC92V3JbG",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2021/11/09526278",
"title": "An Area-Efficient High-Resolution Segmented ΣΔ-DAC for Built-In Self-Test Applications",
"doi": null,
"abstractUrl": "/journal/si/2021/11/09526278/1ww3MSa2fyU",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2022/02/09631972",
"title": "A Code-Recombination Algorithm-Based ADC With Feature Extraction for WBSN Applications",
"doi": null,
"abstractUrl": "/journal/si/2022/02/09631972/1yYPp1xXAU8",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2022/02/09612717",
"title": "Throughput Maximization of UAV Networks",
"doi": null,
"abstractUrl": "/journal/nt/2022/02/09612717/1ythXFsOW3e",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08672977",
"articleId": "18BHPiJI8ik",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08576650",
"articleId": "17D45XoXP3t",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxI0KAU",
"title": "June",
"year": "2018",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SEl",
"doi": "10.1109/TVCG.2017.2700470",
"abstract": "We present a real-time video stylization system and demonstrate a variety of painterly styles rendered on real video inputs. The key technical contribution lies on the object flow, which is robust to inaccurate optical flow, unknown object transformation and partial occlusion as well. Since object flows relate regions of the same object across frames, shower-door effect can be effectively reduced where painterly strokes and textures are rendered on video objects. The construction of object flows is performed in real time and automatically after applying metric learning. To reduce temporal flickering, we extend the bilateral filtering into motion bilateral filtering. We propose quantitative metrics to measure the temporal coherence on structures and textures of our stylized videos, and perform extensive experiments to compare our stylized results with baseline systems and prior works specializing in watercolor and abstraction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a real-time video stylization system and demonstrate a variety of painterly styles rendered on real video inputs. The key technical contribution lies on the object flow, which is robust to inaccurate optical flow, unknown object transformation and partial occlusion as well. Since object flows relate regions of the same object across frames, shower-door effect can be effectively reduced where painterly strokes and textures are rendered on video objects. The construction of object flows is performed in real time and automatically after applying metric learning. To reduce temporal flickering, we extend the bilateral filtering into motion bilateral filtering. We propose quantitative metrics to measure the temporal coherence on structures and textures of our stylized videos, and perform extensive experiments to compare our stylized results with baseline systems and prior works specializing in watercolor and abstraction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a real-time video stylization system and demonstrate a variety of painterly styles rendered on real video inputs. The key technical contribution lies on the object flow, which is robust to inaccurate optical flow, unknown object transformation and partial occlusion as well. Since object flows relate regions of the same object across frames, shower-door effect can be effectively reduced where painterly strokes and textures are rendered on video objects. The construction of object flows is performed in real time and automatically after applying metric learning. To reduce temporal flickering, we extend the bilateral filtering into motion bilateral filtering. We propose quantitative metrics to measure the temporal coherence on structures and textures of our stylized videos, and perform extensive experiments to compare our stylized results with baseline systems and prior works specializing in watercolor and abstraction.",
"title": "Real-Time Video Stylization Using Object Flows",
"normalizedTitle": "Real-Time Video Stylization Using Object Flows",
"fno": "07920337",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Streaming Media",
"Real Time Systems",
"Coherence",
"Integrated Optics",
"Optical Imaging",
"Measurement",
"Animation",
"Video Stylization",
"Video Processing",
"Metric Learning",
"Video Flows",
"Bilateral Filtering"
],
"authors": [
{
"givenName": "Cewu",
"surname": "Lu",
"fullName": "Cewu Lu",
"affiliation": "Department of Computer Science and Engineering, Shanghai Jiaotong University, Minhang, Qu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yao",
"surname": "Xiao",
"fullName": "Yao Xiao",
"affiliation": "Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi-Keung",
"surname": "Tang",
"fullName": "Chi-Keung Tang",
"affiliation": "Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2018-06-01 00:00:00",
"pubType": "trans",
"pages": "2051-2063",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2013/2840/0/2840b777",
"title": "Fast Object Segmentation in Unconstrained Video",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840b777/12OmNAYXWEE",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032b114",
"title": "Coherent Online Video Style Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032b114/12OmNB9t6tQ",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2009/3893/0/3893a035",
"title": "Skin-Aware Stylization of Video Portraits",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2009/3893a035/12OmNwMob6P",
"parentPublication": {
"id": "proceedings/cvmp/2009/3893/0",
"title": "2009 Conference for Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvgip/2008/3476/0/3476a568",
"title": "Real-Time Painterly Rendering of Terrains",
"doi": null,
"abstractUrl": "/proceedings-article/icvgip/2008/3476a568/12OmNyen1vF",
"parentPublication": {
"id": "proceedings/icvgip/2008/3476/0",
"title": "Computer Vision, Graphics & Image Processing, Indian Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851d899",
"title": "Video Segmentation via Object Flow",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851d899/12OmNzwpUcP",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/02/ttg2008020468",
"title": "Stylized Rendering Using Samples of a Painted Image",
"doi": null,
"abstractUrl": "/journal/tg/2008/02/ttg2008020468/13rRUEgs2BO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050866",
"title": "State of the \"Art”: A Taxonomy of Artistic Stylization Techniques for Images and Video",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050866/13rRUxBa561",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600b785",
"title": "VORNet: Spatio-Temporally Consistent Video Inpainting for Object Removal",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600b785/1iTvhvw5uAo",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093420",
"title": "Fast Video Multi-Style Transfer",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093420/1jPbo2cNSE0",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412128",
"title": "ACCLVOS: Atrous Convolution with Spatial-Temporal ConvLSTM for Video Object Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412128/1tminsi7qH6",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07926422",
"articleId": "13rRUILLkDZ",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAolH1h",
"title": "July",
"year": "2020",
"issueNum": "07",
"idPrefix": "tg",
"pubType": "journal",
"volume": "26",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45XwUAIi",
"doi": "10.1109/TVCG.2018.2889297",
"abstract": "We describe a non-parametric algorithm for multiple-viewpoint video inpainting. Uniquely, our algorithm addresses the domain of wide baseline multiple-viewpoint video (MVV) with no temporal look-ahead in near real time speed. A Dictionary of Patches (DoP) is built using multi-resolution texture patches reprojected from geometric proxies available in the alternate views. We dynamically update the DoP over time, and a Markov Random Field optimisation over depth and appearance is used to resolve and align a selection of multiple candidates for a given patch, this ensures the inpainting of large regions in a plausible manner conserving both spatial and temporal coherence. We demonstrate the removal of large objects (e.g., people) on challenging indoor and outdoor MVV exhibiting cluttered, dynamic backgrounds and moving cameras.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a non-parametric algorithm for multiple-viewpoint video inpainting. Uniquely, our algorithm addresses the domain of wide baseline multiple-viewpoint video (MVV) with no temporal look-ahead in near real time speed. A Dictionary of Patches (DoP) is built using multi-resolution texture patches reprojected from geometric proxies available in the alternate views. We dynamically update the DoP over time, and a Markov Random Field optimisation over depth and appearance is used to resolve and align a selection of multiple candidates for a given patch, this ensures the inpainting of large regions in a plausible manner conserving both spatial and temporal coherence. We demonstrate the removal of large objects (e.g., people) on challenging indoor and outdoor MVV exhibiting cluttered, dynamic backgrounds and moving cameras.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a non-parametric algorithm for multiple-viewpoint video inpainting. Uniquely, our algorithm addresses the domain of wide baseline multiple-viewpoint video (MVV) with no temporal look-ahead in near real time speed. A Dictionary of Patches (DoP) is built using multi-resolution texture patches reprojected from geometric proxies available in the alternate views. We dynamically update the DoP over time, and a Markov Random Field optimisation over depth and appearance is used to resolve and align a selection of multiple candidates for a given patch, this ensures the inpainting of large regions in a plausible manner conserving both spatial and temporal coherence. We demonstrate the removal of large objects (e.g., people) on challenging indoor and outdoor MVV exhibiting cluttered, dynamic backgrounds and moving cameras.",
"title": "Inpainting of Wide-Baseline Multiple Viewpoint Video",
"normalizedTitle": "Inpainting of Wide-Baseline Multiple Viewpoint Video",
"fno": "08587214",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cameras",
"Computer Graphics",
"Image Resolution",
"Image Texture",
"Markov Processes",
"Video Signal Processing",
"Moving Cameras",
"Spatial Coherence",
"Temporal Coherence",
"Markov Random Field Optimisation",
"Dictionary Of Patches",
"Do P",
"MVV",
"Temporal Look Ahead",
"Wide Baseline Multiple Viewpoint Video",
"Multiple Viewpoint Video Inpainting",
"Nonparametric Algorithm",
"Multiple Candidates",
"Multiresolution Texture Patches",
"Cameras",
"Optimization",
"Three Dimensional Displays",
"Coherence",
"Visualization",
"Dictionaries",
"Streaming Media",
"Computer Graphics",
"Inpainting",
"Multiple Viewpoint Video"
],
"authors": [
{
"givenName": "Andrew",
"surname": "Gilbert",
"fullName": "Andrew Gilbert",
"affiliation": "Centre for Vision Speech and Signal Processing, University of Surrey, Guildford, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Matthew",
"surname": "Trumble",
"fullName": "Matthew Trumble",
"affiliation": "Centre for Vision Speech and Signal Processing, University of Surrey, Guildford, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adrian",
"surname": "Hilton",
"fullName": "Adrian Hilton",
"affiliation": "Centre for Vision Speech and Signal Processing, University of Surrey, Guildford, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Collomosse",
"fullName": "John Collomosse",
"affiliation": "Centre for Vision Speech and Signal Processing (CVSSP), University of Surrey, Guildford, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2020-07-01 00:00:00",
"pubType": "trans",
"pages": "2417-2428",
"year": "2020",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2011/348/0/06012055",
"title": "Six-dimensional free-viewpoint synthesis flow for QFHD free-viewpoint/multiview 3DTV applications",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06012055/12OmNBqv2nI",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a351",
"title": "Multi-View Inpainting for Image-Based Scene Editing and Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a351/12OmNxEjXRB",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2017/0958/0/0958a101",
"title": "Multidimensional QoE Assessment of a Simultaneous Transmission Method in Multi-view Video and Audio Transmission with MPEG-DASH",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2017/0958a101/12OmNy3RRBj",
"parentPublication": {
"id": "proceedings/cit/2017/0958/0",
"title": "2017 IEEE International Conference on Computer and Information Technology (CIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2014/6239/0/6239a332",
"title": "Multidimensional QoE Assessment of Multi-view Video and Audio (MVV-A) IP Multicast Transmission Methods",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2014/6239a332/12OmNyUFfTQ",
"parentPublication": {
"id": "proceedings/cit/2014/6239/0",
"title": "2014 IEEE International Conference on Computer and Information Technology (CIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/06/06714519",
"title": "High-Quality Real-Time Video Inpaintingwith PixMix",
"doi": null,
"abstractUrl": "/journal/tg/2014/06/06714519/13rRUyYSWsY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545350",
"title": "Radiometric confidence criterion for patch-based inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545350/17D45VtKivd",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200o4539",
"title": "Parallel Multi-Resolution Fusion Network for Image Inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200o4539/1BmJDCAWAXS",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2019/8350/0/08718109",
"title": "WebRTC-Based Multi-View Video and Audio Transmission and its QoE",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2019/08718109/1aIS2keBNao",
"parentPublication": {
"id": "proceedings/icoin/2019/8350/0",
"title": "2019 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2020/05/08931251",
"title": "Recurrent Temporal Aggregation Framework for Deep Video Inpainting",
"doi": null,
"abstractUrl": "/journal/tp/2020/05/08931251/1fFWEDjNHPO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300f785",
"title": "Deep Video Inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300f785/1gyrROSF1Pa",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08580422",
"articleId": "17D45WK5Aos",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08585103",
"articleId": "17D45WUj91g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyYm2vs",
"title": "November",
"year": "2009",
"issueNum": "11",
"idPrefix": "tp",
"pubType": "journal",
"volume": "31",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwdIOTj",
"doi": "10.1109/TPAMI.2008.246",
"abstract": "An ever-growing number of real-world computer vision applications require classification, segmentation, retrieval, or realistic rendering of genuine materials. However, the appearance of real materials dramatically changes with illumination and viewing variations. Thus, the only reliable representation of material visual properties requires capturing of its reflectance in as wide range of light and camera position combinations as possible. This is a principle of the recent most advanced texture representation, the Bidirectional Texture Function (BTF). Multispectral BTF is a seven-dimensional function that depends on view and illumination directions as well as on planar texture coordinates. BTF is typically obtained by measurement of thousands of images covering many combinations of illumination and viewing angles. However, the large size of such measurements has prohibited their practical exploitation in any sensible application until recently. During the last few years, the first BTF measurement, compression, modeling, and rendering methods have emerged. In this paper, we categorize, critically survey, and psychophysically compare such approaches, which were published in this newly arising and important computer vision and graphics area.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An ever-growing number of real-world computer vision applications require classification, segmentation, retrieval, or realistic rendering of genuine materials. However, the appearance of real materials dramatically changes with illumination and viewing variations. Thus, the only reliable representation of material visual properties requires capturing of its reflectance in as wide range of light and camera position combinations as possible. This is a principle of the recent most advanced texture representation, the Bidirectional Texture Function (BTF). Multispectral BTF is a seven-dimensional function that depends on view and illumination directions as well as on planar texture coordinates. BTF is typically obtained by measurement of thousands of images covering many combinations of illumination and viewing angles. However, the large size of such measurements has prohibited their practical exploitation in any sensible application until recently. During the last few years, the first BTF measurement, compression, modeling, and rendering methods have emerged. In this paper, we categorize, critically survey, and psychophysically compare such approaches, which were published in this newly arising and important computer vision and graphics area.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An ever-growing number of real-world computer vision applications require classification, segmentation, retrieval, or realistic rendering of genuine materials. However, the appearance of real materials dramatically changes with illumination and viewing variations. Thus, the only reliable representation of material visual properties requires capturing of its reflectance in as wide range of light and camera position combinations as possible. This is a principle of the recent most advanced texture representation, the Bidirectional Texture Function (BTF). Multispectral BTF is a seven-dimensional function that depends on view and illumination directions as well as on planar texture coordinates. BTF is typically obtained by measurement of thousands of images covering many combinations of illumination and viewing angles. However, the large size of such measurements has prohibited their practical exploitation in any sensible application until recently. During the last few years, the first BTF measurement, compression, modeling, and rendering methods have emerged. In this paper, we categorize, critically survey, and psychophysically compare such approaches, which were published in this newly arising and important computer vision and graphics area.",
"title": "Bidirectional Texture Function Modeling: A State of the Art Survey",
"normalizedTitle": "Bidirectional Texture Function Modeling: A State of the Art Survey",
"fno": "ttp2009111921",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"BTF",
"BRDF",
"3 D Texture",
"Surface Texture",
"Texture Measurement",
"Texture Analysis",
"Texture Synthesis",
"Texture Modeling",
"Data Compression",
"Psychophysical Study",
"Light Transport"
],
"authors": [
{
"givenName": "Jiří",
"surname": "Filip",
"fullName": "Jiří Filip",
"affiliation": "Institute of Information Theory and Automation of the AS CR, Praha",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michal",
"surname": "Haindl",
"fullName": "Michal Haindl",
"affiliation": "Institute of Information Theory and Automation of the AS CR, Praha",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1921-1940",
"year": "2009",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2004/2128/3/212830194",
"title": "BTF Image Space Utmost Compression and Modelling Method",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212830194/12OmNBr4eGO",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/1/212810080",
"title": "Non-linear Reflectance Model for Bidirectional Texture Function Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212810080/12OmNC1Gue1",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1997/7822/0/78220151",
"title": "Reflectance and Texture of Real-World Surfaces Authors:",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1997/78220151/12OmNyQ7FDj",
"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/cvpr/2001/1272/1/127211041",
"title": "Compact Representation of Bidirectional Texture Functions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2001/127211041/12OmNyQ7FIH",
"parentPublication": {
"id": "proceedings/cvpr/2001/1272/1",
"title": "Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dpvt/2004/2223/0/22230388",
"title": "Viewpoint Consistent Texture Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2004/22230388/12OmNyQYtqP",
"parentPublication": {
"id": "proceedings/3dpvt/2004/2223/0",
"title": "3D Data Processing Visualization and Transmission, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109c114",
"title": "Near-Regular BTF Texture Model",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109c114/12OmNzkuKBD",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2000/05/i0491",
"title": "The Analysis and Recognition of Real-World Textures in Three Dimensions",
"doi": null,
"abstractUrl": "/journal/tp/2000/05/i0491/13rRUILtJAE",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/05/v0519",
"title": "Decorating Surfaces with Bidirectional Texture Functions",
"doi": null,
"abstractUrl": "/journal/tg/2005/05/v0519/13rRUwbJD4E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/10/i1859",
"title": "Extreme Compression and Modeling of Bidirectional Texture Function",
"doi": null,
"abstractUrl": "/journal/tp/2007/10/i1859/13rRUxly8U8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__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"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "ttp2009111941",
"articleId": "13rRUNvgzb1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCfAPy8",
"title": "July",
"year": "2011",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "33",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxYrbVN",
"doi": "10.1109/TPAMI.2010.211",
"abstract": "This paper presents a novel parametric representation for bidirectional texture functions. Our method mainly relies on two original techniques, namely, multivariate spherical radial basis functions (SRBFs) and optimized parameterization. First, since the surface appearance of a real-world object is frequently a mixed effect of different physical factors, the proposed sum-of-products model based on multivariate SRBFs especially provides an intrinsic and efficient representation for heterogenous materials. Second, optimized parameterization particularly aims at overcoming the major disadvantage of traditional fixed parameterization. By using a parametric model to account for variable transformations, the parameterization process can be tightly integrated with multivariate SRBFs into a unified framework. Finally, a hierarchical fitting algorithm for bidirectional texture functions is developed to exploit spatial coherence and reduce computational cost. Our experimental results further reveal that the proposed representation can easily achieve high-quality approximation and real-time rendering performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a novel parametric representation for bidirectional texture functions. Our method mainly relies on two original techniques, namely, multivariate spherical radial basis functions (SRBFs) and optimized parameterization. First, since the surface appearance of a real-world object is frequently a mixed effect of different physical factors, the proposed sum-of-products model based on multivariate SRBFs especially provides an intrinsic and efficient representation for heterogenous materials. Second, optimized parameterization particularly aims at overcoming the major disadvantage of traditional fixed parameterization. By using a parametric model to account for variable transformations, the parameterization process can be tightly integrated with multivariate SRBFs into a unified framework. Finally, a hierarchical fitting algorithm for bidirectional texture functions is developed to exploit spatial coherence and reduce computational cost. Our experimental results further reveal that the proposed representation can easily achieve high-quality approximation and real-time rendering performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a novel parametric representation for bidirectional texture functions. Our method mainly relies on two original techniques, namely, multivariate spherical radial basis functions (SRBFs) and optimized parameterization. First, since the surface appearance of a real-world object is frequently a mixed effect of different physical factors, the proposed sum-of-products model based on multivariate SRBFs especially provides an intrinsic and efficient representation for heterogenous materials. Second, optimized parameterization particularly aims at overcoming the major disadvantage of traditional fixed parameterization. By using a parametric model to account for variable transformations, the parameterization process can be tightly integrated with multivariate SRBFs into a unified framework. Finally, a hierarchical fitting algorithm for bidirectional texture functions is developed to exploit spatial coherence and reduce computational cost. Our experimental results further reveal that the proposed representation can easily achieve high-quality approximation and real-time rendering performance.",
"title": "Modeling Bidirectional Texture Functions with Multivariate Spherical Radial Basis Functions",
"normalizedTitle": "Modeling Bidirectional Texture Functions with Multivariate Spherical Radial Basis Functions",
"fno": "ttp2011071356",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Reflectance And Shading Models",
"Bidirectional Texture Functions",
"Parameterization",
"Spherical Radial Basis Functions"
],
"authors": [
{
"givenName": "Yu-Ting",
"surname": "Tsai",
"fullName": "Yu-Ting Tsai",
"affiliation": "Yuan Ze University, Chung-Li City",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kuei-Li",
"surname": "Fang",
"fullName": "Kuei-Li Fang",
"affiliation": "National Chiao Tung University, Hsinchu",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wen-Chieh",
"surname": "Lin",
"fullName": "Wen-Chieh Lin",
"affiliation": "National Chiao Tung University, Hsinchu",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zen-Chung",
"surname": "Shih",
"fullName": "Zen-Chung Shih",
"affiliation": "National Chiao Tung University, Hsinchu",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2011-07-01 00:00:00",
"pubType": "trans",
"pages": "1356-1369",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/mines/2009/3843/1/3843a309",
"title": "Morphing 3D Mesh Models Based on Spherical Parameterization",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2009/3843a309/12OmNBOUxiR",
"parentPublication": {
"id": "proceedings/mines/2009/3843/1",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dmdcm/2011/4413/0/4413a266",
"title": "Direct Spherical Parameterization Based on Surface Curvature",
"doi": null,
"abstractUrl": "/proceedings-article/dmdcm/2011/4413a266/12OmNCeaPV9",
"parentPublication": {
"id": "proceedings/dmdcm/2011/4413/0",
"title": "Digital Media and Digital Content Management, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a119",
"title": "The Spherical Images of Triangular Mesh Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a119/12OmNCvLY0n",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmai/2008/3270/0/3270a053",
"title": "Chapter 9: Shape Analysis of Left Ventricle Using Invariant 3-D Spherical Harmonics Shape Descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/gmai/2008/3270a053/12OmNyen1x6",
"parentPublication": {
"id": "proceedings/gmai/2008/3270/0",
"title": "Geometric Modeling and Imaging--New Trends",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1992/2855/0/00223125",
"title": "Spatial reasoning based on multivariate belief functions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223125/12OmNzayNqy",
"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/2008/02/ttg2008020454",
"title": "Spherical Piecewise Constant Basis Functions for All-Frequency Precomputed Radiance Transfer",
"doi": null,
"abstractUrl": "/journal/tg/2008/02/ttg2008020454/13rRUwvT9gl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/04/v0329",
"title": "A Wavelet Representation of Reflectance Functions",
"doi": null,
"abstractUrl": "/journal/tg/1997/04/v0329/13rRUxBJhmG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1997/04/i0353",
"title": "Parametric Shape-from-Shading by Radial Basis Functions",
"doi": null,
"abstractUrl": "/journal/tp/1997/04/i0353/13rRUxZ0o2u",
"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/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"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttp2011071339",
"articleId": "13rRUB6Sq1A",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011071370",
"articleId": "13rRUxASu1Y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1Fz3ebZZCbS",
"title": "Sept.",
"year": "2022",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1t8VSecPmhy",
"doi": "10.1109/TPAMI.2021.3075916",
"abstract": "The Prague texture segmentation data-generator and benchmark (<uri>mosaic.utia.cas.cz</uri>) is a web-based service designed to mutually compare and rank (recently nearly 200) different static and dynamic texture and image segmenters, to find optimal parametrization of a segmenter and support the development of new segmentation and classification methods. The benchmark verifies segmenter performance characteristics on potentially unlimited monospectral, multispectral, satellite, and bidirectional texture function (BTF) data using an extensive set of over forty prevalent criteria. It also enables us to test for noise robustness and scale, rotation, or illumination invariance. It can be used in other applications, such as feature selection, image compression, query by pictorial example, etc. The benchmark’s functionalities are demonstrated in evaluating several examples of leading previously published unsupervised and supervised image segmentation algorithms. However, they are used to illustrate the benchmark functionality and not review the recent image segmentation state-of-the-art.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Prague texture segmentation data-generator and benchmark (<uri>mosaic.utia.cas.cz</uri>) is a web-based service designed to mutually compare and rank (recently nearly 200) different static and dynamic texture and image segmenters, to find optimal parametrization of a segmenter and support the development of new segmentation and classification methods. The benchmark verifies segmenter performance characteristics on potentially unlimited monospectral, multispectral, satellite, and bidirectional texture function (BTF) data using an extensive set of over forty prevalent criteria. It also enables us to test for noise robustness and scale, rotation, or illumination invariance. It can be used in other applications, such as feature selection, image compression, query by pictorial example, etc. The benchmark’s functionalities are demonstrated in evaluating several examples of leading previously published unsupervised and supervised image segmentation algorithms. However, they are used to illustrate the benchmark functionality and not review the recent image segmentation state-of-the-art.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Prague texture segmentation data-generator and benchmark (mosaic.utia.cas.cz) is a web-based service designed to mutually compare and rank (recently nearly 200) different static and dynamic texture and image segmenters, to find optimal parametrization of a segmenter and support the development of new segmentation and classification methods. The benchmark verifies segmenter performance characteristics on potentially unlimited monospectral, multispectral, satellite, and bidirectional texture function (BTF) data using an extensive set of over forty prevalent criteria. It also enables us to test for noise robustness and scale, rotation, or illumination invariance. It can be used in other applications, such as feature selection, image compression, query by pictorial example, etc. The benchmark’s functionalities are demonstrated in evaluating several examples of leading previously published unsupervised and supervised image segmentation algorithms. However, they are used to illustrate the benchmark functionality and not review the recent image segmentation state-of-the-art.",
"title": "Texture Segmentation Benchmark",
"normalizedTitle": "Texture Segmentation Benchmark",
"fno": "09416785",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Colour Analysis",
"Image Segmentation",
"Image Texture",
"Unsupervised Learning",
"Web Services",
"Prague Texture Segmentation Data Generator",
"Mosaic Utia Cas Cz",
"Web Based Service",
"Optimal Parametrization",
"Classification Methods",
"Segmenter Performance Characteristics",
"Multispectral Satellite",
"Bidirectional Texture Function Data",
"Illumination Invariance",
"Image Compression",
"Unsupervised Image Segmentation Algorithms",
"Unlimited Monospectral Satellite",
"Image Segmentation",
"Benchmark Testing",
"Heuristic Algorithms",
"Image Color Analysis",
"Satellites",
"Lighting",
"Time Measurement",
"Benchmark",
"Image Segmentation",
"Texture Segmentation",
"Un Supervised Segmentation",
"Segmentation Criteria",
"Scale",
"Rotation And Illumination Invariants"
],
"authors": [
{
"givenName": "Stanislav",
"surname": "Mikeš",
"fullName": "Stanislav Mikeš",
"affiliation": "Institute of Information Theory and Automation, Czech Academy of Sciences, Prague, Czech Republic",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michal",
"surname": "Haindl",
"fullName": "Michal Haindl",
"affiliation": "Institute of Information Theory and Automation, Czech Academy of Sciences, Prague, Czech Republic",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "5647-5663",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2006/2521/2/252120203",
"title": "Unsupervised Texture Segmentation Using Multispectral Modelling Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252120203/12OmNCgrD5O",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761118",
"title": "Texture segmentation benchmark",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761118/12OmNs59JPb",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209a954",
"title": "A Histogram-Based Chan-Vese Model Driven by Local Contrast Pattern for Texture Image Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209a954/12OmNvDZF4R",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284985",
"title": "Color Distribution Evenness and its Application to Color-Texture Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284985/12OmNvjgWoV",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761113",
"title": "Unsupervised mammograms segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761113/12OmNxWuiyX",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pov/2011/035/0/05712366",
"title": "A benchmark for interactive image segmentation algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/pov/2011/05712366/12OmNyTfg6L",
"parentPublication": {
"id": "proceedings/pov/2011/035/0",
"title": "2011 Workshop on Person-Oriented Vision (POV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459308",
"title": "Texel-based texture segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459308/12OmNyeECxM",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ic4e/2010/5680/0/05432381",
"title": "Using FCM for Color Texture Segmentation Based Multirscale Image Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/ic4e/2010/05432381/12OmNzBOhxz",
"parentPublication": {
"id": "proceedings/ic4e/2010/5680/0",
"title": "2010 International Conference on e-Education, e-Business, e-Management, and e-Learning, (IC4E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mvhi/2010/4009/0/4009a621",
"title": "A Color-Texture Segmentation Method to Extract Tree Image in Complex Scene",
"doi": null,
"abstractUrl": "/proceedings-article/mvhi/2010/4009a621/12OmNzVGcC5",
"parentPublication": {
"id": "proceedings/mvhi/2010/4009/0",
"title": "Machine Vision and Human-machine Interface, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2013/2549/0/06746390",
"title": "Texture Region Merging with Histogram Feature for Color Image Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2013/06746390/12OmNzahc23",
"parentPublication": {
"id": "proceedings/cis/2013/2549/0",
"title": "2013 Ninth International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09440692",
"articleId": "1tTp7JF3Mty",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09397294",
"articleId": "1sA4TAidVBK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCd2rJe",
"title": "September",
"year": "2007",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "29",
"label": "September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWm5",
"doi": "10.1109/TPAMI.2007.1171",
"abstract": "Nearly all existing methods for stereo reconstruction assume that scene reflectance is Lambertian and make use of brightness constancy as a matching invariant. We introduce a new invariant for stereo reconstruction called light transport constancy (LTC), which allows completely arbitrary scene reflectance (bidirectional reflectance distribution functions (BRDFs)). This invariant can be used to formulate a rank constraint on multiview stereo matching when the scene is observed by several lighting configurations in which only the lighting intensity varies. In addition, we show that this multiview constraint can be used with as few as two cameras and two lighting configurations. Unlike previous methods for BRDF invariant stereo, LTC does not require precisely configured or calibrated light sources or calibration objects in the scene. Importantly, the new constraint can be used to provide BRDF invariance to any existing stereo method whenever appropriate lighting variation is available.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Nearly all existing methods for stereo reconstruction assume that scene reflectance is Lambertian and make use of brightness constancy as a matching invariant. We introduce a new invariant for stereo reconstruction called light transport constancy (LTC), which allows completely arbitrary scene reflectance (bidirectional reflectance distribution functions (BRDFs)). This invariant can be used to formulate a rank constraint on multiview stereo matching when the scene is observed by several lighting configurations in which only the lighting intensity varies. In addition, we show that this multiview constraint can be used with as few as two cameras and two lighting configurations. Unlike previous methods for BRDF invariant stereo, LTC does not require precisely configured or calibrated light sources or calibration objects in the scene. Importantly, the new constraint can be used to provide BRDF invariance to any existing stereo method whenever appropriate lighting variation is available.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Nearly all existing methods for stereo reconstruction assume that scene reflectance is Lambertian and make use of brightness constancy as a matching invariant. We introduce a new invariant for stereo reconstruction called light transport constancy (LTC), which allows completely arbitrary scene reflectance (bidirectional reflectance distribution functions (BRDFs)). This invariant can be used to formulate a rank constraint on multiview stereo matching when the scene is observed by several lighting configurations in which only the lighting intensity varies. In addition, we show that this multiview constraint can be used with as few as two cameras and two lighting configurations. Unlike previous methods for BRDF invariant stereo, LTC does not require precisely configured or calibrated light sources or calibration objects in the scene. Importantly, the new constraint can be used to provide BRDF invariance to any existing stereo method whenever appropriate lighting variation is available.",
"title": "BRDF Invariant Stereo Using Light Transport Constancy",
"normalizedTitle": "BRDF Invariant Stereo Using Light Transport Constancy",
"fno": "i1616",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Layout",
"Stereo Vision",
"Reflectivity",
"Light Sources",
"Bidirectional Control",
"Distribution Functions",
"Cameras",
"Calibration",
"Lighting",
"Computer Society",
"Non Lambertian",
"Stereo",
"BRDF",
"Rank Constraint",
"Light Transport Constancy"
],
"authors": [
{
"givenName": "Liang",
"surname": "Wang",
"fullName": "Liang Wang",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ruigang",
"surname": "Yang",
"fullName": "Ruigang Yang",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "James E.",
"surname": "Davis",
"fullName": "James E. Davis",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2007-09-01 00:00:00",
"pubType": "trans",
"pages": "1616-1626",
"year": "2007",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2005/2334/1/23340436",
"title": "BRDF Invariant Stereo Using Light Transport Constancy",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2005/23340436/12OmNAWYKHh",
"parentPublication": {
"id": "proceedings/iccv/2005/2334/2",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1994/5825/0/00323940",
"title": "Adaptive polynomial modelling of the reflectance map for shape estimation from stereo and shading",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1994/00323940/12OmNBSBk1M",
"parentPublication": {
"id": "proceedings/cvpr/1994/5825/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/1992/2855/0/00223149",
"title": "Extracting the shape and roughness of specular lobe objects using four light photometric stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223149/12OmNwoxSc1",
"parentPublication": {
"id": "proceedings/cvpr/1992/2855/0",
"title": "Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457a578",
"title": "Robust Energy Minimization for BRDF-Invariant Shape from Light Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a578/12OmNxdDFFd",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__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/2009/4420/0/05459381",
"title": "Attached shadow coding: Estimating surface normals from shadows under unknown reflectance and lighting conditions",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459381/12OmNylsZWO",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206558",
"title": "Material classification using BRDF slices",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206558/12OmNzl3X1Q",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1991/02/i0133",
"title": "A Theory of Photometric Stereo for a Class of Diffuse Non-Lambertian Surfaces",
"doi": null,
"abstractUrl": "/journal/tp/1991/02/i0133/13rRUwgyOki",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900k0586",
"title": "Lighting, Reflectance and Geometry Estimation from 360° Panoramic Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0586/1yeIplXJ9wQ",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i1603",
"articleId": "13rRUxNW1UU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i1642",
"articleId": "13rRUwI5U8W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBVrjqW",
"title": "March/April",
"year": "2006",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuegoX",
"doi": "10.1109/TVCG.2006.30",
"abstract": "Abstract—In this paper, we introduce geometry-dependent lighting that allows lighting parameters to be defined independently and possibly discrepantly over an object or scene based on the local geometry. We present and discuss Light Collages, a lighting design system with geometry-dependent lights for effective feature-enhanced visualization. Our algorithm segments the objects into local surface patches and places lights that are locally consistent but globally discrepant to enhance the perception of shape. We use spherical harmonics for efficiently storing and computing light placement and assignment. We also outline a method to find the minimal number of light sources sufficient to illuminate an object well with our globally discrepant lighting approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—In this paper, we introduce geometry-dependent lighting that allows lighting parameters to be defined independently and possibly discrepantly over an object or scene based on the local geometry. We present and discuss Light Collages, a lighting design system with geometry-dependent lights for effective feature-enhanced visualization. Our algorithm segments the objects into local surface patches and places lights that are locally consistent but globally discrepant to enhance the perception of shape. We use spherical harmonics for efficiently storing and computing light placement and assignment. We also outline a method to find the minimal number of light sources sufficient to illuminate an object well with our globally discrepant lighting approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—In this paper, we introduce geometry-dependent lighting that allows lighting parameters to be defined independently and possibly discrepantly over an object or scene based on the local geometry. We present and discuss Light Collages, a lighting design system with geometry-dependent lights for effective feature-enhanced visualization. Our algorithm segments the objects into local surface patches and places lights that are locally consistent but globally discrepant to enhance the perception of shape. We use spherical harmonics for efficiently storing and computing light placement and assignment. We also outline a method to find the minimal number of light sources sufficient to illuminate an object well with our globally discrepant lighting approach.",
"title": "Geometry-Dependent Lighting",
"normalizedTitle": "Geometry-Dependent Lighting",
"fno": "v0197",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Lighting Design",
"Scientific Illustration",
"Discrepant Lighting",
"Light Placement",
"Silhouette Enhancement",
"Proximity Shadows",
"Spherical Harmonics"
],
"authors": [
{
"givenName": "Chang Ha",
"surname": "Lee",
"fullName": "Chang Ha Lee",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuejun",
"surname": "Hao",
"fullName": "Xuejun Hao",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amitabh",
"surname": "Varshney",
"fullName": "Amitabh Varshney",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2006-03-01 00:00:00",
"pubType": "trans",
"pages": "197-207",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/percomw/2010/6605/0/05470516",
"title": "Smart lighting using LED luminaries",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2010/05470516/12OmNAYoKnN",
"parentPublication": {
"id": "proceedings/percomw/2010/6605/0",
"title": "2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2004/2178/0/21780101",
"title": "Precomputed Radiance Transfer with Spatially-Varying Lighting Effects",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2004/21780101/12OmNBQkx3g",
"parentPublication": {
"id": "proceedings/cgiv/2004/2178/0",
"title": "Proceedings. International Conference on Computer Graphics, Imaging and Visualization, 2004. CGIV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2006/2606/0/26060522",
"title": "Environment Lighting for Point Sampled Geometry",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2006/26060522/12OmNqIQSkQ",
"parentPublication": {
"id": "proceedings/cgiv/2006/2606/0",
"title": "International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880281",
"title": "Light Collages: Lighting Design for Effective Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880281/12OmNrJAe0V",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2006/2606/0/26060353",
"title": "Environment Lighting for Point Sampled Geometry",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2006/26060353/12OmNvDqsJ0",
"parentPublication": {
"id": "proceedings/cgiv/2006/2606/0",
"title": "International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300048",
"title": "LightKit: A lighting system for effective visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300048/12OmNzxgHuw",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/01/ttg2013010067",
"title": "Lighting System for Visual Perception Enhancement in Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2013/01/ttg2013010067/13rRUyYSWsT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aie/2022/7400/0/740000a395",
"title": "Design of intelligent lighting energy saving system for Expressway Tunnel Based on Internet of things",
"doi": null,
"abstractUrl": "/proceedings-article/aie/2022/740000a395/1GZjovpEGuA",
"parentPublication": {
"id": "proceedings/aie/2022/7400/0",
"title": "2022 International Conference on Artificial Intelligence in Everything (AIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccnea/2020/7083/0/708300a373",
"title": "Research on Automatic Lighting Control Equipment of Tunnel Entrance",
"doi": null,
"abstractUrl": "/proceedings-article/iccnea/2020/708300a373/1oCmZTGTRIY",
"parentPublication": {
"id": "proceedings/iccnea/2020/7083/0",
"title": "2020 International Conference on Computer Network, Electronic and Automation (ICCNEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900k0586",
"title": "Lighting, Reflectance and Geometry Estimation from 360° Panoramic Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0586/1yeIplXJ9wQ",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0186",
"articleId": "13rRUxC0SvL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0208",
"articleId": "13rRUwbs2aT",
"__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": "13rRUwIF6dE",
"doi": "10.1109/TVCG.2005.44",
"abstract": "In this paper, we introduce new techniques that enhance the computational performance for the interactions between sharp objects and deformable surfaces. The new formulation is based on a time-domain predictor-corrector model. For this purpose, we define a new kind of (\\pi, \\beta, {\\bf I}){\\hbox{-}}{\\rm surface}. The partitioning of a deformable surface into a finite set of (\\pi, \\beta, {\\bf I}){\\hbox{-}}{\\rm surfaces} allows us to prune a large number of noncolliding feature pairs. This leads to a significant performance improvement in the collision detection process. The intrinsic collision detection is performed in the time domain. Although it is more expensive compared to the static interference test, it avoids portions of the surfaces passing through each other in a single time step. In order to resolve all the possible collision events at a given time, a penetration-free motion space is constructed for each colliding particle. By keeping the velocity of each particle inside the motion space, we guarantee that the current colliding feature pairs will not penetrate each other in the subsequent motion. A static analysis approach is adopted to handle friction by considering the forces acting on the particles and their velocities. In our formulation, we further reduce the computational complexity by eliminating the need to compute repulsive forces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we introduce new techniques that enhance the computational performance for the interactions between sharp objects and deformable surfaces. The new formulation is based on a time-domain predictor-corrector model. For this purpose, we define a new kind of (\\pi, \\beta, {\\bf I}){\\hbox{-}}{\\rm surface}. The partitioning of a deformable surface into a finite set of (\\pi, \\beta, {\\bf I}){\\hbox{-}}{\\rm surfaces} allows us to prune a large number of noncolliding feature pairs. This leads to a significant performance improvement in the collision detection process. The intrinsic collision detection is performed in the time domain. Although it is more expensive compared to the static interference test, it avoids portions of the surfaces passing through each other in a single time step. In order to resolve all the possible collision events at a given time, a penetration-free motion space is constructed for each colliding particle. By keeping the velocity of each particle inside the motion space, we guarantee that the current colliding feature pairs will not penetrate each other in the subsequent motion. A static analysis approach is adopted to handle friction by considering the forces acting on the particles and their velocities. In our formulation, we further reduce the computational complexity by eliminating the need to compute repulsive forces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we introduce new techniques that enhance the computational performance for the interactions between sharp objects and deformable surfaces. The new formulation is based on a time-domain predictor-corrector model. For this purpose, we define a new kind of (\\pi, \\beta, {\\bf I}){\\hbox{-}}{\\rm surface}. The partitioning of a deformable surface into a finite set of (\\pi, \\beta, {\\bf I}){\\hbox{-}}{\\rm surfaces} allows us to prune a large number of noncolliding feature pairs. This leads to a significant performance improvement in the collision detection process. The intrinsic collision detection is performed in the time domain. Although it is more expensive compared to the static interference test, it avoids portions of the surfaces passing through each other in a single time step. In order to resolve all the possible collision events at a given time, a penetration-free motion space is constructed for each colliding particle. By keeping the velocity of each particle inside the motion space, we guarantee that the current colliding feature pairs will not penetrate each other in the subsequent motion. A static analysis approach is adopted to handle friction by considering the forces acting on the particles and their velocities. In our formulation, we further reduce the computational complexity by eliminating the need to compute repulsive forces.",
"title": "Dynamic Interaction between Deformable Surfaces and Nonsmooth Objects",
"normalizedTitle": "Dynamic Interaction between Deformable Surfaces and Nonsmooth Objects",
"fno": "v0329",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Collision Detection",
"Deformable Surfaces",
"Cloth Simulation",
"Animation",
"Sharp Objects",
"Friction"
],
"authors": [
{
"givenName": "Wingo Sai-Keung",
"surname": "Wong",
"fullName": "Wingo Sai-Keung Wong",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "George",
"surname": "Baciu",
"fullName": "George Baciu",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2005-05-01 00:00:00",
"pubType": "trans",
"pages": "329-340",
"year": "2005",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccsee/2012/4647/3/4647c557",
"title": "Collision Detection Research for Deformable Objects",
"doi": null,
"abstractUrl": "/proceedings-article/iccsee/2012/4647c557/12OmNAXxWYc",
"parentPublication": {
"id": "proceedings/iccsee/2012/4647/3",
"title": "Computer Science and Electronics Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iros/1995/7108/2/71082305",
"title": "Fast dynamic simulation of rigid and deformable objects",
"doi": null,
"abstractUrl": "/proceedings-article/iros/1995/71082305/12OmNvEhg21",
"parentPublication": {
"id": "proceedings/iros/1995/7108/2",
"title": "Intelligent Robots and Systems, IEEE/RSJ International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccima/1999/0300/0/03000191",
"title": "Inferring Solid Objects with Cylindrical Surfaces from Orthographic Views",
"doi": null,
"abstractUrl": "/proceedings-article/iccima/1999/03000191/12OmNwbukeU",
"parentPublication": {
"id": "proceedings/iccima/1999/0300/0",
"title": "Computational Intelligence and Multimedia Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsee/2012/4647/3/4647c534",
"title": "A Fast Collision Detection Algorithm Based on Distance Calculations between NURBS Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccsee/2012/4647c534/12OmNxeM482",
"parentPublication": {
"id": "proceedings/iccsee/2012/4647/3",
"title": "Computer Science and Electronics Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a288",
"title": "Parallel Spatial Hashing for Collision Detection of Deformable Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a288/12OmNybfr5g",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/06/v0649",
"title": "Image-Based Collision Detection for Deformable Cloth Models",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0649/13rRUNvgz9z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/02/ttg2009020339",
"title": "Robust High-Resolution Cloth Using Parallelism, History-Based Collisions, and Accurate Friction",
"doi": null,
"abstractUrl": "/journal/tg/2009/02/ttg2009020339/13rRUwbs20R",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2017/01/07539397",
"title": "Importance of Matching Physical Friction, Hardness, and Texture in Creating Realistic Haptic Virtual Surfaces",
"doi": null,
"abstractUrl": "/journal/th/2017/01/07539397/13rRUxAAT7O",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/01/v0039",
"title": "Animation of Deformable Models Using Implicit Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/1997/01/v0039/13rRUxASuMt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/04/v0346",
"title": "Robust Creation of Implicit Surfaces from Polygonal Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2002/04/v0346/13rRUxD9h4Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0317",
"articleId": "13rRUwgQpDg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0341",
"articleId": "13rRUxE04tq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAgY7pp",
"title": "March/April",
"year": "2009",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs20R",
"doi": "10.1109/TVCG.2008.79",
"abstract": "In this paper we simulate high resolution cloth consisting of up to 2 million triangles which allows us to achieve highly detailed folds and wrinkles. Since the level of detail is also influenced by object collision and self collision, we propose a more accurate model for cloth-object friction. We also propose a robust history-based repulsion/collision framework where repulsions are treated accurately and efficiently on a per time step basis. Distributed memory parallelism is used for both time evolution and collisions and we specifically address Gauss-Seidel ordering of repulsion/collision response. This algorithm is demonstrated by several high resolution and high-fidelity simulations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we simulate high resolution cloth consisting of up to 2 million triangles which allows us to achieve highly detailed folds and wrinkles. Since the level of detail is also influenced by object collision and self collision, we propose a more accurate model for cloth-object friction. We also propose a robust history-based repulsion/collision framework where repulsions are treated accurately and efficiently on a per time step basis. Distributed memory parallelism is used for both time evolution and collisions and we specifically address Gauss-Seidel ordering of repulsion/collision response. This algorithm is demonstrated by several high resolution and high-fidelity simulations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we simulate high resolution cloth consisting of up to 2 million triangles which allows us to achieve highly detailed folds and wrinkles. Since the level of detail is also influenced by object collision and self collision, we propose a more accurate model for cloth-object friction. We also propose a robust history-based repulsion/collision framework where repulsions are treated accurately and efficiently on a per time step basis. Distributed memory parallelism is used for both time evolution and collisions and we specifically address Gauss-Seidel ordering of repulsion/collision response. This algorithm is demonstrated by several high resolution and high-fidelity simulations.",
"title": "Robust High-Resolution Cloth Using Parallelism, History-Based Collisions, and Accurate Friction",
"normalizedTitle": "Robust High-Resolution Cloth Using Parallelism, History-Based Collisions, and Accurate Friction",
"fno": "ttg2009020339",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Graphics",
"Geometric Algorithms",
"Physically Based Modeling",
"Cloth",
"Collision Responce",
"Friction"
],
"authors": [
{
"givenName": "Andrew",
"surname": "Selle",
"fullName": "Andrew Selle",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonathan",
"surname": "Su",
"fullName": "Jonathan Su",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Geoffrey",
"surname": "Irving",
"fullName": "Geoffrey Irving",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ronald",
"surname": "Fedkiw",
"fullName": "Ronald Fedkiw",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2009-03-01 00:00:00",
"pubType": "trans",
"pages": "339-350",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdh/2012/4899/0/4899a001",
"title": "A Cloth Simulation Method Based on Differential Geometric Energy",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2012/4899a001/12OmNAu1FlJ",
"parentPublication": {
"id": "proceedings/icdh/2012/4899/0",
"title": "4th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/2001/7237/0/00982385",
"title": "Collision resolutions in cloth simulation",
"doi": null,
"abstractUrl": "/proceedings-article/ca/2001/00982385/12OmNBzAciR",
"parentPublication": {
"id": "proceedings/ca/2001/7237/0",
"title": "Proceedings Computer Animation 2001. Fourteenth Conference on Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paciia/2008/3490/1/3490a977",
"title": "The Study of Enhancing Authenticity of Cloth Surface Intersection Processing",
"doi": null,
"abstractUrl": "/proceedings-article/paciia/2008/3490a977/12OmNCvumSN",
"parentPublication": {
"id": "proceedings/paciia/2008/3490/1",
"title": "Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2000/0643/0/06430257",
"title": "Implementing Fast Cloth Simulation with Collision Response",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2000/06430257/12OmNxEjXRT",
"parentPublication": {
"id": "proceedings/cgi/2000/0643/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2010/4359/0/4359a097",
"title": "Cloth Simulation Using AABB Hierarchies and GPU Parallelism",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2010/4359a097/12OmNxYbT1V",
"parentPublication": {
"id": "proceedings/sbgames/2010/4359/0",
"title": "2010 Brazilian Symposium on Games and Digital Entertainment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dmdcm/2011/4413/0/4413a176",
"title": "Physically Based Method for Cloth Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/dmdcm/2011/4413a176/12OmNzCWG8T",
"parentPublication": {
"id": "proceedings/dmdcm/2011/4413/0",
"title": "Digital Media and Digital Content Management, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2005/9330/0/01500371",
"title": "A collision resolution algorithm for clump-free fast moving cloth",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2005/01500371/12OmNzZWbIM",
"parentPublication": {
"id": "proceedings/cgi/2005/9330/0",
"title": "Computer Graphics International 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/06/v0649",
"title": "Image-Based Collision Detection for Deformable Cloth Models",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0649/13rRUNvgz9z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/01/ttg2013010149",
"title": "Animating Wrinkles by Example on Non-Skinned Cloth",
"doi": null,
"abstractUrl": "/journal/tg/2013/01/ttg2013010149/13rRUynHuj9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09488170",
"title": "A Visual Approach to Measure Cloth-Body and Cloth-Cloth Friction",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09488170/1vhI9UuRipO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009020325",
"articleId": "13rRUNvgz9C",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFoZ",
"name": "ttg2009020339s.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009020339s.zip",
"extension": "zip",
"size": "45.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvwoNX",
"title": "July/August",
"year": "2010",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgz4c",
"doi": "10.1109/TVCG.2010.29",
"abstract": "Efficient multiresolution representations for isosurfaces and interval volumes are becoming increasingly important as the gap between volume data sizes and processing speed continues to widen. Our multiresolution scalar field model is a hierarchy of tetrahedral clusters generated by longest edge bisection that we call a hierarchy of diamonds. We propose two multiresolution models for representing isosurfaces, or interval volumes, extracted from a hierarchy of diamonds which exploit its regular structure. These models are defined by subsets of diamonds in the hierarchy that we call isodiamonds, which are enhanced with geometric and topological information for encoding the relation between the isosurface, or interval volume, and the diamond itself. The first multiresolution model, called a relevant isodiamond hierarchy, encodes the isodiamonds intersected by the isosurface, or interval volume, as well as their nonintersected ancestors, while the second model, called a minimal isodiamond hierarchy, encodes only the intersected isodiamonds. Since both models operate directly on the extracted isosurface or interval volume, they require significantly less memory and support faster selective refinement queries than the original multiresolution scalar field, but do not support dynamic isovalue modifications. Moreover, since a minimal isodiamond hierarchy only encodes intersected isodiamonds, its extracted meshes require significantly less memory than those extracted from a relevant isodiamond hierarchy. We demonstrate the compactness of isodiamond hierarchies by comparing them to an indexed representation of the mesh at full resolution.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Efficient multiresolution representations for isosurfaces and interval volumes are becoming increasingly important as the gap between volume data sizes and processing speed continues to widen. Our multiresolution scalar field model is a hierarchy of tetrahedral clusters generated by longest edge bisection that we call a hierarchy of diamonds. We propose two multiresolution models for representing isosurfaces, or interval volumes, extracted from a hierarchy of diamonds which exploit its regular structure. These models are defined by subsets of diamonds in the hierarchy that we call isodiamonds, which are enhanced with geometric and topological information for encoding the relation between the isosurface, or interval volume, and the diamond itself. The first multiresolution model, called a relevant isodiamond hierarchy, encodes the isodiamonds intersected by the isosurface, or interval volume, as well as their nonintersected ancestors, while the second model, called a minimal isodiamond hierarchy, encodes only the intersected isodiamonds. Since both models operate directly on the extracted isosurface or interval volume, they require significantly less memory and support faster selective refinement queries than the original multiresolution scalar field, but do not support dynamic isovalue modifications. Moreover, since a minimal isodiamond hierarchy only encodes intersected isodiamonds, its extracted meshes require significantly less memory than those extracted from a relevant isodiamond hierarchy. We demonstrate the compactness of isodiamond hierarchies by comparing them to an indexed representation of the mesh at full resolution.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Efficient multiresolution representations for isosurfaces and interval volumes are becoming increasingly important as the gap between volume data sizes and processing speed continues to widen. Our multiresolution scalar field model is a hierarchy of tetrahedral clusters generated by longest edge bisection that we call a hierarchy of diamonds. We propose two multiresolution models for representing isosurfaces, or interval volumes, extracted from a hierarchy of diamonds which exploit its regular structure. These models are defined by subsets of diamonds in the hierarchy that we call isodiamonds, which are enhanced with geometric and topological information for encoding the relation between the isosurface, or interval volume, and the diamond itself. The first multiresolution model, called a relevant isodiamond hierarchy, encodes the isodiamonds intersected by the isosurface, or interval volume, as well as their nonintersected ancestors, while the second model, called a minimal isodiamond hierarchy, encodes only the intersected isodiamonds. Since both models operate directly on the extracted isosurface or interval volume, they require significantly less memory and support faster selective refinement queries than the original multiresolution scalar field, but do not support dynamic isovalue modifications. Moreover, since a minimal isodiamond hierarchy only encodes intersected isodiamonds, its extracted meshes require significantly less memory than those extracted from a relevant isodiamond hierarchy. We demonstrate the compactness of isodiamond hierarchies by comparing them to an indexed representation of the mesh at full resolution.",
"title": "Isodiamond Hierarchies: An Efficient Multiresolution Representation for Isosurfaces and Interval Volumes",
"normalizedTitle": "Isodiamond Hierarchies: An Efficient Multiresolution Representation for Isosurfaces and Interval Volumes",
"fno": "ttg2010040583",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Isosurfaces",
"Interval Volumes",
"Multiresolution Models",
"Longest Edge Bisection",
"Diamond Hierarchies"
],
"authors": [
{
"givenName": "Kenneth",
"surname": "Weiss",
"fullName": "Kenneth Weiss",
"affiliation": "University of Maryland, College Park",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leila",
"surname": "De Floriani",
"fullName": "Leila De Floriani",
"affiliation": "Università di Genova, Genova",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2010-07-01 00:00:00",
"pubType": "trans",
"pages": "583-598",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2010/4109/0/4109e093",
"title": "Multiresolution Analysis of 3D Images Based on Discrete Distortion",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109e093/12OmNzfXayw",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061603",
"title": "Supercubes: A High-Level Primitive for Diamond Hierarchies",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061603/13rRUx0xPmW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010040571",
"articleId": "13rRUwgyOjh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010040609",
"articleId": "13rRUxOdD8g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzxgHwi",
"title": "May-June",
"year": "2014",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "34",
"label": "May-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJcWnu",
"doi": "10.1109/MCG.2014.43",
"abstract": "A proposed real-time neurosurgery simulator handles skull drilling and surgical interaction with the brain. This involves the development and combination of areas such as collision handling, haptic rendering, physical simulation, and volumetric visualization. The simulator's input data comes from computed-tomography and magnetic-resonance-imaging images of the patients. Collision detection for drilling uses only density data; collision detection for interaction with the brain is based on uniform spatial subdivision of a tetrahedral mesh. To take advantage of all the information, the simulator employs visualization methods such as volumetric isosurfaces and deformable volume rendering.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A proposed real-time neurosurgery simulator handles skull drilling and surgical interaction with the brain. This involves the development and combination of areas such as collision handling, haptic rendering, physical simulation, and volumetric visualization. The simulator's input data comes from computed-tomography and magnetic-resonance-imaging images of the patients. Collision detection for drilling uses only density data; collision detection for interaction with the brain is based on uniform spatial subdivision of a tetrahedral mesh. To take advantage of all the information, the simulator employs visualization methods such as volumetric isosurfaces and deformable volume rendering.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A proposed real-time neurosurgery simulator handles skull drilling and surgical interaction with the brain. This involves the development and combination of areas such as collision handling, haptic rendering, physical simulation, and volumetric visualization. The simulator's input data comes from computed-tomography and magnetic-resonance-imaging images of the patients. Collision detection for drilling uses only density data; collision detection for interaction with the brain is based on uniform spatial subdivision of a tetrahedral mesh. To take advantage of all the information, the simulator employs visualization methods such as volumetric isosurfaces and deformable volume rendering.",
"title": "A Brain Surgery Simulator",
"normalizedTitle": "A Brain Surgery Simulator",
"fno": "mcg2014030012",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Haptic Interfaces",
"Computational Modeling",
"Deformable Models",
"Surgery",
"Brain Models",
"Rendering Computer Graphics",
"Neurosurgery",
"Computer Graphics",
"Haptic Interfaces",
"Computational Modeling",
"Deformable Models",
"Surgery",
"Brain Models",
"Rendering Computer Graphics",
"Neurosurgery",
"Graphics",
"Haptic Interfaces",
"Computational Modeling",
"Deformable Models",
"Surgery",
"Brain Models",
"Rendering Computer Graphics",
"Neurosurgery",
"Bioinformatics",
"Haptic Interfaces",
"Computational Modeling",
"Deformable Models",
"Surgery",
"Brain Models",
"Rendering Computer Graphics",
"Neurosurgery",
"Healthcare",
"Surgery Simulation",
"Neurosurgery Simulation",
"Craniotomy",
"Brain Surgery",
"Medical Simulation",
"Virtual Reality",
"VR",
"Brain Surgery",
"Haptics",
"Multimedia"
],
"authors": [
{
"givenName": "Goretti",
"surname": "Echegaray",
"fullName": "Goretti Echegaray",
"affiliation": "Centre of Studies and Technical Research (CEIT)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Imanol",
"surname": "Herrera",
"fullName": "Imanol Herrera",
"affiliation": "Centre of Studies and Technical Research (CEIT)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Iker",
"surname": "Aguinaga",
"fullName": "Iker Aguinaga",
"affiliation": "Centre of Studies and Technical Research (CEIT)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carlos",
"surname": "Buchart",
"fullName": "Carlos Buchart",
"affiliation": "Centre of Studies and Technical Research (CEIT)",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Diego",
"surname": "Borro",
"fullName": "Diego Borro",
"affiliation": "Centre of Studies and Technical Research (CEIT)",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2014-05-01 00:00:00",
"pubType": "mags",
"pages": "12-18",
"year": "2014",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icat/2007/3056/0/30560221",
"title": "Virtual Surgery Deformable Modelling Employing GPU Based Computation",
"doi": null,
"abstractUrl": "/proceedings-article/icat/2007/30560221/12OmNBTJIOB",
"parentPublication": {
"id": "proceedings/icat/2007/3056/0",
"title": "17th International Conference on Artificial Reality and Telexistence (ICAT 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2001/1423/0/00974437",
"title": "Investigation of ultrasound image based correction of intraoperative brain shift",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2001/00974437/12OmNCdk2QG",
"parentPublication": {
"id": "proceedings/bibe/2001/1423/0",
"title": "Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptic/2006/0226/0/01627118",
"title": "Geometric Properties of Contacts Involving a Deformable Object",
"doi": null,
"abstractUrl": "/proceedings-article/haptic/2006/01627118/12OmNvTTc8v",
"parentPublication": {
"id": "proceedings/haptic/2006/0226/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444756",
"title": "Endoscopic endonasal haptic surgery simulator prototype: A rigid endoscope model",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444756/12OmNwAt1D2",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/3/212830770",
"title": "A New Method for Quantification of Age-Related Brain Changes",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212830770/12OmNxRF74N",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2007/0905/0/04161034",
"title": "Real-time Volumetric Haptic and Visual Burrhole Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2007/04161034/12OmNy7yEem",
"parentPublication": {
"id": "proceedings/vr/2007/0905/0",
"title": "2007 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446462",
"title": "A Virtual Hip Replacement Surgery Simulator with Realistic Haptic Feedback",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446462/13bd1f3HvEK",
"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/1999/01/v0062",
"title": "Real-Time Elastic Deformations of Soft Tissues for Surgery Simulation",
"doi": null,
"abstractUrl": "/journal/tg/1999/01/v0062/13rRUxBa5nf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2016/02/mex2016020066",
"title": "Brain MRI Tumor Segmentation with 3D Intracranial Structure Deformation Features",
"doi": null,
"abstractUrl": "/magazine/ex/2016/02/mex2016020066/13rRUzphDrB",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chase/2020/7591/0/759100a007",
"title": "Poster: Towards Diagnostic Applications of Virtual/Mixed Reality to Brain Scans",
"doi": null,
"abstractUrl": "/proceedings-article/chase/2020/759100a007/1qzwTXnpfnG",
"parentPublication": {
"id": "proceedings/chase/2020/7591/0",
"title": "2020 IEEE/ACM International Conference on Connected Health: Applications, Systems and Engineering Technologies (CHASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2014030008",
"articleId": "13rRUxNmPLh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2014030020",
"articleId": "13rRUyoPSRz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx4yvun",
"title": "March",
"year": "2015",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD8j",
"doi": "10.1109/TVCG.2014.2362546",
"abstract": "In this paper, we present a straightforward, easy to implement method for particle skinning-generating surfaces from animated particle data. We cast the problem in terms of constrained optimization and solve the optimization using a level-set approach. The optimization seeks to minimize the thin-plate energy of the surface, while staying between surfaces defined by the union of spheres centered at the particles. Our approach skins each frame independently while preserving the temporal coherence of the underlying particle animation. Thus, it is well-suited for environments where particle skinning is treated as a post-process, with each frame generated in parallel. Moreover, our approach is integrated with the OpenVDB library and the underlying partial differential equation is amenable to implicit time integration. We demonstrate our method on data generated by a variety of fluid simulation techniques and simple particle systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a straightforward, easy to implement method for particle skinning-generating surfaces from animated particle data. We cast the problem in terms of constrained optimization and solve the optimization using a level-set approach. The optimization seeks to minimize the thin-plate energy of the surface, while staying between surfaces defined by the union of spheres centered at the particles. Our approach skins each frame independently while preserving the temporal coherence of the underlying particle animation. Thus, it is well-suited for environments where particle skinning is treated as a post-process, with each frame generated in parallel. Moreover, our approach is integrated with the OpenVDB library and the underlying partial differential equation is amenable to implicit time integration. We demonstrate our method on data generated by a variety of fluid simulation techniques and simple particle systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a straightforward, easy to implement method for particle skinning-generating surfaces from animated particle data. We cast the problem in terms of constrained optimization and solve the optimization using a level-set approach. The optimization seeks to minimize the thin-plate energy of the surface, while staying between surfaces defined by the union of spheres centered at the particles. Our approach skins each frame independently while preserving the temporal coherence of the underlying particle animation. Thus, it is well-suited for environments where particle skinning is treated as a post-process, with each frame generated in parallel. Moreover, our approach is integrated with the OpenVDB library and the underlying partial differential equation is amenable to implicit time integration. We demonstrate our method on data generated by a variety of fluid simulation techniques and simple particle systems.",
"title": "A Level-Set Method for Skinning Animated Particle Data",
"normalizedTitle": "A Level-Set Method for Skinning Animated Particle Data",
"fno": "06919322",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Optimisation",
"Computer Animation",
"Simple Particle Systems",
"Level Set Method",
"Animated Particle Data Skinning",
"Particle Skinning Generating Surface Method",
"Constrained Optimization",
"Thin Plate Energy",
"Open VDB Library",
"Partial Differential Equation",
"Implicit Time Integration",
"Fluid Simulation Techniques",
"Smoothing Methods",
"Optimization",
"Laplace Equations",
"Surface Treatment",
"Buffer Storage",
"Animation",
"Constrained Smoothing",
"Particle Skinning",
"Level Set Methods",
"Particle Systems",
"Fluid Simulation",
"Surface Smoothing",
"Constrained Smoothing",
"Particle Skinning",
"Level Set Methods",
"Particle Systems",
"Fluid Simulation",
"Surface Smoothing"
],
"authors": [
{
"givenName": "Haimasree",
"surname": "Bhattacharya",
"fullName": "Haimasree Bhattacharya",
"affiliation": "University of Utah, Salt Lake City, UT",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Gao",
"fullName": "Yue Gao",
"affiliation": "TangoME, Inc.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Adam W.",
"surname": "Bargteil",
"fullName": "Adam W. Bargteil",
"affiliation": "University of Utah, Salt Lake City, UT",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2015-03-01 00:00:00",
"pubType": "trans",
"pages": "315-327",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2009/3789/0/3789a032",
"title": "Particle Based Skinning",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a032/12OmNAObbJ7",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2004/2122/0/21220675",
"title": "Smart Particle Filtering for 3D Hand Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2004/21220675/12OmNAiFIa6",
"parentPublication": {
"id": "proceedings/fg/2004/2122/0",
"title": "Sixth IEEE International Conference on Automatic Face and Gesture Recognition, 2004. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2013/5099/0/5099a179",
"title": "Shape Inflation with an Adapted Laplacian Operator for Hybrid Quad/Triangle Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2013/5099a179/12OmNqGRGaD",
"parentPublication": {
"id": "proceedings/sibgrapi/2013/5099/0",
"title": "2013 XXVI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/2/01326352",
"title": "The application of particle swarm optimization to adaptive IIR phase equalization",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326352/12OmNqIzgSJ",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/2",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2007/3063/0/30630137",
"title": "Hammerstein Model Identification Based on Adaptive Particle Swarm Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2007/30630137/12OmNwe2IlI",
"parentPublication": {
"id": "proceedings/iita/2007/3063/0",
"title": "Intelligent Information Technology Applications, 2007 Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2010/4166/0/4166a073",
"title": "NURBS Curve Approximation Using Particle Swarm Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2010/4166a073/12OmNx4yvFV",
"parentPublication": {
"id": "proceedings/cgiv/2010/4166/0",
"title": "2010 Seventh International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2008/2357/0/04594642",
"title": "Triangulation of Implicit Surfaces Based on Particle System",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2008/04594642/12OmNyS6REh",
"parentPublication": {
"id": "proceedings/cit/2008/2357/0",
"title": "2008 8th IEEE International Conference on Computer and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/04/ttg2008040797",
"title": "Two-Way Coupled SPH and Particle Level Set Fluid Simulation",
"doi": null,
"abstractUrl": "/journal/tg/2008/04/ttg2008040797/13rRUxE04tu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/04/v0383",
"title": "Dynamic Particle Coating",
"doi": null,
"abstractUrl": "/journal/tg/2002/04/v0383/13rRUzp02oa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2020/8666/0/866600a394",
"title": "Optimized LSTM Network Based on Particle Swarm Algorithm for Power Time Series Data prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2020/866600a394/1wRICSfzKYE",
"parentPublication": {
"id": "proceedings/icicta/2020/8666/0",
"title": "2020 13th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06910280",
"articleId": "13rRUIJuxpC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06933942",
"articleId": "13rRUxly8XG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC0PGNr",
"title": "January-March",
"year": "1997",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "3",
"label": "January-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWkR",
"doi": "10.1109/2945.582346",
"abstract": "Abstract—Fast and accurate collision detection between general polygonal models is a fundamental problem in physically based and geometric modeling, robotics, animation, and computer-simulated environments. Most earlier collision detection algorithms are either restricted to a class of models (such as convex polytopes) or are not fast enough for practical applications. We present an incremental algorithm for collision detection between general polygonal models in dynamic environments. The algorithm combines a hierarchical representation with incremental computation to rapidly detect collisions. It makes use of coherence between successive instances to efficiently determine the number of object features interacting. For each pair of objects, it tracks the closest features between them on their respective convex hulls. It detects the objects' penetration using pseudo internal Voronoi cells and constructs the penetration region, thus identifying the regions of contact on the convex hulls. The features associated with these regions are represented in a precomputed hierarchy. The algorithm uses a coherence based approach to quickly traverse the precomputed hierarchy and check for possible collisions between the features. We highlight its performance on different applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Fast and accurate collision detection between general polygonal models is a fundamental problem in physically based and geometric modeling, robotics, animation, and computer-simulated environments. Most earlier collision detection algorithms are either restricted to a class of models (such as convex polytopes) or are not fast enough for practical applications. We present an incremental algorithm for collision detection between general polygonal models in dynamic environments. The algorithm combines a hierarchical representation with incremental computation to rapidly detect collisions. It makes use of coherence between successive instances to efficiently determine the number of object features interacting. For each pair of objects, it tracks the closest features between them on their respective convex hulls. It detects the objects' penetration using pseudo internal Voronoi cells and constructs the penetration region, thus identifying the regions of contact on the convex hulls. The features associated with these regions are represented in a precomputed hierarchy. The algorithm uses a coherence based approach to quickly traverse the precomputed hierarchy and check for possible collisions between the features. We highlight its performance on different applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Fast and accurate collision detection between general polygonal models is a fundamental problem in physically based and geometric modeling, robotics, animation, and computer-simulated environments. Most earlier collision detection algorithms are either restricted to a class of models (such as convex polytopes) or are not fast enough for practical applications. We present an incremental algorithm for collision detection between general polygonal models in dynamic environments. The algorithm combines a hierarchical representation with incremental computation to rapidly detect collisions. It makes use of coherence between successive instances to efficiently determine the number of object features interacting. For each pair of objects, it tracks the closest features between them on their respective convex hulls. It detects the objects' penetration using pseudo internal Voronoi cells and constructs the penetration region, thus identifying the regions of contact on the convex hulls. The features associated with these regions are represented in a precomputed hierarchy. The algorithm uses a coherence based approach to quickly traverse the precomputed hierarchy and check for possible collisions between the features. We highlight its performance on different applications.",
"title": "Incremental Algorithms for Collision Detection Between Polygonal Models",
"normalizedTitle": "Incremental Algorithms for Collision Detection Between Polygonal Models",
"fno": "v0051",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Collision Detection",
"Contacts",
"Interference",
"Dynamic Simulation",
"Physically Based Modeling",
"Convex Hulls",
"Hierarchical Representation"
],
"authors": [
{
"givenName": "Madhav K.",
"surname": "Ponamgi",
"fullName": "Madhav K. Ponamgi",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dinesh",
"surname": "Manocha",
"fullName": "Dinesh Manocha",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ming C.",
"surname": "Lin",
"fullName": "Ming C. Lin",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1997-01-01 00:00:00",
"pubType": "trans",
"pages": "51-64",
"year": "1997",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0039",
"articleId": "13rRUxASuMt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0065",
"articleId": "13rRUwvBy8M",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwJPMX5",
"title": "Dec.",
"year": "2011",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "17",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs2gp",
"doi": "10.1109/TVCG.2011.204",
"abstract": "Research in the field of complex fluids such as polymer solutions, particulate suspensions and foams studies how the flow of fluids with different material parameters changes as a result of various constraints. Surface Evolver, the standard solver software used to generate foam simulations, provides large, complex, time-dependent data sets with hundreds or thousands of individual bubbles and thousands of time steps. However this software has limited visualization capabilities, and no foam specific visualization software exists. We describe the foam research application area where, we believe, visualization has an important role to play. We present a novel application that provides various techniques for visualization, exploration and analysis of time-dependent 2D foam simulation data. We show new features in foam simulation data and new insights into foam behavior discovered using our application.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Research in the field of complex fluids such as polymer solutions, particulate suspensions and foams studies how the flow of fluids with different material parameters changes as a result of various constraints. Surface Evolver, the standard solver software used to generate foam simulations, provides large, complex, time-dependent data sets with hundreds or thousands of individual bubbles and thousands of time steps. However this software has limited visualization capabilities, and no foam specific visualization software exists. We describe the foam research application area where, we believe, visualization has an important role to play. We present a novel application that provides various techniques for visualization, exploration and analysis of time-dependent 2D foam simulation data. We show new features in foam simulation data and new insights into foam behavior discovered using our application.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Research in the field of complex fluids such as polymer solutions, particulate suspensions and foams studies how the flow of fluids with different material parameters changes as a result of various constraints. Surface Evolver, the standard solver software used to generate foam simulations, provides large, complex, time-dependent data sets with hundreds or thousands of individual bubbles and thousands of time steps. However this software has limited visualization capabilities, and no foam specific visualization software exists. We describe the foam research application area where, we believe, visualization has an important role to play. We present a novel application that provides various techniques for visualization, exploration and analysis of time-dependent 2D foam simulation data. We show new features in foam simulation data and new insights into foam behavior discovered using our application.",
"title": "FoamVis: Visualization of 2D Foam Simulation Data",
"normalizedTitle": "FoamVis: Visualization of 2D Foam Simulation Data",
"fno": "ttg2011122096",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Surface Evolver",
"Bubble Scale Simulation",
"Time Dependent Visualizations"
],
"authors": [
{
"givenName": "Dan",
"surname": "Lipsa",
"fullName": "Dan Lipsa",
"affiliation": "Swansea University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Laramee",
"fullName": "Robert Laramee",
"affiliation": "Swansea University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Cox",
"fullName": "Simon Cox",
"affiliation": "Aberystwyth University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tudur",
"surname": "Davies",
"fullName": "Tudur Davies",
"affiliation": "Aberystwyth University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2011-12-01 00:00:00",
"pubType": "trans",
"pages": "2096-2105",
"year": "2011",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2010/6846/0/05444720",
"title": "Augmented foam sculpting for capturing 3D models",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2010/05444720/12OmNBUS75Z",
"parentPublication": {
"id": "proceedings/3dui/2010/6846/0",
"title": "2010 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scivis/2015/9785/0/07429509",
"title": "Automated visualization workflow for simulation experiments",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2015/07429509/12OmNBlFQZn",
"parentPublication": {
"id": "proceedings/scivis/2015/9785/0",
"title": "2015 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870077",
"title": "IFS Fractal Interpolation for 2D and 3D Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870077/12OmNwtn3x3",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2008/3359/0/3359a018",
"title": "Simulating the Coalescence and Separation of Bubble and Foam by Particle Level Set Method",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2008/3359a018/12OmNy2rS3O",
"parentPublication": {
"id": "proceedings/cgiv/2008/3359/0",
"title": "2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2007/3009/0/30090219",
"title": "Visualization and Simulation of Near-Body Hydrodynamics Using the Semi-Lagrangian Fluid Simulation Method",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2007/30090219/12OmNyS6RMg",
"parentPublication": {
"id": "proceedings/pg/2007/3009/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/biovis/2011/0003/0/143150miller",
"title": "EVEVis: A multi-scale visualization system for dense evolutionary data",
"doi": null,
"abstractUrl": "/proceedings-article/biovis/2011/143150miller/12OmNzJbR1M",
"parentPublication": {
"id": "proceedings/biovis/2011/0003/0",
"title": "2011 IEEE Symposium on Biological Data Visualization (BioVis).",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900028",
"title": "Temporal Visualization of Planning Polygons for Efficient Partitioning of Geo-Spatial Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900028/12OmNzb7Znj",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2001/04/mcg2001040034",
"title": "Large-Scale Data Visualization Using Parallel Data Streaming",
"doi": null,
"abstractUrl": "/magazine/cg/2001/04/mcg2001040034/13rRUxASu3c",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2011/06/mcs2011060052",
"title": "Visualizing 3D Earthquake Simulation Data",
"doi": null,
"abstractUrl": "/magazine/cs/2011/06/mcs2011060052/13rRUxC0SSx",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1751",
"title": "Virtual Rheoscopic Fluids for Flow Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1751/13rRUxjQyvb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2011122088",
"articleId": "13rRUyeTVhX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2011122106",
"articleId": "13rRUxCitJa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrAMF5S",
"title": "Aug.",
"year": "2019",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCitJm",
"doi": "10.1109/TVCG.2018.2851233",
"abstract": "We propose Average Vector Field (AVF) integration for simulation of deformable solids in physics-based animation. Our method achieves exact energy conservation for the St. Venant-Kirchhoff material without any correction steps or extra parameters. Exact energy conservation implies that our resulting animations 1) cannot explode and 2) do not suffer from numerical damping, which are two common problems with previous numerical integration techniques. Our method produces lively motion even with large time steps as typically used in physics-based animation. Our implicit update rules can be formulated as a minimization problem and solved in a similar way as optimization-based backward Euler, with only a mild computing overhead. Our approach also supports damping and collision response models, making it easy to deploy in practical computer animation pipelines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose Average Vector Field (AVF) integration for simulation of deformable solids in physics-based animation. Our method achieves exact energy conservation for the St. Venant-Kirchhoff material without any correction steps or extra parameters. Exact energy conservation implies that our resulting animations 1) cannot explode and 2) do not suffer from numerical damping, which are two common problems with previous numerical integration techniques. Our method produces lively motion even with large time steps as typically used in physics-based animation. Our implicit update rules can be formulated as a minimization problem and solved in a similar way as optimization-based backward Euler, with only a mild computing overhead. Our approach also supports damping and collision response models, making it easy to deploy in practical computer animation pipelines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose Average Vector Field (AVF) integration for simulation of deformable solids in physics-based animation. Our method achieves exact energy conservation for the St. Venant-Kirchhoff material without any correction steps or extra parameters. Exact energy conservation implies that our resulting animations 1) cannot explode and 2) do not suffer from numerical damping, which are two common problems with previous numerical integration techniques. Our method produces lively motion even with large time steps as typically used in physics-based animation. Our implicit update rules can be formulated as a minimization problem and solved in a similar way as optimization-based backward Euler, with only a mild computing overhead. Our approach also supports damping and collision response models, making it easy to deploy in practical computer animation pipelines.",
"title": "Average Vector Field Integration for St. Venant-Kirchhoff Deformable Models",
"normalizedTitle": "Average Vector Field Integration for St. Venant-Kirchhoff Deformable Models",
"fno": "08399552",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Animation",
"Minimisation",
"Solid Modelling",
"Deformable Solids",
"Physics Based Animation",
"Numerical Damping",
"Implicit Update Rules",
"Minimization Problem",
"Optimization Based Backward Euler",
"Collision Response Models",
"AVF Integration",
"Saint Venant Kirchhoff Deformable Models",
"Computer Animation Pipelines",
"Numerical Integration Techniques",
"Average Vector Field Integration",
"Animation",
"Energy Conservation",
"Damping",
"Trajectory",
"Computational Modeling",
"Numerical Models",
"Deformable Models",
"Animation",
"Three Dimensional Graphics And Realism"
],
"authors": [
{
"givenName": "Junior",
"surname": "Rojas",
"fullName": "Junior Rojas",
"affiliation": "School of Computing, University of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tiantian",
"surname": "Liu",
"fullName": "Tiantian Liu",
"affiliation": "Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ladislav",
"surname": "Kavan",
"fullName": "Ladislav Kavan",
"affiliation": "School of Computing, University of Utah, Salt Lake City, UT, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2019-08-01 00:00:00",
"pubType": "trans",
"pages": "2529-2539",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ca/2001/7237/0/00982388",
"title": "Merging deformable and rigid body mechanics simulation",
"doi": null,
"abstractUrl": "/proceedings-article/ca/2001/00982388/12OmNqIhFMw",
"parentPublication": {
"id": "proceedings/ca/2001/7237/0",
"title": "Proceedings Computer Animation 2001. Fourteenth Conference on Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1990/2057/0/00139536",
"title": "Surface reconstruction using deformable models with interior and boundary constraints",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1990/00139536/12OmNwBBqhx",
"parentPublication": {
"id": "proceedings/iccv/1990/2057/0",
"title": "Proceedings Third International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1995/7062/0/70620138",
"title": "Animating deformable models: different approaches",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1995/70620138/12OmNxA3Z7L",
"parentPublication": {
"id": "proceedings/ca/1995/7062/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sigra/1997/8102/0/00625149",
"title": "Analyzing a deformable model using differential geometry",
"doi": null,
"abstractUrl": "/proceedings-article/sigra/1997/00625149/12OmNxRF775",
"parentPublication": {
"id": "proceedings/sigra/1997/8102/0",
"title": "Proceedings X Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2008/3423/0/3423a045",
"title": "A High Performance Massively Parallel Approach for Real Time Deformable Body Physics Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2008/3423a045/12OmNyPQ4SK",
"parentPublication": {
"id": "proceedings/sbac-pad/2008/3423/0",
"title": "Computer Architecture and High Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020189",
"title": "Energy Conservation for the Simulation of Deformable Bodies",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020189/13rRUIJcWln",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/01/v0039",
"title": "Animation of Deformable Models Using Implicit Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/1997/01/v0039/13rRUxASuMt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/06/mcg2017060052",
"title": "Cloth Animation Retrieval Using a Motion-Shape Signature",
"doi": null,
"abstractUrl": "/magazine/cg/2017/06/mcg2017060052/13rRUyoPSRD",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/05/08642440",
"title": "Audio-Material Reconstruction for Virtualized Reality Using a Probabilistic Damping Model",
"doi": null,
"abstractUrl": "/journal/tg/2019/05/08642440/17PYEiVyc2u",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmeae/2021/9540/0/954000a045",
"title": "Ride Quality Improvement in Passenger Cars Using Regenerative Dampers: A Field-Oriented Control Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icmeae/2021/954000a045/1GZjCBPPFCM",
"parentPublication": {
"id": "proceedings/icmeae/2021/9540/0",
"title": "2021 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08395068",
"articleId": "1bemkCakE8M",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08401544",
"articleId": "13rRUx0gefp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i41n9tMNMI",
"name": "ttg201908-08399552s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201908-08399552s1.mp4",
"extension": "mp4",
"size": "80.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyv7moM",
"title": "Jan.",
"year": "2014",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNW1TU",
"doi": "10.1109/TVCG.2013.98",
"abstract": "In complex scenes with many objects, collision detection plays a key role in the simulation performance. This is particularly true in fracture simulation for two main reasons. One is that fracture fragments tend to exhibit very intensive contact, and the other is that collision detection data structures for new fragments need to be computed on the fly. In this paper, we present novel collision detection algorithms and data structures for real-time simulation of fracturing rigid bodies. We build on a combination of well-known efficient data structures, namely, distance fields and sphere trees, making our algorithm easy to integrate on existing simulation engines. We propose novel methods to construct these data structures, such that they can be efficiently updated upon fracture events and integrated in a simple yet effective self-adapting contact selection algorithm. Altogether, we drastically reduce the cost of both collision detection and collision response. We have evaluated our global solution for collision detection on challenging scenarios, achieving high frame rates suited for hard real-time applications such as video games or haptics. Our solution opens promising perspectives for complex fracture simulations involving many dynamically created rigid objects.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In complex scenes with many objects, collision detection plays a key role in the simulation performance. This is particularly true in fracture simulation for two main reasons. One is that fracture fragments tend to exhibit very intensive contact, and the other is that collision detection data structures for new fragments need to be computed on the fly. In this paper, we present novel collision detection algorithms and data structures for real-time simulation of fracturing rigid bodies. We build on a combination of well-known efficient data structures, namely, distance fields and sphere trees, making our algorithm easy to integrate on existing simulation engines. We propose novel methods to construct these data structures, such that they can be efficiently updated upon fracture events and integrated in a simple yet effective self-adapting contact selection algorithm. Altogether, we drastically reduce the cost of both collision detection and collision response. We have evaluated our global solution for collision detection on challenging scenarios, achieving high frame rates suited for hard real-time applications such as video games or haptics. Our solution opens promising perspectives for complex fracture simulations involving many dynamically created rigid objects.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In complex scenes with many objects, collision detection plays a key role in the simulation performance. This is particularly true in fracture simulation for two main reasons. One is that fracture fragments tend to exhibit very intensive contact, and the other is that collision detection data structures for new fragments need to be computed on the fly. In this paper, we present novel collision detection algorithms and data structures for real-time simulation of fracturing rigid bodies. We build on a combination of well-known efficient data structures, namely, distance fields and sphere trees, making our algorithm easy to integrate on existing simulation engines. We propose novel methods to construct these data structures, such that they can be efficiently updated upon fracture events and integrated in a simple yet effective self-adapting contact selection algorithm. Altogether, we drastically reduce the cost of both collision detection and collision response. We have evaluated our global solution for collision detection on challenging scenarios, achieving high frame rates suited for hard real-time applications such as video games or haptics. Our solution opens promising perspectives for complex fracture simulations involving many dynamically created rigid objects.",
"title": "Fast Collision Detection for Fracturing Rigid Bodies",
"normalizedTitle": "Fast Collision Detection for Fracturing Rigid Bodies",
"fno": "ttg2014010030",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Modeling",
"Data Structures",
"Surface Cracks",
"Approximation Methods",
"Detection Algorithms",
"Data Models",
"Approximation Algorithms",
"Rigid Body",
"Physical Simulation",
"Collision Detection",
"Fracture"
],
"authors": [
{
"givenName": "Loeiz",
"surname": "Glondu",
"fullName": "Loeiz Glondu",
"affiliation": "IRISA, Inria, Rennes, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sara C.",
"surname": "Schvartzman",
"fullName": "Sara C. Schvartzman",
"affiliation": "Univ. Rey Juan Carlos, Mostoles, Spain",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maud",
"surname": "Marchal",
"fullName": "Maud Marchal",
"affiliation": "IRISA, Inria, Rennes, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Georges",
"surname": "Dumont",
"fullName": "Georges Dumont",
"affiliation": "IRISA, Inria, Rennes, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Miguel A.",
"surname": "Otaduy",
"fullName": "Miguel A. Otaduy",
"affiliation": "Univ. Rey Juan Carlos, Mostoles, Spain",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2014-01-01 00:00:00",
"pubType": "trans",
"pages": "30-41",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2015/8391/0/8391c138",
"title": "3D Fragment Reassembly Using Integrated Template Guidance and Fracture-Region Matching",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391c138/12OmNCcKQCl",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccrd/2010/4043/0/4043a007",
"title": "Fast Traversal Algorithm for Detecting Object Interference Using Hierarchical Representation between Rigid Bodies",
"doi": null,
"abstractUrl": "/proceedings-article/iccrd/2010/4043a007/12OmNvEhfYT",
"parentPublication": {
"id": "proceedings/iccrd/2010/4043/0",
"title": "Computer Research and Development, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2017/5332/0/5332a057",
"title": "A Study of Assembly Navigation Operation with 2-D Panel for Restoring Fractured Objects",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2017/5332a057/12OmNwCJOQ1",
"parentPublication": {
"id": "proceedings/nicoint/2017/5332/0",
"title": "2017 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2014/2696/0/06963004",
"title": "Virtual merging of fractured fragments based on constraint cluster",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2014/06963004/12OmNwErpBv",
"parentPublication": {
"id": "proceedings/icccnt/2014/2696/0",
"title": "2014 5th International Conference on Computing, Communication and Networking Technologies (ICCCNT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034c934",
"title": "Geometry Based Faceting of 3D Digitized Archaeological Fragments",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c934/12OmNwK7obr",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2007/0905/0/04161009",
"title": "Balanced Hierarchies for Collision Detection between Fracturing Objects",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2007/04161009/12OmNyQYttV",
"parentPublication": {
"id": "proceedings/vr/2007/0905/0",
"title": "2007 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457502",
"title": "Virtual 3D bone fracture reconstruction via inter-fragmentary surface alignment",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457502/12OmNzvQHMO",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/02/v0370",
"title": "Fracturing Rigid Materials",
"doi": null,
"abstractUrl": "/journal/tg/2007/02/v0370/13rRUwfZC07",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/03/v0365",
"title": "Dynamic Simulation of Articulated Rigid Bodies with Contact and Collision",
"doi": null,
"abstractUrl": "/journal/tg/2006/03/v0365/13rRUx0xPTI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/06/ttg2013060991",
"title": "Interpenetration Free Simulation of Thin Shell Rigid Bodies",
"doi": null,
"abstractUrl": "/journal/tg/2013/06/ttg2013060991/13rRUygT7yb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2014010017",
"articleId": "13rRUB7a1fQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2014010042",
"articleId": "13rRUwjGoG2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRN3",
"name": "ttg2014010030s.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2014010030s.mp4",
"extension": "mp4",
"size": "22.6 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqBKU00",
"title": "April",
"year": "2016",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "38",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIIVllH",
"doi": "10.1109/TPAMI.2015.2453959",
"abstract": "We present a method for computing ambient occlusion (AO) for a stack of images of a Lambertian scene from a fixed viewpoint. Ambient occlusion, a concept common in computer graphics, characterizes the local visibility at a point: it approximates how much light can reach that point from different directions without getting blocked by other geometry. While AO has received surprisingly little attention in vision, we show that it can be approximated using simple, per-pixel statistics over image stacks, based on a simplified image formation model. We use our derived AO measure to compute reflectance and illumination for objects without relying on additional smoothness priors, and demonstrate state-of-the art performance on the MIT Intrinsic Images benchmark. We also demonstrate our method on several synthetic and real scenes, including 3D printed objects with known ground truth geometry.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a method for computing ambient occlusion (AO) for a stack of images of a Lambertian scene from a fixed viewpoint. Ambient occlusion, a concept common in computer graphics, characterizes the local visibility at a point: it approximates how much light can reach that point from different directions without getting blocked by other geometry. While AO has received surprisingly little attention in vision, we show that it can be approximated using simple, per-pixel statistics over image stacks, based on a simplified image formation model. We use our derived AO measure to compute reflectance and illumination for objects without relying on additional smoothness priors, and demonstrate state-of-the art performance on the MIT Intrinsic Images benchmark. We also demonstrate our method on several synthetic and real scenes, including 3D printed objects with known ground truth geometry.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a method for computing ambient occlusion (AO) for a stack of images of a Lambertian scene from a fixed viewpoint. Ambient occlusion, a concept common in computer graphics, characterizes the local visibility at a point: it approximates how much light can reach that point from different directions without getting blocked by other geometry. While AO has received surprisingly little attention in vision, we show that it can be approximated using simple, per-pixel statistics over image stacks, based on a simplified image formation model. We use our derived AO measure to compute reflectance and illumination for objects without relying on additional smoothness priors, and demonstrate state-of-the art performance on the MIT Intrinsic Images benchmark. We also demonstrate our method on several synthetic and real scenes, including 3D printed objects with known ground truth geometry.",
"title": "Photometric Ambient Occlusion for Intrinsic Image Decomposition",
"normalizedTitle": "Photometric Ambient Occlusion for Intrinsic Image Decomposition",
"fno": "07152924",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Lighting",
"Geometry",
"Light Sources",
"Computational Modeling",
"Cameras",
"Image Color Analysis",
"Three Dimensional Displays",
"Pixel Statistics",
"Ambient Occlusion",
"Intrinsic Images",
"Image Stacks",
"Pixel Statistics",
"Ambient Occlusion",
"Intrinsic Images",
"Image Stacks"
],
"authors": [
{
"givenName": "Daniel",
"surname": "Hauagge",
"fullName": "Daniel Hauagge",
"affiliation": ", Cornell University, Computer Science, Ithaca, New York",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Scott",
"surname": "Wehrwein",
"fullName": "Scott Wehrwein",
"affiliation": ", Cornell University, Computer Science, Ithaca, New York",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kavita",
"surname": "Bala",
"fullName": "Kavita Bala",
"affiliation": ", Cornell University, Computer Science, Ithaca, New York",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Noah",
"surname": "Snavely",
"fullName": "Noah Snavely",
"affiliation": ", Cornell University, Computer Science, Ithaca, New York",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2016-04-01 00:00:00",
"pubType": "trans",
"pages": "639-651",
"year": "2016",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cad-graphics/2013/2576/0/06814989",
"title": "Screen-Space Ambient Occlusion Using A-Buffer Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06814989/12OmNAs2tqk",
"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/sibgrapi/2012/4829/0/4829a142",
"title": "Ambient Occlusion Using Cone Tracing with Scene Voxelization",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2012/4829a142/12OmNBhZ4qF",
"parentPublication": {
"id": "proceedings/sibgrapi/2012/4829/0",
"title": "2012 25th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2013/4989/0/4989c515",
"title": "Photometric Ambient Occlusion",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989c515/12OmNvAiSDF",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2016/1552/0/07574757",
"title": "Photometric ambient occlusion from sparsely sampled illuminations",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2016/07574757/12OmNxAlA6a",
"parentPublication": {
"id": "proceedings/icmew/2016/1552/0",
"title": "2016 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815058",
"title": "Using Local Complexity to Accelerate Screen Space Ambient Occlusion",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815058/12OmNyRxFhs",
"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/cvpr/2015/6964/0/07299013",
"title": "Ambient occlusion via compressive visibility estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2015/07299013/12OmNyoAA5I",
"parentPublication": {
"id": "proceedings/cvpr/2015/6964/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391a433",
"title": "Intrinsic Decomposition of Image Sequences from Local Temporal Variations",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391a433/12OmNzC5Tdg",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2016/02/mcs2016020090",
"title": "Ambient Volume Illumination",
"doi": null,
"abstractUrl": "/magazine/cs/2016/02/mcs2016020090/13rRUxASu7D",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/01/mcg2010010070",
"title": "Volumetric Ambient Occlusion for Real-Time Rendering and Games",
"doi": null,
"abstractUrl": "/magazine/cg/2010/01/mcg2010010070/13rRUxlgxPs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__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"
}
],
"adjacentArticles": {
"previous": {
"fno": "06942196",
"articleId": "13rRUxASuUh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07152950",
"articleId": "13rRUxCitEl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCau3c2",
"title": "May/June",
"year": "2006",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "26",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwhpBSx",
"doi": "10.1109/MCG.2006.53",
"abstract": "Japan's animation industry leads the world with output of 2D animation. The continuing focus on 2D is partly economic (lower production cost) and partly aesthetic. Japan's traditional pictorial language, the antithesis of Western optical realism, matches the visual immediacy of animation. Several Japanese studios are blending 2D and 3D, a hybrid approach that mixes nonphotorealistic rendering and optical realism. The most notable example is Appleseed, a feature-length animation movie that explores a new visual language for computer graphics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Japan's animation industry leads the world with output of 2D animation. The continuing focus on 2D is partly economic (lower production cost) and partly aesthetic. Japan's traditional pictorial language, the antithesis of Western optical realism, matches the visual immediacy of animation. Several Japanese studios are blending 2D and 3D, a hybrid approach that mixes nonphotorealistic rendering and optical realism. The most notable example is Appleseed, a feature-length animation movie that explores a new visual language for computer graphics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Japan's animation industry leads the world with output of 2D animation. The continuing focus on 2D is partly economic (lower production cost) and partly aesthetic. Japan's traditional pictorial language, the antithesis of Western optical realism, matches the visual immediacy of animation. Several Japanese studios are blending 2D and 3D, a hybrid approach that mixes nonphotorealistic rendering and optical realism. The most notable example is Appleseed, a feature-length animation movie that explores a new visual language for computer graphics.",
"title": "Computer Graphics Advances the Art of Anime",
"normalizedTitle": "Computer Graphics Advances the Art of Anime",
"fno": "mcg2006030014",
"hasPdf": false,
"idPrefix": "cg",
"keywords": [
"Anime",
"Japan",
"Animation"
],
"authors": [
{
"givenName": "Jan",
"surname": "Krikke",
"fullName": "Jan Krikke",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2006-05-01 00:00:00",
"pubType": "mags",
"pages": "14-19",
"year": "2006",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ca/1995/7062/0/70620103",
"title": "Modelling the computer animation process for parallel environments",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1995/70620103/12OmNAg7jZW",
"parentPublication": {
"id": "proceedings/ca/1995/7062/0",
"title": "Computer Animation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpcon/1994/5380/0/00282884",
"title": "Computer graphics for Jurassic Park",
"doi": null,
"abstractUrl": "/proceedings-article/cmpcon/1994/00282884/12OmNqGiu60",
"parentPublication": {
"id": "proceedings/cmpcon/1994/5380/0",
"title": "Proceedings of COMPCON '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2015/8302/0/8302a610",
"title": "Study on the Japan's Animation Technology by Internet Based on Japanese Traditional Culture",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2015/8302a610/12OmNqN6R8t",
"parentPublication": {
"id": "proceedings/itme/2015/8302/0",
"title": "2015 7th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccats/2015/8211/0/8211a138",
"title": "Examination of Transformation Technique from Real World to ANIME World",
"doi": null,
"abstractUrl": "/proceedings-article/ccats/2015/8211a138/12OmNroijjy",
"parentPublication": {
"id": "proceedings/ccats/2015/8211/0",
"title": "2015 International Conference on Computer Application Technologies (CCATS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/searis/2012/1249/0/06231171",
"title": "Configurable semi-autonomic animated animal characters in interactive virtual reality applications",
"doi": null,
"abstractUrl": "/proceedings-article/searis/2012/06231171/12OmNvnOww6",
"parentPublication": {
"id": "proceedings/searis/2012/1249/0",
"title": "2012 5th Workshop on Software Engineering and Architectures for Realtime Interactive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/3/212830826",
"title": "Talking Faces - Technologies and Applications",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212830826/12OmNzwZ6jl",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/1981/03/01667276",
"title": "Computer Graphics: Reaching the User",
"doi": null,
"abstractUrl": "/magazine/co/1981/03/01667276/13rRUxlgy6s",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0058",
"title": "Transferring of Speech Movements from Video to 3D Face Space",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0058/13rRUxly95u",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/06/mcg2017060005",
"title": "Computer Graphics Animation for Objective Self-Evaluation",
"doi": null,
"abstractUrl": "/magazine/cg/2017/06/mcg2017060005/13rRUy3gn3D",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccgiv/2022/9250/0/925000a046",
"title": "3D animation face modeling and feature extraction based on computer graphics and image processing technology",
"doi": null,
"abstractUrl": "/proceedings-article/iccgiv/2022/925000a046/1Lxfq7G76Te",
"parentPublication": {
"id": "proceedings/iccgiv/2022/9250/0",
"title": "2022 2nd International Conference on Computer Graphics, Image and Virtualization (ICCGIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2006030010",
"articleId": "13rRUyuegjh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2006030020",
"articleId": "13rRUzpzeF1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxwWoNH",
"title": "July/August",
"year": "2009",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0qnGf",
"doi": "10.1109/TVCG.2009.22",
"abstract": "Given a manifold surface {\\cal M} and a continuous scalar function f:{\\cal M}\\rightarrow {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}, the Reeb graph of ({\\cal M},f) is a widely used high-level descriptor of {\\cal M} and its usefulness has been demonstrated for a variety of applications, which range from shape parameterization and abstraction to deformation and comparison. In this context, we propose a novel contouring algorithm for the construction of a discrete Reeb graph with a minimal number of nodes, which correspond to the critical points of f (i.e., minima, maxima, and saddle points) and its level sets passing through the saddle points. In this way, we do not need to sample, sweep, or increasingly sort the f-values. Since most of the computation uses only local information on the mesh connectivity, equipped with the f-values at the surface vertices, the proposed approach is insensitive to noise and requires a small-memory footprint and temporary data structures. Furthermore, we maintain the parametric nature of the Reeb graph with respect to the input scalar function and we efficiently extract the Reeb graph of time-varying maps. Indicating with n and s the number of vertices of {\\cal M} and saddle points of f, the overall computational cost O(sn) is competitive with respect to the O(n\\,\\log \\,n) cost of previous work. This cost becomes optimal if {\\cal M} is highly sampled or s\\le \\log n, as it happens for Laplacian eigenfunctions, harmonic maps, and one-forms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a manifold surface {\\cal M} and a continuous scalar function f:{\\cal M}\\rightarrow {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}, the Reeb graph of ({\\cal M},f) is a widely used high-level descriptor of {\\cal M} and its usefulness has been demonstrated for a variety of applications, which range from shape parameterization and abstraction to deformation and comparison. In this context, we propose a novel contouring algorithm for the construction of a discrete Reeb graph with a minimal number of nodes, which correspond to the critical points of f (i.e., minima, maxima, and saddle points) and its level sets passing through the saddle points. In this way, we do not need to sample, sweep, or increasingly sort the f-values. Since most of the computation uses only local information on the mesh connectivity, equipped with the f-values at the surface vertices, the proposed approach is insensitive to noise and requires a small-memory footprint and temporary data structures. Furthermore, we maintain the parametric nature of the Reeb graph with respect to the input scalar function and we efficiently extract the Reeb graph of time-varying maps. Indicating with n and s the number of vertices of {\\cal M} and saddle points of f, the overall computational cost O(sn) is competitive with respect to the O(n\\,\\log \\,n) cost of previous work. This cost becomes optimal if {\\cal M} is highly sampled or s\\le \\log n, as it happens for Laplacian eigenfunctions, harmonic maps, and one-forms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a manifold surface {\\cal M} and a continuous scalar function f:{\\cal M}\\rightarrow {\\hbox{\\rlap{I}\\kern 2.0pt{\\hbox{R}}}}, the Reeb graph of ({\\cal M},f) is a widely used high-level descriptor of {\\cal M} and its usefulness has been demonstrated for a variety of applications, which range from shape parameterization and abstraction to deformation and comparison. In this context, we propose a novel contouring algorithm for the construction of a discrete Reeb graph with a minimal number of nodes, which correspond to the critical points of f (i.e., minima, maxima, and saddle points) and its level sets passing through the saddle points. In this way, we do not need to sample, sweep, or increasingly sort the f-values. Since most of the computation uses only local information on the mesh connectivity, equipped with the f-values at the surface vertices, the proposed approach is insensitive to noise and requires a small-memory footprint and temporary data structures. Furthermore, we maintain the parametric nature of the Reeb graph with respect to the input scalar function and we efficiently extract the Reeb graph of time-varying maps. Indicating with n and s the number of vertices of {\\cal M} and saddle points of f, the overall computational cost O(sn) is competitive with respect to the O(n\\,\\log \\,n) cost of previous work. This cost becomes optimal if {\\cal M} is highly sampled or s\\le \\log n, as it happens for Laplacian eigenfunctions, harmonic maps, and one-forms.",
"title": "A Minimal Contouring Approach to the Computation of the Reeb Graph",
"normalizedTitle": "A Minimal Contouring Approach to the Computation of the Reeb Graph",
"fno": "ttg2009040583",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Reeb Graph",
"Topological Graph",
"Morse Theory",
"Computational Topology",
"Geometric Algorithms",
"Hierarchical Segmentations",
"Shape Analysis And Abstraction"
],
"authors": [
{
"givenName": "Giuseppe",
"surname": "Patanè",
"fullName": "Giuseppe Patanè",
"affiliation": "Istituto di Matematica Applicata e Tecnologie Inormatiche, Consiglio Nazionale delle Ricerche, Genova",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michela",
"surname": "Spagnuolo",
"fullName": "Michela Spagnuolo",
"affiliation": "Istituto di Matematica Applicata e Tecnologie Inormatiche, Consiglio Nazionale delle Ricerche, Genova",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bianca",
"surname": "Falcidieno",
"fullName": "Bianca Falcidieno",
"affiliation": "Istituto di Matematica Applicata e Tecnologie Inormatiche, Consiglio Nazionale delle Ricerche, Genova",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2009-07-01 00:00:00",
"pubType": "trans",
"pages": "583-595",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/smi/2008/2260/0/04547953",
"title": "Reeb graph computation based on a minimal contouring",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2008/04547953/12OmNAJ4pi5",
"parentPublication": {
"id": "proceedings/smi/2008/2260/0",
"title": "IEEE International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2003/1991/0/19910378",
"title": "A Discrete Reeb Graph Approach for the Segmentation of Human Body Scans",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2003/19910378/12OmNC2xhF1",
"parentPublication": {
"id": "proceedings/3dim/2003/1991/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2012/4814/0/4814a178",
"title": "Three Dimensional Sketch for a Landscape Using Morse Theory and Reeb Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2012/4814a178/12OmNwE9Oqe",
"parentPublication": {
"id": "proceedings/cw/2012/4814/0",
"title": "2012 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2006/2671/0/26710093",
"title": "An Enhancement of Reeb Graph for Modeling Hydrogeological Information",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2006/26710093/12OmNyz5JRt",
"parentPublication": {
"id": "proceedings/cw/2006/2671/0",
"title": "2006 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101650",
"title": "Interactive Quadrangulation with Reeb Atlases and Connectivity Textures",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101650/13rRUILc8fa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/01/ttg2012010146",
"title": "Output-Sensitive Construction of Reeb Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2012/01/ttg2012010146/13rRUwvBy8S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539583",
"title": "Jacobi Fiber Surfaces for Bivariate Reeb Space Computation",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539583/13rRUx0xPif",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1983/04/01703083",
"title": "Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation",
"doi": null,
"abstractUrl": "/journal/ts/1983/04/01703083/13rRUxASuHV",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020249",
"title": "Computing Reeb Graphs as a Union of Contour Trees",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020249/13rRUxDqS8h",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061177",
"title": "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061177/13rRUyY28Yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009040572",
"articleId": "13rRUxNmPDN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009040596",
"articleId": "13rRUNvgziy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBOUxmQ",
"title": "November/December",
"year": "2008",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "14",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZ0o1p",
"doi": "10.1109/TVCG.2008.160",
"abstract": "Recent results have shown a link between geometric properties of isosurfaces and statistical properties of the underlying sampled data. However, this has two defects: not all of the properties described converge to the same solution, and the statistics computed are not always invariant under isosurface-preserving transformations. We apply Federerâ™s Coarea Formula from geometric measure theory to explain these discrepancies. We describe an improved substitute for histograms based on weighting with the inverse gradient magnitude, develop a statistical model that is invariant under isosurface-preserving transformations, and argue that this provides a consistent method for algorithm evaluation across multiple datasets based on histogram equalization. We use our corrected formulation to reevaluate recent results on average isosurface complexity, and show evidence that noise is one cause of the discrepancy between the expected figure and the observed one.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent results have shown a link between geometric properties of isosurfaces and statistical properties of the underlying sampled data. However, this has two defects: not all of the properties described converge to the same solution, and the statistics computed are not always invariant under isosurface-preserving transformations. We apply Federerâ™s Coarea Formula from geometric measure theory to explain these discrepancies. We describe an improved substitute for histograms based on weighting with the inverse gradient magnitude, develop a statistical model that is invariant under isosurface-preserving transformations, and argue that this provides a consistent method for algorithm evaluation across multiple datasets based on histogram equalization. We use our corrected formulation to reevaluate recent results on average isosurface complexity, and show evidence that noise is one cause of the discrepancy between the expected figure and the observed one.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent results have shown a link between geometric properties of isosurfaces and statistical properties of the underlying sampled data. However, this has two defects: not all of the properties described converge to the same solution, and the statistics computed are not always invariant under isosurface-preserving transformations. We apply Federerâ™s Coarea Formula from geometric measure theory to explain these discrepancies. We describe an improved substitute for histograms based on weighting with the inverse gradient magnitude, develop a statistical model that is invariant under isosurface-preserving transformations, and argue that this provides a consistent method for algorithm evaluation across multiple datasets based on histogram equalization. We use our corrected formulation to reevaluate recent results on average isosurface complexity, and show evidence that noise is one cause of the discrepancy between the expected figure and the observed one.",
"title": "Revisiting Histograms and Isosurface Statistics",
"normalizedTitle": "Revisiting Histograms and Isosurface Statistics",
"fno": "ttg2008061659",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Statistical Analysis",
"Isosurface Statistics",
"Federer Coarea Formula",
"Statistical Model",
"Isosurface Preserving Transformations",
"Histogram Equalization",
"Histograms",
"Isosurfaces",
"Data Visualization",
"Higher Order Statistics",
"Convergence",
"Noise Figure",
"Kernel",
"Humans",
"Brightness",
"Frequency",
"Index Terms 8212",
"Isosurfaces",
"Histograms",
"Coarea Formula"
],
"authors": [
{
"givenName": "Carlos E.",
"surname": "Scheidegger",
"fullName": "Carlos E. Scheidegger",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "John M.",
"surname": "Schreiner",
"fullName": "John M. Schreiner",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brian",
"surname": "Duffy",
"fullName": "Brian Duffy",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hamish",
"surname": "Carr",
"fullName": "Hamish Carr",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cláudio T.",
"surname": "Silva",
"fullName": "Cláudio T. Silva",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2008-11-01 00:00:00",
"pubType": "trans",
"pages": "1659-1666",
"year": "2008",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/acssc/1993/4120/0/00342551",
"title": "Texture segmentation by change detection in second and higher order statistics",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1993/00342551/12OmNAle6wl",
"parentPublication": {
"id": "proceedings/acssc/1993/4120/0",
"title": "Proceedings of 27th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/2000/6478/0/00885720",
"title": "Bicubic subdivision-surface wavelets for large-scale isosurface representation and visualization",
"doi": null,
"abstractUrl": "/proceedings-article/visual/2000/00885720/12OmNApcuBx",
"parentPublication": {
"id": "proceedings/visual/2000/6478/0",
"title": "Proceedings Visualization 2000. VIS 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/01/v0114",
"title": "Ray-Tracing Polymorphic Multidomain Spectral/hp Elements for Isosurface Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2006/01/v0114/13rRUIM2VBx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020263",
"title": "Integrating Isosurface Statistics and Histograms",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020263/13rRUwkfAZg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1283",
"title": "Isosurface Extraction and Spatial Filtering using Persistent Octree (POT)",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1283/13rRUxC0SvM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1267",
"title": "Interactive Point-based Isosurface Exploration and High-quality Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1267/13rRUxjQyhm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/05928335",
"title": "Topology Verification for Isosurface Extraction",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/05928335/13rRUxlgxOi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/05/ttg2012050753",
"title": "Direct Isosurface Visualization of Hex-Based High-Order Geometry and Attribute Representations",
"doi": null,
"abstractUrl": "/journal/tg/2012/05/ttg2012050753/13rRUxly8XF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1259",
"title": "On Histograms and Isosurface Statistics",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1259/13rRUzp02of",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2018/5321/0/08499459",
"title": "Image Deeper Passive Forgery Detection Based on SIFT and Higher-Order Statistics Features",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2018/08499459/17D45WnnFW1",
"parentPublication": {
"id": "proceedings/bigmm/2018/5321/0",
"title": "2018 IEEE Fourth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2008061651",
"articleId": "13rRUxly8XA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2008061667",
"articleId": "13rRUwh80H7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFiM",
"title": "January/February",
"year": "2009",
"issueNum": "01",
"idPrefix": "dt",
"pubType": "magazine",
"volume": "26",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInv0k",
"doi": "10.1109/MDT.2009.1",
"abstract": "This article presents a CMOS resizing methodology for analog circuits during a technology migration, with easy-to-apply scaling rules based on a simple MOS transistor model. The goals are to transpose a circuit topology from one technology to another while preserving the main figures of merit and to quickly calculate the new transistor dimensions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article presents a CMOS resizing methodology for analog circuits during a technology migration, with easy-to-apply scaling rules based on a simple MOS transistor model. The goals are to transpose a circuit topology from one technology to another while preserving the main figures of merit and to quickly calculate the new transistor dimensions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article presents a CMOS resizing methodology for analog circuits during a technology migration, with easy-to-apply scaling rules based on a simple MOS transistor model. The goals are to transpose a circuit topology from one technology to another while preserving the main figures of merit and to quickly calculate the new transistor dimensions.",
"title": "A CMOS Resizing Methodology for Analog Circuits",
"normalizedTitle": "A CMOS Resizing Methodology for Analog Circuits",
"fno": "mdt2009010078",
"hasPdf": true,
"idPrefix": "dt",
"keywords": [
"Analog Design",
"Design Reuse",
"MOS Technology",
"Resizing Methodology",
"Technology Migration"
],
"authors": [
{
"givenName": "Timothée",
"surname": "Levi",
"fullName": "Timothée Levi",
"affiliation": "LIMMS, University of Tokyo",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean",
"surname": "Tomas",
"fullName": "Jean Tomas",
"affiliation": "Bordeaux University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Noëlle",
"surname": "Lewis",
"fullName": "Noëlle Lewis",
"affiliation": "Bordeaux University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Pascal",
"surname": "Fouillat",
"fullName": "Pascal Fouillat",
"affiliation": "Ecole Nationale Supérieure d'Electronique de Bordeaux",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2009-01-01 00:00:00",
"pubType": "mags",
"pages": "78-87",
"year": "2009",
"issn": "0740-7475",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccad/1993/4490/0/00580077",
"title": "A flexible statistical model for CAD of submicrometer analog CMOS integrated circuits",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/1993/00580077/12OmNB8TUgR",
"parentPublication": {
"id": "proceedings/iccad/1993/4490/0",
"title": "Proceedings of 1993 International Conference on Computer Aided Design (ICCAD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1986/0702/0/01586096",
"title": "Transistor-Level Test Generation for Physical Failures in CMOS Circuits",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1986/01586096/12OmNBUS77w",
"parentPublication": {
"id": "proceedings/dac/1986/0702/0",
"title": "23rd ACM/IEEE Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1982/020/0/01585530",
"title": "A Fault Simulator for MOS LSI Circuits",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1982/01585530/12OmNrJiCTN",
"parentPublication": {
"id": "proceedings/dac/1982/020/0",
"title": "19th Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbcci/2005/174/0/04286817",
"title": "A Design Methodology for Analogue CMOS Circuits",
"doi": null,
"abstractUrl": "/proceedings-article/sbcci/2005/04286817/12OmNrYCXVb",
"parentPublication": {
"id": "proceedings/sbcci/2005/174/0",
"title": "SBCCI 2005. 18th Symposium on Integrated Circuits and Systems Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1985/0635/0/01586036",
"title": "Algorithms for Automatic Transistor Sizing in CMOS Digital Circuits",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1985/01586036/12OmNwNOaP4",
"parentPublication": {
"id": "proceedings/dac/1985/0635/0",
"title": "22nd ACM/IEEE Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2017/3038/0/08204048",
"title": "Optimization of CMOS analog circuits using sine cosine algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2017/08204048/12OmNwtEENL",
"parentPublication": {
"id": "proceedings/icccnt/2017/3038/0",
"title": "2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbcci/2000/0843/0/08430089",
"title": "Resizing Rules for the Reuse of MOS Analog Designs",
"doi": null,
"abstractUrl": "/proceedings-article/sbcci/2000/08430089/12OmNyUWQSh",
"parentPublication": {
"id": "proceedings/sbcci/2000/0843/0",
"title": "Integrated Circuit Design and System Design, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1983/0026/0/01585627",
"title": "Test Generation for MOS Circuits Using D-Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1983/01585627/12OmNzICEOD",
"parentPublication": {
"id": "proceedings/dac/1983/0026/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/arvlsid/1999/0056/0/00560170",
"title": "Low Power Gate Resizing of Combinational Circuits by Buffer-Redistribution",
"doi": null,
"abstractUrl": "/proceedings-article/arvlsid/1999/00560170/12OmNzvz6Ct",
"parentPublication": {
"id": "proceedings/arvlsid/1999/0056/0",
"title": "Advanced Research in VLSI, Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1985/05/01676582",
"title": "Modeling and Test Generation Algorithms for MOS Circuits",
"doi": null,
"abstractUrl": "/journal/tc/1985/05/01676582/13rRUx0xPSL",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mdt2009010068",
"articleId": "13rRUxDItcT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mdt2009010098",
"articleId": "13rRUwI5UbY",
"__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": "13rRUwvT9gs",
"doi": "10.1109/TVCG.2013.170",
"abstract": "In controlled experiments on the relation of display size (i.e., the number of pixels) and the usability of visualizations, the size of the information space can either be kept constant or varied relative to display size. Both experimental approaches have limitations. If the information space is kept constant then the scale ratio between an overview of the entire information space and the lowest zoom level varies, which can impact performance; if the information space is varied then the scale ratio is kept constant, but performance cannot be directly compared. In other words, display size, information space, and scale ratio are interrelated variables. We investigate this relation in two experiments with interfaces that implement classic information visualization techniques-focus+context, overview+detail, and zooming-for multi-scale navigation in maps. Display size varied between 0.17, 1.5, and 13.8 megapixels. Information space varied relative to display size in one experiment and was constant in the other. Results suggest that for tasks where users navigate targets that are visible at all map scales the interfaces do not benefit from a large display: With a constant map size, a larger display does not improve performance with the interfaces; with map size varied relative to display size, participants found interfaces harder to use with a larger display and task completion times decrease only when they are normalized to compensate for the increase in map size. The two experimental approaches show different interaction effects between display size and interface. In particular, focus+context performs relatively worse at a large display size with variable map size, and relatively worse at a small display size with a fixed map size. Based on a theoretical analysis of the interaction with the visualization techniques, we examine individual task actions empirically so as to understand the relative impact of display size and scale ratio on the visualization techniques' performance and to discuss differences between the two experimental approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In controlled experiments on the relation of display size (i.e., the number of pixels) and the usability of visualizations, the size of the information space can either be kept constant or varied relative to display size. Both experimental approaches have limitations. If the information space is kept constant then the scale ratio between an overview of the entire information space and the lowest zoom level varies, which can impact performance; if the information space is varied then the scale ratio is kept constant, but performance cannot be directly compared. In other words, display size, information space, and scale ratio are interrelated variables. We investigate this relation in two experiments with interfaces that implement classic information visualization techniques-focus+context, overview+detail, and zooming-for multi-scale navigation in maps. Display size varied between 0.17, 1.5, and 13.8 megapixels. Information space varied relative to display size in one experiment and was constant in the other. Results suggest that for tasks where users navigate targets that are visible at all map scales the interfaces do not benefit from a large display: With a constant map size, a larger display does not improve performance with the interfaces; with map size varied relative to display size, participants found interfaces harder to use with a larger display and task completion times decrease only when they are normalized to compensate for the increase in map size. The two experimental approaches show different interaction effects between display size and interface. In particular, focus+context performs relatively worse at a large display size with variable map size, and relatively worse at a small display size with a fixed map size. Based on a theoretical analysis of the interaction with the visualization techniques, we examine individual task actions empirically so as to understand the relative impact of display size and scale ratio on the visualization techniques' performance and to discuss differences between the two experimental approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In controlled experiments on the relation of display size (i.e., the number of pixels) and the usability of visualizations, the size of the information space can either be kept constant or varied relative to display size. Both experimental approaches have limitations. If the information space is kept constant then the scale ratio between an overview of the entire information space and the lowest zoom level varies, which can impact performance; if the information space is varied then the scale ratio is kept constant, but performance cannot be directly compared. In other words, display size, information space, and scale ratio are interrelated variables. We investigate this relation in two experiments with interfaces that implement classic information visualization techniques-focus+context, overview+detail, and zooming-for multi-scale navigation in maps. Display size varied between 0.17, 1.5, and 13.8 megapixels. Information space varied relative to display size in one experiment and was constant in the other. Results suggest that for tasks where users navigate targets that are visible at all map scales the interfaces do not benefit from a large display: With a constant map size, a larger display does not improve performance with the interfaces; with map size varied relative to display size, participants found interfaces harder to use with a larger display and task completion times decrease only when they are normalized to compensate for the increase in map size. The two experimental approaches show different interaction effects between display size and interface. In particular, focus+context performs relatively worse at a large display size with variable map size, and relatively worse at a small display size with a fixed map size. Based on a theoretical analysis of the interaction with the visualization techniques, we examine individual task actions empirically so as to understand the relative impact of display size and scale ratio on the visualization techniques' performance and to discuss differences between the two experimental approaches.",
"title": "Interactive Visualizations on Large and Small Displays: The Interrelation of Display Size, Information Space, and Scale",
"normalizedTitle": "Interactive Visualizations on Large and Small Displays: The Interrelation of Display Size, Information Space, and Scale",
"fno": "ttg2013122336",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Navigation",
"Interactive Systems",
"Data Visualization",
"Monitoring",
"Aerospace Electronics",
"Experimental Method",
"Navigation",
"Interactive Systems",
"Data Visualization",
"Monitoring",
"Aerospace Electronics",
"User Studies",
"Information Visualization",
"Multi Scale Navigation",
"Interaction Techniques"
],
"authors": [
{
"givenName": "Mikkel R.",
"surname": "Jakobsen",
"fullName": "Mikkel R. Jakobsen",
"affiliation": "Univ. of Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kasper",
"surname": "Hornbaek",
"fullName": "Kasper Hornbaek",
"affiliation": "Univ. of Copenhagen, Copenhagen, Denmark",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2013-12-01 00:00:00",
"pubType": "trans",
"pages": "2336-2345",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/prdc/2014/6474/0/6474a021",
"title": "A Software-Implemented Fault-Tolerance Approach for Control and Display Systems in Avionics",
"doi": null,
"abstractUrl": "/proceedings-article/prdc/2014/6474a021/12OmNAoUT8h",
"parentPublication": {
"id": "proceedings/prdc/2014/6474/0",
"title": "2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing (PRDC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2015/7660/0/7660a186",
"title": "[POSTER] Maintaining Appropriate Interpersonal Distance Using Virtual Body Size",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2015/7660a186/12OmNxveNLZ",
"parentPublication": {
"id": "proceedings/ismar/2015/7660/0",
"title": "2015 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2014/2871/0/06802063",
"title": "Automated calibration of display characteristics (ACDC) for head-mounted displays and arbitrary surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802063/12OmNxwENpf",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2014/3624/0/06798873",
"title": "Poster: Understanding of spatial gestural motor space: A study on cursorless absolute freehand pointing on large displays",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2014/06798873/12OmNzIUfL4",
"parentPublication": {
"id": "proceedings/3dui/2014/3624/0",
"title": "2014 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vast/2016/5661/0/07883506",
"title": "Supporting visual exploration for multiple users in large display environments",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2016/07883506/12OmNzJbQTg",
"parentPublication": {
"id": "proceedings/vast/2016/5661/0",
"title": "2016 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1982/05/01702980",
"title": "Display Condensation of Program Text",
"doi": null,
"abstractUrl": "/journal/ts/1982/05/01702980/13rRUwh80Is",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdva/2018/9194/0/08534027",
"title": "Visual Analytics on Large Displays: Exploring User Spatialization and How Size and Resolution Affect Task Performance",
"doi": null,
"abstractUrl": "/proceedings-article/bdva/2018/08534027/17D45XvMcbt",
"parentPublication": {
"id": "proceedings/bdva/2018/9194/0",
"title": "2018 International Symposium on Big Data Visual and Immersive Analytics (BDVA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cecit/2021/3757/0/375700a186",
"title": "An Adaptive step size Stokes Space method for polarization demultiplexing",
"doi": null,
"abstractUrl": "/proceedings-article/cecit/2021/375700a186/1CdELejFlYY",
"parentPublication": {
"id": "proceedings/cecit/2021/3757/0",
"title": "2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798340",
"title": "Augmented Reality Map Navigation with Freehand Gestures",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798340/1cJ1fg0gjAY",
"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/pacificvis/2019/9226/0/922600a011",
"title": "Collaborative Visual Analysis with Multi-level Information Sharing Using a Wall-Size Display and See-Through HMDs",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2019/922600a011/1cMF7IJ33Lq",
"parentPublication": {
"id": "proceedings/pacificvis/2019/9226/0",
"title": "2019 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013122326",
"articleId": "13rRUyuNswX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013122346",
"articleId": "13rRUyYSWsX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgzA",
"name": "ttg2013122336s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013122336s.mov",
"extension": "mov",
"size": "16.7 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": "13rRUwvT9hn",
"doi": "10.1109/TPAMI.2010.56",
"abstract": "This work presents a new method for tracking and segmenting along time-interacting objects within an image sequence. One major contribution of the paper is the formalization of the notion of visible and occluded parts. For each object, we aim at tracking these two parts. Assuming that the velocity of each object is driven by a dynamical law, predictions can be used to guide the successive estimations. Separating these predicted areas into good and bad parts with respect to the final segmentation and representing the objects with their visible and occluded parts permit handling partial and complete occlusions. To achieve this tracking, a label is assigned to each object and an energy function representing the multilabel problem is minimized via a graph cuts optimization. This energy contains terms based on image intensities which enable segmenting and regularizing the visible parts of the objects. It also includes terms dedicated to the management of the occluded and disappearing areas, which are defined on the areas of prediction of the objects. The results on several challenging sequences prove the strength of the proposed approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This work presents a new method for tracking and segmenting along time-interacting objects within an image sequence. One major contribution of the paper is the formalization of the notion of visible and occluded parts. For each object, we aim at tracking these two parts. Assuming that the velocity of each object is driven by a dynamical law, predictions can be used to guide the successive estimations. Separating these predicted areas into good and bad parts with respect to the final segmentation and representing the objects with their visible and occluded parts permit handling partial and complete occlusions. To achieve this tracking, a label is assigned to each object and an energy function representing the multilabel problem is minimized via a graph cuts optimization. This energy contains terms based on image intensities which enable segmenting and regularizing the visible parts of the objects. It also includes terms dedicated to the management of the occluded and disappearing areas, which are defined on the areas of prediction of the objects. The results on several challenging sequences prove the strength of the proposed approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This work presents a new method for tracking and segmenting along time-interacting objects within an image sequence. One major contribution of the paper is the formalization of the notion of visible and occluded parts. For each object, we aim at tracking these two parts. Assuming that the velocity of each object is driven by a dynamical law, predictions can be used to guide the successive estimations. Separating these predicted areas into good and bad parts with respect to the final segmentation and representing the objects with their visible and occluded parts permit handling partial and complete occlusions. To achieve this tracking, a label is assigned to each object and an energy function representing the multilabel problem is minimized via a graph cuts optimization. This energy contains terms based on image intensities which enable segmenting and regularizing the visible parts of the objects. It also includes terms dedicated to the management of the occluded and disappearing areas, which are defined on the areas of prediction of the objects. The results on several challenging sequences prove the strength of the proposed approach.",
"title": "Tracking with Occlusions via Graph Cuts",
"normalizedTitle": "Tracking with Occlusions via Graph Cuts",
"fno": "ttp2011010144",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Tracking",
"Interacting Objects",
"Occlusions",
"Graph Cuts Optimization"
],
"authors": [
{
"givenName": "Nicolas",
"surname": "Papadakis",
"fullName": "Nicolas Papadakis",
"affiliation": "Image Group, Barcelona Media, Barcelona",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Aurélie",
"surname": "Bugeau",
"fullName": "Aurélie Bugeau",
"affiliation": "Image Group, Barcelona Media, Barcelona",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2011-01-01 00:00:00",
"pubType": "trans",
"pages": "144-157",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2005/2372/2/237220010",
"title": "Illumination-Invariant Tracking via Graph Cuts",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2005/237220010/12OmNA0MZ00",
"parentPublication": {
"id": "proceedings/cvpr/2005/2372/2",
"title": "2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04409032",
"title": "Synthetic Aperture Tracking: Tracking through Occlusions",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04409032/12OmNqHItMM",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a202",
"title": "Scale Adaptation of Mean Shift Based on Graph Cuts Theory",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a202/12OmNqzu6IM",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2007/3122/0/3122a631",
"title": "Graph Cuts Segmentation with Statistical Shape Priors for Medical Images",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2007/3122a631/12OmNvjgWt8",
"parentPublication": {
"id": "proceedings/sitis/2007/3122/0",
"title": "2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995589",
"title": "Submodularity beyond submodular energies: Coupling edges in graph cuts",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995589/12OmNxWLTr7",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2010/4271/0/4271a369",
"title": "Accurate Silhouettes for Surveillance - Improved Motion Segmentation Using Graph Cuts",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2010/4271a369/12OmNzWx03T",
"parentPublication": {
"id": "proceedings/dicta/2010/4271/0",
"title": "2010 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2002/08/i1127",
"title": "Detecting Binocular Half-Occlusions: Empirical Comparisons of Five Approaches",
"doi": null,
"abstractUrl": "/journal/tp/2002/08/i1127/13rRUwwJWGM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020306",
"title": "Reconstructing Open Surfaces via Graph-Cuts",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020306/13rRUy0qnGk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000g144",
"title": "SeGAN: Segmenting and Generating the Invisible",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000g144/17D45X0yjRh",
"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": "ttp2011010129",
"articleId": "13rRUwhHcRY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2011010158",
"articleId": "13rRUwInvgm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXFgzG",
"name": "ttp2011010144s.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp2011010144s.pdf",
"extension": "pdf",
"size": "554 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNApLGHm",
"title": "May-June",
"year": "2012",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "32",
"label": "May-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy0ZzSd",
"doi": "10.1109/MCG.2010.99",
"abstract": "Nonrigid deformation is a fundamental feature in face recognition. A proposed method extracts nonrigid deformation by finding the mapping between two shapes. To improve registration accuracy, it integrates geometric shape decomposition and nonrigid point-set registration. On the basis of manifold harmonics, the method first decomposes shapes into low-frequency and high-frequency parts. Then, it applies the modified registration algorithm to obtain deformation parameters. An extensive set of experiments evaluated the method's performance on the FRGC (Face Recognition Grand Challenge) v2 database. The method achieved not only higher accuracy for fitting but also 98.2 percent identification and 97.4 percent verification at a 0.001 false-acceptance rate.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Nonrigid deformation is a fundamental feature in face recognition. A proposed method extracts nonrigid deformation by finding the mapping between two shapes. To improve registration accuracy, it integrates geometric shape decomposition and nonrigid point-set registration. On the basis of manifold harmonics, the method first decomposes shapes into low-frequency and high-frequency parts. Then, it applies the modified registration algorithm to obtain deformation parameters. An extensive set of experiments evaluated the method's performance on the FRGC (Face Recognition Grand Challenge) v2 database. The method achieved not only higher accuracy for fitting but also 98.2 percent identification and 97.4 percent verification at a 0.001 false-acceptance rate.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Nonrigid deformation is a fundamental feature in face recognition. A proposed method extracts nonrigid deformation by finding the mapping between two shapes. To improve registration accuracy, it integrates geometric shape decomposition and nonrigid point-set registration. On the basis of manifold harmonics, the method first decomposes shapes into low-frequency and high-frequency parts. Then, it applies the modified registration algorithm to obtain deformation parameters. An extensive set of experiments evaluated the method's performance on the FRGC (Face Recognition Grand Challenge) v2 database. The method achieved not only higher accuracy for fitting but also 98.2 percent identification and 97.4 percent verification at a 0.001 false-acceptance rate.",
"title": "Nonrigid-Deformation Recovery for 3D Face Recognition Using Multiscale Registration",
"normalizedTitle": "Nonrigid-Deformation Recovery for 3D Face Recognition Using Multiscale Registration",
"fno": "mcg2012030037",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Deformation",
"Three Dimensional Displays",
"Manifolds",
"Face Recognition",
"Image Registration",
"Harmonic Analysis",
"Deformable Models",
"Graphics And Multimedia",
"3 D Face Recognition",
"Deformable Models",
"Nonrigid Registration",
"Multiscale Registration",
"Computer Graphics"
],
"authors": [
{
"givenName": "Liang",
"surname": "Cai",
"fullName": "Liang Cai",
"affiliation": "Southeast University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feipeng",
"surname": "Da",
"fullName": "Feipeng Da",
"affiliation": "Southeast University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2012-05-01 00:00:00",
"pubType": "mags",
"pages": "37-45",
"year": "2012",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2010/4109/0/4109a185",
"title": "Estimating Nonrigid Shape Deformation Using Moments",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a185/12OmNBbaH9p",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1994/6405/2/00471676",
"title": "Search by shape examples: modeling nonrigid deformation",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1994/00471676/12OmNqBKUeg",
"parentPublication": {
"id": "proceedings/acssc/1994/6405/1",
"title": "Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2007/2794/0/27940038",
"title": "3D Finite Element Modeling of Nonrigid Breast Deformation for Feature Registration in -ray and MR Images",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2007/27940038/12OmNqIhFRt",
"parentPublication": {
"id": "proceedings/wacv/2007/2794/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2010/3987/2/3987b082",
"title": "A Nonrigid Image Registration Approach Based on Cooperative Game Among Pixels",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2010/3987b082/12OmNvSKO2Z",
"parentPublication": {
"id": "proceedings/etcs/2010/3987/2",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206854",
"title": "Shape evolution for rigid and nonrigid shape registration and recovery",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206854/12OmNwx3Qag",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457684",
"title": "Fast nonrigid mesh registration with a data-driven deformation prior",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457684/12OmNz2C1mA",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/08/i1481",
"title": "Surface Deformation Models for Nonrigid 3D Shape Recovery",
"doi": null,
"abstractUrl": "/journal/tp/2007/08/i1481/13rRUILLkEM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__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": "trans/tg/2012/08/06060815",
"title": "Robust Dense Registration of Partial Nonrigid Shapes",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06060815/13rRUxASu0I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/02/ttg2013020331",
"title": "D-Snake: Image Registration by As-Similar-As-Possible Template Deformation",
"doi": null,
"abstractUrl": "/journal/tg/2013/02/ttg2013020331/13rRUytF41x",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2012030024",
"articleId": "13rRUwbs25n",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2012030046",
"articleId": "13rRUwvT9iH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAXPyf6",
"title": "July",
"year": "1992",
"issueNum": "07",
"idPrefix": "ts",
"pubType": "journal",
"volume": "18",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly979",
"doi": "10.1109/32.148480",
"abstract": "The probability density estimation of the number of software failures in the event of clustering or clumping of the software failures is considered. A discrete compound Poisson (CP) prediction model is proposed for the random variable X/sub rem/, which is the remaining number of software failures. The compounding distributions, which are assumed to govern the failure sizes at Poisson arrivals, are respectively taken to be geometric when failures are forgetful and logarithmic-series when failures are contagious. The expected value ( mu ) of X/sub rem/ is calculated as a function of the time-dependent Poisson and compounding distribution based on the failures experienced. Also, the variance/mean parameter for the remaining number of failures, q/sub rem/, is best estimated by q/sub past/ from the failures already experienced. Then, one obtains the PDF of the remaining number of failures estimated by CP( mu ,q). CP is found to be superior to Poisson where clumping of failures exists. Its predictive validity is comparable to the Musa-Okumoto log-Poisson model in certain cases.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The probability density estimation of the number of software failures in the event of clustering or clumping of the software failures is considered. A discrete compound Poisson (CP) prediction model is proposed for the random variable X/sub rem/, which is the remaining number of software failures. The compounding distributions, which are assumed to govern the failure sizes at Poisson arrivals, are respectively taken to be geometric when failures are forgetful and logarithmic-series when failures are contagious. The expected value ( mu ) of X/sub rem/ is calculated as a function of the time-dependent Poisson and compounding distribution based on the failures experienced. Also, the variance/mean parameter for the remaining number of failures, q/sub rem/, is best estimated by q/sub past/ from the failures already experienced. Then, one obtains the PDF of the remaining number of failures estimated by CP( mu ,q). CP is found to be superior to Poisson where clumping of failures exists. Its predictive validity is comparable to the Musa-Okumoto log-Poisson model in certain cases.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The probability density estimation of the number of software failures in the event of clustering or clumping of the software failures is considered. A discrete compound Poisson (CP) prediction model is proposed for the random variable X/sub rem/, which is the remaining number of software failures. The compounding distributions, which are assumed to govern the failure sizes at Poisson arrivals, are respectively taken to be geometric when failures are forgetful and logarithmic-series when failures are contagious. The expected value ( mu ) of X/sub rem/ is calculated as a function of the time-dependent Poisson and compounding distribution based on the failures experienced. Also, the variance/mean parameter for the remaining number of failures, q/sub rem/, is best estimated by q/sub past/ from the failures already experienced. Then, one obtains the PDF of the remaining number of failures estimated by CP( mu ,q). CP is found to be superior to Poisson where clumping of failures exists. Its predictive validity is comparable to the Musa-Okumoto log-Poisson model in certain cases.",
"title": "Compound-Poisson Software Reliability Model",
"normalizedTitle": "Compound-Poisson Software Reliability Model",
"fno": "e0624",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Compound Poisson Software Reliability Model Discrete Compound Poisson Prediction Model Probability Density Estimation Software Failures Clustering Clumping Random Variable Poisson Arrivals Predictive Validity Musa Okumoto Log Poisson Model Software Reliability"
],
"authors": [
{
"givenName": "M.",
"surname": "Sahinoglu",
"fullName": "M. Sahinoglu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "1992-07-01 00:00:00",
"pubType": "trans",
"pages": "624-630",
"year": "1992",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "e0613",
"articleId": "13rRUNvgyY1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "e0631",
"articleId": "13rRUxC0Sxq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvEQsdH",
"title": "April-June",
"year": "2003",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWkT",
"doi": "10.1109/TVCG.2003.10003",
"abstract": "Abstract—We introduce a network visualization technique that supports an analytical method applied in the social sciences. Policy network analysis is an approach to study policy making structures, processes, and outcomes, thereby concentrating on relations between policy actors. An important operational concept for the analysis of policy networks is the notion of centrality, i.e., the distinction of actors according to their importance in a relational structure. We integrate this measure in a layout model for networks by mapping structural to geometric centrality. Thus, centrality values and network data can be presented simultaneously and explored interactively.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—We introduce a network visualization technique that supports an analytical method applied in the social sciences. Policy network analysis is an approach to study policy making structures, processes, and outcomes, thereby concentrating on relations between policy actors. An important operational concept for the analysis of policy networks is the notion of centrality, i.e., the distinction of actors according to their importance in a relational structure. We integrate this measure in a layout model for networks by mapping structural to geometric centrality. Thus, centrality values and network data can be presented simultaneously and explored interactively.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—We introduce a network visualization technique that supports an analytical method applied in the social sciences. Policy network analysis is an approach to study policy making structures, processes, and outcomes, thereby concentrating on relations between policy actors. An important operational concept for the analysis of policy networks is the notion of centrality, i.e., the distinction of actors according to their importance in a relational structure. We integrate this measure in a layout model for networks by mapping structural to geometric centrality. Thus, centrality values and network data can be presented simultaneously and explored interactively.",
"title": "Communicating Centrality in Policy Network Drawings",
"normalizedTitle": "Communicating Centrality in Policy Network Drawings",
"fno": "v0241",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Visualization",
"Graph Drawing",
"Force Directed Placement",
"Social Network Analysis",
"Centrality"
],
"authors": [
{
"givenName": "Ulrik",
"surname": "Brandes",
"fullName": "Ulrik Brandes",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Patrick",
"surname": "Kenis",
"fullName": "Patrick Kenis",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dorothea",
"surname": "Wagner",
"fullName": "Dorothea Wagner",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2003-04-01 00:00:00",
"pubType": "trans",
"pages": "241-253",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0226",
"articleId": "13rRUxd2aYP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0254",
"articleId": "13rRUwh80H0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzXnNEv",
"title": "March",
"year": "2003",
"issueNum": "03",
"idPrefix": "tc",
"pubType": "journal",
"volume": "52",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJcWwb",
"doi": "10.1109/TC.2003.1183942",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Editor's Note",
"normalizedTitle": "Editor's Note",
"fno": "t0257",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [],
"authors": [
{
"givenName": "Viktor K.",
"surname": "Prasanna",
"fullName": "Viktor K. Prasanna",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2003-03-01 00:00:00",
"pubType": "trans",
"pages": "257-259",
"year": "2003",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2009/01/ttg2009010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tg/2009/01/ttg2009010001/13rRUEgs2BP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/04/e0433",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/ts/1999/04/e0433/13rRUIM2VIE",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2010/01/ttb2010010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tb/2010/01/ttb2010010001/13rRUNvyarQ",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2008/01/ttd2008010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2008/01/ttd2008010001/13rRUwInvAC",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2004/03/01264805",
"title": "Editor's note",
"doi": null,
"abstractUrl": "/journal/td/2004/03/01264805/13rRUwbs1S1",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2003/03/h0185",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tm/2003/03/h0185/13rRUx0xPJd",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2007/01/l0001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2007/01/l0001/13rRUxAATg8",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/1983/02/man1983020161",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/magazine/an/1983/02/man1983020161/13rRUxASu5y",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2006/05/l0401",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2006/05/l0401/13rRUyeTVhw",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "t0260",
"articleId": "13rRUy2YLXu",
"__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": "13rRUwh80vJ",
"doi": "10.1109/TPAMI.2011.189",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Editor's Note",
"normalizedTitle": "Editor's Note",
"fno": "ttp2011112129",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [],
"authors": [
{
"givenName": "Ramin",
"surname": "Zabih",
"fullName": "Ramin Zabih",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sing Bing",
"surname": "Kang",
"fullName": "Sing Bing Kang",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiri",
"surname": "Matas",
"fullName": "Jiri Matas",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Max",
"surname": "Welling",
"fullName": "Max Welling",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "11",
"pubDate": "2011-11-01 00:00:00",
"pubType": "trans",
"pages": "2129-2130",
"year": "2011",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/an/1983/02/man1983020142a",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/magazine/an/1983/02/man1983020142a/13rRUB6SpRh",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/05/ttg2011050553",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tg/2011/05/ttg2011050553/13rRUB7a1fM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/02/v0097",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tg/2002/02/v0097/13rRUILc8f7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/2015/06/07331246",
"title": "Editor's note",
"doi": null,
"abstractUrl": "/journal/tq/2015/06/07331246/13rRUwInvu6",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2016/01/07350369",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2016/01/07350369/13rRUxASuuY",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/02/ttg2008020245",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tg/2008/02/ttg2008020245/13rRUxYrbM7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/01/ttg2012010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tg/2012/01/ttg2012010001/13rRUxbTMyO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2012/02/ttp2012020209",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tp/2012/02/ttp2012020209/13rRUxcsYN8",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2012/04/ttd2012040577",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2012/04/ttd2012040577/13rRUxjQybE",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2002/01/t0001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tc/2002/01/t0001/13rRUy0qnFz",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "ttp2011112131",
"articleId": "13rRUxBa5op",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNALlcit",
"title": "April-June",
"year": "1983",
"issueNum": "02",
"idPrefix": "an",
"pubType": "magazine",
"volume": "5",
"label": "April-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjoNBF",
"doi": "10.1109/MAHC.1983.10060",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Editor's Note",
"normalizedTitle": "Editor's Note",
"fno": "man1983020125a",
"hasPdf": true,
"idPrefix": "an",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1983-04-01 00:00:00",
"pubType": "mags",
"pages": "125",
"year": "1983",
"issn": "1058-6180",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tq/2017/06/08103269",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tq/2017/06/08103269/13rRUEgs2Np",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2008/01/ttd2008010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2008/01/ttd2008010001/13rRUwInvAC",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2004/03/01264805",
"title": "Editor's note",
"doi": null,
"abstractUrl": "/journal/td/2004/03/01264805/13rRUwbs1S1",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/1983/02/man1983020175",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/magazine/an/1983/02/man1983020175/13rRUwgQpk3",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/11/ttp2011112129",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tp/2011/11/ttp2011112129/13rRUwh80vJ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2007/01/l0001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2007/01/l0001/13rRUxAATg8",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2006/05/l0401",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2006/05/l0401/13rRUyeTVhw",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2009/08/ttd2009081073",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2009/08/ttd2009081073/13rRUyogGzK",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "man1983020124",
"articleId": "13rRUx0Pqum",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "man1983020125b",
"articleId": "13rRUIJcWfk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyUFfMF",
"title": "January-March",
"year": "2003",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "9",
"label": "January-March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuhn",
"doi": "10.1109/TVCG.2003.5",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Editor's Note",
"normalizedTitle": "Editor's Note",
"fno": "v0002",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "David",
"surname": "Ebert",
"fullName": "David Ebert",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2003-01-01 00:00:00",
"pubType": "trans",
"pages": "2",
"year": "2003",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/td/2008/01/ttd2008010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2008/01/ttd2008010001/13rRUwInvAC",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2004/03/01264805",
"title": "Editor's note",
"doi": null,
"abstractUrl": "/journal/td/2004/03/01264805/13rRUwbs1S1",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/1983/02/man1983020175",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/magazine/an/1983/02/man1983020175/13rRUwgQpk3",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/11/ttp2011112129",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tp/2011/11/ttp2011112129/13rRUwh80vJ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/1983/02/man1983020125a",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/magazine/an/1983/02/man1983020125a/13rRUwjoNBF",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2007/01/l0001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2007/01/l0001/13rRUxAATg8",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2006/05/l0401",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2006/05/l0401/13rRUyeTVhw",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2009/08/ttd2009081073",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2009/08/ttd2009081073/13rRUyogGzK",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v0001",
"articleId": "13rRUytWF9c",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0003",
"articleId": "13rRUyfKIHz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnP",
"title": "August",
"year": "2009",
"issueNum": "08",
"idPrefix": "td",
"pubType": "journal",
"volume": "20",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyogGzK",
"doi": "10.1109/TPDS.2009.106",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Editor's Note",
"normalizedTitle": "Editor's Note",
"fno": "ttd2009081073",
"hasPdf": true,
"idPrefix": "td",
"keywords": [],
"authors": [
{
"givenName": "Laxmi N.",
"surname": "Bhuyan",
"fullName": "Laxmi N. Bhuyan",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "08",
"pubDate": "2009-08-01 00:00:00",
"pubType": "trans",
"pages": "1073-1074",
"year": "2009",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tg/2009/01/ttg2009010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tg/2009/01/ttg2009010001/13rRUEgs2BP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/04/e0433",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/ts/1999/04/e0433/13rRUIM2VIE",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2010/01/ttb2010010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tb/2010/01/ttb2010010001/13rRUNvyarQ",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2008/01/ttd2008010001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2008/01/ttd2008010001/13rRUwInvAC",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2004/03/01264805",
"title": "Editor's note",
"doi": null,
"abstractUrl": "/journal/td/2004/03/01264805/13rRUwbs1S1",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2003/03/h0185",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/tm/2003/03/h0185/13rRUx0xPJd",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2007/01/l0001",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2007/01/l0001/13rRUxAATg8",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/an/1983/02/man1983020161",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/magazine/an/1983/02/man1983020161/13rRUxASu5y",
"parentPublication": {
"id": "mags/an",
"title": "IEEE Annals of the History of Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2006/05/l0401",
"title": "Editor's Note",
"doi": null,
"abstractUrl": "/journal/td/2006/05/l0401/13rRUyeTVhw",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "ttd2009081075",
"articleId": "13rRUy0HYR8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "13rRUILtJAZ",
"doi": "10.1109/TPAMI.2014.23",
"abstract": "The author of the paper \"Visualization of Spatiotemporal Behavior of Discrete Maps via Generation of Recursive Median Elements,\" which appeared in the IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 2, pp. 378-384, Feb. 2010, points out various corrections to equation (15), Table 3, and the first sentence following this table on page 383. The author is grateful to Raghvendra Sharma for finding these typos/errors while understanding the algorithm's description.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The author of the paper \"Visualization of Spatiotemporal Behavior of Discrete Maps via Generation of Recursive Median Elements,\" which appeared in the IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 2, pp. 378-384, Feb. 2010, points out various corrections to equation (15), Table 3, and the first sentence following this table on page 383. The author is grateful to Raghvendra Sharma for finding these typos/errors while understanding the algorithm's description.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The author of the paper \"Visualization of Spatiotemporal Behavior of Discrete Maps via Generation of Recursive Median Elements,\" which appeared in the IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 2, pp. 378-384, Feb. 2010, points out various corrections to equation (15), Table 3, and the first sentence following this table on page 383. The author is grateful to Raghvendra Sharma for finding these typos/errors while understanding the algorithm's description.",
"title": "Erratum to \"Visualization of Spatiotemporal Behavior of Discrete Maps via Generation of Recursive Median Elements\"",
"normalizedTitle": "Erratum to \"Visualization of Spatiotemporal Behavior of Discrete Maps via Generation of Recursive Median Elements\"",
"fno": "ttp2010020378errata",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Animation",
"Data Visualization",
"Geographic Information Systems",
"Geometry",
"Information Systems",
"Interpolation",
"Spatial Resolution",
"Spatiotemporal Phenomena"
],
"authors": [
{
"givenName": "B.S. Daya",
"surname": "Sagar",
"fullName": "B.S. Daya Sagar",
"affiliation": "Systems Science and Informatics Unit, Indian Statistical Institute-Bangalore Centre, Bangalore 560059, India",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2014-03-01 00:00:00",
"pubType": "trans",
"pages": "web-web",
"year": "2014",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "ttp2014030622",
"articleId": "13rRUwI5Uhw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2012101952errata",
"articleId": "13rRUx0gewc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvSbBJO",
"title": "March",
"year": "2013",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyeTVi2",
"doi": "10.1109/TVCG.2012.133",
"abstract": "The most common abstraction used by visualization libraries and applications today is what is known as the visualization pipeline. The visualization pipeline provides a mechanism to encapsulate algorithms and then couple them together in a variety of ways. The visualization pipeline has been in existence for over 20 years, and over this time many variations and improvements have been proposed. This paper provides a literature review of the most prevalent features of visualization pipelines and some of the most recent research directions.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The most common abstraction used by visualization libraries and applications today is what is known as the visualization pipeline. The visualization pipeline provides a mechanism to encapsulate algorithms and then couple them together in a variety of ways. The visualization pipeline has been in existence for over 20 years, and over this time many variations and improvements have been proposed. This paper provides a literature review of the most prevalent features of visualization pipelines and some of the most recent research directions.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The most common abstraction used by visualization libraries and applications today is what is known as the visualization pipeline. The visualization pipeline provides a mechanism to encapsulate algorithms and then couple them together in a variety of ways. The visualization pipeline has been in existence for over 20 years, and over this time many variations and improvements have been proposed. This paper provides a literature review of the most prevalent features of visualization pipelines and some of the most recent research directions.",
"title": "A Survey of Visualization Pipelines",
"normalizedTitle": "A Survey of Visualization Pipelines",
"fno": "ttg2013030367",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Pipelilnes",
"Distributed Control",
"Data Models",
"Rendering Computer Graphics",
"Centralized Control",
"Domain Specific Languages",
"Visualization Pipelines",
"Dataflow Networks",
"Event Driven",
"Push Model",
"Demand Driven",
"Pull Model",
"Central Control",
"Distributed Control",
"Pipeline Executive",
"Out Of Core Streaming",
"Temporal Visualization",
"Pipeline Contracts",
"Prioritized Streaming",
"Query Driven Visualization",
"Parallel Visualization",
"Task Parallelism",
"Pipeline Parallelism",
"Data Parallelism",
"Rendering",
"Hybrid Parallel",
"Provenance",
"Scheduling",
"In Situ Visualization",
"Functional Field Model",
"Map Reduce"
],
"authors": [
{
"givenName": "K.",
"surname": "Moreland",
"fullName": "K. Moreland",
"affiliation": "Sandia Nat. Labs., Albuquerque, NM, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2013-03-01 00:00:00",
"pubType": "trans",
"pages": "367-378",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/mcsi/2016/0973/0/0973a203",
"title": "Graphics Visualization of Specific Dashboards in Transport Technologies",
"doi": null,
"abstractUrl": "/proceedings-article/mcsi/2016/0973a203/12OmNAFnCx6",
"parentPublication": {
"id": "proceedings/mcsi/2016/0973/0",
"title": "2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/00809926",
"title": "\"Whole field modelling\". Effective real-time and post-survey visualization of underwater pipelines",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/00809926/12OmNBOllb5",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2016/3682/0/3682b038",
"title": "Coupling LAMMPS and the vl3 Framework for Co-Visualization of Atomistic Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2016/3682b038/12OmNBa2iCC",
"parentPublication": {
"id": "proceedings/ipdpsw/2016/3682/0",
"title": "2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300054",
"title": "Video visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300054/12OmNqFrGtk",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2014/4677/0/4677a174",
"title": "Real-Time Animated Visualization of Massive Air-Traffic Trajectories",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2014/4677a174/12OmNwF0BTG",
"parentPublication": {
"id": "proceedings/cw/2014/4677/0",
"title": "2014 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2016/3653/0/3653a269",
"title": "Adaptive Performance-Constrained In Situ Visualization of Atmospheric Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2016/3653a269/12OmNz4SOxp",
"parentPublication": {
"id": "proceedings/cluster/2016/3653/0",
"title": "2016 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icppw/2016/2825/0/2825a088",
"title": "On a Pipeline-Based Architecture for Parallel Visualization of Large-Scale Scientific Data",
"doi": null,
"abstractUrl": "/proceedings-article/icppw/2016/2825a088/12OmNzxgHvD",
"parentPublication": {
"id": "proceedings/icppw/2016/2825/0",
"title": "2016 45th International Conference on Parallel Processing Workshops (ICPPW)",
"__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": "mags/ds/2007/01/o1001",
"title": "Distributed Graphics Pipelines on the Grid",
"doi": null,
"abstractUrl": "/magazine/ds/2007/01/o1001/13rRUB6SpW8",
"parentPublication": {
"id": "mags/ds",
"title": "IEEE Distributed Systems Online",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/5555/01/10081451",
"title": "Application of Mathematical Optimization in Data Visualization and Visual Analytics: A Survey",
"doi": null,
"abstractUrl": "/journal/bd/5555/01/10081451/1LR5GZAvPiM",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013030353",
"articleId": "13rRUxBa560",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013030379",
"articleId": "13rRUwI5TQY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04Q",
"title": "Jan.",
"year": "2017",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7yh",
"doi": "10.1109/TVCG.2016.2598827",
"abstract": "We present the results of a comprehensive multi-pass analysis of visualization paper keywords supplied by authors for their papers published in the IEEE Visualization conference series (now called IEEE VIS) between 1990–2015. From this analysis we derived a set of visualization topics that we discuss in the context of the current taxonomy that is used to categorize papers and assign reviewers in the IEEE VIS reviewing process. We point out missing and overemphasized topics in the current taxonomy and start a discussion on the importance of establishing common visualization terminology. Our analysis of research topics in visualization can, thus, serve as a starting point to (a) help create a common vocabulary to improve communication among different visualization sub-groups, (b) facilitate the process of understanding differences and commonalities of the various research sub-fields in visualization, (c) provide an understanding of emerging new research trends, (d) facilitate the crucial step of finding the right reviewers for research submissions, and (e) it can eventually lead to a comprehensive taxonomy of visualization research. One additional tangible outcome of our work is an online query tool (http://keyvis.org/) that allows visualization researchers to easily browse the 3952 keywords used for IEEE VIS papers since 1990 to find related work or make informed keyword choices.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present the results of a comprehensive multi-pass analysis of visualization paper keywords supplied by authors for their papers published in the IEEE Visualization conference series (now called IEEE VIS) between 1990–2015. From this analysis we derived a set of visualization topics that we discuss in the context of the current taxonomy that is used to categorize papers and assign reviewers in the IEEE VIS reviewing process. We point out missing and overemphasized topics in the current taxonomy and start a discussion on the importance of establishing common visualization terminology. Our analysis of research topics in visualization can, thus, serve as a starting point to (a) help create a common vocabulary to improve communication among different visualization sub-groups, (b) facilitate the process of understanding differences and commonalities of the various research sub-fields in visualization, (c) provide an understanding of emerging new research trends, (d) facilitate the crucial step of finding the right reviewers for research submissions, and (e) it can eventually lead to a comprehensive taxonomy of visualization research. One additional tangible outcome of our work is an online query tool (http://keyvis.org/) that allows visualization researchers to easily browse the 3952 keywords used for IEEE VIS papers since 1990 to find related work or make informed keyword choices.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present the results of a comprehensive multi-pass analysis of visualization paper keywords supplied by authors for their papers published in the IEEE Visualization conference series (now called IEEE VIS) between 1990–2015. From this analysis we derived a set of visualization topics that we discuss in the context of the current taxonomy that is used to categorize papers and assign reviewers in the IEEE VIS reviewing process. We point out missing and overemphasized topics in the current taxonomy and start a discussion on the importance of establishing common visualization terminology. Our analysis of research topics in visualization can, thus, serve as a starting point to (a) help create a common vocabulary to improve communication among different visualization sub-groups, (b) facilitate the process of understanding differences and commonalities of the various research sub-fields in visualization, (c) provide an understanding of emerging new research trends, (d) facilitate the crucial step of finding the right reviewers for research submissions, and (e) it can eventually lead to a comprehensive taxonomy of visualization research. One additional tangible outcome of our work is an online query tool (http://keyvis.org/) that allows visualization researchers to easily browse the 3952 keywords used for IEEE VIS papers since 1990 to find related work or make informed keyword choices.",
"title": "Visualization as Seen through its Research Paper Keywords",
"normalizedTitle": "Visualization as Seen through its Research Paper Keywords",
"fno": "07539364",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualization",
"Taxonomy",
"Market Research",
"Visualization",
"Data Models",
"Vocabulary",
"Data Mining",
"Theory",
"Data Analysis",
"Research Themes",
"Research Topics",
"Taxonomy",
"Visualization History"
],
"authors": [
{
"givenName": "Petra",
"surname": "Isenberg",
"fullName": "Petra Isenberg",
"affiliation": "Inria, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tobias",
"surname": "Isenberg",
"fullName": "Tobias Isenberg",
"affiliation": "Inria, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael",
"surname": "Sedlmair",
"fullName": "Michael Sedlmair",
"affiliation": "University of Vienna, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jian",
"surname": "Chen",
"fullName": "Jian Chen",
"affiliation": "University of Maryland, Baltimore County, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Torsten",
"surname": "Möller",
"fullName": "Torsten Möller",
"affiliation": "University of Vienna, Austria",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2017-01-01 00:00:00",
"pubType": "trans",
"pages": "771-780",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2015/6879/0/07156366",
"title": "Text visualization techniques: Taxonomy, visual survey, and community insights",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156366/12OmNqAU6t7",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/03/mcg2017030096",
"title": "Apply or Die: On the Role and Assessment of Application Papers in Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2017/03/mcg2017030096/13rRUwbJCZj",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/07/08356097",
"title": "Bridging Text Visualization and Mining: A Task-Driven Survey",
"doi": null,
"abstractUrl": "/journal/tg/2019/07/08356097/13rRUwbs1SC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06935059",
"title": "Message from the VIS Paper Chairs and Guest Editors",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06935059/13rRUxBa564",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/09/07583708",
"title": "Vispubdata.org: A Metadata Collection About IEEE Visualization (VIS) Publications",
"doi": null,
"abstractUrl": "/journal/tg/2017/09/07583708/13rRUxd2aZ7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903512",
"title": "Thirty-Two Years of IEEE VIS: Authors, Fields of Study and Citations",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903512/1GZol4dym8U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2022/9007/0/900700a104",
"title": "Visualization overview: Using modern text mining techniques to provide insight into visualization research practice",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2022/900700a104/1KaFNxrDmY8",
"parentPublication": {
"id": "proceedings/iv/2022/9007/0",
"title": "2022 26th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a051",
"title": "A Review of Geospatial Content in IEEE Visualization Publications",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a051/1qRO6cuHu00",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09495259",
"title": "AI4VIS: Survey on Artificial Intelligence Approaches for Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09495259/1vyjtdJRfXO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/06/09556143",
"title": "A Didactic Framework for Analyzing Learning Activities to Design InfoVis Courses",
"doi": null,
"abstractUrl": "/magazine/cg/2021/06/09556143/1xlw4o3imcw",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07539321",
"articleId": "13rRUyogGAf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07539353",
"articleId": "13rRUxly8SY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyGtjeS",
"title": "May/June",
"year": "2011",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "31",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUynZ5qh",
"doi": "10.1109/MCG.2011.44",
"abstract": "Visualization PhD students or researchers starting a research project or initiating research on an unfamiliar topic often review the scientific literature about their research topic. This start-up phase involves wading through and reading scores, if not hundreds, of published research papers. Reading these papers and capturing their essential information is a challenge. Furthermore, the difficulty only increases over time as the publications' complexity and quantity increase. However, remembering all the details of what you've read isn't necessary. Several simple guidelines can help students and researchers read—that is, extract the essential, most important information from—visualization research papers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visualization PhD students or researchers starting a research project or initiating research on an unfamiliar topic often review the scientific literature about their research topic. This start-up phase involves wading through and reading scores, if not hundreds, of published research papers. Reading these papers and capturing their essential information is a challenge. Furthermore, the difficulty only increases over time as the publications' complexity and quantity increase. However, remembering all the details of what you've read isn't necessary. Several simple guidelines can help students and researchers read—that is, extract the essential, most important information from—visualization research papers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visualization PhD students or researchers starting a research project or initiating research on an unfamiliar topic often review the scientific literature about their research topic. This start-up phase involves wading through and reading scores, if not hundreds, of published research papers. Reading these papers and capturing their essential information is a challenge. Furthermore, the difficulty only increases over time as the publications' complexity and quantity increase. However, remembering all the details of what you've read isn't necessary. Several simple guidelines can help students and researchers read—that is, extract the essential, most important information from—visualization research papers.",
"title": "How to Read a Visualization Research Paper: Extracting the Essentials",
"normalizedTitle": "How to Read a Visualization Research Paper: Extracting the Essentials",
"fno": "mcg2011030078",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Research Initiatives",
"Data Visualization",
"Writing",
"Professional Communication",
"Spatial Resolution",
"Data Mining",
"Graphics And Multimedia",
"Visualization",
"Literature Review",
"Literature Survey",
"Computer Graphics",
"Concept",
"Implementation"
],
"authors": [
{
"givenName": "Robert S.",
"surname": "Laramee",
"fullName": "Robert S. Laramee",
"affiliation": "Swansea University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2011-05-01 00:00:00",
"pubType": "mags",
"pages": "78-82",
"year": "2011",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdpsw/2014/4116/0/4116b708",
"title": "Model-Driven Data Layout Selection for Improving Read Performance",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2014/4116b708/12OmNBKmXrM",
"parentPublication": {
"id": "proceedings/ipdpsw/2014/4116/0",
"title": "2014 IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2009/3761/0/3761a361",
"title": "How to Write and Read a Scientific Evaluation Paper",
"doi": null,
"abstractUrl": "/proceedings-article/re/2009/3761a361/12OmNBOllcK",
"parentPublication": {
"id": "proceedings/re/2009/3761/0",
"title": "2009 17th IEEE International Requirements Engineering Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bwcca/2015/8315/0/8315a333",
"title": "Role Safety in a Flexible Read-Write Abortion Protocol",
"doi": null,
"abstractUrl": "/proceedings-article/bwcca/2015/8315a333/12OmNrGsDmt",
"parentPublication": {
"id": "proceedings/bwcca/2015/8315/0",
"title": "2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2015/8870/0/8870a289",
"title": "A Flexible Read-Write Abortion Protocol with Sensitivity of Objects to Prevent Illegal Information Flow",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2015/8870a289/12OmNx7ouWO",
"parentPublication": {
"id": "proceedings/cisis/2015/8870/0",
"title": "2015 Ninth International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2017/5920/0/08190651",
"title": "WIP — A modification to the case study method to teach students to read academic papers",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2017/08190651/12OmNxbW4ST",
"parentPublication": {
"id": "proceedings/fie/2017/5920/0",
"title": "2017 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/skg/2014/6715/0/6715a145",
"title": "Extracting Content of Characters from Single Text",
"doi": null,
"abstractUrl": "/proceedings-article/skg/2014/6715a145/12OmNyprnrO",
"parentPublication": {
"id": "proceedings/skg/2014/6715/0",
"title": "2014 Tenth International Conference on Semantics, Knowledge and Grids (SKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-companion/2018/5663/0/566301a396",
"title": "Poster: How Do Modelers Read UML Diagrams? Preliminary Results from an Eye-Tracking Study",
"doi": null,
"abstractUrl": "/proceedings-article/icse-companion/2018/566301a396/13bd1gFCjrK",
"parentPublication": {
"id": "proceedings/icse-companion/2018/5663/0",
"title": "2018 IEEE/ACM 40th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2015/11/06994877",
"title": "A Novel Nondestructive Read/Write Circuit for Memristor-Based Memory Arrays",
"doi": null,
"abstractUrl": "/journal/si/2015/11/06994877/13rRUxN5eB7",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300d426",
"title": "Tell Me How to Survey: Literature Review Made Simple with Automatic Reading Path Generation",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300d426/1FwFLx44jTy",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itnac/2022/7103/0/09998397",
"title": "A Novel Story Plots Extraction Based Rapid Reading Comprehension System to Assist the Education for Low-income Families",
"doi": null,
"abstractUrl": "/proceedings-article/itnac/2022/09998397/1JGZXPMWTS0",
"parentPublication": {
"id": "proceedings/itnac/2022/7103/0",
"title": "2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2011030069",
"articleId": "13rRUxly8ZP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2011030084",
"articleId": "13rRUwInvLW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvAiSlQ",
"title": "July-Aug.",
"year": "2019",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "39",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1aXM8SeYTRe",
"doi": "10.1109/MCG.2019.2914844",
"abstract": "Promoting a wider range of contribution types can facilitate healthy growth of the visualization community, while increasing the intellectual diversity of visualization research papers. In this paper, we discuss the importance of contribution types and summarize contribution types that can be meaningful in visualization research. We also propose several concrete next steps we can and should take to ensure a successful launch of the contribution types.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Promoting a wider range of contribution types can facilitate healthy growth of the visualization community, while increasing the intellectual diversity of visualization research papers. In this paper, we discuss the importance of contribution types and summarize contribution types that can be meaningful in visualization research. We also propose several concrete next steps we can and should take to ensure a successful launch of the contribution types.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Promoting a wider range of contribution types can facilitate healthy growth of the visualization community, while increasing the intellectual diversity of visualization research papers. In this paper, we discuss the importance of contribution types and summarize contribution types that can be meaningful in visualization research. We also propose several concrete next steps we can and should take to ensure a successful launch of the contribution types.",
"title": "Broadening Intellectual Diversity in Visualization Research Papers",
"normalizedTitle": "Broadening Intellectual Diversity in Visualization Research Papers",
"fno": "08739142",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualisation",
"Research And Development",
"Visualization Research Papers",
"Contribution Types",
"Visualization Community",
"Intellectual Diversity",
"Data Visualization",
"Visualization",
"Task Analysis",
"Lenses",
"Cognition",
"Analytical Models"
],
"authors": [
{
"givenName": "Bongshin",
"surname": "Lee",
"fullName": "Bongshin Lee",
"affiliation": "Microsoft Research",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kate",
"surname": "Isaacs",
"fullName": "Kate Isaacs",
"affiliation": "University of Arizona",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danielle Albers",
"surname": "Szafir",
"fullName": "Danielle Albers Szafir",
"affiliation": "University of Colorado Boulder",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G. E.",
"surname": "Marai",
"fullName": "G. E. Marai",
"affiliation": "University of Illinois at Chicago",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cagatay",
"surname": "Turkay",
"fullName": "Cagatay Turkay",
"affiliation": "City University of London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Melanie",
"surname": "Tory",
"fullName": "Melanie Tory",
"affiliation": "Tableau Software",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sheelagh",
"surname": "Carpendale",
"fullName": "Sheelagh Carpendale",
"affiliation": "Simon Fraser University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alex",
"surname": "Endert",
"fullName": "Alex Endert",
"affiliation": "Georgia Tech",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2019-07-01 00:00:00",
"pubType": "mags",
"pages": "78-85",
"year": "2019",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/respect/2016/3419/0/07836177",
"title": "Broadening participation in visualization",
"doi": null,
"abstractUrl": "/proceedings-article/respect/2016/07836177/12OmNwHyZZx",
"parentPublication": {
"id": "proceedings/respect/2016/3419/0",
"title": "2016 Research on Equity and Sustained Participation in Engineering, Computing, and Technology (RESPECT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icim/2009/3911/0/3911a015",
"title": "Study on Methods of Knowledge Domain Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/icim/2009/3911a015/12OmNwHz0a3",
"parentPublication": {
"id": "proceedings/icim/2009/3911/0",
"title": "Innovation Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a352",
"title": "Visualization for Visual Analytics: Micro-visualization, Abstraction, and Physical Appeal",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a352/12OmNySG3Oy",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/02/08476234",
"title": "A Task-Based Taxonomy of Cognitive Biases for Information Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2020/02/08476234/13WBGLOgq3z",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/05/mco2013050022",
"title": "Cutting-Edge Research in Visualization",
"doi": null,
"abstractUrl": "/magazine/co/2013/05/mco2013050022/13rRUyuNsAB",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/06/09984051",
"title": "Embracing Disciplinary Diversity in Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2022/06/09984051/1J4y85Z3jLW",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09237132",
"title": "A Design Space of Vision Science Methods for Visualization Research",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09237132/1o8magPNnz2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2020/6497/0/649700a204",
"title": "Accessibility of Different Natural User Interfaces for People with Intellectual Disabilities",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2020/649700a204/1olHzNVhMti",
"parentPublication": {
"id": "proceedings/cw/2020/6497/0",
"title": "2020 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2020/8961/0/09274157",
"title": "Using Evidence Based Practices and Learning to Enhance Critical Thinking Skills in Students Through Data Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2020/09274157/1phRJBMoe1G",
"parentPublication": {
"id": "proceedings/fie/2020/8961/0",
"title": "2020 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09572234",
"title": "Professional Differences: A Comparative Study of Visualization Task Performance and Spatial Ability Across Disciplines",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09572234/1xH5FXdMnoA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08709814",
"articleId": "19TwJSaS1Hy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08739139",
"articleId": "1aXM8vCbh2o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwkR5xu",
"title": "December",
"year": "1996",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "2",
"label": "December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjGoLv",
"doi": "10.1109/2945.556503",
"abstract": "Abstract—One of the most important ways of visualizing fluid flow is the construction of streamlines, which are lines that are everywhere tangential to the local fluid velocity. Stream surfaces are defined as surfaces through which no fluid penetrates. Streamlines can therefore be computed from the intersection of two nonparallel stream surfaces. This paper presents new algorithms for the computation of dual stream functions from Computational Fluid Dynamics data that is defined on an unstructured tetrahedral mesh. These algorithms are compared with standard numerical routines for computing streamlines, and are shown to be quicker and more accurate than techniques involving numerical integration along the streamline.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—One of the most important ways of visualizing fluid flow is the construction of streamlines, which are lines that are everywhere tangential to the local fluid velocity. Stream surfaces are defined as surfaces through which no fluid penetrates. Streamlines can therefore be computed from the intersection of two nonparallel stream surfaces. This paper presents new algorithms for the computation of dual stream functions from Computational Fluid Dynamics data that is defined on an unstructured tetrahedral mesh. These algorithms are compared with standard numerical routines for computing streamlines, and are shown to be quicker and more accurate than techniques involving numerical integration along the streamline.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—One of the most important ways of visualizing fluid flow is the construction of streamlines, which are lines that are everywhere tangential to the local fluid velocity. Stream surfaces are defined as surfaces through which no fluid penetrates. Streamlines can therefore be computed from the intersection of two nonparallel stream surfaces. This paper presents new algorithms for the computation of dual stream functions from Computational Fluid Dynamics data that is defined on an unstructured tetrahedral mesh. These algorithms are compared with standard numerical routines for computing streamlines, and are shown to be quicker and more accurate than techniques involving numerical integration along the streamline.",
"title": "Visualizing Unstructured Flow Data Using Dual Stream Functions",
"normalizedTitle": "Visualizing Unstructured Flow Data Using Dual Stream Functions",
"fno": "v0355",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "David",
"surname": "Knight",
"fullName": "David Knight",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gordon",
"surname": "Mallinson",
"fullName": "Gordon Mallinson",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "1996-10-01 00:00:00",
"pubType": "trans",
"pages": "355-363",
"year": "1996",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0337",
"articleId": "13rRUyfKIHv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0364",
"articleId": "13rRUwghd4S",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrFBPWq",
"title": "September-October",
"year": "2006",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "September-October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuAo",
"doi": "10.1109/TVCG.2006.144",
"abstract": "In this paper we describe a GPU-based technique for creating illustrative visualization through interactive manipulation of volumetric models. It is partly inspired by medical illustrations, where it is common to depict cuts and deformation in order to provide a better understanding of anatomical and biological structures or surgical processes, and partly motivated by the need for a real-time solution that supports the specification and visualization of such illustrative manipulation. We propose two new feature-aligned techniques, namely surface alignment and segment alignment, and compare them with the axis-aligned techniques which was reported in previous work on volume manipulation. We also present a mechanism for defining features using texture volumes, and methods for computing correct normals for the deformed volume in respect to different alignments. We describe a GPU-based implementation to achieve real-time performance of the techniques and a collection of manipulation operators including peelers, retractors, pliers and dilators which are adaptations of the metaphors and tools used in surgical procedures and medical illustrations. Our approach is directly applicable in medical and biological illustration, and we demonstrate how it works as an interactive tool for focus+context visualization, as well as a generic technique for volume graphics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we describe a GPU-based technique for creating illustrative visualization through interactive manipulation of volumetric models. It is partly inspired by medical illustrations, where it is common to depict cuts and deformation in order to provide a better understanding of anatomical and biological structures or surgical processes, and partly motivated by the need for a real-time solution that supports the specification and visualization of such illustrative manipulation. We propose two new feature-aligned techniques, namely surface alignment and segment alignment, and compare them with the axis-aligned techniques which was reported in previous work on volume manipulation. We also present a mechanism for defining features using texture volumes, and methods for computing correct normals for the deformed volume in respect to different alignments. We describe a GPU-based implementation to achieve real-time performance of the techniques and a collection of manipulation operators including peelers, retractors, pliers and dilators which are adaptations of the metaphors and tools used in surgical procedures and medical illustrations. Our approach is directly applicable in medical and biological illustration, and we demonstrate how it works as an interactive tool for focus+context visualization, as well as a generic technique for volume graphics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we describe a GPU-based technique for creating illustrative visualization through interactive manipulation of volumetric models. It is partly inspired by medical illustrations, where it is common to depict cuts and deformation in order to provide a better understanding of anatomical and biological structures or surgical processes, and partly motivated by the need for a real-time solution that supports the specification and visualization of such illustrative manipulation. We propose two new feature-aligned techniques, namely surface alignment and segment alignment, and compare them with the axis-aligned techniques which was reported in previous work on volume manipulation. We also present a mechanism for defining features using texture volumes, and methods for computing correct normals for the deformed volume in respect to different alignments. We describe a GPU-based implementation to achieve real-time performance of the techniques and a collection of manipulation operators including peelers, retractors, pliers and dilators which are adaptations of the metaphors and tools used in surgical procedures and medical illustrations. Our approach is directly applicable in medical and biological illustration, and we demonstrate how it works as an interactive tool for focus+context visualization, as well as a generic technique for volume graphics.",
"title": "Feature Aligned Volume Manipulation for Illustration and Visualization",
"normalizedTitle": "Feature Aligned Volume Manipulation for Illustration and Visualization",
"fno": "v1069",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computer Graphic Equipment",
"Data Visualisation",
"Medical Computing",
"Rendering Computer Graphics",
"Feature Aligned Volume Manipulation",
"Data Visualization",
"GPU Based Technique",
"Volumetric Model",
"Anatomical Structure",
"Biological Structure",
"Surface Alignment",
"Segment Alignment",
"Surgical Procedure",
"Medical Illustration",
"Volume Graphics",
"Deformable Models",
"Surgery",
"Skin",
"Data Visualization",
"Computational Modeling",
"Silver",
"Biology Computing",
"Rendering Computer Graphics",
"Biological System Modeling",
"Computer Graphics",
"Illustrative Visualization",
"Illustrative Manipulation",
"GPU Computing",
"Volume Rendering",
"Volume Deformation",
"Computer Assisted Medical Illustration"
],
"authors": [
{
"givenName": "Carlos",
"surname": "Correa",
"fullName": "Carlos Correa",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Deborah",
"surname": "Silver",
"fullName": "Deborah Silver",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min",
"surname": "Chen",
"fullName": "Min Chen",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2006-09-01 00:00:00",
"pubType": "trans",
"pages": "1069-1076",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2006/0225/0/01647503",
"title": "A Hybrid User Interface for Manipulation of Volumetric Medical Data",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2006/01647503/12OmNBSSVmq",
"parentPublication": {
"id": "proceedings/3dui/2006/0225/0",
"title": "3D User Interfaces (3DUI'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2010/6685/0/05429597",
"title": "Adaptive proxy geometry for direct volume manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2010/05429597/12OmNBsue33",
"parentPublication": {
"id": "proceedings/pacificvis/2010/6685/0",
"title": "2010 IEEE Pacific Visualization Symposium (PacificVis 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532854",
"title": "Example-based volume illustrations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532854/12OmNvF83nf",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/1995/7117/0/71170089",
"title": "Manipulation of Volume and Graphics Objects for the Visualization of Medical Data under OpenGL (tm)",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/1995/71170089/12OmNwEJ12K",
"parentPublication": {
"id": "proceedings/cbms/1995/7117/0",
"title": "Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660085",
"title": "VolumeShop: An Interactive System for Direct Volume Illustration",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660085/12OmNwIpNlJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2018/1424/0/142401a036",
"title": "Smart Surrogate Widgets for Direct Volume Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2018/142401a036/12OmNyUnEJY",
"parentPublication": {
"id": "proceedings/pacificvis/2018/1424/0",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532856",
"title": "VolumeShop: an interactive system for direct volume illustration",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532856/12OmNzYNNaU",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2003/04/mcg2003040044",
"title": "Nonphotorealistic Rendering of Medical Volume Data",
"doi": null,
"abstractUrl": "/magazine/cg/2003/04/mcg2003040044/13rRUwkfAT0",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/02/v0193",
"title": "Volume Splitting and Its Applications",
"doi": null,
"abstractUrl": "/journal/tg/2007/02/v0193/13rRUxNW1Zc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2005/03/mcg2005030031",
"title": "Illustration Motifs for Effective Medical Volume Illustration",
"doi": null,
"abstractUrl": "/magazine/cg/2005/03/mcg2005030031/13rRUyft7x2",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1061",
"articleId": "13rRUyfKIHD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1077",
"articleId": "13rRUwIF6kZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvGPE8n",
"title": "Jan.",
"year": "2016",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcsYLR",
"doi": "10.1109/TVCG.2015.2467412",
"abstract": "Many foundational visualization techniques including isosurfacing, direct volume rendering and texture mapping rely on piecewise multilinear interpolation over the cells of a mesh. However, there has not been much focus within the visualization community on techniques that efficiently generate and encode globally continuous functions defined by the union of multilinear cells. Wavelets provide a rich context for analyzing and processing complicated datasets. In this paper, we exploit adaptive regular refinement as a means of representing and evaluating functions described by a subset of their nonzero wavelet coefficients. We analyze the dependencies involved in the wavelet transform and describe how to generate and represent the coarsest adaptive mesh with nodal function values such that the inverse wavelet transform is exactly reproduced via simple interpolation (subdivision) over the mesh elements. This allows for an adaptive, sparse representation of the function with on-demand evaluation at any point in the domain. We focus on the popular wavelets formed by tensor products of linear B-splines, resulting in an adaptive, nonconforming but crack-free quadtree (2D) or octree (3D) mesh that allows reproducing globally continuous functions via multilinear interpolation over its cells.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many foundational visualization techniques including isosurfacing, direct volume rendering and texture mapping rely on piecewise multilinear interpolation over the cells of a mesh. However, there has not been much focus within the visualization community on techniques that efficiently generate and encode globally continuous functions defined by the union of multilinear cells. Wavelets provide a rich context for analyzing and processing complicated datasets. In this paper, we exploit adaptive regular refinement as a means of representing and evaluating functions described by a subset of their nonzero wavelet coefficients. We analyze the dependencies involved in the wavelet transform and describe how to generate and represent the coarsest adaptive mesh with nodal function values such that the inverse wavelet transform is exactly reproduced via simple interpolation (subdivision) over the mesh elements. This allows for an adaptive, sparse representation of the function with on-demand evaluation at any point in the domain. We focus on the popular wavelets formed by tensor products of linear B-splines, resulting in an adaptive, nonconforming but crack-free quadtree (2D) or octree (3D) mesh that allows reproducing globally continuous functions via multilinear interpolation over its cells.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many foundational visualization techniques including isosurfacing, direct volume rendering and texture mapping rely on piecewise multilinear interpolation over the cells of a mesh. However, there has not been much focus within the visualization community on techniques that efficiently generate and encode globally continuous functions defined by the union of multilinear cells. Wavelets provide a rich context for analyzing and processing complicated datasets. In this paper, we exploit adaptive regular refinement as a means of representing and evaluating functions described by a subset of their nonzero wavelet coefficients. We analyze the dependencies involved in the wavelet transform and describe how to generate and represent the coarsest adaptive mesh with nodal function values such that the inverse wavelet transform is exactly reproduced via simple interpolation (subdivision) over the mesh elements. This allows for an adaptive, sparse representation of the function with on-demand evaluation at any point in the domain. We focus on the popular wavelets formed by tensor products of linear B-splines, resulting in an adaptive, nonconforming but crack-free quadtree (2D) or octree (3D) mesh that allows reproducing globally continuous functions via multilinear interpolation over its cells.",
"title": "Adaptive Multilinear Tensor Product Wavelets",
"normalizedTitle": "Adaptive Multilinear Tensor Product Wavelets",
"fno": "07192734",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Wavelet Transforms",
"Octrees",
"Interpolation",
"Tensile Stress",
"Splines Mathematics",
"Wavelet Domain",
"Continuous Reconstruction",
"Multilinear Interpolation",
"Adaptive Wavelets",
"Multiresolution Models",
"Octrees",
"Continuous Reconstruction",
"Multilinear Interpolation",
"Adaptive Wavelets",
"Multiresolution Models",
"Octrees"
],
"authors": [
{
"givenName": "Kenneth",
"surname": "Weiss",
"fullName": "Kenneth Weiss",
"affiliation": ", Lawrence Livermore National Laboratory",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Lindstrom",
"fullName": "Peter Lindstrom",
"affiliation": ", Lawrence Livermore National Laboratory",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2016-01-01 00:00:00",
"pubType": "trans",
"pages": "985-994",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/artcom/2010/4201/0/4201a146",
"title": "A Novel Wavelet Based Super Resolution Reconstruction of Low Resolution Images Using Adaptive Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/artcom/2010/4201a146/12OmNvA1hC5",
"parentPublication": {
"id": "proceedings/artcom/2010/4201/0",
"title": "Advances in Recent Technologies in Communication and Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1990/2083/0/00146401",
"title": "Accurate display of tensor product isosurfaces",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1990/00146401/12OmNyfvpQC",
"parentPublication": {
"id": "proceedings/visual/1990/2083/0",
"title": "1990 First IEEE Conference on Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118d842",
"title": "Novel Methods for Multilinear Data Completion and De-noising Based on Tensor-SVD",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118d842/12OmNypIYzA",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2014/3187/0/06822236",
"title": "Spatial Up-Conversion Using ADRC Stationary Wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2014/06822236/12OmNyprnrp",
"parentPublication": {
"id": "proceedings/itng/2014/3187/0",
"title": "2014 Eleventh International Conference on Information Technology: New Generations (ITNG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2006/9753/0/04042330",
"title": "Adaptive Quadratic Interpolation Methods for Lifting Steps Construction",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2006/04042330/12OmNyxXlyH",
"parentPublication": {
"id": "proceedings/isspit/2006/9753/0",
"title": "2006 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icc/2009/3538/0/3538a299",
"title": "Multilevel TV Denoising Methods for Anisotropic Tensor Product Wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/icc/2009/3538a299/12OmNzxyiIt",
"parentPublication": {
"id": "proceedings/icc/2009/3538/0",
"title": "Computing, Engineering and Information, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/12/06862897",
"title": "Multilinear Discriminant Analysis for Higher-Order Tensor Data Classification",
"doi": null,
"abstractUrl": "/journal/tp/2014/12/06862897/13rRUwI5TSt",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/02/v0130",
"title": "Efficient triangular surface approximations using wavelets and quadtree data structures",
"doi": null,
"abstractUrl": "/journal/tg/1996/02/v0130/13rRUxASuv5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09751449",
"title": "AMM: Adaptive Multilinear Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09751449/1CpcEXDpWIE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcmeim/2020/4109/0/410900a095",
"title": "Super Resolution Image Restoration Algorithm : Based on Wavelet and Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/wcmeim/2020/410900a095/1t2mISmdiPC",
"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": "07192624",
"articleId": "13rRUxBrGh2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07210213",
"articleId": "13rRUxlgy3L",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFwk",
"name": "ttg201601-07192734s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201601-07192734s1.zip",
"extension": "zip",
"size": "2.93 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNrkBwyT",
"title": "July",
"year": "1994",
"issueNum": "07",
"idPrefix": "co",
"pubType": "magazine",
"volume": "27",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbJCZT",
"doi": "10.1109/2.299408",
"abstract": "Given a set of points on the boundary of an object derived from volumetric data, how can one represent the object and, in particular visualize it from these points? This problem is addressed by our research on the representation of points at the boundary of an object as a union of simple boundary primitives. We use volumetric data in the customary sense, but an additional feature for our purpose is the availability of an inside-outside test for any point within the volume. Our problem is, therefore, a restricted form of the general problem of visualizing an arbitrary cloud of points. Representing and visualizing can be vague concepts. As an intuitive example of the kind of representation we are looking for, assume we have data somehow representing a human head. In the first approximation, the head can be represented by a sphere. The surface area and the volume of the sphere give us rough, but useful, estimates of the corresponding properties for the head. At the same time, the position and radius of the sphere give us an idea of the translation and scaling to apply to get the head in some canonical position. If, instead, we fit an ellipsoid, the additional degrees of freedom might let us obtain the parameters of the rotations to apply. Of course, we cannot independently obtain estimates for the scaling, volume, or area. The obtainable estimates depend on the context. Whereas human perception deals very well with these ambiguities, computer visualization tends to fall short. The new representation of volumetric data based on union of spheres shows promise in achieving stability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Given a set of points on the boundary of an object derived from volumetric data, how can one represent the object and, in particular visualize it from these points? This problem is addressed by our research on the representation of points at the boundary of an object as a union of simple boundary primitives. We use volumetric data in the customary sense, but an additional feature for our purpose is the availability of an inside-outside test for any point within the volume. Our problem is, therefore, a restricted form of the general problem of visualizing an arbitrary cloud of points. Representing and visualizing can be vague concepts. As an intuitive example of the kind of representation we are looking for, assume we have data somehow representing a human head. In the first approximation, the head can be represented by a sphere. The surface area and the volume of the sphere give us rough, but useful, estimates of the corresponding properties for the head. At the same time, the position and radius of the sphere give us an idea of the translation and scaling to apply to get the head in some canonical position. If, instead, we fit an ellipsoid, the additional degrees of freedom might let us obtain the parameters of the rotations to apply. Of course, we cannot independently obtain estimates for the scaling, volume, or area. The obtainable estimates depend on the context. Whereas human perception deals very well with these ambiguities, computer visualization tends to fall short. The new representation of volumetric data based on union of spheres shows promise in achieving stability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Given a set of points on the boundary of an object derived from volumetric data, how can one represent the object and, in particular visualize it from these points? This problem is addressed by our research on the representation of points at the boundary of an object as a union of simple boundary primitives. We use volumetric data in the customary sense, but an additional feature for our purpose is the availability of an inside-outside test for any point within the volume. Our problem is, therefore, a restricted form of the general problem of visualizing an arbitrary cloud of points. Representing and visualizing can be vague concepts. As an intuitive example of the kind of representation we are looking for, assume we have data somehow representing a human head. In the first approximation, the head can be represented by a sphere. The surface area and the volume of the sphere give us rough, but useful, estimates of the corresponding properties for the head. At the same time, the position and radius of the sphere give us an idea of the translation and scaling to apply to get the head in some canonical position. If, instead, we fit an ellipsoid, the additional degrees of freedom might let us obtain the parameters of the rotations to apply. Of course, we cannot independently obtain estimates for the scaling, volume, or area. The obtainable estimates depend on the context. Whereas human perception deals very well with these ambiguities, computer visualization tends to fall short. The new representation of volumetric data based on union of spheres shows promise in achieving stability.",
"title": "Volume models for volumetric data",
"normalizedTitle": "Volume models for volumetric data",
"fno": "r7028",
"hasPdf": true,
"idPrefix": "co",
"keywords": [],
"authors": [
{
"givenName": "Vishwa",
"surname": "Ranjan",
"fullName": "Vishwa Ranjan",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alain",
"surname": "Fournier",
"fullName": "Alain Fournier",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "1994-07-01 00:00:00",
"pubType": "mags",
"pages": "28-36",
"year": "1994",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "r7020",
"articleId": "13rRUyp7u1Z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "r7037",
"articleId": "13rRUwwJWBJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNs5rl2Y",
"title": "July-September",
"year": "1997",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "3",
"label": "July-September",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyaeP",
"doi": "10.1109/2945.620489",
"abstract": "Abstract—Given a three-dimensional (3D) array of function values Fi, j,k on a rectilinear grid, the marching cubes (MC) method is the most common technique used for computing a surface triangulation Z_${\\cal T}$_Z approximating a contour (isosurface) F(x, y, z) = T. We describe the construction of a C0-continuous surface consisting of rational-quadratic surface patches interpolating the triangles in Z_${\\cal T}.$_Z We determine the Bézier control points of a single rational-quadratic surface patch based on the coordinates of the vertices of the underlying triangle and the gradients and Hessians associated with the vertices.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Given a three-dimensional (3D) array of function values Fi, j,k on a rectilinear grid, the marching cubes (MC) method is the most common technique used for computing a surface triangulation ${\\cal T}$ approximating a contour (isosurface) F(x, y, z) = T. We describe the construction of a C0-continuous surface consisting of rational-quadratic surface patches interpolating the triangles in ${\\cal T}.$ We determine the Bézier control points of a single rational-quadratic surface patch based on the coordinates of the vertices of the underlying triangle and the gradients and Hessians associated with the vertices.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Given a three-dimensional (3D) array of function values Fi, j,k on a rectilinear grid, the marching cubes (MC) method is the most common technique used for computing a surface triangulation - approximating a contour (isosurface) F(x, y, z) = T. We describe the construction of a C0-continuous surface consisting of rational-quadratic surface patches interpolating the triangles in - We determine the Bézier control points of a single rational-quadratic surface patch based on the coordinates of the vertices of the underlying triangle and the gradients and Hessians associated with the vertices.",
"title": "On Approximating Contours of the Piecewise Trilinear Interpolant Using Triangular Rational-Quadratic Bézier Patches",
"normalizedTitle": "On Approximating Contours of the Piecewise Trilinear Interpolant Using Triangular Rational-Quadratic Bézier Patches",
"fno": "v0215",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Approximation",
"Contour",
"Isosurface",
"Marching Cubes",
"Rational Bezier Curve",
"Rational Bezier Surface",
"Triangular Patch",
"Triangulation",
"Trilinear Interpolation",
"Visualization"
],
"authors": [
{
"givenName": "Bernd",
"surname": "Hamann",
"fullName": "Bernd Hamann",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Issac J.",
"surname": "Trotts",
"fullName": "Issac J. Trotts",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gerald E.",
"surname": "Farin",
"fullName": "Gerald E. Farin",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1997-07-01 00:00:00",
"pubType": "trans",
"pages": "215-227",
"year": "1997",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "v0201",
"articleId": "13rRUxASuhl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v0228",
"articleId": "13rRUxly9dH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC8uRnm",
"title": "January",
"year": "2007",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "29",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcKzWk",
"doi": "10.1109/TPAMI.2007.21",
"abstract": "Digitization is not as easy as it looks. If one digitizes a 3D object even with a dense sampling grid, the reconstructed digital object may have topological distortions and, in general, there exists no upper bound for the Hausdorff distance. This explains why so far no algorithm has been known which guarantees topology preservation. However, as we will show, it is possible to repair the obtained digital image in a locally bounded way so that it is homeomorphic and close to the 3D object. The resulting digital object is always well-composed, which has nice implications for a lot of image analysis problems. Moreover, we will show that the surface of the original object is homeomorphic to the result of the marching cubes algorithm. This is really surprising since it means that the well-known topological problems of the marching cubes reconstruction simply do not occur for digital images of r-regular objects. Based on the trilinear interpolation, we also construct a smooth isosurface from the digital image that has the same topology as the original surface. Finally, we give a surprisingly simple topology preserving reconstruction method by using overlapping balls instead of cubical voxels. This is the first approach of digitizing 3D objects which guarantees topology preservation and gives an upper bound for the geometric distortion. Since the output can be chosen as a pure voxel presentation, a union of balls, a reconstruction by trilinear interpolation, a smooth isosurface, or the piecewise linear marching cubes surface, the results are directly applicable to a huge class of image analysis algorithms. Moreover, we show how one can efficiently estimate the volume and the surface area of 3D objects by looking at their digitizations. Measuring volume and surface area of digital objects are important problems in 3D image analysis. Good estimators should be multigrid convergent, i.e., the error goes to zero with increasing sampling density. We will show that every presented reconstruction method can be used for volume estimation and we will give a solution for the much more difficult problem of multigrid-convergent surface area estimation. Our solution is based on simple counting of voxels and we are the first to be able to give absolute bounds for the surface area.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Digitization is not as easy as it looks. If one digitizes a 3D object even with a dense sampling grid, the reconstructed digital object may have topological distortions and, in general, there exists no upper bound for the Hausdorff distance. This explains why so far no algorithm has been known which guarantees topology preservation. However, as we will show, it is possible to repair the obtained digital image in a locally bounded way so that it is homeomorphic and close to the 3D object. The resulting digital object is always well-composed, which has nice implications for a lot of image analysis problems. Moreover, we will show that the surface of the original object is homeomorphic to the result of the marching cubes algorithm. This is really surprising since it means that the well-known topological problems of the marching cubes reconstruction simply do not occur for digital images of r-regular objects. Based on the trilinear interpolation, we also construct a smooth isosurface from the digital image that has the same topology as the original surface. Finally, we give a surprisingly simple topology preserving reconstruction method by using overlapping balls instead of cubical voxels. This is the first approach of digitizing 3D objects which guarantees topology preservation and gives an upper bound for the geometric distortion. Since the output can be chosen as a pure voxel presentation, a union of balls, a reconstruction by trilinear interpolation, a smooth isosurface, or the piecewise linear marching cubes surface, the results are directly applicable to a huge class of image analysis algorithms. Moreover, we show how one can efficiently estimate the volume and the surface area of 3D objects by looking at their digitizations. Measuring volume and surface area of digital objects are important problems in 3D image analysis. Good estimators should be multigrid convergent, i.e., the error goes to zero with increasing sampling density. We will show that every presented reconstruction method can be used for volume estimation and we will give a solution for the much more difficult problem of multigrid-convergent surface area estimation. Our solution is based on simple counting of voxels and we are the first to be able to give absolute bounds for the surface area.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Digitization is not as easy as it looks. If one digitizes a 3D object even with a dense sampling grid, the reconstructed digital object may have topological distortions and, in general, there exists no upper bound for the Hausdorff distance. This explains why so far no algorithm has been known which guarantees topology preservation. However, as we will show, it is possible to repair the obtained digital image in a locally bounded way so that it is homeomorphic and close to the 3D object. The resulting digital object is always well-composed, which has nice implications for a lot of image analysis problems. Moreover, we will show that the surface of the original object is homeomorphic to the result of the marching cubes algorithm. This is really surprising since it means that the well-known topological problems of the marching cubes reconstruction simply do not occur for digital images of r-regular objects. Based on the trilinear interpolation, we also construct a smooth isosurface from the digital image that has the same topology as the original surface. Finally, we give a surprisingly simple topology preserving reconstruction method by using overlapping balls instead of cubical voxels. This is the first approach of digitizing 3D objects which guarantees topology preservation and gives an upper bound for the geometric distortion. Since the output can be chosen as a pure voxel presentation, a union of balls, a reconstruction by trilinear interpolation, a smooth isosurface, or the piecewise linear marching cubes surface, the results are directly applicable to a huge class of image analysis algorithms. Moreover, we show how one can efficiently estimate the volume and the surface area of 3D objects by looking at their digitizations. Measuring volume and surface area of digital objects are important problems in 3D image analysis. Good estimators should be multigrid convergent, i.e., the error goes to zero with increasing sampling density. We will show that every presented reconstruction method can be used for volume estimation and we will give a solution for the much more difficult problem of multigrid-convergent surface area estimation. Our solution is based on simple counting of voxels and we are the first to be able to give absolute bounds for the surface area.",
"title": "Topological Equivalence between a 3D Object and the Reconstruction of Its Digital Image",
"normalizedTitle": "Topological Equivalence between a 3D Object and the Reconstruction of Its Digital Image",
"fno": "i0126",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"R Regular",
"Topology",
"Digitization",
"3 D",
"Marching Cubes",
"Trilinear Interpolation",
"Well Composed"
],
"authors": [
{
"givenName": "Peer",
"surname": "Stelldinger",
"fullName": "Peer Stelldinger",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Longin Jan",
"surname": "Latecki",
"fullName": "Longin Jan Latecki",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marcelo",
"surname": "Siqueira",
"fullName": "Marcelo Siqueira",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2007-01-01 00:00:00",
"pubType": "trans",
"pages": "126-140",
"year": "2007",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/mvhi/2010/4009/0/4009a608",
"title": "Three-Dimensional Reconstruction of Medical Image Based on Improved Marching Cubes Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/mvhi/2010/4009a608/12OmNBtUdOc",
"parentPublication": {
"id": "proceedings/mvhi/2010/4009/0",
"title": "Machine Vision and Human-machine Interface, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2009/3843/2/3843b209",
"title": "An Improved 3D Reconstruction Method",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2009/3843b209/12OmNwJybNk",
"parentPublication": {
"id": "proceedings/mines/2009/3843/2",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2010/3987/1/3987a194",
"title": "Improvement of Marching Cubes Algorithm Based on Sign Determination",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2010/3987a194/12OmNxWcH0N",
"parentPublication": {
"id": "proceedings/etcs/2010/3987/1",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300009",
"title": "MC*: Star Functions for Marching Cubes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300009/12OmNyprnzr",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2001/1007/0/10070306",
"title": "A Marching Voxels Method for Surface Rendering of Volume Data",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2001/10070306/12OmNzdoN6A",
"parentPublication": {
"id": "proceedings/cgi/2001/1007/0",
"title": "Proceedings. Computer Graphics International 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/04/ttg2010040533",
"title": "Subdivision Analysis of the Trilinear Interpolant",
"doi": null,
"abstractUrl": "/journal/tg/2010/04/ttg2010040533/13rRUILtJzr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/01/v0016",
"title": "Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing",
"doi": null,
"abstractUrl": "/journal/tg/2003/01/v0016/13rRUNvgyWa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/03/v0215",
"title": "On Approximating Contours of the Piecewise Trilinear Interpolant Using Triangular Rational-Quadratic Bézier Patches",
"doi": null,
"abstractUrl": "/journal/tg/1997/03/v0215/13rRUNvyaeP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061651",
"title": "Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061651/13rRUxly8XA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/03/v0283",
"title": "On Marching Cubes",
"doi": null,
"abstractUrl": "/journal/tg/2003/03/v0283/13rRUyYjK58",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0112",
"articleId": "13rRUxASuU2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0141",
"articleId": "13rRUzpzeC6",
"__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": "1sXjFxDTLAQ",
"doi": "10.1109/TVCG.2021.3074438",
"abstract": "The topology of isosurfaces changes at isovalues of critical points, making such points an important feature when building contour trees or Morse-Smale complexes. Hexahedral elements with linear interpolants can contain additional off-vertex critical points in element bodies and on element faces. Moreover, a point on the face of a hexahedron which is critical in the element-local context is not necessarily critical in the global context. Weber <italic>et al. (2002)</italic> introduce a method to determine whether critical points on faces are also critical in the global context, based on the gradient of the asymptotic decider (G. M. Nielson and B. Hamann) (1991) in each element that shares the face. However, as defined, the method of Weber <italic>et al.</italic> contains an error, and can lead to incorrect results. In this work we correct the error.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The topology of isosurfaces changes at isovalues of critical points, making such points an important feature when building contour trees or Morse-Smale complexes. Hexahedral elements with linear interpolants can contain additional off-vertex critical points in element bodies and on element faces. Moreover, a point on the face of a hexahedron which is critical in the element-local context is not necessarily critical in the global context. Weber <italic>et al. (2002)</italic> introduce a method to determine whether critical points on faces are also critical in the global context, based on the gradient of the asymptotic decider (G. M. Nielson and B. Hamann) (1991) in each element that shares the face. However, as defined, the method of Weber <italic>et al.</italic> contains an error, and can lead to incorrect results. In this work we correct the error.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The topology of isosurfaces changes at isovalues of critical points, making such points an important feature when building contour trees or Morse-Smale complexes. Hexahedral elements with linear interpolants can contain additional off-vertex critical points in element bodies and on element faces. Moreover, a point on the face of a hexahedron which is critical in the element-local context is not necessarily critical in the global context. Weber et al. (2002) introduce a method to determine whether critical points on faces are also critical in the global context, based on the gradient of the asymptotic decider (G. M. Nielson and B. Hamann) (1991) in each element that shares the face. However, as defined, the method of Weber et al. contains an error, and can lead to incorrect results. In this work we correct the error.",
"title": "Identification and Classification of Off-Vertex Critical Points for Contour Tree Construction on Unstructured Meshes of Hexahedra",
"normalizedTitle": "Identification and Classification of Off-Vertex Critical Points for Contour Tree Construction on Unstructured Meshes of Hexahedra",
"fno": "09409737",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Gradient Methods",
"Interpolation",
"Mesh Generation",
"Trees Mathematics",
"Contour Tree Construction",
"Element Faces",
"Element Local Context",
"Gradient Method",
"Hexahedral Elements",
"Isosurface Topology",
"Linear Interpolant",
"Morse Smale Complexes",
"Off Vertex Critical Points",
"Unstructured Meshes",
"Isosurfaces",
"Three Dimensional Displays",
"Visualization",
"Topology",
"Inspection",
"Isosurface",
"Critical Points",
"Hexahedra",
"Contour Tree"
],
"authors": [
{
"givenName": "Marius K.",
"surname": "Koch",
"fullName": "Marius K. Koch",
"affiliation": "Department of Aeronautics, Imperial College, London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul H. J.",
"surname": "Kelly",
"fullName": "Paul H. J. Kelly",
"affiliation": "Department of Computing, Imperial College, London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter E.",
"surname": "Vincent",
"fullName": "Peter E. Vincent",
"affiliation": "Department of Aeronautics, Imperial College, London, London, U.K.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2022-12-01 00:00:00",
"pubType": "trans",
"pages": "5178-5180",
"year": "2022",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1991/2245/0/00175773",
"title": "A tool for visualizing the topology of three-dimensional vector fields",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1991/00175773/12OmNAZfxIE",
"parentPublication": {
"id": "proceedings/visual/1991/2245/0",
"title": "1991 Proceeding Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851b610",
"title": "Contour Detection in Unstructured 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851b610/12OmNyo1o18",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mmm/2004/2084/0/20840187",
"title": "Decomposing Polygon Meshes by Means of Critical Points",
"doi": null,
"abstractUrl": "/proceedings-article/mmm/2004/20840187/12OmNzd7bUO",
"parentPublication": {
"id": "proceedings/mmm/2004/2084/0",
"title": "Multi-Media Modeling Conference, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061177",
"title": "Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061177/13rRUyY28Yo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000a469",
"title": "Glimpse Clouds: Human Activity Recognition from Unstructured Feature Points",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000a469/17D45Xh13wg",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/06/09969132",
"title": "Trifocal Relative Pose From Lines at Points",
"doi": null,
"abstractUrl": "/journal/tp/2023/06/09969132/1IMi2ehaHEA",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a415",
"title": "Extraction of Interest Points on 3D Meshes Based on Bilateral Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a415/1ap5x9rgSGI",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09405464",
"title": "FTK: A Simplicial Spacetime Meshing Framework for Robust and Scalable Feature Tracking",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09405464/1sP1fUOfDLq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900a546",
"title": "Body Meshes as Points",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900a546/1yeHUobJhZK",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/12/09650726",
"title": "Learning and Meshing From Deep Implicit Surface Networks Using an Efficient Implementation of Analytic Marching",
"doi": null,
"abstractUrl": "/journal/tp/2022/12/09650726/1zkoUjcxaDe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09392369",
"articleId": "1sq7wsDegjC",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz2C1Bz",
"title": "September/October",
"year": "2010",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs2gn",
"doi": "10.1109/TVCG.2010.18",
"abstract": "Real-time rendering can benefit from global illumination methods to make the 3D environments look more convincing and lifelike. On the other hand, the conventional global illumination algorithms for the estimation of the diffuse surface interreflection make heavy usage of intra- and interobject visibility calculations, so they are time-consuming, and using them in real-time graphics applications can be prohibitive for complex scenes. Modern illumination approximations, such as ambient occlusion variants, use precalculated or frame-dependent data to reduce the problem to a local shading one. This paper presents a fast real-time method for visibility sampling using volumetric data in order to produce accurate inter- and intraobject ambient occlusion. The proposed volume sampling technique disassociates surface representation data from the visibility calculations, and therefore, makes the method suitable for both primitive-order or screen-order rendering, such as deferred rendering. The sampling mechanism can be used in any application that performs visibility queries or ray marching.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Real-time rendering can benefit from global illumination methods to make the 3D environments look more convincing and lifelike. On the other hand, the conventional global illumination algorithms for the estimation of the diffuse surface interreflection make heavy usage of intra- and interobject visibility calculations, so they are time-consuming, and using them in real-time graphics applications can be prohibitive for complex scenes. Modern illumination approximations, such as ambient occlusion variants, use precalculated or frame-dependent data to reduce the problem to a local shading one. This paper presents a fast real-time method for visibility sampling using volumetric data in order to produce accurate inter- and intraobject ambient occlusion. The proposed volume sampling technique disassociates surface representation data from the visibility calculations, and therefore, makes the method suitable for both primitive-order or screen-order rendering, such as deferred rendering. The sampling mechanism can be used in any application that performs visibility queries or ray marching.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Real-time rendering can benefit from global illumination methods to make the 3D environments look more convincing and lifelike. On the other hand, the conventional global illumination algorithms for the estimation of the diffuse surface interreflection make heavy usage of intra- and interobject visibility calculations, so they are time-consuming, and using them in real-time graphics applications can be prohibitive for complex scenes. Modern illumination approximations, such as ambient occlusion variants, use precalculated or frame-dependent data to reduce the problem to a local shading one. This paper presents a fast real-time method for visibility sampling using volumetric data in order to produce accurate inter- and intraobject ambient occlusion. The proposed volume sampling technique disassociates surface representation data from the visibility calculations, and therefore, makes the method suitable for both primitive-order or screen-order rendering, such as deferred rendering. The sampling mechanism can be used in any application that performs visibility queries or ray marching.",
"title": "Real-Time Volume-Based Ambient Occlusion",
"normalizedTitle": "Real-Time Volume-Based Ambient Occlusion",
"fno": "ttg2010050752",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shading",
"Shadowing",
"Raytracing",
"Volume Visualization",
"Visibility",
"Ambient Occlusion",
"Ray Marching"
],
"authors": [
{
"givenName": "Georgios",
"surname": "Papaioannou",
"fullName": "Georgios Papaioannou",
"affiliation": "Athens University of Economics and Business, Athens",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maria Lida",
"surname": "Menexi",
"fullName": "Maria Lida Menexi",
"affiliation": "Athens University of Economics and Business, Athens",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Charilaos",
"surname": "Papadopoulos",
"fullName": "Charilaos Papadopoulos",
"affiliation": "Athens University of Economics and Business, Athens",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2010-09-01 00:00:00",
"pubType": "trans",
"pages": "752-762",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880147",
"title": "Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880147/12OmNAY79mS",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498lloyd",
"title": "Horizon Occlusion Culling for Real-time Rendering of Hierarchical Terrains",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498lloyd/12OmNCxbXBX",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2010/4277/0/4277a001",
"title": "Screen-Space Ambient Occlusion through Summed-Area Tables",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2010/4277a001/12OmNqGiu25",
"parentPublication": {
"id": "proceedings/icnc/2010/4277/0",
"title": "2010 First International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2013/4989/0/4989c515",
"title": "Photometric Ambient Occlusion",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989c515/12OmNvAiSDF",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pma/2006/2851/0/2851a319",
"title": "Fast Tree Ambient Occlusion Approximation",
"doi": null,
"abstractUrl": "/proceedings-article/pma/2006/2851a319/12OmNwF0BUe",
"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": "trans/tg/2013/12/ttg2013122936",
"title": "Ambient Volume Scattering",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122936/13rRUwcAqqh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011121795",
"title": "Extinction-Based Shading and Illumination in GPU Volume Ray-Casting",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011121795/13rRUwkxc5o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2010/01/mcg2010010070",
"title": "Volumetric Ambient Occlusion for Real-Time Rendering and Games",
"doi": null,
"abstractUrl": "/magazine/cg/2010/01/mcg2010010070/13rRUxlgxPs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/04/ttg2010040548",
"title": "Local Ambient Occlusion in Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2010/04/ttg2010040548/13rRUy0HYRk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09216549",
"title": "Advanced Rendering of Line Data with Ambient Occlusion and Transparency",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09216549/1nJsKPg3YJy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010050742",
"articleId": "13rRUwbs1Ss",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010050777",
"articleId": "13rRUxAAT7B",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFqV",
"name": "ttg2010050752s.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2010050752s.avi",
"extension": "avi",
"size": "13.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAZx8O6",
"title": "March/April",
"year": "1990",
"issueNum": "02",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "10",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwcAquw",
"doi": "10.1109/38.50671",
"abstract": "Volume rendering, a technique for visualizing sampled functions of three spatial dimensions by computing 2-D projections of a colored semitransparent volume, is extended to handle polygonally defined objects. A hybrid ray-tracing algorithm, whereby rays are simultaneously cast through a set of polygons and a volume data array, is used. Samples of each are drawn at equally spaced intervals along the rays, and the resulting colors and opacities are composited together in depth-sorted order. To avoid aliasing of polygonal edges at modest computational expense, a form of selective supersampling is used. To avoid errors in visibility at polygon-volume intersections, special treatment is given to volume samples lying immediately in front of and behind polygons. The cost, image quality, and versatility of the algorithm are evaluated using data from 3-D medical imaging applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Volume rendering, a technique for visualizing sampled functions of three spatial dimensions by computing 2-D projections of a colored semitransparent volume, is extended to handle polygonally defined objects. A hybrid ray-tracing algorithm, whereby rays are simultaneously cast through a set of polygons and a volume data array, is used. Samples of each are drawn at equally spaced intervals along the rays, and the resulting colors and opacities are composited together in depth-sorted order. To avoid aliasing of polygonal edges at modest computational expense, a form of selective supersampling is used. To avoid errors in visibility at polygon-volume intersections, special treatment is given to volume samples lying immediately in front of and behind polygons. The cost, image quality, and versatility of the algorithm are evaluated using data from 3-D medical imaging applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Volume rendering, a technique for visualizing sampled functions of three spatial dimensions by computing 2-D projections of a colored semitransparent volume, is extended to handle polygonally defined objects. A hybrid ray-tracing algorithm, whereby rays are simultaneously cast through a set of polygons and a volume data array, is used. Samples of each are drawn at equally spaced intervals along the rays, and the resulting colors and opacities are composited together in depth-sorted order. To avoid aliasing of polygonal edges at modest computational expense, a form of selective supersampling is used. To avoid errors in visibility at polygon-volume intersections, special treatment is given to volume samples lying immediately in front of and behind polygons. The cost, image quality, and versatility of the algorithm are evaluated using data from 3-D medical imaging applications.",
"title": "Volume Rendering",
"normalizedTitle": "Volume Rendering",
"fno": "mcg1990020033",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [],
"authors": [
{
"givenName": "Marc",
"surname": "Levoy",
"fullName": "Marc Levoy",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1990-03-01 00:00:00",
"pubType": "mags",
"pages": "33-40",
"year": "1990",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg1990020024",
"articleId": "13rRUy08Myt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg1990020041",
"articleId": "13rRUILLkxL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAle6Qx",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUytWF9e",
"doi": "10.1109/TVCG.2007.70591",
"abstract": "Direct volume rendering techniques map volumetric attributes (e.g., density, gradient magnitude, etc.) to visual styles. Commonly this mapping is specified by a transfer function. The specification of transfer functions is a complex task and requires expert knowledge about the underlying rendering technique. In the case of multiple volumetric attributes and multiple visual styles the specification of the multi-dimensional transfer function becomes more challenging and non-intuitive. We present a novel methodology for the specification of a mapping from several volumetric attributes to multiple illustrative visual styles. We introduce semantic layers that allow a domain expert to specify the mapping in the natural language of the domain. A semantic layer defines the mapping of volumetric attributes to one visual style. Volumetric attributes and visual styles are represented as fuzzy sets. The mapping is specified by rules that are evaluated with fuzzy logic arithmetics. The user specifies the fuzzy sets and the rules without special knowledge about the underlying rendering technique. Semantic layers allow for a linguistic specification of the mapping from attributes to visual styles replacing the traditional transfer function specification.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Direct volume rendering techniques map volumetric attributes (e.g., density, gradient magnitude, etc.) to visual styles. Commonly this mapping is specified by a transfer function. The specification of transfer functions is a complex task and requires expert knowledge about the underlying rendering technique. In the case of multiple volumetric attributes and multiple visual styles the specification of the multi-dimensional transfer function becomes more challenging and non-intuitive. We present a novel methodology for the specification of a mapping from several volumetric attributes to multiple illustrative visual styles. We introduce semantic layers that allow a domain expert to specify the mapping in the natural language of the domain. A semantic layer defines the mapping of volumetric attributes to one visual style. Volumetric attributes and visual styles are represented as fuzzy sets. The mapping is specified by rules that are evaluated with fuzzy logic arithmetics. The user specifies the fuzzy sets and the rules without special knowledge about the underlying rendering technique. Semantic layers allow for a linguistic specification of the mapping from attributes to visual styles replacing the traditional transfer function specification.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Direct volume rendering techniques map volumetric attributes (e.g., density, gradient magnitude, etc.) to visual styles. Commonly this mapping is specified by a transfer function. The specification of transfer functions is a complex task and requires expert knowledge about the underlying rendering technique. In the case of multiple volumetric attributes and multiple visual styles the specification of the multi-dimensional transfer function becomes more challenging and non-intuitive. We present a novel methodology for the specification of a mapping from several volumetric attributes to multiple illustrative visual styles. We introduce semantic layers that allow a domain expert to specify the mapping in the natural language of the domain. A semantic layer defines the mapping of volumetric attributes to one visual style. Volumetric attributes and visual styles are represented as fuzzy sets. The mapping is specified by rules that are evaluated with fuzzy logic arithmetics. The user specifies the fuzzy sets and the rules without special knowledge about the underlying rendering technique. Semantic layers allow for a linguistic specification of the mapping from attributes to visual styles replacing the traditional transfer function specification.",
"title": "Semantic Layers for Illustrative Volume Rendering",
"normalizedTitle": "Semantic Layers for Illustrative Volume Rendering",
"fno": "v1336",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Transfer Functions",
"Fuzzy Sets",
"Fuzzy Logic",
"Natural Languages",
"Arithmetic",
"Visualization",
"Rendering Computer Graphics",
"User Interfaces",
"Focusing",
"Density Measurement",
"Volume Visualization",
"Illustrative Visualization",
"Focus Context Techniques"
],
"authors": [
{
"givenName": "Peter",
"surname": "Rautek",
"fullName": "Peter Rautek",
"affiliation": "Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Bruckner",
"fullName": "Stefan Bruckner",
"affiliation": "Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eduard",
"surname": "Gröller",
"fullName": "Eduard Gröller",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "trans",
"pages": "1336-1343",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2002/7498/0/7498kniss",
"title": "Interactive Translucent Volume Rendering and Procedural Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498kniss/12OmNB0X8rO",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300039",
"title": "Compression Domain Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300039/12OmNBWi6GJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300038",
"title": "Acceleration Techniques for GPU-based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300038/12OmNC2xhD8",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/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/sibgrapi/2010/8420/0/05720357",
"title": "Importance-Aware Composition for Illustrative Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720357/12OmNz5apMR",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/02/v0127",
"title": "Illustrative Interactive Stipple Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2003/02/v0127/13rRUIIVlcA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1559",
"title": "Illustrative Context-Preserving Exploration of Volume Data",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1559/13rRUNvyata",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111942",
"title": "Unified Boundary-Aware Texturing for Interactive Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111942/13rRUwbs2gr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/04/ttg2010040571",
"title": "Illustrative Volume Visualization Using GPU-Based Particle Systems",
"doi": null,
"abstractUrl": "/journal/tg/2010/04/ttg2010040571/13rRUwgyOjh",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122946",
"title": "Lighting Design for Globally Illuminated Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122946/13rRUwvBy8U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04376172",
"articleId": "13rRUwj7cp4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "v1344",
"articleId": "13rRUygT7ss",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwGqBqg",
"title": "November/December",
"year": "2009",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "15",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0xPmW",
"doi": "10.1109/TVCG.2009.186",
"abstract": "Volumetric datasets are often modeled using a multiresolution approach based on a nested decomposition of the domain into a polyhedral mesh. Nested tetrahedral meshes generated through the longest edge bisection rule are commonly used to decompose regular volumetric datasets since they produce highly adaptive crack-free representations. Efficient representations for such models have been achieved by clustering the set of tetrahedra sharing a common longest edge into a structure called a diamond. The alignment and orientation of the longest edge can be used to implicitly determine the geometry of a diamond and its relations to the other diamonds within the hierarchy. We introduce the supercube as a high-level primitive within such meshes that encompasses all unique types of diamonds. A supercube is a coherent set of edges corresponding to three consecutive levels of subdivision. Diamonds are uniquely characterized by the longest edge of the tetrahedra forming them and are clustered in supercubes through the association of the longest edge of a diamond with a unique edge in a supercube. Supercubes are thus a compact and highly efficient means of associating information with a subset of the vertices, edges and tetrahedra of the meshes generated through longest edge bisection. We demonstrate the effectiveness of the supercube representation when encoding multiresolution diamond hierarchies built on a subset of the points of a regular grid. We also show how supercubes can be used to efficiently extract meshes from diamond hierarchies and to reduce the storage requirements of such variable-resolution meshes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Volumetric datasets are often modeled using a multiresolution approach based on a nested decomposition of the domain into a polyhedral mesh. Nested tetrahedral meshes generated through the longest edge bisection rule are commonly used to decompose regular volumetric datasets since they produce highly adaptive crack-free representations. Efficient representations for such models have been achieved by clustering the set of tetrahedra sharing a common longest edge into a structure called a diamond. The alignment and orientation of the longest edge can be used to implicitly determine the geometry of a diamond and its relations to the other diamonds within the hierarchy. We introduce the supercube as a high-level primitive within such meshes that encompasses all unique types of diamonds. A supercube is a coherent set of edges corresponding to three consecutive levels of subdivision. Diamonds are uniquely characterized by the longest edge of the tetrahedra forming them and are clustered in supercubes through the association of the longest edge of a diamond with a unique edge in a supercube. Supercubes are thus a compact and highly efficient means of associating information with a subset of the vertices, edges and tetrahedra of the meshes generated through longest edge bisection. We demonstrate the effectiveness of the supercube representation when encoding multiresolution diamond hierarchies built on a subset of the points of a regular grid. We also show how supercubes can be used to efficiently extract meshes from diamond hierarchies and to reduce the storage requirements of such variable-resolution meshes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Volumetric datasets are often modeled using a multiresolution approach based on a nested decomposition of the domain into a polyhedral mesh. Nested tetrahedral meshes generated through the longest edge bisection rule are commonly used to decompose regular volumetric datasets since they produce highly adaptive crack-free representations. Efficient representations for such models have been achieved by clustering the set of tetrahedra sharing a common longest edge into a structure called a diamond. The alignment and orientation of the longest edge can be used to implicitly determine the geometry of a diamond and its relations to the other diamonds within the hierarchy. We introduce the supercube as a high-level primitive within such meshes that encompasses all unique types of diamonds. A supercube is a coherent set of edges corresponding to three consecutive levels of subdivision. Diamonds are uniquely characterized by the longest edge of the tetrahedra forming them and are clustered in supercubes through the association of the longest edge of a diamond with a unique edge in a supercube. Supercubes are thus a compact and highly efficient means of associating information with a subset of the vertices, edges and tetrahedra of the meshes generated through longest edge bisection. We demonstrate the effectiveness of the supercube representation when encoding multiresolution diamond hierarchies built on a subset of the points of a regular grid. We also show how supercubes can be used to efficiently extract meshes from diamond hierarchies and to reduce the storage requirements of such variable-resolution meshes.",
"title": "Supercubes: A High-Level Primitive for Diamond Hierarchies",
"normalizedTitle": "Supercubes: A High-Level Primitive for Diamond Hierarchies",
"fno": "ttg2009061603",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Longest Edge Bisection",
"Diamonds",
"Hierarchy Of Diamonds",
"Multiresolution Models",
"Selective Refinement"
],
"authors": [
{
"givenName": "Kenneth",
"surname": "Weiss",
"fullName": "Kenneth Weiss",
"affiliation": "University of Maryland, College Park",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Leila",
"surname": "De Floriani",
"fullName": "Leila De Floriani",
"affiliation": "University of Genova",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1603-1610",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2015/9504/0/9504a011",
"title": "Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504a011/12OmNzAohWJ",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/04/ttg2010040583",
"title": "Isodiamond Hierarchies: An Efficient Multiresolution Representation for Isosurfaces and Interval Volumes",
"doi": null,
"abstractUrl": "/journal/tg/2010/04/ttg2010040583/13rRUNvgz4c",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/06/v0683",
"title": "Adaptive Extraction of Time-Varying Isosurfaces",
"doi": null,
"abstractUrl": "/journal/tg/2004/06/v0683/13rRUxZRbnS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/01/v0029",
"title": "Selective Refinement Queries for Volume Visualization of Unstructured Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2004/01/v0029/13rRUyY28Yi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061595",
"articleId": "13rRUwInvf0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061611",
"articleId": "13rRUxcbnH6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.