data
dict |
|---|
{
"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": "13rRUyueghe",
"doi": "10.1109/TVCG.2017.2744118",
"abstract": "In this paper, we present story curves, a visualization technique for exploring and communicating nonlinear narratives in movies. A nonlinear narrative is a storytelling device that portrays events of a story out of chronological order, e.g., in reverse order or going back and forth between past and future events. Many acclaimed movies employ unique narrative patterns which in turn have inspired other movies and contributed to the broader analysis of narrative patterns in movies. However, understanding and communicating nonlinear narratives is a difficult task due to complex temporal disruptions in the order of events as well as no explicit records specifying the actual temporal order of the underlying story. Story curves visualize the nonlinear narrative of a movie by showing the order in which events are told in the movie and comparing them to their actual chronological order, resulting in possibly meandering visual patterns in the curve. We also present Story Explorer, an interactive tool that visualizes a story curve together with complementary information such as characters and settings. Story Explorer further provides a script curation interface that allows users to specify the chronological order of events in movies. We used Story Explorer to analyze 10 popular nonlinear movies and describe the spectrum of narrative patterns that we discovered, including some novel patterns not previously described in the literature. Feedback from experts highlights potential use cases in screenplay writing and analysis, education and film production. A controlled user study shows that users with no expertise are able to understand visual patterns of nonlinear narratives using story curves.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present story curves, a visualization technique for exploring and communicating nonlinear narratives in movies. A nonlinear narrative is a storytelling device that portrays events of a story out of chronological order, e.g., in reverse order or going back and forth between past and future events. Many acclaimed movies employ unique narrative patterns which in turn have inspired other movies and contributed to the broader analysis of narrative patterns in movies. However, understanding and communicating nonlinear narratives is a difficult task due to complex temporal disruptions in the order of events as well as no explicit records specifying the actual temporal order of the underlying story. Story curves visualize the nonlinear narrative of a movie by showing the order in which events are told in the movie and comparing them to their actual chronological order, resulting in possibly meandering visual patterns in the curve. We also present Story Explorer, an interactive tool that visualizes a story curve together with complementary information such as characters and settings. Story Explorer further provides a script curation interface that allows users to specify the chronological order of events in movies. We used Story Explorer to analyze 10 popular nonlinear movies and describe the spectrum of narrative patterns that we discovered, including some novel patterns not previously described in the literature. Feedback from experts highlights potential use cases in screenplay writing and analysis, education and film production. A controlled user study shows that users with no expertise are able to understand visual patterns of nonlinear narratives using story curves.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present story curves, a visualization technique for exploring and communicating nonlinear narratives in movies. A nonlinear narrative is a storytelling device that portrays events of a story out of chronological order, e.g., in reverse order or going back and forth between past and future events. Many acclaimed movies employ unique narrative patterns which in turn have inspired other movies and contributed to the broader analysis of narrative patterns in movies. However, understanding and communicating nonlinear narratives is a difficult task due to complex temporal disruptions in the order of events as well as no explicit records specifying the actual temporal order of the underlying story. Story curves visualize the nonlinear narrative of a movie by showing the order in which events are told in the movie and comparing them to their actual chronological order, resulting in possibly meandering visual patterns in the curve. We also present Story Explorer, an interactive tool that visualizes a story curve together with complementary information such as characters and settings. Story Explorer further provides a script curation interface that allows users to specify the chronological order of events in movies. We used Story Explorer to analyze 10 popular nonlinear movies and describe the spectrum of narrative patterns that we discovered, including some novel patterns not previously described in the literature. Feedback from experts highlights potential use cases in screenplay writing and analysis, education and film production. A controlled user study shows that users with no expertise are able to understand visual patterns of nonlinear narratives using story curves.",
"title": "Visualizing Nonlinear Narratives with Story Curves",
"normalizedTitle": "Visualizing Nonlinear Narratives with Story Curves",
"fno": "08017584",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Visualization",
"Motion Pictures",
"Metadata",
"Tools",
"Writing",
"Production",
"Games",
"Nonlinear Narrative",
"Storytelling",
"Visualization"
],
"authors": [
{
"givenName": "Nam Wook",
"surname": "Kim",
"fullName": "Nam Wook Kim",
"affiliation": "John A. Paulson School of Engineering and Applied SciencesHarvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benjamin",
"surname": "Bach",
"fullName": "Benjamin Bach",
"affiliation": "John A. Paulson School of Engineering and Applied SciencesHarvard University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hyejin",
"surname": "Im",
"fullName": "Hyejin Im",
"affiliation": "Independent scholar",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sasha",
"surname": "Schriber",
"fullName": "Sasha Schriber",
"affiliation": "Disney Research, Zürich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Markus",
"surname": "Gross",
"fullName": "Markus Gross",
"affiliation": "Disney Research, Zürich",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "John A. Paulson School of Engineering and Applied SciencesHarvard University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "595-604",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vs-games/2016/2722/0/07590383",
"title": "Yoway: Coupling Narrative Structure with Physical Exploration in Multi-Linear Locative Narratives",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2016/07590383/12OmNqN6R42",
"parentPublication": {
"id": "proceedings/vs-games/2016/2722/0",
"title": "2016 8th International Conference on Games and Virtual Worlds for Serious Applications (VS-Games)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cicn/2014/6929/0/6929a697",
"title": "Design of an Automatic Cartoon Movie Builder (ACMB) System for Generation of a Cartoon Movie from a Given Story",
"doi": null,
"abstractUrl": "/proceedings-article/cicn/2014/6929a697/12OmNvjyxQU",
"parentPublication": {
"id": "proceedings/cicn/2014/6929/0",
"title": "2014 International Conference on Computational Intelligence and Communication Networks (CICN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2016/4470/0/4470a572",
"title": "A Basic Study on Spoiler Detection from Review Comments Using Story Documents",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2016/4470a572/12OmNvzJG7J",
"parentPublication": {
"id": "proceedings/wi/2016/4470/0",
"title": "2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2016/4470/0/4470a057",
"title": "Context-Based Plot Detection from Online Review Comments for Preventing Spoilers",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2016/4470a057/12OmNxj23iH",
"parentPublication": {
"id": "proceedings/wi/2016/4470/0",
"title": "2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2009/4800/0/05349550",
"title": "Evaluation of a computational model of surprise arousal in narratives",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2009/05349550/12OmNxw5BmS",
"parentPublication": {
"id": "proceedings/acii/2009/4800/0",
"title": "2009 3rd International Conference on Affective Computing and Intelligent Interaction and Workshops (ACII 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/Ismar-mashd/2014/6887/0/06935436",
"title": "nARratives of augmented worlds",
"doi": null,
"abstractUrl": "/proceedings-article/Ismar-mashd/2014/06935436/12OmNzw8j8Y",
"parentPublication": {
"id": "proceedings/Ismar-mashd/2014/6887/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality - Media, Art, Social Science, Humanities and Design (ISMAR-MASH'D)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/03/mcg2006030023",
"title": "From Linear Story Generation to Branching Story Graphs",
"doi": null,
"abstractUrl": "/magazine/cg/2006/03/mcg2006030023/13rRUwInv91",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797899",
"title": "A VR Interactive Story Using POV and Flashback for Empathy",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797899/1cJ12bET8XK",
"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/iccv/2019/4803/0/480300e591",
"title": "A Graph-Based Framework to Bridge Movies and Synopses",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300e591/1hVlJrW8LXW",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gi/2021/4466/0/446600a039",
"title": "(Genetically) Improving Novelty in Procedural Story Generation",
"doi": null,
"abstractUrl": "/proceedings-article/gi/2021/446600a039/1v2QLKRKBiM",
"parentPublication": {
"id": "proceedings/gi/2021/4466/0",
"title": "2021 IEEE/ACM International Workshop on Genetic Improvement (GI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08022891",
"articleId": "13rRUwbaqLz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08017621",
"articleId": "13rRUxD9gXN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYet1h",
"name": "ttg201801-08017584s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201801-08017584s1.zip",
"extension": "zip",
"size": "19.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqG0SSe",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1MDGmTM8oOA",
"doi": "10.1109/MCG.2023.3269850",
"abstract": "The emerging practice of data-driven storytelling is framing data using familiar narrative mechanisms such as slideshows, videos, and comics to make even highly complex phenomena understandable. In this survey, we propose a taxonomy focused specifically on media types for the purpose of widening the purview of data-driven storytelling by putting more tools into the hands of designers. The classification shows that current data-driven storytelling practice does not yet leverage the full repertoire of media that can be used for storytelling, such as the spoken word, e-learning, and video games. Using our taxonomy as a generative tool, we also explore three novel storytelling mechanisms, including for live-streaming, gesture-driven oral presentations, and data-driven comics.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The emerging practice of data-driven storytelling is framing data using familiar narrative mechanisms such as slideshows, videos, and comics to make even highly complex phenomena understandable. In this survey, we propose a taxonomy focused specifically on media types for the purpose of widening the purview of data-driven storytelling by putting more tools into the hands of designers. The classification shows that current data-driven storytelling practice does not yet leverage the full repertoire of media that can be used for storytelling, such as the spoken word, e-learning, and video games. Using our taxonomy as a generative tool, we also explore three novel storytelling mechanisms, including for live-streaming, gesture-driven oral presentations, and data-driven comics.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The emerging practice of data-driven storytelling is framing data using familiar narrative mechanisms such as slideshows, videos, and comics to make even highly complex phenomena understandable. In this survey, we propose a taxonomy focused specifically on media types for the purpose of widening the purview of data-driven storytelling by putting more tools into the hands of designers. The classification shows that current data-driven storytelling practice does not yet leverage the full repertoire of media that can be used for storytelling, such as the spoken word, e-learning, and video games. Using our taxonomy as a generative tool, we also explore three novel storytelling mechanisms, including for live-streaming, gesture-driven oral presentations, and data-driven comics.",
"title": "The Stories We Tell About Data: Surveying Data-Driven Storytelling Using Visualization",
"normalizedTitle": "The Stories We Tell About Data: Surveying Data-Driven Storytelling Using Visualization",
"fno": "10107759",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Visualization",
"Media",
"Visualization",
"Taxonomy",
"Video Games",
"Source Coding",
"Electronic Learning"
],
"authors": [
{
"givenName": "Zhenpeng",
"surname": "Zhao",
"fullName": "Zhenpeng Zhao",
"affiliation": "Apple, Inc., USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "University of Maryland, College Park, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "mags",
"pages": "1-14",
"year": "5555",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2012/4711/0/4711a806",
"title": "Automatic Video Editing for Video-Based Interactive Storytelling",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2012/4711a806/12OmNs0TKI5",
"parentPublication": {
"id": "proceedings/icme/2012/4711/0",
"title": "2012 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031599",
"title": "ChartAccent: Annotation for data-driven storytelling",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031599/12OmNxEjY7F",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2014/4103/0/4103a018",
"title": "How to Tell Stories Using Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a018/12OmNynJMVN",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2012/4687/0/4687a893",
"title": "Using Emotions to Improve Role Taking in Storytelling Complex Learning Objects",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2012/4687a893/12OmNyugyN9",
"parentPublication": {
"id": "proceedings/cisis/2012/4687/0",
"title": "2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2014/02/mso2014020018",
"title": "The Stories We Tell Ourselves",
"doi": null,
"abstractUrl": "/magazine/so/2014/02/mso2014020018/13rRUxCRFUw",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2018/7202/0/720200a390",
"title": "Storytelling Canvas: A Visual Framework for Developing and Delivering Resonating Stories",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2018/720200a390/17D45We0UCY",
"parentPublication": {
"id": "proceedings/iv/2018/7202/0",
"title": "2018 22nd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/09695173",
"title": "Roslingifier: Semi-Automated Storytelling for Animated Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09695173/1AvqJqAJOKY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222309",
"title": "What Makes a Data-GIF Understandable?",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222309/1nTrlyUVXk4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a151",
"title": "Narrative Transitions in Data Videos",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a151/1qRNOUZefuw",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09547737",
"title": "ChartStory: Automated Partitioning, Layout, and Captioning of Charts into Comic-Style Narratives",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09547737/1x9TL0bvSlq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10093949",
"articleId": "1M80M7nF2Mg",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04X",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1Lk2C6ZD2zC",
"doi": "10.1109/TPAMI.2023.3253243",
"abstract": "We present Free-HeadGAN, a person-generic neural talking head synthesis system. We show that modeling faces with sparse 3D facial landmarks is sufficient for achieving state-of-the-art generative performance, without relying on strong statistical priors of the face, such as 3D Morphable Models. Apart from 3D pose and facial expressions, our method is capable of fully transferring the eye gaze, from a driving actor to a source identity. Our complete pipeline consists of three components: a canonical 3D key-point estimator that regresses 3D pose and expression-related deformations, a gaze estimation network and a generator that is built upon the architecture of HeadGAN. We further experiment with an extension of our generator to accommodate few-shot learning using an attention mechanism, in case multiple source images are available. Compared to recent methods for reenactment and motion transfer, our system achieves higher photo-realism combined with superior identity preservation, while offering explicit gaze control.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present Free-HeadGAN, a person-generic neural talking head synthesis system. We show that modeling faces with sparse 3D facial landmarks is sufficient for achieving state-of-the-art generative performance, without relying on strong statistical priors of the face, such as 3D Morphable Models. Apart from 3D pose and facial expressions, our method is capable of fully transferring the eye gaze, from a driving actor to a source identity. Our complete pipeline consists of three components: a canonical 3D key-point estimator that regresses 3D pose and expression-related deformations, a gaze estimation network and a generator that is built upon the architecture of HeadGAN. We further experiment with an extension of our generator to accommodate few-shot learning using an attention mechanism, in case multiple source images are available. Compared to recent methods for reenactment and motion transfer, our system achieves higher photo-realism combined with superior identity preservation, while offering explicit gaze control.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present Free-HeadGAN, a person-generic neural talking head synthesis system. We show that modeling faces with sparse 3D facial landmarks is sufficient for achieving state-of-the-art generative performance, without relying on strong statistical priors of the face, such as 3D Morphable Models. Apart from 3D pose and facial expressions, our method is capable of fully transferring the eye gaze, from a driving actor to a source identity. Our complete pipeline consists of three components: a canonical 3D key-point estimator that regresses 3D pose and expression-related deformations, a gaze estimation network and a generator that is built upon the architecture of HeadGAN. We further experiment with an extension of our generator to accommodate few-shot learning using an attention mechanism, in case multiple source images are available. Compared to recent methods for reenactment and motion transfer, our system achieves higher photo-realism combined with superior identity preservation, while offering explicit gaze control.",
"title": "Free-HeadGAN: Neural Talking Head Synthesis with Explicit Gaze Control",
"normalizedTitle": "Free-HeadGAN: Neural Talking Head Synthesis with Explicit Gaze Control",
"fno": "10061572",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Three Dimensional Displays",
"Faces",
"Head",
"Solid Modeling",
"Videos",
"Magnetic Heads",
"Optical Imaging",
"Reenactment",
"Neural Talking Head Synthesis",
"Canonical 3 D Key Points",
"Gaze Estimation",
"Pose Editing",
"Gaze Redirection"
],
"authors": [
{
"givenName": "Michail Christos",
"surname": "Doukas",
"fullName": "Michail Christos Doukas",
"affiliation": "Department of Computing, Imperial College London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Evangelos",
"surname": "Ververas",
"fullName": "Evangelos Ververas",
"affiliation": "Department of Computing, Imperial College London, London, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Viktoriia",
"surname": "Sharmanska",
"fullName": "Viktoriia Sharmanska",
"affiliation": "Department of Computing, University of Sussex, Brighton, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefanos",
"surname": "Zafeiriou",
"fullName": "Stefanos Zafeiriou",
"affiliation": "Department of Computing, Imperial College London, London, U.K.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/fg/2008/2153/0/04813466",
"title": "A fast and robust 3D head pose and gaze estimation system",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2008/04813466/12OmNBqv2dy",
"parentPublication": {
"id": "proceedings/fg/2008/2153/0",
"title": "2008 8th IEEE International Conference on Automatic Face & Gesture Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2018/2335/0/233501a535",
"title": "Semi-Supervised Learning for Monocular Gaze Redirection",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2018/233501a535/12OmNy3Agnw",
"parentPublication": {
"id": "proceedings/fg/2018/2335/0",
"title": "2018 13th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2018)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209b869",
"title": "Appearance-Based Gaze Tracking with Free Head Movement",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209b869/12OmNyo1nKa",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacvw/2017/4941/0/07912208",
"title": "Gaze Estimation Based on Eyeball-Head Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/wacvw/2017/07912208/12OmNzWfoVQ",
"parentPublication": {
"id": "proceedings/wacvw/2017/4941/0",
"title": "2017 IEEE Winter Applications of Computer Vision Workshops (WACVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2015/1986/0/1986a176",
"title": "Mobile 3D Gaze Tracking Calibration",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2015/1986a176/12OmNzzxusS",
"parentPublication": {
"id": "proceedings/crv/2015/1986/0",
"title": "2015 12th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545766",
"title": "Recognition of Infants' Gaze Behaviors and Emotions",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545766/17D45WB0qdg",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000c237",
"title": "Light-Weight Head Pose Invariant Gaze Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000c237/17D45WXIkI8",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/01/08122058",
"title": "MPIIGaze: Real-World Dataset and Deep Appearance-Based Gaze Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2019/01/08122058/17D45WZZ7E5",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2020/3079/0/307900a327",
"title": "ReenactNet: Real-time Full Head Reenactment",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a327/1kecI9LUOWs",
"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/fg/2020/3079/0/307900a786",
"title": "Generative Video Face Reenactment by AUs and Gaze Regularization",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a786/1kecIXW5F9m",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "10061274",
"articleId": "1LiKLv9e0Ba",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10064171",
"articleId": "1LlCTJPbAek",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1LlCU3RkfqE",
"name": "ttp555501-010061572s1-supp2-3253243.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp555501-010061572s1-supp2-3253243.mp4",
"extension": "mp4",
"size": "17.1 MB",
"__typename": "WebExtraType"
},
{
"id": "1LlCU9meuE8",
"name": "ttp555501-010061572s1-supp1-3253243.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp555501-010061572s1-supp1-3253243.pdf",
"extension": "pdf",
"size": "13.9 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCeK2lP",
"title": "April",
"year": "2005",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "27",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuegi6",
"doi": "10.1109/TPAMI.2005.82",
"abstract": "Several techniques have been developed for recovering reflectance properties of real surfaces under unknown illumination. However, in most cases, those techniques assume that the light sources are located at inifinity, which cannot be applied safely to, for example, reflectance modeling of indoor environments. In this paper, we propose two types of methods to estimate the surface reflectance property of an object, as well as the position of a light source from a single view without the distant illumination assumption, thus relaxing the conditions in the previous methods. Given a real image and a 3D geometric model of an object with specular reflection as inputs, the first method estimates the light source position by fitting to the Lambertian diffuse component, while separating the specular and diffuse components by using an iterative relaxation scheme. Our second method extends that first method by using as input a specular component image, which is acquired by analyzing multiple polarization images taken from a single view, thus removing its constraints on the diffuse reflectance property. This method simultaneously recovers the reflectance properties and the light source positions by optimizing the linearity of a log-transformed Torrance-Sparrow model. By estimating the object's reflectance property and the light source position, we can freely generate synthetic images of the target object under arbitrary lighting conditions with not only source direction modification but also source-surface distance modification. Experimental results show the accuracy of our estimation framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Several techniques have been developed for recovering reflectance properties of real surfaces under unknown illumination. However, in most cases, those techniques assume that the light sources are located at inifinity, which cannot be applied safely to, for example, reflectance modeling of indoor environments. In this paper, we propose two types of methods to estimate the surface reflectance property of an object, as well as the position of a light source from a single view without the distant illumination assumption, thus relaxing the conditions in the previous methods. Given a real image and a 3D geometric model of an object with specular reflection as inputs, the first method estimates the light source position by fitting to the Lambertian diffuse component, while separating the specular and diffuse components by using an iterative relaxation scheme. Our second method extends that first method by using as input a specular component image, which is acquired by analyzing multiple polarization images taken from a single view, thus removing its constraints on the diffuse reflectance property. This method simultaneously recovers the reflectance properties and the light source positions by optimizing the linearity of a log-transformed Torrance-Sparrow model. By estimating the object's reflectance property and the light source position, we can freely generate synthetic images of the target object under arbitrary lighting conditions with not only source direction modification but also source-surface distance modification. Experimental results show the accuracy of our estimation framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Several techniques have been developed for recovering reflectance properties of real surfaces under unknown illumination. However, in most cases, those techniques assume that the light sources are located at inifinity, which cannot be applied safely to, for example, reflectance modeling of indoor environments. In this paper, we propose two types of methods to estimate the surface reflectance property of an object, as well as the position of a light source from a single view without the distant illumination assumption, thus relaxing the conditions in the previous methods. Given a real image and a 3D geometric model of an object with specular reflection as inputs, the first method estimates the light source position by fitting to the Lambertian diffuse component, while separating the specular and diffuse components by using an iterative relaxation scheme. Our second method extends that first method by using as input a specular component image, which is acquired by analyzing multiple polarization images taken from a single view, thus removing its constraints on the diffuse reflectance property. This method simultaneously recovers the reflectance properties and the light source positions by optimizing the linearity of a log-transformed Torrance-Sparrow model. By estimating the object's reflectance property and the light source position, we can freely generate synthetic images of the target object under arbitrary lighting conditions with not only source direction modification but also source-surface distance modification. Experimental results show the accuracy of our estimation framework.",
"title": "Light Source Position and Reflectance Estimation from a Single View without the Distant Illumination Assumption",
"normalizedTitle": "Light Source Position and Reflectance Estimation from a Single View without the Distant Illumination Assumption",
"fno": "i0493",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Finite Distance Illumination",
"Light Source Position Estimation",
"Reflectance Parameter Estimation",
"Specular Reflectance"
],
"authors": [
{
"givenName": "Kenji",
"surname": "Hara",
"fullName": "Kenji Hara",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ko",
"surname": "Nishino",
"fullName": "Ko Nishino",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Katsushi",
"surname": "Ikeuchi",
"fullName": "Katsushi Ikeuchi",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2005-04-01 00:00:00",
"pubType": "trans",
"pages": "493-505",
"year": "2005",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dmamh/2007/3065/0/30650106",
"title": "Reflectance and Light Source Position Estimation from a Sparse Set of Images",
"doi": null,
"abstractUrl": "/proceedings-article/dmamh/2007/30650106/12OmNAnuTBT",
"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/cgiv/2006/2606/0/26060335",
"title": "Estimating Reflectance Parameters of an Object from Saturated Spectral Images",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2006/26060335/12OmNBkfRhp",
"parentPublication": {
"id": "proceedings/cgiv/2006/2606/0",
"title": "International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/2/212820895",
"title": "Dense Estimation of Surface Reflectance Properties Based on Inverse Global Illumination Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212820895/12OmNCcbE8h",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/2/73102354",
"title": "3-D shape recovery of hybrid reflectance surface using indirect diffuse illumination",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73102354/12OmNCyTysb",
"parentPublication": {
"id": "proceedings/icip/1995/7310/2",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2003/1950/1/195010560",
"title": "Determining Reflectance and Light Position from a Single Image Without Distant Illumination Assumption",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2003/195010560/12OmNrIrPgc",
"parentPublication": {
"id": "proceedings/iccv/2003/1950/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismarw/2016/3740/0/07836506",
"title": "Reflectance and Illumination Estimation for Realistic Augmentations of Real Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/ismarw/2016/07836506/12OmNx5GTXK",
"parentPublication": {
"id": "proceedings/ismarw/2016/3740/0",
"title": "2016 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/3/81833416",
"title": "Shape Recovery of Hybrid Reflectance Surface using Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81833416/12OmNx5GUaz",
"parentPublication": {
"id": "proceedings/icip/1997/8183/3",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2014/2871/0/06802072",
"title": "Reflectance and light source estimation for indoor AR Applications",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802072/12OmNya72rc",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995510",
"title": "Shape estimation in natural illumination",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995510/12OmNzBOhHu",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1991/11/i1139",
"title": "Determining Reflectance Properties of an Object Using Range and Brightness Images",
"doi": null,
"abstractUrl": "/journal/tp/1991/11/i1139/13rRUyfKIEd",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "i0482",
"articleId": "13rRUxNW1UQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0506",
"articleId": "13rRUxjQycQ",
"__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": "1LRbRR2niSs",
"doi": "10.1109/TVCG.2023.3261872",
"abstract": "We present a novel framework to efficiently acquire anisotropic reflectance in a pixel-independent fashion, using a deep gated mixture-of-experts. While existing work employs a unified network to handle all possible input, our network automatically learns to condition on the input for enhanced reconstruction. We train a gating module that takes photometric measurements as input and selects one out of a number of specialized decoders for reflectance reconstruction, essentially trading generality for quality. A common pre-trained latent-transform module is also appended to each decoder, to offset the burden of the increased number of decoders. In addition, the illumination conditions during acquisition can be jointly optimized. The effectiveness of our framework is validated on a wide variety of challenging near-planar samples with a lightstage. Compared with the state-of-the-art technique, our quality is improved with the same number of input images, and our input image number can be reduced to about 1/3 for equal-quality results. We further generalize the framework to enhance a state-of-the-art technique on non-planar reflectance scanning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel framework to efficiently acquire anisotropic reflectance in a pixel-independent fashion, using a deep gated mixture-of-experts. While existing work employs a unified network to handle all possible input, our network automatically learns to condition on the input for enhanced reconstruction. We train a gating module that takes photometric measurements as input and selects one out of a number of specialized decoders for reflectance reconstruction, essentially trading generality for quality. A common pre-trained latent-transform module is also appended to each decoder, to offset the burden of the increased number of decoders. In addition, the illumination conditions during acquisition can be jointly optimized. The effectiveness of our framework is validated on a wide variety of challenging near-planar samples with a lightstage. Compared with the state-of-the-art technique, our quality is improved with the same number of input images, and our input image number can be reduced to about 1/3 for equal-quality results. We further generalize the framework to enhance a state-of-the-art technique on non-planar reflectance scanning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel framework to efficiently acquire anisotropic reflectance in a pixel-independent fashion, using a deep gated mixture-of-experts. While existing work employs a unified network to handle all possible input, our network automatically learns to condition on the input for enhanced reconstruction. We train a gating module that takes photometric measurements as input and selects one out of a number of specialized decoders for reflectance reconstruction, essentially trading generality for quality. A common pre-trained latent-transform module is also appended to each decoder, to offset the burden of the increased number of decoders. In addition, the illumination conditions during acquisition can be jointly optimized. The effectiveness of our framework is validated on a wide variety of challenging near-planar samples with a lightstage. Compared with the state-of-the-art technique, our quality is improved with the same number of input images, and our input image number can be reduced to about 1/3 for equal-quality results. We further generalize the framework to enhance a state-of-the-art technique on non-planar reflectance scanning.",
"title": "Efficient Reflectance Capture With a Deep Gated Mixture-of-Experts",
"normalizedTitle": "Efficient Reflectance Capture With a Deep Gated Mixture-of-Experts",
"fno": "10081427",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Lighting",
"Image Reconstruction",
"Decoding",
"Optimization",
"Light Emitting Diodes",
"Cameras",
"Neural Networks",
"Anisotropic Reflectance",
"Computational Illumination",
"SVBRDF"
],
"authors": [
{
"givenName": "Xiaohe",
"surname": "Ma",
"fullName": "Xiaohe Ma",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yaxin",
"surname": "Yu",
"fullName": "Yaxin Yu",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongzhi",
"surname": "Wu",
"fullName": "Hongzhi Wu",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kun",
"surname": "Zhou",
"fullName": "Kun Zhou",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-03-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/wacv/2013/5053/0/06475040",
"title": "A full-spherical device for simultaneous geometry and reflectance acquisition",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2013/06475040/12OmNBSSV8O",
"parentPublication": {
"id": "proceedings/wacv/2013/5053/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2013/3211/0/3211a441",
"title": "An LED-Based Spectral Imaging System for Surface Reflectance and Normal Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2013/3211a441/12OmNroijaF",
"parentPublication": {
"id": "proceedings/sitis/2013/3211/0",
"title": "2013 International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2015/8667/0/07168375",
"title": "Single-Shot Reflectance Measurement from Polarized Color Gradient Illumination",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2015/07168375/12OmNxWLTsI",
"parentPublication": {
"id": "proceedings/iccp/2015/8667/0",
"title": "2015 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032f372",
"title": "Reflectance Capture Using Univariate Sampling of BRDFs",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032f372/12OmNz6iOHS",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/04/07383338",
"title": "Inter-reflection Compensation of Immersive Projection Display by Spatio-Temporal Screen Reflectance Modulation",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07383338/13rRUwInvfc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/01/ttp2014010086",
"title": "Discriminative Illumination: Per-Pixel Classification of Raw Materials Based on Optimal Projections of Spectral BRDF",
"doi": null,
"abstractUrl": "/journal/tp/2014/01/ttp2014010086/13rRUwdIOW1",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2018/1360/0/136000a147",
"title": "Flexible Computer Simulation for Power Loss Analysis of Direct AC LED Drive Systems",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2018/136000a147/1gjRoolUnvi",
"parentPublication": {
"id": "proceedings/csci/2018/1360/0",
"title": "2018 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093491",
"title": "Inferring Super-Resolution Depth from a Moving Light-Source Enhanced RGB-D Sensor: A Variational Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093491/1jPbFHPBYnm",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2021/1952/0/09466267",
"title": "Spectral MVIR: Joint Reconstruction of 3D Shape and Spectral Reflectance",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2021/09466267/1uSSWr7wnkY",
"parentPublication": {
"id": "proceedings/iccp/2021/1952/0",
"title": "2021 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09557800",
"title": "Neural Reflectance Capture in the View-Illumination Domain",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09557800/1xquQN6emfS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10081398",
"articleId": "1LRbRjcZeLK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10081386",
"articleId": "1LRbSaS1ClW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1LSKDegd1i8",
"name": "ttg555501-010081427s1-supp1-3261872.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010081427s1-supp1-3261872.mp4",
"extension": "mp4",
"size": "65.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1IKDeaftuUM",
"doi": "10.1109/TVCG.2022.3225526",
"abstract": "Volumetric data abounds in medical imaging and other fields. With the improved imaging quality and the increased resolution, volumetric datasets are getting so large that the existing tools have become inadequate for processing and analyzing the data. Here we consider the problem of computing tetrahedral meshes to represent large volumetric datasets with labeled multiple materials, which are often encountered in medical imaging or microscopy optical slice tomography. Such tetrahedral meshes are a more compact and expressive geometric representation so are in demand for efficient visualization and simulation of the data, which are impossible if the original large volumetric data are used directly due to the large memory requirement. Existing methods for meshing volumetric data are not scalable for handling large datasets due to their sheer demand on excessively large run-time memory or failure to produce a tet-mesh that preserves the multi-material structure of the original volumetric data. In this paper we propose a novel approach, called <italic>Marching Windows</italic>, that uses a moving window and a disk-swap strategy to reduce the run-time memory footprint, devise a new scheme that guarantees to preserve the topological structure of the original dataset, and adopt an error-guided optimization technique to improve both geometric approximation error and mesh quality. Extensive experiments show that our method is capable of processing very large volumetric datasets beyond the capability of the existing methods and producing tetrahedral meshes of high quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Volumetric data abounds in medical imaging and other fields. With the improved imaging quality and the increased resolution, volumetric datasets are getting so large that the existing tools have become inadequate for processing and analyzing the data. Here we consider the problem of computing tetrahedral meshes to represent large volumetric datasets with labeled multiple materials, which are often encountered in medical imaging or microscopy optical slice tomography. Such tetrahedral meshes are a more compact and expressive geometric representation so are in demand for efficient visualization and simulation of the data, which are impossible if the original large volumetric data are used directly due to the large memory requirement. Existing methods for meshing volumetric data are not scalable for handling large datasets due to their sheer demand on excessively large run-time memory or failure to produce a tet-mesh that preserves the multi-material structure of the original volumetric data. In this paper we propose a novel approach, called <italic>Marching Windows</italic>, that uses a moving window and a disk-swap strategy to reduce the run-time memory footprint, devise a new scheme that guarantees to preserve the topological structure of the original dataset, and adopt an error-guided optimization technique to improve both geometric approximation error and mesh quality. Extensive experiments show that our method is capable of processing very large volumetric datasets beyond the capability of the existing methods and producing tetrahedral meshes of high quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Volumetric data abounds in medical imaging and other fields. With the improved imaging quality and the increased resolution, volumetric datasets are getting so large that the existing tools have become inadequate for processing and analyzing the data. Here we consider the problem of computing tetrahedral meshes to represent large volumetric datasets with labeled multiple materials, which are often encountered in medical imaging or microscopy optical slice tomography. Such tetrahedral meshes are a more compact and expressive geometric representation so are in demand for efficient visualization and simulation of the data, which are impossible if the original large volumetric data are used directly due to the large memory requirement. Existing methods for meshing volumetric data are not scalable for handling large datasets due to their sheer demand on excessively large run-time memory or failure to produce a tet-mesh that preserves the multi-material structure of the original volumetric data. In this paper we propose a novel approach, called Marching Windows, that uses a moving window and a disk-swap strategy to reduce the run-time memory footprint, devise a new scheme that guarantees to preserve the topological structure of the original dataset, and adopt an error-guided optimization technique to improve both geometric approximation error and mesh quality. Extensive experiments show that our method is capable of processing very large volumetric datasets beyond the capability of the existing methods and producing tetrahedral meshes of high quality.",
"title": "Marching Windows: Scalable Mesh Generation for Volumetric Data with Multiple Materials",
"normalizedTitle": "Marching Windows: Scalable Mesh Generation for Volumetric Data with Multiple Materials",
"fno": "09968044",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Topology",
"Mesh Generation",
"Three Dimensional Displays",
"Imaging",
"Data Visualization",
"Memory Management",
"Measurement",
"Large Volumetric Data",
"Multiple Material",
"Marching Windows",
"Mesh Simplification",
"Topology Guarantee"
],
"authors": [
{
"givenName": "Wenhua",
"surname": "Zhang",
"fullName": "Wenhua Zhang",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong SAR, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yating",
"surname": "Yue",
"fullName": "Yating Yue",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong SAR, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hao",
"surname": "Pan",
"fullName": "Hao Pan",
"affiliation": "Microsoft Research Asia, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhonggui",
"surname": "Chen",
"fullName": "Zhonggui Chen",
"affiliation": "School of Informatics, Xiamen University, Xiamen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chuan",
"surname": "Wang",
"fullName": "Chuan Wang",
"affiliation": "Department of Computer Science, The University of Hong Kong, Hong Kong SAR, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanspeter",
"surname": "Pfister",
"fullName": "Hanspeter Pfister",
"affiliation": "John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenping",
"surname": "Wang",
"fullName": "Wenping Wang",
"affiliation": "Department of Visualization, Texas A&M University, TX, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-11-01 00:00:00",
"pubType": "trans",
"pages": "1-15",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a130",
"title": "Tetrahedral Mesh Editing with Local Feature Manipulations",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a130/12OmNBTJIN5",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2008/3494/2/3494b414",
"title": "A Tetrahedral Mesh Generation Algorithm from Medical Images",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494b414/12OmNBUS7cC",
"parentPublication": {
"id": "proceedings/isise/2008/3494/2",
"title": "2008 International Symposium on Information Science and Engineering (ISISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icycs/2008/3398/0/3398a925",
"title": "Generation of Three-Dimensional Finite Element Meshes from CT Dataset of Human Femurs",
"doi": null,
"abstractUrl": "/proceedings-article/icycs/2008/3398a925/12OmNCdBDEg",
"parentPublication": {
"id": "proceedings/icycs/2008/3398/0",
"title": "2008 9th International Conference for Young Computer Scientists",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2017/1710/0/1710a085",
"title": "A Differential Geometry Approach for Change Detection in Medical Images",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2017/1710a085/12OmNrAMEM6",
"parentPublication": {
"id": "proceedings/cbms/2017/1710/0",
"title": "2017 IEEE 30th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620387",
"title": "The multilevel finite element method for adaptive mesh optimization and visualization of volume data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620387/12OmNrAMEQ3",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532822",
"title": "Quality mesh generation for molecular skin surfaces using restricted union of balls",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532822/12OmNvSbBIy",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdcat/2016/5081/0/07943387",
"title": "Tetrahedral Mesh Segmentation Based on Quality Criteria",
"doi": null,
"abstractUrl": "/proceedings-article/pdcat/2016/07943387/12OmNwM6A1x",
"parentPublication": {
"id": "proceedings/pdcat/2016/5081/0",
"title": "2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498chopra",
"title": "TetFusion: An Algorithm For Rapid Tetrahedral Mesh Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498chopra/12OmNyQphf1",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091539",
"title": "Surface Mesh to Volumetric Spline Conversion with Generalized Polycubes",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091539/13rRUEgarsH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/02/ttg2014020223",
"title": "Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees",
"doi": null,
"abstractUrl": "/journal/tg/2014/02/ttg2014020223/13rRUEgs2M2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09966829",
"articleId": "1IIYlkz8kkE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09968104",
"articleId": "1IKDek8SF0c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvwoNX",
"title": "July/August",
"year": "2010",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "16",
"label": "July/August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJzr",
"doi": "10.1109/TVCG.2009.10",
"abstract": "Isosurfaces are fundamental volumetric visualization tools and are generated by approximating contours of trilinearly interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follow. We present a more straightforward proof of the correctness and completeness of these cases based on a variation of the Dividing Cubes algorithm. Since this proof is based on topological arguments and a divide-and-conquer approach, this also sets the stage for developing tessellation cases for higher order interpolants and the quadrilinear interpolant in four dimensions. We also demonstrate that apart from degenerate cases, Nielson's cases are, in fact, subsets of two basic configurations of the trilinear interpolant.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Isosurfaces are fundamental volumetric visualization tools and are generated by approximating contours of trilinearly interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follow. We present a more straightforward proof of the correctness and completeness of these cases based on a variation of the Dividing Cubes algorithm. Since this proof is based on topological arguments and a divide-and-conquer approach, this also sets the stage for developing tessellation cases for higher order interpolants and the quadrilinear interpolant in four dimensions. We also demonstrate that apart from degenerate cases, Nielson's cases are, in fact, subsets of two basic configurations of the trilinear interpolant.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Isosurfaces are fundamental volumetric visualization tools and are generated by approximating contours of trilinearly interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follow. We present a more straightforward proof of the correctness and completeness of these cases based on a variation of the Dividing Cubes algorithm. Since this proof is based on topological arguments and a divide-and-conquer approach, this also sets the stage for developing tessellation cases for higher order interpolants and the quadrilinear interpolant in four dimensions. We also demonstrate that apart from degenerate cases, Nielson's cases are, in fact, subsets of two basic configurations of the trilinear interpolant.",
"title": "Subdivision Analysis of the Trilinear Interpolant",
"normalizedTitle": "Subdivision Analysis of the Trilinear Interpolant",
"fno": "ttg2010040533",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Isosurfaces",
"Marching Cubes",
"Trilinear"
],
"authors": [
{
"givenName": "Hamish",
"surname": "Carr",
"fullName": "Hamish Carr",
"affiliation": "University College Dublin, Belfield",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nelson",
"surname": "Max",
"fullName": "Nelson Max",
"affiliation": "University of California, Davis, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2010-07-01 00:00:00",
"pubType": "trans",
"pages": "533-547",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vsr/1995/7122/0/71220037",
"title": "About the correspondences of points between N image",
"doi": null,
"abstractUrl": "/proceedings-article/vsr/1995/71220037/12OmNAYGln7",
"parentPublication": {
"id": "proceedings/vsr/1995/7122/0",
"title": "Representation of Visual Scenes, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498weber",
"title": "Exploring Scalar Fields Using Critical Isovalues",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498weber/12OmNAYXWzS",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/ieee-vis/2002/7498/0/7498pascucci",
"title": "Efficient Computation of the Topology of Level Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498pascucci/12OmNvkpl7Y",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300073",
"title": "Visualization of Steep Breaking Waves and Thin Spray Sheets Around a Ship",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300073/12OmNxw5Bqf",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__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/tp/2007/01/i0126",
"title": "Topological Equivalence between a 3D Object and the Reconstruction of Its Digital Image",
"doi": null,
"abstractUrl": "/journal/tp/2007/01/i0126/13rRUxcKzWk",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__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/2022/12/09409737",
"title": "Identification and Classification of Off-Vertex Critical Points for Contour Tree Construction on Unstructured Meshes of Hexahedra",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09409737/1sXjFxDTLAQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010040529",
"articleId": "13rRUwfI0Q4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010040548",
"articleId": "13rRUy0HYRk",
"__typename": "AdjacentArticleType"
},
"__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": "13rRUNvyaeV",
"doi": "10.1109/TVCG.2009.212",
"abstract": "Physics-based particle systems are an effective tool for shape modeling. Also, there has been much interest in the study of shape modeling using deformable contour approaches. In this paper, we describe a new deformable model with electric flows based upon computer simulations of a number of charged particles embedded in an electrostatic system. Making use of optimized numerical techniques, the electric potential associated with the electric field in the simulated system is rapidly calculated using the finite-size particle (FSP) method. The simulation of deformation evolves based upon the vector sum of two interacting forces: one from the electric fields and the other from the image gradients. Inspired by the concept of the signed distance function associated with the entropy condition in the level set framework, we efficiently handle topological changes at the interface. In addition to automatic splitting and merging, the evolving contours enable simultaneous detection of various objects with varying intensity gradients at both interior and exterior boundaries. This electric flows approach for shape modeling allows one to connect electric properties in electrostatic equilibrium and classical active contours based upon the theory of curve evolution. Our active contours can be applied to model arbitrarily complicated objects including shapes with sharp corners and cusps, and to situations where no a priori knowledge about the object's topology and geometry is made. We demonstrate the capabilities of this new algorithm in recovering a wide variety of structures on simulated and real images in both 2D and 3D.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Physics-based particle systems are an effective tool for shape modeling. Also, there has been much interest in the study of shape modeling using deformable contour approaches. In this paper, we describe a new deformable model with electric flows based upon computer simulations of a number of charged particles embedded in an electrostatic system. Making use of optimized numerical techniques, the electric potential associated with the electric field in the simulated system is rapidly calculated using the finite-size particle (FSP) method. The simulation of deformation evolves based upon the vector sum of two interacting forces: one from the electric fields and the other from the image gradients. Inspired by the concept of the signed distance function associated with the entropy condition in the level set framework, we efficiently handle topological changes at the interface. In addition to automatic splitting and merging, the evolving contours enable simultaneous detection of various objects with varying intensity gradients at both interior and exterior boundaries. This electric flows approach for shape modeling allows one to connect electric properties in electrostatic equilibrium and classical active contours based upon the theory of curve evolution. Our active contours can be applied to model arbitrarily complicated objects including shapes with sharp corners and cusps, and to situations where no a priori knowledge about the object's topology and geometry is made. We demonstrate the capabilities of this new algorithm in recovering a wide variety of structures on simulated and real images in both 2D and 3D.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Physics-based particle systems are an effective tool for shape modeling. Also, there has been much interest in the study of shape modeling using deformable contour approaches. In this paper, we describe a new deformable model with electric flows based upon computer simulations of a number of charged particles embedded in an electrostatic system. Making use of optimized numerical techniques, the electric potential associated with the electric field in the simulated system is rapidly calculated using the finite-size particle (FSP) method. The simulation of deformation evolves based upon the vector sum of two interacting forces: one from the electric fields and the other from the image gradients. Inspired by the concept of the signed distance function associated with the entropy condition in the level set framework, we efficiently handle topological changes at the interface. In addition to automatic splitting and merging, the evolving contours enable simultaneous detection of various objects with varying intensity gradients at both interior and exterior boundaries. This electric flows approach for shape modeling allows one to connect electric properties in electrostatic equilibrium and classical active contours based upon the theory of curve evolution. Our active contours can be applied to model arbitrarily complicated objects including shapes with sharp corners and cusps, and to situations where no a priori knowledge about the object's topology and geometry is made. We demonstrate the capabilities of this new algorithm in recovering a wide variety of structures on simulated and real images in both 2D and 3D.",
"title": "Active Shape Modeling with Electric Flows",
"normalizedTitle": "Active Shape Modeling with Electric Flows",
"fno": "ttg2010050854",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shape Modeling",
"Shape Recovery",
"Deformable Models",
"Particle Systems",
"Finite Size Particle FSP",
"Poissons Equation",
"Electrostatic Equilibrium"
],
"authors": [
{
"givenName": "Herng-Hua",
"surname": "Chang",
"fullName": "Herng-Hua Chang",
"affiliation": "National Taiwan University of Science and Technology, Taipei",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel J.",
"surname": "Valentino",
"fullName": "Daniel J. Valentino",
"affiliation": "iCRco, Inc, Torrance and Univesity of California, Los Angeles, Los Angeles",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Woei-Chyn",
"surname": "Chu",
"fullName": "Woei-Chyn Chu",
"affiliation": "National Yang-Ming University, Taipei",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2010-09-01 00:00:00",
"pubType": "trans",
"pages": "854-869",
"year": "2010",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isdea/2010/4212/1/4212a273",
"title": "Analysis of a Human Detection System Based on Electrostatic Detection",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2010/4212a273/12OmNAZfxF2",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdciem/2012/4639/0/4639a272",
"title": "Effect on Resistance and Airflow Distribution of Lateral Moving-electrode Type Electric Field",
"doi": null,
"abstractUrl": "/proceedings-article/cdciem/2012/4639a272/12OmNC2OSJh",
"parentPublication": {
"id": "proceedings/cdciem/2012/4639/0",
"title": "Computer Distributed Control and Intelligent Environmental Monitoring, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/1/3336a337",
"title": "A New Electrostatic Field Termination Criterion for Evolutionary Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336a337/12OmNCcbEkj",
"parentPublication": {
"id": "proceedings/csse/2008/3336/1",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdciem/2012/4639/0/4639a195",
"title": "Collection Performance of Lateral Moving-electrode Type Electric Field",
"doi": null,
"abstractUrl": "/proceedings-article/cdciem/2012/4639a195/12OmNCuVaDd",
"parentPublication": {
"id": "proceedings/cdciem/2012/4639/0",
"title": "Computer Distributed Control and Intelligent Environmental Monitoring, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/softcom/2006/1490/0/04129866",
"title": "Finite element model of the human head exposed to electrostatic field generated by Video Display Units",
"doi": null,
"abstractUrl": "/proceedings-article/softcom/2006/04129866/12OmNvjQ8V5",
"parentPublication": {
"id": "proceedings/softcom/2006/1490/0",
"title": "International Conference on Software in Telecommunications and Computer Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/1/4077b123",
"title": "Design and Application on Energy-Saving for Electrostatic Precipitation Control System",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077b123/12OmNx5YvnT",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/1",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifita/2010/7621/2/05634888",
"title": "Experimental Studies on Electric Field Characteristics for a Wider Electrode Spacing and Longer Discharge Spine Electrode Base on CAT",
"doi": null,
"abstractUrl": "/proceedings-article/ifita/2010/05634888/12OmNyKa64y",
"parentPublication": {
"id": "proceedings/ifita/2010/7621/2",
"title": "2010 International Forum on Information Technology and Applications (IFITA 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciibms/2017/6664/0/08279698",
"title": "Visualization of individual feature amount appearing in daily performance based on electrostatic induction",
"doi": null,
"abstractUrl": "/proceedings-article/iciibms/2017/08279698/12OmNyugz2I",
"parentPublication": {
"id": "proceedings/iciibms/2017/6664/0",
"title": "2017 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/2/4077c200",
"title": "Electric Field Distribution of New Polar Matching System in Wet ESP",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077c200/12OmNzG4gvR",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2004/10/i1320",
"title": "CPM: A Deformable Model for Shape Recovery and Segmentation Based on Charged Particles",
"doi": null,
"abstractUrl": "/journal/tp/2004/10/i1320/13rRUxYINgp",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2010050841",
"articleId": "13rRUxYIN43",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2010050870",
"articleId": "13rRUNvgyWj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzDvSjB",
"title": "November/December",
"year": "2007",
"issueNum": "06",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "9",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxD9h13",
"doi": "10.1109/MCSE.2007.121",
"abstract": "Shear flows and turbulence have a major impact on the transport of quantities, from heat to material to pollutants. This article explores transport and its sensitivity to novel interactions between shear flow and turbulence.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Shear flows and turbulence have a major impact on the transport of quantities, from heat to material to pollutants. This article explores transport and its sensitivity to novel interactions between shear flow and turbulence.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Shear flows and turbulence have a major impact on the transport of quantities, from heat to material to pollutants. This article explores transport and its sensitivity to novel interactions between shear flow and turbulence.",
"title": "Shear Flows and Turbulence in Nature",
"normalizedTitle": "Shear Flows and Turbulence in Nature",
"fno": "mcs2007060045",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"International Polar Year",
"Climate Change",
"Ozone Holes",
"Shear Flow",
"Turbulence"
],
"authors": [
{
"givenName": "David E.",
"surname": "Newman",
"fullName": "David E. Newman",
"affiliation": "University of Alaska, Fairbanks",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paul W.",
"surname": "Terry",
"fullName": "Paul W. Terry",
"affiliation": "University of Wisconsin-Madison",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrew S.",
"surname": "Ware",
"fullName": "Andrew S. Ware",
"affiliation": "University of Montana",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2007-11-01 00:00:00",
"pubType": "mags",
"pages": "45-52",
"year": "2007",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hpcs/2007/2813/0/28130005",
"title": "Gyrokinetic simulation of micro-turbulence in magnetically confined plasmas",
"doi": null,
"abstractUrl": "/proceedings-article/hpcs/2007/28130005/12OmNA1DMlM",
"parentPublication": {
"id": "proceedings/hpcs/2007/2813/0",
"title": "High Performance Computing Systems and Applications, Annual International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcsa/2007/2813/0/04215555",
"title": "Gyrokinetic simulation of micro-turbulence in magnetically confined plasmas",
"doi": null,
"abstractUrl": "/proceedings-article/hpcsa/2007/04215555/12OmNAIMO57",
"parentPublication": {
"id": "proceedings/hpcsa/2007/2813/0",
"title": "21st International Symposium on High Performance Computing Systems and Applications (HPCS'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2000/0592/0/05920578",
"title": "Wavelet-Based Lossy Compression of Turbulence Data",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2000/05920578/12OmNBNM8TZ",
"parentPublication": {
"id": "proceedings/dcc/2000/0592/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031b668",
"title": "Research on Digital Image Correlation Method Applied in Shear Test of New Style Automotive Structural Adhesive",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031b668/12OmNBscCTT",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iceet/2009/3819/1/3819a325",
"title": "Statistical Distribution Law of Turbulence Characteristic Parameters in Near Surface Layer of the Port District",
"doi": null,
"abstractUrl": "/proceedings-article/iceet/2009/3819a325/12OmNBtl1sk",
"parentPublication": {
"id": "proceedings/iceet/2009/3819/1",
"title": "Energy and Environment Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisp/2008/3119/5/3119e470",
"title": "Mitigation of Turbulence-Induced Scintillation Noise in Free-Space Optical Communication Links Using Kalman Filter",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119e470/12OmNwoPtwv",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/5",
"title": "International Congress on Image and Signal Processing (CISP 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200schulze",
"title": "The Perspective Shear-Warp Algorithm in a Virtual Environment",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200schulze/12OmNxT56AS",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2009/3583/2/3583b857",
"title": "Optimization Design of Shear Probe for Measurement of Ocean Turbulence",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583b857/12OmNylboHk",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/2",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/04/ttg2011040412",
"title": "Visualizing the Evolution and Interaction of Vortices and Shear Layers in Time-Dependent 3D Flow",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040412/13rRUyYSWsO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09599597",
"title": "Dynamic Mode Decomposition for Large-Scale Coherent Structure Extraction in Shear Flows",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09599597/1yeCaMmiM3S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2007060035",
"articleId": "13rRUEgs2x0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2007060053",
"articleId": "13rRUyoyhHw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvmXJ46",
"title": "March-April",
"year": "2014",
"issueNum": "02",
"idPrefix": "tb",
"pubType": "journal",
"volume": "11",
"label": "March-April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB7a1eh",
"doi": "10.1109/TCBB.2014.2309599",
"abstract": "Most phylogenetic analyses result in a sample of trees, but summarizing and visualizing these samples can be challenging. Consensus trees often provide limited information about a sample, and so methods such as consensus networks, clustering and multidimensional scaling have been developed and applied to tree samples. This paper describes a stochastic algorithm for constructing a principal geodesic or line through treespace which is analogous to the first principal component in standard principal components analysis. A principal geodesic summarizes the most variable features of a sample of trees, in terms of both tree topology and branch lengths, and it can be visualized as an animation of smoothly changing trees. The algorithm performs a stochastic search through parameter space for a geodesic which minimizes the sum of squared projected distances of the data points. This procedure aims to identify the globally optimal principal geodesic, though convergence to locally optimal geodesics is possible. The methodology is illustrated by constructing principal geodesics for experimental and simulated data sets, demonstrating the insight into samples of trees that can be gained and how the method improves on a previously published approach. A java package called GeoPhytter for constructing and visualizing principal geodesics is freely available from www.ncl.ac.uk/ ntmwn/geophytter.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most phylogenetic analyses result in a sample of trees, but summarizing and visualizing these samples can be challenging. Consensus trees often provide limited information about a sample, and so methods such as consensus networks, clustering and multidimensional scaling have been developed and applied to tree samples. This paper describes a stochastic algorithm for constructing a principal geodesic or line through treespace which is analogous to the first principal component in standard principal components analysis. A principal geodesic summarizes the most variable features of a sample of trees, in terms of both tree topology and branch lengths, and it can be visualized as an animation of smoothly changing trees. The algorithm performs a stochastic search through parameter space for a geodesic which minimizes the sum of squared projected distances of the data points. This procedure aims to identify the globally optimal principal geodesic, though convergence to locally optimal geodesics is possible. The methodology is illustrated by constructing principal geodesics for experimental and simulated data sets, demonstrating the insight into samples of trees that can be gained and how the method improves on a previously published approach. A java package called GeoPhytter for constructing and visualizing principal geodesics is freely available from www.ncl.ac.uk/ ntmwn/geophytter.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most phylogenetic analyses result in a sample of trees, but summarizing and visualizing these samples can be challenging. Consensus trees often provide limited information about a sample, and so methods such as consensus networks, clustering and multidimensional scaling have been developed and applied to tree samples. This paper describes a stochastic algorithm for constructing a principal geodesic or line through treespace which is analogous to the first principal component in standard principal components analysis. A principal geodesic summarizes the most variable features of a sample of trees, in terms of both tree topology and branch lengths, and it can be visualized as an animation of smoothly changing trees. The algorithm performs a stochastic search through parameter space for a geodesic which minimizes the sum of squared projected distances of the data points. This procedure aims to identify the globally optimal principal geodesic, though convergence to locally optimal geodesics is possible. The methodology is illustrated by constructing principal geodesics for experimental and simulated data sets, demonstrating the insight into samples of trees that can be gained and how the method improves on a previously published approach. A java package called GeoPhytter for constructing and visualizing principal geodesics is freely available from www.ncl.ac.uk/ ntmwn/geophytter.",
"title": "An Algorithm for Constructing Principal Geodesics in Phylogenetic Treespace",
"normalizedTitle": "An Algorithm for Constructing Principal Geodesics in Phylogenetic Treespace",
"fno": "06755452",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Biology Computing",
"Data Visualisation",
"Differential Geometry",
"Genetics",
"Genomics",
"Pattern Clustering",
"Principal Component Analysis",
"Stochastic Processes",
"Phylogenetic Analyses",
"Consensus Trees",
"Consensus Networks",
"Pattern Clustering",
"Multidimensional Scaling",
"Tree Samples",
"Stochastic Algorithm",
"Treespace",
"First Principal Component",
"Standard Principal Components Analysis",
"Tree Topology",
"Branch Lengths",
"Smoothly Changing Tree Animation",
"Stochastic Search",
"Parameter Space",
"Squared Projected Distances",
"Data Points",
"Globally Optimal Principal Geodesic",
"Locally Optimal Geodesics",
"Java Package",
"Geo Phytter",
"Principal Geodesics Visualization",
"Phylogeny",
"Principal Component Analysis",
"Topology",
"Computational Biology",
"Bioinformatics",
"Measurement",
"Vegetation",
"Phylogeny",
"Principal Components Analysis",
"Treespace"
],
"authors": [
{
"givenName": "Tom M.W.",
"surname": "Nye",
"fullName": "Tom M.W. Nye",
"affiliation": "School of Mathematics and Statistics, Newcastle University, Newcastle upon Tyne, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2014-03-01 00:00:00",
"pubType": "trans",
"pages": "304-315",
"year": "2014",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibe/2017/1324/0/132401a260",
"title": "Whole Genome Phylogenetic Tree Reconstruction Using Colored de Bruijn Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2017/132401a260/12OmNyq0zMR",
"parentPublication": {
"id": "proceedings/bibe/2017/1324/0",
"title": "2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cscloud/2015/9300/0/9300a042",
"title": "An Approach to Minimize Crossings in Phylogenetic Trees",
"doi": null,
"abstractUrl": "/proceedings-article/cscloud/2015/9300a042/12OmNyqRnf4",
"parentPublication": {
"id": "proceedings/cscloud/2015/9300/0",
"title": "2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing (CSCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/02/ttb2012020372",
"title": "Algorithms for Reticulate Networks of Multiple Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tb/2012/02/ttb2012020372/13rRUEgs2rV",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/02/07423752",
"title": "Autumn Algorithm—Computation of Hybridization Networks for Realistic Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tb/2018/02/07423752/13rRUIM2VAk",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/04/ttb2013041076",
"title": "Hamiltonian Walks of Phylogenetic Treespaces",
"doi": null,
"abstractUrl": "/journal/tb/2013/04/ttb2013041076/13rRUwI5Ujj",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2016/03/07172469",
"title": "Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees",
"doi": null,
"abstractUrl": "/journal/tb/2016/03/07172469/13rRUwfI0Oy",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/09/07312494",
"title": "Principal Curves on Riemannian Manifolds",
"doi": null,
"abstractUrl": "/journal/tp/2016/09/07312494/13rRUyeTVjj",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/01/ttb2013010151",
"title": "SuperQ: Computing Supernetworks from Quartets",
"doi": null,
"abstractUrl": "/journal/tb/2013/01/ttb2013010151/13rRUyhaIna",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/02/09804871",
"title": "Planar Rooted Phylogenetic Networks",
"doi": null,
"abstractUrl": "/journal/tb/2023/02/09804871/1ErlfIX7ZAs",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09555911",
"title": "Wasserstein Distances, Geodesics and Barycenters of Merge Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09555911/1xlvYjicn7i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06716027",
"articleId": "13rRUxASua6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06755453",
"articleId": "13rRUx0xQ6C",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDqsVW",
"title": "April",
"year": "2018",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "40",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASuBI",
"doi": "10.1109/TPAMI.2017.2700276",
"abstract": "Inferring a probability density function (pdf) for shape from a population of point sets is a challenging problem. The lack of point-to-point correspondences and the non-linearity of the shape spaces undermine the linear models. Methods based on manifolds model the shape variations naturally, however, statistics are often limited to a single geodesic mean and an arbitrary number of variation modes. We relax the manifold assumption and consider a piece-wise linear form, implementing a mixture of distinctive shape classes. The pdf for point sets is defined hierarchically, modeling a mixture of Probabilistic Principal Component Analyzers (PPCA) in higher dimension. A Variational Bayesian approach is designed for unsupervised learning of the posteriors of point set labels, local variation modes, and point correspondences. By maximizing the model evidence, the numbers of clusters, modes of variations, and points on the mean models are automatically selected. Using the predictive distribution, we project a test shape to the spaces spanned by the local PPCA's. The method is applied to point sets from: i) synthetic data, ii) healthy versus pathological heart morphologies, and iii) lumbar vertebrae. The proposed method selects models with expected numbers of clusters and variation modes, achieving lower generalization-specificity errors compared to state-of-the-art.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Inferring a probability density function (pdf) for shape from a population of point sets is a challenging problem. The lack of point-to-point correspondences and the non-linearity of the shape spaces undermine the linear models. Methods based on manifolds model the shape variations naturally, however, statistics are often limited to a single geodesic mean and an arbitrary number of variation modes. We relax the manifold assumption and consider a piece-wise linear form, implementing a mixture of distinctive shape classes. The pdf for point sets is defined hierarchically, modeling a mixture of Probabilistic Principal Component Analyzers (PPCA) in higher dimension. A Variational Bayesian approach is designed for unsupervised learning of the posteriors of point set labels, local variation modes, and point correspondences. By maximizing the model evidence, the numbers of clusters, modes of variations, and points on the mean models are automatically selected. Using the predictive distribution, we project a test shape to the spaces spanned by the local PPCA's. The method is applied to point sets from: i) synthetic data, ii) healthy versus pathological heart morphologies, and iii) lumbar vertebrae. The proposed method selects models with expected numbers of clusters and variation modes, achieving lower generalization-specificity errors compared to state-of-the-art.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Inferring a probability density function (pdf) for shape from a population of point sets is a challenging problem. The lack of point-to-point correspondences and the non-linearity of the shape spaces undermine the linear models. Methods based on manifolds model the shape variations naturally, however, statistics are often limited to a single geodesic mean and an arbitrary number of variation modes. We relax the manifold assumption and consider a piece-wise linear form, implementing a mixture of distinctive shape classes. The pdf for point sets is defined hierarchically, modeling a mixture of Probabilistic Principal Component Analyzers (PPCA) in higher dimension. A Variational Bayesian approach is designed for unsupervised learning of the posteriors of point set labels, local variation modes, and point correspondences. By maximizing the model evidence, the numbers of clusters, modes of variations, and points on the mean models are automatically selected. Using the predictive distribution, we project a test shape to the spaces spanned by the local PPCA's. The method is applied to point sets from: i) synthetic data, ii) healthy versus pathological heart morphologies, and iii) lumbar vertebrae. The proposed method selects models with expected numbers of clusters and variation modes, achieving lower generalization-specificity errors compared to state-of-the-art.",
"title": "Mixture of Probabilistic Principal Component Analyzers for Shapes from Point Sets",
"normalizedTitle": "Mixture of Probabilistic Principal Component Analyzers for Shapes from Point Sets",
"fno": "07917251",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Shape",
"Principal Component Analysis",
"Sociology",
"Manifolds",
"Data Models",
"Probability Density Function",
"Generative Modeling",
"Variational Bayes",
"Model Selection",
"Graphical Models",
"Statistical Shape Models"
],
"authors": [
{
"givenName": "Ali",
"surname": "Gooya",
"fullName": "Ali Gooya",
"affiliation": "Center of Computational Imaging & Simulation Technologies in Biomedicine, University of Sheffield, Sheffield, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Karim",
"surname": "Lekadir",
"fullName": "Karim Lekadir",
"affiliation": "Center of Computational Imaging & Simulation Technologies in Biomedicine, University of Sheffield, Sheffield, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Isaac",
"surname": "Castro-Mateos",
"fullName": "Isaac Castro-Mateos",
"affiliation": "Center of Computational Imaging & Simulation Technologies in Biomedicine, University of Sheffield, Sheffield, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jose Maria",
"surname": "Pozo",
"fullName": "Jose Maria Pozo",
"affiliation": "Center of Computational Imaging & Simulation Technologies in Biomedicine, University of Sheffield, Sheffield, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alejandro F.",
"surname": "Frangi",
"fullName": "Alejandro F. Frangi",
"affiliation": "Center of Computational Imaging & Simulation Technologies in Biomedicine, University of Sheffield, Sheffield, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2018-04-01 00:00:00",
"pubType": "trans",
"pages": "891-904",
"year": "2018",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2016/8851/0/8851e462",
"title": "Mixture of Bilateral-Projection Two-Dimensional Probabilistic Principal Component Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851e462/12OmNBqv2dr",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2008/2339/0/04562996",
"title": "Statistical shape modelling: How many modes should be retained?",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2008/04562996/12OmNx3Zjkj",
"parentPublication": {
"id": "proceedings/cvprw/2008/2339/0",
"title": "2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pbg/2005/20/0/01500319",
"title": "Computing variation modes for point set surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/pbg/2005/01500319/12OmNxdVgUk",
"parentPublication": {
"id": "proceedings/pbg/2005/20/0",
"title": "Point-Based Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2000/0750/2/07506058",
"title": "Shapes of Weighted Points Sets",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2000/07506058/12OmNyeECBg",
"parentPublication": {
"id": "proceedings/icpr/2000/0750/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/02/i0097",
"title": "Characterization of Neuropathological Shape Deformations",
"doi": null,
"abstractUrl": "/journal/tp/1998/02/i0097/13rRUwI5TYq",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/12/i1914",
"title": "Recovering Facial Shape Using a Statistical Model of Surface Normal Direction",
"doi": null,
"abstractUrl": "/journal/tp/2006/12/i1914/13rRUwbs2c0",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/11/07364267",
"title": "Scalable Robust Principal Component Analysis Using Grassmann Averages",
"doi": null,
"abstractUrl": "/journal/tp/2016/11/07364267/13rRUxZ0o2Q",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2018/11/08214214",
"title": "Disentangling the Modes of Variation in Unlabelled Data",
"doi": null,
"abstractUrl": "/journal/tp/2018/11/08214214/143fgZYFHkC",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09920234",
"title": "Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09920234/1HxSnktOqgU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956604",
"title": "Characterizing Cell Shape Distributions Using k-Mode Kernel Mixtures",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956604/1IHoT25DOj6",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07906616",
"articleId": "13rRUxBa57q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07930470",
"articleId": "13rRUxNW20y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesU7",
"name": "ttp201804-07917251s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201804-07917251s1.zip",
"extension": "zip",
"size": "347 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1DjDt0mmw0g",
"title": "May-June",
"year": "2022",
"issueNum": "03",
"idPrefix": "tq",
"pubType": "journal",
"volume": "19",
"label": "May-June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1pK1btDDUpW",
"doi": "10.1109/TDSC.2020.3046267",
"abstract": "Industrial Control System (ICS) security has become increasingly important as attacks targeting ICSs are more prominent. Although many off-the-shelf industrial network intrusion detection mechanisms have been presented in the past, attackers have always found unique disguisable ways to bypass detections and disrupt actual industrial control processes. To mitigate this deficiency, we present a novel scheme for the detection of industrial process control attacks, called <sc>ShadowPLCs</sc>. Specifically, the scheme first automatically analyzes the PLC control code, then extracts key parameters of the PLCs including valid register addresses, valid range of values, and control logic rules as a basis for evaluating attacks. The attack behavior is detected in real-time from different perspectives through active communication with PLCs and passive monitoring of the network traffic. We implemented a prototype system with Siemens S7-300 series PLCs as a case study. Our scheme was evaluated using two Siemens S7-300 PLCs deployed on a gas pipeline network platform. Experiments demonstrate that the presented scheme can accurately detect process control attacks in real-time without affecting the normal operations of PLCs. Compared with the other four representative detection models, our scheme has better detection performance with detection accuracy of 97.3 percent.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Industrial Control System (ICS) security has become increasingly important as attacks targeting ICSs are more prominent. Although many off-the-shelf industrial network intrusion detection mechanisms have been presented in the past, attackers have always found unique disguisable ways to bypass detections and disrupt actual industrial control processes. To mitigate this deficiency, we present a novel scheme for the detection of industrial process control attacks, called <sc>ShadowPLCs</sc>. Specifically, the scheme first automatically analyzes the PLC control code, then extracts key parameters of the PLCs including valid register addresses, valid range of values, and control logic rules as a basis for evaluating attacks. The attack behavior is detected in real-time from different perspectives through active communication with PLCs and passive monitoring of the network traffic. We implemented a prototype system with Siemens S7-300 series PLCs as a case study. Our scheme was evaluated using two Siemens S7-300 PLCs deployed on a gas pipeline network platform. Experiments demonstrate that the presented scheme can accurately detect process control attacks in real-time without affecting the normal operations of PLCs. Compared with the other four representative detection models, our scheme has better detection performance with detection accuracy of 97.3 percent.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Industrial Control System (ICS) security has become increasingly important as attacks targeting ICSs are more prominent. Although many off-the-shelf industrial network intrusion detection mechanisms have been presented in the past, attackers have always found unique disguisable ways to bypass detections and disrupt actual industrial control processes. To mitigate this deficiency, we present a novel scheme for the detection of industrial process control attacks, called ShadowPLCs. Specifically, the scheme first automatically analyzes the PLC control code, then extracts key parameters of the PLCs including valid register addresses, valid range of values, and control logic rules as a basis for evaluating attacks. The attack behavior is detected in real-time from different perspectives through active communication with PLCs and passive monitoring of the network traffic. We implemented a prototype system with Siemens S7-300 series PLCs as a case study. Our scheme was evaluated using two Siemens S7-300 PLCs deployed on a gas pipeline network platform. Experiments demonstrate that the presented scheme can accurately detect process control attacks in real-time without affecting the normal operations of PLCs. Compared with the other four representative detection models, our scheme has better detection performance with detection accuracy of 97.3 percent.",
"title": "<sc>ShadowPLCs</sc>: A Novel Scheme for Remote Detection of Industrial Process Control Attacks",
"normalizedTitle": "ShadowPLCs: A Novel Scheme for Remote Detection of Industrial Process Control Attacks",
"fno": "09301471",
"hasPdf": true,
"idPrefix": "tq",
"keywords": [
"Control Engineering Computing",
"Process Control",
"Programmable Controllers",
"Security Of Data",
"Actual Industrial Control Processes",
"Control Logic Rules",
"Industrial Control System Security",
"Industrial Network Intrusion Detection",
"Industrial Process Control Attacks",
"Passive Network Traffic Monitoring",
"PLC Control Code",
"Remote Detection",
"Shadow PL Cs",
"Siemens S 7 300 Series PL Cs",
"Valid Range Of Values",
"Valid Register Addresses",
"Process Control",
"Registers",
"Monitoring",
"Standards",
"Real Time Systems",
"Control Systems",
"Protocols",
"Industrial Control System",
"Process Control Attacks",
"PLC",
"Active And Passive",
"Attack Detection",
"Control Logic"
],
"authors": [
{
"givenName": "Junjiao",
"surname": "Liu",
"fullName": "Junjiao Liu",
"affiliation": "Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaodong",
"surname": "Lin",
"fullName": "Xiaodong Lin",
"affiliation": "School of Computer Science, University of Guelph, Guelph, ON, Canada",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Chen",
"fullName": "Xin Chen",
"affiliation": "Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hui",
"surname": "Wen",
"fullName": "Hui Wen",
"affiliation": "Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hong",
"surname": "Li",
"fullName": "Hong Li",
"affiliation": "Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yan",
"surname": "Hu",
"fullName": "Yan Hu",
"affiliation": "School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiawei",
"surname": "Sun",
"fullName": "Jiawei Sun",
"affiliation": "Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhiqiang",
"surname": "Shi",
"fullName": "Zhiqiang Shi",
"affiliation": "Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Limin",
"surname": "Sun",
"fullName": "Limin Sun",
"affiliation": "Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2022-05-01 00:00:00",
"pubType": "trans",
"pages": "2054-2069",
"year": "2022",
"issn": "1545-5971",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iotdi/2017/4966/0/4966a327",
"title": "Poster Abstract: OPC-UA Communication Framework for PLC-Based Industrial IoT Applications",
"doi": null,
"abstractUrl": "/proceedings-article/iotdi/2017/4966a327/12OmNARRYCi",
"parentPublication": {
"id": "proceedings/iotdi/2017/4966/0",
"title": "2017 IEEE/ACM Second International Conference on Internet-of-Things Design and Implementation (IoTDI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icssa/2016/4388/0/4388a064",
"title": "Detection of Man-in-the-Middle Attacks on Industrial Control Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icssa/2016/4388a064/12OmNBqdrdX",
"parentPublication": {
"id": "proceedings/icssa/2016/4388/0",
"title": "2016 International Conference on Software Security and Assurance (ICSSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2017/06/msp2017060018",
"title": "Programmable Logic Controller Forensics",
"doi": null,
"abstractUrl": "/magazine/sp/2017/06/msp2017060018/13rRUIJcWvf",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nca/2021/9550/0/09685713",
"title": "Analysis, prevention and detection of ransomware attacks on Industrial Control Systems",
"doi": null,
"abstractUrl": "/proceedings-article/nca/2021/09685713/1AC8TwsB0zK",
"parentPublication": {
"id": "proceedings/nca/2021/9550/0",
"title": "2021 IEEE 20th International Symposium on Network Computing and Applications (NCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2022/7480/0/748000a322",
"title": "Data traceability scheme of industrial control system based on digital watermark",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2022/748000a322/1H44vDiIWqI",
"parentPublication": {
"id": "proceedings/dsc/2022/7480/0",
"title": "2022 7th IEEE International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/prdc/2022/8555/0/855500a089",
"title": "A Heterogeneous Redundant Architecture for Industrial Control System Security",
"doi": null,
"abstractUrl": "/proceedings-article/prdc/2022/855500a089/1KrgXMH8zOE",
"parentPublication": {
"id": "proceedings/prdc/2022/8555/0",
"title": "2022 IEEE 27th Pacific Rim International Symposium on Dependable Computing (PRDC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2020/4380/0/438000a827",
"title": "An Analytics Framework for Heuristic Inference Attacks Against Industrial Control Systems",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2020/438000a827/1r54h9TQ9J6",
"parentPublication": {
"id": "proceedings/trustcom/2020/4380/0",
"title": "2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spw/2021/3732/0/373200a383",
"title": "Empirical Study of PLC Authentication Protocols in Industrial Control Systems",
"doi": null,
"abstractUrl": "/proceedings-article/spw/2021/373200a383/1v56nE25STu",
"parentPublication": {
"id": "proceedings/spw/2021/3732/0",
"title": "2021 IEEE Security and Privacy Workshops (SPW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spw/2021/3732/0/373200a246",
"title": "A Containerization-Based Backfit Approach for Industrial Control System Resiliency",
"doi": null,
"abstractUrl": "/proceedings-article/spw/2021/373200a246/1v56pt86P5e",
"parentPublication": {
"id": "proceedings/spw/2021/3732/0",
"title": "2021 IEEE Security and Privacy Workshops (SPW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euros&p/2021/1491/0/149100a385",
"title": "SoK: Attacks on Industrial Control Logic and Formal Verification-Based Defenses",
"doi": null,
"abstractUrl": "/proceedings-article/euros&p/2021/149100a385/1yg1cFFjUbu",
"parentPublication": {
"id": "proceedings/euros&p/2021/1491/0",
"title": "2021 IEEE European Symposium on Security and Privacy (EuroS&P)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09296813",
"articleId": "1pDnQWIngTC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09308957",
"articleId": "1pQEzLKFv4k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxWuinj",
"title": "March-April",
"year": "2015",
"issueNum": "02",
"idPrefix": "tb",
"pubType": "journal",
"volume": "12",
"label": "March-April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvgzgS",
"doi": "10.1109/TCBB.2014.2361355",
"abstract": "Protein-protein interfaces defined through atomic contact or solvent accessibility change are widely adopted in structural biology studies. But, these definitions cannot precisely capture energetically important regions at protein interfaces. The burial depth of an atom in a protein is related to the atom’s energy. This work investigates how closely the change in burial level of an atom/residue upon complexation is related to the binding. Burial level change is different from burial level itself. An atom deeply buried in a monomer with a high burial level may not change its burial level after an interaction and it may have little burial level change. We hypothesize that an interface is a region of residues all undergoing burial level changes after interaction. By this definition, an interface can be decomposed into an onion-like structure according to the burial level change extent. We found that our defined interfaces cover energetically important residues more precisely, and that the binding free energy of an interface is distributed progressively from the outermost layer to the core. These observations are used to predict binding hot spots. Our approach’s F-measure performance on a benchmark dataset of alanine mutagenesis residues is much superior or similar to those by complicated energy modeling or machine learning approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Protein-protein interfaces defined through atomic contact or solvent accessibility change are widely adopted in structural biology studies. But, these definitions cannot precisely capture energetically important regions at protein interfaces. The burial depth of an atom in a protein is related to the atom’s energy. This work investigates how closely the change in burial level of an atom/residue upon complexation is related to the binding. Burial level change is different from burial level itself. An atom deeply buried in a monomer with a high burial level may not change its burial level after an interaction and it may have little burial level change. We hypothesize that an interface is a region of residues all undergoing burial level changes after interaction. By this definition, an interface can be decomposed into an onion-like structure according to the burial level change extent. We found that our defined interfaces cover energetically important residues more precisely, and that the binding free energy of an interface is distributed progressively from the outermost layer to the core. These observations are used to predict binding hot spots. Our approach’s F-measure performance on a benchmark dataset of alanine mutagenesis residues is much superior or similar to those by complicated energy modeling or machine learning approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Protein-protein interfaces defined through atomic contact or solvent accessibility change are widely adopted in structural biology studies. But, these definitions cannot precisely capture energetically important regions at protein interfaces. The burial depth of an atom in a protein is related to the atom’s energy. This work investigates how closely the change in burial level of an atom/residue upon complexation is related to the binding. Burial level change is different from burial level itself. An atom deeply buried in a monomer with a high burial level may not change its burial level after an interaction and it may have little burial level change. We hypothesize that an interface is a region of residues all undergoing burial level changes after interaction. By this definition, an interface can be decomposed into an onion-like structure according to the burial level change extent. We found that our defined interfaces cover energetically important residues more precisely, and that the binding free energy of an interface is distributed progressively from the outermost layer to the core. These observations are used to predict binding hot spots. Our approach’s F-measure performance on a benchmark dataset of alanine mutagenesis residues is much superior or similar to those by complicated energy modeling or machine learning approaches.",
"title": "Burial Level Change Defines a High Energetic Relevance for Protein Binding Interfaces",
"normalizedTitle": "Burial Level Change Defines a High Energetic Relevance for Protein Binding Interfaces",
"fno": "06915879",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Proteins",
"Atomic Layer Deposition",
"Atomic Measurements",
"Structural Rings",
"Bioinformatics",
"Computational Biology",
"Educational Institutions",
"O Ring",
"Protein Interface",
"Protein Binding",
"Hot Spot",
"O Ring",
"Protein Interface",
"Protein Binding",
"Hot Spot"
],
"authors": [
{
"givenName": "Zhenhua",
"surname": "Li",
"fullName": "Zhenhua Li",
"affiliation": "School of Computer Engineering, School of Computer Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "He",
"fullName": "Ying He",
"affiliation": "School of Computer Engineering, School of Computer Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Limsoon",
"surname": "Wong",
"fullName": "Limsoon Wong",
"affiliation": "School of Computing, National University of Singapore, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jinyan",
"surname": "Li",
"fullName": "Jinyan Li",
"affiliation": "Advanced Analytics Institute, FEIT, University of Technology Sydney, Sydney, Australia",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2015-03-01 00:00:00",
"pubType": "trans",
"pages": "410-421",
"year": "2015",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cisis/2012/4687/0/4687a592",
"title": "Prediction of Protein Catalytic Residues by Local Structural Rigidity",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2012/4687a592/12OmNApu5lf",
"parentPublication": {
"id": "proceedings/cisis/2012/4687/0",
"title": "2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2010/8306/0/05706535",
"title": "Sequence and structural features of binding site residues in protein-protein complexes",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2010/05706535/12OmNCxbXBG",
"parentPublication": {
"id": "proceedings/bibm/2010/8306/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2008/2357/0/04594731",
"title": "Investigating the binding area of protein surface using MCL algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2008/04594731/12OmNvwC5tu",
"parentPublication": {
"id": "proceedings/cit/2008/2357/0",
"title": "2008 8th IEEE International Conference on Computer and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micro/2010/9071/0/05695544",
"title": "AtomTracker: A Comprehensive Approach to Atomic Region Inference and Violation Detection",
"doi": null,
"abstractUrl": "/proceedings-article/micro/2010/05695544/12OmNzdGnsV",
"parentPublication": {
"id": "proceedings/micro/2010/9071/0",
"title": "2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2009/04/ttb2009040639",
"title": "Protein Structure Classification Based on Conserved Hydrophobic Residues",
"doi": null,
"abstractUrl": "/journal/tb/2009/04/ttb2009040639/13rRUwIF67A",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/04/ttb2013041017",
"title": "Identification of DNA-Binding and Protein-Binding Proteins Using Enhanced Graph Wavelet Features",
"doi": null,
"abstractUrl": "/journal/tb/2013/04/ttb2013041017/13rRUyXKxT0",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpca/2022/2027/0/202700a475",
"title": "Atomic Dataflow based Graph-Level Workload Orchestration for Scalable DNN Accelerators",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2022/202700a475/1Ds0cZlz1Xq",
"parentPublication": {
"id": "proceedings/hpca/2022/2027/0",
"title": "2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2019/2519/0/251900b994",
"title": "ATOM: Model-Driven Autoscaling for Microservices",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2019/251900b994/1ezRVxiKyBO",
"parentPublication": {
"id": "proceedings/icdcs/2019/2519/0",
"title": "2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2019/5023/0/502300a109",
"title": "Accuracy and Long-Term Tracking via Overlap Maximization Integrated with Motion Continuity",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300a109/1i5mHFPhFte",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/06/09594656",
"title": "Protein-DNA Binding Residue Prediction via Bagging Strategy and Sequence-Based Cube-Format Feature",
"doi": null,
"abstractUrl": "/journal/tb/2022/06/09594656/1y5Z1hIECdy",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06883208",
"articleId": "13rRUwbs1R2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06917051",
"articleId": "13rRUy2YLWO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy7Qfqd",
"title": "Feb.",
"year": "2015",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "37",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCitEh",
"doi": "10.1109/TPAMI.2014.2318721",
"abstract": "We develop a Bayesian nonparametric approach to a general family of latent class problems in which individuals can belong simultaneously to multiple classes and where each class can be exhibited multiple times by an individual. We introduce a combinatorial stochastic process known as the negative binomial process ( Z_${\\rm NBP}$_Z ) as an infinite-dimensional prior appropriate for such problems. We show that the Z_${\\rm NBP}$_Z is conjugate to the beta process, and we characterize the posterior distribution under the beta-negative binomial process (Z_${\\rm BNBP}$_Z ) and hierarchical models based on the Z_${\\rm BNBP}$_Z (the Z_${\\rm HBNBP}$_Z ). We study the asymptotic properties of the Z_${\\rm BNBP}$_Z and develop a three-parameter extension of the Z_${\\rm BNBP}$_Z that exhibits power-law behavior. We derive MCMC algorithms for posterior inference under the Z_${\\rm HBNBP}$_Z , and we present experiments using these algorithms in the domains of image segmentation, object recognition, and document analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We develop a Bayesian nonparametric approach to a general family of latent class problems in which individuals can belong simultaneously to multiple classes and where each class can be exhibited multiple times by an individual. We introduce a combinatorial stochastic process known as the negative binomial process ( ${\\rm NBP}$ ) as an infinite-dimensional prior appropriate for such problems. We show that the ${\\rm NBP}$ is conjugate to the beta process, and we characterize the posterior distribution under the beta-negative binomial process (${\\rm BNBP}$ ) and hierarchical models based on the ${\\rm BNBP}$ (the ${\\rm HBNBP}$ ). We study the asymptotic properties of the ${\\rm BNBP}$ and develop a three-parameter extension of the ${\\rm BNBP}$ that exhibits power-law behavior. We derive MCMC algorithms for posterior inference under the ${\\rm HBNBP}$ , and we present experiments using these algorithms in the domains of image segmentation, object recognition, and document analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We develop a Bayesian nonparametric approach to a general family of latent class problems in which individuals can belong simultaneously to multiple classes and where each class can be exhibited multiple times by an individual. We introduce a combinatorial stochastic process known as the negative binomial process ( - ) as an infinite-dimensional prior appropriate for such problems. We show that the - is conjugate to the beta process, and we characterize the posterior distribution under the beta-negative binomial process (- ) and hierarchical models based on the - (the - ). We study the asymptotic properties of the - and develop a three-parameter extension of the - that exhibits power-law behavior. We derive MCMC algorithms for posterior inference under the - , and we present experiments using these algorithms in the domains of image segmentation, object recognition, and document analysis.",
"title": "Combinatorial Clustering and the Beta Negative Binomial Process",
"normalizedTitle": "Combinatorial Clustering and the Beta Negative Binomial Process",
"fno": "06802382",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Atomic Measurements",
"Random Variables",
"Customer Relationship Management",
"Bayes Methods",
"Genetics",
"Analytical Models",
"Stochastic Processes",
"Integer Latent Feature Model",
"Beta Process",
"Admixture",
"Mixed Membership",
"Bayesian",
"Nonparametric"
],
"authors": [
{
"givenName": "Tamara",
"surname": "Broderick",
"fullName": "Tamara Broderick",
"affiliation": "Department of Statistics and the Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lester",
"surname": "Mackey",
"fullName": "Lester Mackey",
"affiliation": "Department of Statistics, Stanford University, Stanford, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John",
"surname": "Paisley",
"fullName": "John Paisley",
"affiliation": "Department of Electrical Engineering, Columbia University, New York, NY",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Michael I.",
"surname": "Jordan",
"fullName": "Michael I. Jordan",
"affiliation": "Department of Statistics and the Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2015-02-01 00:00:00",
"pubType": "trans",
"pages": "290-306",
"year": "2015",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2015/9504/0/9504a489",
"title": "Infinite Author Topic Model Based on Mixed Gamma-Negative Binomial Process",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504a489/12OmNvkGW8b",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/02/06636308",
"title": "Negative Binomial Process Count and Mixture Modeling",
"doi": null,
"abstractUrl": "/journal/tp/2015/02/06636308/13rRUwInvzB",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06777276",
"articleId": "13rRUEgs2Nc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06636308",
"articleId": "13rRUwInvzB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWROZ",
"name": "ttp201502-06802382s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp201502-06802382s1.zip",
"extension": "zip",
"size": "393 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBNM93d",
"title": "Nov.",
"year": "2015",
"issueNum": "11",
"idPrefix": "tg",
"pubType": "journal",
"volume": "21",
"label": "Nov.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIIVlcN",
"doi": "10.1109/TVCG.2015.2459792",
"abstract": "We present SoftAR, a novel spatial augmented reality (AR) technique based on a pseudo-haptics mechanism that visually manipulates the sense of softness perceived by a user pushing a soft physical object. Considering the limitations of projection-based approaches that change only the surface appearance of a physical object, we propose two projection visual effects, i.e., surface deformation effect (SDE) and body appearance effect (BAE), on the basis of the observations of humans pushing physical objects. The SDE visualizes a two-dimensional deformation of the object surface with a controlled softness parameter, and BAE changes the color of the pushing hand. Through psychophysical experiments, we confirm that the SDE can manipulate softness perception such that the participant perceives significantly greater softness than the actual softness. Furthermore, fBAE, in which BAE is applied only for the finger area, significantly enhances manipulation of the perception of softness. We create a computational model that estimates perceived softness when SDE+fBAE is applied. We construct a prototype SoftAR system in which two application frameworks are implemented. The softness adjustment allows a user to adjust the softness parameter of a physical object, and the softness transfer allows the user to replace the softness with that of another object.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present SoftAR, a novel spatial augmented reality (AR) technique based on a pseudo-haptics mechanism that visually manipulates the sense of softness perceived by a user pushing a soft physical object. Considering the limitations of projection-based approaches that change only the surface appearance of a physical object, we propose two projection visual effects, i.e., surface deformation effect (SDE) and body appearance effect (BAE), on the basis of the observations of humans pushing physical objects. The SDE visualizes a two-dimensional deformation of the object surface with a controlled softness parameter, and BAE changes the color of the pushing hand. Through psychophysical experiments, we confirm that the SDE can manipulate softness perception such that the participant perceives significantly greater softness than the actual softness. Furthermore, fBAE, in which BAE is applied only for the finger area, significantly enhances manipulation of the perception of softness. We create a computational model that estimates perceived softness when SDE+fBAE is applied. We construct a prototype SoftAR system in which two application frameworks are implemented. The softness adjustment allows a user to adjust the softness parameter of a physical object, and the softness transfer allows the user to replace the softness with that of another object.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present SoftAR, a novel spatial augmented reality (AR) technique based on a pseudo-haptics mechanism that visually manipulates the sense of softness perceived by a user pushing a soft physical object. Considering the limitations of projection-based approaches that change only the surface appearance of a physical object, we propose two projection visual effects, i.e., surface deformation effect (SDE) and body appearance effect (BAE), on the basis of the observations of humans pushing physical objects. The SDE visualizes a two-dimensional deformation of the object surface with a controlled softness parameter, and BAE changes the color of the pushing hand. Through psychophysical experiments, we confirm that the SDE can manipulate softness perception such that the participant perceives significantly greater softness than the actual softness. Furthermore, fBAE, in which BAE is applied only for the finger area, significantly enhances manipulation of the perception of softness. We create a computational model that estimates perceived softness when SDE+fBAE is applied. We construct a prototype SoftAR system in which two application frameworks are implemented. The softness adjustment allows a user to adjust the softness parameter of a physical object, and the softness transfer allows the user to replace the softness with that of another object.",
"title": "<italic>SoftAR</italic>: Visually Manipulating Haptic Softness Perception in Spatial Augmented Reality",
"normalizedTitle": "SoftAR: Visually Manipulating Haptic Softness Perception in Spatial Augmented Reality",
"fno": "07165660",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Augmented Reality",
"Deformation",
"Haptic Interfaces",
"Soft AR",
"Haptic Softness Perception Visual Manipulation",
"Spatial Augmented Reality Technique",
"Pseudo Haptics Mechanism",
"Soft Physical Object",
"Projection Based Approaches",
"Surface Deformation Effect",
"Body Appearance Effect",
"Humans Pushing Physical Objects",
"2 D Deformation",
"Object Surface",
"Controlled Softness Parameter",
"SDE F BAE",
"Force",
"Visualization",
"Visual Effects",
"Image Color Analysis",
"Haptic Interfaces",
"Barium",
"Computational Modeling",
"Spatial Augmented Reality",
"Pseudo Haptic Feedback",
"Softness Perception",
"Product Visualization",
"Spatial Augmented Reality",
"Pseudo Haptic Feedback",
"Softness Perception",
"Product Visualization"
],
"authors": [
{
"givenName": "Parinya",
"surname": "Punpongsanon",
"fullName": "Parinya Punpongsanon",
"affiliation": "Graduate School of Engineering Science, Toyonaka, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daisuke",
"surname": "Iwai",
"fullName": "Daisuke Iwai",
"affiliation": "Graduate School of Engineering Science, Toyonaka, Japan",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kosuke",
"surname": "Sato",
"fullName": "Kosuke Sato",
"affiliation": "Graduate School of Engineering Science, Toyonaka, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "11",
"pubDate": "2015-11-01 00:00:00",
"pubType": "trans",
"pages": "1279-1288",
"year": "2015",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2009/3943/0/04811048",
"title": "Subjective Perception and Objective Measurements in Perceiving Object Softness for VR Surgical Systems",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2009/04811048/12OmNwtWfHK",
"parentPublication": {
"id": "proceedings/vr/2009/3943/0",
"title": "2009 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2014/6184/0/06948460",
"title": "[Poster] A preliminary study on altering surface softness perception using augmented color and deformation",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2014/06948460/12OmNyQph5r",
"parentPublication": {
"id": "proceedings/ismar/2014/6184/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446403",
"title": "Effect of Electrical Stimulation Haptic Feedback on Perceptions of Softness-Hardness and Stickiness While Touching a Virtual Object",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446403/13bd1eSlytA",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446516",
"title": "Softness-Hardness and Stickiness Feedback Using Electrical Stimulation While Touching a Virtual Object",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446516/13bd1fWcuDz",
"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/th/2015/02/07042750",
"title": "Design and Characterization of a Fabric-Based Softness Display",
"doi": null,
"abstractUrl": "/journal/th/2015/02/07042750/13rRUwI5TRa",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2011/04/tth2011040242",
"title": "Exploratory Strategies in Haptic Softness Discrimination Are Tuned to Achieve High Levels of Task Performance",
"doi": null,
"abstractUrl": "/journal/th/2011/04/tth2011040242/13rRUwvT9gy",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2010/02/tth2010020109",
"title": "Rendering Softness: Integration of Kinesthetic and Cutaneous Information in a Haptic Device",
"doi": null,
"abstractUrl": "/journal/th/2010/02/tth2010020109/13rRUwwJWFX",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2015/03/07271156",
"title": "Guest Editorial: Haptic assistive technology for individuals who are visually impaired",
"doi": null,
"abstractUrl": "/journal/th/2015/03/07271156/13rRUyuNsx7",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/12/09117062",
"title": "Augmenting Perceived Softness of Haptic Proxy Objects Through Transient Vibration and Visuo-Haptic Illusion in Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2021/12/09117062/1kGg69DDrFe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/2020/5406/0/540600a094",
"title": "3D Shape Understanding for the Visually Impaired by using Virtual Haptic Senses based on Fuzzy Logic",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/2020/540600a094/1qci9TF2Pug",
"parentPublication": {
"id": "proceedings/ismvl/2020/5406/0",
"title": "2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07165643",
"articleId": "13rRUILtJzB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07164348",
"articleId": "13rRUxZzAhH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRPd",
"name": "ttg201511-07165660s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201511-07165660s1.zip",
"extension": "zip",
"size": "94.8 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNANBZkd",
"title": "March",
"year": "2004",
"issueNum": "03",
"idPrefix": "tp",
"pubType": "journal",
"volume": "26",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvgh",
"doi": "10.1109/TPAMI.2004.1262305",
"abstract": "Abstract—This paper demonstrates a method to visually measure the force distribution applied to a linearly elastic object using the contour data in an image. The force measurement is accomplished by making use of the result from linear elasticity that the displacement field of the contour of a linearly elastic object is sufficient to completely recover the force distribution applied to the object. This result leads naturally to a deformable template matching approach where the template is deformed according to the governing equations of linear elasticity. An energy minimization method is used to match the template to the contour data in the image. This technique of visually measuring forces we refer to as vision-based force measurement (VBFM). VBFM has the potential to increase the robustness and reliability of micromanipulation and biomanipulation tasks where force sensing is essential for success. The effectiveness of VBFM is demonstrated for both a microcantilever beam and a microgripper. A sensor resolution of less than +/- 3 nN for the microcantilever and +/- 3 mN for the microgripper was achieved using VBFM. Performance optimizations for the energy minimization problem are also discussed that make this algorithm feasible for real-time applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—This paper demonstrates a method to visually measure the force distribution applied to a linearly elastic object using the contour data in an image. The force measurement is accomplished by making use of the result from linear elasticity that the displacement field of the contour of a linearly elastic object is sufficient to completely recover the force distribution applied to the object. This result leads naturally to a deformable template matching approach where the template is deformed according to the governing equations of linear elasticity. An energy minimization method is used to match the template to the contour data in the image. This technique of visually measuring forces we refer to as vision-based force measurement (VBFM). VBFM has the potential to increase the robustness and reliability of micromanipulation and biomanipulation tasks where force sensing is essential for success. The effectiveness of VBFM is demonstrated for both a microcantilever beam and a microgripper. A sensor resolution of less than +/- 3 nN for the microcantilever and +/- 3 mN for the microgripper was achieved using VBFM. Performance optimizations for the energy minimization problem are also discussed that make this algorithm feasible for real-time applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—This paper demonstrates a method to visually measure the force distribution applied to a linearly elastic object using the contour data in an image. The force measurement is accomplished by making use of the result from linear elasticity that the displacement field of the contour of a linearly elastic object is sufficient to completely recover the force distribution applied to the object. This result leads naturally to a deformable template matching approach where the template is deformed according to the governing equations of linear elasticity. An energy minimization method is used to match the template to the contour data in the image. This technique of visually measuring forces we refer to as vision-based force measurement (VBFM). VBFM has the potential to increase the robustness and reliability of micromanipulation and biomanipulation tasks where force sensing is essential for success. The effectiveness of VBFM is demonstrated for both a microcantilever beam and a microgripper. A sensor resolution of less than +/- 3 nN for the microcantilever and +/- 3 mN for the microgripper was achieved using VBFM. Performance optimizations for the energy minimization problem are also discussed that make this algorithm feasible for real-time applications.",
"title": "Vision-Based Force Measurement",
"normalizedTitle": "Vision-Based Force Measurement",
"fno": "i0290",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Force Measurement",
"Deformable Templates",
"Elasticity",
"Nonrigid Tracking"
],
"authors": [
{
"givenName": "Michael A.",
"surname": "Greminger",
"fullName": "Michael A. Greminger",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bradley J.",
"surname": "Nelson",
"fullName": "Bradley J. Nelson",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2004-03-01 00:00:00",
"pubType": "trans",
"pages": "290-298",
"year": "2004",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "01307293",
"articleId": "13rRUIIVlly",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0299",
"articleId": "13rRUxASuU0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgK7",
"title": "Oct.",
"year": "2013",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "19",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBJhFv",
"doi": "10.1109/TVCG.2013.12",
"abstract": "In this paper, we propose a novel framework for multidomain subspace deformation using node-wise corotational elasticity. With the proper construction of subspaces based on the knowledge of the boundary deformation, we can use the Lagrange multiplier technique to impose coupling constraints at the boundary without overconstraining. In our deformation algorithm, the number of constraint equations to couple two neighboring domains is not related to the number of the nodes on the boundary but is the same as the number of the selected boundary deformation modes. The crack artifact is not present in our simulation result, and the domain decomposition with loops can be easily handled. Experimental results show that the single-core implementation of our algorithm can achieve real-time performance in simulating deformable objects with around quarter million tetrahedral elements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose a novel framework for multidomain subspace deformation using node-wise corotational elasticity. With the proper construction of subspaces based on the knowledge of the boundary deformation, we can use the Lagrange multiplier technique to impose coupling constraints at the boundary without overconstraining. In our deformation algorithm, the number of constraint equations to couple two neighboring domains is not related to the number of the nodes on the boundary but is the same as the number of the selected boundary deformation modes. The crack artifact is not present in our simulation result, and the domain decomposition with loops can be easily handled. Experimental results show that the single-core implementation of our algorithm can achieve real-time performance in simulating deformable objects with around quarter million tetrahedral elements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose a novel framework for multidomain subspace deformation using node-wise corotational elasticity. With the proper construction of subspaces based on the knowledge of the boundary deformation, we can use the Lagrange multiplier technique to impose coupling constraints at the boundary without overconstraining. In our deformation algorithm, the number of constraint equations to couple two neighboring domains is not related to the number of the nodes on the boundary but is the same as the number of the selected boundary deformation modes. The crack artifact is not present in our simulation result, and the domain decomposition with loops can be easily handled. Experimental results show that the single-core implementation of our algorithm can achieve real-time performance in simulating deformable objects with around quarter million tetrahedral elements.",
"title": "Boundary-Aware Multidomain Subspace Deformation",
"normalizedTitle": "Boundary-Aware Multidomain Subspace Deformation",
"fno": "ttg2013101633",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Couplings",
"Deformable Models",
"Acceleration",
"Harmonic Analysis",
"Elasticity",
"Mathematical Model",
"Deformable Model",
"Model Reduction",
"Domain Decomposition",
"FEM"
],
"authors": [
{
"givenName": "Yin",
"surname": "Yang",
"fullName": "Yin Yang",
"affiliation": "University of Texas at Dallas, Richardson",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiwei",
"surname": "Xu",
"fullName": "Weiwei Xu",
"affiliation": "Hangzhou Normal University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaohu",
"surname": "Guo",
"fullName": "Xiaohu Guo",
"affiliation": "University of Texas at Dallas, Richardson",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kun",
"surname": "Zhou",
"fullName": "Kun Zhou",
"affiliation": "Zhejiang University, Hangzhou",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Baining",
"surname": "Guo",
"fullName": "Baining Guo",
"affiliation": "Microsoft Research Asia, Beijing",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2013-10-01 00:00:00",
"pubType": "trans",
"pages": "1633-1645",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/hpcs/2017/3250/0/08035064",
"title": "A Parallel RBF Mesh Deformation Method with Multi-greedy Algorithm in OpenFOAM",
"doi": null,
"abstractUrl": "/proceedings-article/hpcs/2017/08035064/12OmNAQrYAZ",
"parentPublication": {
"id": "proceedings/hpcs/2017/3250/0",
"title": "2017 International Conference on High-Performance Computing & Simulation (HPCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv-motion/2005/2271/1/227110150",
"title": "Fingerprint Deformation Models Using Minutiae Locations and Orientations",
"doi": null,
"abstractUrl": "/proceedings-article/wacv-motion/2005/227110150/12OmNqIzgVg",
"parentPublication": {
"id": "proceedings/wacv-motion/2005/2271/1",
"title": "Applications of Computer Vision and the IEEE Workshop on Motion and Video Computing, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csie/2009/3507/2/3507b186",
"title": "A Novel Method for Boundary Condition Computation in Soft Tissue Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/csie/2009/3507b186/12OmNrYlmOp",
"parentPublication": {
"id": "proceedings/csie/2009/3507/2",
"title": "Computer Science and Information Engineering, World Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2015/6593/0/6593a407",
"title": "Large Ship Fluid-Structure Coupling Deformation Calculation Based on Large Deviation Theory",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2015/6593a407/12OmNzYeAMy",
"parentPublication": {
"id": "proceedings/dcabes/2015/6593/0",
"title": "2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/miar/2001/1113/0/11130183",
"title": "Tumor Boundary Extraction in Multislice MR Brain Images Using Region and Contour Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/miar/2001/11130183/12OmNzl3WVC",
"parentPublication": {
"id": "proceedings/miar/2001/1113/0",
"title": "Medical Imaging and Augmented Reality, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2013/5099/0/5099a039",
"title": "Applications of Conformal Geometric Algebra in Mesh Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2013/5099a039/12OmNzsJ7DK",
"parentPublication": {
"id": "proceedings/sibgrapi/2013/5099/0",
"title": "2013 XXVI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/08/06165281",
"title": "Physics-Based Character Skinning Using Multidomain Subspace Deformations",
"doi": null,
"abstractUrl": "/journal/tg/2012/08/06165281/13rRUILtJm8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2012/03/mcg2012030037",
"title": "Nonrigid-Deformation Recovery for 3D Face Recognition Using Multiscale Registration",
"doi": null,
"abstractUrl": "/magazine/cg/2012/03/mcg2012030037/13rRUy0ZzSd",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200b285",
"title": "Adaptive Boundary Proposal Network for Arbitrary Shape Text Detection",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200b285/1BmHCrOJFcs",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2019/4765/0/476500a052",
"title": "A Deformation Method in a Wrapping Manner for Virtual Gingiva Based on Mass-Spring Model",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2019/476500a052/1gysi3YeAVO",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2019/4765/0",
"title": "2019 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2013101619",
"articleId": "13rRUwbs20W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2013101646",
"articleId": "13rRUEgarjv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRNV",
"name": "ttg2013101633s.wmv",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013101633s.wmv",
"extension": "wmv",
"size": "36.3 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyPQ4uQ",
"title": "Dec.",
"year": "2018",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "14H4WwCfRnO",
"doi": "10.1109/TVCG.2017.2783335",
"abstract": "This paper presents a spatial reduction framework for simulating nonlinear deformable objects interactively. This reduced model is built using a small number of overlapping quadratic domains as we notice that incorporating high-order degrees of freedom (DOFs) is important for the simulation quality. Departing from existing multi-domain methods in graphics, our method interprets deformed shapes as blended quadratic transformations from nearby domains. Doing so avoids expensive safeguards against the domain coupling and improves the numerical robustness under large deformations. We present an algorithm that efficiently computes weight functions for reduced DOFs in a physics-aware manner. Inspired by the well-known multi-weight enveloping technique, our framework also allows subspace tweaking based on a few representative deformation poses. Such elastic weighting mechanism significantly extends the expressivity of the reduced model with light-weight computational efforts. Our simulator is versatile and can be well interfaced with many existing techniques. It also supports local DOF adaption to incorporate novel deformations (i.e., induced by the collision). The proposed algorithm complements state-of-the-art model reduction and domain decomposition methods by seeking for good trade-offs among animation quality, numerical robustness, pre-computation complexity, and simulation efficiency from an alternative perspective.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a spatial reduction framework for simulating nonlinear deformable objects interactively. This reduced model is built using a small number of overlapping quadratic domains as we notice that incorporating high-order degrees of freedom (DOFs) is important for the simulation quality. Departing from existing multi-domain methods in graphics, our method interprets deformed shapes as blended quadratic transformations from nearby domains. Doing so avoids expensive safeguards against the domain coupling and improves the numerical robustness under large deformations. We present an algorithm that efficiently computes weight functions for reduced DOFs in a physics-aware manner. Inspired by the well-known multi-weight enveloping technique, our framework also allows subspace tweaking based on a few representative deformation poses. Such elastic weighting mechanism significantly extends the expressivity of the reduced model with light-weight computational efforts. Our simulator is versatile and can be well interfaced with many existing techniques. It also supports local DOF adaption to incorporate novel deformations (i.e., induced by the collision). The proposed algorithm complements state-of-the-art model reduction and domain decomposition methods by seeking for good trade-offs among animation quality, numerical robustness, pre-computation complexity, and simulation efficiency from an alternative perspective.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a spatial reduction framework for simulating nonlinear deformable objects interactively. This reduced model is built using a small number of overlapping quadratic domains as we notice that incorporating high-order degrees of freedom (DOFs) is important for the simulation quality. Departing from existing multi-domain methods in graphics, our method interprets deformed shapes as blended quadratic transformations from nearby domains. Doing so avoids expensive safeguards against the domain coupling and improves the numerical robustness under large deformations. We present an algorithm that efficiently computes weight functions for reduced DOFs in a physics-aware manner. Inspired by the well-known multi-weight enveloping technique, our framework also allows subspace tweaking based on a few representative deformation poses. Such elastic weighting mechanism significantly extends the expressivity of the reduced model with light-weight computational efforts. Our simulator is versatile and can be well interfaced with many existing techniques. It also supports local DOF adaption to incorporate novel deformations (i.e., induced by the collision). The proposed algorithm complements state-of-the-art model reduction and domain decomposition methods by seeking for good trade-offs among animation quality, numerical robustness, pre-computation complexity, and simulation efficiency from an alternative perspective.",
"title": "Physics-Based Quadratic Deformation Using Elastic Weighting",
"normalizedTitle": "Physics-Based Quadratic Deformation Using Elastic Weighting",
"fno": "08207608",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Strain",
"Deformable Models",
"Shape",
"Computational Modeling",
"Numerical Models",
"Couplings",
"Adaptation Models",
"Quadratic Deformation",
"FEM",
"Model Reduction",
"Domain Decomposition",
"Weight Function"
],
"authors": [
{
"givenName": "Ran",
"surname": "Luo",
"fullName": "Ran Luo",
"affiliation": "Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weiwei",
"surname": "Xu",
"fullName": "Weiwei Xu",
"affiliation": "State Key Lab of CAD&CG at Zhejiang University, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huamin",
"surname": "Wang",
"fullName": "Huamin Wang",
"affiliation": "Department of Computer Science and Engineering, Ohio State University, Columbus, OH",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kun",
"surname": "Zhou",
"fullName": "Kun Zhou",
"affiliation": "State Key Lab of CAD&CG at Zhejiang University, Zhejiang, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yin",
"surname": "Yang",
"fullName": "Yin Yang",
"affiliation": "Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2018-12-01 00:00:00",
"pubType": "trans",
"pages": "3188-3199",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2014/5118/0/5118c321",
"title": "Deformable Object Matching via Deformation Decomposition Based 2D Label MRF",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c321/12OmNBiygyL",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2017/2089/0/2089a088",
"title": "Interactive Physics-Based Deformation for Virtual Worlds",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2017/2089a088/12OmNBt3qoi",
"parentPublication": {
"id": "proceedings/cw/2017/2089/0",
"title": "2017 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccairo/2017/6536/0/6536a127",
"title": "A Method of Region Segmentation in Grayscale Images Inspired by Physical Elastic Deformation",
"doi": null,
"abstractUrl": "/proceedings-article/iccairo/2017/6536a127/12OmNCbU2V0",
"parentPublication": {
"id": "proceedings/iccairo/2017/6536/0",
"title": "2017 International Conference on Control, Artificial Intelligence, Robotics & Optimization (ICCAIRO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2014/6184/0/06948432",
"title": "Single view augmentation of 3D elastic objects",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2014/06948432/12OmNwDj106",
"parentPublication": {
"id": "proceedings/ismar/2014/6184/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2009/3789/0/3789a044",
"title": "Facial Expression Representation Using a Quadratic Deformation Model",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a044/12OmNxEBz8F",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2022/6908/0/690800a056",
"title": "An Examination of Rounder Deformation Optimization Combining As-Rigid-As-Possible and Spherical Feature",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2022/690800a056/1FWmYIeg9VK",
"parentPublication": {
"id": "proceedings/nicoint/2022/6908/0",
"title": "2022 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/03/08839414",
"title": "Sparse Data Driven Mesh Deformation",
"doi": null,
"abstractUrl": "/journal/tg/2021/03/08839414/1dqsrINsJsk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08886386",
"title": "Improved Deformation-Driven Element Packing with RepulsionPak",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08886386/1ewvxnLTZgk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/02/09537699",
"title": "Multiscale Mesh Deformation Component Analysis With Attention-Based Autoencoders",
"doi": null,
"abstractUrl": "/journal/tg/2023/02/09537699/1wTiueApSAU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800a373",
"title": "Deep Physics-aware Inference of Cloth Deformation for Monocular Human Performance Capture",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800a373/1zWEhX4bw76",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08067498",
"articleId": "14H4WRabB9m",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08118164",
"articleId": "14H4WLmgedy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXnFsn",
"name": "ttg201812-08207608s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201812-08207608s1.zip",
"extension": "zip",
"size": "40.5 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBcj5Eq",
"title": "Jan.-Feb.",
"year": "2018",
"issueNum": "01",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "20",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbs1Wl",
"doi": "10.1109/MCSE.2018.011111125",
"abstract": "It’s becoming increasingly challenging to efficiently visualize and extract useful insight from complex and big data sets. JavaScript stands out as a suitable programming choice that offers mature libraries, easy implementation, and extensive customization, all of which stay in the shadow of new and rapid developments in the language. To illustrate the use of JavaScript in a scientific context, this article elaborates on Lexicon, a collection of JavaScript libraries for generating interactive visualizations in bioinformatics and other custom libraries.",
"abstracts": [
{
"abstractType": "Regular",
"content": "It’s becoming increasingly challenging to efficiently visualize and extract useful insight from complex and big data sets. JavaScript stands out as a suitable programming choice that offers mature libraries, easy implementation, and extensive customization, all of which stay in the shadow of new and rapid developments in the language. To illustrate the use of JavaScript in a scientific context, this article elaborates on Lexicon, a collection of JavaScript libraries for generating interactive visualizations in bioinformatics and other custom libraries.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "It’s becoming increasingly challenging to efficiently visualize and extract useful insight from complex and big data sets. JavaScript stands out as a suitable programming choice that offers mature libraries, easy implementation, and extensive customization, all of which stay in the shadow of new and rapid developments in the language. To illustrate the use of JavaScript in a scientific context, this article elaborates on Lexicon, a collection of JavaScript libraries for generating interactive visualizations in bioinformatics and other custom libraries.",
"title": "Lexicon Visualization Library and JavaScript for Scientific Data Visualization",
"normalizedTitle": "Lexicon Visualization Library and JavaScript for Scientific Data Visualization",
"fno": "mcs2018010050",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Big Data",
"Bioinformatics",
"Data Visualisation",
"Interactive Systems",
"Java",
"Custom Libraries",
"Bioinformatics",
"Interactive Visualizations",
"Scientific Context",
"Extensive Customization",
"Big Data Sets",
"Scientific Data Visualization",
"Java Script",
"Lexicon Visualization Library",
"Libraries",
"Data Visualization",
"Genomics",
"Proteins",
"Bioinformatics",
"Big Data",
"Visualization",
"Computer Languages",
"Java",
"Scientific Computing",
"Java Script",
"ES 6",
"Genetics",
"Medicine",
"Data Visualization",
"Object Oriented Programming",
"Bioinformatics",
"ES 5"
],
"authors": [
{
"givenName": "Ibrahim",
"surname": "Tanyalcin",
"fullName": "Ibrahim Tanyalcin",
"affiliation": "(IB)2, Vrije Universiteit Brussel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Carla",
"surname": "Al Assaf",
"fullName": "Carla Al Assaf",
"affiliation": "KU Leuven",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Julien",
"surname": "Ferte",
"fullName": "Julien Ferte",
"affiliation": "(IB)2, Université Libre de Bruxelles",
"__typename": "ArticleAuthorType"
},
{
"givenName": "François",
"surname": "Ancien",
"fullName": "François Ancien",
"affiliation": "(IB)2, Universite Libre De Bruxelles",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Taushif",
"surname": "Khan",
"fullName": "Taushif Khan",
"affiliation": "(IB)2, Vrije Universiteit Brussel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guillaume",
"surname": "Smits",
"fullName": "Guillaume Smits",
"affiliation": "(IB)2, Université Libre de Bruxelles",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marianne",
"surname": "Rooman",
"fullName": "Marianne Rooman",
"affiliation": "(IB)2, Université Libre de Bruxelles",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wim",
"surname": "Vranken",
"fullName": "Wim Vranken",
"affiliation": "(IB)2, Vrije Universiteit Brussel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "mags",
"pages": "50-65",
"year": "2018",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/e-science/2011/2163/0/06123260",
"title": "Optimizing Phylogenetic Analysis Using SciHmm Cloud-based Scientific Workflow",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2011/06123260/12OmNBVIUyv",
"parentPublication": {
"id": "proceedings/e-science/2011/2163/0",
"title": "2011 IEEE 7th International Conference on E-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2013/3218/0/06778639",
"title": "Visualizing Linked Data with JavaScript",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2013/06778639/12OmNCzsKI9",
"parentPublication": {
"id": "proceedings/wisa/2013/3218/0",
"title": "2013 10th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2016/5510/0/07881571",
"title": "Browser Performance of JavaScript Framework, SAPUI5 & jQuery",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2016/07881571/12OmNxwncdl",
"parentPublication": {
"id": "proceedings/csci/2016/5510/0",
"title": "2016 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2011/02/mcs2011020040",
"title": "Mayavi: 3D Visualization of Scientific Data",
"doi": null,
"abstractUrl": "/magazine/cs/2011/02/mcs2011020040/13rRUwInv8p",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2016/02/07298430",
"title": "Creating Engaging Online Learning Material with the JSAV JavaScript Algorithm Visualization Library",
"doi": null,
"abstractUrl": "/journal/lt/2016/02/07298430/13rRUyeTVmN",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2018/01/mcs2018010020",
"title": "Math.Js: An Advanced Mathematics Library For JavaScript",
"doi": null,
"abstractUrl": "/magazine/cs/2018/01/mcs2018010020/13rRUyfbwus",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/met/2018/5729/0/572901a034",
"title": "Metamorphic Testing for Adobe Analytics Data Collection JavaScript Library",
"doi": null,
"abstractUrl": "/proceedings-article/met/2018/572901a034/13xI8AY2mmK",
"parentPublication": {
"id": "proceedings/met/2018/5729/0",
"title": "2018 IEEE/ACM 3rd International Workshop on Metamorphic Testing (MET)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2019/0869/0/086900a083",
"title": "Reasonably-Most-General Clients for JavaScript Library Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2019/086900a083/1cMFsP6uJYQ",
"parentPublication": {
"id": "proceedings/icse/2019/0869/0",
"title": "2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a111",
"title": "DRUID<inf>JS</inf> — A JavaScript Library for Dimensionality Reduction",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a111/1qRNP6eEG52",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09557192",
"title": "Gosling: A Grammar-based Toolkit for Scalable and Interactive Genomics Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09557192/1xlw1UFWxDa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcs2018010043",
"articleId": "13rRUyYjK83",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcs2018010066",
"articleId": "13rRUx0xPDU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFiQ",
"title": "January/February",
"year": "2012",
"issueNum": "01",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "32",
"label": "January/February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyuegjn",
"doi": "10.1109/MCG.2012.24",
"abstract": "Scientists frequently tell stories using visualizations of scientific data, in the process of disseminating findings to peers and the general public. However, techniques and methods for effective scientific storytelling have received little attention so far. This article explores how literary and theatrical narrative conventions can inform the design and presentation of visualizations, and discusses the challenges of adapting scientific visualizations for broader audiences. It also summarizes recent workshops' findings on the role of storytelling in visualizations, and presents several examples of successful scientific-storytelling production teams. The conclusion is that scientific storytelling deserves greater support and recognition by the visualization community.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Scientists frequently tell stories using visualizations of scientific data, in the process of disseminating findings to peers and the general public. However, techniques and methods for effective scientific storytelling have received little attention so far. This article explores how literary and theatrical narrative conventions can inform the design and presentation of visualizations, and discusses the challenges of adapting scientific visualizations for broader audiences. It also summarizes recent workshops' findings on the role of storytelling in visualizations, and presents several examples of successful scientific-storytelling production teams. The conclusion is that scientific storytelling deserves greater support and recognition by the visualization community.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Scientists frequently tell stories using visualizations of scientific data, in the process of disseminating findings to peers and the general public. However, techniques and methods for effective scientific storytelling have received little attention so far. This article explores how literary and theatrical narrative conventions can inform the design and presentation of visualizations, and discusses the challenges of adapting scientific visualizations for broader audiences. It also summarizes recent workshops' findings on the role of storytelling in visualizations, and presents several examples of successful scientific-storytelling production teams. The conclusion is that scientific storytelling deserves greater support and recognition by the visualization community.",
"title": "Scientific Storytelling Using Visualization",
"normalizedTitle": "Scientific Storytelling Using Visualization",
"fno": "mcg2012010012",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Information Resources",
"Knowledge Transfer",
"Science General",
"Data Visualization",
"Graphics And Multimedia",
"Information Visualization",
"Scientific Visualization",
"Scientific Storytelling",
"Storytelling",
"Ani Viz",
"Exploratorium",
"Computer Graphics"
],
"authors": [
{
"givenName": "Kwan-Liu",
"surname": "Ma",
"fullName": "Kwan-Liu Ma",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Isaac",
"surname": "Liao",
"fullName": "Isaac Liao",
"affiliation": "University of California, Davis",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jennifer",
"surname": "Frazier",
"fullName": "Jennifer Frazier",
"affiliation": "The Exploratorium",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helwig",
"surname": "Hauser",
"fullName": "Helwig Hauser",
"affiliation": "University of Bergen",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Helen-Nicole",
"surname": "Kostis",
"fullName": "Helen-Nicole Kostis",
"affiliation": "NASA Goddard Space Flight Center",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2012-01-01 00:00:00",
"pubType": "mags",
"pages": "12-19",
"year": "2012",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2004/2177/0/21770519",
"title": "Learning from Architects: The Difference between Knowledge Visualization and Information Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770519/12OmNx9nGLN",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2014/4103/0/4103a018",
"title": "How to Tell Stories Using Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a018/12OmNynJMVN",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2015/7367/0/7367a412",
"title": "Exploring Storytelling for Relationship Building in Offshore Outsourced Projects: An Action Research Investigation",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2015/7367a412/12OmNzahceJ",
"parentPublication": {
"id": "proceedings/hicss/2015/7367/0",
"title": "2015 48th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2011/02/mcg2011020080",
"title": "Generative Storytelling for Information Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2011/02/mcg2011020080/13rRUxBa5pd",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2016/06/mcs2016060068",
"title": "Audience-Targeted Design Considerations for Effective Scientific Storytelling",
"doi": null,
"abstractUrl": "/magazine/cs/2016/06/mcs2016060068/13rRUxZRbvI",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/05/mco2013050051",
"title": "Reimagining the Scientific Visualization Interaction Paradigm",
"doi": null,
"abstractUrl": "/magazine/co/2013/05/mco2013050051/13rRUy0ZzW0",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1994/02/mcg1994020061",
"title": "Research Issues in Scientific Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/1994/02/mcg1994020061/13rRUyp7tYY",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08523628",
"title": "Scientific Visualization as a Microservice",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08523628/17D45WaTkiH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/5555/01/10107759",
"title": "The Stories We Tell About Data: Surveying Data-Driven Storytelling Using Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/5555/01/10107759/1MDGmTM8oOA",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mcg2012010008",
"articleId": "13rRUwjoNzH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2012010020",
"articleId": "13rRUxCitAW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwoxSj5",
"title": "Aug.",
"year": "2017",
"issueNum": "08",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxOdD2K",
"doi": "10.1109/TVCG.2016.2597830",
"abstract": "Procedural modeling techniques can produce high quality visual content through complex rule sets. However, controlling the outputs of these techniques for design purposes is often notoriously difficult for users due to the large number of parameters involved in these rule sets and also their non-linear relationship to the resulting content. To circumvent this problem, we present a sketch-based approach to procedural modeling. Given an approximate and abstract hand-drawn 2D sketch provided by a user, our algorithm automatically computes a set of procedural model parameters, which in turn yield multiple, detailed output shapes that resemble the user's input sketch. The user can then select an output shape, or further modify the sketch to explore alternative ones. At the heart of our approach is a deep Convolutional Neural Network (CNN) that is trained to map sketches to procedural model parameters. The network is trained by large amounts of automatically generated synthetic line drawings. By using an intuitive medium, i.e., freehand sketching as input, users are set free from manually adjusting procedural model parameters, yet they are still able to create high quality content. We demonstrate the accuracy and efficacy of our method in a variety of procedural modeling scenarios including design of man-made and organic shapes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Procedural modeling techniques can produce high quality visual content through complex rule sets. However, controlling the outputs of these techniques for design purposes is often notoriously difficult for users due to the large number of parameters involved in these rule sets and also their non-linear relationship to the resulting content. To circumvent this problem, we present a sketch-based approach to procedural modeling. Given an approximate and abstract hand-drawn 2D sketch provided by a user, our algorithm automatically computes a set of procedural model parameters, which in turn yield multiple, detailed output shapes that resemble the user's input sketch. The user can then select an output shape, or further modify the sketch to explore alternative ones. At the heart of our approach is a deep Convolutional Neural Network (CNN) that is trained to map sketches to procedural model parameters. The network is trained by large amounts of automatically generated synthetic line drawings. By using an intuitive medium, i.e., freehand sketching as input, users are set free from manually adjusting procedural model parameters, yet they are still able to create high quality content. We demonstrate the accuracy and efficacy of our method in a variety of procedural modeling scenarios including design of man-made and organic shapes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Procedural modeling techniques can produce high quality visual content through complex rule sets. However, controlling the outputs of these techniques for design purposes is often notoriously difficult for users due to the large number of parameters involved in these rule sets and also their non-linear relationship to the resulting content. To circumvent this problem, we present a sketch-based approach to procedural modeling. Given an approximate and abstract hand-drawn 2D sketch provided by a user, our algorithm automatically computes a set of procedural model parameters, which in turn yield multiple, detailed output shapes that resemble the user's input sketch. The user can then select an output shape, or further modify the sketch to explore alternative ones. At the heart of our approach is a deep Convolutional Neural Network (CNN) that is trained to map sketches to procedural model parameters. The network is trained by large amounts of automatically generated synthetic line drawings. By using an intuitive medium, i.e., freehand sketching as input, users are set free from manually adjusting procedural model parameters, yet they are still able to create high quality content. We demonstrate the accuracy and efficacy of our method in a variety of procedural modeling scenarios including design of man-made and organic shapes.",
"title": "Shape Synthesis from Sketches via Procedural Models and Convolutional Networks",
"normalizedTitle": "Shape Synthesis from Sketches via Procedural Models and Convolutional Networks",
"fno": "07530838",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Shape",
"Computational Modeling",
"Three Dimensional Displays",
"Two Dimensional Displays",
"Neural Networks",
"Solid Modeling",
"Computer Architecture",
"Shape Synthesis",
"Convolutional Neural Networks",
"Procedural Modeling",
"Sketch Based Modeling"
],
"authors": [
{
"givenName": "Haibin",
"surname": "Huang",
"fullName": "Haibin Huang",
"affiliation": "University of Massachusetts Amherst, Amherst, MA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Evangelos",
"surname": "Kalogerakis",
"fullName": "Evangelos Kalogerakis",
"affiliation": "University of Massachusetts Amherst, Amherst, MA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ersin",
"surname": "Yumer",
"fullName": "Ersin Yumer",
"affiliation": "Adobe Research, San Jose, CA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Radomir",
"surname": "Mech",
"fullName": "Radomir Mech",
"affiliation": "Adobe Research, San Jose, CA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2017-08-01 00:00:00",
"pubType": "trans",
"pages": "2003-2013",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2017/2610/0/261001a067",
"title": "3D Shape Reconstruction from Sketches via Multi-view Convolutional Networks",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a067/12OmNCu4nbZ",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2016/4400/0/4400a261",
"title": "3D Model Retrieval Based on Hand Drawn Sketches Using LDA Model",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2016/4400a261/12OmNqyUUvj",
"parentPublication": {
"id": "proceedings/icdh/2016/4400/0",
"title": "2016 6th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2017/2219/0/2219a031",
"title": "CAD Shape Grammar: Procedural Generation for Massive CAD Model",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2017/2219a031/12OmNy6qfJ2",
"parentPublication": {
"id": "proceedings/sibgrapi/2017/2219/0",
"title": "2017 30th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2018/9497/0/949700a311",
"title": "Sketch-Based Shape Retrieval via Multi-view Attention and Generalized Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2018/949700a311/17D45VObpQZ",
"parentPublication": {
"id": "proceedings/icdh/2018/9497/0",
"title": "2018 7th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2018/7315/0/731500a066",
"title": "Enhancing Sketching and Sculpting for Shape Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2018/731500a066/17D45WWzW7i",
"parentPublication": {
"id": "proceedings/cw/2018/7315/0",
"title": "2018 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2018/7315/0/731500a033",
"title": "Facial Expression Editing in Face Sketch Using Shape Space Theory",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2018/731500a033/17D45XacGkk",
"parentPublication": {
"id": "proceedings/cw/2018/7315/0",
"title": "2018 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2019/4637/0/463700a029",
"title": "A Survey of Procedural Dungeon Generation",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2019/463700a029/1fHHpYoajCg",
"parentPublication": {
"id": "proceedings/sbgames/2019/4637/0",
"title": "2019 18th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09007505",
"title": "Sketch Augmentation-Driven Shape Retrieval Learning Framework Based on Convolutional Neural Networks",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09007505/1hJKlMJzueI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/10/09095367",
"title": "PICO: Procedural Iterative Constrained Optimizer for Geometric Modeling",
"doi": null,
"abstractUrl": "/journal/tg/2021/10/09095367/1jVMiYPPf0I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2020/9228/0/922800a510",
"title": "Sketch2Relief: Generating Bas-relief from Sketches with Deep Generative Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a510/1pP3DzePTB6",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07493610",
"articleId": "13rRUwj7cpg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07544591",
"articleId": "13rRUyfbwqP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1wznUTxaKsw",
"title": "Oct.",
"year": "2021",
"issueNum": "10",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1jVMiYPPf0I",
"doi": "10.1109/TVCG.2020.2995556",
"abstract": "Procedural modeling has produced amazing results, yet fundamental issues such as controllability and limited user guidance persist. We introduce a novel procedural model called PICO (Procedural Iterative Constrained Optimizer) and PICO-Graph that is the underlying procedural model designed with optimization in mind. The key novelty of PICO is that it enables the exploration of generative designs by combining both user and environmental constraints into a single framework by using optimization without the need to write procedural rules. The PICO-Graph procedural model consists of a set of geometry generating operations and a set of axioms connected in a directed cyclic graph. The forward generation is initiated by a set of axioms that use the connections to send coordinate systems and geometric objects through the PICO-Graph, which in turn generates more objects. This allows for fast generation of complex and varied geometries. Moreover, we combine PICO-Graph with efficient optimization that allows for quick exploration of the generated models and the generation of variants. The user defines the rules, the axioms, and the set of constraints; for example, whether an existing object should be supported by the generated model, whether symmetries exist, whether the object should spin, etc. PICO then generates a class of geometric models and optimizes them so that they fulfill the constraints. The generation and the optimization in our implementation provides interactive user control during model execution providing continuous feedback. For example, the user can sketch the constraints and guide the geometry to meet these specified goals. We show PICO on a variety of examples such as the generation of procedural chairs with multiple supports, generation of support structures for 3D printing, generation of spinning objects, or generation of procedural terrains matching a given input. Our framework could be used as a component in a larger design workflow; its strongest application is in the early rapid ideation and prototyping phases.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Procedural modeling has produced amazing results, yet fundamental issues such as controllability and limited user guidance persist. We introduce a novel procedural model called PICO (Procedural Iterative Constrained Optimizer) and PICO-Graph that is the underlying procedural model designed with optimization in mind. The key novelty of PICO is that it enables the exploration of generative designs by combining both user and environmental constraints into a single framework by using optimization without the need to write procedural rules. The PICO-Graph procedural model consists of a set of geometry generating operations and a set of axioms connected in a directed cyclic graph. The forward generation is initiated by a set of axioms that use the connections to send coordinate systems and geometric objects through the PICO-Graph, which in turn generates more objects. This allows for fast generation of complex and varied geometries. Moreover, we combine PICO-Graph with efficient optimization that allows for quick exploration of the generated models and the generation of variants. The user defines the rules, the axioms, and the set of constraints; for example, whether an existing object should be supported by the generated model, whether symmetries exist, whether the object should spin, etc. PICO then generates a class of geometric models and optimizes them so that they fulfill the constraints. The generation and the optimization in our implementation provides interactive user control during model execution providing continuous feedback. For example, the user can sketch the constraints and guide the geometry to meet these specified goals. We show PICO on a variety of examples such as the generation of procedural chairs with multiple supports, generation of support structures for 3D printing, generation of spinning objects, or generation of procedural terrains matching a given input. Our framework could be used as a component in a larger design workflow; its strongest application is in the early rapid ideation and prototyping phases.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Procedural modeling has produced amazing results, yet fundamental issues such as controllability and limited user guidance persist. We introduce a novel procedural model called PICO (Procedural Iterative Constrained Optimizer) and PICO-Graph that is the underlying procedural model designed with optimization in mind. The key novelty of PICO is that it enables the exploration of generative designs by combining both user and environmental constraints into a single framework by using optimization without the need to write procedural rules. The PICO-Graph procedural model consists of a set of geometry generating operations and a set of axioms connected in a directed cyclic graph. The forward generation is initiated by a set of axioms that use the connections to send coordinate systems and geometric objects through the PICO-Graph, which in turn generates more objects. This allows for fast generation of complex and varied geometries. Moreover, we combine PICO-Graph with efficient optimization that allows for quick exploration of the generated models and the generation of variants. The user defines the rules, the axioms, and the set of constraints; for example, whether an existing object should be supported by the generated model, whether symmetries exist, whether the object should spin, etc. PICO then generates a class of geometric models and optimizes them so that they fulfill the constraints. The generation and the optimization in our implementation provides interactive user control during model execution providing continuous feedback. For example, the user can sketch the constraints and guide the geometry to meet these specified goals. We show PICO on a variety of examples such as the generation of procedural chairs with multiple supports, generation of support structures for 3D printing, generation of spinning objects, or generation of procedural terrains matching a given input. Our framework could be used as a component in a larger design workflow; its strongest application is in the early rapid ideation and prototyping phases.",
"title": "PICO: Procedural Iterative Constrained Optimizer for Geometric Modeling",
"normalizedTitle": "PICO: Procedural Iterative Constrained Optimizer for Geometric Modeling",
"fno": "09095367",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Directed Graphs",
"Graph Theory",
"Iterative Methods",
"Optimisation",
"Solid Modelling",
"Procedural Iterative Constrained Optimizer",
"Geometry Generating Operations",
"Axioms",
"Continuous Feedback",
"PICO Graph Procedural Model",
"Environmental Constraints",
"User Constraints",
"Procedural Terrains",
"Procedural Chairs",
"Execution Model",
"Geometric Models",
"Forward Generation",
"Directed Cyclic Graph",
"Optimization",
"Geometry",
"Shape",
"Computational Modeling",
"Grammar",
"Three Dimensional Displays",
"Solid Modeling",
"Computational Geometry And Object Modeling",
"Three Dimensional Graphics And Realism"
],
"authors": [
{
"givenName": "Vojtěch",
"surname": "Krs",
"fullName": "Vojtěch Krs",
"affiliation": "Adobe Research, San Jose, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Radomír",
"surname": "Měch",
"fullName": "Radomír Měch",
"affiliation": "Adobe Research, San Jose, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mathieu",
"surname": "Gaillard",
"fullName": "Mathieu Gaillard",
"affiliation": "Department of Computer Graphics Technology, Purdue University, West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nathan",
"surname": "Carr",
"fullName": "Nathan Carr",
"affiliation": "Adobe Research, San Jose, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bedrich",
"surname": "Benes",
"fullName": "Bedrich Benes",
"affiliation": "Department of Computer Graphics Technology, Purdue University, West Lafayette, IN, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2021-10-01 00:00:00",
"pubType": "trans",
"pages": "3968-3981",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2015/8391/0/8391c147",
"title": "Procedural Editing of 3D Building Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391c147/12OmNAlvHzS",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2015/8843/0/8843a089",
"title": "Real-Time Procedural Generation of Personalized Facade and Interior Appearances Based on Semantics",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2015/8843a089/12OmNsbGvJK",
"parentPublication": {
"id": "proceedings/sbgames/2015/8843/0",
"title": "2015 14th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571146",
"title": "Challenges and Perspectives of Procedural Modelling and Effects",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571146/12OmNwbcJ63",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2015/7204/0/7204a075",
"title": "Split Grammar Evolution for Procedural Modeling of Virtual Buildings",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2015/7204a075/12OmNx2QUDr",
"parentPublication": {
"id": "proceedings/svr/2015/7204/0",
"title": "2015 XVII Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2017/2219/0/2219a031",
"title": "CAD Shape Grammar: Procedural Generation for Massive CAD Model",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2017/2219a031/12OmNy6qfJ2",
"parentPublication": {
"id": "proceedings/sibgrapi/2017/2219/0",
"title": "2017 30th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a194",
"title": "Proceduralization for Editing 3D Architectural Models",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a194/12OmNzw8j1O",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2011/03/05960781",
"title": "Generating consistent buildings: a semantic approach for integrating procedural techniques",
"doi": null,
"abstractUrl": "/journal/ci/2011/03/05960781/13rRUyp7tZc",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08502874",
"title": "Selection Expressions for Procedural Modeling",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08502874/14C6d3xkDcJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smc-it/2019/1545/0/154500a070",
"title": "Procedural Generation of 3D Planetary-Scale Terrains",
"doi": null,
"abstractUrl": "/proceedings-article/smc-it/2019/154500a070/1e10ss3Ote8",
"parentPublication": {
"id": "proceedings/smc-it/2019/1545/0",
"title": "2019 IEEE International Conference on Space Mission Challenges for Information Technology (SMC-IT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icat/2019/4543/0/08939012",
"title": "Survey of integrability of procedural modeling techniques for generating a complete city",
"doi": null,
"abstractUrl": "/proceedings-article/icat/2019/08939012/1fYfyy3Ny4o",
"parentPublication": {
"id": "proceedings/icat/2019/4543/0",
"title": "2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09094378",
"articleId": "1jQNru4p18k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09095378",
"articleId": "1jVMhXgfiOQ",
"__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": "13rRUwInvAY",
"doi": "10.1109/TVCG.2008.194",
"abstract": "Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a data set to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap, we report on a between-subjects experiment comparing novice users' error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions, the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the data set, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users analyzing complex spatiotemporal patterns.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a data set to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap, we report on a between-subjects experiment comparing novice users' error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions, the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the data set, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users analyzing complex spatiotemporal patterns.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a data set to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap, we report on a between-subjects experiment comparing novice users' error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions, the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the data set, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users analyzing complex spatiotemporal patterns.",
"title": "An Evaluation of Space Time Cube Representation of Spatiotemporal Patterns",
"normalizedTitle": "An Evaluation of Space Time Cube Representation of Spatiotemporal Patterns",
"fno": "ttg2009040696",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Information Visualization",
"Evaluation Methodology",
"Space Time Cube"
],
"authors": [
{
"givenName": "Per Ola",
"surname": "Kristensson",
"fullName": "Per Ola Kristensson",
"affiliation": "University of Cambridge, Cambridge",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nils",
"surname": "Dahlbäck",
"fullName": "Nils Dahlbäck",
"affiliation": "Linköping University, Linköping",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Daniel",
"surname": "Anundi",
"fullName": "Daniel Anundi",
"affiliation": "Linköping University, Linköping",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Marius",
"surname": "Björnstad",
"fullName": "Marius Björnstad",
"affiliation": "Linköping University, Linköping",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hanna",
"surname": "Gillberg",
"fullName": "Hanna Gillberg",
"affiliation": "Linköping University, Linköping",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jonas",
"surname": "Haraldsson",
"fullName": "Jonas Haraldsson",
"affiliation": "Linköping University, Linköping",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ingrid",
"surname": "Mårtensson",
"fullName": "Ingrid Mårtensson",
"affiliation": "Linköping University, Linköping",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mathias",
"surname": "Nordvall",
"fullName": "Mathias Nordvall",
"affiliation": "Linköping University, Linköping",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Josefine",
"surname": "Ståhl",
"fullName": "Josefine Ståhl",
"affiliation": "Linköping University, Linköping",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2009-07-01 00:00:00",
"pubType": "trans",
"pages": "696-702",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/e-science/2016/4273/0/07870891",
"title": "Representation of continuously changing data over time and space: Modeling the shape of spatiotemporal phenomena",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2016/07870891/12OmNs0C9Qf",
"parentPublication": {
"id": "proceedings/e-science/2016/4273/0",
"title": "2016 IEEE 12th International Conference on e-Science (e-Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2004/2177/0/21770145",
"title": "Interactive Analysis of Event Data Using Space-Time Cube",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770145/12OmNwMXnqt",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipps/1996/7255/0/72550666",
"title": "An Optical Interconnect Model for k-ary n-cube Wormhole Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1996/72550666/12OmNwvVrDj",
"parentPublication": {
"id": "proceedings/ipps/1996/7255/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2009/3801/3/3801c001",
"title": "Visualization Cube: Modeling Interaction for Exploratory Data Analysis of Spatiotemporal Trend Information",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2009/3801c001/12OmNxGj9Qu",
"parentPublication": {
"id": "proceedings/wi-iat/2009/3801/3",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2011/12/ttk2011121795",
"title": "Efficient Keyword-Based Search for Top-K Cells in Text Cube",
"doi": null,
"abstractUrl": "/journal/tk/2011/12/ttk2011121795/13rRUEgaro8",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2003/05/t0645",
"title": "Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems",
"doi": null,
"abstractUrl": "/journal/tc/2003/05/t0645/13rRUxBJhun",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122129",
"title": "Space-Time Visual Analytics of Eye-Tracking Data for Dynamic Stimuli",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122129/13rRUxBa5rW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258325",
"title": "Spatiotemporal visualization of traffic paths using color space time curve",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258325/17D45XeKgni",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600u0122",
"title": "Decoupling and Recoupling Spatiotemporal Representation for RGB-D-based Motion Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600u0122/1H0LlRjEeju",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08854316",
"title": "Evaluating an Immersive Space-Time Cube Geovisualization for Intuitive Trajectory Data Exploration",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08854316/1dM2fkHbAVa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009040682",
"articleId": "13rRUxOdD8e",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAfgwyx",
"title": "Dec.",
"year": "2014",
"issueNum": "12",
"idPrefix": "tk",
"pubType": "journal",
"volume": "26",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy2YLYY",
"doi": "10.1109/TKDE.2014.2313872",
"abstract": "Short texts are popular on today’s web, especially with the emergence of social media. Inferring topics from large scale short texts becomes a critical but challenging task for many content analysis tasks. Conventional topic models such as latent Dirichlet allocation (LDA) and probabilistic latent semantic analysis (PLSA) learn topics from document-level word co-occurrences by modeling each document as a mixture of topics, whose inference suffers from the sparsity of word co-occurrence patterns in short texts. In this paper, we propose a novel way for short text topic modeling, referred as biterm topic model (BTM). BTM learns topics by directly modeling the generation of word co-occurrence patterns (i.e., biterms) in the corpus, making the inference effective with the rich corpus-level information. To cope with large scale short text data, we further introduce two online algorithms for BTM for efficient topic learning. Experiments on real-word short text collections show that BTM can discover more prominent and coherent topics, and significantly outperform the state-of-the-art baselines. We also demonstrate the appealing performance of the two online BTM algorithms on both time efficiency and topic learning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Short texts are popular on today’s web, especially with the emergence of social media. Inferring topics from large scale short texts becomes a critical but challenging task for many content analysis tasks. Conventional topic models such as latent Dirichlet allocation (LDA) and probabilistic latent semantic analysis (PLSA) learn topics from document-level word co-occurrences by modeling each document as a mixture of topics, whose inference suffers from the sparsity of word co-occurrence patterns in short texts. In this paper, we propose a novel way for short text topic modeling, referred as biterm topic model (BTM). BTM learns topics by directly modeling the generation of word co-occurrence patterns (i.e., biterms) in the corpus, making the inference effective with the rich corpus-level information. To cope with large scale short text data, we further introduce two online algorithms for BTM for efficient topic learning. Experiments on real-word short text collections show that BTM can discover more prominent and coherent topics, and significantly outperform the state-of-the-art baselines. We also demonstrate the appealing performance of the two online BTM algorithms on both time efficiency and topic learning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Short texts are popular on today’s web, especially with the emergence of social media. Inferring topics from large scale short texts becomes a critical but challenging task for many content analysis tasks. Conventional topic models such as latent Dirichlet allocation (LDA) and probabilistic latent semantic analysis (PLSA) learn topics from document-level word co-occurrences by modeling each document as a mixture of topics, whose inference suffers from the sparsity of word co-occurrence patterns in short texts. In this paper, we propose a novel way for short text topic modeling, referred as biterm topic model (BTM). BTM learns topics by directly modeling the generation of word co-occurrence patterns (i.e., biterms) in the corpus, making the inference effective with the rich corpus-level information. To cope with large scale short text data, we further introduce two online algorithms for BTM for efficient topic learning. Experiments on real-word short text collections show that BTM can discover more prominent and coherent topics, and significantly outperform the state-of-the-art baselines. We also demonstrate the appealing performance of the two online BTM algorithms on both time efficiency and topic learning.",
"title": "BTM: Topic Modeling over Short Texts",
"normalizedTitle": "BTM: Topic Modeling over Short Texts",
"fno": "06778764",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Semantics",
"Analytical Models",
"Inference Algorithms",
"Context",
"Time Complexity",
"Algorithm Design And Analysis",
"Data Models",
"Content Analysis",
"Short Text",
"Topic Model",
"Biterm",
"Online Algorithm"
],
"authors": [
{
"givenName": "Xueqi",
"surname": "Cheng",
"fullName": "Xueqi Cheng",
"affiliation": "Institute of Computing Technology, Chinese Academy of Sciences, Beijing, P.R., China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaohui",
"surname": "Yan",
"fullName": "Xiaohui Yan",
"affiliation": "Institute of Computing Technology, Chinese Academy of Sciences, Beijing, P.R., China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yanyan",
"surname": "Lan",
"fullName": "Yanyan Lan",
"affiliation": "Institute of Computing Technology, Chinese Academy of Sciences, Beijing, P.R., China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiafeng",
"surname": "Guo",
"fullName": "Jiafeng Guo",
"affiliation": "Institute of Computing Technology, Chinese Academy of Sciences, Beijing, P.R., China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2014-12-01 00:00:00",
"pubType": "trans",
"pages": "2928-2941",
"year": "2014",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2016/5473/0/07837989",
"title": "Topic Discovery for Short Texts Using Word Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07837989/12OmNAWpywe",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2016/3566/0/07839599",
"title": "Topic Modeling for Short Texts with Co-occurrence Frequency-Based Expansion",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2016/07839599/12OmNrJAdXV",
"parentPublication": {
"id": "proceedings/bracis/2016/3566/0",
"title": "2016 5th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2017/3120/0/3120a315",
"title": "Modeling Topic Evolution in Social Media Short Texts",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2017/3120a315/12OmNy2rS0U",
"parentPublication": {
"id": "proceedings/icbk/2017/3120/0",
"title": "2017 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0/07363164",
"title": "An Intention-Topic Model Based on Verbs Clustering and Short Texts Topic Mining",
"doi": null,
"abstractUrl": "/proceedings-article/cit-iucc-dasc-picom/2015/07363164/12OmNzWOB9n",
"parentPublication": {
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0",
"title": "2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a848",
"title": "Research on Improve Topic Representation over Short Text",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a848/12OmNzmclNR",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2018/7449/0/744900a975",
"title": "Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2018/744900a975/17D45VUZMUh",
"parentPublication": {
"id": "proceedings/ictai/2018/7449/0",
"title": "2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2022/7480/0/748000a160",
"title": "Topic Modeling for Short Texts Via Dual View Collaborate optimization",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2022/748000a160/1H44nThBZGo",
"parentPublication": {
"id": "proceedings/dsc/2022/7480/0",
"title": "2022 7th IEEE International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800c751",
"title": "Seeded-BTM: Enabling Biterm Topic Model with Seeds for Product Aspect Mining",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800c751/1dPokbm6C6A",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0",
"title": "2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2020/5619/0/561900a593",
"title": "AOBTM: Adaptive Online Biterm Topic Modeling for Version Sensitive Short-texts Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2020/561900a593/1oqKK1jxNYI",
"parentPublication": {
"id": "proceedings/icsme/2020/5619/0",
"title": "2020 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0/148500b050",
"title": "SP-BTM: A Specific Part-of-speech BTM for Service Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2020/148500b050/1ua4tUEwSe4",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0",
"title": "2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06807781",
"articleId": "13rRUxASupP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06547141",
"articleId": "13rRUxASuN0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1IUAvQtX5zW",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "35",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1sNm3Kthmi4",
"doi": "10.1109/TKDE.2021.3073195",
"abstract": "Recent years have witnessed the unprecedented growth of online social media, resulting in short texts being the prevalent format of information on the Internet. Given the sparsity of data, however, short-text topic modeling remains a critical yet much-watched challenge in both academia and industry. Research has been devoted to building different types of probabilistic topic models for short texts, among which self-aggregation methods emerged recently to provide informative cross-text word co-occurrences. However, models along this line are still in their infancy and typically yield overfit results and exhibit high computational costs. In this paper, we propose a novel model called Pseudo-document-based Topic Model (PTM), which introduces the concept of pseudo-document to implicitly aggregate short texts against data sparsity. By modeling the topic distributions of latent pseudo-documents rather than short texts, PTM yields excellent performance in accuracy and efficiency. A word embedding-enhanced PTM (WE-PTM) is also proposed to leverage pre-trained word embeddings, which is essential to further alleviating data sparsity. Extensive experiments with self-aggregation or word embedding-based baselines on four real-world datasets including two online media short texts, demonstrate the high-quality topics learned by our models. Robustness to limited training samples and the explainable semantics of topics are also investigated.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent years have witnessed the unprecedented growth of online social media, resulting in short texts being the prevalent format of information on the Internet. Given the sparsity of data, however, short-text topic modeling remains a critical yet much-watched challenge in both academia and industry. Research has been devoted to building different types of probabilistic topic models for short texts, among which self-aggregation methods emerged recently to provide informative cross-text word co-occurrences. However, models along this line are still in their infancy and typically yield overfit results and exhibit high computational costs. In this paper, we propose a novel model called Pseudo-document-based Topic Model (PTM), which introduces the concept of pseudo-document to implicitly aggregate short texts against data sparsity. By modeling the topic distributions of latent pseudo-documents rather than short texts, PTM yields excellent performance in accuracy and efficiency. A word embedding-enhanced PTM (WE-PTM) is also proposed to leverage pre-trained word embeddings, which is essential to further alleviating data sparsity. Extensive experiments with self-aggregation or word embedding-based baselines on four real-world datasets including two online media short texts, demonstrate the high-quality topics learned by our models. Robustness to limited training samples and the explainable semantics of topics are also investigated.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent years have witnessed the unprecedented growth of online social media, resulting in short texts being the prevalent format of information on the Internet. Given the sparsity of data, however, short-text topic modeling remains a critical yet much-watched challenge in both academia and industry. Research has been devoted to building different types of probabilistic topic models for short texts, among which self-aggregation methods emerged recently to provide informative cross-text word co-occurrences. However, models along this line are still in their infancy and typically yield overfit results and exhibit high computational costs. In this paper, we propose a novel model called Pseudo-document-based Topic Model (PTM), which introduces the concept of pseudo-document to implicitly aggregate short texts against data sparsity. By modeling the topic distributions of latent pseudo-documents rather than short texts, PTM yields excellent performance in accuracy and efficiency. A word embedding-enhanced PTM (WE-PTM) is also proposed to leverage pre-trained word embeddings, which is essential to further alleviating data sparsity. Extensive experiments with self-aggregation or word embedding-based baselines on four real-world datasets including two online media short texts, demonstrate the high-quality topics learned by our models. Robustness to limited training samples and the explainable semantics of topics are also investigated.",
"title": "Topic Modeling of Short Texts: A Pseudo-Document View With Word Embedding Enhancement",
"normalizedTitle": "Topic Modeling of Short Texts: A Pseudo-Document View With Word Embedding Enhancement",
"fno": "09404875",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Document Handling",
"Internet",
"Learning Artificial Intelligence",
"Natural Language Processing",
"Social Networking Online",
"Text Analysis",
"Informative Cross Text Word",
"Latent Pseudodocuments",
"Leverage Pre Trained Word Embeddings",
"Online Media Short Texts",
"Probabilistic Topic Models",
"Pseudodocument View",
"Pseudodocument Based Topic Model",
"Short Text Topic Modeling",
"WE PTM",
"Word Embedding Based Baselines",
"Word Embedding Enhanced PTM",
"Data Models",
"Computational Modeling",
"Social Networking Online",
"Aggregates",
"Standards",
"Probabilistic Logic",
"Training",
"Short Texts",
"Topic Modeling",
"Latent Dirichlet Allocation",
"Pseudo Document",
"Word Embedding"
],
"authors": [
{
"givenName": "Yuan",
"surname": "Zuo",
"fullName": "Yuan Zuo",
"affiliation": "Department of Information Systems, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Congrui",
"surname": "Li",
"fullName": "Congrui Li",
"affiliation": "Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hao",
"surname": "Lin",
"fullName": "Hao Lin",
"affiliation": "Department of Information Systems, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junjie",
"surname": "Wu",
"fullName": "Junjie Wu",
"affiliation": "Department of Information Systems, Beihang University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "972-985",
"year": "2023",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2016/5473/0/07837989",
"title": "Topic Discovery for Short Texts Using Word Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07837989/12OmNAWpywe",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2016/4459/0/4459a865",
"title": "Biterm Pseudo Document Topic Model for Short Text",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2016/4459a865/12OmNC2xhA2",
"parentPublication": {
"id": "proceedings/ictai/2016/4459/0",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bracis/2016/3566/0/07839599",
"title": "Topic Modeling for Short Texts with Co-occurrence Frequency-Based Expansion",
"doi": null,
"abstractUrl": "/proceedings-article/bracis/2016/07839599/12OmNrJAdXV",
"parentPublication": {
"id": "proceedings/bracis/2016/3566/0",
"title": "2016 5th Brazilian Conference on Intelligent Systems (BRACIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdataservice/2018/5119/0/511901a241",
"title": "Word Network Topic Model Based on Word2Vector",
"doi": null,
"abstractUrl": "/proceedings-article/bigdataservice/2018/511901a241/12OmNx76TI8",
"parentPublication": {
"id": "proceedings/bigdataservice/2018/5119/0",
"title": "2018 IEEE Fourth International Conference on Big Data Computing Service and Applications (BigDataService)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2017/3120/0/3120a315",
"title": "Modeling Topic Evolution in Social Media Short Texts",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2017/3120a315/12OmNy2rS0U",
"parentPublication": {
"id": "proceedings/icbk/2017/3120/0",
"title": "2017 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2016/4459/0/4459a852",
"title": "Robust Word-Network Topic Model for Short Texts",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2016/4459a852/12OmNzd7bXT",
"parentPublication": {
"id": "proceedings/ictai/2016/4459/0",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/12/06778764",
"title": "BTM: Topic Modeling over Short Texts",
"doi": null,
"abstractUrl": "/journal/tk/2014/12/06778764/13rRUy2YLYY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2018/9159/0/08594882",
"title": "ASTM: An Attentional Segmentation Based Topic Model for Short Texts",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2018/08594882/17D45WwsQ6M",
"parentPublication": {
"id": "proceedings/icdm/2018/9159/0",
"title": "2018 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2022/7480/0/748000a160",
"title": "Topic Modeling for Short Texts Via Dual View Collaborate optimization",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2022/748000a160/1H44nThBZGo",
"parentPublication": {
"id": "proceedings/dsc/2022/7480/0",
"title": "2022 7th IEEE International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbaie/2020/6499/0/09196423",
"title": "Enhancing Short Text Topic Modeling with FastText Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/icbaie/2020/09196423/1n90XZYUS4g",
"parentPublication": {
"id": "proceedings/icbaie/2020/6499/0",
"title": "2020 International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering (ICBAIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09444851",
"articleId": "1u51rZ1F5ew",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09409694",
"articleId": "1sXju7yF0gE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclOv",
"title": "May",
"year": "2019",
"issueNum": "05",
"idPrefix": "tk",
"pubType": "journal",
"volume": "31",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5nM",
"doi": "10.1109/TKDE.2018.2847685",
"abstract": "Sparse regression based feature selection method has been extensively investigated these years. However, because it has a non-convex constraint, i.e., Z_$\\ell _{2,0}$_Zℓ2,0-norm constraint, this problem is very hard to solve. In this paper, unlike most of the other methods which only solve its slack version by introducing sparsity regularization into objective function forcibly, a novel framework is proposed by us to solve the original Z_$\\ell _{2,0}$_Zℓ2,0-norm constrained sparse regression based feature selection problem. We transform our objective function into Linear Discriminant Analysis (LDA) by using a new label coding method, thus enabling our model to calculate the ratio of inter-class scatter to intra-class scatter of features which is the most widely used feature discrimination evaluation metric. According to that ratio, features can be selected by a simple sorting method. The projection gradient descent algorithm is introduced to further improve the performance of our algorithm by using the solution obtained before as its initial solution. This ensures the stability of this iterative algorithm. We prove that the proposed method can get the global optimal solution of this non-convex problem when all features are statistically independent. For the general case where features are statistically dependent, extensive experiments on six small sample size datasets and one large-scale dataset show that our algorithm has comparable or better classification capability comparing with other eight state-of-the-art feature selection methods by the SVM classifier. We also show that our algorithm can obtain a low loss value, which means the solution of our algorithm can get very close to this NP-hard problem’s real solution. What is more, because we solve the original Z_$\\ell _{2,0}$_Zℓ2,0-norm constrained problem, we avoid the heavy work of tuning the regularization parameter because its meaning is explicit in our method, i.e., the number of selected features. At last, we evaluate the stability of our algorithm from two perspectives, i.e., the objective function values and the selected features, by experiments. From both perspectives, our algorithm shows satisfactory stability performance.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Sparse regression based feature selection method has been extensively investigated these years. However, because it has a non-convex constraint, i.e., $\\ell _{2,0}$ℓ2,0-norm constraint, this problem is very hard to solve. In this paper, unlike most of the other methods which only solve its slack version by introducing sparsity regularization into objective function forcibly, a novel framework is proposed by us to solve the original $\\ell _{2,0}$ℓ2,0-norm constrained sparse regression based feature selection problem. We transform our objective function into Linear Discriminant Analysis (LDA) by using a new label coding method, thus enabling our model to calculate the ratio of inter-class scatter to intra-class scatter of features which is the most widely used feature discrimination evaluation metric. According to that ratio, features can be selected by a simple sorting method. The projection gradient descent algorithm is introduced to further improve the performance of our algorithm by using the solution obtained before as its initial solution. This ensures the stability of this iterative algorithm. We prove that the proposed method can get the global optimal solution of this non-convex problem when all features are statistically independent. For the general case where features are statistically dependent, extensive experiments on six small sample size datasets and one large-scale dataset show that our algorithm has comparable or better classification capability comparing with other eight state-of-the-art feature selection methods by the SVM classifier. We also show that our algorithm can obtain a low loss value, which means the solution of our algorithm can get very close to this NP-hard problem’s real solution. What is more, because we solve the original $\\ell _{2,0}$ℓ2,0-norm constrained problem, we avoid the heavy work of tuning the regularization parameter because its meaning is explicit in our method, i.e., the number of selected features. At last, we evaluate the stability of our algorithm from two perspectives, i.e., the objective function values and the selected features, by experiments. From both perspectives, our algorithm shows satisfactory stability performance.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Sparse regression based feature selection method has been extensively investigated these years. However, because it has a non-convex constraint, i.e., -ℓ2,0-norm constraint, this problem is very hard to solve. In this paper, unlike most of the other methods which only solve its slack version by introducing sparsity regularization into objective function forcibly, a novel framework is proposed by us to solve the original -ℓ2,0-norm constrained sparse regression based feature selection problem. We transform our objective function into Linear Discriminant Analysis (LDA) by using a new label coding method, thus enabling our model to calculate the ratio of inter-class scatter to intra-class scatter of features which is the most widely used feature discrimination evaluation metric. According to that ratio, features can be selected by a simple sorting method. The projection gradient descent algorithm is introduced to further improve the performance of our algorithm by using the solution obtained before as its initial solution. This ensures the stability of this iterative algorithm. We prove that the proposed method can get the global optimal solution of this non-convex problem when all features are statistically independent. For the general case where features are statistically dependent, extensive experiments on six small sample size datasets and one large-scale dataset show that our algorithm has comparable or better classification capability comparing with other eight state-of-the-art feature selection methods by the SVM classifier. We also show that our algorithm can obtain a low loss value, which means the solution of our algorithm can get very close to this NP-hard problem’s real solution. What is more, because we solve the original -ℓ2,0-norm constrained problem, we avoid the heavy work of tuning the regularization parameter because its meaning is explicit in our method, i.e., the number of selected features. At last, we evaluate the stability of our algorithm from two perspectives, i.e., the objective function values and the selected features, by experiments. From both perspectives, our algorithm shows satisfactory stability performance.",
"title": "Efficient Feature Selection via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-norm Constrained Sparse Regression",
"normalizedTitle": "Efficient Feature Selection via --norm Constrained Sparse Regression",
"fno": "08386668",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Feature Extraction",
"Linear Programming",
"Stability Criteria",
"Encoding",
"Optical Filters",
"Transforms",
"Feature Selection",
"LDA",
"Sparse Regression",
"Embedding"
],
"authors": [
{
"givenName": "Tianji",
"surname": "Pang",
"fullName": "Tianji Pang",
"affiliation": "School of Automation, Northwestern Polytechnical University, Xi’an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feiping",
"surname": "Nie",
"fullName": "Feiping Nie",
"affiliation": "School of Computer Science and Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xian, Shaanxi, P. R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junwei",
"surname": "Han",
"fullName": "Junwei Han",
"affiliation": "School of Automation, Northwestern Polytechnical University, Xi’an, Shaanxi, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuelong",
"surname": "Li",
"fullName": "Xuelong Li",
"affiliation": "School of Computer Science and Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi’an, P. R. China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2019-05-01 00:00:00",
"pubType": "trans",
"pages": "880-893",
"year": "2019",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/cc/2020/03/08329983",
"title": "A Truthful <inline-formula><tex-math notation=\"LaTeX\">Z_$(1-\\epsilon)$_Z</tex-math></inline-formula>-Optimal Mechanism for On-Demand Cloud Resource Provisioning",
"doi": null,
"abstractUrl": "/journal/cc/2020/03/08329983/13rRUxBa5oW",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09695194",
"title": "Fast Unsupervised Feature Selection With Bipartite Graph and <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm Constraint",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09695194/1AvqHcyRqbS",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/09893402",
"title": "Structured Sparse Non-negative Matrix Factorization with <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/09893402/1GGLdY0vH0c",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09916142",
"title": "Structured Sparsity Optimization With Non-Convex Surrogates of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm: A Unified Algorithmic Framework",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09916142/1HojygQOnNm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/05/08883086",
"title": "Absorbing Diagonal Algorithm: An Eigensolver of <inline-formula><tex-math notation=\"LaTeX\">Z_$O\\left(n^{2.584963}\\log \\frac{1}{\\varepsilon }\\right)$_Z</tex-math></inline-formula> Complexity at Accuracy <inline-formula><tex-math notation=\"LaTeX\">Z_$\\varepsilon$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tk/2021/05/08883086/1epRPvEugAo",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/06/08941268",
"title": "Towards Robust Discriminative Projections Learning via Non-Greedy <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,1}$_Z</tex-math></inline-formula>-Norm MinMax",
"doi": null,
"abstractUrl": "/journal/tp/2021/06/08941268/1g1FGIPWjo4",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/07/09354530",
"title": "The Fastest <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{1,\\infty }$_Z</tex-math></inline-formula> Prox in the West",
"doi": null,
"abstractUrl": "/journal/tp/2022/07/09354530/1reXhVJz6eI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09464733",
"title": "Support Vector Machine Classifier via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{0/1}$_Z</tex-math></inline-formula> Soft-Margin Loss",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09464733/1uHcfwcwOju",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09580680",
"title": "Sparse PCA via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,p}$_Z</tex-math></inline-formula>-Norm Regularization for Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09580680/1xPnZXaZEhG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09645237",
"title": "Laplacian Regularized Sparse Representation Based Classifier for Identifying DNA N4-Methylcytosine Sites via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{2,1/2}$_Z</tex-math></inline-formula>-Matrix Norm",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09645237/1zc6nhrcvaE",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08391732",
"articleId": "13rRUEgaroi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08392362",
"articleId": "13rRUwkfAZG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qkwo6YtVRK",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tk",
"pubType": "journal",
"volume": "33",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1c785B9SDVm",
"doi": "10.1109/TKDE.2019.2932063",
"abstract": "Sparse Singular Value Decomposition (SVD) models have been proposed for biclustering high dimensional gene expression data to identify block patterns with similar expressions. However, these models do not take into account prior group effects upon variable selection. To this end, we first propose group-sparse SVD models with group Lasso (GL<sub>1</sub>-SVD) and group L<sub>0</sub>-norm penalty (GL<sub>0</sub>-SVD) for non-overlapping group structure of variables. However, such group-sparse SVD models limit their applicability in some problems with overlapping structure. Thus, we also propose two group-sparse SVD models with overlapping group Lasso (OGL<sub>1</sub>-SVD) and overlapping group L<sub>0</sub>-norm penalty (OGL<sub>0</sub>-SVD). We first adopt an alternating iterative strategy to solve GL<sub>1</sub>-SVD based on a block coordinate descent method, and GL<sub>0</sub>-SVD based on a projection method. The key of solving OGL<sub>1</sub>-SVD is a proximal operator with overlapping group Lasso penalty. We employ an alternating direction method of multipliers (ADMM) to solve the proximal operator. Similarly, we develop an approximate method to solve OGL<sub>0</sub>-SVD. Applications of these methods and comparison with competing ones using simulated data demonstrate their effectiveness. Extensive applications of them onto several real gene expression data with gene prior group knowledge identify some biologically interpretable gene modules.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Sparse Singular Value Decomposition (SVD) models have been proposed for biclustering high dimensional gene expression data to identify block patterns with similar expressions. However, these models do not take into account prior group effects upon variable selection. To this end, we first propose group-sparse SVD models with group Lasso (GL<sub>1</sub>-SVD) and group L<sub>0</sub>-norm penalty (GL<sub>0</sub>-SVD) for non-overlapping group structure of variables. However, such group-sparse SVD models limit their applicability in some problems with overlapping structure. Thus, we also propose two group-sparse SVD models with overlapping group Lasso (OGL<sub>1</sub>-SVD) and overlapping group L<sub>0</sub>-norm penalty (OGL<sub>0</sub>-SVD). We first adopt an alternating iterative strategy to solve GL<sub>1</sub>-SVD based on a block coordinate descent method, and GL<sub>0</sub>-SVD based on a projection method. The key of solving OGL<sub>1</sub>-SVD is a proximal operator with overlapping group Lasso penalty. We employ an alternating direction method of multipliers (ADMM) to solve the proximal operator. Similarly, we develop an approximate method to solve OGL<sub>0</sub>-SVD. Applications of these methods and comparison with competing ones using simulated data demonstrate their effectiveness. Extensive applications of them onto several real gene expression data with gene prior group knowledge identify some biologically interpretable gene modules.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Sparse Singular Value Decomposition (SVD) models have been proposed for biclustering high dimensional gene expression data to identify block patterns with similar expressions. However, these models do not take into account prior group effects upon variable selection. To this end, we first propose group-sparse SVD models with group Lasso (GL1-SVD) and group L0-norm penalty (GL0-SVD) for non-overlapping group structure of variables. However, such group-sparse SVD models limit their applicability in some problems with overlapping structure. Thus, we also propose two group-sparse SVD models with overlapping group Lasso (OGL1-SVD) and overlapping group L0-norm penalty (OGL0-SVD). We first adopt an alternating iterative strategy to solve GL1-SVD based on a block coordinate descent method, and GL0-SVD based on a projection method. The key of solving OGL1-SVD is a proximal operator with overlapping group Lasso penalty. We employ an alternating direction method of multipliers (ADMM) to solve the proximal operator. Similarly, we develop an approximate method to solve OGL0-SVD. Applications of these methods and comparison with competing ones using simulated data demonstrate their effectiveness. Extensive applications of them onto several real gene expression data with gene prior group knowledge identify some biologically interpretable gene modules.",
"title": "Group-Sparse SVD Models via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_1$_Z</tex-math></inline-formula>- and <inline-formula><tex-math notation=\"LaTeX\">Z_$L_0$_Z</tex-math></inline-formula>-norm Penalties and their Applications in Biological Data",
"normalizedTitle": "Group-Sparse SVD Models via -- and --norm Penalties and their Applications in Biological Data",
"fno": "08782829",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Biology Computing",
"Convex Programming",
"Genetics",
"Gradient Methods",
"Iterative Methods",
"Pattern Classification",
"Pattern Clustering",
"Singular Value Decomposition",
"Group Sparse SVD Models",
"GL 1 SVD",
"Norm Penalty",
"Overlapping Group Lasso Penalty",
"Sparse Singular Value Decomposition Models",
"Biological Data",
"Prior Group Effects",
"Alternating Iterative Strategy",
"Block Coordinate Descent Method",
"Projection Method",
"Proximal Operator",
"Alternating Direction Method Of Multipliers",
"ADMM",
"Gene Expression Data",
"Gene Prior Group Knowledge",
"Biological System Modeling",
"Gene Expression",
"Data Models",
"Sparse Matrices",
"Input Variables",
"Iterative Methods",
"Sparse SVD",
"Low Rank Matrix Decomposition",
"Group Sparse Penalty",
"Overlapping Group Sparse Penalty",
"Coordinate Descent Method",
"Alternating Direction Method Of Multipliers ADMM",
"Data Mining"
],
"authors": [
{
"givenName": "Wenwen",
"surname": "Min",
"fullName": "Wenwen Min",
"affiliation": "School of Science and Engineering, Chinese University of Hong Kong, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juan",
"surname": "Liu",
"fullName": "Juan Liu",
"affiliation": "School of Computer Science, Wuhan University, Wuhan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shihua",
"surname": "Zhang",
"fullName": "Shihua Zhang",
"affiliation": "NCMIS, CEMS, RCSDS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "536-550",
"year": "2021",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2019/05/08386668",
"title": "Efficient Feature Selection via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-norm Constrained Sparse Regression",
"doi": null,
"abstractUrl": "/journal/tk/2019/05/08386668/13rRUxBa5nM",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08540419",
"title": "Spectral Mesh Segmentation via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _0$_Z</tex-math></inline-formula> Gradient Minimization",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08540419/17D45XoXP4p",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/05/09695194",
"title": "Fast Unsupervised Feature Selection With Bipartite Graph and <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm Constraint",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09695194/1AvqHcyRqbS",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09916142",
"title": "Structured Sparsity Optimization With Non-Convex Surrogates of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm: A Unified Algorithmic Framework",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09916142/1HojygQOnNm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/05/08883086",
"title": "Absorbing Diagonal Algorithm: An Eigensolver of <inline-formula><tex-math notation=\"LaTeX\">Z_$O\\left(n^{2.584963}\\log \\frac{1}{\\varepsilon }\\right)$_Z</tex-math></inline-formula> Complexity at Accuracy <inline-formula><tex-math notation=\"LaTeX\">Z_$\\varepsilon$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tk/2021/05/08883086/1epRPvEugAo",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/06/08941268",
"title": "Towards Robust Discriminative Projections Learning via Non-Greedy <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,1}$_Z</tex-math></inline-formula>-Norm MinMax",
"doi": null,
"abstractUrl": "/journal/tp/2021/06/08941268/1g1FGIPWjo4",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/07/09354530",
"title": "The Fastest <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{1,\\infty }$_Z</tex-math></inline-formula> Prox in the West",
"doi": null,
"abstractUrl": "/journal/tp/2022/07/09354530/1reXhVJz6eI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09464733",
"title": "Support Vector Machine Classifier via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{0/1}$_Z</tex-math></inline-formula> Soft-Margin Loss",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09464733/1uHcfwcwOju",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09580680",
"title": "Sparse PCA via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,p}$_Z</tex-math></inline-formula>-Norm Regularization for Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09580680/1xPnZXaZEhG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09645237",
"title": "Laplacian Regularized Sparse Representation Based Classifier for Identifying DNA N4-Methylcytosine Sites via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{2,1/2}$_Z</tex-math></inline-formula>-Matrix Norm",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09645237/1zc6nhrcvaE",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08792183",
"articleId": "1ckpmarL2RG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08713578",
"articleId": "1a00FOVkS9a",
"__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": "1sA4TnW6zxC",
"doi": "10.1109/TPAMI.2021.3071138",
"abstract": "The <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{1}$_Z</tex-math></inline-formula>-regularized logistic regression (L1-LR) is popular for classification problems. To accelerate its training speed for high-dimensional data, techniques named safe screening rules have been proposed recently. They can safely delete the inactive features in data so as to greatly reduce the training cost of L1-LR. The screening power of these rules is determined by their corresponding safe regions, which is also the core technique of safe screening rules. In this paper, we introduce a new safe feature elimination rule (SFER) for L1-LR. Compared to existing safe rules, the safe region of SFER is improved in two aspects: (1) a smaller sphere region is constructed by using the strong convexity of dual L1-LR twice; (2) multiple half-spaces, which correspond to the potential active constraints, are added for further contraction. Both improvements can enhance the screening ability of SFER. As for the complexity of SFER, an iterative filtering framework is given by decomposing the safe region into multiple “domes”. In this way, SFER admits a closed form solution and the identified features will not be scanned repeatedly. Experiments on ten benchmark data sets demonstrate that SFER gives superior performance than existing methods on training efficiency.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The <inline-formula><tex-math notation=\"LaTeX\">$L_{1}$</tex-math><alternatives><mml:math><mml:msub><mml:mi>L</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math><inline-graphic xlink:href=\"xu-ieq2-3071138.gif\"/></alternatives></inline-formula>-regularized logistic regression (L1-LR) is popular for classification problems. To accelerate its training speed for high-dimensional data, techniques named safe screening rules have been proposed recently. They can safely delete the inactive features in data so as to greatly reduce the training cost of L1-LR. The screening power of these rules is determined by their corresponding safe regions, which is also the core technique of safe screening rules. In this paper, we introduce a new safe feature elimination rule (SFER) for L1-LR. Compared to existing safe rules, the safe region of SFER is improved in two aspects: (1) a smaller sphere region is constructed by using the strong convexity of dual L1-LR twice; (2) multiple half-spaces, which correspond to the potential active constraints, are added for further contraction. Both improvements can enhance the screening ability of SFER. As for the complexity of SFER, an iterative filtering framework is given by decomposing the safe region into multiple “domes”. In this way, SFER admits a closed form solution and the identified features will not be scanned repeatedly. Experiments on ten benchmark data sets demonstrate that SFER gives superior performance than existing methods on training efficiency.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The --regularized logistic regression (L1-LR) is popular for classification problems. To accelerate its training speed for high-dimensional data, techniques named safe screening rules have been proposed recently. They can safely delete the inactive features in data so as to greatly reduce the training cost of L1-LR. The screening power of these rules is determined by their corresponding safe regions, which is also the core technique of safe screening rules. In this paper, we introduce a new safe feature elimination rule (SFER) for L1-LR. Compared to existing safe rules, the safe region of SFER is improved in two aspects: (1) a smaller sphere region is constructed by using the strong convexity of dual L1-LR twice; (2) multiple half-spaces, which correspond to the potential active constraints, are added for further contraction. Both improvements can enhance the screening ability of SFER. As for the complexity of SFER, an iterative filtering framework is given by decomposing the safe region into multiple “domes”. In this way, SFER admits a closed form solution and the identified features will not be scanned repeatedly. Experiments on ten benchmark data sets demonstrate that SFER gives superior performance than existing methods on training efficiency.",
"title": "A Safe Feature Elimination Rule for <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{1}$_Z</tex-math></inline-formula>-Regularized Logistic Regression",
"normalizedTitle": "A Safe Feature Elimination Rule for --Regularized Logistic Regression",
"fno": "09397291",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Iterative Methods",
"Learning Artificial Intelligence",
"Pattern Classification",
"Regression Analysis",
"Safe Feature Elimination Rule",
"L Sub 1 Sub Regularized Logistic Regression",
"High Dimensional Data",
"Safe Screening Rules",
"Inactive Features",
"Screening Power",
"SFER",
"Dual L 1 LR",
"Iterative Filtering Framework",
"Training",
"Logistics",
"Complexity Theory",
"Feature Extraction",
"Data Models",
"Safety",
"Optimization",
"Logistic Regression",
"Sparsity",
"Safe Screening Rule",
"High Dimensional Data"
],
"authors": [
{
"givenName": "Xianli",
"surname": "Pan",
"fullName": "Xianli Pan",
"affiliation": "College of Science, China Agricultural University, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yitian",
"surname": "Xu",
"fullName": "Yitian Xu",
"affiliation": "College of Science, China Agricultural University, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "09",
"pubDate": "2022-09-01 00:00:00",
"pubType": "trans",
"pages": "4544-4554",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/05/09695194",
"title": "Fast Unsupervised Feature Selection With Bipartite Graph and <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm Constraint",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09695194/1AvqHcyRqbS",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09723546",
"title": "Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, <inline-formula><tex-math notation=\"LaTeX\">Z_$(SGD)^{2}$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09723546/1BocJwdaFYk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09916142",
"title": "Structured Sparsity Optimization With Non-Convex Surrogates of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm: A Unified Algorithmic Framework",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09916142/1HojygQOnNm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/07/09354530",
"title": "The Fastest <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{1,\\infty }$_Z</tex-math></inline-formula> Prox in the West",
"doi": null,
"abstractUrl": "/journal/tp/2022/07/09354530/1reXhVJz6eI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/05/09444882",
"title": "Coordinate Descent Method for <inline-formula><tex-math notation=\"LaTeX\">Z_$k$_Z</tex-math></inline-formula>-means",
"doi": null,
"abstractUrl": "/journal/tp/2022/05/09444882/1u51seEJDiM",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ec/2022/02/09463675",
"title": "Efficient Hardware Implementation of Finite Field Arithmetic <inline-formula><tex-math notation=\"LaTeX\">Z_$AB+C$_Z</tex-math></inline-formula> for Binary Ring-LWE Based Post-Quantum Cryptography",
"doi": null,
"abstractUrl": "/journal/ec/2022/02/09463675/1uFxptYevFC",
"parentPublication": {
"id": "trans/ec",
"title": "IEEE Transactions on Emerging Topics in Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09464733",
"title": "Support Vector Machine Classifier via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{0/1}$_Z</tex-math></inline-formula> Soft-Margin Loss",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09464733/1uHcfwcwOju",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09525250",
"title": "Fast Reachability Queries Answering Based on <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathsf{RCN}$_Z</tex-math></inline-formula> Reduction",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09525250/1wuoOp439OU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09580680",
"title": "Sparse PCA via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,p}$_Z</tex-math></inline-formula>-Norm Regularization for Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09580680/1xPnZXaZEhG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09645237",
"title": "Laplacian Regularized Sparse Representation Based Classifier for Identifying DNA N4-Methylcytosine Sites via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{2,1/2}$_Z</tex-math></inline-formula>-Matrix Norm",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09645237/1zc6nhrcvaE",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09394775",
"articleId": "1strgvS3gMU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09392296",
"articleId": "1sq7rtKfyyQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Fz3m7sJK7u",
"name": "ttp202209-09397291s1-supp1-3071138.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202209-09397291s1-supp1-3071138.pdf",
"extension": "pdf",
"size": "62.3 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Lk2nmMLR6M",
"title": "April",
"year": "2023",
"issueNum": "04",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xPnZXaZEhG",
"doi": "10.1109/TPAMI.2021.3121329",
"abstract": "In the field of data mining, how to deal with high-dimensional data is an inevitable topic. Since it does not rely on labels, unsupervised feature selection has attracted a lot of attention. The performance of spectral-based unsupervised methods depends on the quality of the constructed similarity matrix, which is used to depict the intrinsic structure of data. However, real-world data often contain plenty of noise features, making the similarity matrix constructed by original data cannot be completely reliable. Worse still, the size of a similarity matrix expands rapidly as the number of samples rises, making the computational cost increase significantly. To solve this problem, a simple and efficient unsupervised model is proposed to perform feature selection. We formulate PCA as a reconstruction error minimization problem, and incorporate a <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,p}$_Z</tex-math></inline-formula>-norm regularization term to make the projection matrix sparse. The learned row-sparse and orthogonal projection matrix is used to select discriminative features. Then, we present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically. Finally, experiments on both synthetic and real-world data sets demonstrate the effectiveness of our proposed method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the field of data mining, how to deal with high-dimensional data is an inevitable topic. Since it does not rely on labels, unsupervised feature selection has attracted a lot of attention. The performance of spectral-based unsupervised methods depends on the quality of the constructed similarity matrix, which is used to depict the intrinsic structure of data. However, real-world data often contain plenty of noise features, making the similarity matrix constructed by original data cannot be completely reliable. Worse still, the size of a similarity matrix expands rapidly as the number of samples rises, making the computational cost increase significantly. To solve this problem, a simple and efficient unsupervised model is proposed to perform feature selection. We formulate PCA as a reconstruction error minimization problem, and incorporate a <inline-formula><tex-math notation=\"LaTeX\">$\\ell _{2,p}$</tex-math><alternatives><mml:math><mml:msub><mml:mi>ℓ</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math><inline-graphic xlink:href=\"li-ieq2-3121329.gif\"/></alternatives></inline-formula>-norm regularization term to make the projection matrix sparse. The learned row-sparse and orthogonal projection matrix is used to select discriminative features. Then, we present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically. Finally, experiments on both synthetic and real-world data sets demonstrate the effectiveness of our proposed method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the field of data mining, how to deal with high-dimensional data is an inevitable topic. Since it does not rely on labels, unsupervised feature selection has attracted a lot of attention. The performance of spectral-based unsupervised methods depends on the quality of the constructed similarity matrix, which is used to depict the intrinsic structure of data. However, real-world data often contain plenty of noise features, making the similarity matrix constructed by original data cannot be completely reliable. Worse still, the size of a similarity matrix expands rapidly as the number of samples rises, making the computational cost increase significantly. To solve this problem, a simple and efficient unsupervised model is proposed to perform feature selection. We formulate PCA as a reconstruction error minimization problem, and incorporate a --norm regularization term to make the projection matrix sparse. The learned row-sparse and orthogonal projection matrix is used to select discriminative features. Then, we present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically. Finally, experiments on both synthetic and real-world data sets demonstrate the effectiveness of our proposed method.",
"title": "Sparse PCA via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,p}$_Z</tex-math></inline-formula>-Norm Regularization for Unsupervised Feature Selection",
"normalizedTitle": "Sparse PCA via --Norm Regularization for Unsupervised Feature Selection",
"fno": "09580680",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Computational Complexity",
"Data Mining",
"Feature Extraction",
"Feature Selection",
"Learning Artificial Intelligence",
"Matrix Algebra",
"Minimisation",
"Pattern Clustering",
"Principal Component Analysis",
"Constructed Similarity Matrix",
"Data Mining",
"Discriminative Features",
"Efficient Unsupervised Model",
"High Dimensional Data",
"Learned Row Sparse",
"Noise Features",
"Norm Regularization Term",
"Projection Matrix Sparse",
"Real World Data Sets",
"Reconstruction Error Minimization Problem",
"Simple Model",
"Sparse PCA",
"Spectral Based Unsupervised Methods",
"Unsupervised Feature Selection",
"Feature Extraction",
"Principal Component Analysis",
"Sparse Matrices",
"Optimization",
"Task Analysis",
"Minimization",
"Data Mining",
"Unsupervised Feature Selection",
"Principal Component Analysis",
"<named-content xmlns:xlink=\"http://www.w3.org/1999/xlink\" xmlns:ali=\"http://www.niso.org/schemas/ali/1.0/\" xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" content-type=\"math\" xlink:type=\"simple\"> <named-content content-type=\"math\" xlink:type=\"simple\"> <inline-formula> <tex-math notation=\"LaTeX\">Z_$\\ell _{2,p}$_Z</tex-math> </inline-formula> </named-content> </named-content>-norm",
"Sparse Learning"
],
"authors": [
{
"givenName": "Zhengxin",
"surname": "Li",
"fullName": "Zhengxin Li",
"affiliation": "College of Equipment Management and UAV Engineering, Air Force Engineering University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feiping",
"surname": "Nie",
"fullName": "Feiping Nie",
"affiliation": "School of Computer Science and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jintang",
"surname": "Bian",
"fullName": "Jintang Bian",
"affiliation": "School of Computer Science and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Danyang",
"surname": "Wu",
"fullName": "Danyang Wu",
"affiliation": "School of Computer Science and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuelong",
"surname": "Li",
"fullName": "Xuelong Li",
"affiliation": "School of Computer Science and School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "5322-5328",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/05/09695194",
"title": "Fast Unsupervised Feature Selection With Bipartite Graph and <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm Constraint",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09695194/1AvqHcyRqbS",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09723546",
"title": "Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, <inline-formula><tex-math notation=\"LaTeX\">Z_$(SGD)^{2}$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09723546/1BocJwdaFYk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/03/09786656",
"title": "Logarithmic Schatten-<inline-formula><tex-math notation=\"LaTeX\">Z_$p$_Z</tex-math></inline-formula> Norm Minimization for Tensorial Multi-View Subspace Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2023/03/09786656/1DQPxlTv7lS",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09916142",
"title": "Structured Sparsity Optimization With Non-Convex Surrogates of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm: A Unified Algorithmic Framework",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09916142/1HojygQOnNm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2022/03/09272660",
"title": "Finite-Time <inline-formula><tex-math notation=\"LaTeX\">Z_$\\mathcal {H}_{\\infty }$_Z</tex-math></inline-formula> State Estimation for PDT-Switched Genetic Regulatory Networks With Randomly Occurring Uncertainties",
"doi": null,
"abstractUrl": "/journal/tb/2022/03/09272660/1p4vXtaburm",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/07/09354530",
"title": "The Fastest <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{1,\\infty }$_Z</tex-math></inline-formula> Prox in the West",
"doi": null,
"abstractUrl": "/journal/tp/2022/07/09354530/1reXhVJz6eI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/02/09462338",
"title": "OAG<inline-formula><tex-math notation=\"LaTeX\">Z_$_{\\mathrm {know}}$_Z</tex-math></inline-formula>: Self-Supervised Learning for Linking Knowledge Graphs",
"doi": null,
"abstractUrl": "/journal/tk/2023/02/09462338/1uDSuePw9Rm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09464733",
"title": "Support Vector Machine Classifier via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{0/1}$_Z</tex-math></inline-formula> Soft-Margin Loss",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09464733/1uHcfwcwOju",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09645237",
"title": "Laplacian Regularized Sparse Representation Based Classifier for Identifying DNA N4-Methylcytosine Sites via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{2,1/2}$_Z</tex-math></inline-formula>-Matrix Norm",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09645237/1zc6nhrcvaE",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09888004",
"articleId": "1GBRkL2lbrO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09868157",
"articleId": "1G9WoQwVOHm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1KsQUyqsSje",
"title": "Jan.-Feb.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": "20",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zc6nhrcvaE",
"doi": "10.1109/TCBB.2021.3133309",
"abstract": "N4-methylcytosine (4mC) is one of important epigenetic modifications in DNA sequences. Detecting 4mC sites is time-consuming. The computational method based on machine learning has provided effective help for identifying 4mC. To further improve the performance of prediction, we propose a Laplacian Regularized Sparse Representation based Classifier with <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{2,1/2}$_Z</tex-math></inline-formula>-matrix norm (LapRSRC). We also utilize kernel trick to derive the kernel LapRSRC for nonlinear modeling. Matrix factorization technology is employed to solve the sparse representation coefficients of all test samples in the training set. And an efficient iterative algorithm is proposed to solve the objective function. We implement our model on six benchmark datasets of 4mC and eight UCI datasets to evaluate performance. The results show that the performance of our method is better or comparable.",
"abstracts": [
{
"abstractType": "Regular",
"content": "N4-methylcytosine (4mC) is one of important epigenetic modifications in DNA sequences. Detecting 4mC sites is time-consuming. The computational method based on machine learning has provided effective help for identifying 4mC. To further improve the performance of prediction, we propose a Laplacian Regularized Sparse Representation based Classifier with <inline-formula><tex-math notation=\"LaTeX\">$L_{2,1/2}$</tex-math><alternatives><mml:math><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math><inline-graphic xlink:href=\"guo-ieq2-3133309.gif\"/></alternatives></inline-formula>-matrix norm (LapRSRC). We also utilize kernel trick to derive the kernel LapRSRC for nonlinear modeling. Matrix factorization technology is employed to solve the sparse representation coefficients of all test samples in the training set. And an efficient iterative algorithm is proposed to solve the objective function. We implement our model on six benchmark datasets of 4mC and eight UCI datasets to evaluate performance. The results show that the performance of our method is better or comparable.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "N4-methylcytosine (4mC) is one of important epigenetic modifications in DNA sequences. Detecting 4mC sites is time-consuming. The computational method based on machine learning has provided effective help for identifying 4mC. To further improve the performance of prediction, we propose a Laplacian Regularized Sparse Representation based Classifier with --matrix norm (LapRSRC). We also utilize kernel trick to derive the kernel LapRSRC for nonlinear modeling. Matrix factorization technology is employed to solve the sparse representation coefficients of all test samples in the training set. And an efficient iterative algorithm is proposed to solve the objective function. We implement our model on six benchmark datasets of 4mC and eight UCI datasets to evaluate performance. The results show that the performance of our method is better or comparable.",
"title": "Laplacian Regularized Sparse Representation Based Classifier for Identifying DNA N4-Methylcytosine Sites via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{2,1/2}$_Z</tex-math></inline-formula>-Matrix Norm",
"normalizedTitle": "Laplacian Regularized Sparse Representation Based Classifier for Identifying DNA N4-Methylcytosine Sites via --Matrix Norm",
"fno": "09645237",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"DNA",
"Image Representation",
"Iterative Methods",
"Learning Artificial Intelligence",
"Matrix Decomposition",
"Pattern Classification",
"4 M C Sites",
"Classifier",
"Computational Method",
"DNA Sequences",
"Identifying DNA N 4 Methylcytosine Sites",
"Important Epigenetic Modifications",
"Kernel Lap RSRC",
"Laplacian Regularized Sparse Representation",
"Machine Learning",
"Matrix Factorization Technology",
"Matrix Norm",
"Sparse Representation Coefficients",
"Sparse Matrices",
"DNA",
"Training",
"Kernel",
"Laplace Equations",
"Biological System Modeling",
"Support Vector Machines",
"DNA N 4 Methylcytosine",
"4 M C",
"Graph Regularized Model",
"Sparse Representation",
"Sequence Classification"
],
"authors": [
{
"givenName": "Yijie",
"surname": "Ding",
"fullName": "Yijie Ding",
"affiliation": "Yangtze Delta Region Institute (Quzhou), University of Electronic Science and Technology of China, Quzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wenying",
"surname": "He",
"fullName": "Wenying He",
"affiliation": "School of Computer Science and Technology, College of Intelligence and Computing, Tianjin University, Tianjin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jijun",
"surname": "Tang",
"fullName": "Jijun Tang",
"affiliation": "Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Quan",
"surname": "Zou",
"fullName": "Quan Zou",
"affiliation": "Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, Chengdu, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fei",
"surname": "Guo",
"fullName": "Fei Guo",
"affiliation": "School of Computer Science and Engineering, Central South University, Changsha, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "500-511",
"year": "2023",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/tk/2023/05/09695194",
"title": "Fast Unsupervised Feature Selection With Bipartite Graph and <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm Constraint",
"doi": null,
"abstractUrl": "/journal/tk/2023/05/09695194/1AvqHcyRqbS",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09723546",
"title": "Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, <inline-formula><tex-math notation=\"LaTeX\">Z_$(SGD)^{2}$_Z</tex-math></inline-formula>",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09723546/1BocJwdaFYk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/06/09759987",
"title": "Sparse and Flexible Projections for Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tk/2023/06/09759987/1CHsvtlNSSI",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/05/09916142",
"title": "Structured Sparsity Optimization With Non-Convex Surrogates of <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,0}$_Z</tex-math></inline-formula>-Norm: A Unified Algorithmic Framework",
"doi": null,
"abstractUrl": "/journal/tp/2023/05/09916142/1HojygQOnNm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/07/09354530",
"title": "The Fastest <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{1,\\infty }$_Z</tex-math></inline-formula> Prox in the West",
"doi": null,
"abstractUrl": "/journal/tp/2022/07/09354530/1reXhVJz6eI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09463735",
"title": "Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09463735/1uFxm1okYhO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/10/09464733",
"title": "Support Vector Machine Classifier via <inline-formula><tex-math notation=\"LaTeX\">Z_$L_{0/1}$_Z</tex-math></inline-formula> Soft-Margin Loss",
"doi": null,
"abstractUrl": "/journal/tp/2022/10/09464733/1uHcfwcwOju",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/06/09445629",
"title": "Up to <inline-formula><tex-math notation=\"LaTeX\">Z_$8k$_Z</tex-math></inline-formula>-bit Modular Montgomery Multiplication in Residue Number Systems With Fast 16-bit Residue Channels",
"doi": null,
"abstractUrl": "/journal/tc/2022/06/09445629/1uaauvs6N0c",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/04/09580680",
"title": "Sparse PCA via <inline-formula><tex-math notation=\"LaTeX\">Z_$\\ell _{2,p}$_Z</tex-math></inline-formula>-Norm Regularization for Unsupervised Feature Selection",
"doi": null,
"abstractUrl": "/journal/tp/2023/04/09580680/1xPnZXaZEhG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/07/09585362",
"title": "A Fast <inline-formula><tex-math notation=\"LaTeX\">Z_$f(r,k+1)/k$_Z</tex-math></inline-formula>-Diagnosis for Interconnection Networks Under MM* Model",
"doi": null,
"abstractUrl": "/journal/td/2022/07/09585362/1y11LlQdiGk",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09663570",
"articleId": "1zHDxgU5Am4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09633203",
"articleId": "1z0u2hspu0M",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx8fieS",
"title": "Jan.",
"year": "2013",
"issueNum": "01",
"idPrefix": "tc",
"pubType": "journal",
"volume": "62",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwghd8v",
"doi": "10.1109/TC.2011.208",
"abstract": "In this paper, we propose a probabilistic approach to finding failure-causing inputs based on Bayesian estimation. According to our probabilistic insights of software testing, the test case generation algorithms are developed by Markov chain Monte Carlo (MCMC) methods. Dissimilar to existing random testing schemes such as adaptive random testing, our approach can also utilize the prior knowledge on software testing. In experiments, we compare effectiveness of our MCMC-based random testing with both ordinary random testing and adaptive random testing in real program sources. These results indicate the possibility that MCMC-based random testing can drastically improve the effectiveness of software testing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose a probabilistic approach to finding failure-causing inputs based on Bayesian estimation. According to our probabilistic insights of software testing, the test case generation algorithms are developed by Markov chain Monte Carlo (MCMC) methods. Dissimilar to existing random testing schemes such as adaptive random testing, our approach can also utilize the prior knowledge on software testing. In experiments, we compare effectiveness of our MCMC-based random testing with both ordinary random testing and adaptive random testing in real program sources. These results indicate the possibility that MCMC-based random testing can drastically improve the effectiveness of software testing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose a probabilistic approach to finding failure-causing inputs based on Bayesian estimation. According to our probabilistic insights of software testing, the test case generation algorithms are developed by Markov chain Monte Carlo (MCMC) methods. Dissimilar to existing random testing schemes such as adaptive random testing, our approach can also utilize the prior knowledge on software testing. In experiments, we compare effectiveness of our MCMC-based random testing with both ordinary random testing and adaptive random testing in real program sources. These results indicate the possibility that MCMC-based random testing can drastically improve the effectiveness of software testing.",
"title": "Enhancing Performance of Random Testing through Markov Chain Monte Carlo Methods",
"normalizedTitle": "Enhancing Performance of Random Testing through Markov Chain Monte Carlo Methods",
"fno": "ttc2013010186",
"hasPdf": true,
"idPrefix": "tc",
"keywords": [
"Subspace Constraints",
"Markov Processes",
"Software Testing",
"Correlation",
"Proposals",
"Software",
"Markov Chain Monte Carlo",
"Software Testing",
"Random Testing",
"Adaptive Random Testing",
"Bayes Statistics"
],
"authors": [
{
"givenName": "Bo",
"surname": "Zhou",
"fullName": "Bo Zhou",
"affiliation": "University of California, Riverside",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hiroyuki",
"surname": "Okamura",
"fullName": "Hiroyuki Okamura",
"affiliation": "Hiroshima University, Higashi-Hiroshima",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tadashi",
"surname": "Dohi",
"fullName": "Tadashi Dohi",
"affiliation": "Hiroshima University, Higashi-Hiroshima",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2013-01-01 00:00:00",
"pubType": "trans",
"pages": "186-192",
"year": "2013",
"issn": "0018-9340",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/etcs/2009/3557/2/3557c279",
"title": "Gray-Level Image Segmentation Based on Markov Chain Monte Carlo",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557c279/12OmNANkomc",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2002/1695/3/169530049",
"title": "Learning Bayesian Network Classifiers for Credit Scoring Using Markov Chain Monte Carlo Search",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2002/169530049/12OmNAS9zHw",
"parentPublication": {
"id": "proceedings/icpr/2002/1695/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2010/7054/0/05456938",
"title": "Statistical static timing analysis using Markov chain Monte Carlo",
"doi": null,
"abstractUrl": "/proceedings-article/date/2010/05456938/12OmNBSSVcu",
"parentPublication": {
"id": "proceedings/date/2010/7054/0",
"title": "2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hase/2010/4292/0/4292a162",
"title": "Enhancing Performance of Random Testing through Markov Chain Monte Carlo Methods",
"doi": null,
"abstractUrl": "/proceedings-article/hase/2010/4292a162/12OmNCctf9w",
"parentPublication": {
"id": "proceedings/hase/2010/4292/0",
"title": "2010 IEEE 12th International Symposium on High Assurance Systems Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cicsyn/2011/4482/0/4482a253",
"title": "Adaptive Tracking of Overlapping Vehicles Via Markov Chain Monte Carlo with CUSUM Path Plot Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/cicsyn/2011/4482a253/12OmNqFJhVv",
"parentPublication": {
"id": "proceedings/cicsyn/2011/4482/0",
"title": "Computational Intelligence, Communication Systems and Networks, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109b364",
"title": "Continuous Markov Random Field Optimization Using Fusion Move Driven Markov Chain Monte Carlo Technique",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109b364/12OmNzBwGBR",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1999/5041/3/00756334",
"title": "Marginal MAP estimation using Markov chain Monte Carlo",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1999/00756334/12OmNzVGcLi",
"parentPublication": {
"id": "proceedings/icassp/1999/5041/3",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/simultech/2014/060/0/07095043",
"title": "Markov chain Monte Carlo for risk measures",
"doi": null,
"abstractUrl": "/proceedings-article/simultech/2014/07095043/12OmNzZmZuN",
"parentPublication": {
"id": "proceedings/simultech/2014/060/0",
"title": "2014 International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/04/08528490",
"title": "Survey of Markov Chain Monte Carlo Methods in Light Transport Simulation",
"doi": null,
"abstractUrl": "/journal/tg/2020/04/08528490/17D45XDIXWc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpca/2022/2027/0/202700a038",
"title": "CoopMC: Algorithm-Architecture Co-Optimization for Markov Chain Monte Carlo Accelerators",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2022/202700a038/1Ds0e8Scd5m",
"parentPublication": {
"id": "proceedings/hpca/2022/2027/0",
"title": "2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttc2013010173",
"articleId": "13rRUxcsYL7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttc2013010193",
"articleId": "13rRUxDItgs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDX",
"title": "May",
"year": "2019",
"issueNum": "05",
"idPrefix": "tp",
"pubType": "journal",
"volume": "41",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUB7a1hb",
"doi": "10.1109/TPAMI.2018.2831670",
"abstract": "We present a novel framework for rigid point cloud registration. Our approach is based on the principles of mechanics and thermodynamics. We solve the registration problem by assuming point clouds as rigid bodies consisting of particles. Forces can be applied between both particle systems so that they attract or repel each other. These forces are used to cause rigid-body motion of one particle system toward the other, until both are aligned. The framework supports physics-based registration processes with arbitrary driving forces, depending on the desired behaviour. Additionally, the approach handles feature-enhanced point clouds, e.g., by colours or intensity values. Our framework is freely accessible for download. In contrast to already existing algorithms, our contribution is to precisely register high-resolution point clouds with nearly constant computational effort and without the need for pre-processing, sub-sampling or pre-alignment. At the same time, the quality is up to 28 percent higher than for state-of-the-art algorithms and up to 49 percent higher when considering feature-enhanced point clouds. Even in the presence of noise, our registration approach is one of the most robust, on par with state-of-the-art implementations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel framework for rigid point cloud registration. Our approach is based on the principles of mechanics and thermodynamics. We solve the registration problem by assuming point clouds as rigid bodies consisting of particles. Forces can be applied between both particle systems so that they attract or repel each other. These forces are used to cause rigid-body motion of one particle system toward the other, until both are aligned. The framework supports physics-based registration processes with arbitrary driving forces, depending on the desired behaviour. Additionally, the approach handles feature-enhanced point clouds, e.g., by colours or intensity values. Our framework is freely accessible for download. In contrast to already existing algorithms, our contribution is to precisely register high-resolution point clouds with nearly constant computational effort and without the need for pre-processing, sub-sampling or pre-alignment. At the same time, the quality is up to 28 percent higher than for state-of-the-art algorithms and up to 49 percent higher when considering feature-enhanced point clouds. Even in the presence of noise, our registration approach is one of the most robust, on par with state-of-the-art implementations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel framework for rigid point cloud registration. Our approach is based on the principles of mechanics and thermodynamics. We solve the registration problem by assuming point clouds as rigid bodies consisting of particles. Forces can be applied between both particle systems so that they attract or repel each other. These forces are used to cause rigid-body motion of one particle system toward the other, until both are aligned. The framework supports physics-based registration processes with arbitrary driving forces, depending on the desired behaviour. Additionally, the approach handles feature-enhanced point clouds, e.g., by colours or intensity values. Our framework is freely accessible for download. In contrast to already existing algorithms, our contribution is to precisely register high-resolution point clouds with nearly constant computational effort and without the need for pre-processing, sub-sampling or pre-alignment. At the same time, the quality is up to 28 percent higher than for state-of-the-art algorithms and up to 49 percent higher when considering feature-enhanced point clouds. Even in the presence of noise, our registration approach is one of the most robust, on par with state-of-the-art implementations.",
"title": "Efficient Registration of High-Resolution Feature Enhanced Point Clouds",
"normalizedTitle": "Efficient Registration of High-Resolution Feature Enhanced Point Clouds",
"fno": "08352814",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Registration",
"Efficient Registration",
"High Resolution Feature Enhanced Point Clouds",
"Rigid Point Cloud Registration",
"Registration Problem",
"Rigid Bodies",
"Particle System",
"Rigid Body Motion",
"Physics Based Registration Processes",
"Arbitrary Driving Forces",
"Colours",
"Intensity Values",
"High Resolution Point Clouds",
"Registration Approach",
"Mechanics Principles",
"Thermodynamics Principles",
"Efficiency 28 0 Percent",
"Efficiency 49 0 Percent",
"Three Dimensional Displays",
"Iterative Closest Point Algorithm",
"Color",
"Robustness",
"Sensors",
"Cameras",
"Cloud Computing",
"Point Cloud",
"Registration",
"Rigid",
"Efficiency",
"High Resolution",
"Features",
"Graphics Processors",
"CUDA",
"Monte Carlo",
"Simulated Annealing",
"Rigid Body Dynamics",
"Many Particle Systems",
"Newtons Law",
"Coulombs Law"
],
"authors": [
{
"givenName": "Philipp",
"surname": "Jauer",
"fullName": "Philipp Jauer",
"affiliation": "Institute for Robotics and Cognitive Systems, University of Lübeck, Lübeck, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ivo",
"surname": "Kuhlemann",
"fullName": "Ivo Kuhlemann",
"affiliation": "Institute for Robotics and Cognitive Systems, University of Lübeck, Lübeck, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ralf",
"surname": "Bruder",
"fullName": "Ralf Bruder",
"affiliation": "Institute for Robotics and Cognitive Systems, University of Lübeck, Lübeck, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Achim",
"surname": "Schweikard",
"fullName": "Achim Schweikard",
"affiliation": "Institute for Robotics and Cognitive Systems, University of Lübeck, Lübeck, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Floris",
"surname": "Ernst",
"fullName": "Floris Ernst",
"affiliation": "Institute for Robotics and Cognitive Systems, University of Lübeck, Lübeck, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2019-05-01 00:00:00",
"pubType": "trans",
"pages": "1102-1115",
"year": "2019",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/crv/2015/1986/0/1986a031",
"title": "Registration of Noisy Point Clouds Using Virtual Interest Points",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2015/1986a031/12OmNApLGDA",
"parentPublication": {
"id": "proceedings/crv/2015/1986/0",
"title": "2015 12th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2017/3588/0/3588a087",
"title": "Comparing Different Strategies for Frame-to-Frame Rigid Registration of Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2017/3588a087/12OmNApu5Dl",
"parentPublication": {
"id": "proceedings/svr/2017/3588/0",
"title": "2017 19th Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2015/6683/0/6683a094",
"title": "Non-rigid Articulated Point Set Registration for Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2015/6683a094/12OmNC2OSPb",
"parentPublication": {
"id": "proceedings/wacv/2015/6683/0",
"title": "2015 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciibms/2015/8562/0/07439538",
"title": "Evaluation of pattern based point clouds for patient registration — A phantom study",
"doi": null,
"abstractUrl": "/proceedings-article/iciibms/2015/07439538/12OmNrJROX1",
"parentPublication": {
"id": "proceedings/iciibms/2015/8562/0",
"title": "2015 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a102",
"title": "Registration of Point Clouds Based on the Ratio of Bidirectional Distances",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a102/12OmNyoSbey",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2016/0811/0/0811a045",
"title": "On Performance Evaluation of Registration Algorithms for 3D Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2016/0811a045/12OmNzC5Tgw",
"parentPublication": {
"id": "proceedings/cgiv/2016/0811/0",
"title": "2016 13th International Conference on Computer Graphics, Imaging and Visualization (CGiV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032a143",
"title": "Colored Point Cloud Registration Revisited",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032a143/12OmNzXWZKe",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851f802",
"title": "Gravitational Approach for Point Set Registration",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851f802/12OmNzyp5Xm",
"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/2020/7168/0/716800l1821",
"title": "RPM-Net: Robust Point Matching Using Learned Features",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800l1821/1m3nTo6xXTG",
"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/icpr/2021/8808/0/09412379",
"title": "A Plane-based Approach for Indoor Point Clouds Registration",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412379/1tmiHcZ1kje",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08352745",
"articleId": "13rRUEgarCI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08344501",
"articleId": "13rRUyp7tY4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx1qV7m",
"title": "February",
"year": "2001",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "23",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyaga",
"doi": "10.1109/34.908967",
"abstract": "Abstract—Accurate and robust correspondence calculations are very important in many medical and biological applications. Often, the correspondence calculation forms part of a rigid registration algorithm, but accurate correspondences are especially important for elastic registration algorithms and for quantifying changes over time. In this paper, a new correspondence calculation algorithm, CSM (Correspondence by Sensitivity to Movement), is described. A robust corresponding point is calculated by determining the sensitivity of a correspondence to movement of the point being matched. If the correspondence is reliable, a perturbation in the position of this point should not result in a large movement of the correspondence. A measure of reliability is also calculated. This correspondence calculation method is independent of the registration transformation and has been incorporated into both a 2D elastic registration algorithm for warping serial sections and a 3D rigid registration algorithm for registering pre and postoperative facial range scans. These applications use different methods for calculating the registration transformation and accurate rigid and elastic alignment of images has been achieved with the CSM method. It is expected that this method will be applicable to many different applications and that good results would be achieved if it were to be inserted into other methods for calculating a registration transformation from correspondences.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Accurate and robust correspondence calculations are very important in many medical and biological applications. Often, the correspondence calculation forms part of a rigid registration algorithm, but accurate correspondences are especially important for elastic registration algorithms and for quantifying changes over time. In this paper, a new correspondence calculation algorithm, CSM (Correspondence by Sensitivity to Movement), is described. A robust corresponding point is calculated by determining the sensitivity of a correspondence to movement of the point being matched. If the correspondence is reliable, a perturbation in the position of this point should not result in a large movement of the correspondence. A measure of reliability is also calculated. This correspondence calculation method is independent of the registration transformation and has been incorporated into both a 2D elastic registration algorithm for warping serial sections and a 3D rigid registration algorithm for registering pre and postoperative facial range scans. These applications use different methods for calculating the registration transformation and accurate rigid and elastic alignment of images has been achieved with the CSM method. It is expected that this method will be applicable to many different applications and that good results would be achieved if it were to be inserted into other methods for calculating a registration transformation from correspondences.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Accurate and robust correspondence calculations are very important in many medical and biological applications. Often, the correspondence calculation forms part of a rigid registration algorithm, but accurate correspondences are especially important for elastic registration algorithms and for quantifying changes over time. In this paper, a new correspondence calculation algorithm, CSM (Correspondence by Sensitivity to Movement), is described. A robust corresponding point is calculated by determining the sensitivity of a correspondence to movement of the point being matched. If the correspondence is reliable, a perturbation in the position of this point should not result in a large movement of the correspondence. A measure of reliability is also calculated. This correspondence calculation method is independent of the registration transformation and has been incorporated into both a 2D elastic registration algorithm for warping serial sections and a 3D rigid registration algorithm for registering pre and postoperative facial range scans. These applications use different methods for calculating the registration transformation and accurate rigid and elastic alignment of images has been achieved with the CSM method. It is expected that this method will be applicable to many different applications and that good results would be achieved if it were to be inserted into other methods for calculating a registration transformation from correspondences.",
"title": "Robust Point Correspondence Applied to Two-and Three-Dimensional Image Registration",
"normalizedTitle": "Robust Point Correspondence Applied to Two-and Three-Dimensional Image Registration",
"fno": "i0165",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Image Registration",
"Iterative Closest Point",
"Surface Matching",
"Point Correspondence",
"Image Warping",
"Image Matching",
"Serial Sections",
"Reconstruction"
],
"authors": [
{
"givenName": "Elizabeth",
"surname": "Guest",
"fullName": "Elizabeth Guest",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Elizabeth",
"surname": "Berry",
"fullName": "Elizabeth Berry",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Richard A.",
"surname": "Baldock",
"fullName": "Richard A. Baldock",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Márta",
"surname": "Fidrich",
"fullName": "Márta Fidrich",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mike A.",
"surname": "Smith",
"fullName": "Mike A. Smith",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2001-02-01 00:00:00",
"pubType": "trans",
"pages": "165-179",
"year": "2001",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0149",
"articleId": "13rRUILtJAF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0180",
"articleId": "13rRUxYrbNi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBBzofo",
"title": "February",
"year": "1992",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "14",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxEhFtD",
"doi": "10.1109/34.121791",
"abstract": "The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces.",
"title": "A Method for Registration of 3-D Shapes",
"normalizedTitle": "A Method for Registration of 3-D Shapes",
"fno": "i0239",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Solid Modeling",
"Motion Estimation",
"Iterative Closest Point Algorithm",
"Iterative Algorithms",
"Testing",
"Inspection",
"Shape Measurement",
"Iterative Methods",
"Convergence",
"Quaternions"
],
"authors": [
{
"givenName": "P.J.",
"surname": "Besl",
"fullName": "P.J. Besl",
"affiliation": "General Motors Res. Labs., Warren, MI, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "N.D.",
"surname": "McKay",
"fullName": "N.D. McKay",
"affiliation": "General Motors Res. Labs., Warren, MI, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1992-02-01 00:00:00",
"pubType": "trans",
"pages": "239-256",
"year": "1992",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0214",
"articleId": "13rRUyeTViT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0257",
"articleId": "13rRUILtJmW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFiZ",
"title": "July",
"year": "2017",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "39",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWmh",
"doi": "10.1109/TPAMI.2016.2598344",
"abstract": "B-splines are commonly utilized to construct the transformation model in free-form deformation (FFD) based registration. B-splines become smoother with increasing spline order. However, a higher-order B-spline requires a larger support region involving more control points, which means higher computational cost. In general, the third-order B-spline is considered as a good compromise between spline smoothness and computational cost. A lower-order function is seldom used to construct the transformation model for registration since it is less smooth. In this research, we investigated whether lower-order B-spline functions can be utilized for more efficient registration, while preserving smoothness of the deformation by using a novel random perturbation technique. With the proposed perturbation technique, the expected value of the cost function given probability density function (PDF) of the perturbation is minimized by a stochastic gradient descent optimization. Extensive experiments on 2D synthetically deformed brain images, and real 3D lung and brain scans demonstrated that the novel randomly perturbed free-form deformation (RPFFD) approach improves the registration accuracy and transformation smoothness. Meanwhile, lower-order RPFFD methods reduce the computational cost substantially.",
"abstracts": [
{
"abstractType": "Regular",
"content": "B-splines are commonly utilized to construct the transformation model in free-form deformation (FFD) based registration. B-splines become smoother with increasing spline order. However, a higher-order B-spline requires a larger support region involving more control points, which means higher computational cost. In general, the third-order B-spline is considered as a good compromise between spline smoothness and computational cost. A lower-order function is seldom used to construct the transformation model for registration since it is less smooth. In this research, we investigated whether lower-order B-spline functions can be utilized for more efficient registration, while preserving smoothness of the deformation by using a novel random perturbation technique. With the proposed perturbation technique, the expected value of the cost function given probability density function (PDF) of the perturbation is minimized by a stochastic gradient descent optimization. Extensive experiments on 2D synthetically deformed brain images, and real 3D lung and brain scans demonstrated that the novel randomly perturbed free-form deformation (RPFFD) approach improves the registration accuracy and transformation smoothness. Meanwhile, lower-order RPFFD methods reduce the computational cost substantially.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "B-splines are commonly utilized to construct the transformation model in free-form deformation (FFD) based registration. B-splines become smoother with increasing spline order. However, a higher-order B-spline requires a larger support region involving more control points, which means higher computational cost. In general, the third-order B-spline is considered as a good compromise between spline smoothness and computational cost. A lower-order function is seldom used to construct the transformation model for registration since it is less smooth. In this research, we investigated whether lower-order B-spline functions can be utilized for more efficient registration, while preserving smoothness of the deformation by using a novel random perturbation technique. With the proposed perturbation technique, the expected value of the cost function given probability density function (PDF) of the perturbation is minimized by a stochastic gradient descent optimization. Extensive experiments on 2D synthetically deformed brain images, and real 3D lung and brain scans demonstrated that the novel randomly perturbed free-form deformation (RPFFD) approach improves the registration accuracy and transformation smoothness. Meanwhile, lower-order RPFFD methods reduce the computational cost substantially.",
"title": "Randomly Perturbed B-Splines for Nonrigid Image Registration",
"normalizedTitle": "Randomly Perturbed B-Splines for Nonrigid Image Registration",
"fno": "07533440",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Splines Mathematics",
"Computational Efficiency",
"Cost Function",
"Stochastic Processes",
"Image Registration",
"Computational Modeling",
"Nonrigid Registration",
"B Splines",
"Perturbation",
"Transformation",
"Free Form Deformation",
"Stochastic Optimization"
],
"authors": [
{
"givenName": "Wei",
"surname": "Sun",
"fullName": "Wei Sun",
"affiliation": "Departments of Radiology and Medical Informatics, Erasmus MC, Biomedical Imaging Group Rotterdam, Rotterdam, CA, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wiro J.",
"surname": "Niessen",
"fullName": "Wiro J. Niessen",
"affiliation": "Departments of Radiology and Medical Informatics, Erasmus MC, Biomedical Imaging Group Rotterdam, Rotterdam, CA, The Netherlands",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Stefan",
"surname": "Klein",
"fullName": "Stefan Klein",
"affiliation": "Biomedical Imaging Group Rotterdam, Departments of Radiology and Medical Informatics, Erasmus MC, Rotterdam, CA, The Netherlands",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2017-07-01 00:00:00",
"pubType": "trans",
"pages": "1401-1413",
"year": "2017",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icdh/2014/4284/0/4284a132",
"title": "A Geometric Interpolation Algorithm by Non-uniform Cubic B-Splines",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2014/4284a132/12OmNCcKQj3",
"parentPublication": {
"id": "proceedings/icdh/2014/4284/0",
"title": "2014 5th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2016/1437/0/1437a481",
"title": "Tissue-Volume Preserving Deformable Image Registration for 4DCT Pulmonary Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437a481/12OmNCm7BwM",
"parentPublication": {
"id": "proceedings/cvprw/2016/1437/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccee/2009/3925/1/3925a214",
"title": "P-ary Subdivision Generalizing B-splines",
"doi": null,
"abstractUrl": "/proceedings-article/iccee/2009/3925a214/12OmNxwncuy",
"parentPublication": {
"id": "iccee/2009/3925/1",
"title": "Computer and Electrical Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815037",
"title": "G2-Continuity Extension Algorithm for Disk B-Spline Curve",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815037/12OmNyoSbbV",
"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/icpr/2012/2216/0/06460708",
"title": "Feature-aligned 4D spatiotemporal image registration",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460708/12OmNzUPpFB",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/01/v0085",
"title": "Image Registration Using Hierarchical B-Splines",
"doi": null,
"abstractUrl": "/journal/tg/2004/01/v0085/13rRUxDIth5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/09/07558244",
"title": "Knot Optimization for Biharmonic B-splines on Manifold Triangle Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2017/09/07558244/13rRUxly95G",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/03/v0228",
"title": "Scattered Data Interpolation with Multilevel B-Splines",
"doi": null,
"abstractUrl": "/journal/tg/1997/03/v0228/13rRUxly9dH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000j281",
"title": "CNN Driven Sparse Multi-level B-Spline Image Registration",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000j281/17D45Xh13wJ",
"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/cscc/2020/6503/0/650300a135",
"title": "On Construction of Singular Splines",
"doi": null,
"abstractUrl": "/proceedings-article/cscc/2020/650300a135/1t2mWTao4uI",
"parentPublication": {
"id": "proceedings/cscc/2020/6503/0",
"title": "2020 24th International Conference on Circuits, Systems, Communications and Computers (CSCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07527684",
"articleId": "13rRUygT7og",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07542175",
"articleId": "13rRUx0xPjr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyRxFj0",
"title": "March",
"year": "2018",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "24",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyYSWl7",
"doi": "10.1109/TVCG.2017.2660490",
"abstract": "Specular microfacet distributions have been successfully employed by many authors for representing glossiness of materials. They are generally combined with a Lambertian term to account for the colored aspect. These representations make use of the Fresnel reflectance factor at the interface, but the transmission factor at the interface should also be managed. One solution is to employ a multi-layered model with a single layer for the rough interface, which requires a numerical simulation for handling the multiple reflections of light between the substrate and the interface. In this paper, we propose rather to use a representation corresponding to a Fresnel interface lying on a Lambertian substrate, for which the multiple reflections of light between the interface and the substrate can be expressed analytically. With this interfaced Lambertian model, we show how Fresnel transmission affects the material appearance for flat and rough surfaces with isotropic and anisotropic distributions, that produce light backscattering effects. We also propose a methodology for using such materials in any physically based Monte Carlo rendering system, as well as an approximate representation, suitable for GPU applications or measured data fitting. Our approach generalizes several previous models, including flat Lambertian materials as well as specular and Lambertian microfacets. Our results illustrate the wide range of materials that can be rendered with this representation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Specular microfacet distributions have been successfully employed by many authors for representing glossiness of materials. They are generally combined with a Lambertian term to account for the colored aspect. These representations make use of the Fresnel reflectance factor at the interface, but the transmission factor at the interface should also be managed. One solution is to employ a multi-layered model with a single layer for the rough interface, which requires a numerical simulation for handling the multiple reflections of light between the substrate and the interface. In this paper, we propose rather to use a representation corresponding to a Fresnel interface lying on a Lambertian substrate, for which the multiple reflections of light between the interface and the substrate can be expressed analytically. With this interfaced Lambertian model, we show how Fresnel transmission affects the material appearance for flat and rough surfaces with isotropic and anisotropic distributions, that produce light backscattering effects. We also propose a methodology for using such materials in any physically based Monte Carlo rendering system, as well as an approximate representation, suitable for GPU applications or measured data fitting. Our approach generalizes several previous models, including flat Lambertian materials as well as specular and Lambertian microfacets. Our results illustrate the wide range of materials that can be rendered with this representation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Specular microfacet distributions have been successfully employed by many authors for representing glossiness of materials. They are generally combined with a Lambertian term to account for the colored aspect. These representations make use of the Fresnel reflectance factor at the interface, but the transmission factor at the interface should also be managed. One solution is to employ a multi-layered model with a single layer for the rough interface, which requires a numerical simulation for handling the multiple reflections of light between the substrate and the interface. In this paper, we propose rather to use a representation corresponding to a Fresnel interface lying on a Lambertian substrate, for which the multiple reflections of light between the interface and the substrate can be expressed analytically. With this interfaced Lambertian model, we show how Fresnel transmission affects the material appearance for flat and rough surfaces with isotropic and anisotropic distributions, that produce light backscattering effects. We also propose a methodology for using such materials in any physically based Monte Carlo rendering system, as well as an approximate representation, suitable for GPU applications or measured data fitting. Our approach generalizes several previous models, including flat Lambertian materials as well as specular and Lambertian microfacets. Our results illustrate the wide range of materials that can be rendered with this representation.",
"title": "Rendering Rough Opaque Materials with Interfaced Lambertian Microfacets",
"normalizedTitle": "Rendering Rough Opaque Materials with Interfaced Lambertian Microfacets",
"fno": "07866010",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rough Surfaces",
"Surface Roughness",
"Substrates",
"Refractive Index",
"Backscatter",
"Rendering Computer Graphics",
"Surface Appearance",
"BRDF",
"Microfacets",
"Importance Sampling"
],
"authors": [
{
"givenName": "Daniel",
"surname": "Meneveaux",
"fullName": "Daniel Meneveaux",
"affiliation": "XLIM Institute UMR CNRS 7252, University of Poitiers, Poitiers, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Benjamin",
"surname": "Bringier",
"fullName": "Benjamin Bringier",
"affiliation": "XLIM Institute UMR CNRS 7252, University of Poitiers, Poitiers, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Emmanuelle",
"surname": "Tauzia",
"fullName": "Emmanuelle Tauzia",
"affiliation": "XLIM Institute UMR CNRS 7252, University of Poitiers, Poitiers, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mickaël",
"surname": "Ribardière",
"fullName": "Mickaël Ribardière",
"affiliation": "XLIM Institute UMR CNRS 7252, University of Poitiers, Poitiers, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lionel",
"surname": "Simonot",
"fullName": "Lionel Simonot",
"affiliation": "PPRIME Institute UPR CNRS 3346, University of Poitiers, Poitiers, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2018-03-01 00:00:00",
"pubType": "trans",
"pages": "1368-1380",
"year": "2018",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visapp/2014/8133/3/07295152",
"title": "A semi-Lagrangian approximation of the Oren-Nayar PDE for the orthographic Shape-from-Shading problem",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07295152/12OmNrAv3UE",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/2",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206498",
"title": "A unified model of specular and diffuse reflectance for rough, glossy surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206498/12OmNvAiShy",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1994/6952/2/00413545",
"title": "Shape from shading for non-Lambertian surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1994/00413545/12OmNvsDHHP",
"parentPublication": {
"id": "proceedings/icip/1994/6952/2",
"title": "Proceedings of 1st International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1992/2855/0/00223148",
"title": "Diffuse reflection (intensity reflectance model)",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223148/12OmNwlZu1a",
"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/iciev-iscmht/2017/1023/0/08338605",
"title": "Graphene based circular patch terahertz antenna using novel substrate materials",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-iscmht/2017/08338605/12OmNzRHOVv",
"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/icpr/1994/6265/1/00576373",
"title": "Interreflections with rough surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00576373/12OmNzw8jiH",
"parentPublication": {
"id": "proceedings/icpr/1994/6265/1",
"title": "Proceedings of 12th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1993/3880/0/00341163",
"title": "Diffuse reflectance from rough surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341163/12OmNzwpU3S",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101591",
"title": "Real-Time Rendering of Rough Refraction",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101591/13rRUxBa5rT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2014/03/06809998",
"title": "Haptic Invitation of Textures: Perceptually Prominent Properties of Materials Determine Human Touch Motions",
"doi": null,
"abstractUrl": "/journal/th/2014/03/06809998/13rRUxOdD8p",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedme/2020/8145/0/09122232",
"title": "Effect of Surface Roughness on Thermal Contact Resistance of Fixed Interface in Thermal Measurement of Electron Device",
"doi": null,
"abstractUrl": "/proceedings-article/icedme/2020/09122232/1kRSyHsM0HS",
"parentPublication": {
"id": "proceedings/icedme/2020/8145/0",
"title": "2020 3rd International Conference on Electron Device and Mechanical Engineering (ICEDME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07839260",
"articleId": "13rRUxYrbMn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07852440",
"articleId": "13rRUwI5U2Q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesWd",
"name": "ttg201803-07866010s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201803-07866010s1.zip",
"extension": "zip",
"size": "339 kB",
"__typename": "WebExtraType"
}
],
"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": "1DPaAhAefgQ",
"doi": "10.1109/TPAMI.2022.3178184",
"abstract": "Metro origin-destination prediction is a crucial yet challenging time-series analysis task in intelligent transportation systems, which aims to accurately forecast two specific types of cross-station ridership, i.e., Origin-Destination (OD) one and Destination-Origin (DO) one. However, complete OD matrices of previous time intervals can not be obtained immediately in online metro systems, and conventional methods only used limited information to forecast the future OD and DO ridership separately. In this work, we proposed a novel neural network module termed Heterogeneous Information Aggregation Machine (HIAM), which fully exploits heterogeneous information of historical data (e.g., incomplete OD matrices, unfinished order vectors, and DO matrices) to jointly learn the evolutionary patterns of OD and DO ridership. Specifically, an OD modeling branch estimates the potential destinations of unfinished orders explicitly to complement the information of incomplete OD matrices, while a DO modeling branch takes DO matrices as input to capture the spatial-temporal distribution of DO ridership. Moreover, a Dual Information Transformer is introduced to propagate the mutual information among OD features and DO features for modeling the OD-DO causality and correlation. Based on the proposed HIAM, we develop a unified Seq2Seq network to forecast the future OD and DO ridership simultaneously. Extensive experiments conducted on two large-scale benchmarks demonstrate the effectiveness of our method for online metro origin-destination prediction. Our code is resealed at <uri>https://github.com/HCPLab-SYSU/HIAM</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Metro origin-destination prediction is a crucial yet challenging time-series analysis task in intelligent transportation systems, which aims to accurately forecast two specific types of cross-station ridership, i.e., Origin-Destination (OD) one and Destination-Origin (DO) one. However, complete OD matrices of previous time intervals can not be obtained immediately in online metro systems, and conventional methods only used limited information to forecast the future OD and DO ridership separately. In this work, we proposed a novel neural network module termed Heterogeneous Information Aggregation Machine (HIAM), which fully exploits heterogeneous information of historical data (e.g., incomplete OD matrices, unfinished order vectors, and DO matrices) to jointly learn the evolutionary patterns of OD and DO ridership. Specifically, an OD modeling branch estimates the potential destinations of unfinished orders explicitly to complement the information of incomplete OD matrices, while a DO modeling branch takes DO matrices as input to capture the spatial-temporal distribution of DO ridership. Moreover, a Dual Information Transformer is introduced to propagate the mutual information among OD features and DO features for modeling the OD-DO causality and correlation. Based on the proposed HIAM, we develop a unified Seq2Seq network to forecast the future OD and DO ridership simultaneously. Extensive experiments conducted on two large-scale benchmarks demonstrate the effectiveness of our method for online metro origin-destination prediction. Our code is resealed at <uri>https://github.com/HCPLab-SYSU/HIAM</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Metro origin-destination prediction is a crucial yet challenging time-series analysis task in intelligent transportation systems, which aims to accurately forecast two specific types of cross-station ridership, i.e., Origin-Destination (OD) one and Destination-Origin (DO) one. However, complete OD matrices of previous time intervals can not be obtained immediately in online metro systems, and conventional methods only used limited information to forecast the future OD and DO ridership separately. In this work, we proposed a novel neural network module termed Heterogeneous Information Aggregation Machine (HIAM), which fully exploits heterogeneous information of historical data (e.g., incomplete OD matrices, unfinished order vectors, and DO matrices) to jointly learn the evolutionary patterns of OD and DO ridership. Specifically, an OD modeling branch estimates the potential destinations of unfinished orders explicitly to complement the information of incomplete OD matrices, while a DO modeling branch takes DO matrices as input to capture the spatial-temporal distribution of DO ridership. Moreover, a Dual Information Transformer is introduced to propagate the mutual information among OD features and DO features for modeling the OD-DO causality and correlation. Based on the proposed HIAM, we develop a unified Seq2Seq network to forecast the future OD and DO ridership simultaneously. Extensive experiments conducted on two large-scale benchmarks demonstrate the effectiveness of our method for online metro origin-destination prediction. Our code is resealed at https://github.com/HCPLab-SYSU/HIAM.",
"title": "Online Metro Origin-Destination Prediction via Heterogeneous Information Aggregation",
"normalizedTitle": "Online Metro Origin-Destination Prediction via Heterogeneous Information Aggregation",
"fno": "09785888",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Feature Extraction",
"Intelligent Transportation Systems",
"Learning Artificial Intelligence",
"Matrix Algebra",
"Neural Nets",
"Time Series",
"Traffic Engineering Computing",
"Complete OD Matrices",
"Cross Station Ridership",
"Crucial Yet Challenging Time Series Analysis Task",
"Destination Origin",
"Dual Information Transformer",
"Future OD",
"Heterogeneous Information Aggregation Machine",
"Incomplete OD Matrices",
"Intelligent Transportation Systems",
"Mutual Information",
"OD Features",
"OD Modeling Branch",
"Online Metro Origin Destination Prediction",
"Online Metro Systems",
"Potential Destinations",
"Previous Time Intervals",
"Time Series Analysis",
"Sparse Matrices",
"Predictive Models",
"Task Analysis",
"Transformers",
"Public Transportation",
"Forecasting",
"Causality And Correlation",
"Heterogeneous Information",
"Online Metro System",
"Origin Destination Ridership"
],
"authors": [
{
"givenName": "Lingbo",
"surname": "Liu",
"fullName": "Lingbo Liu",
"affiliation": "School of Computer Science and Engineering, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuying",
"surname": "Zhu",
"fullName": "Yuying Zhu",
"affiliation": "School of Computer Science and Engineering, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guanbin",
"surname": "Li",
"fullName": "Guanbin Li",
"affiliation": "School of Computer Science and Engineering, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ziyi",
"surname": "Wu",
"fullName": "Ziyi Wu",
"affiliation": "School of Computer Science and Engineering, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lei",
"surname": "Bai",
"fullName": "Lei Bai",
"affiliation": "School of Electrical and Information Engineering, University of Sydney, Sydney, Australia",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liang",
"surname": "Lin",
"fullName": "Liang Lin",
"affiliation": "School of Computer Science and Engineering, Sun Yat-Sen University, Guangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "3574-3589",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icniconsmcl/2006/2552/0/25520041",
"title": "Characteristics of Origin-Destination Pair Traffic in Funet",
"doi": null,
"abstractUrl": "/proceedings-article/icniconsmcl/2006/25520041/12OmNAQanvZ",
"parentPublication": {
"id": "proceedings/icniconsmcl/2006/2552/0",
"title": "Mobile Communications and Learning Technologies, Conference on Networking, Conference on Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2006/2747/0/04061339",
"title": "Origin-Destination Network Tomography with Bayesian Inversion Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2006/04061339/12OmNBOllof",
"parentPublication": {
"id": "proceedings/wi/2006/2747/0",
"title": "2006 IEEE/WIC/ACM International Conference on Web Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2016/8985/0/8985b146",
"title": "Estimation of Passenger Origin-Destination Matrices and Efficiency Evaluation of Public Transportation",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2016/8985b146/12OmNrIJqA0",
"parentPublication": {
"id": "proceedings/iiai-aai/2016/8985/0",
"title": "2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460905",
"title": "Statistical Origin-destination generation with multiple sources",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460905/12OmNwGZNMk",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi/2006/2747/0/274700038",
"title": "Origin-Destination Network Tomography with Bayesian Inversion Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wi/2006/274700038/12OmNyKa5YI",
"parentPublication": {
"id": "proceedings/wi/2006/2747/0",
"title": "2006 IEEE/WIC/ACM International Conference on Web Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2022/5099/0/509900a879",
"title": "Origin-Destination Traffic Prediction based on Hybrid Spatio-Temporal Network",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2022/509900a879/1KpCBZggOS4",
"parentPublication": {
"id": "proceedings/icdm/2022/5099/0",
"title": "2022 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2019/9552/0/955200a760",
"title": "Taxi Origin-Destination Demand Prediction with Contextualized Spatial-Temporal Network",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2019/955200a760/1cdOTb4hTJC",
"parentPublication": {
"id": "proceedings/icme/2019/9552/0",
"title": "2019 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101647",
"title": "Stochastic Origin-Destination Matrix Forecasting Using Dual-Stage Graph Convolutional, Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101647/1kaMCw5TKWA",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2022/06/09369004",
"title": "Long-Term Origin-Destination Demand Prediction With Graph Deep Learning",
"doi": null,
"abstractUrl": "/journal/bd/2022/06/09369004/1rFvAIU5Og0",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09416848",
"title": "Inferring Origin-Destination Flows From Population Distribution",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09416848/1t8VNb1SvEk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09767619",
"articleId": "1D4Hhdwyaw8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09778974",
"articleId": "1DvfLbwwcsE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgJt",
"title": "September/October",
"year": "2008",
"issueNum": "05",
"idPrefix": "mi",
"pubType": "magazine",
"volume": "28",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNEqMp",
"doi": "10.1109/MM.2008.81",
"abstract": "In the previous issue, Stern traced the history of two \"clues\" to patent-eligibility: substance-transformation and device-implementation. This issue, he focuses on another clue to patent-eligibility that has received insufficient attention: the US Constitution's limitation of congressional power in the patent field to what it termed \"the useful Arts.\" Stern explores that limitation and points out how it affects business-method patents.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the previous issue, Stern traced the history of two \"clues\" to patent-eligibility: substance-transformation and device-implementation. This issue, he focuses on another clue to patent-eligibility that has received insufficient attention: the US Constitution's limitation of congressional power in the patent field to what it termed \"the useful Arts.\" Stern explores that limitation and points out how it affects business-method patents.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the previous issue, Stern traced the history of two \"clues\" to patent-eligibility: substance-transformation and device-implementation. This issue, he focuses on another clue to patent-eligibility that has received insufficient attention: the US Constitution's limitation of congressional power in the patent field to what it termed \"the useful Arts.\" Stern explores that limitation and points out how it affects business-method patents.",
"title": "What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The \"Useful Arts\" Requirement",
"normalizedTitle": "What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The \"Useful Arts\" Requirement",
"fno": "mmi2008050064",
"hasPdf": true,
"idPrefix": "mi",
"keywords": [
"Law",
"Patents",
"Patent Eligibility",
"Device Implementation",
"Useful Arts",
"Business Process Patents",
"Software Patents"
],
"authors": [
{
"givenName": "Richard",
"surname": "Stern",
"fullName": "Richard Stern",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2008-09-01 00:00:00",
"pubType": "mags",
"pages": "64-70",
"year": "2008",
"issn": "0272-1732",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/mi/2008/04/mmi2008040096",
"title": "What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part I",
"doi": null,
"abstractUrl": "/magazine/mi/2008/04/mmi2008040096/13rRUxASuJe",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/08/mco2013080009",
"title": "Ten Things to Know about Applying for Non-US Patents",
"doi": null,
"abstractUrl": "/magazine/co/2013/08/mco2013080009/13rRUxcsYPy",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mmi2008050054",
"articleId": "13rRUy3gn9W",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mmi2008050072",
"articleId": "13rRUwI5UcJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBO3K59",
"title": "March/April",
"year": "2006",
"issueNum": "02",
"idPrefix": "mi",
"pubType": "magazine",
"volume": "26",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZ0nYj",
"doi": "10.1109/MM.2006.43",
"abstract": "Philip G. Emma lists and describes what he considers to be the most useful patents ever in microarchitecture.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Philip G. Emma lists and describes what he considers to be the most useful patents ever in microarchitecture.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Philip G. Emma lists and describes what he considers to be the most useful patents ever in microarchitecture.",
"title": "The best patents of all",
"normalizedTitle": "The best patents of all",
"fno": "m2084",
"hasPdf": true,
"idPrefix": "mi",
"keywords": [
"Patents",
"Balonium",
"Ubiquitous Patent"
],
"authors": [
{
"givenName": "Philip G.",
"surname": "Emma",
"fullName": "Philip G. Emma",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2006-03-01 00:00:00",
"pubType": "mags",
"pages": "84, 83",
"year": "2006",
"issn": "0272-1732",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iciii/2010/4279/2/4279b055",
"title": "The Role of Patents in the GSM Standard Setting Processes",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2010/4279b055/12OmNzIUfWc",
"parentPublication": {
"id": "proceedings/iciii/2010/4279/2",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2011/4523/3/4523c479",
"title": "Patents are Not Patents Only: Turning Point of Characters in the Semiconductor Industry",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2011/4523c479/12OmNzsJ7qo",
"parentPublication": {
"id": "proceedings/iciii/2011/4523/3",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2006/05/m5088",
"title": "Prosecuting your patent",
"doi": null,
"abstractUrl": "/magazine/mi/2006/05/m5088/13rRUwgQpnA",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2006/04/m4088",
"title": "The Mechanics of Filing a Patent",
"doi": null,
"abstractUrl": "/magazine/mi/2006/04/m4088/13rRUwvT9dn",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2008/05/mmi2008050064",
"title": "What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The \"Useful Arts\" Requirement",
"doi": null,
"abstractUrl": "/magazine/mi/2008/05/mmi2008050064/13rRUxNEqMp",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2006/06/m6072",
"title": "Five strategies for overcoming obviousness",
"doi": null,
"abstractUrl": "/magazine/mi/2006/06/m6072/13rRUxcKzX8",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/08/mco2013080009",
"title": "Ten Things to Know about Applying for Non-US Patents",
"doi": null,
"abstractUrl": "/magazine/co/2013/08/mco2013080009/13rRUxcsYPy",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2000/03/r3030",
"title": "The Evitability of Software Patents",
"doi": null,
"abstractUrl": "/magazine/co/2000/03/r3030/13rRUy3xYdM",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/06/09623400",
"title": "Microarchitecture Patents Over Time and Interesting Early Microarchitecture Patents",
"doi": null,
"abstractUrl": "/magazine/mi/2021/06/09623400/1yJTqPGfYWY",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "m2068",
"articleId": "13rRUB7a1lc",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNCm7Bxy",
"title": "Nov.-Dec.",
"year": "2014",
"issueNum": "06",
"idPrefix": "mi",
"pubType": "magazine",
"volume": "34",
"label": "Nov.-Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3gn44",
"doi": "10.1109/MM.2014.93",
"abstract": "This column is the conclusion to a two-part series on the recent Supreme Court case of Alice Corporation Pty. Ltd v. CLS Bank International and the question of whether patents can be issued on computer-related innovations and, more broadly, on business methods and software. This column describes the Supreme Court's Alice decision, the industry's reaction to the decision, and the apparent consequences for both software and business-method patents.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This column is the conclusion to a two-part series on the recent Supreme Court case of Alice Corporation Pty. Ltd v. CLS Bank International and the question of whether patents can be issued on computer-related innovations and, more broadly, on business methods and software. This column describes the Supreme Court's Alice decision, the industry's reaction to the decision, and the apparent consequences for both software and business-method patents.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This column is the conclusion to a two-part series on the recent Supreme Court case of Alice Corporation Pty. Ltd v. CLS Bank International and the question of whether patents can be issued on computer-related innovations and, more broadly, on business methods and software. This column describes the Supreme Court's Alice decision, the industry's reaction to the decision, and the apparent consequences for both software and business-method patents.",
"title": "Alice v. CLS Bank: Are US Business-Method and Software Patents Doomed? Part 2",
"normalizedTitle": "Alice v. CLS Bank: Are US Business-Method and Software Patents Doomed? Part 2",
"fno": "mmi2014060098",
"hasPdf": true,
"idPrefix": "mi",
"keywords": [
"Patents",
"Legal Aspects",
"Software Development",
"Business",
"Law",
"Software",
"Patent",
"Patent Eligible",
"Patent Ineligible",
"Patent Eligibility",
"Patent Ineligibility",
"Business Method"
],
"authors": [
{
"givenName": "Richard H.",
"surname": "Stern",
"fullName": "Richard H. Stern",
"affiliation": "Kellogg Huber Hansen Todd Evans & Figel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2014-11-01 00:00:00",
"pubType": "mags",
"pages": "98-c3",
"year": "2014",
"issn": "0272-1732",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ict4m/2016/4521/0/4521a171",
"title": "Competitive Ability of Information and Communication Technology Patents: A Case Study of Patents Owned by Indonesian Institute of Sciences (LIPI)",
"doi": null,
"abstractUrl": "/proceedings-article/ict4m/2016/4521a171/12OmNAY7990",
"parentPublication": {
"id": "proceedings/ict4m/2016/4521/0",
"title": "2016 6th International Conference on Information and Communication Technology for The Muslim World (ICT4M)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2015/9795/0/9795a238",
"title": "Teva's Impact on the US National Patent System (\"NPS\"): The Mayo/Biosig/Alice (\"MBA\") Framework Made It a Rough Diamond -- But Rough for Ever? Teva Cuts This Diamond and Thus May Create a Historic Mega-Trend in SPL, also Internationally",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2015/9795a238/12OmNwDACuC",
"parentPublication": {
"id": "proceedings/csci/2015/9795/0",
"title": "2015 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2014/05/mmi2014050064",
"title": "Alice v. CLS Bank: Are US Business-Method and Software Patents Doomed? Part 1",
"doi": null,
"abstractUrl": "/magazine/mi/2014/05/mmi2014050064/13rRUwd9CCN",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/09/mco2013090017",
"title": "Working with Your Legal Department",
"doi": null,
"abstractUrl": "/magazine/co/2013/09/mco2013090017/13rRUwwJWIz",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2008/04/mmi2008040096",
"title": "What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part I",
"doi": null,
"abstractUrl": "/magazine/mi/2008/04/mmi2008040096/13rRUxASuJe",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2008/05/mmi2008050064",
"title": "What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The \"Useful Arts\" Requirement",
"doi": null,
"abstractUrl": "/magazine/mi/2008/05/mmi2008050064/13rRUxNEqMp",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2015/07/mco2015070012",
"title": "\"Curiouser and Curiouser!\"--The Fallout from Alice",
"doi": null,
"abstractUrl": "/magazine/co/2015/07/mco2015070012/13rRUxcsYPA",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/08/mco2013080009",
"title": "Ten Things to Know about Applying for Non-US Patents",
"doi": null,
"abstractUrl": "/magazine/co/2013/08/mco2013080009/13rRUxcsYPy",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/03/mco2013030008",
"title": "Design Patents",
"doi": null,
"abstractUrl": "/magazine/co/2013/03/mco2013030008/13rRUygT7dJ",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/06/09933406",
"title": "Analysis of Historical Patenting Behavior and Patent Characteristics of Computer Architecture Companies—Part V: References",
"doi": null,
"abstractUrl": "/magazine/mi/2022/06/09933406/1HVswyaEaUE",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mmi2014060095",
"articleId": "13rRUEgarxW",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyoiZ0Z",
"title": "March",
"year": "2013",
"issueNum": "03",
"idPrefix": "co",
"pubType": "magazine",
"volume": "46",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygT7dJ",
"doi": "10.1109/MC.2013.91",
"abstract": "Once relatively uncommon, design patents are now used aggressively and—as recent events have shown—can lead to significant liability for those found to infringe them. The Web extra at http://youtu.be/YXSXjj4QLZU is an audio recording of authors Brian M. Gaff, Stephen G. Huggard, and Gregory W. Carey discussing how design patents, though once relatively uncommon, are now used aggressively and as recent events have shown can lead to significant liability for those found to infringe them.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Once relatively uncommon, design patents are now used aggressively and—as recent events have shown—can lead to significant liability for those found to infringe them. The Web extra at http://youtu.be/YXSXjj4QLZU is an audio recording of authors Brian M. Gaff, Stephen G. Huggard, and Gregory W. Carey discussing how design patents, though once relatively uncommon, are now used aggressively and as recent events have shown can lead to significant liability for those found to infringe them.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Once relatively uncommon, design patents are now used aggressively and—as recent events have shown—can lead to significant liability for those found to infringe them. The Web extra at http://youtu.be/YXSXjj4QLZU is an audio recording of authors Brian M. Gaff, Stephen G. Huggard, and Gregory W. Carey discussing how design patents, though once relatively uncommon, are now used aggressively and as recent events have shown can lead to significant liability for those found to infringe them.",
"title": "Design Patents",
"normalizedTitle": "Design Patents",
"fno": "mco2013030008",
"hasPdf": true,
"idPrefix": "co",
"keywords": [
"IP Protection",
"Computing And The Law",
"Design Patents"
],
"authors": [
{
"givenName": "Brian M.",
"surname": "Gaff",
"fullName": "Brian M. Gaff",
"affiliation": "Edwards Wildman Palmer LLP",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter J.",
"surname": "Cuomo",
"fullName": "Peter J. Cuomo",
"affiliation": "Edwards Wildman Palmer LLP",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2013-03-01 00:00:00",
"pubType": "mags",
"pages": "8-10",
"year": "2013",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ict4m/2016/4521/0/4521a171",
"title": "Competitive Ability of Information and Communication Technology Patents: A Case Study of Patents Owned by Indonesian Institute of Sciences (LIPI)",
"doi": null,
"abstractUrl": "/proceedings-article/ict4m/2016/4521a171/12OmNAY7990",
"parentPublication": {
"id": "proceedings/ict4m/2016/4521/0",
"title": "2016 6th International Conference on Information and Communication Technology for The Muslim World (ICT4M)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/09/07570239",
"title": "A Survey on Visual Approaches for Analyzing Scientific Literature and Patents",
"doi": null,
"abstractUrl": "/journal/tg/2017/09/07570239/13rRUB7a115",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/04/mco2013040009",
"title": "Patent Monetization",
"doi": null,
"abstractUrl": "/magazine/co/2013/04/mco2013040009/13rRUx0Pqte",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/so/2002/03/s3078",
"title": "How Software Patents Can Support COTS Component Business",
"doi": null,
"abstractUrl": "/magazine/so/2002/03/s3078/13rRUxOdDaH",
"parentPublication": {
"id": "mags/so",
"title": "IEEE Software",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2006/02/m2084",
"title": "The best patents of all",
"doi": null,
"abstractUrl": "/magazine/mi/2006/02/m2084/13rRUxZ0nYj",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/06/mco2013060009",
"title": "Are You Exhausted by Your First Sale?",
"doi": null,
"abstractUrl": "/magazine/co/2013/06/mco2013060009/13rRUxlgxYX",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2014/06/mmi2014060098",
"title": "Alice v. CLS Bank: Are US Business-Method and Software Patents Doomed? Part 2",
"doi": null,
"abstractUrl": "/magazine/mi/2014/06/mmi2014060098/13rRUy3gn44",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/03/09779389",
"title": "Review of Patents Issued to Computer Architecture Companies in 2021—Part II",
"doi": null,
"abstractUrl": "/magazine/mi/2022/03/09779389/1DwUDJ8uCE8",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/04/09473059",
"title": "Recent Patents for Leading Computer Architecture Companies",
"doi": null,
"abstractUrl": "/magazine/mi/2021/04/09473059/1uUtFYrKBVu",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/06/09623400",
"title": "Microarchitecture Patents Over Time and Interesting Early Microarchitecture Patents",
"doi": null,
"abstractUrl": "/magazine/mi/2021/06/09623400/1yJTqPGfYWY",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "mco2013030006",
"articleId": "13rRUy0HYNi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mco2013030012",
"articleId": "13rRUEgarws",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1DwUDiInwZO",
"title": "May-June",
"year": "2022",
"issueNum": "03",
"idPrefix": "mi",
"pubType": "magazine",
"volume": "42",
"label": "May-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1DwUDJ8uCE8",
"doi": "10.1109/MM.2022.3163434",
"abstract": "In the last article (Part I), which appeared in the March/April 2022 issue of IEEE Micro, the following was analyzed: 1) the number of all patents and the number of computer architecture patents issued in 2021 and 2) the distribution of those patents across patent classes, for 18 computer architecture companies. The author then presented a notable patent for five of those companies. This article presents a notable patent for the remaining companies. As described in more detail in the previous article, each of the following patents is from the G06F (“Electric digital data processing”) patent class as that patent class had the largest number of patents for all but three companies and because it was the only patent class where all companies had a least one patent. Furthermore, the below patents are from large patent families, which are generally considered to be more valuable.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the last article (Part I), which appeared in the March/April 2022 issue of IEEE Micro, the following was analyzed: 1) the number of all patents and the number of computer architecture patents issued in 2021 and 2) the distribution of those patents across patent classes, for 18 computer architecture companies. The author then presented a notable patent for five of those companies. This article presents a notable patent for the remaining companies. As described in more detail in the previous article, each of the following patents is from the G06F (“Electric digital data processing”) patent class as that patent class had the largest number of patents for all but three companies and because it was the only patent class where all companies had a least one patent. Furthermore, the below patents are from large patent families, which are generally considered to be more valuable.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the last article (Part I), which appeared in the March/April 2022 issue of IEEE Micro, the following was analyzed: 1) the number of all patents and the number of computer architecture patents issued in 2021 and 2) the distribution of those patents across patent classes, for 18 computer architecture companies. The author then presented a notable patent for five of those companies. This article presents a notable patent for the remaining companies. As described in more detail in the previous article, each of the following patents is from the G06F (“Electric digital data processing”) patent class as that patent class had the largest number of patents for all but three companies and because it was the only patent class where all companies had a least one patent. Furthermore, the below patents are from large patent families, which are generally considered to be more valuable.",
"title": "Review of Patents Issued to Computer Architecture Companies in 2021—Part II",
"normalizedTitle": "Review of Patents Issued to Computer Architecture Companies in 2021—Part II",
"fno": "09779389",
"hasPdf": true,
"idPrefix": "mi",
"keywords": [
"Patents",
"Computer Architecture"
],
"authors": [
{
"givenName": "Joshua J.",
"surname": "Yi",
"fullName": "Joshua J. Yi",
"affiliation": "The Law Office of Joshua J. Yi, PLLC, Austin, TX, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "03",
"pubDate": "2022-05-01 00:00:00",
"pubType": "mags",
"pages": "67-77",
"year": "2022",
"issn": "0272-1732",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wcse/2013/2882/0/06754276",
"title": "Using Artificial Neural Network (ANN) to Explore the Influences of Number of Inventors, Average Age of Patents, and Age of Patenting Activities on Patent Performance and Corporate Performance",
"doi": null,
"abstractUrl": "/proceedings-article/wcse/2013/06754276/12OmNxHJ9nJ",
"parentPublication": {
"id": "proceedings/wcse/2013/2882/0",
"title": "2013 Fourth World Congress on Software Engineering (WCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2014/04/mex2014040044",
"title": "A Graph Kernel Approach for Detecting Core Patents and Patent Groups",
"doi": null,
"abstractUrl": "/magazine/ex/2014/04/mex2014040044/13rRUB7a17s",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2008/05/mmi2008050064",
"title": "What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The \"Useful Arts\" Requirement",
"doi": null,
"abstractUrl": "/magazine/mi/2008/05/mmi2008050064/13rRUxNEqMp",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/01/09705194",
"title": "Analysis of Historical Patenting Behavior and Patent Characteristics of Computer Architecture Companies—Part II: Prosecution Time and Effective Patent Term Length",
"doi": null,
"abstractUrl": "/magazine/mi/2022/01/09705194/1AIIitufcqY",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/02/09743790",
"title": "Review of Patents Issued to Computer Architecture Companies in 2021 [Micro Law]",
"doi": null,
"abstractUrl": "/magazine/mi/2022/02/09743790/1C6XtatHhAc",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/05/09891846",
"title": "Analysis of Historical Patenting Behavior and Patent Characteristics of Computer Architecture Companies—Part IV: Claims",
"doi": null,
"abstractUrl": "/magazine/mi/2022/05/09891846/1GF6W0kGz04",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2022/9755/0/975500a484",
"title": "Comparison of patent strategies using the maintenance status of registered patents : An example of a top manufacturer of digital cameras",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2022/975500a484/1GU78Kxo0ow",
"parentPublication": {
"id": "proceedings/iiai-aai/2022/9755/0",
"title": "2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/06/09933406",
"title": "Analysis of Historical Patenting Behavior and Patent Characteristics of Computer Architecture Companies—Part V: References",
"doi": null,
"abstractUrl": "/magazine/mi/2022/06/09933406/1HVswyaEaUE",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/04/09473059",
"title": "Recent Patents for Leading Computer Architecture Companies",
"doi": null,
"abstractUrl": "/magazine/mi/2021/04/09473059/1uUtFYrKBVu",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/05/09537174",
"title": "Analysis of Historical Patenting Behavior and Patent Characteristics of Computer Architecture Companies",
"doi": null,
"abstractUrl": "/magazine/mi/2021/05/09537174/1wTixGvIMnu",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09779395",
"articleId": "1DwUFxDTj3y",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09779390",
"articleId": "1DwUGYDHMxG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1uUtFttueZ2",
"title": "July-Aug.",
"year": "2021",
"issueNum": "04",
"idPrefix": "mi",
"pubType": "magazine",
"volume": "41",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1uUtFYrKBVu",
"doi": "10.1109/MM.2021.3087210",
"abstract": "Reports on recent patents for leading computer architecture companies. One way to reveal what technologies or areas companies are investing their research and development resources is to analyze their recently issued patents. Toward that end, this article examines patents issued to the companies that have the most issued patents in the “Electric digital data processing” subcategory in the first quarter of 2021. This subcategory appears to be the subcategory in the International Patent Classification system that is closest to computer architecture. ",
"abstracts": [
{
"abstractType": "Regular",
"content": "Reports on recent patents for leading computer architecture companies. One way to reveal what technologies or areas companies are investing their research and development resources is to analyze their recently issued patents. Toward that end, this article examines patents issued to the companies that have the most issued patents in the “Electric digital data processing” subcategory in the first quarter of 2021. This subcategory appears to be the subcategory in the International Patent Classification system that is closest to computer architecture. ",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Reports on recent patents for leading computer architecture companies. One way to reveal what technologies or areas companies are investing their research and development resources is to analyze their recently issued patents. Toward that end, this article examines patents issued to the companies that have the most issued patents in the “Electric digital data processing” subcategory in the first quarter of 2021. This subcategory appears to be the subcategory in the International Patent Classification system that is closest to computer architecture. ",
"title": "Recent Patents for Leading Computer Architecture Companies",
"normalizedTitle": "Recent Patents for Leading Computer Architecture Companies",
"fno": "09473059",
"hasPdf": true,
"idPrefix": "mi",
"keywords": [
"Patents",
"Computer Architecture"
],
"authors": [
{
"givenName": "Joshua J.",
"surname": "Yi",
"fullName": "Joshua J. Yi",
"affiliation": "The Law Office of Joshua J. Yi, PLLC, Austin, TX, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "04",
"pubDate": "2021-07-01 00:00:00",
"pubType": "mags",
"pages": "74-77",
"year": "2021",
"issn": "0272-1732",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dac/1994/653/0/01600364",
"title": "Panel: Software Patents and Their Potential Impact on the EDA Community",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1994/01600364/12OmNyaXPW0",
"parentPublication": {
"id": "proceedings/dac/1994/653/0",
"title": "1994 31st Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2014/05/mmi2014050064",
"title": "Alice v. CLS Bank: Are US Business-Method and Software Patents Doomed? Part 1",
"doi": null,
"abstractUrl": "/magazine/mi/2014/05/mmi2014050064/13rRUwd9CCN",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2014/06/mmi2014060098",
"title": "Alice v. CLS Bank: Are US Business-Method and Software Patents Doomed? Part 2",
"doi": null,
"abstractUrl": "/magazine/mi/2014/06/mmi2014060098/13rRUy3gn44",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/03/mco2013030008",
"title": "Design Patents",
"doi": null,
"abstractUrl": "/magazine/co/2013/03/mco2013030008/13rRUygT7dJ",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/02/09743790",
"title": "Review of Patents Issued to Computer Architecture Companies in 2021 [Micro Law]",
"doi": null,
"abstractUrl": "/magazine/mi/2022/02/09743790/1C6XtatHhAc",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/03/09779389",
"title": "Review of Patents Issued to Computer Architecture Companies in 2021—Part II",
"doi": null,
"abstractUrl": "/magazine/mi/2022/03/09779389/1DwUDJ8uCE8",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/04/09810884",
"title": "Analysis of Historical Patenting Behavior and Patent Characteristics of Computer Architecture Companies—Part III: Claims",
"doi": null,
"abstractUrl": "/magazine/mi/2022/04/09810884/1EBiRy0YJBS",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2022/06/09933406",
"title": "Analysis of Historical Patenting Behavior and Patent Characteristics of Computer Architecture Companies—Part V: References",
"doi": null,
"abstractUrl": "/magazine/mi/2022/06/09933406/1HVswyaEaUE",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/05/09537174",
"title": "Analysis of Historical Patenting Behavior and Patent Characteristics of Computer Architecture Companies",
"doi": null,
"abstractUrl": "/magazine/mi/2021/05/09537174/1wTixGvIMnu",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/06/09623400",
"title": "Microarchitecture Patents Over Time and Interesting Early Microarchitecture Patents",
"doi": null,
"abstractUrl": "/magazine/mi/2021/06/09623400/1yJTqPGfYWY",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09361095",
"articleId": "1rseL7kvbfa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09473057",
"articleId": "1uUtKbz0Gv6",
"__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": "1CHsCMvyfuw",
"doi": "10.1109/TVCG.2022.3167896",
"abstract": "Since 2016, we have witnessed the tremendous growth of artificial intelligence+visualization (AI+VIS) research. However, existing survey papers on AI+VIS focus on visual analytics and information visualization, not scientific visualization (SciVis). In this paper, we survey related deep learning (DL) works in SciVis, specifically in the direction of DL4SciVis: designing DL solutions for solving SciVis problems. To stay focused, we primarily consider works that handle scalar and vector field data but exclude mesh data. We classify and discuss these works along six dimensions: domain setting, research task, learning type, network architecture, loss function, and evaluation metric. The paper concludes with a discussion of the remaining gaps to fill along the discussed dimensions and the grand challenges we need to tackle as a community. This state-of-the-art survey guides SciVis researchers in gaining an overview of this emerging topic and points out future directions to grow this research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Since 2016, we have witnessed the tremendous growth of artificial intelligence+visualization (AI+VIS) research. However, existing survey papers on AI+VIS focus on visual analytics and information visualization, not scientific visualization (SciVis). In this paper, we survey related deep learning (DL) works in SciVis, specifically in the direction of DL4SciVis: designing DL solutions for solving SciVis problems. To stay focused, we primarily consider works that handle scalar and vector field data but exclude mesh data. We classify and discuss these works along six dimensions: domain setting, research task, learning type, network architecture, loss function, and evaluation metric. The paper concludes with a discussion of the remaining gaps to fill along the discussed dimensions and the grand challenges we need to tackle as a community. This state-of-the-art survey guides SciVis researchers in gaining an overview of this emerging topic and points out future directions to grow this research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Since 2016, we have witnessed the tremendous growth of artificial intelligence+visualization (AI+VIS) research. However, existing survey papers on AI+VIS focus on visual analytics and information visualization, not scientific visualization (SciVis). In this paper, we survey related deep learning (DL) works in SciVis, specifically in the direction of DL4SciVis: designing DL solutions for solving SciVis problems. To stay focused, we primarily consider works that handle scalar and vector field data but exclude mesh data. We classify and discuss these works along six dimensions: domain setting, research task, learning type, network architecture, loss function, and evaluation metric. The paper concludes with a discussion of the remaining gaps to fill along the discussed dimensions and the grand challenges we need to tackle as a community. This state-of-the-art survey guides SciVis researchers in gaining an overview of this emerging topic and points out future directions to grow this research.",
"title": "DL4SciVis: A State-of-the-Art Survey on Deep Learning for Scientific Visualization",
"normalizedTitle": "DL4SciVis: A State-of-the-Art Survey on Deep Learning for Scientific Visualization",
"fno": "09760126",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Task Analysis",
"Generative Adversarial Networks",
"Neural Networks",
"Measurement",
"Deep Learning",
"Convolutional Neural Networks",
"Three Dimensional Displays",
"Scientific Visualization",
"Deep Learning",
"Survey"
],
"authors": [
{
"givenName": "Chaoli",
"surname": "Wang",
"fullName": "Chaoli Wang",
"affiliation": "Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jun",
"surname": "Han",
"fullName": "Jun Han",
"affiliation": "Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana, United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-04-01 00:00:00",
"pubType": "trans",
"pages": "1-1",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/2004/8788/0/01372246",
"title": "Panel 4: What Should We Teach in a Scientific Visualization Class?",
"doi": null,
"abstractUrl": "/proceedings-article/visual/2004/01372246/12OmNxj23hJ",
"parentPublication": {
"id": "proceedings/visual/2004/8788/0",
"title": "IEEE Visualization 2004",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rev/2009/4104/0/41040046",
"title": "Requirements Engineering Visualization: A Survey on the State-of-the-Art",
"doi": null,
"abstractUrl": "/proceedings-article/rev/2009/41040046/12OmNzIUfQV",
"parentPublication": {
"id": "proceedings/rev/2009/4104/0",
"title": "Requirements Engineering Visualization, First International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/01/ttg2014010001",
"title": "State of the Journal",
"doi": null,
"abstractUrl": "/journal/tg/2014/01/ttg2014010001/13rRUEgarsI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/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": "proceedings/aiam/2021/1732/0/173200a386",
"title": "A Survey of Research on Image Style Transfer Based on Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/aiam/2021/173200a386/1BzTXiDr6lW",
"parentPublication": {
"id": "proceedings/aiam/2021/1732/0",
"title": "2021 3rd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM)",
"__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/scivis/2018/6882/0/08823764",
"title": "Toward A Deep Understanding of What Makes a Scientific Visualization Memorable",
"doi": null,
"abstractUrl": "/proceedings-article/scivis/2018/08823764/1d5kxlHWMEg",
"parentPublication": {
"id": "proceedings/scivis/2018/6882/0",
"title": "2018 IEEE Scientific Visualization Conference (SciVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/07/09356353",
"title": "Image Segmentation Using Deep Learning: A Survey",
"doi": null,
"abstractUrl": "/journal/tp/2022/07/09356353/1rigXK0s5Ak",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09523770",
"title": "A Survey on ML4VIS: Applying Machine Learning Advances to Data Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09523770/1wnLgd43B5K",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09760161",
"articleId": "1CHsCvUiJQA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09761724",
"articleId": "1CKMkLCKOSk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvO04X",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1JNmt6JGKu4",
"doi": "10.1109/TPAMI.2023.3235415",
"abstract": "Compared with current RGB or RGB-D saliency detection datasets, those for light field saliency detection often suffer from many defects, <italic>e.g</italic>., insufficient data amount and diversity, incomplete data formats, and rough annotations, thus impeding the prosperity of this field. To settle these issues, we elaborately build a large-scale light field dataset, dubbed <bold>PKU-LF</bold>, comprising 5,000 light fields and covering diverse indoor and outdoor scenes. Our PKU-LF provides all-inclusive representation formats of light fields and offers a unified platform for comparing algorithms utilizing different input formats. For sparking new vitality in saliency detection tasks, we present many unexplored scenarios (such as underwater and high-resolution scenes) and the richest annotations (such as scribble annotations, bounding boxes, object-/instance-level annotations, and edge annotations), on which many potential attention modeling tasks can be investigated. To facilitate the development of saliency detection, we systematically evaluate and analyze 16 representative 2D, 3D, and 4D methods on four existing datasets and the proposed dataset, furnishing a thorough benchmark. Furthermore, tailored to the distinct structural characteristics of light fields, a novel symmetric two-stream architecture (<bold/><italic>STSA</italic><bold/>) network is proposed to predict the saliency of light fields more accurately. Specifically, our <italic>STSA</italic> incorporates a focalness interweavement module (FIM) and three partial decoder modules (PDM). The former is designed to efficiently establish long-range dependencies across focal slices, while the latter aims to effectively aggregate the extracted coadjutant features in a mutual-enhancement way. Extensive experiments demonstrate that our method can significantly outperform the competitors. Our dataset will be available at <uri>https://openi.pcl.ac.cn/OpenDatasets</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Compared with current RGB or RGB-D saliency detection datasets, those for light field saliency detection often suffer from many defects, <italic>e.g</italic>., insufficient data amount and diversity, incomplete data formats, and rough annotations, thus impeding the prosperity of this field. To settle these issues, we elaborately build a large-scale light field dataset, dubbed <bold>PKU-LF</bold>, comprising 5,000 light fields and covering diverse indoor and outdoor scenes. Our PKU-LF provides all-inclusive representation formats of light fields and offers a unified platform for comparing algorithms utilizing different input formats. For sparking new vitality in saliency detection tasks, we present many unexplored scenarios (such as underwater and high-resolution scenes) and the richest annotations (such as scribble annotations, bounding boxes, object-/instance-level annotations, and edge annotations), on which many potential attention modeling tasks can be investigated. To facilitate the development of saliency detection, we systematically evaluate and analyze 16 representative 2D, 3D, and 4D methods on four existing datasets and the proposed dataset, furnishing a thorough benchmark. Furthermore, tailored to the distinct structural characteristics of light fields, a novel symmetric two-stream architecture (<bold/><italic>STSA</italic><bold/>) network is proposed to predict the saliency of light fields more accurately. Specifically, our <italic>STSA</italic> incorporates a focalness interweavement module (FIM) and three partial decoder modules (PDM). The former is designed to efficiently establish long-range dependencies across focal slices, while the latter aims to effectively aggregate the extracted coadjutant features in a mutual-enhancement way. Extensive experiments demonstrate that our method can significantly outperform the competitors. Our dataset will be available at <uri>https://openi.pcl.ac.cn/OpenDatasets</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Compared with current RGB or RGB-D saliency detection datasets, those for light field saliency detection often suffer from many defects, e.g., insufficient data amount and diversity, incomplete data formats, and rough annotations, thus impeding the prosperity of this field. To settle these issues, we elaborately build a large-scale light field dataset, dubbed PKU-LF, comprising 5,000 light fields and covering diverse indoor and outdoor scenes. Our PKU-LF provides all-inclusive representation formats of light fields and offers a unified platform for comparing algorithms utilizing different input formats. For sparking new vitality in saliency detection tasks, we present many unexplored scenarios (such as underwater and high-resolution scenes) and the richest annotations (such as scribble annotations, bounding boxes, object-/instance-level annotations, and edge annotations), on which many potential attention modeling tasks can be investigated. To facilitate the development of saliency detection, we systematically evaluate and analyze 16 representative 2D, 3D, and 4D methods on four existing datasets and the proposed dataset, furnishing a thorough benchmark. Furthermore, tailored to the distinct structural characteristics of light fields, a novel symmetric two-stream architecture (STSA) network is proposed to predict the saliency of light fields more accurately. Specifically, our STSA incorporates a focalness interweavement module (FIM) and three partial decoder modules (PDM). The former is designed to efficiently establish long-range dependencies across focal slices, while the latter aims to effectively aggregate the extracted coadjutant features in a mutual-enhancement way. Extensive experiments demonstrate that our method can significantly outperform the competitors. Our dataset will be available at https://openi.pcl.ac.cn/OpenDatasets.",
"title": "A Thorough Benchmark and a New Model for Light Field Saliency Detection",
"normalizedTitle": "A Thorough Benchmark and a New Model for Light Field Saliency Detection",
"fno": "10012539",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Light Fields",
"Annotations",
"Three Dimensional Displays",
"Saliency Detection",
"Feature Extraction",
"Task Analysis",
"Cameras",
"Light Field",
"Salient Object Detection",
"Benchmark",
"Focal Stack"
],
"authors": [
{
"givenName": "Wei",
"surname": "Gao",
"fullName": "Wei Gao",
"affiliation": "School of Electronic and Computer Engineering, Peking University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Songlin",
"surname": "Fan",
"fullName": "Songlin Fan",
"affiliation": "School of Electronic and Computer Engineering, Peking University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ge",
"surname": "Li",
"fullName": "Ge Li",
"affiliation": "School of Electronic and Computer Engineering, Peking University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weisi",
"surname": "Lin",
"fullName": "Weisi Lin",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2014/5118/0/5118c806",
"title": "Saliency Detection on Light Field",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c806/12OmNBPtJHx",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/08/07570181",
"title": "Saliency Detection on Light Field",
"doi": null,
"abstractUrl": "/journal/tp/2017/08/07570181/13rRUxC0SFi",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200e692",
"title": "Light Field Saliency Detection with Dual Local Graph Learning and Reciprocative Guidance",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200e692/1BmH76kFf1e",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600b746",
"title": "Learning from Pixel-Level Noisy Label : A New Perspective for Light Field Saliency Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600b746/1H1lOen6nh6",
"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/icme/2019/9552/0/955200b204",
"title": "A Feature-Based Approach for Light Field Video Enhancement",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2019/955200b204/1cdOTGJYTzW",
"parentPublication": {
"id": "proceedings/icme/2019/9552/0",
"title": "2019 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300i837",
"title": "Deep Learning for Light Field Saliency Detection",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300i837/1hQqx7hSwEg",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09043741",
"title": "4D Light Field Segmentation From Light Field Super-Pixel Hypergraph Representation",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09043741/1ilQLDcivHa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2020/1485/0/09106041",
"title": "A Benchmark of Light Field View Interpolation Methods",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2020/09106041/1kwqyUmJPIk",
"parentPublication": {
"id": "proceedings/icmew/2020/1485/0",
"title": "2020 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/08/09303417",
"title": "Learning Saliency From Single Noisy Labelling: A Robust Model Fitting Perspective",
"doi": null,
"abstractUrl": "/journal/tp/2021/08/09303417/1pLFs7cQRH2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2021/4989/0/09456017",
"title": "Multi-Generator Adversarial Networks For Light Field Saliency Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2021/09456017/1uCgr2PKIcE",
"parentPublication": {
"id": "proceedings/icmew/2021/4989/0",
"title": "2021 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10008078",
"articleId": "1JInFL6zA1a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10012548",
"articleId": "1JNmtfpSd6o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBcj5Ek",
"title": "Aug.",
"year": "2014",
"issueNum": "04",
"idPrefix": "nt",
"pubType": "journal",
"volume": "22",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJcWiL",
"doi": "10.1109/TNET.2013.2272080",
"abstract": "Modern stock trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can obtain fine-grain end-to-end loss and latency measurements between edge routers in these networks. Such a mechanism can allow managers to distinguish between latencies and loss singularities caused by servers and those caused by the network. Compared to prior work, such as Lossy Difference Aggregator (LDA), which focused on switch-level latency measurements, the requirement of end-to-end latency measurements introduces the challenge of reordering that occurs commonly in IP networks due to churn. The problem is even more acute in switches across data center networks that employ multipath routing algorithms to exploit the inherent path diversity. Without proper care, a loss estimation algorithm can confound loss and reordering; furthermore, any attempt to aggregate delay estimates in the presence of reordering results in severe errors. FineComb deals with these problems using order-agnostic packet digests and a simple new idea we call stash recovery. Our evaluation demonstrates that FineComb is orders of magnitude more accurate than LDA in loss and delay estimates in the presence of reordering.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Modern stock trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can obtain fine-grain end-to-end loss and latency measurements between edge routers in these networks. Such a mechanism can allow managers to distinguish between latencies and loss singularities caused by servers and those caused by the network. Compared to prior work, such as Lossy Difference Aggregator (LDA), which focused on switch-level latency measurements, the requirement of end-to-end latency measurements introduces the challenge of reordering that occurs commonly in IP networks due to churn. The problem is even more acute in switches across data center networks that employ multipath routing algorithms to exploit the inherent path diversity. Without proper care, a loss estimation algorithm can confound loss and reordering; furthermore, any attempt to aggregate delay estimates in the presence of reordering results in severe errors. FineComb deals with these problems using order-agnostic packet digests and a simple new idea we call stash recovery. Our evaluation demonstrates that FineComb is orders of magnitude more accurate than LDA in loss and delay estimates in the presence of reordering.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Modern stock trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can obtain fine-grain end-to-end loss and latency measurements between edge routers in these networks. Such a mechanism can allow managers to distinguish between latencies and loss singularities caused by servers and those caused by the network. Compared to prior work, such as Lossy Difference Aggregator (LDA), which focused on switch-level latency measurements, the requirement of end-to-end latency measurements introduces the challenge of reordering that occurs commonly in IP networks due to churn. The problem is even more acute in switches across data center networks that employ multipath routing algorithms to exploit the inherent path diversity. Without proper care, a loss estimation algorithm can confound loss and reordering; furthermore, any attempt to aggregate delay estimates in the presence of reordering results in severe errors. FineComb deals with these problems using order-agnostic packet digests and a simple new idea we call stash recovery. Our evaluation demonstrates that FineComb is orders of magnitude more accurate than LDA in loss and delay estimates in the presence of reordering.",
"title": "FineComb: Measuring Microscopic Latency and Loss in the Presence of Reordering",
"normalizedTitle": "FineComb: Measuring Microscopic Latency and Loss in the Presence of Reordering",
"fno": "06572888",
"hasPdf": true,
"idPrefix": "nt",
"keywords": [
"Computer Centres",
"IP Networks",
"Telecommunication Network Routing",
"Telecommunication Switching",
"Fine Comb",
"Microscopic Latency Measurement",
"Loss Measurement",
"Stock Trading",
"Microsecond Latency",
"Fine Grain End To End Loss",
"Edge Routers",
"Loss Singularities",
"Lossy Difference Aggregator",
"LDA",
"Switch Level Latency Measurements",
"End To End Latency Measurements",
"IP Networks",
"Data Center Networks",
"Multipath Routing Algorithms",
"Path Diversity",
"Loss Estimation Algorithm",
"Aggregate Delay Estimates",
"Order Agnostic Packet Digests",
"Stash Recovery",
"Reordering",
"Receivers",
"Loss Measurement",
"Delays",
"Radiation Detectors",
"Pollution Measurement",
"Synchronization",
"Servers",
"Algorithms",
"Latency",
"Packet Loss",
"Passive Measurement",
"Reordering"
],
"authors": [
{
"givenName": "Myungjin",
"surname": "Lee",
"fullName": "Myungjin Lee",
"affiliation": "School of Informatics, University of Edinburgh, Edinburgh, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sharon",
"surname": "Goldberg",
"fullName": "Sharon Goldberg",
"affiliation": "Department of Computer Science, Boston University, Boston",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ramana Rao",
"surname": "Kompella",
"fullName": "Ramana Rao Kompella",
"affiliation": "Department of Computer Science, Purdue University, West Lafayette",
"__typename": "ArticleAuthorType"
},
{
"givenName": "George",
"surname": "Varghese",
"fullName": "George Varghese",
"affiliation": "Department of Computer Science and Engineering, UCSD, La Jolla",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2014-07-01 00:00:00",
"pubType": "trans",
"pages": "1136-1149",
"year": "2014",
"issn": "1063-6692",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wimob/2014/5041/0/06962149",
"title": "Towards understanding interruption and reordering in HSPA/HSPA+ networks",
"doi": null,
"abstractUrl": "/proceedings-article/wimob/2014/06962149/12OmNBTawq4",
"parentPublication": {
"id": "proceedings/wimob/2014/5041/0",
"title": "2014 IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2017/3914/0/07967122",
"title": "Bounded Reordering Allows Efficient Reliable Message Transmission",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2017/07967122/12OmNCgJe7v",
"parentPublication": {
"id": "proceedings/ipdps/2017/3914/0",
"title": "2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnp/2014/6204/0/6204a095",
"title": "Every Packet Counts: Fine-Grained Delay and Loss Measurement with Reordering",
"doi": null,
"abstractUrl": "/proceedings-article/icnp/2014/6204a095/12OmNvqmUJa",
"parentPublication": {
"id": "proceedings/icnp/2014/6204/0",
"title": "2014 IEEE 22nd International Conference on Network Protocols (ICNP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2009/4672/0/05202300",
"title": "Time-varying network internal loss inference based on unicast end-to-end measurements",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2009/05202300/12OmNwGZNEu",
"parentPublication": {
"id": "proceedings/iscc/2009/4672/0",
"title": "2009 IEEE Symposium on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infcom/2001/7016/2/00916283",
"title": "Inferring link loss using striped unicast probes",
"doi": null,
"abstractUrl": "/proceedings-article/infcom/2001/00916283/12OmNyfdOS9",
"parentPublication": {
"id": "proceedings/infcom/2001/7016/2",
"title": "Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2008/02/04456413",
"title": "A geometric approach to improving active packet loss measurement",
"doi": null,
"abstractUrl": "/journal/nt/2008/02/04456413/13rRUILtJwh",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2006/04/01677592",
"title": "Network loss tomography using striped unicast probes",
"doi": null,
"abstractUrl": "/journal/nt/2006/04/01677592/13rRUNvyahA",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2016/03/07113922",
"title": "Efficient and consistent path loss model for mobile network simulation",
"doi": null,
"abstractUrl": "/journal/nt/2016/03/07113922/13rRUxbCbqM",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2012/03/06174430",
"title": "Router support for fine-grained latency measurements",
"doi": null,
"abstractUrl": "/journal/nt/2012/03/06174430/13rRUy3gn4w",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2020/01/08960440",
"title": "Robust Loss Inference in the Presence of Noisy Measurements and Hidden Fault Diagnosis",
"doi": null,
"abstractUrl": "/journal/nt/2020/01/08960440/1gC2fAcNZ6w",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "06565417",
"articleId": "13rRUxNEqSE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06568976",
"articleId": "13rRUwdrdN4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBhpS2B",
"title": "April",
"year": "2014",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxC0SvW",
"doi": "10.1109/TVCG.2014.30",
"abstract": "Latency of interactive computer systems is a product of the processing, transport and synchronisation delays inherent to the components that create them. In a virtual environment (VE) system, latency is known to be detrimental to a user's sense of immersion, physical performance and comfort level. Accurately measuring the latency of a VE system for study or optimisation, is not straightforward. A number of authors have developed techniques for characterising latency, which have become progressively more accessible and easier to use. In this paper, we characterise these techniques. We describe a simple mechanical simulator designed to simulate a VE with various amounts of latency that can be finely controlled (to within 3ms). We develop a new latency measurement technique called Automated Frame Counting to assist in assessing latency using high speed video (to within 1ms). We use the mechanical simulator to measure the accuracy of Steed's and Di Luca's measurement techniques, proposing improvements where they may be made. We use the methods to measure latency of a number of interactive systems that may be of interest to the VE engineer, with a significant level of confidence. All techniques were found to be highly capable however Steed's Method is both accurate and easy to use without requiring specialised hardware.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Latency of interactive computer systems is a product of the processing, transport and synchronisation delays inherent to the components that create them. In a virtual environment (VE) system, latency is known to be detrimental to a user's sense of immersion, physical performance and comfort level. Accurately measuring the latency of a VE system for study or optimisation, is not straightforward. A number of authors have developed techniques for characterising latency, which have become progressively more accessible and easier to use. In this paper, we characterise these techniques. We describe a simple mechanical simulator designed to simulate a VE with various amounts of latency that can be finely controlled (to within 3ms). We develop a new latency measurement technique called Automated Frame Counting to assist in assessing latency using high speed video (to within 1ms). We use the mechanical simulator to measure the accuracy of Steed's and Di Luca's measurement techniques, proposing improvements where they may be made. We use the methods to measure latency of a number of interactive systems that may be of interest to the VE engineer, with a significant level of confidence. All techniques were found to be highly capable however Steed's Method is both accurate and easy to use without requiring specialised hardware.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Latency of interactive computer systems is a product of the processing, transport and synchronisation delays inherent to the components that create them. In a virtual environment (VE) system, latency is known to be detrimental to a user's sense of immersion, physical performance and comfort level. Accurately measuring the latency of a VE system for study or optimisation, is not straightforward. A number of authors have developed techniques for characterising latency, which have become progressively more accessible and easier to use. In this paper, we characterise these techniques. We describe a simple mechanical simulator designed to simulate a VE with various amounts of latency that can be finely controlled (to within 3ms). We develop a new latency measurement technique called Automated Frame Counting to assist in assessing latency using high speed video (to within 1ms). We use the mechanical simulator to measure the accuracy of Steed's and Di Luca's measurement techniques, proposing improvements where they may be made. We use the methods to measure latency of a number of interactive systems that may be of interest to the VE engineer, with a significant level of confidence. All techniques were found to be highly capable however Steed's Method is both accurate and easy to use without requiring specialised hardware.",
"title": "Measuring Latency in Virtual Environments",
"normalizedTitle": "Measuring Latency in Virtual Environments",
"fno": "ttg201404616",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Feature Extraction",
"Cameras",
"Estimation",
"Measurement Techniques",
"Target Tracking",
"Delays",
"Latency Measurement"
],
"authors": [
{
"givenName": "Sebastian",
"surname": "Friston",
"fullName": "Sebastian Friston",
"affiliation": "Univ. Coll. London, London, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anthony",
"surname": "Steed",
"fullName": "Anthony Steed",
"affiliation": "Univ. Coll. London, London, UK",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2014-04-01 00:00:00",
"pubType": "trans",
"pages": "616-625",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2003/1882/0/18820141",
"title": "Effect of Latency on Presence in Stressful Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2003/18820141/12OmNAFnCwJ",
"parentPublication": {
"id": "proceedings/vr/2003/1882/0",
"title": "Proceedings IEEE Virtual Reality 2003",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2009/3965/0/04811214",
"title": "Egocentric navigation for video surveillance in 3D Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2009/04811214/12OmNBfZSln",
"parentPublication": {
"id": "proceedings/3dui/2009/3965/0",
"title": "2009 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dcve/2014/5217/0/07160931",
"title": "Measuring the collaboration degree in immersive 3D collaborative virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/3dcve/2014/07160931/12OmNvjQ8QS",
"parentPublication": {
"id": "proceedings/3dcve/2014/5217/0",
"title": "2014 International Workshop on Collaborative Virtual Environments (3DCVE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/1999/0093/0/00930190",
"title": "A Framework for Interactors in Immersive Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/1999/00930190/12OmNwwuDSe",
"parentPublication": {
"id": "proceedings/vr/1999/0093/0",
"title": "Proceedings of Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892262",
"title": "Motor adaptation in response to scaling and diminished feedback in virtual reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892262/12OmNzlD98A",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/04/07383304",
"title": "From Motion to Photons in 80 Microseconds: Towards Minimal Latency for Virtual and Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07383304/13rRUxAATgz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798361",
"title": "Latency Measurement in Head-Mounted Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798361/1cJ1gZOI9Gg",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09035608",
"title": "A Simple Video-Based Technique for Measuring Latency in Virtual Reality or Teleoperation",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09035608/1iaeyXM32ow",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089584",
"title": "Measuring System Visual Latency through Cognitive Latency on Video See-Through AR devices",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089584/1jIx99YL1cI",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090674",
"title": "Guided Sine Fitting for Latency Estimation in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090674/1jIxz0q4g00",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg201404606",
"articleId": "13rRUwghd99",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg201404626",
"articleId": "13rRUxASubA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNC3XhgJ",
"title": "Oct.",
"year": "2018",
"issueNum": "10",
"idPrefix": "td",
"pubType": "journal",
"volume": "29",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13xI8GkqDGa",
"doi": "10.1109/TPDS.2018.2827075",
"abstract": "Large-scale online services parallelize sub-operations of a user’s request across a large number of physical machines (service components) so as to enhance the responsiveness. Even a temporary spike in latency of any service component can notably inflate the end-to-end delay; therefore, the tail of the latency distribution of service components has become a subject of intensive research. The key characteristics of clouds such as elasticity and on-demand resource provisioning have made clouds attractive for hosting large-scale online services wherein VMs are the building blocks of services. However, adherence to traditional hypervisor scheduling policies has led to unpredictable CPU access latencies for virtual CPUs (vCPUs) that are responsible for performing network IO processes. This has resulted in poor and unpredictable performance for network IO, exacerbating VMs’ long tail latencies and discouraging the hosting of large-scale parallel web services on virtualized clouds. This paper presents TerrierTail, a hypervisor CPU scheduler whose primary goal is to trim the tail of the latency distribution of individual VMs in virtualized clouds. In TerrierTail, we have modified the network driver to identify vCPUs that are responsible for performing network IO processes. Leveraging this information, the TerrierTail scheduler mitigates the CPU access latencies of such vCPUs using novel scheduling policies, resulting in a higher and more predictable network IO performance and therefore lower tail latency. TerrierTail’s gains come at no measurable negative impacts on other performance attributes (e.g., fairness) or on the performance of VMs running other types of workloads (e.g., CPU-intensive VMs). A prototype implementation of TerrierTail in the Xen hypervisor substantially outperforms the default Credit scheduler of Xen. For example, TerrierTail mitigates the tail latency of a Memcached server by up to 53 percent and an RPC server by up to 50 percent at 99.9th percentile.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Large-scale online services parallelize sub-operations of a user’s request across a large number of physical machines (service components) so as to enhance the responsiveness. Even a temporary spike in latency of any service component can notably inflate the end-to-end delay; therefore, the tail of the latency distribution of service components has become a subject of intensive research. The key characteristics of clouds such as elasticity and on-demand resource provisioning have made clouds attractive for hosting large-scale online services wherein VMs are the building blocks of services. However, adherence to traditional hypervisor scheduling policies has led to unpredictable CPU access latencies for virtual CPUs (vCPUs) that are responsible for performing network IO processes. This has resulted in poor and unpredictable performance for network IO, exacerbating VMs’ long tail latencies and discouraging the hosting of large-scale parallel web services on virtualized clouds. This paper presents TerrierTail, a hypervisor CPU scheduler whose primary goal is to trim the tail of the latency distribution of individual VMs in virtualized clouds. In TerrierTail, we have modified the network driver to identify vCPUs that are responsible for performing network IO processes. Leveraging this information, the TerrierTail scheduler mitigates the CPU access latencies of such vCPUs using novel scheduling policies, resulting in a higher and more predictable network IO performance and therefore lower tail latency. TerrierTail’s gains come at no measurable negative impacts on other performance attributes (e.g., fairness) or on the performance of VMs running other types of workloads (e.g., CPU-intensive VMs). A prototype implementation of TerrierTail in the Xen hypervisor substantially outperforms the default Credit scheduler of Xen. For example, TerrierTail mitigates the tail latency of a Memcached server by up to 53 percent and an RPC server by up to 50 percent at 99.9th percentile.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Large-scale online services parallelize sub-operations of a user’s request across a large number of physical machines (service components) so as to enhance the responsiveness. Even a temporary spike in latency of any service component can notably inflate the end-to-end delay; therefore, the tail of the latency distribution of service components has become a subject of intensive research. The key characteristics of clouds such as elasticity and on-demand resource provisioning have made clouds attractive for hosting large-scale online services wherein VMs are the building blocks of services. However, adherence to traditional hypervisor scheduling policies has led to unpredictable CPU access latencies for virtual CPUs (vCPUs) that are responsible for performing network IO processes. This has resulted in poor and unpredictable performance for network IO, exacerbating VMs’ long tail latencies and discouraging the hosting of large-scale parallel web services on virtualized clouds. This paper presents TerrierTail, a hypervisor CPU scheduler whose primary goal is to trim the tail of the latency distribution of individual VMs in virtualized clouds. In TerrierTail, we have modified the network driver to identify vCPUs that are responsible for performing network IO processes. Leveraging this information, the TerrierTail scheduler mitigates the CPU access latencies of such vCPUs using novel scheduling policies, resulting in a higher and more predictable network IO performance and therefore lower tail latency. TerrierTail’s gains come at no measurable negative impacts on other performance attributes (e.g., fairness) or on the performance of VMs running other types of workloads (e.g., CPU-intensive VMs). A prototype implementation of TerrierTail in the Xen hypervisor substantially outperforms the default Credit scheduler of Xen. For example, TerrierTail mitigates the tail latency of a Memcached server by up to 53 percent and an RPC server by up to 50 percent at 99.9th percentile.",
"title": "TerrierTail: Mitigating Tail Latency of Cloud Virtual Machines",
"normalizedTitle": "TerrierTail: Mitigating Tail Latency of Cloud Virtual Machines",
"fno": "08338088",
"hasPdf": true,
"idPrefix": "td",
"keywords": [
"Cloud Computing",
"Boosting",
"Virtual Machine Monitors",
"Servers",
"Task Analysis",
"Delays",
"Cloud Computing",
"Tail Latency",
"Virtualization",
"CPU Scheduler",
"Xen"
],
"authors": [
{
"givenName": "Esmail",
"surname": "Asyabi",
"fullName": "Esmail Asyabi",
"affiliation": "Computer Science Department, Boston University, Boston, MA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "SeyedAlireza",
"surname": "SanaeeKohroudi",
"fullName": "SeyedAlireza SanaeeKohroudi",
"affiliation": "School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mohsen",
"surname": "Sharifi",
"fullName": "Mohsen Sharifi",
"affiliation": "School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Azer",
"surname": "Bestavros",
"fullName": "Azer Bestavros",
"affiliation": "Computer Science Department, Boston University, Boston, MA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "10",
"pubDate": "2018-10-01 00:00:00",
"pubType": "trans",
"pages": "2346-2359",
"year": "2018",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iciev/2014/5179/0/06850734",
"title": "Virtual Memory Streaming Technique for virtual machines (VMs) for rapid scaling and high performance in cloud environment",
"doi": null,
"abstractUrl": "/proceedings-article/iciev/2014/06850734/12OmNxYbSVJ",
"parentPublication": {
"id": "proceedings/iciev/2014/5179/0",
"title": "2014 International Conference on Informatics, Electronics & Vision (ICIEV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2015/10/07005439",
"title": "H-SVM: Hardware-Assisted Secure Virtual Machines under a Vulnerable Hypervisor",
"doi": null,
"abstractUrl": "/journal/tc/2015/10/07005439/13rRUILtJlj",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2016/11/07425234",
"title": "Offloading Interrupt Load Balancing from SMP Virtual Machines to the Hypervisor",
"doi": null,
"abstractUrl": "/journal/td/2016/11/07425234/13rRUwbs1Sj",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2015/07/06860294",
"title": "Reference Pattern-Aware Instant Memory Balancing for Consolidated Virtual Machineson Manycores",
"doi": null,
"abstractUrl": "/journal/td/2015/07/06860294/13rRUwcAqpY",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2016/04/mmi2016040028",
"title": "Supporting NUMA-Aware I/O in Virtual Machines",
"doi": null,
"abstractUrl": "/magazine/mi/2016/04/mmi2016040028/13rRUxASumH",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2014/05/msp2014050082",
"title": "Building Reliable and Secure Virtual Machines Using Architectural Invariants",
"doi": null,
"abstractUrl": "/magazine/sp/2014/05/msp2014050082/13rRUygT7la",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2016/04/07172563",
"title": "Revisiting TCP Congestion Control in a Virtual Cluster Environment",
"doi": null,
"abstractUrl": "/journal/nt/2016/04/07172563/13rRUytF46K",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2013/07/ttd2013071267",
"title": "A Fast RPC System for Virtual Machines",
"doi": null,
"abstractUrl": "/journal/td/2013/07/ttd2013071267/13rRUyuNsFc",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mascots/2018/6886/0/688600a369",
"title": "Overcoming Virtualization Overheads for Large-vCPU Virtual Machines",
"doi": null,
"abstractUrl": "/proceedings-article/mascots/2018/688600a369/17D45WrVgbi",
"parentPublication": {
"id": "proceedings/mascots/2018/6886/0",
"title": "2018 IEEE 26th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2018/8319/0/831900a162",
"title": "Reducing Tail Latency of Interactive Multi-tier Workloads in the Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a162/17D45X0yjSB",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08345689",
"articleId": "13xI8A6oaMs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08330047",
"articleId": "13xI8B5Z81o",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxUv6hJ",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "nt",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1MgkBc0xvIA",
"doi": "10.1109/TNET.2023.3264009",
"abstract": "As numerous latency-sensitive applications have emerged with the popularization of 5G networking, accurate and rapid end-to-end latency measurement has come to play an essential role in network fault diagnosis and optimization. Although the Bloom hash-based timestamp aggregation method has been reported to be scalable and efficient, two shortcomings that reduce its accuracy have yet to be fully considered: frequent hash collisions and its fixed measurement interval. To address these challenges, we construct an end-to-end network latency measurement framework named Cuckoo Hash Adjustive Table exchange (CHAT). By employing an improved cuckoo filter, we decrease the number of hash collisions to assess the latency more accurately. Moreover, CHAT adjusts the receiver-side measurement interval dynamically based on a gain indicator, maximizing the total number of valid packets used for latency estimation. Additionally, the proposed measurement framework minimizes the number of packets transferred over links to avoid interfering with the end-to-end latency measurement in an actual network. Finally, extensive experiments on simulations and a practical real-world environment show the effectiveness and applicability of CHAT.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As numerous latency-sensitive applications have emerged with the popularization of 5G networking, accurate and rapid end-to-end latency measurement has come to play an essential role in network fault diagnosis and optimization. Although the Bloom hash-based timestamp aggregation method has been reported to be scalable and efficient, two shortcomings that reduce its accuracy have yet to be fully considered: frequent hash collisions and its fixed measurement interval. To address these challenges, we construct an end-to-end network latency measurement framework named Cuckoo Hash Adjustive Table exchange (CHAT). By employing an improved cuckoo filter, we decrease the number of hash collisions to assess the latency more accurately. Moreover, CHAT adjusts the receiver-side measurement interval dynamically based on a gain indicator, maximizing the total number of valid packets used for latency estimation. Additionally, the proposed measurement framework minimizes the number of packets transferred over links to avoid interfering with the end-to-end latency measurement in an actual network. Finally, extensive experiments on simulations and a practical real-world environment show the effectiveness and applicability of CHAT.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As numerous latency-sensitive applications have emerged with the popularization of 5G networking, accurate and rapid end-to-end latency measurement has come to play an essential role in network fault diagnosis and optimization. Although the Bloom hash-based timestamp aggregation method has been reported to be scalable and efficient, two shortcomings that reduce its accuracy have yet to be fully considered: frequent hash collisions and its fixed measurement interval. To address these challenges, we construct an end-to-end network latency measurement framework named Cuckoo Hash Adjustive Table exchange (CHAT). By employing an improved cuckoo filter, we decrease the number of hash collisions to assess the latency more accurately. Moreover, CHAT adjusts the receiver-side measurement interval dynamically based on a gain indicator, maximizing the total number of valid packets used for latency estimation. Additionally, the proposed measurement framework minimizes the number of packets transferred over links to avoid interfering with the end-to-end latency measurement in an actual network. Finally, extensive experiments on simulations and a practical real-world environment show the effectiveness and applicability of CHAT.",
"title": "CHAT: Accurate Network Latency Measurement for 5G E2E Networks",
"normalizedTitle": "CHAT: Accurate Network Latency Measurement for 5G E2E Networks",
"fno": "10098826",
"hasPdf": true,
"idPrefix": "nt",
"keywords": [
"Delays",
"5 G Mobile Communication",
"Proposals",
"Synchronization",
"Receivers",
"Packet Loss",
"Optimization",
"5 G",
"Cuckoo Filter",
"Lost And Reordered Packets",
"Latency"
],
"authors": [
{
"givenName": "Zhibo",
"surname": "Zhang",
"fullName": "Zhibo Zhang",
"affiliation": "College of Computer Science and Technology, Harbin Engineering University (HEU), Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huiqiang",
"surname": "Wang",
"fullName": "Huiqiang Wang",
"affiliation": "College of Computer Science and Technology, Harbin Engineering University (HEU), Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongwu",
"surname": "Lv",
"fullName": "Hongwu Lv",
"affiliation": "College of Computer Science and Technology, Harbin Engineering University (HEU), Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiayu",
"surname": "Sun",
"fullName": "Jiayu Sun",
"affiliation": "College of Computer Science and Technology, Harbin Engineering University (HEU), Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guodong",
"surname": "Li",
"fullName": "Guodong Li",
"affiliation": "College of Computer Science and Technology, Harbin Engineering University (HEU), Harbin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Han",
"fullName": "Xin Han",
"affiliation": "College of Computer Science and Technology, Harbin Engineering University (HEU), Harbin, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-04-01 00:00:00",
"pubType": "trans",
"pages": "1-16",
"year": "5555",
"issn": "1063-6692",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cloudnet/2016/5093/0/07776574",
"title": "Improving Multipath TCP for Latency Sensitive Flows in the Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/cloudnet/2016/07776574/12OmNBKW9Hx",
"parentPublication": {
"id": "proceedings/cloudnet/2016/5093/0",
"title": "2016 5th IEEE International Conference on Cloud Networking (Cloudnet)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lcn/2015/6770/0/07366322",
"title": "Latency and fairness trade-off for thin streams using redundant data bundling in TCP",
"doi": null,
"abstractUrl": "/proceedings-article/lcn/2015/07366322/12OmNvqEvJR",
"parentPublication": {
"id": "proceedings/lcn/2015/6770/0",
"title": "2015 IEEE 40th Conference on Local Computer Networks (LCN 2015)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wimob/2017/3839/0/08115776",
"title": "TCP performance over 5G mmWave links — Tradeoff between capacity and latency",
"doi": null,
"abstractUrl": "/proceedings-article/wimob/2017/08115776/12OmNyvGygu",
"parentPublication": {
"id": "proceedings/wimob/2017/3839/0",
"title": "2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pac/2017/1027/0/1027a141",
"title": "LiLAC: Lightweight Low-Latency Anonymous Chat",
"doi": null,
"abstractUrl": "/proceedings-article/pac/2017/1027a141/12OmNzd7btA",
"parentPublication": {
"id": "proceedings/pac/2017/1027/0",
"title": "2017 IEEE Symposium on Privacy-Aware Computing (PAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2012/03/06174430",
"title": "Router support for fine-grained latency measurements",
"doi": null,
"abstractUrl": "/journal/nt/2012/03/06174430/13rRUy3gn4w",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2018/6950/0/08538463",
"title": "Tail Latency Optimized Resource Allocation in Fogbased 5G Networks",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2018/08538463/17D45Xbl4NG",
"parentPublication": {
"id": "proceedings/iscc/2018/6950/0",
"title": "2018 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2022/9792/0/09912811",
"title": "Precise Latency Guarantee with Mobility and Handover in 5G and Beyond",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2022/09912811/1HBKkKKICQg",
"parentPublication": {
"id": "proceedings/iscc/2022/9792/0",
"title": "2022 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2019/2999/0/08969634",
"title": "A Dynamic Replication Scheme of User Plane Data over Lossy Backhaul Links",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2019/08969634/1h0K0xINcQw",
"parentPublication": {
"id": "proceedings/iscc/2019/2999/0",
"title": "2019 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cnsm/2019/24/0/09012665",
"title": "Accurate Loss Estimation Technique Utilizing Parallel Flow Monitoring",
"doi": null,
"abstractUrl": "/proceedings-article/cnsm/2019/09012665/1hQr2qbzAl2",
"parentPublication": {
"id": "proceedings/cnsm/2019/24/0",
"title": "2019 15th International Conference on Network and Service Management (CNSM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/12/09108562",
"title": "DEFT: Multipath TCP for High Speed Low Latency Communications in 5G Networks",
"doi": null,
"abstractUrl": "/journal/tm/2021/12/09108562/1koLanrhXnW",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10097529",
"articleId": "1M9lyjNvJ2o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10100699",
"articleId": "1MhE3LTYQUM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1vBCZCRz6xO",
"title": "July-Aug.",
"year": "2021",
"issueNum": "04",
"idPrefix": "cs",
"pubType": "magazine",
"volume": "23",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1vBD2PGIVlC",
"doi": "10.1109/MCSE.2021.3078345",
"abstract": "We reported initial work towards a new fast and scalable scientific visualization technology that leverages the Vulkan API to achieve unprecedented performance through GPUs. This technology is implemented in a C/C++ library called Datoviz that offers an intermediate-level API for scientific visualization libraries and software. Datoviz provides a unified graphics stack for 2-D, 3-D, graphical user interfaces, and natively supports efficient interactions between rendering and general-purpose GPU computing. A major direction of development is to investigate the integration of Datoviz as a low-level backend of a future version of VisPy, a popular Python scientific plotting library",
"abstracts": [
{
"abstractType": "Regular",
"content": "We reported initial work towards a new fast and scalable scientific visualization technology that leverages the Vulkan API to achieve unprecedented performance through GPUs. This technology is implemented in a C/C++ library called Datoviz that offers an intermediate-level API for scientific visualization libraries and software. Datoviz provides a unified graphics stack for 2-D, 3-D, graphical user interfaces, and natively supports efficient interactions between rendering and general-purpose GPU computing. A major direction of development is to investigate the integration of Datoviz as a low-level backend of a future version of VisPy, a popular Python scientific plotting library",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We reported initial work towards a new fast and scalable scientific visualization technology that leverages the Vulkan API to achieve unprecedented performance through GPUs. This technology is implemented in a C/C++ library called Datoviz that offers an intermediate-level API for scientific visualization libraries and software. Datoviz provides a unified graphics stack for 2-D, 3-D, graphical user interfaces, and natively supports efficient interactions between rendering and general-purpose GPU computing. A major direction of development is to investigate the integration of Datoviz as a low-level backend of a future version of VisPy, a popular Python scientific plotting library",
"title": "High-Performance Interactive Scientific Visualization With Datoviz via the Vulkan Low-Level GPU API",
"normalizedTitle": "High-Performance Interactive Scientific Visualization With Datoviz via the Vulkan Low-Level GPU API",
"fno": "09500108",
"hasPdf": true,
"idPrefix": "cs",
"keywords": [
"Application Program Interfaces",
"C Language",
"Data Visualisation",
"Graphical User Interfaces",
"Graphics Processing Units",
"Interactive Systems",
"Libraries",
"Natural Sciences Computing",
"Python",
"Rendering Computer Graphics",
"High Performance Interactive Scientific Visualization",
"Datoviz",
"Vulkan Low Level GPU API",
"C Library",
"Two Dimensional Graphical User Interfaces",
"Three Dimensional Graphical User Interfaces",
"Rendering",
"General Purpose GPU Computing",
"Vis Py",
"Python Scientific Plotting Library",
"Visualization",
"Graphics Processing Units",
"Rendering Computer Graphics",
"High Performance Computing",
"Software Engineering",
"Python",
"Graphical User Interfaces"
],
"authors": [
{
"givenName": "Cyrille",
"surname": "Rossant",
"fullName": "Cyrille Rossant",
"affiliation": "International Brain Laboratory, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nicolas P.",
"surname": "Rougier",
"fullName": "Nicolas P. Rougier",
"affiliation": "Inria Bordeaux Sud-Ouest, Talence, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2021-07-01 00:00:00",
"pubType": "mags",
"pages": "85-90",
"year": "2021",
"issn": "1521-9615",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1992/2897/0/00235204",
"title": "A scientific visualization renderer",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1992/00235204/12OmNAkWvbq",
"parentPublication": {
"id": "proceedings/visual/1992/2897/0",
"title": "Proceedings Visualization '92",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1991/2245/0/00175811",
"title": "A scientific visualization synthesizer",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1991/00175811/12OmNqGA538",
"parentPublication": {
"id": "proceedings/visual/1991/2245/0",
"title": "1991 Proceeding Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fmpc/1992/2772/0/00234874",
"title": "Scientific visualization theatre",
"doi": null,
"abstractUrl": "/proceedings-article/fmpc/1992/00234874/12OmNqHItD0",
"parentPublication": {
"id": "proceedings/fmpc/1992/2772/0",
"title": "The Fourth Symposium on the Frontiers of Massively Parallel Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2017/3408/0/3408b216",
"title": "An application-aware data replacement policy for interactive large-scale scientific visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2017/3408b216/12OmNy49sFq",
"parentPublication": {
"id": "proceedings/ipdpsw/2017/3408/0",
"title": "2017 IEEE International Parallel and Distributed Processing Symposium: Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2015/7673/0/7673a260",
"title": "Linking Visualization and Scientific Understanding through Interactive Rendering of Large-Scale Data in Parallel Environment",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2015/7673a260/12OmNyRPgJQ",
"parentPublication": {
"id": "proceedings/icvrv/2015/7673/0",
"title": "2015 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2011/02/mcs2011020040",
"title": "Mayavi: 3D Visualization of Scientific Data",
"doi": null,
"abstractUrl": "/magazine/cs/2011/02/mcs2011020040/13rRUwInv8p",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539599",
"title": "OSPRay - A CPU Ray Tracing Framework for Scientific Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539599/13rRUyfKIHS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/01/08663650",
"title": "Cross-Platform Ubiquitous Volume Rendering Using Programmable Shaders in VTK for Scientific and Medical Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2019/01/08663650/18exxweFx0A",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09079657",
"title": "Distributed Interactive Visualization Using GPU-Optimized Spark",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09079657/1jmVbp8XqZa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2020/8468/0/846800a027",
"title": "Interactive Visualization of Terascale Data in the Browser: Fact or Fiction?",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2020/846800a027/1pZ0TITco5q",
"parentPublication": {
"id": "proceedings/ldav/2020/8468/0",
"title": "2020 IEEE 10th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09500109",
"articleId": "1vBD1rerP3i",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09500092",
"articleId": "1vBD25Kgf4c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzBOhW9",
"title": "Dec.",
"year": "2017",
"issueNum": "12",
"idPrefix": "tk",
"pubType": "journal",
"volume": "29",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxly8Ty",
"doi": "10.1109/TKDE.2017.2749574",
"abstract": "Semi-supervised learning (SSL) concerns the problem of how to improve classifiers’ performance through making use of prior knowledge from unlabeled data. Many SSL methods have been developed to integrate unlabeled data into the classifiers based on either the manifold or cluster assumption in recent years. In particular, the graph-based approaches, following the manifold assumption, have achieved a promising performance in many real-world applications. However, most of them work well on small-scale data sets only and lack probabilistic outputs. In this paper, a scalable graph-based SSL framework through sparse Bayesian model is proposed by defining a graph-based sparse prior. Based on the traditional Bayesian inference technique, a sparse Bayesian SSL algorithm (SBS Z_$^2$_Z L) is obtained, which can remove the irrelevant unlabeled samples and make probabilistic prediction for out-of-sample data. Moreover, in order to scale SBS Z_$^2$_Z L to large-scale data sets, an incremental SBS Z_$^2$_Z L (ISBSZ_$^2$_Z L) is derived. The key idea of ISBS Z_$^2$_Z L is employing an incremental strategy and sequentially selecting parts of unlabeled samples that contribute to the learning instead of using all available unlabeled samples directly. ISBSZ_$^2$_Z L has lower time and space complexities than previous SSL algorithms with the use of all unlabeled samples. Extensive experiments on various data sets verify that our algorithms can achieve comparable classification effectiveness and efficiency with much better scalability. Finally, the generalization error bound is derived based on robustness analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Semi-supervised learning (SSL) concerns the problem of how to improve classifiers’ performance through making use of prior knowledge from unlabeled data. Many SSL methods have been developed to integrate unlabeled data into the classifiers based on either the manifold or cluster assumption in recent years. In particular, the graph-based approaches, following the manifold assumption, have achieved a promising performance in many real-world applications. However, most of them work well on small-scale data sets only and lack probabilistic outputs. In this paper, a scalable graph-based SSL framework through sparse Bayesian model is proposed by defining a graph-based sparse prior. Based on the traditional Bayesian inference technique, a sparse Bayesian SSL algorithm (SBS $^2$ L) is obtained, which can remove the irrelevant unlabeled samples and make probabilistic prediction for out-of-sample data. Moreover, in order to scale SBS $^2$ L to large-scale data sets, an incremental SBS $^2$ L (ISBS$^2$ L) is derived. The key idea of ISBS $^2$ L is employing an incremental strategy and sequentially selecting parts of unlabeled samples that contribute to the learning instead of using all available unlabeled samples directly. ISBS$^2$ L has lower time and space complexities than previous SSL algorithms with the use of all unlabeled samples. Extensive experiments on various data sets verify that our algorithms can achieve comparable classification effectiveness and efficiency with much better scalability. Finally, the generalization error bound is derived based on robustness analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Semi-supervised learning (SSL) concerns the problem of how to improve classifiers’ performance through making use of prior knowledge from unlabeled data. Many SSL methods have been developed to integrate unlabeled data into the classifiers based on either the manifold or cluster assumption in recent years. In particular, the graph-based approaches, following the manifold assumption, have achieved a promising performance in many real-world applications. However, most of them work well on small-scale data sets only and lack probabilistic outputs. In this paper, a scalable graph-based SSL framework through sparse Bayesian model is proposed by defining a graph-based sparse prior. Based on the traditional Bayesian inference technique, a sparse Bayesian SSL algorithm (SBS - L) is obtained, which can remove the irrelevant unlabeled samples and make probabilistic prediction for out-of-sample data. Moreover, in order to scale SBS - L to large-scale data sets, an incremental SBS - L (ISBS- L) is derived. The key idea of ISBS - L is employing an incremental strategy and sequentially selecting parts of unlabeled samples that contribute to the learning instead of using all available unlabeled samples directly. ISBS- L has lower time and space complexities than previous SSL algorithms with the use of all unlabeled samples. Extensive experiments on various data sets verify that our algorithms can achieve comparable classification effectiveness and efficiency with much better scalability. Finally, the generalization error bound is derived based on robustness analysis.",
"title": "Scalable Graph-Based Semi-Supervised Learning through Sparse Bayesian Model",
"normalizedTitle": "Scalable Graph-Based Semi-Supervised Learning through Sparse Bayesian Model",
"fno": "08027086",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Manifolds",
"Bayes Methods",
"Prediction Algorithms",
"Training",
"Algorithm Design And Analysis",
"Data Models",
"Semisupervised Learning",
"Semi Supervised Learning",
"Graph Based Methods",
"Sparse Bayesian Model",
"Incremental Learning",
"Large Scale Data Sets"
],
"authors": [
{
"givenName": "Bingbing",
"surname": "Jiang",
"fullName": "Bingbing Jiang",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China (USTC), Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huanhuan",
"surname": "Chen",
"fullName": "Huanhuan Chen",
"affiliation": "School of Computer Science and Technology, University of Science and Technology of China (USTC), Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bo",
"surname": "Yuan",
"fullName": "Bo Yuan",
"affiliation": "Department of Computer Science and Engineering, Shenzhen Key Laboratory of Computational Intelligence, Southern University of Science and Technology (SUSTech), Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xin",
"surname": "Yao",
"fullName": "Xin Yao",
"affiliation": "Department of Computer Science and Engineering, Shenzhen Key Laboratory of Computational Intelligence, Southern University of Science and Technology (SUSTech), Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2017-12-01 00:00:00",
"pubType": "trans",
"pages": "2758-2771",
"year": "2017",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2018/3788/0/08545510",
"title": "Scalable Semi-Supervised Learning by Graph Construction with Approximate Anchors Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545510/17D45XeKgqD",
"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/281200c876",
"title": "Semi-supervised Active Learning for Semi-supervised Models: Exploit Adversarial Examples with Graph-based Virtual Labels",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c876/1BmGmwDmCSk",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900d998",
"title": "AuxMix: Semi-Supervised Learning with Unconstrained Unlabeled Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900d998/1G574655uQ8",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859941",
"title": "Unlabeled Backdoor Poisoning in Semi-Supervised Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859941/1G9DMj5pUD6",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600o4565",
"title": "Safe-Student for Safe Deep Semi-Supervised Learning with Unseen-Class Unlabeled Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600o4565/1H1hVAhQl44",
"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/694600j747",
"title": "DC-SSL: Addressing Mismatched Class Distribution in Semi-supervised Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600j747/1H1ikPQIF7G",
"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/icpr/2022/9062/0/09956182",
"title": "DoubleMatch: Improving Semi-Supervised Learning with Self-Supervision",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956182/1IHoHEhtGCY",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2022/5099/0/509900a763",
"title": "How Out-of-Distribution Data Hurts Semi-Supervised Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2022/509900a763/1KpCK9urjhK",
"parentPublication": {
"id": "proceedings/icdm/2022/5099/0",
"title": "2022 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2019/4896/0/489600a653",
"title": "Capped l_2,1-Norm Regularized Dictionary Coding for Scalable Semi-Supervised Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2019/489600a653/1gAwVtczLZS",
"parentPublication": {
"id": "proceedings/icdmw/2019/4896/0",
"title": "2019 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09026760",
"title": "Fast Multi-View Semi-Supervised Learning With Learned Graph",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09026760/1hYGvcaK91K",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08031060",
"articleId": "13rRUwbJD5i",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08038075",
"articleId": "13rRUxBJhvY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRX8",
"name": "ttk201712-08027086s1.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttk201712-08027086s1.zip",
"extension": "zip",
"size": "571 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1z985rMTIxG",
"title": "Jan.",
"year": "2022",
"issueNum": "01",
"idPrefix": "tk",
"pubType": "journal",
"volume": "34",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1hYGvcaK91K",
"doi": "10.1109/TKDE.2020.2978844",
"abstract": "Multi-view semi-supervised learning (SSL) has attracted great attention due to its effectiveness in information utilization of multiple views and labeled and unlabeled data to solve practical problems. However, most existing methods exhibit high computational complexity. Effective integration of the information on different views to achieve enhanced performance remains a challenging task. In this study, we combine an anchor-based approach with multi-view semi-supervised learning to address these problems. A novel multi-view SSL method called fast multi-view SSL (FMSSL) based on learned graph is proposed. Starting from the affinity graphs constructed by using an anchor-based strategy, FMSSL learns an optimal multi-view consensus graph by using feature and label information. The learned graph can jointly consider the relation of multiple views to approximate the manifold structure. The learned graph is then introduced into the SSL model as the weight matrix of a bipartite graph to simultaneously perform separate classification on the original samples and anchors. Accordingly, multi-view SSL can be efficiently performed, and the computational complexity can be significantly reduced. We propose an effective algorithm to optimize the objective function. Extensive experimental results on different real-world datasets demonstrate the effectiveness and efficiency of the proposed algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multi-view semi-supervised learning (SSL) has attracted great attention due to its effectiveness in information utilization of multiple views and labeled and unlabeled data to solve practical problems. However, most existing methods exhibit high computational complexity. Effective integration of the information on different views to achieve enhanced performance remains a challenging task. In this study, we combine an anchor-based approach with multi-view semi-supervised learning to address these problems. A novel multi-view SSL method called fast multi-view SSL (FMSSL) based on learned graph is proposed. Starting from the affinity graphs constructed by using an anchor-based strategy, FMSSL learns an optimal multi-view consensus graph by using feature and label information. The learned graph can jointly consider the relation of multiple views to approximate the manifold structure. The learned graph is then introduced into the SSL model as the weight matrix of a bipartite graph to simultaneously perform separate classification on the original samples and anchors. Accordingly, multi-view SSL can be efficiently performed, and the computational complexity can be significantly reduced. We propose an effective algorithm to optimize the objective function. Extensive experimental results on different real-world datasets demonstrate the effectiveness and efficiency of the proposed algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multi-view semi-supervised learning (SSL) has attracted great attention due to its effectiveness in information utilization of multiple views and labeled and unlabeled data to solve practical problems. However, most existing methods exhibit high computational complexity. Effective integration of the information on different views to achieve enhanced performance remains a challenging task. In this study, we combine an anchor-based approach with multi-view semi-supervised learning to address these problems. A novel multi-view SSL method called fast multi-view SSL (FMSSL) based on learned graph is proposed. Starting from the affinity graphs constructed by using an anchor-based strategy, FMSSL learns an optimal multi-view consensus graph by using feature and label information. The learned graph can jointly consider the relation of multiple views to approximate the manifold structure. The learned graph is then introduced into the SSL model as the weight matrix of a bipartite graph to simultaneously perform separate classification on the original samples and anchors. Accordingly, multi-view SSL can be efficiently performed, and the computational complexity can be significantly reduced. We propose an effective algorithm to optimize the objective function. Extensive experimental results on different real-world datasets demonstrate the effectiveness and efficiency of the proposed algorithm.",
"title": "Fast Multi-View Semi-Supervised Learning With Learned Graph",
"normalizedTitle": "Fast Multi-View Semi-Supervised Learning With Learned Graph",
"fno": "09026760",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Computational Complexity",
"Graph Theory",
"Image Classification",
"Learning Artificial Intelligence",
"Pattern Classification",
"Fast Multiview Semisupervised",
"Learned Graph",
"Multiview Semisupervised Learning",
"Novel Multiview SSL Method",
"Multiview Consensus Graph",
"Computational Complexity",
"Semisupervised Learning",
"Bipartite Graph",
"Manifolds",
"Task Analysis",
"Gene Expression",
"Labeling",
"Multi View Semi Supervised Learning",
"Computational Complexity",
"Anchor Based Strategy",
"Bipartite Graph"
],
"authors": [
{
"givenName": "Bin",
"surname": "Zhang",
"fullName": "Bin Zhang",
"affiliation": "School of Software, Xi'an Jiaotong University, Xi'an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qianyao",
"surname": "Qiang",
"fullName": "Qianyao Qiang",
"affiliation": "School of Software, Xi'an Jiaotong University, Xi'an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Fei",
"surname": "Wang",
"fullName": "Fei Wang",
"affiliation": "School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Feiping",
"surname": "Nie",
"fullName": "Feiping Nie",
"affiliation": "School of Computer Science and Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi'an, Shaanxi, P. R. China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-01-01 00:00:00",
"pubType": "trans",
"pages": "286-299",
"year": "2022",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ialp/2012/4886/0/4886a013",
"title": "Multi-view Learning for Semi-supervised Sentiment Classification",
"doi": null,
"abstractUrl": "/proceedings-article/ialp/2012/4886a013/12OmNzvhvwH",
"parentPublication": {
"id": "proceedings/ialp/2012/4886/0",
"title": "Asian Language Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2019/05/07931669",
"title": "Drug Target Prediction by Multi-View Low Rank Embedding",
"doi": null,
"abstractUrl": "/journal/tb/2019/05/07931669/13rRUwI5TPC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/06/07243351",
"title": "Co-Labeling for Multi-View Weakly Labeled Learning",
"doi": null,
"abstractUrl": "/journal/tp/2016/06/07243351/13rRUwhHcS3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2017/12/08027086",
"title": "Scalable Graph-Based Semi-Supervised Learning through Sparse Bayesian Model",
"doi": null,
"abstractUrl": "/journal/tk/2017/12/08027086/13rRUxly8Ty",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08545510",
"title": "Scalable Semi-Supervised Learning by Graph Construction with Approximate Anchors Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08545510/17D45XeKgqD",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08257918",
"title": "Multi-view graph learning with adaptive label propagation",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08257918/17D45XuDNI6",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200c876",
"title": "Semi-supervised Active Learning for Semi-supervised Models: Exploit Adversarial Examples with Graph-based Virtual Labels",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c876/1BmGmwDmCSk",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2019/4896/0/489600a653",
"title": "Capped l_2,1-Norm Regularized Dictionary Coding for Scalable Semi-Supervised Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2019/489600a653/1gAwVtczLZS",
"parentPublication": {
"id": "proceedings/icdmw/2019/4896/0",
"title": "2019 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/09/08964288",
"title": "Fast Semi-Supervised Learning With Optimal Bipartite Graph",
"doi": null,
"abstractUrl": "/journal/tk/2021/09/08964288/1gLZImA3EuQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/07/09186335",
"title": "Bipartite Graph Based Multi-View Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2022/07/09186335/1mP1Zcv047e",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09023472",
"articleId": "1hTHGyNcdP2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09040652",
"articleId": "1iiwVUuWSVa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1EQePnN5MXK",
"title": "Aug.",
"year": "2022",
"issueNum": "04",
"idPrefix": "bd",
"pubType": "journal",
"volume": "8",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1zTfQMrBMdi",
"doi": "10.1109/TBDATA.2021.3140205",
"abstract": "Graph classification aims to predict the class labels of graphs and has a wide range of applications in many real-world domains. However, most of existing graph neural networks for graph classification tasks use 90<inline-formula><tex-math notation=\"LaTeX\">Z_$\\%$_Z</tex-math></inline-formula> of labeled graphs for training and the remaining 10<inline-formula><tex-math notation=\"LaTeX\">Z_$\\%$_Z</tex-math></inline-formula> for testing, which obviously struggle in solving the problem of the scarcity of labeled graphs in real-world graph classification scenarios. And it is arduous to label a large number of graph examples for training because of the difficulty and resource consumption in the tagging process. Motivated by this, we propose a novel active and semi-supervised graph neural network (ASGNN) framework, which endeavors to complete graph classification tasks with a small number of labeled graph examples and available unlabeled graph examples. In our framework, active learning selects high-uncertain and representative graph examples from the test set and add them to the training set after annotation. Semi-supervised learning is utilized to select the high-confidence unlabeled graph examples containing structural information from the test set, and add them to the training set after pseudo labeling. To improve the generalization performance of the graph classification model, multiple GNNs are trained collaboratively for promoting the expressiveness of each other and increasing the reliability of graph classification results. Overall, the ASGNN framework takes fully use of unlabeled graph examples to reinforce graph classification effectively, and can be applied to any existing supervised graph neural networks for graph classification. Experimental results on benchmark graph datasets demonstrate that the proposed framework yields competitive performance on graph classification tasks with only a small number of labeled graph examples.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Graph classification aims to predict the class labels of graphs and has a wide range of applications in many real-world domains. However, most of existing graph neural networks for graph classification tasks use 90<inline-formula><tex-math notation=\"LaTeX\">$\\%$</tex-math><alternatives><mml:math><mml:mo>%</mml:mo></mml:math><inline-graphic xlink:href=\"qian-ieq1-3140205.gif\"/></alternatives></inline-formula> of labeled graphs for training and the remaining 10<inline-formula><tex-math notation=\"LaTeX\">$\\%$</tex-math><alternatives><mml:math><mml:mo>%</mml:mo></mml:math><inline-graphic xlink:href=\"qian-ieq2-3140205.gif\"/></alternatives></inline-formula> for testing, which obviously struggle in solving the problem of the scarcity of labeled graphs in real-world graph classification scenarios. And it is arduous to label a large number of graph examples for training because of the difficulty and resource consumption in the tagging process. Motivated by this, we propose a novel active and semi-supervised graph neural network (ASGNN) framework, which endeavors to complete graph classification tasks with a small number of labeled graph examples and available unlabeled graph examples. In our framework, active learning selects high-uncertain and representative graph examples from the test set and add them to the training set after annotation. Semi-supervised learning is utilized to select the high-confidence unlabeled graph examples containing structural information from the test set, and add them to the training set after pseudo labeling. To improve the generalization performance of the graph classification model, multiple GNNs are trained collaboratively for promoting the expressiveness of each other and increasing the reliability of graph classification results. Overall, the ASGNN framework takes fully use of unlabeled graph examples to reinforce graph classification effectively, and can be applied to any existing supervised graph neural networks for graph classification. Experimental results on benchmark graph datasets demonstrate that the proposed framework yields competitive performance on graph classification tasks with only a small number of labeled graph examples.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Graph classification aims to predict the class labels of graphs and has a wide range of applications in many real-world domains. However, most of existing graph neural networks for graph classification tasks use 90- of labeled graphs for training and the remaining 10- for testing, which obviously struggle in solving the problem of the scarcity of labeled graphs in real-world graph classification scenarios. And it is arduous to label a large number of graph examples for training because of the difficulty and resource consumption in the tagging process. Motivated by this, we propose a novel active and semi-supervised graph neural network (ASGNN) framework, which endeavors to complete graph classification tasks with a small number of labeled graph examples and available unlabeled graph examples. In our framework, active learning selects high-uncertain and representative graph examples from the test set and add them to the training set after annotation. Semi-supervised learning is utilized to select the high-confidence unlabeled graph examples containing structural information from the test set, and add them to the training set after pseudo labeling. To improve the generalization performance of the graph classification model, multiple GNNs are trained collaboratively for promoting the expressiveness of each other and increasing the reliability of graph classification results. Overall, the ASGNN framework takes fully use of unlabeled graph examples to reinforce graph classification effectively, and can be applied to any existing supervised graph neural networks for graph classification. Experimental results on benchmark graph datasets demonstrate that the proposed framework yields competitive performance on graph classification tasks with only a small number of labeled graph examples.",
"title": "Active and Semi-Supervised Graph Neural Networks for Graph Classification",
"normalizedTitle": "Active and Semi-Supervised Graph Neural Networks for Graph Classification",
"fno": "09669159",
"hasPdf": true,
"idPrefix": "bd",
"keywords": [
"Graph Theory",
"Groupware",
"Neural Nets",
"Pattern Classification",
"Semi Supervised Learning Artificial Intelligence",
"High Confidence Unlabeled Graph Examples",
"Graph Classification",
"High Uncertain Graph Example",
"Representative Graph Example",
"Active Learning",
"Collaborative Training",
"ASGNN",
"Active And Semi Supervised Graph Neural Networks",
"Semi Supervised Learning",
"Training Data",
"Graph Neural Networks",
"Task Analysis",
"Semisupervised Learning",
"Network Topology",
"Data Models",
"Labeling",
"Graph Neural Networks",
"Active Learning",
"Semi Supervised Learning",
"Graph Classification"
],
"authors": [
{
"givenName": "Yu",
"surname": "Xie",
"fullName": "Yu Xie",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, Shanxi University, Taiyuan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shengze",
"surname": "Lv",
"fullName": "Shengze Lv",
"affiliation": "School of Computer Science and Technology, Xidian University, Xi'an, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yuhua",
"surname": "Qian",
"fullName": "Yuhua Qian",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, Shanxi University, Taiyuan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chao",
"surname": "Wen",
"fullName": "Chao Wen",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, Shanxi University, Taiyuan, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jiye",
"surname": "Liang",
"fullName": "Jiye Liang",
"affiliation": "Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education, Shanxi University, Taiyuan, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "920-932",
"year": "2022",
"issn": "2332-7790",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/isda/2006/2528/2/252820856",
"title": "Graph-based Semi-supervised Learning Algorithm for Web Page Classification",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2006/252820856/12OmNBziB9f",
"parentPublication": {
"id": "proceedings/isda/2006/2528/2",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2015/8159/0/8159a060",
"title": "Active Semi-supervised Defect Categorization",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2015/8159a060/12OmNCxbXFh",
"parentPublication": {
"id": "proceedings/icpc/2015/8159/0",
"title": "2015 IEEE 23rd International Conference on Program Comprehension (ICPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2017/3800/0/3800a850",
"title": "Combining Active Learning and Semi-Supervised Learning by Using Selective Label Spreading",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2017/3800a850/12OmNvFHfGd",
"parentPublication": {
"id": "proceedings/icdmw/2017/3800/0",
"title": "2017 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/03/08519335",
"title": "Deep Inductive Graph Representation Learning",
"doi": null,
"abstractUrl": "/journal/tk/2020/03/08519335/17D45WrVgec",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200c876",
"title": "Semi-supervised Active Learning for Semi-supervised Models: Exploit Adversarial Examples with Graph-based Virtual Labels",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c876/1BmGmwDmCSk",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/5555/01/10100855",
"title": "Self-consistent Graph Neural Networks for Semi-supervised Node Classification",
"doi": null,
"abstractUrl": "/journal/bd/5555/01/10100855/1MhE4hPQZaM",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2021/09/08964288",
"title": "Fast Semi-Supervised Learning With Optimal Bipartite Graph",
"doi": null,
"abstractUrl": "/journal/tk/2021/09/08964288/1gLZImA3EuQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/01/09026760",
"title": "Fast Multi-View Semi-Supervised Learning With Learned Graph",
"doi": null,
"abstractUrl": "/journal/tk/2022/01/09026760/1hYGvcaK91K",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09419731",
"title": "Semi-Supervised Learning With Label Proportion",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09419731/1tcfB0XQv2U",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2022/05/09423579",
"title": "Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks",
"doi": null,
"abstractUrl": "/journal/tc/2022/05/09423579/1tkyeT8TOwg",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09638331",
"articleId": "1z77HnrOpl6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09629352",
"articleId": "1yXvESlZNJK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1IRhD73QTpC",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "45",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1AO2c1gMaqI",
"doi": "10.1109/TPAMI.2022.3148853",
"abstract": "Free-hand sketches are highly illustrative, and have been widely used by humans to depict objects or stories from ancient times to the present. The recent prevalence of touchscreen devices has made sketch creation a much easier task than ever and consequently made sketch-oriented applications increasingly popular. The progress of deep learning has immensely benefited free-hand sketch research and applications. This paper presents a comprehensive survey of the deep learning techniques oriented at free-hand sketch data, and the applications that they enable. The main contents of this survey include: (i) A discussion of the intrinsic traits and unique challenges of free-hand sketch, to highlight the essential differences between sketch data and other data modalities, e.g., natural photos. (ii) A review of the developments of free-hand sketch research in the deep learning era, by surveying existing datasets, research topics, and the state-of-the-art methods through a detailed taxonomy and experimental evaluation. (iii) Promotion of future work via a discussion of bottlenecks, open problems, and potential research directions for the community.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Free-hand sketches are highly illustrative, and have been widely used by humans to depict objects or stories from ancient times to the present. The recent prevalence of touchscreen devices has made sketch creation a much easier task than ever and consequently made sketch-oriented applications increasingly popular. The progress of deep learning has immensely benefited free-hand sketch research and applications. This paper presents a comprehensive survey of the deep learning techniques oriented at free-hand sketch data, and the applications that they enable. The main contents of this survey include: (i) A discussion of the intrinsic traits and unique challenges of free-hand sketch, to highlight the essential differences between sketch data and other data modalities, e.g., natural photos. (ii) A review of the developments of free-hand sketch research in the deep learning era, by surveying existing datasets, research topics, and the state-of-the-art methods through a detailed taxonomy and experimental evaluation. (iii) Promotion of future work via a discussion of bottlenecks, open problems, and potential research directions for the community.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Free-hand sketches are highly illustrative, and have been widely used by humans to depict objects or stories from ancient times to the present. The recent prevalence of touchscreen devices has made sketch creation a much easier task than ever and consequently made sketch-oriented applications increasingly popular. The progress of deep learning has immensely benefited free-hand sketch research and applications. This paper presents a comprehensive survey of the deep learning techniques oriented at free-hand sketch data, and the applications that they enable. The main contents of this survey include: (i) A discussion of the intrinsic traits and unique challenges of free-hand sketch, to highlight the essential differences between sketch data and other data modalities, e.g., natural photos. (ii) A review of the developments of free-hand sketch research in the deep learning era, by surveying existing datasets, research topics, and the state-of-the-art methods through a detailed taxonomy and experimental evaluation. (iii) Promotion of future work via a discussion of bottlenecks, open problems, and potential research directions for the community.",
"title": "Deep Learning for Free-Hand Sketch: A Survey",
"normalizedTitle": "Deep Learning for Free-Hand Sketch: A Survey",
"fno": "09706366",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Deep Learning Artificial Intelligence",
"Touch Sensitive Screens",
"Deep Learning Techniques",
"Free Hand Sketch Data",
"Sketch Creation",
"Sketch Oriented Applications",
"Touchscreen Devices",
"Deep Learning",
"Task Analysis",
"Taxonomy",
"Recurrent Neural Networks",
"Internet",
"Image Segmentation",
"Convolutional Neural Networks",
"Free Hand Sketch",
"Deep Learning",
"Survey",
"Introductory",
"Taxonomy"
],
"authors": [
{
"givenName": "Peng",
"surname": "Xu",
"fullName": "Peng Xu",
"affiliation": "Department of Engineering Science, University of Oxford, Oxford, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Timothy M.",
"surname": "Hospedales",
"fullName": "Timothy M. Hospedales",
"affiliation": "School of Informatics, The University of Edinburgh, Edinburgh, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Qiyue",
"surname": "Yin",
"fullName": "Qiyue Yin",
"affiliation": "Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yi-Zhe",
"surname": "Song",
"fullName": "Yi-Zhe Song",
"affiliation": "Computer Vision and Machine Learning at the Centre for Vision Speech and Signal Processing (CVSSP), University of Surrey, Guildford, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tao",
"surname": "Xiang",
"fullName": "Tao Xiang",
"affiliation": "Computer Vision and Machine Learning at the Centre for Vision Speech and Signal Processing (CVSSP), University of Surrey, Guildford, U.K.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Liang",
"surname": "Wang",
"fullName": "Liang Wang",
"affiliation": "Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "285-312",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2017/1032/0/1032f429",
"title": "Face Sketch Matching via Coupled Deep Transform Learning",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032f429/12OmNCcbE7s",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851a799",
"title": "Sketch Me That Shoe",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851a799/12OmNqIhG7G",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761466",
"title": "Free-hand sketch grouping for video retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761466/12OmNsbY6Lt",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457c298",
"title": "Deep Sketch Hashing: Fast Free-Hand Sketch-Based Image Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457c298/12OmNvSbBu6",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2019/12/08440073",
"title": "Deep Neural Representation Guided Face Sketch Synthesis",
"doi": null,
"abstractUrl": "/journal/tg/2019/12/08440073/13rRUxAASTg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000i014",
"title": "Learning Deep Sketch Abstraction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000i014/17D45WLdYQJ",
"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/icaice/2020/9146/0/914600a006",
"title": "State-of-the-Art survey of deep learning based sketch retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icaice/2020/914600a006/1rCgbC7uEg0",
"parentPublication": {
"id": "proceedings/icaice/2020/9146/0",
"title": "2020 International Conference on Artificial Intelligence and Computer Engineering (ICAICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isctt/2020/8575/0/857500a001",
"title": "Survey of the Image Recognition Based on Deep Learning Network for Autonomous Driving Car",
"doi": null,
"abstractUrl": "/proceedings-article/isctt/2020/857500a001/1rHeQhk6svu",
"parentPublication": {
"id": "proceedings/isctt/2020/8575/0",
"title": "2020 5th International Conference on Information Science, Computer Technology and Transportation (ISCTT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412083",
"title": "Sketch-SNet: Deeper Subdivision of Temporal Cues for Sketch Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412083/1tmiEPsqRYk",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2020/9234/0/923400a184",
"title": "Deep 3D Shape Reconstruction from Single-View Sketch Image",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2020/923400a184/1uGY2GTiIda",
"parentPublication": {
"id": "proceedings/icdh/2020/9234/0",
"title": "2020 8th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09714177",
"articleId": "1B0XQYUe8Ao",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09729440",
"articleId": "1Bya3YtpT7G",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1F1RqsP3AfS",
"title": "July-Aug.",
"year": "2022",
"issueNum": "04",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "42",
"label": "July-Aug.",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1x9TPRYeJm8",
"doi": "10.1109/MCG.2021.3115181",
"abstract": "This article presents a data-driven approach for beautifying freehand sketches. Our key premise is that the artist-drawn vector can be used to sketch visually appealing shapes, such as local shapes with a clean appearance and better global visual properties (e.g., symmetry). However, these merits may not apply to all object categories. In this article, we use a neural network to represent local and global merits across different object categories to design our beautification method. First, we match sample points between input sketches and the collected vector shapes using the extracted feature representations. Then, we design an optimization problem to ensure resemblance between the deformed sketch and vector shape in the representation space while preserving the semantic meaning and style of the original sketch. Finally, we demonstrate our method on sketches across different shape categories.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This article presents a data-driven approach for beautifying freehand sketches. Our key premise is that the artist-drawn vector can be used to sketch visually appealing shapes, such as local shapes with a clean appearance and better global visual properties (e.g., symmetry). However, these merits may not apply to all object categories. In this article, we use a neural network to represent local and global merits across different object categories to design our beautification method. First, we match sample points between input sketches and the collected vector shapes using the extracted feature representations. Then, we design an optimization problem to ensure resemblance between the deformed sketch and vector shape in the representation space while preserving the semantic meaning and style of the original sketch. Finally, we demonstrate our method on sketches across different shape categories.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This article presents a data-driven approach for beautifying freehand sketches. Our key premise is that the artist-drawn vector can be used to sketch visually appealing shapes, such as local shapes with a clean appearance and better global visual properties (e.g., symmetry). However, these merits may not apply to all object categories. In this article, we use a neural network to represent local and global merits across different object categories to design our beautification method. First, we match sample points between input sketches and the collected vector shapes using the extracted feature representations. Then, we design an optimization problem to ensure resemblance between the deformed sketch and vector shape in the representation space while preserving the semantic meaning and style of the original sketch. Finally, we demonstrate our method on sketches across different shape categories.",
"title": "Data-Driven Sketch Beautification With Neural Feature Representation",
"normalizedTitle": "Data-Driven Sketch Beautification With Neural Feature Representation",
"fno": "09547752",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Approximation Theory",
"Computational Geometry",
"Data Visualisation",
"Feature Extraction",
"Image Representation",
"Solid Modelling",
"Neural Feature Representation",
"Data Driven Approach",
"Freehand Sketches",
"Key Premise",
"Artist Drawn Vector",
"Visually Appealing Shapes",
"Local Shapes",
"Clean Appearance",
"Global Visual Properties",
"Neural Network",
"Local Merits",
"Global Merits",
"Different Object Categories",
"Beautification Method",
"Input Sketches",
"Collected Vector Shapes",
"Extracted Feature Representations",
"Deformed Sketch",
"Vector Shape",
"Representation Space",
"Original Sketch",
"Different Shape Categories",
"Data Driven Sketch Beautification",
"Data Models",
"Feature Extraction",
"Optimization",
"Visualization",
"Neural Networks",
"Costs",
"Semantics"
],
"authors": [
{
"givenName": "I-Chao",
"surname": "Shen",
"fullName": "I-Chao Shen",
"affiliation": "The University of Tokyo, Tokyo, Japan",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2022-07-01 00:00:00",
"pubType": "mags",
"pages": "72-79",
"year": "2022",
"issn": "0272-1716",
"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/icpr/2012/2216/0/06460802",
"title": "Smoothness-constrained face photo-sketch synthesis using sparse representation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460802/12OmNxE2mI9",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019464",
"title": "Multi-view pairwise relationship learning for sketch based 3D shape retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019464/12OmNy6Zs2q",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019432",
"title": "Towards sketch-based image retrieval with deep cross-modal correlation learning",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019432/12OmNy6qfIW",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2022/0915/0/091500a944",
"title": "Adversarial Open Domain Adaptation for Sketch-to-Photo Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2022/091500a944/1B13AO3WYa4",
"parentPublication": {
"id": "proceedings/wacv/2022/0915/0",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200a933",
"title": "SketchLattice: Latticed Representation for Sketch Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200a933/1BmEsLjcvzq",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300c174",
"title": "Doodle to Search: Practical Zero-Shot Sketch-Based Image Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300c174/1gyrnbkIYX6",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102957",
"title": "S<sup>3</sup>Net:Graph Representational Network For Sketch Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102957/1kwreWjaEUM",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800g757",
"title": "Sketch-BERT: Learning Sketch Bidirectional Encoder Representation From Transformers by Self-Supervised Learning of Sketch Gestalt",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800g757/1m3ossfYmxq",
"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/icdh/2020/9234/0/923400a184",
"title": "Deep 3D Shape Reconstruction from Single-View Sketch Image",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2020/923400a184/1uGY2GTiIda",
"parentPublication": {
"id": "proceedings/icdh/2020/9234/0",
"title": "2020 8th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09609663",
"articleId": "1yoxNf9lgJi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09830796",
"articleId": "1F1RqQjMZMY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxUv6hd",
"title": "February",
"year": "1996",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "18",
"label": "February",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxd2aZL",
"doi": "10.1109/34.481543",
"abstract": "Abstract—A neural network texture classification method is proposed in this paper. The approach is introduced as a generalization of the multichannel filtering method. Instead of using a general filter bank, a neural network is trained to find a minimal set of specific filters, so that both the feature extraction and classification tasks are performed by the same unified network. We compute the error rates for different network parameters, and show the convergence speed of training and node pruning algorithms. The proposed method is demonstrated in several texture classification experiments. It is successfully applied in the tasks of locating barcodes in the images and segmenting a printed page into text, graphics, and background. Compared with the traditional multichannel filtering method, the neural network approach allows one to perform the same texture classification or segmentation task more efficiently. Extensions of the method, as well as its limitations, are discussed in the paper.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—A neural network texture classification method is proposed in this paper. The approach is introduced as a generalization of the multichannel filtering method. Instead of using a general filter bank, a neural network is trained to find a minimal set of specific filters, so that both the feature extraction and classification tasks are performed by the same unified network. We compute the error rates for different network parameters, and show the convergence speed of training and node pruning algorithms. The proposed method is demonstrated in several texture classification experiments. It is successfully applied in the tasks of locating barcodes in the images and segmenting a printed page into text, graphics, and background. Compared with the traditional multichannel filtering method, the neural network approach allows one to perform the same texture classification or segmentation task more efficiently. Extensions of the method, as well as its limitations, are discussed in the paper.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—A neural network texture classification method is proposed in this paper. The approach is introduced as a generalization of the multichannel filtering method. Instead of using a general filter bank, a neural network is trained to find a minimal set of specific filters, so that both the feature extraction and classification tasks are performed by the same unified network. We compute the error rates for different network parameters, and show the convergence speed of training and node pruning algorithms. The proposed method is demonstrated in several texture classification experiments. It is successfully applied in the tasks of locating barcodes in the images and segmenting a printed page into text, graphics, and background. Compared with the traditional multichannel filtering method, the neural network approach allows one to perform the same texture classification or segmentation task more efficiently. Extensions of the method, as well as its limitations, are discussed in the paper.",
"title": "Learning Texture Discrimination Masks",
"normalizedTitle": "Learning Texture Discrimination Masks",
"fno": "i0195",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Texture",
"Segmentation",
"Learning",
"Neural Networks",
"Feature Extraction"
],
"authors": [
{
"givenName": "Anil K.",
"surname": "Jain",
"fullName": "Anil K. Jain",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kalle",
"surname": "Karu",
"fullName": "Kalle Karu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "1996-02-01 00:00:00",
"pubType": "trans",
"pages": "195-205",
"year": "1996",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0181",
"articleId": "13rRUwdIOVI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0206",
"articleId": "13rRUyYSWlW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1ugDQjSl8Jy",
"title": "July",
"year": "2021",
"issueNum": "07",
"idPrefix": "tp",
"pubType": "journal",
"volume": "43",
"label": "July",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1goL3nw2V7q",
"doi": "10.1109/TPAMI.2020.2964533",
"abstract": "Estimation of texture similarity is fundamental to many material recognition tasks. This study uses fine-grained human perceptual similarity ground-truth to provide a comprehensive evaluation of 51 texture feature sets. We conduct two types of evaluation and both show that these features do not estimate similarity well when compared against human agreement rates, but that performances are improved when the features are combined using a Random Forest. Using a simple two-stage statistical model we show that few of the features capture long-range aperiodic relationships. We perform two psychophysical experiments which indicate that long-range interactions do provide humans with important cues for estimating texture similarity. This motivates an extension of the study to include Convolutional Neural Networks (CNNs) as they enable arbitrary features of large spatial extent to be learnt. Our conclusions derived from the use of two pre-trained CNNs are: that the large spatial extent exploited by the networks' top convolutional and first fully-connected layers, together with the use of large numbers of filters, confers significant advantage for estimation of perceptual texture similarity.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Estimation of texture similarity is fundamental to many material recognition tasks. This study uses fine-grained human perceptual similarity ground-truth to provide a comprehensive evaluation of 51 texture feature sets. We conduct two types of evaluation and both show that these features do not estimate similarity well when compared against human agreement rates, but that performances are improved when the features are combined using a Random Forest. Using a simple two-stage statistical model we show that few of the features capture long-range aperiodic relationships. We perform two psychophysical experiments which indicate that long-range interactions do provide humans with important cues for estimating texture similarity. This motivates an extension of the study to include Convolutional Neural Networks (CNNs) as they enable arbitrary features of large spatial extent to be learnt. Our conclusions derived from the use of two pre-trained CNNs are: that the large spatial extent exploited by the networks' top convolutional and first fully-connected layers, together with the use of large numbers of filters, confers significant advantage for estimation of perceptual texture similarity.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Estimation of texture similarity is fundamental to many material recognition tasks. This study uses fine-grained human perceptual similarity ground-truth to provide a comprehensive evaluation of 51 texture feature sets. We conduct two types of evaluation and both show that these features do not estimate similarity well when compared against human agreement rates, but that performances are improved when the features are combined using a Random Forest. Using a simple two-stage statistical model we show that few of the features capture long-range aperiodic relationships. We perform two psychophysical experiments which indicate that long-range interactions do provide humans with important cues for estimating texture similarity. This motivates an extension of the study to include Convolutional Neural Networks (CNNs) as they enable arbitrary features of large spatial extent to be learnt. Our conclusions derived from the use of two pre-trained CNNs are: that the large spatial extent exploited by the networks' top convolutional and first fully-connected layers, together with the use of large numbers of filters, confers significant advantage for estimation of perceptual texture similarity.",
"title": "Perceptual Texture Similarity Estimation: An Evaluation of Computational Features",
"normalizedTitle": "Perceptual Texture Similarity Estimation: An Evaluation of Computational Features",
"fno": "08951140",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Convolutional Neural Nets",
"Feature Extraction",
"Image Classification",
"Image Texture",
"Learning Artificial Intelligence",
"Object Detection",
"Statistical Analysis",
"Convolutional Neural Networks",
"CNN",
"Long Range Aperiodic Relationships",
"Two Stage Statistical Model",
"Human Agreement Rates",
"Texture Feature Sets",
"Comprehensive Evaluation",
"Fine Grained Human Perceptual Similarity Ground Truth",
"Material Recognition Tasks",
"Computational Features",
"Perceptual Texture Similarity Estimation",
"Arbitrary Features",
"Long Range Interactions",
"Task Analysis",
"Observers",
"Feature Extraction",
"Computational Modeling",
"Convolutional Neural Networks",
"Computer Vision",
"Evaluation",
"Features",
"Perceptual Similarity",
"Similarity Measures",
"Texture Similarity"
],
"authors": [
{
"givenName": "Xinghui",
"surname": "Dong",
"fullName": "Xinghui Dong",
"affiliation": "Centre for Imaging Sciences, The University of Manchester, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Junyu",
"surname": "Dong",
"fullName": "Junyu Dong",
"affiliation": "Department of Computer Science, Ocean University of China, Qingdao, Shandong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mike J.",
"surname": "Chantler",
"fullName": "Mike J. Chantler",
"affiliation": "Texture Lab, School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, United Kingdom",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "07",
"pubDate": "2021-07-01 00:00:00",
"pubType": "trans",
"pages": "2429-2448",
"year": "2021",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2002/1695/1/169510135",
"title": "A Hybrid Model for Invariant and Perceptual Texture Mapping",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2002/169510135/12OmNBubOVP",
"parentPublication": {
"id": "proceedings/icpr/2002/1695/1",
"title": "Proceedings of 16th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1996/7258/0/72580425",
"title": "Texture Features and Learning Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1996/72580425/12OmNqIQScm",
"parentPublication": {
"id": "proceedings/cvpr/1996/7258/0",
"title": "Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apcip/2009/3699/2/3699b055",
"title": "Texture Image Classification Using Perceptual Texture Features and Gabor Wavelet Features",
"doi": null,
"abstractUrl": "/proceedings-article/apcip/2009/3699b055/12OmNx38vOb",
"parentPublication": {
"id": "proceedings/apcip/2009/3699/1",
"title": "Information Processing, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034c758",
"title": "The Importance of Phase to Texture Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c758/12OmNyjccyA",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcs/1999/0253/1/02539171",
"title": "PISARO: Perceptual Colour and Texture Queries using Stackable Mosaics",
"doi": null,
"abstractUrl": "/proceedings-article/icmcs/1999/02539171/12OmNzZ5oeW",
"parentPublication": {
"id": "proceedings/icmcs/1999/0253/1",
"title": "Multimedia Computing and Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000a586",
"title": "The Unreasonable Effectiveness of Deep Features as a Perceptual Metric",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000a586/17D45VN31i9",
"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/2019/4803/0/480300f611",
"title": "Scoot: A Perceptual Metric for Facial Sketches",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300f611/1hVll9blXH2",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09040272",
"title": "The Importance of Phase to Texture Discrimination and Similarity",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09040272/1iix1mZ2iB2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900f227",
"title": "Deep Texture Recognition via Exploiting Cross-Layer Statistical Self-Similarity",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900f227/1yeIYvLZKWk",
"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/cvpr/2021/4509/0/450900m2221",
"title": "Understanding and Simplifying Perceptual Distances",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900m2221/1yeM8RdaPq8",
"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": "08957473",
"articleId": "1gyIruphU0o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08968618",
"articleId": "1gQYv5StsRy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1ugDQuMc3ra",
"name": "ttp202107-08951140s1-supp1-2964533.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttp202107-08951140s1-supp1-2964533.pdf",
"extension": "pdf",
"size": "3.16 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBaT5Zx",
"title": "Dec.",
"year": "2016",
"issueNum": "12",
"idPrefix": "tp",
"pubType": "journal",
"volume": "38",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxCitKE",
"doi": "10.1109/TPAMI.2016.2519024",
"abstract": "Artificial markers are successfully adopted to solve several vision tasks, ranging from tracking to calibration. While most designs share the same working principles, many specialized approaches exist to address specific application domains. Some are specially crafted to boost pose recovery accuracy. Others are made robust to occlusion or easy to detect with minimal computational resources. The sheer amount of approaches available in recent literature is indeed a statement to the fact that no silver bullet exists. Furthermore, this is also a hint to the level of scholarly interest that still characterizes this research topic. With this paper we try to add a novel option to the offer, by introducing a general purpose fiducial marker which exhibits many useful properties while being easy to implement and fast to detect. The key ideas underlying our approach are three. The first one is to exploit the projective invariance of conics to jointly find the marker and set a reading frame for it. Moreover, the tag identity is assessed by a redundant cyclic coded sequence implemented using the same circular features used for detection. Finally, the specific design and feature organization of the marker are well suited for several practical tasks, ranging from camera calibration to information payload delivery.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Artificial markers are successfully adopted to solve several vision tasks, ranging from tracking to calibration. While most designs share the same working principles, many specialized approaches exist to address specific application domains. Some are specially crafted to boost pose recovery accuracy. Others are made robust to occlusion or easy to detect with minimal computational resources. The sheer amount of approaches available in recent literature is indeed a statement to the fact that no silver bullet exists. Furthermore, this is also a hint to the level of scholarly interest that still characterizes this research topic. With this paper we try to add a novel option to the offer, by introducing a general purpose fiducial marker which exhibits many useful properties while being easy to implement and fast to detect. The key ideas underlying our approach are three. The first one is to exploit the projective invariance of conics to jointly find the marker and set a reading frame for it. Moreover, the tag identity is assessed by a redundant cyclic coded sequence implemented using the same circular features used for detection. Finally, the specific design and feature organization of the marker are well suited for several practical tasks, ranging from camera calibration to information payload delivery.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Artificial markers are successfully adopted to solve several vision tasks, ranging from tracking to calibration. While most designs share the same working principles, many specialized approaches exist to address specific application domains. Some are specially crafted to boost pose recovery accuracy. Others are made robust to occlusion or easy to detect with minimal computational resources. The sheer amount of approaches available in recent literature is indeed a statement to the fact that no silver bullet exists. Furthermore, this is also a hint to the level of scholarly interest that still characterizes this research topic. With this paper we try to add a novel option to the offer, by introducing a general purpose fiducial marker which exhibits many useful properties while being easy to implement and fast to detect. The key ideas underlying our approach are three. The first one is to exploit the projective invariance of conics to jointly find the marker and set a reading frame for it. Moreover, the tag identity is assessed by a redundant cyclic coded sequence implemented using the same circular features used for detection. Finally, the specific design and feature organization of the marker are well suited for several practical tasks, ranging from camera calibration to information payload delivery.",
"title": "An Accurate and Robust Artificial Marker Based on Cyclic Codes",
"normalizedTitle": "An Accurate and Robust Artificial Marker Based on Cyclic Codes",
"fno": "07384749",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Feature Extraction",
"Cameras",
"Robustness",
"Encoding",
"Calibration",
"Pattern Recognition",
"Shape",
"Pose Estimation",
"RUNE Tag",
"Fiducial Markers",
"Cyclic Codes",
"Camera Calibration"
],
"authors": [
{
"givenName": "Filippo",
"surname": "Bergamasco",
"fullName": "Filippo Bergamasco",
"affiliation": "DAIS, Universit Ca’ Foscari Venezia, Venice, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrea",
"surname": "Albarelli",
"fullName": "Andrea Albarelli",
"affiliation": "DAIS, Universit Ca’ Foscari Venezia, Venice, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Luca",
"surname": "Cosmo",
"fullName": "Luca Cosmo",
"affiliation": "DAIS, Universit Ca’ Foscari Venezia, Venice, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Emanuele",
"surname": "Rodolà",
"fullName": "Emanuele Rodolà",
"affiliation": "Department of Informatics, Technical University of Munich, Munich, Bavaria, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Andrea",
"surname": "Torsello",
"fullName": "Andrea Torsello",
"affiliation": "DAIS, Universit Ca’ Foscari Venezia, Venice, Italy",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2016-12-01 00:00:00",
"pubType": "trans",
"pages": "2359-2373",
"year": "2016",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2012/1611/0/06238905",
"title": "Calibration for high-definition camera rigs with marker chessboard",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2012/06238905/12OmNAXxWUh",
"parentPublication": {
"id": "proceedings/cvprw/2012/1611/0",
"title": "2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wmsvm/2010/7077/0/05558353",
"title": "An Extended Marker-Based Tracking System for Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/wmsvm/2010/05558353/12OmNAiFI7k",
"parentPublication": {
"id": "proceedings/wmsvm/2010/7077/0",
"title": "2010 Second International Conference on Modeling, Simulation and Visualization Methods (WMSVM 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2014/4261/0/4261a089",
"title": "A Method to Automate the Calibration of a Multiple Fiducial Marker Setup",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2014/4261a089/12OmNqJq4mR",
"parentPublication": {
"id": "proceedings/svr/2014/4261/0",
"title": "2014 XVI Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2010/9343/0/05643605",
"title": "Floyd-Warshall all-pair shortest path for accurate multi-marker calibration",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2010/05643605/12OmNs59JEg",
"parentPublication": {
"id": "proceedings/ismar/2010/9343/0",
"title": "2010 IEEE International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2013/5053/0/06475056",
"title": "Geometric calibration for a multi-camera-projector system",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2013/06475056/12OmNvBrgGd",
"parentPublication": {
"id": "proceedings/wacv/2013/5053/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2010/4286/1/4286a195",
"title": "An Improved Camera Calibration Method Using the Fiducial Marker System",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2010/4286a195/12OmNwCaCtd",
"parentPublication": {
"id": "proceedings/icdma/2010/4286/1",
"title": "2010 International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a556",
"title": "X-Tag: A Fiducial Tag for Flexible and Accurate Bundle Adjustment",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a556/12OmNxWLTHl",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2007/0905/0/04161037",
"title": "A Nested Marker for Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2007/04161037/12OmNy7yEcW",
"parentPublication": {
"id": "proceedings/vr/2007/0905/0",
"title": "2007 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034a394",
"title": "Accurate Calibration of LiDAR-Camera Systems Using Ordinary Boxes",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a394/12OmNyTOsk0",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09072595",
"title": "TopoTag: A Robust and Scalable Topological Fiducial Marker System",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09072595/1jbj4gWAcZa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07393849",
"articleId": "13rRUxOdD3T",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07404063",
"articleId": "13rRUEgaru5",
"__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": "1DjDnSMD9n2",
"doi": "10.1109/TPAMI.2022.3174603",
"abstract": "A fiducial marker system usually consists of markers, a detection algorithm, and a coding system. The appearance of markers and the detection robustness are generally limited by the existing detection algorithms, which are hand-crafted with traditional low-level image processing techniques. Furthermore, a sophisticatedly designed coding system is required to overcome the shortcomings of both markers and detection algorithms. To improve the flexibility and robustness in various applications, we propose a general deep learning based framework, <italic>DeepTag</italic>, for fiducial marker design and detection. DeepTag not only supports detection of a wide variety of existing marker families, but also makes it possible to design new marker families with customized local patterns. Moreover, we propose an effective procedure to synthesize training data on the fly without manual annotations. Thus, DeepTag can easily adapt to existing and newly-designed marker families. To validate DeepTag and existing methods, beside existing datasets, we further collect a new large and challenging dataset where markers are placed in different view distances and angles. Experiments show that DeepTag well supports different marker families and greatly outperforms the existing methods in terms of both detection robustness and pose accuracy. Both code and dataset are available at <uri>https://herohuyongtao.github.io/research/publications/deep-tag/</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A fiducial marker system usually consists of markers, a detection algorithm, and a coding system. The appearance of markers and the detection robustness are generally limited by the existing detection algorithms, which are hand-crafted with traditional low-level image processing techniques. Furthermore, a sophisticatedly designed coding system is required to overcome the shortcomings of both markers and detection algorithms. To improve the flexibility and robustness in various applications, we propose a general deep learning based framework, <italic>DeepTag</italic>, for fiducial marker design and detection. DeepTag not only supports detection of a wide variety of existing marker families, but also makes it possible to design new marker families with customized local patterns. Moreover, we propose an effective procedure to synthesize training data on the fly without manual annotations. Thus, DeepTag can easily adapt to existing and newly-designed marker families. To validate DeepTag and existing methods, beside existing datasets, we further collect a new large and challenging dataset where markers are placed in different view distances and angles. Experiments show that DeepTag well supports different marker families and greatly outperforms the existing methods in terms of both detection robustness and pose accuracy. Both code and dataset are available at <uri>https://herohuyongtao.github.io/research/publications/deep-tag/</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A fiducial marker system usually consists of markers, a detection algorithm, and a coding system. The appearance of markers and the detection robustness are generally limited by the existing detection algorithms, which are hand-crafted with traditional low-level image processing techniques. Furthermore, a sophisticatedly designed coding system is required to overcome the shortcomings of both markers and detection algorithms. To improve the flexibility and robustness in various applications, we propose a general deep learning based framework, DeepTag, for fiducial marker design and detection. DeepTag not only supports detection of a wide variety of existing marker families, but also makes it possible to design new marker families with customized local patterns. Moreover, we propose an effective procedure to synthesize training data on the fly without manual annotations. Thus, DeepTag can easily adapt to existing and newly-designed marker families. To validate DeepTag and existing methods, beside existing datasets, we further collect a new large and challenging dataset where markers are placed in different view distances and angles. Experiments show that DeepTag well supports different marker families and greatly outperforms the existing methods in terms of both detection robustness and pose accuracy. Both code and dataset are available at https://herohuyongtao.github.io/research/publications/deep-tag/.",
"title": "DeepTag: A General Framework for Fiducial Marker Design and Detection",
"normalizedTitle": "DeepTag: A General Framework for Fiducial Marker Design and Detection",
"fno": "09773975",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Deep Learning Artificial Intelligence",
"Image Coding",
"Object Detection",
"Coding System",
"Deep Tag",
"Fiducial Marker Design",
"Fiducial Marker Detection",
"General Deep Learning Based Framework",
"Marker Families",
"Symbols",
"Image Coding",
"Convolutional Neural Networks",
"Training Data",
"Robustness",
"Pose Estimation",
"Detection Algorithms",
"Fiducial Marker",
"Deep Learning",
"Object Detection",
"Marker Design",
"Monocular Pose Estimation"
],
"authors": [
{
"givenName": "Zhuming",
"surname": "Zhang",
"fullName": "Zhuming Zhang",
"affiliation": "X-Lab, Guangdong Virtual Reality Technology Co., Ltd., Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yongtao",
"surname": "Hu",
"fullName": "Yongtao Hu",
"affiliation": "X-Lab, Guangdong Virtual Reality Technology Co., Ltd., Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoxing",
"surname": "Yu",
"fullName": "Guoxing Yu",
"affiliation": "X-Lab, Guangdong Virtual Reality Technology Co., Ltd., Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jingwen",
"surname": "Dai",
"fullName": "Jingwen Dai",
"affiliation": "X-Lab, Guangdong Virtual Reality Technology Co., Ltd., Shenzhen, Guangdong, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "2931-2944",
"year": "2023",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2017/1032/0/1032b481",
"title": "ChromaTag: A Colored Marker and Fast Detection Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032b481/12OmNC2OSIa",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2010/4286/1/4286a195",
"title": "An Improved Camera Calibration Method Using the Fiducial Marker System",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2010/4286a195/12OmNwCaCtd",
"parentPublication": {
"id": "proceedings/icdma/2010/4286/1",
"title": "2010 International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2010/8420/0/05720368",
"title": "On the Design and Evaluation of a Precise Scalable Fiducial Marker Framework",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720368/12OmNwNwzQw",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismarw/2016/3740/0/07836466",
"title": "Mobile Augmented Reality Based on Invisible Marker",
"doi": null,
"abstractUrl": "/proceedings-article/ismarw/2016/07836466/12OmNx7G5Tm",
"parentPublication": {
"id": "proceedings/ismarw/2016/3740/0",
"title": "2016 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a556",
"title": "X-Tag: A Fiducial Tag for Flexible and Accurate Bundle Adjustment",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a556/12OmNxWLTHl",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995544",
"title": "RUNE-Tag: A high accuracy fiducial marker with strong occlusion resilience",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995544/12OmNynJMMC",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2018/5488/0/08621349",
"title": "Fiducial marker detection via deep learning approach for electron tomography",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2018/08621349/17D45WWzW6b",
"parentPublication": {
"id": "proceedings/bibm/2018/5488/0",
"title": "2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09072595",
"title": "TopoTag: A Robust and Scalable Topological Fiducial Marker System",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09072595/1jbj4gWAcZa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150618",
"title": "ArUcOmni: detection of highly reliable fiducial markers in panoramic images",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150618/1lPH30Y2Fqw",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09775211",
"articleId": "1Dqh2PmIooM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09779071",
"articleId": "1DvfKZ5Rgju",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"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": "13rRUxAAST8",
"doi": "10.1109/TVCG.2012.117",
"abstract": "Fluid flows are highly nonlinear and nonstationary, with turbulence occurring and developing at different length and time scales. In real-life observations, the multiscale flow generates different visual impacts depending on the distance to the viewer. We propose a new fluid simulation framework that adaptively allocates computational resources according to the viewer's position. First, a 3D empirical mode decomposition scheme is developed to obtain the velocity spectrum of the turbulent flow. Then, depending on the distance to the viewer, the fluid domain is divided into a sequence of nested simulation partitions. Finally, the multiscale fluid motions revealed in the velocity spectrum are distributed nonuniformly to these view-dependent partitions, and the mixed velocity fields defined on different partitions are solved separately using different grid sizes and time steps. The fluid flow is solved at different spatial-temporal resolutions, such that higher frequency motions closer to the viewer are solved at higher resolutions and vice versa. The new simulator better utilizes the computing power, producing visually plausible results with realistic fine-scale details in a more efficient way. It is particularly suitable for large scenes with the viewer inside the fluid domain. Also, as high-frequency fluid motions are distinguished from low-frequency motions in the simulation, the numerical dissipation is effectively reduced.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Fluid flows are highly nonlinear and nonstationary, with turbulence occurring and developing at different length and time scales. In real-life observations, the multiscale flow generates different visual impacts depending on the distance to the viewer. We propose a new fluid simulation framework that adaptively allocates computational resources according to the viewer's position. First, a 3D empirical mode decomposition scheme is developed to obtain the velocity spectrum of the turbulent flow. Then, depending on the distance to the viewer, the fluid domain is divided into a sequence of nested simulation partitions. Finally, the multiscale fluid motions revealed in the velocity spectrum are distributed nonuniformly to these view-dependent partitions, and the mixed velocity fields defined on different partitions are solved separately using different grid sizes and time steps. The fluid flow is solved at different spatial-temporal resolutions, such that higher frequency motions closer to the viewer are solved at higher resolutions and vice versa. The new simulator better utilizes the computing power, producing visually plausible results with realistic fine-scale details in a more efficient way. It is particularly suitable for large scenes with the viewer inside the fluid domain. Also, as high-frequency fluid motions are distinguished from low-frequency motions in the simulation, the numerical dissipation is effectively reduced.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Fluid flows are highly nonlinear and nonstationary, with turbulence occurring and developing at different length and time scales. In real-life observations, the multiscale flow generates different visual impacts depending on the distance to the viewer. We propose a new fluid simulation framework that adaptively allocates computational resources according to the viewer's position. First, a 3D empirical mode decomposition scheme is developed to obtain the velocity spectrum of the turbulent flow. Then, depending on the distance to the viewer, the fluid domain is divided into a sequence of nested simulation partitions. Finally, the multiscale fluid motions revealed in the velocity spectrum are distributed nonuniformly to these view-dependent partitions, and the mixed velocity fields defined on different partitions are solved separately using different grid sizes and time steps. The fluid flow is solved at different spatial-temporal resolutions, such that higher frequency motions closer to the viewer are solved at higher resolutions and vice versa. The new simulator better utilizes the computing power, producing visually plausible results with realistic fine-scale details in a more efficient way. It is particularly suitable for large scenes with the viewer inside the fluid domain. Also, as high-frequency fluid motions are distinguished from low-frequency motions in the simulation, the numerical dissipation is effectively reduced.",
"title": "View-Dependent Multiscale Fluid Simulation",
"normalizedTitle": "View-Dependent Multiscale Fluid Simulation",
"fno": "ttg2013020178",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Three Dimensional Displays",
"Computational Modeling",
"Adaptation Models",
"Numerical Models",
"Fluids",
"Solid Modeling",
"View Dependent Partition",
"Fluid Simulation",
"Hilbert Huang Transform",
"Fluid Velocity Spectrum",
"Flow Field Decomposition"
],
"authors": [
{
"givenName": null,
"surname": "Yue Gao",
"fullName": "Yue Gao",
"affiliation": "Dept. of Comput. Sci., Tsinghua Univ., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Chen-Feng Li",
"fullName": "Chen-Feng Li",
"affiliation": "Coll. of Eng., Swansea Univ., Swansea, UK",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Bo Ren",
"fullName": "Bo Ren",
"affiliation": "Dept. of Comput. Sci., Tsinghua Univ., Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Shi-Min Hu",
"fullName": "Shi-Min Hu",
"affiliation": "Dept. of Comput. Sci., Tsinghua Univ., Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2013-02-01 00:00:00",
"pubType": "trans",
"pages": "178-188",
"year": "2013",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icis/2017/5507/0/07960052",
"title": "Contained fluid simulation based on game engine",
"doi": null,
"abstractUrl": "/proceedings-article/icis/2017/07960052/12OmNAsBFO1",
"parentPublication": {
"id": "proceedings/icis/2017/5507/0",
"title": "2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2013/5001/0/06655759",
"title": "A Comparative Analysis of Fluid Simulation Methods Based on SPH",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2013/06655759/12OmNqBtiNf",
"parentPublication": {
"id": "proceedings/svr/2013/5001/0",
"title": "2013 XV Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2010/4080/4/05572732",
"title": "Fluid Temperature and Power Estimation of Geothermal Power Plants by a Simplified Numerical Model",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2010/05572732/12OmNqFa5pD",
"parentPublication": {
"id": "proceedings/icie/2010/4080/3",
"title": "Information Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2016/2303/0/2303a235",
"title": "Individual Time-Stepping for Rigid-Fluid Coupling of Particle Based Fluids",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2016/2303a235/12OmNvT2oZL",
"parentPublication": {
"id": "proceedings/cw/2016/2303/0",
"title": "2016 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2014/6636/0/6636a423",
"title": "Polymetallic Sulfide Particle Hydraulic Lifting Performance Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2014/6636a423/12OmNx6PiDq",
"parentPublication": {
"id": "proceedings/icicta/2014/6636/0",
"title": "2014 7th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/09707648",
"title": "Impulse Fluid Simulation",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/09707648/1APlBguxdSw",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcice/2022/6067/0/606700a037",
"title": "A Volume of Fluid Method for Simulation of Reservoir Area Landslide Surge Under Quasi-fluid Assumption",
"doi": null,
"abstractUrl": "/proceedings-article/jcice/2022/606700a037/1H0KkHIzDBC",
"parentPublication": {
"id": "proceedings/jcice/2022/6067/0",
"title": "2022 International Joint Conference on Information and Communication Engineering (JCICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdiime/2022/9009/0/900900a048",
"title": "Solid-Fluid Interaction Simulation System Based on SPH Unified Particle Framework",
"doi": null,
"abstractUrl": "/proceedings-article/icdiime/2022/900900a048/1Iz56eSpj3y",
"parentPublication": {
"id": "proceedings/icdiime/2022/9009/0",
"title": "2022 International Conference on 3D Immersion, Interaction and Multi-sensory Experiences (ICDIIME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a393",
"title": "Real-Time Viscoelastic Fluid Simulation and Solid Melting Process Based on AVR-SPH",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a393/1ap5BtapJ5u",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2020/9234/0/923400a045",
"title": "A Controllable Spring Force Based Method for Fluid Surface Disturbance Details Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2020/923400a045/1uGXV1Qs8IU",
"parentPublication": {
"id": "proceedings/icdh/2020/9234/0",
"title": "2020 8th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "ttg2013020189",
"articleId": "13rRUIJcWln",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTYesNI",
"name": "ttg2013020178s.avi",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2013020178s.avi",
"extension": "avi",
"size": "24 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvDqsVY",
"title": "June",
"year": "2019",
"issueNum": "06",
"idPrefix": "co",
"pubType": "magazine",
"volume": "52",
"label": "June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1axaIk2UoQE",
"doi": "10.1109/MC.2019.2908512",
"abstract": "In this issue, we take a look at quantum computing: what has been accomplished and what is its future. We present a collection of views about the realistic challenges facing the future of quantum computing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this issue, we take a look at quantum computing: what has been accomplished and what is its future. We present a collection of views about the realistic challenges facing the future of quantum computing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this issue, we take a look at quantum computing: what has been accomplished and what is its future. We present a collection of views about the realistic challenges facing the future of quantum computing.",
"title": "Quantum Realism",
"normalizedTitle": "Quantum Realism",
"fno": "08728103",
"hasPdf": true,
"idPrefix": "co",
"keywords": [
"Special Issues And Sections",
"Quantum Compuring",
"Quantum Mechanics",
"Computer Security"
],
"authors": [
{
"givenName": "Travis S.",
"surname": "Humble",
"fullName": "Travis S. Humble",
"affiliation": "Oak Ridge National Laboratory, Tennessee United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Erik P.",
"surname": "DeBenedictis",
"fullName": "Erik P. DeBenedictis",
"affiliation": "Sandia National Laboratories, Albuquerque, New Mexico United States",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2019-06-01 00:00:00",
"pubType": "mags",
"pages": "13-17",
"year": "2019",
"issn": "0018-9162",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "mags/ic/2022/01/09705639",
"title": "Quantum and Post-Moore’s Law Computing",
"doi": null,
"abstractUrl": "/magazine/ic/2022/01/09705639/1AO2fhjtZFS",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2019/06/08728092",
"title": "Exploring the Current State of Quantum Computing",
"doi": null,
"abstractUrl": "/magazine/co/2019/06/08728092/1axaDYM6JC8",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2019/06/08728085",
"title": "Practical Annealing-Based Quantum Computing",
"doi": null,
"abstractUrl": "/magazine/co/2019/06/08728085/1axaGd8qfxS",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2019/06/08896152",
"title": "Design of Quantum Computing Circuits",
"doi": null,
"abstractUrl": "/magazine/it/2019/06/08896152/1eS9Qm9sKo8",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qce/2020/8969/0/896900a323",
"title": "Quantum Computing for High-School Students An Experience Report",
"doi": null,
"abstractUrl": "/proceedings-article/qce/2020/896900a323/1p2VnYdbx5e",
"parentPublication": {
"id": "proceedings/qce/2020/8969/0",
"title": "2020 IEEE International Conference on Quantum Computing and Engineering (QCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itca/2020/0378/0/037800a467",
"title": "Application of Quantum Generative Adversarial Learning in Quantum Image Processing",
"doi": null,
"abstractUrl": "/proceedings-article/itca/2020/037800a467/1tpBfq3AXVS",
"parentPublication": {
"id": "proceedings/itca/2020/0378/0",
"title": "2020 2nd International Conference on Information Technology and Computer Application (ITCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mi/2021/05/09537179",
"title": "Special Issue on Quantum Computing",
"doi": null,
"abstractUrl": "/magazine/mi/2021/05/09537179/1wTiAL3FQ0E",
"parentPublication": {
"id": "mags/mi",
"title": "IEEE Micro",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2021/2882/0/288200a343",
"title": "Understanding Quantum Software Engineering Challenges An Empirical Study on Stack Exchange Forums and GitHub Issues",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2021/288200a343/1yNhcXpzRaE",
"parentPublication": {
"id": "proceedings/icsme/2021/2882/0",
"title": "2021 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2021/1681/0/168100a032",
"title": "A Uniform Quantum Computing Model based on Virtual Quantum Processors",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2021/168100a032/1yrHF5v1mne",
"parentPublication": {
"id": "proceedings/icws/2021/1681/0",
"title": "2021 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2021/1683/0/168300a456",
"title": "Quantum Computing for Supply Chain Finance",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2021/168300a456/1yymA1QkvNC",
"parentPublication": {
"id": "proceedings/scc/2021/1683/0",
"title": "2021 IEEE International Conference on Services Computing (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08728092",
"articleId": "1axaDYM6JC8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08728102",
"articleId": "1axaHzX4Xh6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WwsQ5M",
"doi": "10.1109/TVCG.2018.2865119",
"abstract": "Today's data-rich documents are often complex datasets in themselves, consisting of information in different formats such as text, figures, and data tables. These additional media augment the textual narrative in the document. However, the static layout of a traditional for-print document often impedes deep understanding of its content because of the need to navigate to access content scattered throughout the text. In this paper, we seek to facilitate enhanced comprehension of such documents through a contextual visualization technique that couples text content with data tables contained in the document. We parse the text content and data tables, cross-link the components using a keyword-based matching algorithm, and generate on-demand visualizations based on the reader's current focus within a document. We evaluate this technique in a user study comparing our approach to a traditional reading experience. Results from our study show that (1) participants comprehend the content better with tighter coupling of text and data, (2) the contextual visualizations enable participants to develop better summaries that capture the main data-rich insights within the document, and (3) overall, our method enables participants to develop a more detailed understanding of the document content.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Today's data-rich documents are often complex datasets in themselves, consisting of information in different formats such as text, figures, and data tables. These additional media augment the textual narrative in the document. However, the static layout of a traditional for-print document often impedes deep understanding of its content because of the need to navigate to access content scattered throughout the text. In this paper, we seek to facilitate enhanced comprehension of such documents through a contextual visualization technique that couples text content with data tables contained in the document. We parse the text content and data tables, cross-link the components using a keyword-based matching algorithm, and generate on-demand visualizations based on the reader's current focus within a document. We evaluate this technique in a user study comparing our approach to a traditional reading experience. Results from our study show that (1) participants comprehend the content better with tighter coupling of text and data, (2) the contextual visualizations enable participants to develop better summaries that capture the main data-rich insights within the document, and (3) overall, our method enables participants to develop a more detailed understanding of the document content.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Today's data-rich documents are often complex datasets in themselves, consisting of information in different formats such as text, figures, and data tables. These additional media augment the textual narrative in the document. However, the static layout of a traditional for-print document often impedes deep understanding of its content because of the need to navigate to access content scattered throughout the text. In this paper, we seek to facilitate enhanced comprehension of such documents through a contextual visualization technique that couples text content with data tables contained in the document. We parse the text content and data tables, cross-link the components using a keyword-based matching algorithm, and generate on-demand visualizations based on the reader's current focus within a document. We evaluate this technique in a user study comparing our approach to a traditional reading experience. Results from our study show that (1) participants comprehend the content better with tighter coupling of text and data, (2) the contextual visualizations enable participants to develop better summaries that capture the main data-rich insights within the document, and (3) overall, our method enables participants to develop a more detailed understanding of the document content.",
"title": "Elastic Documents: Coupling Text and Tables through Contextual Visualizations for Enhanced Document Reading",
"normalizedTitle": "Elastic Documents: Coupling Text and Tables through Contextual Visualizations for Enhanced Document Reading",
"fno": "08440810",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Collections Of Physical Data",
"Data Visualisation",
"Information Retrieval",
"Text Analysis",
"Elastic Documents",
"Coupling Text",
"Enhanced Document Reading",
"Data Tables",
"Access Content",
"Contextual Visualization Technique",
"Print Document",
"Keyword Based Matching Algorithm",
"Data Visualization",
"Visualization",
"Layout",
"Portable Document Format",
"Media",
"Hurricanes",
"Couplings",
"Document Reading",
"Contextual Visualizations",
"Visual Aids",
"Comprehension",
"Summarization"
],
"authors": [
{
"givenName": "Sriram Karthik",
"surname": "Badam",
"fullName": "Sriram Karthik Badam",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zhicheng",
"surname": "Liu",
"fullName": "Zhicheng Liu",
"affiliation": "Adobe Research, Seattle, WA, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Niklas",
"surname": "Elmqvist",
"fullName": "Niklas Elmqvist",
"affiliation": "University of Maryland, College Park, MD, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "661-671",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/eisic/2013/5062/0/06657132",
"title": "Cross Domain Assessment of Document to HTML Conversion Tools to Quantify Text and Structural Loss during Document Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/eisic/2013/06657132/12OmNBqMDiz",
"parentPublication": {
"id": "proceedings/eisic/2013/5062/0",
"title": "2013 European Intelligence and Security Informatics Conference (EISIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2016/4229/0/07559577",
"title": "PDFFigures 2.0: Mining figures from research papers",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2016/07559577/12OmNwE9OBq",
"parentPublication": {
"id": "proceedings/jcdl/2016/4229/0",
"title": "2016 IEEE/ACM Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2016/8942/0/8942a209",
"title": "Using Video Tutorials to Reduce Cognitive Load and Frustration for Early Learners of 3D Maya: A Comparative Case Study Discussion on Knowledge Visualisation Modes",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a209/12OmNwtn3Ed",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2013/4999/0/06628853",
"title": "ICDAR 2013 Table Competition",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2013/06628853/12OmNx9FhSD",
"parentPublication": {
"id": "proceedings/icdar/2013/4999/0",
"title": "2013 12th International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spi/2008/2317/0/04558397",
"title": "[PDF Not Yet Available In IEEE Xplore]",
"doi": null,
"abstractUrl": "/proceedings-article/spi/2008/04558397/12OmNyeWdMx",
"parentPublication": {
"id": "proceedings/spi/2008/2317/0",
"title": "IEEE Workshop on Signal Propagation on Interconnects (SPI 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2017/3586/1/3586b162",
"title": "DeepDeSRT: Deep Learning for Detection and Structure Recognition of Tables in Document Images",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2017/3586b162/12OmNyuPL96",
"parentPublication": {
"id": "proceedings/icdar/2017/3586/1",
"title": "2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04409154",
"title": "[PDF Not Yet Available In IEEE Xplore]",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04409154/12OmNyugyME",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdarw/2019/5054/5/505405a158",
"title": "Table Understanding in Structured Documents",
"doi": null,
"abstractUrl": "/proceedings-article/icdarw/2019/505405a158/1eLygwQb0pa",
"parentPublication": {
"id": "icdarw/2019/5054/5",
"title": "2019 International Conference on Document Analysis and Recognition Workshops (ICDARW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2019/3014/0/301400a051",
"title": "Graphical Object Detection in Document Images",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2019/301400a051/1h81zeprCda",
"parentPublication": {
"id": "proceedings/icdar/2019/3014/0",
"title": "2019 International Conference on Document Analysis and Recognition (ICDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ickg/2020/8156/0/09194497",
"title": "An OpenCV-based Framework for Table Information Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/ickg/2020/09194497/1n2nkAU06mk",
"parentPublication": {
"id": "proceedings/ickg/2020/8156/0",
"title": "2020 IEEE International Conference on Knowledge Graph (ICKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08454904",
"articleId": "17D45Xh13vE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440860",
"articleId": "17D45Vw15v5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZon61xLpK",
"doi": "10.1109/TVCG.2022.3209354",
"abstract": "Tabular visualization techniques integrate visual representations with tabular data to avoid additional cognitive load caused by splitting users' attention. However, most of the existing studies focus on simple flat tables instead of hierarchical tables, whose complex structure limits the expressiveness of visualization results and affects users' efficiency in visualization construction. We present HiTailor, a technique for presenting and exploring hierarchical tables. HiTailor constructs an abstract model, which defines row/column headings as biclustering and hierarchical structures. Based on our abstract model, we identify three pairs of operators, Swap/Transpose, ToStacked/ToLinear, Fold/Unfold, for transformations of hierarchical tables to support users' comprehensive explorations. After transformation, users can specify a cell or block of interest in hierarchical tables as a TableUnit for visualization, and HiTailor recommends other related TableUnits according to the abstract model using different mechanisms. We demonstrate the usability of the HiTailor system through a comparative study and a case study with domain experts, showing that HiTailor can present and explore hierarchical tables from different viewpoints. HiTailor is available at <uri>https://github.com/bitvis2021/HiTailor</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Tabular visualization techniques integrate visual representations with tabular data to avoid additional cognitive load caused by splitting users' attention. However, most of the existing studies focus on simple flat tables instead of hierarchical tables, whose complex structure limits the expressiveness of visualization results and affects users' efficiency in visualization construction. We present HiTailor, a technique for presenting and exploring hierarchical tables. HiTailor constructs an abstract model, which defines row/column headings as biclustering and hierarchical structures. Based on our abstract model, we identify three pairs of operators, Swap/Transpose, ToStacked/ToLinear, Fold/Unfold, for transformations of hierarchical tables to support users' comprehensive explorations. After transformation, users can specify a cell or block of interest in hierarchical tables as a TableUnit for visualization, and HiTailor recommends other related TableUnits according to the abstract model using different mechanisms. We demonstrate the usability of the HiTailor system through a comparative study and a case study with domain experts, showing that HiTailor can present and explore hierarchical tables from different viewpoints. HiTailor is available at <uri>https://github.com/bitvis2021/HiTailor</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Tabular visualization techniques integrate visual representations with tabular data to avoid additional cognitive load caused by splitting users' attention. However, most of the existing studies focus on simple flat tables instead of hierarchical tables, whose complex structure limits the expressiveness of visualization results and affects users' efficiency in visualization construction. We present HiTailor, a technique for presenting and exploring hierarchical tables. HiTailor constructs an abstract model, which defines row/column headings as biclustering and hierarchical structures. Based on our abstract model, we identify three pairs of operators, Swap/Transpose, ToStacked/ToLinear, Fold/Unfold, for transformations of hierarchical tables to support users' comprehensive explorations. After transformation, users can specify a cell or block of interest in hierarchical tables as a TableUnit for visualization, and HiTailor recommends other related TableUnits according to the abstract model using different mechanisms. We demonstrate the usability of the HiTailor system through a comparative study and a case study with domain experts, showing that HiTailor can present and explore hierarchical tables from different viewpoints. HiTailor is available at https://github.com/bitvis2021/HiTailor.",
"title": "HiTailor: Interactive Transformation and Visualization for Hierarchical Tabular Data",
"normalizedTitle": "HiTailor: Interactive Transformation and Visualization for Hierarchical Tabular Data",
"fno": "09903293",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Cognition",
"Data Visualisation",
"Pattern Clustering",
"Flat Tables",
"Fold Unfold Operator",
"Hierarchical Structures",
"Hierarchical Tables",
"Hierarchical Tabular Data",
"Hi Tailor",
"Splitting Users",
"Swap Transpose Operator",
"Table Unit",
"Tabular Visualization Techniques",
"Tostacked Tolinear Operator",
"Visual Representations",
"Visualization Construction",
"Data Visualization",
"Transforms",
"Computer Architecture",
"TV",
"Prototypes",
"Visualization",
"Microprocessors",
"Data Transformation",
"Tabular Data",
"Hierarchical Tabular Data",
"Tabular Visualization"
],
"authors": [
{
"givenName": "Guozheng",
"surname": "Li",
"fullName": "Guozheng Li",
"affiliation": "Beijing Institute of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Runfei",
"surname": "Li",
"fullName": "Runfei Li",
"affiliation": "Beijing Institute of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zicheng",
"surname": "Wang",
"fullName": "Zicheng Wang",
"affiliation": "Beijing Institute of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Chi Harold",
"surname": "Liu",
"fullName": "Chi Harold Liu",
"affiliation": "Beijing Institute of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Min",
"surname": "Lu",
"fullName": "Min Lu",
"affiliation": "Shenzhen University, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guoren",
"surname": "Wang",
"fullName": "Guoren Wang",
"affiliation": "Beijing Institute of Technology, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "139-148",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/dexa/1998/8353/0/83530030",
"title": "Towards Logical Analysis of Tabular Rule-Based Systems",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/1998/83530030/12OmNAYoKiB",
"parentPublication": {
"id": "proceedings/dexa/1998/8353/0",
"title": "Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2015/6879/0/07156360",
"title": "Variational circular treemaps for interactive visualization of hierarchical data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2015/07156360/12OmNBpmDGk",
"parentPublication": {
"id": "proceedings/pacificvis/2015/6879/0",
"title": "2015 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icndc/2013/3046/0/3046a151",
"title": "Pragmatic Tabular Specification Method for Interactive Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icndc/2013/3046a151/12OmNvzJG53",
"parentPublication": {
"id": "proceedings/icndc/2013/3046/0",
"title": "2013 Fourth International Conference on Networking and Distributed Computing (ICNDC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/formalise/2015/7043/0/7043a047",
"title": "A Methodology for the Simplification of Tabular Designs in Model-Based Development",
"doi": null,
"abstractUrl": "/proceedings-article/formalise/2015/7043a047/12OmNzlUKlg",
"parentPublication": {
"id": "proceedings/formalise/2015/7043/0",
"title": "2015 IEEE/ACM 3rd FME Workshop on Formal Methods in Software Engineering (FormaliSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09908529",
"title": "Rigel: Transforming Tabular Data by Declarative Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09908529/1HbasXGQDEk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2022/5417/0/541700a470",
"title": "Overview of Interactive Visualization Methods",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata-cybermatics/2022/541700a470/1HcmV9IYE9O",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2022/5417/0",
"title": "2022 IEEE International Conferences on Internet of Things (iThings) and IEEE Green Computing & Communications (GreenCom) and IEEE Cyber, Physical & Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2019/3094/0/309400a367",
"title": "Interactive Traceability Links Visualization using Hierarchical Trace Map",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2019/309400a367/1fHlFbzJir6",
"parentPublication": {
"id": "proceedings/icsme/2019/3094/0",
"title": "2019 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2020/9134/0/913400a166",
"title": "Evaluation of Hierarchical Visualization for Large and Small Hierarchies",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2020/913400a166/1rSR8i3DUEU",
"parentPublication": {
"id": "proceedings/iv/2020/9134/0",
"title": "2020 24th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2021/3931/0/393100a011",
"title": "ADVISor: Automatic Visualization Answer for Natural-Language Question on Tabular Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2021/393100a011/1tTtqdxk10I",
"parentPublication": {
"id": "proceedings/pacificvis/2021/3931/0",
"title": "2021 IEEE 14th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlui/2021/1372/0/137200a012",
"title": "SHIM: Semantic Hierarchical clustering with Interactive Machine learning",
"doi": null,
"abstractUrl": "/proceedings-article/mlui/2021/137200a012/1yNhiLP2gLu",
"parentPublication": {
"id": "proceedings/mlui/2021/1372/0",
"title": "2021 IEEE Workshop on Machine Learning from User Interactions (MLUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09908529",
"articleId": "1HbasXGQDEk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09914804",
"articleId": "1Hmgc5h7Clq",
"__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": "1BBtNDKgNFe",
"doi": "10.1109/TVCG.2022.3158093",
"abstract": "Scatterplots overlayed with a nonlinear model enable visual estimation of model-data fit. Although statistical fit is calculated using vertical distances, viewers subjective fit is often based on shortest distances. Our results suggest that adding vertical lines (lollipops) supports more accurate fit estimation in the steep area of model curves (https://osf.io/fybx5/).",
"abstracts": [
{
"abstractType": "Regular",
"content": "Scatterplots overlayed with a nonlinear model enable visual estimation of model-data fit. Although statistical fit is calculated using vertical distances, viewers subjective fit is often based on shortest distances. Our results suggest that adding vertical lines (lollipops) supports more accurate fit estimation in the steep area of model curves (https://osf.io/fybx5/).",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Scatterplots overlayed with a nonlinear model enable visual estimation of model-data fit. Although statistical fit is calculated using vertical distances, viewers subjective fit is often based on shortest distances. Our results suggest that adding vertical lines (lollipops) supports more accurate fit estimation in the steep area of model curves (https://osf.io/fybx5/).",
"title": "Lollipops Help Align Visual and Statistical Fit Estimates in Scatterplots with Nonlinear Models",
"normalizedTitle": "Lollipops Help Align Visual and Statistical Fit Estimates in Scatterplots with Nonlinear Models",
"fno": "09732236",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Models",
"Estimation",
"Computational Modeling",
"Visualization",
"Data Visualization",
"Psychology",
"Task Analysis",
"Information Visualization",
"Perception And Psychophysics",
"Theory And Models"
],
"authors": [
{
"givenName": "Daniel",
"surname": "Reimann",
"fullName": "Daniel Reimann",
"affiliation": "Psychology, FernUniversität in Hagen, 58097 Hagen, NRW, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Nilam",
"surname": "Ram",
"fullName": "Nilam Ram",
"affiliation": "Departments of Communication and Psychology, Stanford University, 6429 Stanford, California, United States",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Robert",
"surname": "Gaschler",
"fullName": "Robert Gaschler",
"affiliation": "Psychology, FernUniversität in Hagen, 58097 Hagen, NRW, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2022-03-01 00:00:00",
"pubType": "trans",
"pages": "1-1",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2016/0842/0/07460052",
"title": "A hybrid projection to widen the vertical field of view with large screens to improve the perception of personal space in architectural project review",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2016/07460052/12OmNC4eSwS",
"parentPublication": {
"id": "proceedings/3dui/2016/0842/0",
"title": "2016 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09904433",
"title": "Evaluating the Use of Uncertainty Visualisations for Imputations of Data Missing At Random in Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09904433/1H1gkkbe0hy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/01/08805427",
"title": "Biased Average Position Estimates in Line and Bar Graphs: Underestimation, Overestimation, and Perceptual Pull",
"doi": null,
"abstractUrl": "/journal/tg/2020/01/08805427/1cG4xtnomys",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/2/260702a036",
"title": "A Proposal of SDN-FIT System to Evaluate Wide-Area Distributed Applications Based on Exhaustive FIT Scenario Generation",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260702a036/1cYipFcvorK",
"parentPublication": {
"id": "compsac/2019/2607/2",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata/2019/2980/0/298000a729",
"title": "Delayed Best-Fit Task Scheduling to Reduce Energy Consumption in Cloud Data Centers",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata/2019/298000a729/1ehBFLparPq",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata/2019/2980/0",
"title": "2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2019/4941/0/08933670",
"title": "Disentangled Representation of Data Distributions in Scatterplots",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2019/08933670/1fTgGJvQB9e",
"parentPublication": {
"id": "proceedings/vis/2019/4941/0",
"title": "2019 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600a335",
"title": "SizeNet: Weakly Supervised Learning of Visual Size and Fit in Fashion Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600a335/1iTvuQ1sGnm",
"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": "trans/tg/2021/02/09226404",
"title": "Evaluation of Sampling Methods for Scatterplots",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09226404/1nYqk0TjyeY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/09/09325067",
"title": "Visual Model Fit Estimation in Scatterplots: Influence of Amount and Decentering of Noise",
"doi": null,
"abstractUrl": "/journal/tg/2021/09/09325067/1qnQCmbSzUA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2021/1838/0/255600a095",
"title": "Detection Thresholds with Joint Horizontal and Vertical Gains in Redirected Jumping",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2021/255600a095/1tuAwxIGXQI",
"parentPublication": {
"id": "proceedings/vr/2021/1838/0",
"title": "2021 IEEE Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09729627",
"articleId": "1Bya9m82uzu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09733261",
"articleId": "1BENJyPkx5S",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwpGgJz",
"title": "Sept.",
"year": "2012",
"issueNum": "09",
"idPrefix": "tp",
"pubType": "journal",
"volume": "34",
"label": "Sept.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwjXZTc",
"doi": "10.1109/TPAMI.2012.153",
"abstract": "The nine award-winning papers in this special section were presented at the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010)that was held 13-18 June 2010 in San Francisco, CA.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The nine award-winning papers in this special section were presented at the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010)that was held 13-18 June 2010 in San Francisco, CA.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The nine award-winning papers in this special section were presented at the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010)that was held 13-18 June 2010 in San Francisco, CA.",
"title": "Special Editors' Introduction to the Special Issue on Award-Winning Papers from the IEEE Conference on Computer Vision and Pattern Recognition 2010 (CVPR 2010)",
"normalizedTitle": "Special Editors' Introduction to the Special Issue on Award-Winning Papers from the IEEE Conference on Computer Vision and Pattern Recognition 2010 (CVPR 2010)",
"fno": "ttp2012091665",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Special Issues And Sections",
"Meetings",
"Computer Vision",
"Pattern Recognition",
"Awards"
],
"authors": [
{
"givenName": "Trevor",
"surname": "Darrell",
"fullName": "Trevor Darrell",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Hogg",
"fullName": "David Hogg",
"affiliation": "IEEE Computer Society",
"__typename": "ArticleAuthorType"
},
{
"givenName": "David",
"surname": "Jacobs",
"fullName": "David Jacobs",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "09",
"pubDate": "2012-09-01 00:00:00",
"pubType": "trans",
"pages": "1665-1666",
"year": "2012",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "ttp20120900c2",
"articleId": "13rRUB6Sq1C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttp2012091667",
"articleId": "13rRUx0gew8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclny",
"title": "August",
"year": "1992",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "14",
"label": "August",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvyaa0",
"doi": "10.1109/34.149594",
"abstract": "Curvature sampling of arbitrary, fully described 3-D objects (e.g. tomographic medical images) is difficult because of surface patch parameterization problems. Five practical solutions are presented and characterized-the Sander-Zucker approach, two novel methods based on direct surface mapping, a piecewise linear manifold technique, and a turtle geometry method. One of the new methods, called the cross patch (CP) method, is shown to be very fast, robust in the presence of noise, and is always based on a proper surface parameterization, provided the perturbations of the surface over the patch neighborhood are isotropically distributed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Curvature sampling of arbitrary, fully described 3-D objects (e.g. tomographic medical images) is difficult because of surface patch parameterization problems. Five practical solutions are presented and characterized-the Sander-Zucker approach, two novel methods based on direct surface mapping, a piecewise linear manifold technique, and a turtle geometry method. One of the new methods, called the cross patch (CP) method, is shown to be very fast, robust in the presence of noise, and is always based on a proper surface parameterization, provided the perturbations of the surface over the patch neighborhood are isotropically distributed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Curvature sampling of arbitrary, fully described 3-D objects (e.g. tomographic medical images) is difficult because of surface patch parameterization problems. Five practical solutions are presented and characterized-the Sander-Zucker approach, two novel methods based on direct surface mapping, a piecewise linear manifold technique, and a turtle geometry method. One of the new methods, called the cross patch (CP) method, is shown to be very fast, robust in the presence of noise, and is always based on a proper surface parameterization, provided the perturbations of the surface over the patch neighborhood are isotropically distributed.",
"title": "Surface Parametrization and Curvature Measurement of Arbitrary 3-D Objects: Five Practical Methods",
"normalizedTitle": "Surface Parametrization and Curvature Measurement of Arbitrary 3-D Objects: Five Practical Methods",
"fno": "i0833",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"3 D Images Curvature Sampling Picture Processing Shape Recognition Curvature Measurement Surface Patch Parameterization Sander Zucker Approach Direct Surface Mapping Piecewise Linear Manifold Technique Turtle Geometry Method Cross Patch Pattern Recognition Picture Processing"
],
"authors": [
{
"givenName": "E.M.",
"surname": "Stokely",
"fullName": "E.M. Stokely",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "S.Y.",
"surname": "Wu",
"fullName": "S.Y. Wu",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "1992-08-01 00:00:00",
"pubType": "trans",
"pages": "833-840",
"year": "1992",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "i0826",
"articleId": "13rRUwjXZKr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "i0840",
"articleId": "13rRUwcS1DW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNx8fieR",
"title": "March",
"year": "2012",
"issueNum": "03",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "March",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUx0gepW",
"doi": "10.1109/TVCG.2011.129",
"abstract": "Multitouch displays represent a promising technology for the display and manipulation of data. While the manipulation of 2D data has been widely explored, 3D manipulation with multitouch displays remains largely unexplored. Based on an analysis of the integration and separation of degrees of freedom, we propose a taxonomy for 3D manipulation techniques with multitouch displays. Using that taxonomy, we introduce Depth-Separated Screen-Space (DS3), a new 3D manipulation technique based on the separation of translation and rotation. In a controlled experiment, we compared DS3 with Sticky Tools and Screen-Space. Results show that separating the control of translation and rotation significantly affects performance for 3D manipulation, with DS3 performing faster than the two other techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multitouch displays represent a promising technology for the display and manipulation of data. While the manipulation of 2D data has been widely explored, 3D manipulation with multitouch displays remains largely unexplored. Based on an analysis of the integration and separation of degrees of freedom, we propose a taxonomy for 3D manipulation techniques with multitouch displays. Using that taxonomy, we introduce Depth-Separated Screen-Space (DS3), a new 3D manipulation technique based on the separation of translation and rotation. In a controlled experiment, we compared DS3 with Sticky Tools and Screen-Space. Results show that separating the control of translation and rotation significantly affects performance for 3D manipulation, with DS3 performing faster than the two other techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multitouch displays represent a promising technology for the display and manipulation of data. While the manipulation of 2D data has been widely explored, 3D manipulation with multitouch displays remains largely unexplored. Based on an analysis of the integration and separation of degrees of freedom, we propose a taxonomy for 3D manipulation techniques with multitouch displays. Using that taxonomy, we introduce Depth-Separated Screen-Space (DS3), a new 3D manipulation technique based on the separation of translation and rotation. In a controlled experiment, we compared DS3 with Sticky Tools and Screen-Space. Results show that separating the control of translation and rotation significantly affects performance for 3D manipulation, with DS3 performing faster than the two other techniques.",
"title": "Integrality and Separability of Multitouch Interaction Techniques in 3D Manipulation Tasks",
"normalizedTitle": "Integrality and Separability of Multitouch Interaction Techniques in 3D Manipulation Tasks",
"fno": "ttg2012030369",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Touch Sensitive Screens",
"Human Computer Interaction",
"Three Dimensional Displays",
"Sticky Tools",
"Integrality",
"Separability",
"Multitouch Interaction Techniques",
"3 D Manipulation Tasks",
"Multitouch Displays",
"2 D Data",
"Degrees Of Freedom",
"Taxonomy",
"3 D Manipulation Techniques",
"Depth Separated Screen Space",
"DS 3",
"Controlled Experiment",
"Three Dimensional Displays",
"Measurement",
"Taxonomy",
"Visualization",
"Jacobian Matrices",
"Humans",
"Mice",
"DOF Separation",
"Multitouch Displays",
"3 D Manipulation Task",
"Direct Manipulation"
],
"authors": [
{
"givenName": "A.",
"surname": "Martinet",
"fullName": "A. Martinet",
"affiliation": "Batiment IRCICA, Villeneuve-d'Ascq, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "G.",
"surname": "Casiez",
"fullName": "G. Casiez",
"affiliation": "Batiment IRCICA, Villeneuve-d'Ascq, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "L.",
"surname": "Grisoni",
"fullName": "L. Grisoni",
"affiliation": "Batiment IRCICA, Villeneuve-d'Ascq, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2012-03-01 00:00:00",
"pubType": "trans",
"pages": "369-380",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2006/0225/0/02250069",
"title": "SkeweR: a 3D Interaction Technique for 2-User Collaborative Manipulation of Objects in Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2006/02250069/12OmNBV9Ibb",
"parentPublication": {
"id": "proceedings/3dui/2006/0225/0",
"title": "3D User Interfaces (3DUI'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"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/3dui/2011/0063/0/05759233",
"title": "3fMT - A technique for camera manipulation in 3D space with a multitouch display",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2011/05759233/12OmNqzcvLx",
"parentPublication": {
"id": "proceedings/3dui/2011/0063/0",
"title": "2011 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/c5/2012/1009/0/06195218",
"title": "Using the Phantogram Technique for a Collaborative Stereoscopic Multitouch Tabletop Game",
"doi": null,
"abstractUrl": "/proceedings-article/c5/2012/06195218/12OmNxRnvSa",
"parentPublication": {
"id": "proceedings/c5/2012/1009/0",
"title": "Tenth International Conference on Creating, Connecting and Collaborating through Computing (C5 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2010/6846/0/05444715",
"title": "A multi-touch enabled human-transporter metaphor for virtual 3D traveling",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2010/05444715/12OmNxwENI3",
"parentPublication": {
"id": "proceedings/3dui/2010/6846/0",
"title": "2010 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2016/0842/0/07460025",
"title": "Indirect touch manipulation for interaction with stereoscopic displays",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2016/07460025/12OmNxwENpw",
"parentPublication": {
"id": "proceedings/3dui/2016/0842/0",
"title": "2016 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2014/3624/0/06798866",
"title": "Poster: Exploring the integrality and separability of the Leap Motion Controller for direct manipulation 3D interaction",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2014/06798866/12OmNyvoXhi",
"parentPublication": {
"id": "proceedings/3dui/2014/3624/0",
"title": "2014 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08447554",
"title": "RST 3D: A Comprehensive Gesture Set for Multitouch 3D Navigation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08447554/13bd1eSlyu5",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2012/09/mco2012090080",
"title": "Multitouching the Fourth Dimension",
"doi": null,
"abstractUrl": "/magazine/co/2012/09/mco2012090080/13rRUx0geD3",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101614",
"title": "Interactive Slice WIM: Navigating and Interrogating Volume Data Sets Using a Multisurface, Multitouch VR Interface",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101614/13rRUxlgy3E",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012030381",
"articleId": "13rRUy0qnLF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012030394",
"articleId": "13rRUwfZC0d",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1EECwg7RIqY",
"title": "Aug.",
"year": "2022",
"issueNum": "08",
"idPrefix": "tp",
"pubType": "journal",
"volume": "44",
"label": "Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1rPt5kyZYaI",
"doi": "10.1109/TPAMI.2021.3065086",
"abstract": "Lung cancer is the most common cause of cancer death worldwide. A timely diagnosis of the pulmonary nodules makes it possible to detect lung cancer in the early stage, and thoracic computed tomography (CT) provides a convenient way to diagnose nodules. However, it is hard even for experienced doctors to distinguish them from the massive CT slices. The currently existing nodule datasets are limited in both scale and category, which is insufficient and greatly restricts its applications. In this paper, we collect the largest and most diverse dataset named PN9 for pulmonary nodule detection by far. Specifically, it contains 8,798 CT scans and 40,439 annotated nodules from 9 common classes. We further propose a slice-aware network (SANet) for pulmonary nodule detection. A slice grouped non-local (SGNL) module is developed to capture long-range dependencies among any positions and any channels of one slice group in the feature map. And we introduce a 3D region proposal network to generate pulmonary nodule candidates with high sensitivity, while this detection stage usually comes with many false positives. Subsequently, a false positive reduction module (FPR) is proposed by using the multi-scale feature maps. To verify the performance of SANet and the significance of PN9, we perform extensive experiments compared with several state-of-the-art 2D CNN-based and 3D CNN-based detection methods. Promising evaluation results on PN9 prove the effectiveness of our proposed SANet. The dataset and source code is available at <uri>https://mmcheng.net/SANet/</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Lung cancer is the most common cause of cancer death worldwide. A timely diagnosis of the pulmonary nodules makes it possible to detect lung cancer in the early stage, and thoracic computed tomography (CT) provides a convenient way to diagnose nodules. However, it is hard even for experienced doctors to distinguish them from the massive CT slices. The currently existing nodule datasets are limited in both scale and category, which is insufficient and greatly restricts its applications. In this paper, we collect the largest and most diverse dataset named PN9 for pulmonary nodule detection by far. Specifically, it contains 8,798 CT scans and 40,439 annotated nodules from 9 common classes. We further propose a slice-aware network (SANet) for pulmonary nodule detection. A slice grouped non-local (SGNL) module is developed to capture long-range dependencies among any positions and any channels of one slice group in the feature map. And we introduce a 3D region proposal network to generate pulmonary nodule candidates with high sensitivity, while this detection stage usually comes with many false positives. Subsequently, a false positive reduction module (FPR) is proposed by using the multi-scale feature maps. To verify the performance of SANet and the significance of PN9, we perform extensive experiments compared with several state-of-the-art 2D CNN-based and 3D CNN-based detection methods. Promising evaluation results on PN9 prove the effectiveness of our proposed SANet. The dataset and source code is available at <uri>https://mmcheng.net/SANet/</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Lung cancer is the most common cause of cancer death worldwide. A timely diagnosis of the pulmonary nodules makes it possible to detect lung cancer in the early stage, and thoracic computed tomography (CT) provides a convenient way to diagnose nodules. However, it is hard even for experienced doctors to distinguish them from the massive CT slices. The currently existing nodule datasets are limited in both scale and category, which is insufficient and greatly restricts its applications. In this paper, we collect the largest and most diverse dataset named PN9 for pulmonary nodule detection by far. Specifically, it contains 8,798 CT scans and 40,439 annotated nodules from 9 common classes. We further propose a slice-aware network (SANet) for pulmonary nodule detection. A slice grouped non-local (SGNL) module is developed to capture long-range dependencies among any positions and any channels of one slice group in the feature map. And we introduce a 3D region proposal network to generate pulmonary nodule candidates with high sensitivity, while this detection stage usually comes with many false positives. Subsequently, a false positive reduction module (FPR) is proposed by using the multi-scale feature maps. To verify the performance of SANet and the significance of PN9, we perform extensive experiments compared with several state-of-the-art 2D CNN-based and 3D CNN-based detection methods. Promising evaluation results on PN9 prove the effectiveness of our proposed SANet. The dataset and source code is available at https://mmcheng.net/SANet/.",
"title": "SANet: A Slice-Aware Network for Pulmonary Nodule Detection",
"normalizedTitle": "SANet: A Slice-Aware Network for Pulmonary Nodule Detection",
"fno": "09373930",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Cancer",
"Computerised Tomography",
"Convolutional Neural Nets",
"Image Enhancement",
"Lung",
"Medical Image Processing",
"Cancer Death Worldwide",
"Lung Cancer",
"Massive CT Slices",
"PN 9",
"Pulmonary Nodule Detection",
"Slice Aware Network",
"CT Scans",
"SA Net",
"3 D CNN Based Detection",
"Thoracic Computed Tomography",
"Slice Grouped Nonlocal Module",
"Positive Reduction Module",
"Multiscale Feature Maps",
"2 D CNN Based Detection",
"Lung",
"Three Dimensional Displays",
"Computed Tomography",
"Two Dimensional Displays",
"Feature Extraction",
"Proposals",
"Object Detection",
"Pulmonary Nodule Detection",
"Nodule Dataset",
"Slice Grouped Non Local",
"False Positive Reduction"
],
"authors": [
{
"givenName": "Jie",
"surname": "Mei",
"fullName": "Jie Mei",
"affiliation": "TKLNDST, College of Computer Science, Nankai University, Tianjin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ming-Ming",
"surname": "Cheng",
"fullName": "Ming-Ming Cheng",
"affiliation": "TKLNDST, College of Computer Science, Nankai University, Tianjin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gang",
"surname": "Xu",
"fullName": "Gang Xu",
"affiliation": "TKLNDST, College of Computer Science, Nankai University, Tianjin, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lan-Ruo",
"surname": "Wan",
"fullName": "Lan-Ruo Wan",
"affiliation": "InferVision, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Huan",
"surname": "Zhang",
"fullName": "Huan Zhang",
"affiliation": "InferVision, Beijing, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "08",
"pubDate": "2022-08-01 00:00:00",
"pubType": "trans",
"pages": "4374-4387",
"year": "2022",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/acomp/2017/0607/0/0607a137",
"title": "A Study of Pulmonary Nodules from Multi-slice Computed Tomography Using 3-D Structure",
"doi": null,
"abstractUrl": "/proceedings-article/acomp/2017/0607a137/12OmNAJ4pfK",
"parentPublication": {
"id": "proceedings/acomp/2017/0607/0",
"title": "2017 International Conference on Advanced Computing and Applications (ACOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2015/6775/0/6775a060",
"title": "Evaluating Margin Sharpness Analysis on Similar Pulmonary Nodule Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2015/6775a060/12OmNqIQS0P",
"parentPublication": {
"id": "proceedings/cbms/2015/6775/0",
"title": "2015 IEEE 28th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2018/4886/0/488601a673",
"title": "DeepLung: Deep 3D Dual Path Nets for Automated Pulmonary Nodule Detection and Classification",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2018/488601a673/12OmNvmG80J",
"parentPublication": {
"id": "proceedings/wacv/2018/4886/0",
"title": "2018 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccms/2010/3941/1/3941a481",
"title": "A Study of Pulmonary Nodule Detection in Three-Dimensional Thoracic CT Scans",
"doi": null,
"abstractUrl": "/proceedings-article/iccms/2010/3941a481/12OmNyoAA3j",
"parentPublication": {
"id": "proceedings/iccms/2010/3941/3",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08546106",
"title": "Spatial Pyramid Dilated Network for Pulmonary Nodule Malignancy Classification",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08546106/17D45WcjjQw",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2018/5500/0/550000a402",
"title": "Pulmonary Nodule Classification and Recognition Based on Sparse Representation Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2018/550000a402/17D45Wuc38b",
"parentPublication": {
"id": "proceedings/icisce/2018/5500/0",
"title": "2018 5th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669737",
"title": "Efficient False Positive Reduction Method for Early Pulmonary Nodules Detection in Physical Examination",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669737/1A9Whfsfalq",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbase/2021/2709/0/270900a383",
"title": "Imageological Examination of Pulmonary Nodule Detection",
"doi": null,
"abstractUrl": "/proceedings-article/icbase/2021/270900a383/1AH850LaFLq",
"parentPublication": {
"id": "proceedings/icbase/2021/2709/0",
"title": "2021 2nd International Conference on Big Data & Artificial Intelligence & Software Engineering (ICBASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiam/2022/6399/0/639900a677",
"title": "Pulmonary Nodule Detection Algorithm Based on YOLOv3",
"doi": null,
"abstractUrl": "/proceedings-article/aiam/2022/639900a677/1LRltNEl0Dm",
"parentPublication": {
"id": "proceedings/aiam/2022/6399/0",
"title": "2022 4th International Conference on Artificial Intelligence and Advanced Manufacturing (AIAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/5555/01/10061540",
"title": "SGDA: Towards 3D Universal Pulmonary Nodule Detection via Slice Grouped Domain Attention",
"doi": null,
"abstractUrl": "/journal/tb/5555/01/10061540/1Lk1YkKXNxS",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09369083",
"articleId": "1rFvS23KDAI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09381661",
"articleId": "1s4kVUKSRfq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxI0KAT",
"title": "Jan.",
"year": "2018",
"issueNum": "01",
"idPrefix": "tp",
"pubType": "journal",
"volume": "40",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUynZ5pm",
"doi": "10.1109/TPAMI.2017.2662686",
"abstract": "Objects and structures within man-made environments typically exhibit a high degree of organization in the form of orthogonal and parallel planes. Traditional approaches utilize these regularities via the restrictive, and rather local, Manhattan World (MW) assumption which posits that every plane is perpendicular to one of the axes of a single coordinate system. The aforementioned regularities are especially evident in the surface normal distribution of a scene where they manifest as orthogonally-coupled clusters. This motivates the introduction of the Manhattan-Frame (MF) model which captures the notion of an MW in the surface normals space, the unit sphere, and two probabilistic MF models over this space. First, for a single MF we propose novel real-time MAP inference algorithms, evaluate their performance and their use in drift-free rotation estimation. Second, to capture the complexity of real-world scenes at a global scale, we extend the MF model to a probabilistic mixture of Manhattan Frames (MMF). For MMF inference we propose a simple MAP inference algorithm and an adaptive Markov-Chain Monte-Carlo sampling algorithm with Metropolis-Hastings split/merge moves that let us infer the unknown number of mixture components. We demonstrate the versatility of the MMF model and inference algorithm across several scales of man-made environments.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Objects and structures within man-made environments typically exhibit a high degree of organization in the form of orthogonal and parallel planes. Traditional approaches utilize these regularities via the restrictive, and rather local, Manhattan World (MW) assumption which posits that every plane is perpendicular to one of the axes of a single coordinate system. The aforementioned regularities are especially evident in the surface normal distribution of a scene where they manifest as orthogonally-coupled clusters. This motivates the introduction of the Manhattan-Frame (MF) model which captures the notion of an MW in the surface normals space, the unit sphere, and two probabilistic MF models over this space. First, for a single MF we propose novel real-time MAP inference algorithms, evaluate their performance and their use in drift-free rotation estimation. Second, to capture the complexity of real-world scenes at a global scale, we extend the MF model to a probabilistic mixture of Manhattan Frames (MMF). For MMF inference we propose a simple MAP inference algorithm and an adaptive Markov-Chain Monte-Carlo sampling algorithm with Metropolis-Hastings split/merge moves that let us infer the unknown number of mixture components. We demonstrate the versatility of the MMF model and inference algorithm across several scales of man-made environments.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Objects and structures within man-made environments typically exhibit a high degree of organization in the form of orthogonal and parallel planes. Traditional approaches utilize these regularities via the restrictive, and rather local, Manhattan World (MW) assumption which posits that every plane is perpendicular to one of the axes of a single coordinate system. The aforementioned regularities are especially evident in the surface normal distribution of a scene where they manifest as orthogonally-coupled clusters. This motivates the introduction of the Manhattan-Frame (MF) model which captures the notion of an MW in the surface normals space, the unit sphere, and two probabilistic MF models over this space. First, for a single MF we propose novel real-time MAP inference algorithms, evaluate their performance and their use in drift-free rotation estimation. Second, to capture the complexity of real-world scenes at a global scale, we extend the MF model to a probabilistic mixture of Manhattan Frames (MMF). For MMF inference we propose a simple MAP inference algorithm and an adaptive Markov-Chain Monte-Carlo sampling algorithm with Metropolis-Hastings split/merge moves that let us infer the unknown number of mixture components. We demonstrate the versatility of the MMF model and inference algorithm across several scales of man-made environments.",
"title": "The Manhattan Frame Model—Manhattan World Inference in the Space of Surface Normals",
"normalizedTitle": "The Manhattan Frame Model—Manhattan World Inference in the Space of Surface Normals",
"fno": "07839295",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Three Dimensional Displays",
"Estimation",
"Inference Algorithms",
"Surface Reconstruction",
"Adaptation Models",
"Cameras",
"Layout",
"Manhattan World",
"Manhattan Frame",
"Mixture Of Manhattan Frames",
"World Representation",
"Surface Normal Distribution",
"Bayesian Models"
],
"authors": [
{
"givenName": "Julian",
"surname": "Straub",
"fullName": "Julian Straub",
"affiliation": "Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oren",
"surname": "Freifeld",
"fullName": "Oren Freifeld",
"affiliation": "Department of Computer Science, Ben-Gurion University, Be’er Sheva, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Guy",
"surname": "Rosman",
"fullName": "Guy Rosman",
"affiliation": "Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John J.",
"surname": "Leonard",
"fullName": "John J. Leonard",
"affiliation": "Department of Mechanical Engineering, MIT, Cambridge, MA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "John W.",
"surname": "Fisher",
"fullName": "John W. Fisher",
"affiliation": "Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2018-01-01 00:00:00",
"pubType": "trans",
"pages": "235-249",
"year": "2018",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/1999/0164/2/01640941",
"title": "Manhattan World: Compass Direction from a Single Image by Bayesian Inference",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1999/01640941/12OmNAhfIwC",
"parentPublication": {
"id": "proceedings/iccv/1999/0164/2",
"title": "Proceedings of the Seventh IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206867",
"title": "Manhattan-world stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206867/12OmNBC8ABC",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118d770",
"title": "A Mixture of Manhattan Frames: Beyond the Manhattan World",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118d770/12OmNBSBkgm",
"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/07299001",
"title": "Robust Manhattan Frame estimation from a single RGB-D image",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2015/07299001/12OmNqBbHC5",
"parentPublication": {
"id": "proceedings/cvpr/2015/6964/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851b763",
"title": "Globally Optimal Manhattan Frame Estimation in Real-Time",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851b763/12OmNrY3Lw1",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2018/5035/0/08622635",
"title": "Truth Inference on Sparse Crowdsourcing Data with Local Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2018/08622635/17D45XlyDuk",
"parentPublication": {
"id": "proceedings/big-data/2018/5035/0",
"title": "2018 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/03/08275042",
"title": "Robust and Globally Optimal Manhattan Frame Estimation in Near Real Time",
"doi": null,
"abstractUrl": "/journal/tp/2019/03/08275042/17D45XreC6g",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200p5193",
"title": "Globally Optimal and Efficient Manhattan Frame Estimation by Delimiting Rotation Search Space",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200p5193/1BmI44HZH0c",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900f188",
"title": "3D Room Layout Recovery Generalizing across Manhattan and Non-Manhattan Worlds",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900f188/1G565Rf5zFu",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600a964",
"title": "Online Reconstruction of Indoor Scenes With Local Manhattan Frame Growing",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600a964/1iTvpwOaZ68",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07827096",
"articleId": "13rRUILc8gu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08128644",
"articleId": "13rRUILLkEZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy7Qfqh",
"title": "May",
"year": "2017",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxjyX44",
"doi": "10.1109/TVCG.2017.2656889",
"abstract": "We introduce analytic approximations for accurate real-time rendering of surfaces lit by non-occluded area light sources. Our solution leverages the Irradiance Tensors developed by Arvo for the shading of Phong surfaces lit by a polygonal light source. Using a reformulation of the 1D boundary edge integral, we develop a general framework for approximating and evaluating the integral in constant time using simple peak shape functions. To overcome the Phong restriction, we propose a low cost edge splitting strategy that accounts for the spherical warp introduced by the half vector parametrization. Thanks to this novel extension, we accurately approximate common microfacet BRDFs, providing a practical method producing specular stretches that closely match the ground truth in real-time. Finally, using the same approximation framework, we introduce support for spherical and disc area light sources, based on an original polygon spinning method supporting non-uniform scaling operations and horizon clipping. Implemented on a GPU, our method achieves real-time performances without any assumption on area light shape nor surface roughness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce analytic approximations for accurate real-time rendering of surfaces lit by non-occluded area light sources. Our solution leverages the Irradiance Tensors developed by Arvo for the shading of Phong surfaces lit by a polygonal light source. Using a reformulation of the 1D boundary edge integral, we develop a general framework for approximating and evaluating the integral in constant time using simple peak shape functions. To overcome the Phong restriction, we propose a low cost edge splitting strategy that accounts for the spherical warp introduced by the half vector parametrization. Thanks to this novel extension, we accurately approximate common microfacet BRDFs, providing a practical method producing specular stretches that closely match the ground truth in real-time. Finally, using the same approximation framework, we introduce support for spherical and disc area light sources, based on an original polygon spinning method supporting non-uniform scaling operations and horizon clipping. Implemented on a GPU, our method achieves real-time performances without any assumption on area light shape nor surface roughness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce analytic approximations for accurate real-time rendering of surfaces lit by non-occluded area light sources. Our solution leverages the Irradiance Tensors developed by Arvo for the shading of Phong surfaces lit by a polygonal light source. Using a reformulation of the 1D boundary edge integral, we develop a general framework for approximating and evaluating the integral in constant time using simple peak shape functions. To overcome the Phong restriction, we propose a low cost edge splitting strategy that accounts for the spherical warp introduced by the half vector parametrization. Thanks to this novel extension, we accurately approximate common microfacet BRDFs, providing a practical method producing specular stretches that closely match the ground truth in real-time. Finally, using the same approximation framework, we introduce support for spherical and disc area light sources, based on an original polygon spinning method supporting non-uniform scaling operations and horizon clipping. Implemented on a GPU, our method achieves real-time performances without any assumption on area light shape nor surface roughness.",
"title": "Analytic Approximations for Real-Time Area Light Shading",
"normalizedTitle": "Analytic Approximations for Real-Time Area Light Shading",
"fno": "07829413",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Approximation Theory",
"Computational Geometry",
"Analytic Approximations",
"Real Time Area Light Shading",
"Polygonal Light Source",
"1 D Boundary Edge Integral",
"Phong Restriction",
"Half Vector Parametrization",
"Polygon Spinning Method",
"GPU",
"Real Time Systems",
"Lighting",
"Light Sources",
"Rendering Computer Graphics",
"Tensile Stress",
"Shape",
"Integral Equations",
"Area Light",
"Shading",
"Analytic",
"Microfacet",
"Axial Moment",
"Real Time"
],
"authors": [
{
"givenName": "Pascal",
"surname": "Lecocq",
"fullName": "Pascal Lecocq",
"affiliation": "Research & Innovation Department of Technicolor, 975 av des Champs-Blancs, Cesson-Sevigne, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Arthur",
"surname": "Dufay",
"fullName": "Arthur Dufay",
"affiliation": "Research & Innovation Department of Technicolor, 975 av des Champs-Blancs, Cesson-Sevigne, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Gaël",
"surname": "Sourimant",
"fullName": "Gaël Sourimant",
"affiliation": "Research & Innovation Department of Technicolor, 975 av des Champs-Blancs, Cesson-Sevigne, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Eudes",
"surname": "Marvie",
"fullName": "Jean-Eudes Marvie",
"affiliation": "Research & Innovation Department of Technicolor, 975 av des Champs-Blancs, Cesson-Sevigne, France",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2017-05-01 00:00:00",
"pubType": "trans",
"pages": "1428-1441",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2004/2158/1/01315019",
"title": "Difference sphere: an approach to near light source estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2004/01315019/12OmNAkEU53",
"parentPublication": {
"id": "proceedings/cvpr/2004/2158/1",
"title": "Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pbg/2005/20/0/01500323",
"title": "A practical structured light acquisition system for point-based geometry and texture",
"doi": null,
"abstractUrl": "/proceedings-article/pbg/2005/01500323/12OmNCdTeQ0",
"parentPublication": {
"id": "proceedings/pbg/2005/20/0",
"title": "Point-Based Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imstw/2015/6732/0/07177862",
"title": "Considerations for light sources: For semiconductor light sensor test",
"doi": null,
"abstractUrl": "/proceedings-article/imstw/2015/07177862/12OmNClQ0qG",
"parentPublication": {
"id": "proceedings/imstw/2015/6732/0",
"title": "2015 20th International Mixed-Signal Testing Workshop (IMSTW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130329",
"title": "A new approach of photometric stereo from linear image representation under close lighting",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130329/12OmNqC2uZr",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2012/1611/0/06239172",
"title": "The differential geometry of shape from shading: Biology reveals curvature structure",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2012/06239172/12OmNz6iO7V",
"parentPublication": {
"id": "proceedings/cvprw/2012/1611/0",
"title": "2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460071",
"title": "Shading derivation from an unspecified object for augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460071/12OmNzAohXY",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034c953",
"title": "LIT: A System and Benchmark for Light Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034c953/12OmNzZmZCD",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1993/3870/0/00378226",
"title": "Diffuse shading, visibility fields, and the geometry of ambient light",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1993/00378226/12OmNzw8iWV",
"parentPublication": {
"id": "proceedings/iccv/1993/3870/0",
"title": "1993 (4th) International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2020/6609/0/660900a420",
"title": "Recognizing Human Gestures Using Ambient Light",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-cbdcom-cyberscitech/2020/660900a420/1oFGTbjz4ac",
"parentPublication": {
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2020/6609/0",
"title": "2020 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09403910",
"title": "Surface Normals and Light Directions From Shading and Polarization",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09403910/1sLH9jSRKKc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07891683",
"articleId": "13rRUyfKIHT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07867077",
"articleId": "13rRUwwJWFT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1qdSTDvknHa",
"title": "Feb.",
"year": "2021",
"issueNum": "02",
"idPrefix": "tp",
"pubType": "journal",
"volume": "43",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1ch5I9yJ13G",
"doi": "10.1109/TPAMI.2019.2933209",
"abstract": "In this paper, we propose a parallel and scalable approach for geodesic distance computation on triangle meshes. Our key observation is that the recovery of geodesic distance with the heat method [1] can be reformulated as optimization of its gradients subject to integrability, which can be solved using an efficient first-order method that requires no linear system solving and converges quickly. Afterward, the geodesic distance is efficiently recovered by parallel integration of the optimized gradients in breadth-first order. Moreover, we employ a similar breadth-first strategy to derive a parallel Gauss-Seidel solver for the diffusion step in the heat method. To further lower the memory consumption from gradient optimization on faces, we also propose a formulation that optimizes the projected gradients on edges, which reduces the memory footprint by about 50 percent. Our approach is trivially parallelizable, with a low memory footprint that grows linearly with respect to the model size. This makes it particularly suitable for handling large models. Experimental results show that it can efficiently compute geodesic distance on meshes with more than 200 million vertices on a desktop PC with 128 GB RAM, outperforming the original heat method and other state-of-the-art geodesic distance solvers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose a parallel and scalable approach for geodesic distance computation on triangle meshes. Our key observation is that the recovery of geodesic distance with the heat method [1] can be reformulated as optimization of its gradients subject to integrability, which can be solved using an efficient first-order method that requires no linear system solving and converges quickly. Afterward, the geodesic distance is efficiently recovered by parallel integration of the optimized gradients in breadth-first order. Moreover, we employ a similar breadth-first strategy to derive a parallel Gauss-Seidel solver for the diffusion step in the heat method. To further lower the memory consumption from gradient optimization on faces, we also propose a formulation that optimizes the projected gradients on edges, which reduces the memory footprint by about 50 percent. Our approach is trivially parallelizable, with a low memory footprint that grows linearly with respect to the model size. This makes it particularly suitable for handling large models. Experimental results show that it can efficiently compute geodesic distance on meshes with more than 200 million vertices on a desktop PC with 128 GB RAM, outperforming the original heat method and other state-of-the-art geodesic distance solvers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose a parallel and scalable approach for geodesic distance computation on triangle meshes. Our key observation is that the recovery of geodesic distance with the heat method [1] can be reformulated as optimization of its gradients subject to integrability, which can be solved using an efficient first-order method that requires no linear system solving and converges quickly. Afterward, the geodesic distance is efficiently recovered by parallel integration of the optimized gradients in breadth-first order. Moreover, we employ a similar breadth-first strategy to derive a parallel Gauss-Seidel solver for the diffusion step in the heat method. To further lower the memory consumption from gradient optimization on faces, we also propose a formulation that optimizes the projected gradients on edges, which reduces the memory footprint by about 50 percent. Our approach is trivially parallelizable, with a low memory footprint that grows linearly with respect to the model size. This makes it particularly suitable for handling large models. Experimental results show that it can efficiently compute geodesic distance on meshes with more than 200 million vertices on a desktop PC with 128 GB RAM, outperforming the original heat method and other state-of-the-art geodesic distance solvers.",
"title": "Parallel and Scalable Heat Methods for Geodesic Distance Computation",
"normalizedTitle": "Parallel and Scalable Heat Methods for Geodesic Distance Computation",
"fno": "08789398",
"hasPdf": true,
"idPrefix": "tp",
"keywords": [
"Differential Geometry",
"Gradient Methods",
"Graph Theory",
"Iterative Methods",
"Mesh Generation",
"Optimisation",
"Search Problems",
"Geodesic Distance Computation",
"Parallel Approach",
"Scalable Approach",
"Efficient First Order Method",
"Linear System",
"Parallel Integration",
"Optimized Gradients",
"Breadth First Order",
"Parallel Gauss Seidel Solver",
"Gradient Optimization",
"Projected Gradients",
"Original Heat Method",
"State Of The Art Geodesic Distance Solvers",
"Optimization",
"Linear Systems",
"Memory Management",
"Computational Modeling",
"Heat Recovery",
"Approximation Algorithms",
"Heat Method",
"Heat Diffusion",
"Poisson Equation",
"Scalability",
"Parallel Algorithm"
],
"authors": [
{
"givenName": "Jiong",
"surname": "Tao",
"fullName": "Jiong Tao",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Juyong",
"surname": "Zhang",
"fullName": "Juyong Zhang",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bailin",
"surname": "Deng",
"fullName": "Bailin Deng",
"affiliation": "School of Computer Science and Informatics, Cardiff University, Cardiff, United Kingdom",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zheng",
"surname": "Fang",
"fullName": "Zheng Fang",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Peng",
"fullName": "Yue Peng",
"affiliation": "School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ying",
"surname": "He",
"fullName": "Ying He",
"affiliation": "School of Computer Science and Engineering, Nanyang Technological University, Singapore",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2021-02-01 00:00:00",
"pubType": "trans",
"pages": "579-594",
"year": "2021",
"issn": "0162-8828",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/iceet/2009/3819/1/3819a361",
"title": "Study on the Application of High Temperature Heat Pump to Recover Waste Heat of Marine Diesel Engine",
"doi": null,
"abstractUrl": "/proceedings-article/iceet/2009/3819a361/12OmNANTAyh",
"parentPublication": {
"id": "proceedings/iceet/2009/3819/1",
"title": "Energy and Environment Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsee/2012/4647/2/4647b006",
"title": "Numerical Simulations of Temperature Field of Coal-Bed Methane with Heat Injection Based on ANSYS",
"doi": null,
"abstractUrl": "/proceedings-article/iccsee/2012/4647b006/12OmNqFrGul",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdciem/2011/4350/0/4350a158",
"title": "Design and Performance Analysis of the Heat Pump-Based Condensing Heat of Cold Storage Recovery Drying Equipment",
"doi": null,
"abstractUrl": "/proceedings-article/cdciem/2011/4350a158/12OmNrIrPvg",
"parentPublication": {
"id": "proceedings/cdciem/2011/4350/0",
"title": "Computer Distributed Control and Intelligent Environmental Monitoring, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457d624",
"title": "Geodesic Distance Descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457d624/12OmNx38vRo",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icfpee/2010/7378/0/05663340",
"title": "Indoor Analogue Tests for High Temperature Heat Pump and Its Industrial Application",
"doi": null,
"abstractUrl": "/proceedings-article/icfpee/2010/05663340/12OmNzcPAfv",
"parentPublication": {
"id": "proceedings/icfpee/2010/7378/0",
"title": "2010 International Conference on Future Power and Energy Engineering (ICFPEE 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2008/2260/0/04547968",
"title": "Anisotropic geodesic distance computation for parametric surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2008/04547968/12OmNznkJTD",
"parentPublication": {
"id": "proceedings/smi/2008/2260/0",
"title": "IEEE International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101664",
"title": "A Triangulation-Invariant Method for Anisotropic Geodesic Map Computation on Surface Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101664/13rRUwdIOUJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2012/05/mcs2012050049",
"title": "Geodesic Distance-Based Realistic Facial Animation Using RBF Interpolation",
"doi": null,
"abstractUrl": "/magazine/cs/2012/05/mcs2012050049/13rRUwhpBRm",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/06/ttg2008061643",
"title": "Geodesic Distance-weighted Shape Vector Image Diffusion",
"doi": null,
"abstractUrl": "/journal/tg/2008/06/ttg2008061643/13rRUxBrGgS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09528952",
"title": "GeodesicEmbedding (GE): A High-Dimensional Embedding Approach for Fast Geodesic Distance Queries",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09528952/1wB2yxXmZYA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08809829",
"articleId": "1cHE1dHMloc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08784178",
"articleId": "1c8N27pR6ww",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzxgHw9",
"title": "September/October",
"year": "2007",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "13",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxDIth8",
"doi": "10.1109/TVCG.2007.1063",
"abstract": "Abstract—Orthopedists invest significant amounts of effort and time trying to understand the biomechanics of arthrodial (gliding) joints. Although new image acquisition and processing methods currently generate richer-than-ever geometry and kinematic data sets that are individual specific, the computational and visualization tools needed to enable the comparative analysis and exploration of these data sets lag behind. In this paper, we present a framework that enables the cross-data-set visual exploration and analysis of arthrodial joint biomechanics. Central to our approach is a computer-vision-inspired markerless method for establishing pairwise correspondences between individual-specific geometry. Manifold models are subsequently defined and deformed from one individual-specific geometry to another such that the markerless correspondences are preserved while minimizing model distortion. The resulting mutually consistent parameterization and visualization allow the users to explore the similarities and differences between two data sets and to define meaningful quantitative measures. We present two applications of this framework to human-wrist data: articular cartilage transfer from cadaver data to in vivo data and cross-data-set kinematics analysis. The method allows our users to combine complementary geometries acquired through different modalities and thus overcome current imaging limitations. The results demonstrate that the technique is useful in the study of normal and injured anatomy and kinematics of arthrodial joints. In principle, the pairwise cross-parameterization method applies to all spherical topology data from the same class and should be particularly beneficial in instances where identifying salient object features is a nontrivial task.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract—Orthopedists invest significant amounts of effort and time trying to understand the biomechanics of arthrodial (gliding) joints. Although new image acquisition and processing methods currently generate richer-than-ever geometry and kinematic data sets that are individual specific, the computational and visualization tools needed to enable the comparative analysis and exploration of these data sets lag behind. In this paper, we present a framework that enables the cross-data-set visual exploration and analysis of arthrodial joint biomechanics. Central to our approach is a computer-vision-inspired markerless method for establishing pairwise correspondences between individual-specific geometry. Manifold models are subsequently defined and deformed from one individual-specific geometry to another such that the markerless correspondences are preserved while minimizing model distortion. The resulting mutually consistent parameterization and visualization allow the users to explore the similarities and differences between two data sets and to define meaningful quantitative measures. We present two applications of this framework to human-wrist data: articular cartilage transfer from cadaver data to in vivo data and cross-data-set kinematics analysis. The method allows our users to combine complementary geometries acquired through different modalities and thus overcome current imaging limitations. The results demonstrate that the technique is useful in the study of normal and injured anatomy and kinematics of arthrodial joints. In principle, the pairwise cross-parameterization method applies to all spherical topology data from the same class and should be particularly beneficial in instances where identifying salient object features is a nontrivial task.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract—Orthopedists invest significant amounts of effort and time trying to understand the biomechanics of arthrodial (gliding) joints. Although new image acquisition and processing methods currently generate richer-than-ever geometry and kinematic data sets that are individual specific, the computational and visualization tools needed to enable the comparative analysis and exploration of these data sets lag behind. In this paper, we present a framework that enables the cross-data-set visual exploration and analysis of arthrodial joint biomechanics. Central to our approach is a computer-vision-inspired markerless method for establishing pairwise correspondences between individual-specific geometry. Manifold models are subsequently defined and deformed from one individual-specific geometry to another such that the markerless correspondences are preserved while minimizing model distortion. The resulting mutually consistent parameterization and visualization allow the users to explore the similarities and differences between two data sets and to define meaningful quantitative measures. We present two applications of this framework to human-wrist data: articular cartilage transfer from cadaver data to in vivo data and cross-data-set kinematics analysis. The method allows our users to combine complementary geometries acquired through different modalities and thus overcome current imaging limitations. The results demonstrate that the technique is useful in the study of normal and injured anatomy and kinematics of arthrodial joints. In principle, the pairwise cross-parameterization method applies to all spherical topology data from the same class and should be particularly beneficial in instances where identifying salient object features is a nontrivial task.",
"title": "Arthrodial Joint Markerless Cross-Parameterization and Biomechanical Visualization",
"normalizedTitle": "Arthrodial Joint Markerless Cross-Parameterization and Biomechanical Visualization",
"fno": "v1095",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Pairwise Shape Correspondence",
"Cross Parameterization",
"Arthrodial Joints",
"Biomedical Visualization",
"Biomechanics"
],
"authors": [
{
"givenName": "G. Elisabeta",
"surname": "Marai",
"fullName": "G. Elisabeta Marai",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cindy M.",
"surname": "Grimm",
"fullName": "Cindy M. Grimm",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "David H.",
"surname": "Laidlaw",
"fullName": "David H. Laidlaw",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2007-09-01 00:00:00",
"pubType": "trans",
"pages": "1095-1104",
"year": "2007",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icmtma/2010/3962/3/3962e702",
"title": "Survey on Planar Parameterization of Triangular Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962e702/12OmNA1mbfa",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/3",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880267",
"title": "Optimal Global Conformal Surface Parameterization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880267/12OmNsbGvEw",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/1999/0293/0/02930188",
"title": "Adaptive Parameterization for Reconstruction of 3D Freeform Objects from Laser-Scanned Data",
"doi": null,
"abstractUrl": "/proceedings-article/pg/1999/02930188/12OmNvjyy1f",
"parentPublication": {
"id": "proceedings/pg/1999/0293/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a124",
"title": "Structure Preserving Mesh Parameterization",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a124/12OmNzn38YO",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498sorkine",
"title": "Bounded-distortion Piecewise Mesh Parameterization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498sorkine/12OmNzwHvcJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101678",
"title": "Efficient Optimization of Common Base Domains for Cross Parameterization",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101678/13rRUxBJhFt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/08/ttg2011081178",
"title": "Template-Based 3D Model Fitting Using Dual-Domain Relaxation",
"doi": null,
"abstractUrl": "/journal/tg/2011/08/ttg2011081178/13rRUxYINf7",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/01/v0001",
"title": "Parameterization and Reconstruction from 3D Scattered Points Based on Neural Network and PDE Techniques",
"doi": null,
"abstractUrl": "/journal/tg/2001/01/v0001/13rRUy2YLSU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/10/ttg2011101531",
"title": "Partwise Cross-Parameterization via Nonregular Convex Hull Domains",
"doi": null,
"abstractUrl": "/journal/tg/2011/10/ttg2011101531/13rRUyfbwqD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2018/5488/0/08621238",
"title": "Comparison of Ocular Biomechanical Machine Learning Classifiers for Glaucoma Diagnosis",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2018/08621238/17D45Wt3ExO",
"parentPublication": {
"id": "proceedings/bibm/2018/5488/0",
"title": "2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "v1081",
"articleId": "13rRUwInv4g",
"__typename": "AdjacentArticleType"
},
"next": null,
"__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": "13rRUxly8XB",
"doi": "10.1109/TVCG.2009.160",
"abstract": "We develop a new algorithm for isosurface extraction andview-dependent filtering from large time-varying fields, by using anovel Persistent Time-Octree (PTOT) indexingstructure. Previously, the Persistent Octree (POT) was proposed toperform isosurface extraction and view-dependent filtering, whichcombines the advantages of the interval tree (for optimal searches ofactive cells) and of the Branch-On-Need Octree (BONO, forview-dependent filtering), but it only works for steady-state(i.e., single time step) data. For time-varying fields, a 4D versionof POT, 4D-POT, was proposed for 4D isocontour slicing, where slicingon the time domain gives all active cells in the queried timestep and isovalue. However, such slicing is not output sensitiveand thus the searching is sub-optimal. Moreover, it was notknown how to support view-dependent filtering in addition totime-domain slicing.In this paper, we develop a novel Persistent Time-Octree (PTOT) indexing structure, which has the advantages of POT and performs 4Disocontour slicing on the time domain with an output-sensitiveand optimal searching. In addition, when we query the sameisovalue q over m consecutive time steps, there is noadditional searching overhead (except for reporting the additionalactive cells) compared to querying just the first time step. Suchsearching performance for finding active cells is asymptoticallyoptimal, with asymptotically optimal space and preprocessing time aswell. Moreover, our PTOT supports view-dependent filtering in addition to time-domain slicing. We propose a simple and effectiveout-of-core scheme, where we integrate our PTOT with implicit occluders, batched occlusion queries and batched CUDA computingtasks, so that we can greatly reduce the I/O cost as well asincrease the amount of data being concurrently computed in GPU.This results in an efficient algorithm for isosurface extraction withview-dependent filtering utilizing a state-of-the-art programmable GPUfor time-varying fields larger than main memory. Our experiments ondatasets as large as 192GB (with 4GB per time step) having no morethan 870MB of memory footprint in both preprocessing and run-timephases demonstrate the efficacy of our new technique.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We develop a new algorithm for isosurface extraction andview-dependent filtering from large time-varying fields, by using anovel Persistent Time-Octree (PTOT) indexingstructure. Previously, the Persistent Octree (POT) was proposed toperform isosurface extraction and view-dependent filtering, whichcombines the advantages of the interval tree (for optimal searches ofactive cells) and of the Branch-On-Need Octree (BONO, forview-dependent filtering), but it only works for steady-state(i.e., single time step) data. For time-varying fields, a 4D versionof POT, 4D-POT, was proposed for 4D isocontour slicing, where slicingon the time domain gives all active cells in the queried timestep and isovalue. However, such slicing is not output sensitiveand thus the searching is sub-optimal. Moreover, it was notknown how to support view-dependent filtering in addition totime-domain slicing.In this paper, we develop a novel Persistent Time-Octree (PTOT) indexing structure, which has the advantages of POT and performs 4Disocontour slicing on the time domain with an output-sensitiveand optimal searching. In addition, when we query the sameisovalue q over m consecutive time steps, there is noadditional searching overhead (except for reporting the additionalactive cells) compared to querying just the first time step. Suchsearching performance for finding active cells is asymptoticallyoptimal, with asymptotically optimal space and preprocessing time aswell. Moreover, our PTOT supports view-dependent filtering in addition to time-domain slicing. We propose a simple and effectiveout-of-core scheme, where we integrate our PTOT with implicit occluders, batched occlusion queries and batched CUDA computingtasks, so that we can greatly reduce the I/O cost as well asincrease the amount of data being concurrently computed in GPU.This results in an efficient algorithm for isosurface extraction withview-dependent filtering utilizing a state-of-the-art programmable GPUfor time-varying fields larger than main memory. Our experiments ondatasets as large as 192GB (with 4GB per time step) having no morethan 870MB of memory footprint in both preprocessing and run-timephases demonstrate the efficacy of our new technique.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We develop a new algorithm for isosurface extraction andview-dependent filtering from large time-varying fields, by using anovel Persistent Time-Octree (PTOT) indexingstructure. Previously, the Persistent Octree (POT) was proposed toperform isosurface extraction and view-dependent filtering, whichcombines the advantages of the interval tree (for optimal searches ofactive cells) and of the Branch-On-Need Octree (BONO, forview-dependent filtering), but it only works for steady-state(i.e., single time step) data. For time-varying fields, a 4D versionof POT, 4D-POT, was proposed for 4D isocontour slicing, where slicingon the time domain gives all active cells in the queried timestep and isovalue. However, such slicing is not output sensitiveand thus the searching is sub-optimal. Moreover, it was notknown how to support view-dependent filtering in addition totime-domain slicing.In this paper, we develop a novel Persistent Time-Octree (PTOT) indexing structure, which has the advantages of POT and performs 4Disocontour slicing on the time domain with an output-sensitiveand optimal searching. In addition, when we query the sameisovalue q over m consecutive time steps, there is noadditional searching overhead (except for reporting the additionalactive cells) compared to querying just the first time step. Suchsearching performance for finding active cells is asymptoticallyoptimal, with asymptotically optimal space and preprocessing time aswell. Moreover, our PTOT supports view-dependent filtering in addition to time-domain slicing. We propose a simple and effectiveout-of-core scheme, where we integrate our PTOT with implicit occluders, batched occlusion queries and batched CUDA computingtasks, so that we can greatly reduce the I/O cost as well asincrease the amount of data being concurrently computed in GPU.This results in an efficient algorithm for isosurface extraction withview-dependent filtering utilizing a state-of-the-art programmable GPUfor time-varying fields larger than main memory. Our experiments ondatasets as large as 192GB (with 4GB per time step) having no morethan 870MB of memory footprint in both preprocessing and run-timephases demonstrate the efficacy of our new technique.",
"title": "Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)",
"normalizedTitle": "Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)",
"fno": "ttg2009061367",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Isosurface Extraction",
"Time Varying Fields",
"Persistent Data Structure",
"View Dependent Filtering",
"Out Of Core Methods"
],
"authors": [
{
"givenName": "Cong",
"surname": "Wang",
"fullName": "Cong Wang",
"affiliation": "Polytechnic Institute of New York University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yi-Jen",
"surname": "Chiang",
"fullName": "Yi-Jen Chiang",
"affiliation": "Polytechnic Institute of New York University",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2009-11-01 00:00:00",
"pubType": "trans",
"pages": "1367-1374",
"year": "2009",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2004/8788/0/87880457",
"title": "Interactive Point-Based Isosurface Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880457/12OmNvStcLl",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2010/4297/0/4297a023",
"title": "New Results on H∞ Filter Design for Continue-Time Systems with Time-Varying Delay",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2010/4297a023/12OmNwHQBeN",
"parentPublication": {
"id": "proceedings/cis/2010/4297/0",
"title": "2010 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2006/0693/0/04061553",
"title": "Interactive Isosurface Ray Tracing of Large Octree Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2006/04061553/12OmNwlqhK9",
"parentPublication": {
"id": "proceedings/rt/2006/0693/0",
"title": "IEEE Symposium on Interactive Ray Tracing 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300029",
"title": "Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300029/12OmNxWuix4",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1998/9176/0/91760159",
"title": "Isosurface Extraction in Time-Varying Fields Using a Temporal Hierarchical Index Tree",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760159/12OmNxYL5dN",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pvg/2001/7223/0/72230067",
"title": "Parallel View-Dependent Isosurface Extraction Using Multi-Pass Occlusion Culling",
"doi": null,
"abstractUrl": "/proceedings-article/pvg/2001/72230067/12OmNynJMPK",
"parentPublication": {
"id": "proceedings/pvg/2001/7223/0",
"title": "Parallel and Large-Data Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970024",
"title": "Isosurface Extraction in Time-varying Fields Using a Temporal Branch-on-Need Tree (T-BON)",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970024/12OmNzWfoUe",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/3/4296e191",
"title": "Robust Stability for Nonlinear Discrete-time Systems with Interval Time-varying Delay",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296e191/12OmNzzP5FU",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/3",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/02/v0098",
"title": "Accelerated Isosurface Extraction in Time-Varying Fields",
"doi": null,
"abstractUrl": "/journal/tg/2000/02/v0098/13rRUx0xPIq",
"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"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2009061359",
"articleId": "13rRUygBw74",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2009061375",
"articleId": "13rRUB6Sq0v",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "17ShDTXWRTf",
"name": "ttg2009061367s.mov",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg2009061367s.mov",
"extension": "mov",
"size": "6.24 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwFid7w",
"title": "Jan.",
"year": "2019",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "25",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "17D45WnnFYV",
"doi": "10.1109/TVCG.2018.2864690",
"abstract": "Occlusion is an issue in volumetric visualization as it prevents direct visualization of the region of interest. While many techniques such as transfer functions, volume segmentation or view distortion have been developed to address this, there is still room for improvement to better support the understanding of objects' vicinity. However, most existing Focus+Context fail to solve partial occlusion in datasets where the target and the occluder are very similar density-wise. For these reasons, we investigate a new technique which maintains the general structure of the investigated volumetric dataset while addressing occlusion issues. With our technique, the user interactively defines an area of interest where an occluded region or object is partially visible. Then our lens starts pushing at its border occluding objects, thus revealing hidden volumetric data. Next, the lens is modified with an extended field of view (fish-eye deformation) to better see the vicinity of the selected region. Finally, the user can freely explore the surroundings of the area under investigation within the lens. To provide real-time exploration, we implemented our lens using a GPU accelerated ray-casting framework to handle ray deformations, local lighting, and local viewpoint manipulation. We illustrate our technique with five application scenarios in baggage inspection, 3D fluid flow visualization, chest radiology, air traffic planning, and DTI fiber exploration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Occlusion is an issue in volumetric visualization as it prevents direct visualization of the region of interest. While many techniques such as transfer functions, volume segmentation or view distortion have been developed to address this, there is still room for improvement to better support the understanding of objects' vicinity. However, most existing Focus+Context fail to solve partial occlusion in datasets where the target and the occluder are very similar density-wise. For these reasons, we investigate a new technique which maintains the general structure of the investigated volumetric dataset while addressing occlusion issues. With our technique, the user interactively defines an area of interest where an occluded region or object is partially visible. Then our lens starts pushing at its border occluding objects, thus revealing hidden volumetric data. Next, the lens is modified with an extended field of view (fish-eye deformation) to better see the vicinity of the selected region. Finally, the user can freely explore the surroundings of the area under investigation within the lens. To provide real-time exploration, we implemented our lens using a GPU accelerated ray-casting framework to handle ray deformations, local lighting, and local viewpoint manipulation. We illustrate our technique with five application scenarios in baggage inspection, 3D fluid flow visualization, chest radiology, air traffic planning, and DTI fiber exploration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Occlusion is an issue in volumetric visualization as it prevents direct visualization of the region of interest. While many techniques such as transfer functions, volume segmentation or view distortion have been developed to address this, there is still room for improvement to better support the understanding of objects' vicinity. However, most existing Focus+Context fail to solve partial occlusion in datasets where the target and the occluder are very similar density-wise. For these reasons, we investigate a new technique which maintains the general structure of the investigated volumetric dataset while addressing occlusion issues. With our technique, the user interactively defines an area of interest where an occluded region or object is partially visible. Then our lens starts pushing at its border occluding objects, thus revealing hidden volumetric data. Next, the lens is modified with an extended field of view (fish-eye deformation) to better see the vicinity of the selected region. Finally, the user can freely explore the surroundings of the area under investigation within the lens. To provide real-time exploration, we implemented our lens using a GPU accelerated ray-casting framework to handle ray deformations, local lighting, and local viewpoint manipulation. We illustrate our technique with five application scenarios in baggage inspection, 3D fluid flow visualization, chest radiology, air traffic planning, and DTI fiber exploration.",
"title": "Interactive obstruction-free lensing for volumetric data visualization",
"normalizedTitle": "Interactive obstruction-free lensing for volumetric data visualization",
"fno": "08467383",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Image Segmentation",
"Lenses",
"Ray Tracing",
"Rendering Computer Graphics",
"Local Lighting",
"Local Viewpoint Manipulation",
"Baggage Inspection",
"Chest Radiology",
"Air Traffic Planning",
"DTI Fiber Exploration",
"3 D Fluid Flow Visualization",
"Ray Deformations",
"GPU Accelerated Ray Casting Framework",
"Real Time Exploration",
"Fish Eye Deformation",
"Hidden Volumetric Data",
"Lens",
"Occluded Region",
"Partial Occlusion",
"Volume Segmentation",
"Transfer Functions",
"Direct Visualization",
"Volumetric Data Visualization",
"Interactive Obstruction Free Lensing",
"Lenses",
"Strain",
"Data Visualization",
"Transfer Functions",
"Three Dimensional Displays",
"Animation",
"Interaction Techniques",
"Focus Context",
"Volume Visualization",
"Volume Rendering",
"Raycasting"
],
"authors": [
{
"givenName": "Michael",
"surname": "Traoré",
"fullName": "Michael Traoré",
"affiliation": "ENACFrench Civil Aviation University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Christophe",
"surname": "Hurter",
"fullName": "Christophe Hurter",
"affiliation": "ENACFrench Civil Aviation University",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Alexandru",
"surname": "Telea",
"fullName": "Alexandru Telea",
"affiliation": "Institute Johan BernoulliUniversity of Groningen",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2019-01-01 00:00:00",
"pubType": "trans",
"pages": "1029-1039",
"year": "2019",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2008/1971/0/04480772",
"title": "New Rendering Approach for Composable Volumetric Lenses",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2008/04480772/12OmNBAqZId",
"parentPublication": {
"id": "proceedings/vr/2008/1971/0",
"title": "IEEE Virtual Reality 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2004/8781/0/87810095",
"title": "Interactive Volume Manipulation with Selective Rendering for Improved Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2004/87810095/12OmNqOwQKv",
"parentPublication": {
"id": "proceedings/vv/2004/8781/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2018/1424/0/142401a215",
"title": "An Automatic Deformation Approach for Occlusion Free Egocentric Data Exploration",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2018/142401a215/12OmNvDqsLz",
"parentPublication": {
"id": "proceedings/pacificvis/2018/1424/0",
"title": "2018 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2013/5099/0/5099a250",
"title": "Query Tools for Interactive Exploration of 3D Neuroimages: Cropping, Probe and Lens",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2013/5099a250/12OmNzXFoFj",
"parentPublication": {
"id": "proceedings/sibgrapi/2013/5099/0",
"title": "2013 XXVI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101731",
"title": "Feature-Driven Data Exploration for Volumetric Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101731/13rRUIIVlke",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/01/07539643",
"title": "GlyphLens: View-Dependent Occlusion Management in the Interactive Glyph Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2017/01/07539643/13rRUwInvJk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/02/v0208",
"title": "Visualization of Boundaries in Volumetric Data Sets Using LH Histograms",
"doi": null,
"abstractUrl": "/journal/tg/2006/02/v0208/13rRUwbs2aT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06875905",
"title": "Low-Pass Filtered Volumetric Shadows",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06875905/13rRUy2YLYx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/06/09760710",
"title": "Image-based Visualization of Large Volumetric Data Using Moments",
"doi": null,
"abstractUrl": "/journal/tg/2022/06/09760710/1CJ7zDaESPe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09222376",
"title": "Deep Volumetric Ambient Occlusion",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09222376/1nTqtgLjBMQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08440805",
"articleId": "17D45WnnFUX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08440038",
"articleId": "17D45WrVgbN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1i3JModWnO8",
"name": "ttg201901-08467383s1.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08467383s1.mp4",
"extension": "mp4",
"size": "15.4 MB",
"__typename": "WebExtraType"
},
{
"id": "1i3JLZ6rn68",
"name": "ttg201901-08467383s2.pdf",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg201901-08467383s2.pdf",
"extension": "pdf",
"size": "42.2 kB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxvwoO0",
"title": "June",
"year": "2012",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "18",
"label": "June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUyfbwqF",
"doi": "10.1109/TVCG.2012.34",
"abstract": "This paper deals with the problem of taking random samples over the surface of a 3D mesh describing and evaluating efficient algorithms for generating different distributions. We discuss first the problem of generating a Monte Carlo distribution in an efficient and practical way avoiding common pitfalls. Then, we propose Constrained Poisson-disk sampling, a new Poisson-disk sampling scheme for polygonal meshes which can be easily tweaked in order to generate customized set of points such as importance sampling or distributions with generic geometric constraints. In particular, two algorithms based on this approach are presented. An in-depth analysis of the frequency characterization and performance of the proposed algorithms are also presented and discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper deals with the problem of taking random samples over the surface of a 3D mesh describing and evaluating efficient algorithms for generating different distributions. We discuss first the problem of generating a Monte Carlo distribution in an efficient and practical way avoiding common pitfalls. Then, we propose Constrained Poisson-disk sampling, a new Poisson-disk sampling scheme for polygonal meshes which can be easily tweaked in order to generate customized set of points such as importance sampling or distributions with generic geometric constraints. In particular, two algorithms based on this approach are presented. An in-depth analysis of the frequency characterization and performance of the proposed algorithms are also presented and discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper deals with the problem of taking random samples over the surface of a 3D mesh describing and evaluating efficient algorithms for generating different distributions. We discuss first the problem of generating a Monte Carlo distribution in an efficient and practical way avoiding common pitfalls. Then, we propose Constrained Poisson-disk sampling, a new Poisson-disk sampling scheme for polygonal meshes which can be easily tweaked in order to generate customized set of points such as importance sampling or distributions with generic geometric constraints. In particular, two algorithms based on this approach are presented. An in-depth analysis of the frequency characterization and performance of the proposed algorithms are also presented and discussed.",
"title": "Efficient and Flexible Sampling with Blue Noise Properties of Triangular Meshes",
"normalizedTitle": "Efficient and Flexible Sampling with Blue Noise Properties of Triangular Meshes",
"fno": "ttg2012060914",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Monte Carlo Methods",
"Three Dimensional Displays",
"Noise Measurement",
"Complexity Theory",
"Algorithm Design And Analysis",
"Context Modeling",
"Monte Carlo Methods",
"Geometry Processing",
"Computational Geometry",
"Three Dimensional Graphics And Realism",
"Sampling",
"Poisson Disk Sampling"
],
"authors": [
{
"givenName": "Massimiliano",
"surname": "Corsini",
"fullName": "Massimiliano Corsini",
"affiliation": "Istituto di Scienza e Tecnologia dell'Informazione, Area della Ricerca CNR di Pisa, Pisa",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Paolo",
"surname": "Cignoni",
"fullName": "Paolo Cignoni",
"affiliation": "Istituto di Scienza e Tecnologia dell'Informazione, Area della Ricerca CNR di Pisa, Pisa",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Roberto",
"surname": "Scopigno",
"fullName": "Roberto Scopigno",
"affiliation": "Istituto di Scienza e Tecnologia dell'Informazione, Area della Ricerca CNR di Pisa, Pisa",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "2012-06-01 00:00:00",
"pubType": "trans",
"pages": "914-924",
"year": "2012",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/wsc/2003/8131/1/01261433",
"title": "Importance sampling for a mixed Poisson model of portfolio credit risk",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/2003/01261433/12OmNB8kHVB",
"parentPublication": {
"id": "proceedings/wsc/2003/8131/1",
"title": "Proceedings of the 2003 Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/3/3336e190",
"title": "A New Nonlinear Filter Algorithm Based on QMC Quadrature",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336e190/12OmNs0C9EO",
"parentPublication": {
"id": "proceedings/csse/2008/3336/3",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2009/3964/0/3964a137",
"title": "Monte Carlo Variance Reduction. Importance Sampling Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2009/3964a137/12OmNvDqsUX",
"parentPublication": {
"id": "proceedings/synasc/2009/3964/0",
"title": "2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wsc/2006/0500/0/04117608",
"title": "Optimal Resource Allocation in Two Stage Sampling of Input Distributions",
"doi": null,
"abstractUrl": "/proceedings-article/wsc/2006/04117608/12OmNwFRp9u",
"parentPublication": {
"id": "proceedings/wsc/2006/0500/0",
"title": "2006 Winter Simulation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2005/9313/0/01577198",
"title": "Adaptive sampling with Renyi entropy in Monte Carlo path tracing",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2005/01577198/12OmNzEVS1q",
"parentPublication": {
"id": "proceedings/isspit/2005/9313/0",
"title": "2005 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2012/4699/0/4699a153",
"title": "A Custom Precision Based Architecture for Accelerating Parallel Tempering MCMC on FPGAs without Introducing Sampling Error",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2012/4699a153/12OmNzcxZ5R",
"parentPublication": {
"id": "proceedings/fccm/2012/4699/0",
"title": "Field-Programmable Custom Computing Machines, Annual IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101784",
"title": "Variational Blue Noise Sampling",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101784/13rRUILtJqQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/09/ttg2013091425",
"title": "An Intrinsic Algorithm for Parallel Poisson Disk Sampling on Arbitrary Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2013/09/ttg2013091425/13rRUwgyOjk",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/11/06811174",
"title": "Unbiased Sampling and Meshing of Isosurfaces",
"doi": null,
"abstractUrl": "/journal/tg/2014/11/06811174/13rRUxNmPDU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/08/ttg2011081108",
"title": "Representativity for Robust and Adaptive Multiple Importance Sampling",
"doi": null,
"abstractUrl": "/journal/tg/2011/08/ttg2011081108/13rRUxOdD8i",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg2012060902",
"articleId": "13rRUwcAqqd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg2012060925",
"articleId": "13rRUwjGoFX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzVXNIj",
"title": "Dec.",
"year": "2017",
"issueNum": "12",
"idPrefix": "tg",
"pubType": "journal",
"volume": "23",
"label": "Dec.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUzpzeB9",
"doi": "10.1109/TVCG.2016.2641963",
"abstract": "We describe a simple push-pull optimization (PPO) algorithm for blue-noise sampling by enforcing spatial constraints on given point sets. Constraints can be a minimum distance between samples, a maximum distance between an arbitrary point and the nearest sample, and a maximum deviation of a sample's capacity (area of Voronoi cell) from the mean capacity. All of these constraints are based on the topology emerging from Delaunay triangulation, and they can be combined for improved sampling quality and efficiency. In addition, our algorithm offers flexibility for trading-off between different targets, such as noise and aliasing. We present several applications of the proposed algorithm, including anti-aliasing, stippling, and non-obtuse remeshing. Our experimental results illustrate the efficiency and the robustness of the proposed approach. Moreover, we demonstrate that our remeshing quality is superior to the current state-of-the-art approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a simple push-pull optimization (PPO) algorithm for blue-noise sampling by enforcing spatial constraints on given point sets. Constraints can be a minimum distance between samples, a maximum distance between an arbitrary point and the nearest sample, and a maximum deviation of a sample's capacity (area of Voronoi cell) from the mean capacity. All of these constraints are based on the topology emerging from Delaunay triangulation, and they can be combined for improved sampling quality and efficiency. In addition, our algorithm offers flexibility for trading-off between different targets, such as noise and aliasing. We present several applications of the proposed algorithm, including anti-aliasing, stippling, and non-obtuse remeshing. Our experimental results illustrate the efficiency and the robustness of the proposed approach. Moreover, we demonstrate that our remeshing quality is superior to the current state-of-the-art approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a simple push-pull optimization (PPO) algorithm for blue-noise sampling by enforcing spatial constraints on given point sets. Constraints can be a minimum distance between samples, a maximum distance between an arbitrary point and the nearest sample, and a maximum deviation of a sample's capacity (area of Voronoi cell) from the mean capacity. All of these constraints are based on the topology emerging from Delaunay triangulation, and they can be combined for improved sampling quality and efficiency. In addition, our algorithm offers flexibility for trading-off between different targets, such as noise and aliasing. We present several applications of the proposed algorithm, including anti-aliasing, stippling, and non-obtuse remeshing. Our experimental results illustrate the efficiency and the robustness of the proposed approach. Moreover, we demonstrate that our remeshing quality is superior to the current state-of-the-art approaches.",
"title": "A Simple Push-Pull Algorithm for Blue-Noise Sampling",
"normalizedTitle": "A Simple Push-Pull Algorithm for Blue-Noise Sampling",
"fno": "07790842",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Optimization",
"Correlation",
"Harmonic Analysis",
"Radio Frequency",
"Clustering Algorithms",
"Density Measurement",
"Noise Measurement",
"Blue Noise Sampling",
"Push Pull",
"Surface Sampling",
"Remeshing",
"Stippling"
],
"authors": [
{
"givenName": "Abdalla G. M.",
"surname": "Ahmed",
"fullName": "Abdalla G. M. Ahmed",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jianwei",
"surname": "Guo",
"fullName": "Jianwei Guo",
"affiliation": "National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dong-Ming",
"surname": "Yan",
"fullName": "Dong-Ming Yan",
"affiliation": "National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jean-Yves",
"surname": "Franceschia",
"fullName": "Jean-Yves Franceschia",
"affiliation": "Ecole Normale Supérieure de Lyon, Lyon, France",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xiaopeng",
"surname": "Zhang",
"fullName": "Xiaopeng Zhang",
"affiliation": "National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Oliver",
"surname": "Deussen",
"fullName": "Oliver Deussen",
"affiliation": "University of Konstanz, Konstanz, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "12",
"pubDate": "2017-12-01 00:00:00",
"pubType": "trans",
"pages": "2496-2508",
"year": "2017",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/soca/2013/2702/0/2701a190",
"title": "Push vs. Pull: An Energy Perspective (Short Paper)",
"doi": null,
"abstractUrl": "/proceedings-article/soca/2013/2701a190/12OmNB8TUeC",
"parentPublication": {
"id": "proceedings/soca/2013/2702/0",
"title": "2013 IEEE 6th International Conference on Service-Oriented Computing and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imstw/2015/6732/0/07177861",
"title": "ACR BER correlation to ATE for a COFDM VHF RX",
"doi": null,
"abstractUrl": "/proceedings-article/imstw/2015/07177861/12OmNqJHFs8",
"parentPublication": {
"id": "proceedings/imstw/2015/6732/0",
"title": "2015 20th International Mixed-Signal Testing Workshop (IMSTW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/08/06967788",
"title": "Zero-Aliasing Correlation Filters for Object Recognition",
"doi": null,
"abstractUrl": "/journal/tp/2015/08/06967788/13rRUILtJB2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/10/ttg2012101784",
"title": "Variational Blue Noise Sampling",
"doi": null,
"abstractUrl": "/journal/tg/2012/10/ttg2012101784/13rRUILtJqQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/06/ttg2012060914",
"title": "Efficient and Flexible Sampling with Blue Noise Properties of Triangular Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2012/06/ttg2012060914/13rRUyfbwqF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2019/4896/0/489600b114",
"title": "ExCoDE: a Tool for Discovering and Visualizing Regions of Correlation in Dynamic Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2019/489600b114/1gAwZ9fzc3u",
"parentPublication": {
"id": "proceedings/icdmw/2019/4896/0",
"title": "2019 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08089787",
"articleId": "13rRUx0geq2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07778257",
"articleId": "13rRUxCitJj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBhpS2B",
"title": "April",
"year": "2014",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "20",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxASubA",
"doi": "10.1109/TVCG.2014.19",
"abstract": "We empirically examined the impact of virtual human animation on the emotional responses of participants in a medical virtual reality system for education in the signs and symptoms of patient deterioration. Participants were presented with one of two virtual human conditions in a between-subjects experiment, static (non-animated) and dynamic (animated). Our objective measures included the use of psycho-physical Electro Dermal Activity (EDA) sensors, and subjective measures inspired by social psychology research included the Differential Emotions Survey (DES IV) and Positive and Negative Affect Survey (PANAS). We analyzed the quantitative and qualitative measures associated with participants' emotional state at four distinct time-steps in the simulated interpersonal experience as the virtual patient's medical condition deteriorated. Results suggest that participants in the dynamic condition with animations exhibited a higher sense of co-presence and greater emotional response as compared to participants in the static condition, corresponding to the deterioration in the medical condition of the virtual patient. Negative affect of participants in the dynamic condition increased at a higher rate than for participants in the static condition. The virtual human animations elicited a stronger response in negative emotions such as anguish, fear, and anger as the virtual patient's medical condition worsened.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We empirically examined the impact of virtual human animation on the emotional responses of participants in a medical virtual reality system for education in the signs and symptoms of patient deterioration. Participants were presented with one of two virtual human conditions in a between-subjects experiment, static (non-animated) and dynamic (animated). Our objective measures included the use of psycho-physical Electro Dermal Activity (EDA) sensors, and subjective measures inspired by social psychology research included the Differential Emotions Survey (DES IV) and Positive and Negative Affect Survey (PANAS). We analyzed the quantitative and qualitative measures associated with participants' emotional state at four distinct time-steps in the simulated interpersonal experience as the virtual patient's medical condition deteriorated. Results suggest that participants in the dynamic condition with animations exhibited a higher sense of co-presence and greater emotional response as compared to participants in the static condition, corresponding to the deterioration in the medical condition of the virtual patient. Negative affect of participants in the dynamic condition increased at a higher rate than for participants in the static condition. The virtual human animations elicited a stronger response in negative emotions such as anguish, fear, and anger as the virtual patient's medical condition worsened.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We empirically examined the impact of virtual human animation on the emotional responses of participants in a medical virtual reality system for education in the signs and symptoms of patient deterioration. Participants were presented with one of two virtual human conditions in a between-subjects experiment, static (non-animated) and dynamic (animated). Our objective measures included the use of psycho-physical Electro Dermal Activity (EDA) sensors, and subjective measures inspired by social psychology research included the Differential Emotions Survey (DES IV) and Positive and Negative Affect Survey (PANAS). We analyzed the quantitative and qualitative measures associated with participants' emotional state at four distinct time-steps in the simulated interpersonal experience as the virtual patient's medical condition deteriorated. Results suggest that participants in the dynamic condition with animations exhibited a higher sense of co-presence and greater emotional response as compared to participants in the static condition, corresponding to the deterioration in the medical condition of the virtual patient. Negative affect of participants in the dynamic condition increased at a higher rate than for participants in the static condition. The virtual human animations elicited a stronger response in negative emotions such as anguish, fear, and anger as the virtual patient's medical condition worsened.",
"title": "Effects of Virtual Human Animation on Emotion Contagion in Simulated Inter-Personal Experiences",
"normalizedTitle": "Effects of Virtual Human Animation on Emotion Contagion in Simulated Inter-Personal Experiences",
"fno": "ttg201404626",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Animation",
"Training",
"Educational Institutions",
"Sensors",
"Medical Services",
"Atmospheric Measurements",
"Particle Measurements",
"Virtual Humans Digital Characters Simulation And Behavior Emotion Contagion User Studies Medicine"
],
"authors": [
{
"givenName": null,
"surname": "Yanxiang Wu",
"fullName": "Yanxiang Wu",
"affiliation": "Sch. of Comput., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Sabarish V.",
"surname": "Babu",
"fullName": "Sabarish V. Babu",
"affiliation": "Sch. of Comput., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rowan",
"surname": "Armstrong",
"fullName": "Rowan Armstrong",
"affiliation": "Sch. of Comput., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeffrey W.",
"surname": "Bertrand",
"fullName": "Jeffrey W. Bertrand",
"affiliation": "Sch. of Comput., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": null,
"surname": "Jun Luo",
"fullName": "Jun Luo",
"affiliation": "Dept. of Math. Sci., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tania",
"surname": "Roy",
"fullName": "Tania Roy",
"affiliation": "Sch. of Comput., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shaundra B.",
"surname": "Daily",
"fullName": "Shaundra B. Daily",
"affiliation": "Sch. of Comput., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lauren",
"surname": "Cairco Dukes",
"fullName": "Lauren Cairco Dukes",
"affiliation": "Sch. of Comput., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Larry F.",
"surname": "Hodges",
"fullName": "Larry F. Hodges",
"affiliation": "Sch. of Comput., Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tracy",
"surname": "Fasolino",
"fullName": "Tracy Fasolino",
"affiliation": "Sch. of Nursing, Clemson Univ., Clemson, SC, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2014-04-01 00:00:00",
"pubType": "trans",
"pages": "626-635",
"year": "2014",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2015/1727/0/07223346",
"title": "An evaluation of virtual human appearance fidelity on user's positive and negative affect in human-virtual human interaction",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223346/12OmNvjyxwr",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223367",
"title": "An experimental study on the virtual representation of children",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223367/12OmNvkGVZf",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2013/5545/0/06553792",
"title": "Felt emotion and social context determine the intensity of smiles in a competitive video game",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2013/06553792/12OmNvkYxdw",
"parentPublication": {
"id": "proceedings/fg/2013/5545/0",
"title": "2013 10th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2020/02/08122047",
"title": "Computational Study of Primitive Emotional Contagion in Dyadic Interactions",
"doi": null,
"abstractUrl": "/journal/ta/2020/02/08122047/13rRUwgQpBw",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/04/07383334",
"title": "Effects of Virtual Human Appearance Fidelity on Emotion Contagion in Affective Inter-Personal Simulations",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07383334/13rRUygBw7c",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2021/03/08642402",
"title": "First Impressions Count! The Role of the Human's Emotional State on Rapport Established with an Empathic versus Neutral Virtual Therapist",
"doi": null,
"abstractUrl": "/journal/ta/2021/03/08642402/17PYEmawc80",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom-workshops/2022/1647/0/09767281",
"title": "An Exploratory Analysis of Interactive VR-Based Framework for Multi-Componential Analysis of Emotion",
"doi": null,
"abstractUrl": "/proceedings-article/percom-workshops/2022/09767281/1Df82pGW23e",
"parentPublication": {
"id": "proceedings/percom-workshops/2022/1647/0",
"title": "2022 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/5555/01/10113723",
"title": "Empirical validation of an agent-based model of emotion contagion",
"doi": null,
"abstractUrl": "/journal/ta/5555/01/10113723/1MNbeIRxhoA",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2021/1838/0/255600a188",
"title": "Effects of Language Familiarity in Simulated Natural Dialogue with a Virtual Crowd of Digital Humans on Emotion Contagion in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2021/255600a188/1tuAhmufDz2",
"parentPublication": {
"id": "proceedings/vr/2021/1838/0",
"title": "2021 IEEE Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a437",
"title": "Focus Group on Social Virtual Reality in Social Virtual Reality: Effects on Emotion and Self-Awareness",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a437/1yeQD8KNChO",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttg201404616",
"articleId": "13rRUxC0SvW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttg201404636",
"articleId": "13rRUxAASTc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNy2agLB",
"title": "July-December",
"year": "2010",
"issueNum": "02",
"idPrefix": "ta",
"pubType": "journal",
"volume": "1",
"label": "July-December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUygBw5N",
"doi": "10.1109/T-AFFC.2010.13",
"abstract": "Despite a variety of new communication technologies, loneliness is prevalent in Western countries. Boosting emotional communication through intimate connections has the potential to reduce loneliness. New technologies might exploit biosignals as intimate emotional cues because of their strong relationship to emotions. Through two studies, we investigate the possibilities of heartbeat communication as an intimate cue. In the first study (N = 32), we demonstrate, using self-report and behavioral tracking in an immersive virtual environment, that heartbeat perception influences social behavior in a similar manner as traditional intimate signals such as gaze and interpersonal distance. In the second study (N = 34), we demonstrate that a sound of the heartbeat is not sufficient to cause the effect; the stimulus must be attributed to the conversational partner in order to have influence. Together, these results show that heartbeat communication is a promising way to increase intimacy. Implications and possibilities for applications are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Despite a variety of new communication technologies, loneliness is prevalent in Western countries. Boosting emotional communication through intimate connections has the potential to reduce loneliness. New technologies might exploit biosignals as intimate emotional cues because of their strong relationship to emotions. Through two studies, we investigate the possibilities of heartbeat communication as an intimate cue. In the first study (N = 32), we demonstrate, using self-report and behavioral tracking in an immersive virtual environment, that heartbeat perception influences social behavior in a similar manner as traditional intimate signals such as gaze and interpersonal distance. In the second study (N = 34), we demonstrate that a sound of the heartbeat is not sufficient to cause the effect; the stimulus must be attributed to the conversational partner in order to have influence. Together, these results show that heartbeat communication is a promising way to increase intimacy. Implications and possibilities for applications are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Despite a variety of new communication technologies, loneliness is prevalent in Western countries. Boosting emotional communication through intimate connections has the potential to reduce loneliness. New technologies might exploit biosignals as intimate emotional cues because of their strong relationship to emotions. Through two studies, we investigate the possibilities of heartbeat communication as an intimate cue. In the first study (N = 32), we demonstrate, using self-report and behavioral tracking in an immersive virtual environment, that heartbeat perception influences social behavior in a similar manner as traditional intimate signals such as gaze and interpersonal distance. In the second study (N = 34), we demonstrate that a sound of the heartbeat is not sufficient to cause the effect; the stimulus must be attributed to the conversational partner in order to have influence. Together, these results show that heartbeat communication is a promising way to increase intimacy. Implications and possibilities for applications are discussed.",
"title": "Intimate Heartbeats: Opportunities for Affective Communication Technology",
"normalizedTitle": "Intimate Heartbeats: Opportunities for Affective Communication Technology",
"fno": "tta2010020072",
"hasPdf": true,
"idPrefix": "ta",
"keywords": [
"Emotion Recognition",
"Medical Signal Processing",
"Physiology",
"Social Sciences Computing",
"Virtual Reality",
"Intimate Heartbeat Communication",
"Affective Communication Technology",
"Western Country",
"Emotional Communication",
"Intimate Connection",
"Emotional Cues",
"Behavioral Tracking",
"Self Report Tracking",
"Immersive Virtual Environment",
"Heartbeat Perception",
"Intimate Signals",
"Heart Rate Variability",
"Auditory System",
"Emotion Recognition",
"Particle Measurements",
"Atmospheric Measurements",
"Psychology",
"Social Issues",
"Artificial Augmented And Virtual Realities",
"Communications Applications",
"Nonverbal Signals"
],
"authors": [
{
"givenName": "Joris H.",
"surname": "Janssen",
"fullName": "Joris H. Janssen",
"affiliation": "Eindhoven University of Technology and Philips Research, Eindhoven",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jeremy N.",
"surname": "Bailenson",
"fullName": "Jeremy N. Bailenson",
"affiliation": "Stanford University, Stanford",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wijnand A.",
"surname": "IJsselsteijn",
"fullName": "Wijnand A. IJsselsteijn",
"affiliation": "Eindhoven University of Technology, Eindhoven",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Joyce H.D.M.",
"surname": "Westerink",
"fullName": "Joyce H.D.M. Westerink",
"affiliation": "Philips Research, Eindhoven",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2010-07-01 00:00:00",
"pubType": "trans",
"pages": "72-80",
"year": "2010",
"issn": "1949-3045",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/acii/2015/9953/0/07344550",
"title": "Towards incorporating affective feedback into context-aware intelligent environments",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2015/07344550/12OmNAndioP",
"parentPublication": {
"id": "proceedings/acii/2015/9953/0",
"title": "2015 International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipccc/2017/6468/0/08280504",
"title": "Biomedical signal transmission using human body communication",
"doi": null,
"abstractUrl": "/proceedings-article/ipccc/2017/08280504/12OmNB9bvjX",
"parentPublication": {
"id": "proceedings/ipccc/2017/6468/0",
"title": "2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci-cc/2012/2795/0/06311136",
"title": "Textual affect sensing and affective communication",
"doi": null,
"abstractUrl": "/proceedings-article/icci-cc/2012/06311136/12OmNxd4tvz",
"parentPublication": {
"id": "proceedings/icci-cc/2012/2795/0",
"title": "2012 11th IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2017/1792/0/1792b301",
"title": "Reducing Cellular Signaling Traffic for Heartbeat Messages via Energy-Efficient D2D Forwarding",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2017/1792b301/12OmNxy4MYP",
"parentPublication": {
"id": "proceedings/icdcs/2017/1792/0",
"title": "2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2017/6549/0/07966748",
"title": "Biological Responsiveness in Observing Sexual Attractiveness of Woman",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2017/07966748/12OmNyTOsjT",
"parentPublication": {
"id": "proceedings/bigmm/2017/6549/0",
"title": "2017 IEEE Third International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imis/2016/0984/0/0984a139",
"title": "Feedback of Laughter by Detecting Variation in Respiration Amplitude for Augmenting Laughter",
"doi": null,
"abstractUrl": "/proceedings-article/imis/2016/0984a139/12OmNz61dGy",
"parentPublication": {
"id": "proceedings/imis/2016/0984/0",
"title": "2016 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2015/04/07106477",
"title": "Recognizing Emotions Induced by Affective Sounds through Heart Rate Variability",
"doi": null,
"abstractUrl": "/journal/ta/2015/04/07106477/13rRUxjyX2u",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2020/03/08301612",
"title": "Classifying Affective Haptic Stimuli through Gender-Specific Heart Rate Variability Nonlinear Analysis",
"doi": null,
"abstractUrl": "/journal/ta/2020/03/08301612/13rRUy0qnC5",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2018/2666/1/266601a805",
"title": "A Framework for Real Time Emotion Recognition Based on Human ANS Using Pervasive Device",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2018/266601a805/144U9atbOEv",
"parentPublication": {
"id": "proceedings/compsac/2018/2666/2",
"title": "2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2020/7624/0/762400b091",
"title": "Proposal of Heartbeat-transmitting Application For Long-distance Communication",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2020/762400b091/1uGYuokI1j2",
"parentPublication": {
"id": "proceedings/csci/2020/7624/0",
"title": "2020 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "tta2010020081",
"articleId": "13rRUygT7wJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "tta2010020098",
"articleId": "13rRUwdrdR7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvmXJ4f",
"title": "May",
"year": "2019",
"issueNum": "05",
"idPrefix": "tm",
"pubType": "journal",
"volume": "18",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIIVldt",
"doi": "10.1109/TMC.2018.2857809",
"abstract": "Mobile devices differ from desktop computers in that they have a limited power source, a battery, and they tend to spend more CPU time on the graphical user interface (GUI). These two facts force us to consider different software approaches in the mobile device kernel that can conserve battery life and reduce latency, which is the duration of time between the inception of an event and the reaction to the event. One area to consider is a software package called the display server. The display server is middleware that handles all GUI activities between an application and the operating system, such as event handling and drawing to the screen. In both desktop and mobile devices, the display server is located in the application layer. However, the kernel layer contains most of the information needed for handling events and drawing graphics, which forces the application-level display server to make a series of system calls in order to coordinate events and to draw graphics. These calls interrupt the CPU which can increase both latency and power consumption, and also require the kernel to maintain event queues that duplicate event queues in the display server. A further drawback of placing the display server in the application layer is that the display server contains most of the information required to efficiently schedule the application and this information is not communicated to existing kernels, meaning that GUI-oriented applications are scheduled less efficiently than they might be, which further increases power consumption. We propose moving the display server to the kernel layer, so that it has direct access to many of the event queues and hardware rendering systems without having to interrupt the CPU. This adjustment has allowed us to implement two power saving strategies, discussed in other papers, that streamline the event system and improve the scheduler. The combination of these two techniques reduces power consumption by an average of 30 percent and latency by an average of 17 ms. Even without the implementation of these power saving techniques, the KDS increases battery life by 4.35 percent or on average about 10 extra minutes for a typical mobile phone or 30 extra minutes for a typical tablet computer. It also reduces latency by 1.1 milliseconds.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Mobile devices differ from desktop computers in that they have a limited power source, a battery, and they tend to spend more CPU time on the graphical user interface (GUI). These two facts force us to consider different software approaches in the mobile device kernel that can conserve battery life and reduce latency, which is the duration of time between the inception of an event and the reaction to the event. One area to consider is a software package called the display server. The display server is middleware that handles all GUI activities between an application and the operating system, such as event handling and drawing to the screen. In both desktop and mobile devices, the display server is located in the application layer. However, the kernel layer contains most of the information needed for handling events and drawing graphics, which forces the application-level display server to make a series of system calls in order to coordinate events and to draw graphics. These calls interrupt the CPU which can increase both latency and power consumption, and also require the kernel to maintain event queues that duplicate event queues in the display server. A further drawback of placing the display server in the application layer is that the display server contains most of the information required to efficiently schedule the application and this information is not communicated to existing kernels, meaning that GUI-oriented applications are scheduled less efficiently than they might be, which further increases power consumption. We propose moving the display server to the kernel layer, so that it has direct access to many of the event queues and hardware rendering systems without having to interrupt the CPU. This adjustment has allowed us to implement two power saving strategies, discussed in other papers, that streamline the event system and improve the scheduler. The combination of these two techniques reduces power consumption by an average of 30 percent and latency by an average of 17 ms. Even without the implementation of these power saving techniques, the KDS increases battery life by 4.35 percent or on average about 10 extra minutes for a typical mobile phone or 30 extra minutes for a typical tablet computer. It also reduces latency by 1.1 milliseconds.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Mobile devices differ from desktop computers in that they have a limited power source, a battery, and they tend to spend more CPU time on the graphical user interface (GUI). These two facts force us to consider different software approaches in the mobile device kernel that can conserve battery life and reduce latency, which is the duration of time between the inception of an event and the reaction to the event. One area to consider is a software package called the display server. The display server is middleware that handles all GUI activities between an application and the operating system, such as event handling and drawing to the screen. In both desktop and mobile devices, the display server is located in the application layer. However, the kernel layer contains most of the information needed for handling events and drawing graphics, which forces the application-level display server to make a series of system calls in order to coordinate events and to draw graphics. These calls interrupt the CPU which can increase both latency and power consumption, and also require the kernel to maintain event queues that duplicate event queues in the display server. A further drawback of placing the display server in the application layer is that the display server contains most of the information required to efficiently schedule the application and this information is not communicated to existing kernels, meaning that GUI-oriented applications are scheduled less efficiently than they might be, which further increases power consumption. We propose moving the display server to the kernel layer, so that it has direct access to many of the event queues and hardware rendering systems without having to interrupt the CPU. This adjustment has allowed us to implement two power saving strategies, discussed in other papers, that streamline the event system and improve the scheduler. The combination of these two techniques reduces power consumption by an average of 30 percent and latency by an average of 17 ms. Even without the implementation of these power saving techniques, the KDS increases battery life by 4.35 percent or on average about 10 extra minutes for a typical mobile phone or 30 extra minutes for a typical tablet computer. It also reduces latency by 1.1 milliseconds.",
"title": "Reducing Event Latency and Power Consumption in Mobile Devices by Using a Kernel-Level Display Server",
"normalizedTitle": "Reducing Event Latency and Power Consumption in Mobile Devices by Using a Kernel-Level Display Server",
"fno": "08413093",
"hasPdf": true,
"idPrefix": "tm",
"keywords": [
"Graphical User Interfaces",
"Middleware",
"Mobile Computing",
"Notebook Computers",
"Power Aware Computing",
"Power Consumption",
"Rendering Computer Graphics",
"Software Packages",
"Application Layer",
"Kernel Layer",
"Drawing Graphics",
"Application Level Display Server",
"Power Consumption",
"Duplicate Event Queues",
"Kernel Level Display Server",
"Mobile Device Kernel",
"Reducing Event Latency",
"Desktop Devices",
"GUI Oriented Applications",
"CPU",
"Graphical User Interface",
"KDS",
"Middleware",
"Servers",
"Kernel",
"Mobile Handsets",
"Rendering Computer Graphics",
"Graphical User Interfaces",
"Power Demand",
"Androids",
"Graphical User Interfaces",
"Kernel Display Server",
"Event Handling"
],
"authors": [
{
"givenName": "Stephen",
"surname": "Marz",
"fullName": "Stephen Marz",
"affiliation": "Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Brad Vander",
"surname": "Zanden",
"fullName": "Brad Vander Zanden",
"affiliation": "Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wei",
"surname": "Gao",
"fullName": "Wei Gao",
"affiliation": "Department of Electrical and Computer Engineering, University of Pittsburgh, Pittsburgh, PA, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2019-05-01 00:00:00",
"pubType": "trans",
"pages": "1174-1187",
"year": "2019",
"issn": "1536-1233",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/compsac/2015/6564/2/6564b248",
"title": "A Context-Aware Approach for Dynamic GUI Testing of Android Applications",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2015/6564b248/12OmNAqkSDG",
"parentPublication": {
"id": "compsac/2015/6564/2",
"title": "2015 IEEE 39th Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2015/5594/0/5594a111",
"title": "Mining Android App Usages for Generating Actionable GUI-Based Execution Scenarios",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2015/5594a111/12OmNqJHFLB",
"parentPublication": {
"id": "proceedings/msr/2015/5594/0",
"title": "2015 IEEE/ACM 12th Working Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2015/1775/0/1775a236",
"title": "Implementation of Application Softwares for Reducing Power Consumption in Web Services",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2015/1775a236/12OmNs5rl8n",
"parentPublication": {
"id": "proceedings/waina/2015/1775/0",
"title": "2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops (WAINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icst/2017/6031/0/6031a161",
"title": "ATOM: Automatic Maintenance of GUI Test Scripts for Evolving Mobile Applications",
"doi": null,
"abstractUrl": "/proceedings-article/icst/2017/6031a161/12OmNxcMSlI",
"parentPublication": {
"id": "proceedings/icst/2017/6031/0",
"title": "2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2016/02/07118153",
"title": "Improving Multicore Server Performance and Reducing Energy Consumption by Workload Dependent Dynamic Power Management",
"doi": null,
"abstractUrl": "/journal/cc/2016/02/07118153/13rRUILLkxu",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2018/2666/1/266601a090",
"title": "Exploration Scheduling for Replay Events in GUI Testing on Android Apps",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2018/266601a090/144U9bx2KPe",
"parentPublication": {
"id": "proceedings/compsac/2018/2666/2",
"title": "2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2019/01/08344562",
"title": "Mobile Display Power Reduction for Video Using Standardized Metadata",
"doi": null,
"abstractUrl": "/journal/tm/2019/01/08344562/17D45X2fUFq",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2023/01/09712410",
"title": "Nighthawk: Fully Automated Localizing UI Display Issues via Visual Understanding",
"doi": null,
"abstractUrl": "/journal/ts/2023/01/09712410/1AZLrgVaYLK",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2020/6768/0/676800a398",
"title": "Owl Eyes: Spotting UI Display Issues via Visual Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2020/676800a398/1pP3H5wW7te",
"parentPublication": {
"id": "proceedings/ase/2020/6768/0",
"title": "2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2020/6768/0/676800b373",
"title": "Discovering UI Display Issues with Visual Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2020/676800b373/1pP3MbJedX2",
"parentPublication": {
"id": "proceedings/ase/2020/6768/0",
"title": "2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "08404117",
"articleId": "13rRUxAAT8t",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08413166",
"articleId": "13rRUxly96l",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqJHFwx",
"title": "April",
"year": "2016",
"issueNum": "04",
"idPrefix": "tg",
"pubType": "journal",
"volume": "22",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwInvyD",
"doi": "10.1109/TVCG.2016.2518079",
"abstract": "Latency - the delay between a user's action and the response to this action - is known to be detrimental to virtual reality. Latency is typically considered to be a discrete value characterising a delay, constant in time and space - but this characterisation is incomplete. Latency changes across the display during scan-out, and how it does so is dependent on the rendering approach used. In this study, we present an ultra-low latency real-time ray-casting renderer for virtual reality, implemented on an FPGA. Our renderer has a latency of ~1 ms from ‘tracker to pixel'. Its frameless nature means that the region of the display with the lowest latency immediately follows the scan-beam. This is in contrast to frame-based systems such as those using typical GPUs, for which the latency increases as scan-out proceeds. Using a series of high and low speed videos of our system in use, we confirm its latency of ~1 ms. We examine how the renderer performs when driving a traditional sequential scan-out display on a readily available HMO, the Oculus Rift OK2. We contrast this with an equivalent apparatus built using a GPU. Using captured human head motion and a set of image quality measures, we assess the ability of these systems to faithfully recreate the stimuli of an ideal virtual reality system - one with a zero latency tracker, renderer and display running at 1 kHz. Finally, we examine the results of these quality measures, and how each rendering approach is affected by velocity of movement and display persistence. We find that our system, with a lower average latency, can more faithfully draw what the ideal virtual reality system would. Further, we find that with low display persistence, the sensitivity to velocity of both systems is lowered, but that it is much lower for ours.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Latency - the delay between a user's action and the response to this action - is known to be detrimental to virtual reality. Latency is typically considered to be a discrete value characterising a delay, constant in time and space - but this characterisation is incomplete. Latency changes across the display during scan-out, and how it does so is dependent on the rendering approach used. In this study, we present an ultra-low latency real-time ray-casting renderer for virtual reality, implemented on an FPGA. Our renderer has a latency of ~1 ms from ‘tracker to pixel'. Its frameless nature means that the region of the display with the lowest latency immediately follows the scan-beam. This is in contrast to frame-based systems such as those using typical GPUs, for which the latency increases as scan-out proceeds. Using a series of high and low speed videos of our system in use, we confirm its latency of ~1 ms. We examine how the renderer performs when driving a traditional sequential scan-out display on a readily available HMO, the Oculus Rift OK2. We contrast this with an equivalent apparatus built using a GPU. Using captured human head motion and a set of image quality measures, we assess the ability of these systems to faithfully recreate the stimuli of an ideal virtual reality system - one with a zero latency tracker, renderer and display running at 1 kHz. Finally, we examine the results of these quality measures, and how each rendering approach is affected by velocity of movement and display persistence. We find that our system, with a lower average latency, can more faithfully draw what the ideal virtual reality system would. Further, we find that with low display persistence, the sensitivity to velocity of both systems is lowered, but that it is much lower for ours.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Latency - the delay between a user's action and the response to this action - is known to be detrimental to virtual reality. Latency is typically considered to be a discrete value characterising a delay, constant in time and space - but this characterisation is incomplete. Latency changes across the display during scan-out, and how it does so is dependent on the rendering approach used. In this study, we present an ultra-low latency real-time ray-casting renderer for virtual reality, implemented on an FPGA. Our renderer has a latency of ~1 ms from ‘tracker to pixel'. Its frameless nature means that the region of the display with the lowest latency immediately follows the scan-beam. This is in contrast to frame-based systems such as those using typical GPUs, for which the latency increases as scan-out proceeds. Using a series of high and low speed videos of our system in use, we confirm its latency of ~1 ms. We examine how the renderer performs when driving a traditional sequential scan-out display on a readily available HMO, the Oculus Rift OK2. We contrast this with an equivalent apparatus built using a GPU. Using captured human head motion and a set of image quality measures, we assess the ability of these systems to faithfully recreate the stimuli of an ideal virtual reality system - one with a zero latency tracker, renderer and display running at 1 kHz. Finally, we examine the results of these quality measures, and how each rendering approach is affected by velocity of movement and display persistence. We find that our system, with a lower average latency, can more faithfully draw what the ideal virtual reality system would. Further, we find that with low display persistence, the sensitivity to velocity of both systems is lowered, but that it is much lower for ours.",
"title": "Construction and Evaluation of an Ultra Low Latency Frameless Renderer for VR",
"normalizedTitle": "Construction and Evaluation of an Ultra Low Latency Frameless Renderer for VR",
"fno": "07383313",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Rendering Computer Graphics",
"Hardware",
"Virtual Reality",
"Image Quality",
"Delays",
"Ray Tracing",
"Graphics Processing Units",
"Hardware Acceleration",
"Low Latency",
"Frameless Rendering",
"Image Quality",
"Ray Casting",
"Hardware Acceleration",
"Low Latency",
"Frameless Rendering",
"Image Quality",
"Ray Casting"
],
"authors": [
{
"givenName": "Sebastian",
"surname": "Friston",
"fullName": "Sebastian Friston",
"affiliation": ", University College, London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Anthony",
"surname": "Steed",
"fullName": "Anthony Steed",
"affiliation": ", University College, London",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simon",
"surname": "Tilbury",
"fullName": "Simon Tilbury",
"affiliation": ", Maxeler Technologies Ltd.",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Georgi",
"surname": "Gaydadjiev",
"fullName": "Georgi Gaydadjiev",
"affiliation": ", Maxeler Technologies Ltd.",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "04",
"pubDate": "2016-04-01 00:00:00",
"pubType": "trans",
"pages": "1377-1386",
"year": "2016",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/visual/1992/2897/0/00235204",
"title": "A scientific visualization renderer",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1992/00235204/12OmNAkWvbq",
"parentPublication": {
"id": "proceedings/visual/1992/2897/0",
"title": "Proceedings Visualization '92",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/supercomputing/1996/854/0/01392885",
"title": "STREN: A Highly Scalable Parallel Stereo Terrain Renderer for Planetary Mission Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/supercomputing/1996/01392885/12OmNC8MsyN",
"parentPublication": {
"id": "proceedings/supercomputing/1996/854/0",
"title": "Proceedings of the 1996 ACM/IEEE Conference on Supercomputing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1996/2642/0/26420008",
"title": "STREN: A Highly Scalable Parallel Stereo Terrain Renderer for Planetary Mission Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1996/26420008/12OmNzBwGyD",
"parentPublication": {
"id": "proceedings/sc/1996/2642/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2014/8065/0/8065a240",
"title": "Ray-Traced Reflections in Real-Time Using Heuristic Based Hybrid Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2014/8065a240/12OmNzTYC4n",
"parentPublication": {
"id": "proceedings/sbgames/2014/8065/0",
"title": "2014 Brazilian Symposium on Computer Games and Digital Entertainment (SBGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visapp/2014/8133/3/07295056",
"title": "Towards a heuristic based real time hybrid rendering a strategy to improve real time rendering quality using heuristics and ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07295056/12OmNzZmZku",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/2",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/04/07383304",
"title": "From Motion to Photons in 80 Microseconds: Towards Minimal Latency for Virtual and Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07383304/13rRUxAATgz",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/02/07117432",
"title": "Frameless Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2016/02/07117432/13rRUxcbnHd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2020/03/09082277",
"title": "Low-Latency Rendering With Dataflow Architectures",
"doi": null,
"abstractUrl": "/magazine/cg/2020/03/09082277/1jqf9YuWiyI",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/08/09286513",
"title": "Accelerating Unstructured Mesh Point Location With RT Cores",
"doi": null,
"abstractUrl": "/journal/tg/2022/08/09286513/1porhlu0eEo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2009/3943/0/04810995",
"title": "An Image-Warping Architecture for VR: Low Latency versus Image Quality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2009/04810995/1t2n7unazjW",
"parentPublication": {
"id": "proceedings/vr/2009/3943/0",
"title": "2009 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07383304",
"articleId": "13rRUxAATgz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07383328",
"articleId": "13rRUxASuvi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNARAndl",
"title": "May-June",
"year": "2020",
"issueNum": "03",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "40",
"label": "May-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1jqf9YuWiyI",
"doi": "10.1109/MCG.2020.2980183",
"abstract": "Recent years have seen a resurgence of virtual reality (VR), sparked by the repurposing of low-cost COTS components. VR aims to generate stimuli that appear to come from a source other than the interface through which they are delivered. The synthetic stimuli replace real-world stimuli, and transport the user to another, perhaps imaginary, “place.” To do this, we must overcome many challenges, often related to matching the synthetic stimuli to the expectations and behavior of the real world. One way in which the stimuli can fail is its latency–– the time between a user's action and the computer's response. We constructed a novel VR renderer, that optimized latency above all else. Our prototype allowed us to explore how latency affects human–computer interaction. We had to completely reconsider the interaction between time, space, and synchronization on displays and in the traditional graphics pipeline. Using a specialized architecture––dataflow computing––we combined consumer, industrial, and prototype components to create an integrated 1:1 room-scale VR system with a latency of under 3 ms. While this was prototype hardware, the considerations in achieving this performance inform the design of future VR pipelines, and our human factors studies have provided new and sometimes surprising contributions to the body of knowledge on latency in HCI.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent years have seen a resurgence of virtual reality (VR), sparked by the repurposing of low-cost COTS components. VR aims to generate stimuli that appear to come from a source other than the interface through which they are delivered. The synthetic stimuli replace real-world stimuli, and transport the user to another, perhaps imaginary, “place.” To do this, we must overcome many challenges, often related to matching the synthetic stimuli to the expectations and behavior of the real world. One way in which the stimuli can fail is its latency–– the time between a user's action and the computer's response. We constructed a novel VR renderer, that optimized latency above all else. Our prototype allowed us to explore how latency affects human–computer interaction. We had to completely reconsider the interaction between time, space, and synchronization on displays and in the traditional graphics pipeline. Using a specialized architecture––dataflow computing––we combined consumer, industrial, and prototype components to create an integrated 1:1 room-scale VR system with a latency of under 3 ms. While this was prototype hardware, the considerations in achieving this performance inform the design of future VR pipelines, and our human factors studies have provided new and sometimes surprising contributions to the body of knowledge on latency in HCI.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent years have seen a resurgence of virtual reality (VR), sparked by the repurposing of low-cost COTS components. VR aims to generate stimuli that appear to come from a source other than the interface through which they are delivered. The synthetic stimuli replace real-world stimuli, and transport the user to another, perhaps imaginary, “place.” To do this, we must overcome many challenges, often related to matching the synthetic stimuli to the expectations and behavior of the real world. One way in which the stimuli can fail is its latency–– the time between a user's action and the computer's response. We constructed a novel VR renderer, that optimized latency above all else. Our prototype allowed us to explore how latency affects human–computer interaction. We had to completely reconsider the interaction between time, space, and synchronization on displays and in the traditional graphics pipeline. Using a specialized architecture––dataflow computing––we combined consumer, industrial, and prototype components to create an integrated 1:1 room-scale VR system with a latency of under 3 ms. While this was prototype hardware, the considerations in achieving this performance inform the design of future VR pipelines, and our human factors studies have provided new and sometimes surprising contributions to the body of knowledge on latency in HCI.",
"title": "Low-Latency Rendering With Dataflow Architectures",
"normalizedTitle": "Low-Latency Rendering With Dataflow Architectures",
"fno": "09082277",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Flow Computing",
"Human Computer Interaction",
"Rendering Computer Graphics",
"Synchronisation",
"Virtual Reality",
"Synchronization",
"Dataflow Computing",
"VR Renderer",
"Low Latency Rendering",
"Human Computer Interaction",
"Low Cost COTS Components",
"Virtual Reality",
"Human Computer Interaction",
"Prototypes",
"Rendering Computer Graphics",
"Computer Architecture",
"Virtual Reality"
],
"authors": [
{
"givenName": "Sebastian",
"surname": "Friston",
"fullName": "Sebastian Friston",
"affiliation": "University College London",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "2020-05-01 00:00:00",
"pubType": "mags",
"pages": "94-104",
"year": "2020",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2016/0836/0/07504733",
"title": "A low-cost, low-latency approach to dynamic immersion in occlusive head-mounted displays",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504733/12OmNBEGYLT",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2018/6871/0/687101b557",
"title": "Low Latency Edge Rendering Scheme for Interactive 360 Degree Virtual Reality Gaming",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2018/687101b557/12OmNBTJIKk",
"parentPublication": {
"id": "proceedings/icdcs/2018/6871/0",
"title": "2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccima/1999/0300/0/03000354",
"title": "Development of Virtual Interfaces Using Configurable Templates",
"doi": null,
"abstractUrl": "/proceedings-article/iccima/1999/03000354/12OmNwkhTfw",
"parentPublication": {
"id": "proceedings/iccima/1999/0300/0",
"title": "Computational Intelligence and Multimedia Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2007/3005/0/30050277",
"title": "Integrating Force and Tactile Rendering Into a Single VR System",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2007/30050277/12OmNwvVryK",
"parentPublication": {
"id": "proceedings/cw/2007/3005/0",
"title": "2007 International Conference on Cyberworlds (CW'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/1999/0093/0/00930046",
"title": "ALCOVE: Design and Implementation of an Object-Centric Virtual Environment",
"doi": null,
"abstractUrl": "/proceedings-article/vr/1999/00930046/12OmNzcPA7V",
"parentPublication": {
"id": "proceedings/vr/1999/0093/0",
"title": "Proceedings of Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/04/07383313",
"title": "Construction and Evaluation of an Ultra Low Latency Frameless Renderer for VR",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07383313/13rRUwInvyD",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/12/07050364",
"title": "Latency in Distributed Acquisition and Rendering for Telepresence Systems",
"doi": null,
"abstractUrl": "/journal/tg/2015/12/07050364/13rRUy3gn7A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a905",
"title": "Haptics in VR Using Origami-Augmented Drones",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a905/1J7WrPcWIVO",
"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/vrw/2020/6532/0/09090611",
"title": "Pain Experience in Social VR: The Competing Effect on Objective Pain Tolerance and Subjective Pain Perception",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090611/1jIxokdBogo",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a599",
"title": "CDVVAR: VR/AR Collaborative Data Visualization Tool",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a599/1tnXiU5GF9K",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09082281",
"articleId": "1jqfbRdclvq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09082279",
"articleId": "1jqfdtaywo0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1sP18ke9Y64",
"title": "May",
"year": "2021",
"issueNum": "05",
"idPrefix": "tg",
"pubType": "journal",
"volume": "27",
"label": "May",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1saZD2BiBMc",
"doi": "10.1109/TVCG.2021.3067778",
"abstract": "Haptic sensation plays an important role in providing physical information to users in both real environments and virtual environments. To produce high-fidelity haptic feedback, various haptic devices and tactile rendering methods have been explored in myriad scenarios, and perception deviation between a virtual environment and a real environment has been investigated. However, the tactile sensitivity for touch perception in a virtual environment has not been fully studied; thus, the necessary guidance to design haptic feedback quantitatively for virtual reality systems is lacking. This paper aims to investigate users' tactile sensitivity and explore the perceptual thresholds when users are immersed in a virtual environment by utilizing electrovibration tactile feedback and by generating tactile stimuli with different waveform, frequency and amplitude characteristics. Hence, two psychophysical experiments were designed, and the experimental results were analyzed. We believe that the significance and potential of our study on tactile perceptual thresholds can promote future research that focuses on creating a favorable haptic experience for VR applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Haptic sensation plays an important role in providing physical information to users in both real environments and virtual environments. To produce high-fidelity haptic feedback, various haptic devices and tactile rendering methods have been explored in myriad scenarios, and perception deviation between a virtual environment and a real environment has been investigated. However, the tactile sensitivity for touch perception in a virtual environment has not been fully studied; thus, the necessary guidance to design haptic feedback quantitatively for virtual reality systems is lacking. This paper aims to investigate users' tactile sensitivity and explore the perceptual thresholds when users are immersed in a virtual environment by utilizing electrovibration tactile feedback and by generating tactile stimuli with different waveform, frequency and amplitude characteristics. Hence, two psychophysical experiments were designed, and the experimental results were analyzed. We believe that the significance and potential of our study on tactile perceptual thresholds can promote future research that focuses on creating a favorable haptic experience for VR applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Haptic sensation plays an important role in providing physical information to users in both real environments and virtual environments. To produce high-fidelity haptic feedback, various haptic devices and tactile rendering methods have been explored in myriad scenarios, and perception deviation between a virtual environment and a real environment has been investigated. However, the tactile sensitivity for touch perception in a virtual environment has not been fully studied; thus, the necessary guidance to design haptic feedback quantitatively for virtual reality systems is lacking. This paper aims to investigate users' tactile sensitivity and explore the perceptual thresholds when users are immersed in a virtual environment by utilizing electrovibration tactile feedback and by generating tactile stimuli with different waveform, frequency and amplitude characteristics. Hence, two psychophysical experiments were designed, and the experimental results were analyzed. We believe that the significance and potential of our study on tactile perceptual thresholds can promote future research that focuses on creating a favorable haptic experience for VR applications.",
"title": "Tactile Perceptual Thresholds of Electrovibration in VR",
"normalizedTitle": "Tactile Perceptual Thresholds of Electrovibration in VR",
"fno": "09382899",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Haptic Interfaces",
"Rendering Computer Graphics",
"Touch Physiological",
"Virtual Reality",
"Tactile Stimuli",
"Tactile Perceptual Thresholds",
"Favorable Haptic Experience",
"Haptic Sensation",
"Virtual Environment",
"High Fidelity Haptic Feedback",
"Haptic Devices",
"Tactile Rendering Methods",
"Tactile Sensitivity",
"Virtual Reality Systems",
"Users",
"Electrovibration Tactile Feedback",
"Haptic Interfaces",
"Sensitivity",
"Virtual Environments",
"Tactile Sensors",
"Visualization",
"Correlation",
"Estimation",
"Tactile Perception",
"Virtual Reality",
"Perceptual Threshold",
"Electrovibration Electrovibration"
],
"authors": [
{
"givenName": "Lu",
"surname": "Zhao",
"fullName": "Lu Zhao",
"affiliation": "Beijing Engineering Research Center of Mixed Reality and Advanced Display, School of Optics and Photonics, Beijing Institute of Technology, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Liu",
"fullName": "Yue Liu",
"affiliation": "Beijing Engineering Research Center of Mixed Reality and Advanced Display, School of Optics and Photonics, Beijing Institute of Technology, and AICFVE of Beijing Film Academy, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weitao",
"surname": "Song",
"fullName": "Weitao Song",
"affiliation": "Beijing Engineering Research Center of Mixed Reality and Advanced Display, School of Optics and Photonics, Beijing Institute of Technology, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2021-05-01 00:00:00",
"pubType": "trans",
"pages": "2618-2626",
"year": "2021",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2014/2871/0/06802106",
"title": "An ungrounded tactile feedback device to portray force and torque-like interactions in virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802106/12OmNAg7jYE",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2014/4261/0/4261a230",
"title": "Tactile Interface for Navigation in Underground Mines",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2014/4261a230/12OmNqBtiLI",
"parentPublication": {
"id": "proceedings/svr/2014/4261/0",
"title": "2014 XVI Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2009/3890/0/3890a425",
"title": "Touchable Video and Tactile Audio",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2009/3890a425/12OmNxTmHIC",
"parentPublication": {
"id": "proceedings/ism/2009/3890/0",
"title": "2009 11th IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2010/6821/0/05444650",
"title": "A finger attachment to generate tactile feedback and make 3D gesture detectable by touch panel sensor",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2010/05444650/12OmNxveNHK",
"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/isvri/2011/0054/0/05759662",
"title": "Pseudo-haptic feedback augmented with visual and tactile vibrations",
"doi": null,
"abstractUrl": "/proceedings-article/isvri/2011/05759662/12OmNzvz6OE",
"parentPublication": {
"id": "proceedings/isvri/2011/0054/0",
"title": "2011 IEEE International Symposium on VR Innovation (ISVRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2018/6909/0/690901a092",
"title": "The Development of a Virtual Doll Companion for Haptic Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2018/690901a092/13bd1AITnav",
"parentPublication": {
"id": "proceedings/nicoint/2018/6909/0",
"title": "2018 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446054",
"title": "Keynote Speaker Tactile Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446054/13bd1h03qOn",
"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/ismar-adjunct/2022/5365/0/536500a588",
"title": "Effects of Tactile Feedback on Conceptual Understanding of Electromagnetism in a Virtual Reality Experience",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a588/1J7W7VSYX84",
"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/vr/2019/1377/0/08797921",
"title": "TacTiles: Dual-Mode Low-Power Electromagnetic Actuators for Rendering Continuous Contact and Spatial Haptic Patterns in VR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797921/1cJ1a9pQj3G",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090452",
"title": "Detection Thresholds of Tactile Perception in Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090452/1jIxnAwbrSo",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09382928",
"articleId": "1saZuaAmvlu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09382898",
"articleId": "1saZv7Dd9Ty",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNznkK74",
"title": "Jan.",
"year": "2020",
"issueNum": "01",
"idPrefix": "ts",
"pubType": "journal",
"volume": "46",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUytF43e",
"doi": "10.1109/TSE.2018.2834900",
"abstract": "We present a quasi-experiment to investigate whether, and to what extent, sleep deprivation impacts the performance of novice software developers using the agile practice of test-first development (TFD). We recruited 45 undergraduates, and asked them to tackle a programming task. Among the participants, 23 agreed to stay awake the night before carrying out the task, while 22 slept normally. We analyzed the quality (i.e., the functional correctness) of the implementations delivered by the participants in both groups, their engagement in writing source code (i.e., the amount of activities performed in the IDE while tackling the programming task) and ability to apply TFD (i.e., the extent to which a participant is able to apply this practice). By comparing the two groups of participants, we found that a single night of sleep deprivation leads to a reduction of 50 percent in the quality of the implementations. There is notable evidence that the developers' engagement and their prowess to apply TFD are negatively impacted. Our results also show that sleep-deprived developers make more fixes to syntactic mistakes in the source code. We conclude that sleep deprivation has possibly disruptive effects on software development activities. The results open opportunities for improving developers' performance by integrating the study of sleep with other psycho-physiological factors in which the software engineering research community has recently taken an interest in.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a quasi-experiment to investigate whether, and to what extent, sleep deprivation impacts the performance of novice software developers using the agile practice of test-first development (TFD). We recruited 45 undergraduates, and asked them to tackle a programming task. Among the participants, 23 agreed to stay awake the night before carrying out the task, while 22 slept normally. We analyzed the quality (i.e., the functional correctness) of the implementations delivered by the participants in both groups, their engagement in writing source code (i.e., the amount of activities performed in the IDE while tackling the programming task) and ability to apply TFD (i.e., the extent to which a participant is able to apply this practice). By comparing the two groups of participants, we found that a single night of sleep deprivation leads to a reduction of 50 percent in the quality of the implementations. There is notable evidence that the developers' engagement and their prowess to apply TFD are negatively impacted. Our results also show that sleep-deprived developers make more fixes to syntactic mistakes in the source code. We conclude that sleep deprivation has possibly disruptive effects on software development activities. The results open opportunities for improving developers' performance by integrating the study of sleep with other psycho-physiological factors in which the software engineering research community has recently taken an interest in.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a quasi-experiment to investigate whether, and to what extent, sleep deprivation impacts the performance of novice software developers using the agile practice of test-first development (TFD). We recruited 45 undergraduates, and asked them to tackle a programming task. Among the participants, 23 agreed to stay awake the night before carrying out the task, while 22 slept normally. We analyzed the quality (i.e., the functional correctness) of the implementations delivered by the participants in both groups, their engagement in writing source code (i.e., the amount of activities performed in the IDE while tackling the programming task) and ability to apply TFD (i.e., the extent to which a participant is able to apply this practice). By comparing the two groups of participants, we found that a single night of sleep deprivation leads to a reduction of 50 percent in the quality of the implementations. There is notable evidence that the developers' engagement and their prowess to apply TFD are negatively impacted. Our results also show that sleep-deprived developers make more fixes to syntactic mistakes in the source code. We conclude that sleep deprivation has possibly disruptive effects on software development activities. The results open opportunities for improving developers' performance by integrating the study of sleep with other psycho-physiological factors in which the software engineering research community has recently taken an interest in.",
"title": "Need for Sleep: The Impact of a Night of Sleep Deprivation on Novice Developers’ Performance",
"normalizedTitle": "Need for Sleep: The Impact of a Night of Sleep Deprivation on Novice Developers’ Performance",
"fno": "08357494",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [
"Computer Aided Instruction",
"Computer Science Education",
"Sleep",
"Software Engineering",
"Source Code",
"Sleep Deprivation",
"Software Development Activities",
"Novice Software Developers",
"TFD",
"Programming Task",
"Sleep Deprived Developers",
"Sleep",
"Software",
"Task Analysis",
"Biomedical Monitoring",
"Software Engineering",
"Programming",
"Functional Magnetic Resonance Imaging",
"Sleep Deprivation",
"Psycho Physiological Factors",
"Test First Development"
],
"authors": [
{
"givenName": "Davide",
"surname": "Fucci",
"fullName": "Davide Fucci",
"affiliation": "HITeC, University of Hamburg, Hamburg, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Giuseppe",
"surname": "Scanniello",
"fullName": "Giuseppe Scanniello",
"affiliation": "DiMIE, University of Basilicata, Potenza, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Simone",
"surname": "Romano",
"fullName": "Simone Romano",
"affiliation": "DiMIE, University of Basilicata, Potenza, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Natalia",
"surname": "Juristo",
"fullName": "Natalia Juristo",
"affiliation": "Technical University of Madrid, Madrid, Spain",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2020-01-01 00:00:00",
"pubType": "trans",
"pages": "1-19",
"year": "2020",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ibica/2012/2838/0/06337651",
"title": "A Personalized Sleep Quality Assessment Mechanism Based on Sleep Pattern Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ibica/2012/06337651/12OmNBAIAO6",
"parentPublication": {
"id": "proceedings/ibica/2012/2838/0",
"title": "2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications (IBICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/segah/2014/4823/0/07067080",
"title": "A lightweight method for detecting sleep-related activities based on load sensing",
"doi": null,
"abstractUrl": "/proceedings-article/segah/2014/07067080/12OmNBAIAQc",
"parentPublication": {
"id": "proceedings/segah/2014/4823/0",
"title": "2014 IEEE 3rd International Conference on Serious Games and Applications for Health (SeGAH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2009/3656/0/3656a439",
"title": "Automated Sleep Staging Using Single EEG Channel for REM Sleep Deprivation",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2009/3656a439/12OmNBh8gP9",
"parentPublication": {
"id": "proceedings/bibe/2009/3656/0",
"title": "2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2010/9167/0/06042695",
"title": "Discovery of sleep composition types using expectation-maximization",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2010/06042695/12OmNqBbI2M",
"parentPublication": {
"id": "proceedings/cbms/2010/9167/0",
"title": "2010 IEEE 23rd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2015/8302/0/8302a239",
"title": "Sleep Deprivation Increased Dopamine D2 Receptor Expression through Downregulation of miR-9",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2015/8302a239/12OmNyuy9Me",
"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": "trans/tg/2016/04/07383309",
"title": "Augmented Reality as a Countermeasure for Sleep Deprivation",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07383309/13rRUxOve9N",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2016/06/07173047",
"title": "Sleep Hunter: Towards Fine Grained Sleep Stage Tracking with Smartphones",
"doi": null,
"abstractUrl": "/journal/tm/2016/06/07173047/13rRUygBw7K",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2022/9617/0/961700a589",
"title": "A Comparison of Spatial Augmented Reality Predictive Cues and their Effects on Sleep Deprived Users",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a589/1CJbSaiJUQg",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2020/02/08996101",
"title": "An Internet of Things Fog-Assisted Sleep-Deprivation Prediction Framework for Spinal Cord Injury Patients",
"doi": null,
"abstractUrl": "/magazine/co/2020/02/08996101/1hmvCkaojKM",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/09/09392272",
"title": "XSleepNet: Multi-View Sequential Model for Automatic Sleep Staging",
"doi": null,
"abstractUrl": "/journal/tp/2022/09/09392272/1sq7raauMmY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "08359344",
"articleId": "13rRUxC0SQw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1EMUZqddPs4",
"title": "April-June",
"year": "2022",
"issueNum": "02",
"idPrefix": "pc",
"pubType": "magazine",
"volume": "21",
"label": "April-June",
"downloadables": {
"hasCover": true,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1D6mMcknTl6",
"doi": "10.1109/MPRV.2022.3164334",
"abstract": "Personal informatics systems can help people promote their health and well-being. Recent studies have shown that such systems can be used to infer relevant health indicators such as, e.g., stress, anxiety, and sleeping habits. While automatic detection of sleep has been studied extensively, there is a lack of studies exploring how population and personalized models influence the performance of sleep detection. In this article, we address this challenge by investigating the recognition of sleep/wake stages and high/low sleep quality with a focus on the impact of personalized models. To evaluate our approach, we collect a dataset of physiological signals and self-reports about sleep/wake times and sleep quality score. The dataset contains 6557 hours of sensor data collected using wristbands from 16 participants over one month. Our results show that personalized models perform significantly better than population models for sleep quality recognition, and are comparably good for sleep stage detection. The balanced accuracy for sleep/wake and high/low sleep quality are 92.2% and 61.51%, which are significantly higher than baseline classifiers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Personal informatics systems can help people promote their health and well-being. Recent studies have shown that such systems can be used to infer relevant health indicators such as, e.g., stress, anxiety, and sleeping habits. While automatic detection of sleep has been studied extensively, there is a lack of studies exploring how population and personalized models influence the performance of sleep detection. In this article, we address this challenge by investigating the recognition of sleep/wake stages and high/low sleep quality with a focus on the impact of personalized models. To evaluate our approach, we collect a dataset of physiological signals and self-reports about sleep/wake times and sleep quality score. The dataset contains 6557 hours of sensor data collected using wristbands from 16 participants over one month. Our results show that personalized models perform significantly better than population models for sleep quality recognition, and are comparably good for sleep stage detection. The balanced accuracy for sleep/wake and high/low sleep quality are 92.2% and 61.51%, which are significantly higher than baseline classifiers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Personal informatics systems can help people promote their health and well-being. Recent studies have shown that such systems can be used to infer relevant health indicators such as, e.g., stress, anxiety, and sleeping habits. While automatic detection of sleep has been studied extensively, there is a lack of studies exploring how population and personalized models influence the performance of sleep detection. In this article, we address this challenge by investigating the recognition of sleep/wake stages and high/low sleep quality with a focus on the impact of personalized models. To evaluate our approach, we collect a dataset of physiological signals and self-reports about sleep/wake times and sleep quality score. The dataset contains 6557 hours of sensor data collected using wristbands from 16 participants over one month. Our results show that personalized models perform significantly better than population models for sleep quality recognition, and are comparably good for sleep stage detection. The balanced accuracy for sleep/wake and high/low sleep quality are 92.2% and 61.51%, which are significantly higher than baseline classifiers.",
"title": "The Role of Model Personalization for Sleep Stage and Sleep Quality Recognition Using Wearables",
"normalizedTitle": "The Role of Model Personalization for Sleep Stage and Sleep Quality Recognition Using Wearables",
"fno": "09768202",
"hasPdf": true,
"idPrefix": "pc",
"keywords": [
"Medical Signal Processing",
"Personal Computing",
"Sleep",
"Wearable Computers",
"Model Personalization",
"Sleep Quality Recognition",
"Personal Informatics Systems",
"Health Indicators",
"Sleeping Habits",
"Personalized Models",
"Sleep Detection",
"Quality Score",
"Population Models",
"Sleep Stage Detection",
"Wearables",
"Physiological Signals",
"Time 6557 0 Hour",
"Sleep",
"Anxiety Disorders",
"Sensors",
"Physiology",
"Biomedical Monitoring",
"Temperature Sensors",
"Bioinformatics"
],
"authors": [
{
"givenName": "Shkurta",
"surname": "Gashi",
"fullName": "Shkurta Gashi",
"affiliation": "Università della Svizzera italiana, Lugano, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Lidia",
"surname": "Alecci",
"fullName": "Lidia Alecci",
"affiliation": "Università della Svizzera italiana, Lugano, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Elena Di",
"surname": "Lascio",
"fullName": "Elena Di Lascio",
"affiliation": "Università della Svizzera italiana, Lugano, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Maike E.",
"surname": "Debus",
"fullName": "Maike E. Debus",
"affiliation": "Universitè de Neuchâtel, Switzerland",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Francesca",
"surname": "Gasparini",
"fullName": "Francesca Gasparini",
"affiliation": "Università degli Studi di Milano-Bicocca, Milan, Italy",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Silvia",
"surname": "Santini",
"fullName": "Silvia Santini",
"affiliation": "Università della Svizzera italiana, Lugano, Switzerland",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2022-04-01 00:00:00",
"pubType": "mags",
"pages": "69-77",
"year": "2022",
"issn": "1536-1268",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/ibica/2012/2838/0/06337651",
"title": "A Personalized Sleep Quality Assessment Mechanism Based on Sleep Pattern Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ibica/2012/06337651/12OmNBAIAO6",
"parentPublication": {
"id": "proceedings/ibica/2012/2838/0",
"title": "2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications (IBICA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2017/3050/0/08217742",
"title": "Sleep/wake state prediction and sleep parameter estimation using unsupervised classification via clustering",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08217742/12OmNxwncIY",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichi/2014/5701/0/5701a125",
"title": "Towards Benchmarked Sleep Detection with Wrist-Worn Sensing Units",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2014/5701a125/12OmNyQGSjf",
"parentPublication": {
"id": "proceedings/ichi/2014/5701/0",
"title": "2014 IEEE International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2018/6568/0/08470323",
"title": "Sleep Analysis Using Motion and Head Detection",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2018/08470323/13WBGWbbRFH",
"parentPublication": {
"id": "proceedings/ssiai/2018/6568/0",
"title": "2018 IEEE Southwest Symposium on Image Analysis and Interpretation (SSIAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2016/06/07173047",
"title": "Sleep Hunter: Towards Fine Grained Sleep Stage Tracking with Smartphones",
"doi": null,
"abstractUrl": "/journal/tm/2016/06/07173047/13rRUygBw7K",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2018/7449/0/744900a265",
"title": "Sleep Activity Recognition Using Binary Motion Sensors",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2018/744900a265/17D45WB0qcF",
"parentPublication": {
"id": "proceedings/ictai/2018/7449/0",
"title": "2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669890",
"title": "Sleep Stage Classification Using Non-Invasive Bed Sensing and Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669890/1A9W7NiRafu",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020489",
"title": "An Automatic Sleep Arousal Detection Method by Enhancing U-Net with Spatial-channel Attention",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020489/1KfRcgyYMTK",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/01/08826242",
"title": "SMARS: Sleep Monitoring via Ambient Radio Signals",
"doi": null,
"abstractUrl": "/journal/tm/2021/01/08826242/1d6xAxz86LS",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2020/6215/0/09313279",
"title": "Sleep Stage Estimation Using ECG",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313279/1qmfRlJQolW",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09740539",
"articleId": "1BYE4PeE7rq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09682434",
"articleId": "1A9QTrcYT7O",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1J9y2mtpt3a",
"title": "Jan.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Jan.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1GZooFK65GM",
"doi": "10.1109/TVCG.2022.3209387",
"abstract": "Creating a static visualization for a time-dependent scalar field is a non-trivial task, yet very insightful as it shows the dynamics in one picture. Existing approaches are based on a linearization of the domain or on feature tracking. Domain linearizations use space-filling curves to place all sample points into a 1D domain, thereby breaking up individual features. Feature tracking methods explicitly respect feature continuity in space and time, but generally neglect the data context in which those features live. We present a feature-based linearization of the spatial domain that keeps features together and preserves their context by involving all data samples. We use augmented merge trees to linearize the domain and show that our linearized function has the same merge tree as the original data. A greedy optimization scheme aligns the trees over time providing temporal continuity. This leads to a static 2D visualization with one temporal dimension, and all spatial dimensions compressed into one. We compare our method against other domain linearizations as well as feature-tracking approaches, and apply it to several real-world data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Creating a static visualization for a time-dependent scalar field is a non-trivial task, yet very insightful as it shows the dynamics in one picture. Existing approaches are based on a linearization of the domain or on feature tracking. Domain linearizations use space-filling curves to place all sample points into a 1D domain, thereby breaking up individual features. Feature tracking methods explicitly respect feature continuity in space and time, but generally neglect the data context in which those features live. We present a feature-based linearization of the spatial domain that keeps features together and preserves their context by involving all data samples. We use augmented merge trees to linearize the domain and show that our linearized function has the same merge tree as the original data. A greedy optimization scheme aligns the trees over time providing temporal continuity. This leads to a static 2D visualization with one temporal dimension, and all spatial dimensions compressed into one. We compare our method against other domain linearizations as well as feature-tracking approaches, and apply it to several real-world data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Creating a static visualization for a time-dependent scalar field is a non-trivial task, yet very insightful as it shows the dynamics in one picture. Existing approaches are based on a linearization of the domain or on feature tracking. Domain linearizations use space-filling curves to place all sample points into a 1D domain, thereby breaking up individual features. Feature tracking methods explicitly respect feature continuity in space and time, but generally neglect the data context in which those features live. We present a feature-based linearization of the spatial domain that keeps features together and preserves their context by involving all data samples. We use augmented merge trees to linearize the domain and show that our linearized function has the same merge tree as the original data. A greedy optimization scheme aligns the trees over time providing temporal continuity. This leads to a static 2D visualization with one temporal dimension, and all spatial dimensions compressed into one. We compare our method against other domain linearizations as well as feature-tracking approaches, and apply it to several real-world data sets.",
"title": "Temporal Merge Tree Maps: A Topology-Based Static Visualization for Temporal Scalar Data",
"normalizedTitle": "Temporal Merge Tree Maps: A Topology-Based Static Visualization for Temporal Scalar Data",
"fno": "09903344",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Data Visualisation",
"Feature Extraction",
"Greedy Algorithms",
"Merging",
"Optimisation",
"Trees Mathematics",
"Domain Linearizations",
"Feature Continuity",
"Feature Tracking",
"Feature Based Linearization",
"Greedy Optimization",
"Scalar Field",
"Space Filling Curves",
"Spatial Domain",
"Static 2 D Visualization",
"Static Visualization",
"Temporal Continuity",
"Temporal Merge Tree Maps",
"Temporal Scalar Data",
"Topology",
"Data Visualization",
"Optimization",
"Animation",
"Storms",
"Coherence",
"Transient Analysis",
"Task Analysis",
"Scalar Field Visualization",
"Augmented Merge Tree",
"Pixel Based Visualization"
],
"authors": [
{
"givenName": "Wiebke",
"surname": "Köpp",
"fullName": "Wiebke Köpp",
"affiliation": "KTH Royal Institute of Technology, Stockholm, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tino",
"surname": "Weinkauf",
"fullName": "Tino Weinkauf",
"affiliation": "KTH Royal Institute of Technology, Stockholm, Sweden",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "1157-1167",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icnc/2009/3736/6/3736f585",
"title": "Wavelet Correlation Analysis of Geodetic Signals",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736f585/12OmNA1Vnsx",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/6",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ratfg-rts/1999/0378/0/03780169",
"title": "Digital Clones and Virtual Celebrities: Facial Tracking, Gesture Recognition and Animation for the Movie Industry",
"doi": null,
"abstractUrl": "/proceedings-article/ratfg-rts/1999/03780169/12OmNxX3uwU",
"parentPublication": {
"id": "proceedings/ratfg-rts/1999/0378/0",
"title": "Recognition, Analysis, & Tracking of Faces & Gestures in Real -Time Systems, IEEE ICCV Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2002/1695/2/169520261",
"title": "High-Resolution Reconstruction of Sparse Data from Dense Low-Resolution Spatio-Temporal Data",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2002/169520261/12OmNzahbXL",
"parentPublication": {
"id": "proceedings/icpr/2002/1695/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/05/i0572",
"title": "Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps",
"doi": null,
"abstractUrl": "/journal/tp/1998/05/i0572/13rRUxly96v",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/12/ttg2011122035",
"title": "Symmetry in Scalar Field Topology",
"doi": null,
"abstractUrl": "/journal/tg/2011/12/ttg2011122035/13rRUy2YLYr",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a103",
"title": "Towards Benchmark Data Generation for Feature Tracking in Scalar Fields",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a103/1J2XL5dyDJu",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/topoinvis/2022/9354/0/935400a113",
"title": "Subject-Specific Brain Activity Analysis in fMRI Data Using Merge Trees",
"doi": null,
"abstractUrl": "/proceedings-article/topoinvis/2022/935400a113/1J2XLcCgpVK",
"parentPublication": {
"id": "proceedings/topoinvis/2022/9354/0",
"title": "2022 Topological Data Analysis and Visualization (TopoInVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2019/5023/0/502300a721",
"title": "Temporal Feature Augmented Network for Video Instance Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300a721/1i5myNwsPQs",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412308",
"title": "Classifying Eye-Tracking Data Using Saliency Maps",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412308/1tmiNBHZZDO",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900g971",
"title": "Deep Video Matting via Spatio-Temporal Alignment and Aggregation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900g971/1yeM785S16E",
"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": "09908590",
"articleId": "1HbapPoq6uk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09912347",
"articleId": "1HeiTQ2soFO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1J9z7OlmsNi",
"name": "ttg202301-09903344s1-tvcg-3209387-mm.zip",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202301-09903344s1-tvcg-3209387-mm.zip",
"extension": "zip",
"size": "13.1 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "1Jv6pC6iiPe",
"title": "Feb.",
"year": "2023",
"issueNum": "02",
"idPrefix": "tg",
"pubType": "journal",
"volume": "29",
"label": "Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1xquQN6emfS",
"doi": "10.1109/TVCG.2021.3117370",
"abstract": "We propose a novel framework to efficiently capture the unknown reflectance on a non-planar 3D object, by learning to probe the 4D view-lighting domain with a high-performance illumination multiplexing setup. The core of our framework is a deep neural network, specifically tailored to exploit the multi-view coherence for efficiency. It takes as input the photometric measurements of a surface point under learned lighting patterns at different views, automatically aggregates the information and reconstructs the anisotropic reflectance. We also evaluate the impact of different sampling parameters over our network. The effectiveness of our framework is demonstrated on high-quality reconstructions of a variety of physical objects, with an acquisition efficiency outperforming state-of-the-art techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a novel framework to efficiently capture the unknown reflectance on a non-planar 3D object, by learning to probe the 4D view-lighting domain with a high-performance illumination multiplexing setup. The core of our framework is a deep neural network, specifically tailored to exploit the multi-view coherence for efficiency. It takes as input the photometric measurements of a surface point under learned lighting patterns at different views, automatically aggregates the information and reconstructs the anisotropic reflectance. We also evaluate the impact of different sampling parameters over our network. The effectiveness of our framework is demonstrated on high-quality reconstructions of a variety of physical objects, with an acquisition efficiency outperforming state-of-the-art techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a novel framework to efficiently capture the unknown reflectance on a non-planar 3D object, by learning to probe the 4D view-lighting domain with a high-performance illumination multiplexing setup. The core of our framework is a deep neural network, specifically tailored to exploit the multi-view coherence for efficiency. It takes as input the photometric measurements of a surface point under learned lighting patterns at different views, automatically aggregates the information and reconstructs the anisotropic reflectance. We also evaluate the impact of different sampling parameters over our network. The effectiveness of our framework is demonstrated on high-quality reconstructions of a variety of physical objects, with an acquisition efficiency outperforming state-of-the-art techniques.",
"title": "Neural Reflectance Capture in the View-Illumination Domain",
"normalizedTitle": "Neural Reflectance Capture in the View-Illumination Domain",
"fno": "09557800",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Computational Geometry",
"Image Reconstruction",
"Image Resolution",
"Learning Artificial Intelligence",
"Lighting",
"Neural Nets",
"4 D View Lighting Domain",
"Acquisition Efficiency",
"Anisotropic Reflectance",
"Deep Neural Network",
"High Performance Illumination Multiplexing Setup",
"High Quality Reconstructions",
"Learned Lighting Patterns",
"Multiview Coherence",
"Neural Reflectance Capture",
"Nonplanar 3 D Object",
"Photometric Measurements",
"Physical Objects",
"Sampling Parameters",
"Surface Point",
"Unknown Reflectance",
"View Illumination",
"Reflectivity",
"Lighting",
"Image Reconstruction",
"Cameras",
"Light Emitting Diodes",
"Multiplexing",
"Light Sources",
"Multi View Illumination Multiplexing",
"Neural Acquisition"
],
"authors": [
{
"givenName": "Kaizhang",
"surname": "Kang",
"fullName": "Kaizhang Kang",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Minyi",
"surname": "Gu",
"fullName": "Minyi Gu",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Cihui",
"surname": "Xie",
"fullName": "Cihui Xie",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Xuanda",
"surname": "Yang",
"fullName": "Xuanda Yang",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Hongzhi",
"surname": "Wu",
"fullName": "Hongzhi Wu",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Kun",
"surname": "Zhou",
"fullName": "Kun Zhou",
"affiliation": "State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2023-02-01 00:00:00",
"pubType": "trans",
"pages": "1450-1462",
"year": "2023",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2009/3992/0/05206764",
"title": "Illumination and spatially varying specular reflectance from a single view",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206764/12OmNARRYl8",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2013/3211/0/3211a441",
"title": "An LED-Based Spectral Imaging System for Surface Reflectance and Normal Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2013/3211a441/12OmNroijaF",
"parentPublication": {
"id": "proceedings/sitis/2013/3211/0",
"title": "2013 International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2015/8667/0/07168375",
"title": "Single-Shot Reflectance Measurement from Polarized Color Gradient Illumination",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2015/07168375/12OmNxWLTsI",
"parentPublication": {
"id": "proceedings/iccp/2015/8667/0",
"title": "2015 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pbmcv/1995/7021/0/00514684",
"title": "Reflectance analysis under solar illumination",
"doi": null,
"abstractUrl": "/proceedings-article/pbmcv/1995/00514684/12OmNxbW4O4",
"parentPublication": {
"id": "proceedings/pbmcv/1995/7021/0",
"title": "Proceedings of the Workshop on Physics-Based Modeling in Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/04/07383338",
"title": "Inter-reflection Compensation of Immersive Projection Display by Spatio-Temporal Screen Reflectance Modulation",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07383338/13rRUwInvfc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2005/04/i0493",
"title": "Light Source Position and Reflectance Estimation from a Single View without the Distant Illumination Assumption",
"doi": null,
"abstractUrl": "/journal/tp/2005/04/i0493/13rRUyuegi6",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2022/05/09712406",
"title": "Predicting Surface Reflectance Properties of Outdoor Scenes Under Unknown Natural Illumination",
"doi": null,
"abstractUrl": "/magazine/cg/2022/05/09712406/1AZLEpMIeME",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10081427",
"title": "Efficient Reflectance Capture With a Deep Gated Mixture-of-Experts",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10081427/1LRbRR2niSs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093491",
"title": "Inferring Super-Resolution Depth from a Moving Light-Source Enhanced RGB-D Sensor: A Variational Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093491/1jPbFHPBYnm",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2021/1952/0/09466267",
"title": "Spectral MVIR: Joint Reconstruction of 3D Shape and Spectral Reflectance",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2021/09466267/1uSSWr7wnkY",
"parentPublication": {
"id": "proceedings/iccp/2021/1952/0",
"title": "2021 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09557828",
"articleId": "1xquHkBQ2xa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09566799",
"articleId": "1xC6REtgYiA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1Jv6xE5fdYI",
"name": "ttg202302-09557800s1-supp1-3117370.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg202302-09557800s1-supp1-3117370.mp4",
"extension": "mp4",
"size": "103 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvqEvRo",
"title": "PrePrints",
"year": "5555",
"issueNum": "01",
"idPrefix": "tg",
"pubType": "journal",
"volume": null,
"label": "PrePrints",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1LAuCOR3RE4",
"doi": "10.1109/TVCG.2023.3258693",
"abstract": "Head tracking is commonly used in VR applications to allow users to naturally view 3D content using physical head movement, but many applications also support turning with hand-held controllers. Controller and joystick controls are convenient for practical settings where full 360-degree physical rotation is not possible, such as when the user is sitting at a desk. Though controller-based rotation provides the benefit of convenience, previous research has demonstrated that virtual or joystick-controlled view rotation to have drawbacks of sickness and disorientation compared to physical turning. To combat such issues, researchers have considered various techniques such as speed adjustments or reduced field of view, but data is limited on how different variations for joystick rotation influences sickness and orientation perception. Our studies include different variations of techniques such as joystick rotation, resetting, and field-of-view reduction. We investigate trade-offs among different techniques in terms of sickness and the ability to maintain spatial orientation. In two controlled experiments, participants traveled through a sequence of rooms and were tested on spatial orientation, and we also collected subjective measures of sickness and preference. Our findings indicate a preference by users towards directly-manipulated joystick-based rotations compared to user-initiated resetting and minimal effects of technique on spatial awareness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Head tracking is commonly used in VR applications to allow users to naturally view 3D content using physical head movement, but many applications also support turning with hand-held controllers. Controller and joystick controls are convenient for practical settings where full 360-degree physical rotation is not possible, such as when the user is sitting at a desk. Though controller-based rotation provides the benefit of convenience, previous research has demonstrated that virtual or joystick-controlled view rotation to have drawbacks of sickness and disorientation compared to physical turning. To combat such issues, researchers have considered various techniques such as speed adjustments or reduced field of view, but data is limited on how different variations for joystick rotation influences sickness and orientation perception. Our studies include different variations of techniques such as joystick rotation, resetting, and field-of-view reduction. We investigate trade-offs among different techniques in terms of sickness and the ability to maintain spatial orientation. In two controlled experiments, participants traveled through a sequence of rooms and were tested on spatial orientation, and we also collected subjective measures of sickness and preference. Our findings indicate a preference by users towards directly-manipulated joystick-based rotations compared to user-initiated resetting and minimal effects of technique on spatial awareness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Head tracking is commonly used in VR applications to allow users to naturally view 3D content using physical head movement, but many applications also support turning with hand-held controllers. Controller and joystick controls are convenient for practical settings where full 360-degree physical rotation is not possible, such as when the user is sitting at a desk. Though controller-based rotation provides the benefit of convenience, previous research has demonstrated that virtual or joystick-controlled view rotation to have drawbacks of sickness and disorientation compared to physical turning. To combat such issues, researchers have considered various techniques such as speed adjustments or reduced field of view, but data is limited on how different variations for joystick rotation influences sickness and orientation perception. Our studies include different variations of techniques such as joystick rotation, resetting, and field-of-view reduction. We investigate trade-offs among different techniques in terms of sickness and the ability to maintain spatial orientation. In two controlled experiments, participants traveled through a sequence of rooms and were tested on spatial orientation, and we also collected subjective measures of sickness and preference. Our findings indicate a preference by users towards directly-manipulated joystick-based rotations compared to user-initiated resetting and minimal effects of technique on spatial awareness.",
"title": "An Evaluation of View Rotation Techniques for Seated Navigation in Virtual Reality",
"normalizedTitle": "An Evaluation of View Rotation Techniques for Seated Navigation in Virtual Reality",
"fno": "10075482",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [
"Legged Locomotion",
"Turning",
"Tracking",
"Teleportation",
"Virtual Environments",
"Navigation",
"Three Dimensional Displays",
"Human Centered Computing",
"Human Computer Interaction",
"Virtual Reality"
],
"authors": [
{
"givenName": "Brett",
"surname": "Benda",
"fullName": "Brett Benda",
"affiliation": "University of Florida, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Shyam Prathish",
"surname": "Sargunam",
"fullName": "Shyam Prathish Sargunam",
"affiliation": "Autodesk, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mahsan",
"surname": "Nourani",
"fullName": "Mahsan Nourani",
"affiliation": "University of Florida, USA",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Eric D.",
"surname": "Ragan",
"fullName": "Eric D. Ragan",
"affiliation": "University of Florida, USA",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "2023-03-01 00:00:00",
"pubType": "trans",
"pages": "1-14",
"year": "5555",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2014/3624/0/06798852",
"title": "Reorientation in virtual environments using interactive portals",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2014/06798852/12OmNqBbHVR",
"parentPublication": {
"id": "proceedings/3dui/2014/3624/0",
"title": "2014 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892227",
"title": "Guided head rotation and amplified head rotation: Evaluating semi-natural travel and viewing techniques in virtual reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892227/12OmNwseEYz",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/04/07384536",
"title": "Examining Rotation Gain in CAVE-like Virtual Environments",
"doi": null,
"abstractUrl": "/journal/tg/2016/04/07384536/13rRUxOdD2H",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09733261",
"title": "One-step out-of-place resetting for redirected walking in VR",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09733261/1BENJyPkx5S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09737429",
"title": "Intentional Head-Motion Assisted Locomotion for Reducing Cybersickness",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09737429/1BQidPzNjBS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798286",
"title": "Evaluating the Effectiveness of Redirected Walking with Auditory Distractors for Navigation in Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798286/1cJ0PIoIPV6",
"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/08797994",
"title": "Redirecting View Rotation in Immersive Movies with Washout Filters",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797994/1cJ19tjOG2s",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090536",
"title": "Elastic-Move: Passive Haptic Device with Force Feedback for Virtual Reality Locomotion",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090536/1jIxqFQXvSE",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a627",
"title": "The Cognitive Load and Usability of Three Walking Metaphors for Consumer Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a627/1pysyecdlzq",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a321",
"title": "Simultaneous Real Walking and Asymmetric Input in Virtual Reality with a Smartphone-based Hybrid Interface",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a321/1yeQEyk3fbO",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "10070611",
"articleId": "1LvvYkEy8XC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10076255",
"articleId": "1LAuCZbIwdG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [
{
"id": "1LH8FUSRpvy",
"name": "ttg555501-010075482s1-supp1-3258693.mp4",
"location": "https://www.computer.org/csdl/api/v1/extra/ttg555501-010075482s1-supp1-3258693.mp4",
"extension": "mp4",
"size": "69.2 MB",
"__typename": "WebExtraType"
}
],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNwc3ww1",
"title": "January",
"year": "1996",
"issueNum": "01",
"idPrefix": "ts",
"pubType": "journal",
"volume": "22",
"label": "January",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUIJcWf7",
"doi": "10.1109/TSE.1996.10000",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editorial: Introduction to the Special Section",
"normalizedTitle": "Guest Editorial: Introduction to the Special Section",
"fno": "e0003",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [],
"authors": [],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "01",
"pubDate": "1996-01-01 00:00:00",
"pubType": "trans",
"pages": "3-5",
"year": "1996",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "e0001",
"articleId": "13rRUILtJsH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "e0006",
"articleId": "13rRUygT7oJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvsDHDN",
"title": "Sept.-Oct.",
"year": "2013",
"issueNum": "05",
"idPrefix": "tb",
"pubType": "journal",
"volume": "10",
"label": "Sept.-Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUILtJxU",
"doi": "10.1109/TCBB.2013.184",
"abstract": "The International Workshop on Data Mining in Bioinformatics (BIOKDD), held in conjunction with the ACM Conference on Knowledge Discovery and Data Mining (KDD) for 11 years, has successfully established a tradition of providing a platform for the presentation and discussion of advances in data mining techniques that primarily target biological data. In 2012, the workshop was held in Beijing, China, and BIOKDD continued the tradition of bringing together data mining researchers and life scientists, emphasizing novel problems with various types of biological data. This special section features extended versions of three papers that were presented in BIKODD.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The International Workshop on Data Mining in Bioinformatics (BIOKDD), held in conjunction with the ACM Conference on Knowledge Discovery and Data Mining (KDD) for 11 years, has successfully established a tradition of providing a platform for the presentation and discussion of advances in data mining techniques that primarily target biological data. In 2012, the workshop was held in Beijing, China, and BIOKDD continued the tradition of bringing together data mining researchers and life scientists, emphasizing novel problems with various types of biological data. This special section features extended versions of three papers that were presented in BIKODD.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The International Workshop on Data Mining in Bioinformatics (BIOKDD), held in conjunction with the ACM Conference on Knowledge Discovery and Data Mining (KDD) for 11 years, has successfully established a tradition of providing a platform for the presentation and discussion of advances in data mining techniques that primarily target biological data. In 2012, the workshop was held in Beijing, China, and BIOKDD continued the tradition of bringing together data mining researchers and life scientists, emphasizing novel problems with various types of biological data. This special section features extended versions of three papers that were presented in BIKODD.",
"title": "Guest Editorial for Special Section on BIOKDD",
"normalizedTitle": "Guest Editorial for Special Section on BIOKDD",
"fno": "ttb2013051199",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Special Issues And Sections",
"Data Mining",
"Meetings",
"Bioinformatics",
"Informatics"
],
"authors": [
{
"givenName": "Tamer",
"surname": "Kahveci",
"fullName": "Tamer Kahveci",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Saeed",
"surname": "Salem",
"fullName": "Saeed Salem",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mehmet",
"surname": "Koyuturk",
"fullName": "Mehmet Koyuturk",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": false,
"isOpenAccess": true,
"issueNum": "05",
"pubDate": "2013-09-01 00:00:00",
"pubType": "trans",
"pages": "1199-1200",
"year": "2013",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "ttb20130500c4",
"articleId": "13rRUwdrdRf",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzmclnL",
"title": "November/December",
"year": "2006",
"issueNum": "06",
"idPrefix": "tg",
"pubType": "journal",
"volume": "12",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvya9f",
"doi": "10.1109/TVCG.2006.93",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editorial: Special Section on Visual Analytics",
"normalizedTitle": "Guest Editorial: Special Section on Visual Analytics",
"fno": "v1361",
"hasPdf": true,
"idPrefix": "tg",
"keywords": [],
"authors": [
{
"givenName": "Daniel A.",
"surname": "Keim",
"fullName": "Daniel A. Keim",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "George G.",
"surname": "Robertson",
"fullName": "George G. Robertson",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jim J.",
"surname": "Thomas",
"fullName": "Jim J. Thomas",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jarke J.",
"surname": "van Wijk",
"fullName": "Jarke J. van Wijk",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "06",
"pubDate": "2006-11-01 00:00:00",
"pubType": "trans",
"pages": "1361-1362",
"year": "2006",
"issn": "1077-2626",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/ts/1996/01/e0003",
"title": "Guest Editorial: Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1996/01/e0003/13rRUIJcWf7",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/05/ttb2013051199",
"title": "Guest Editorial for Special Section on BIOKDD",
"doi": null,
"abstractUrl": "/journal/tb/2013/05/ttb2013051199/13rRUILtJxU",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/02/e0145",
"title": "Guest Editorial: Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1999/02/e0145/13rRUwInv62",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1983/02/01703027",
"title": "Guest Editorial: COMPSAC '81 Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1983/02/01703027/13rRUwh80It",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2003/06/t0689",
"title": "Guest Editorial: Special Section on Wireless Internet",
"doi": null,
"abstractUrl": "/journal/tc/2003/06/t0689/13rRUwjGoKN",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1995/02/e0061",
"title": "Guest Editorial: Introduction to Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1995/02/e0061/13rRUx0Pqr6",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/06/e0782",
"title": "Guest Editorial: Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1999/06/e0782/13rRUxBa5z5",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/03/e0289",
"title": "Guest Editorial: Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1999/03/e0289/13rRUxZRbpK",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2003/11/l1057",
"title": "Guest Editorial: Special Section on Middleware Infrastructures",
"doi": null,
"abstractUrl": "/journal/td/2003/11/l1057/13rRUxcbnGD",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2017/01/07880729",
"title": "Guest Editorial: Special Section on Learning Analytics",
"doi": null,
"abstractUrl": "/journal/lt/2017/01/07880729/13rRUygT7bB",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "v1363",
"articleId": "13rRUx0xPIs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAolGIx",
"title": "Oct.",
"year": "2008",
"issueNum": "10",
"idPrefix": "si",
"pubType": "journal",
"volume": "16",
"label": "Oct.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUwbaqXJ",
"doi": "10.1109/TVLSI.2008.2005245",
"abstract": "This special section on application specific processors consists of eight articles, four of which are extended versions of papers presented at the Fifth Workshop on Application Specific Processors (WASP) held in 2007.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This special section on application specific processors consists of eight articles, four of which are extended versions of papers presented at the Fifth Workshop on Application Specific Processors (WASP) held in 2007.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This special section on application specific processors consists of eight articles, four of which are extended versions of papers presented at the Fifth Workshop on Application Specific Processors (WASP) held in 2007.",
"title": "Guest Editorial Special Section on Application Specific Processors",
"normalizedTitle": "Guest Editorial Special Section on Application Specific Processors",
"fno": "04629337",
"hasPdf": true,
"idPrefix": "si",
"keywords": [
"Application Specific Processors",
"Very Large Scale Integration",
"Engines",
"Decoding",
"Conferences",
"Design Automation",
"Application Software",
"Field Programmable Gate Arrays",
"Resource Management",
"Portable Computers"
],
"authors": [
{
"givenName": "Paolo",
"surname": "Ienne",
"fullName": "Paolo Ienne",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Peter",
"surname": "Petrov",
"fullName": "Peter Petrov",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "10",
"pubDate": "2008-10-01 00:00:00",
"pubType": "trans",
"pages": "1257-1258",
"year": "2008",
"issn": "1063-8210",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/icwsi/1990/9013/0/00063881",
"title": "The WASP demonstrator programme: the engineering of a wafer-scale system",
"doi": null,
"abstractUrl": "/proceedings-article/icwsi/1990/00063881/12OmNAkWvjn",
"parentPublication": {
"id": "proceedings/icwsi/1990/9013/0",
"title": "1990 Proceedings. International Conference on Wafer Scale Integration",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/02/e0145",
"title": "Guest Editorial: Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1999/02/e0145/13rRUwInv62",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/1998/02/00678866",
"title": "Guest Editorial Special Section On Field Programmable Gate Arrays",
"doi": null,
"abstractUrl": "/journal/si/1998/02/00678866/13rRUwgQpoh",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1983/02/01703027",
"title": "Guest Editorial: COMPSAC '81 Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1983/02/01703027/13rRUwh80It",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2003/06/t0689",
"title": "Guest Editorial: Special Section on Wireless Internet",
"doi": null,
"abstractUrl": "/journal/tc/2003/06/t0689/13rRUwjGoKN",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1995/02/e0061",
"title": "Guest Editorial: Introduction to Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1995/02/e0061/13rRUx0Pqr6",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2008/01/04407538",
"title": "Guest Editorial Special Section on Configurable Computing Design— I: High-Level Reconfiguration",
"doi": null,
"abstractUrl": "/journal/si/2008/01/04407538/13rRUxASuyj",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0419",
"title": "Guest Editorial: Special Section on Visualization 2005",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0419/13rRUxBJhvj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2008/02/04410460",
"title": "Guest Editorial Special Section on Configurable Computing Design—II: Hardware Level Reconfiguration",
"doi": null,
"abstractUrl": "/journal/si/2008/02/04410460/13rRUxNEqTa",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2008/04/04475226",
"title": "Guest Editorial Special Section on Design Verification and Validation",
"doi": null,
"abstractUrl": "/journal/si/2008/04/04475226/13rRUxlgy1m",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "04629427",
"articleId": "13rRUx0xQ5H",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04629339",
"articleId": "13rRUEgs2zn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNqJq4Gy",
"title": "November/December",
"year": "1999",
"issueNum": "06",
"idPrefix": "ts",
"pubType": "journal",
"volume": "25",
"label": "November/December",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxBa5z5",
"doi": "10.1109/TSE.1999.824393",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editorial: Introduction to the Special Section",
"normalizedTitle": "Guest Editorial: Introduction to the Special Section",
"fno": "e0782",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [],
"authors": [
{
"givenName": "Carlo",
"surname": "Ghezzi",
"fullName": "Carlo Ghezzi",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Bashar",
"surname": "Nuseibeh",
"fullName": "Bashar Nuseibeh",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "06",
"pubDate": "1999-11-01 00:00:00",
"pubType": "trans",
"pages": "782-783",
"year": "1999",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "e0769",
"articleId": "13rRUypp59o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "e0784",
"articleId": "13rRUx0gewH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNAXPy7n",
"title": "May/June",
"year": "1999",
"issueNum": "03",
"idPrefix": "ts",
"pubType": "journal",
"volume": "25",
"label": "May/June",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxZRbpK",
"doi": "10.1109/TSE.1999.798319",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editorial: Introduction to the Special Section",
"normalizedTitle": "Guest Editorial: Introduction to the Special Section",
"fno": "e0289",
"hasPdf": true,
"idPrefix": "ts",
"keywords": [],
"authors": [
{
"givenName": "David S.",
"surname": "Wile",
"fullName": "David S. Wile",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "J. Christopher",
"surname": "Ramming",
"fullName": "J. Christopher Ramming",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "03",
"pubDate": "1999-05-01 00:00:00",
"pubType": "trans",
"pages": "289-290",
"year": "1999",
"issn": "0098-5589",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "e0291",
"articleId": "13rRUIM2VD8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNvAiSoK",
"title": "November",
"year": "2003",
"issueNum": "11",
"idPrefix": "td",
"pubType": "journal",
"volume": "14",
"label": "November",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxcbnGD",
"doi": "10.1109/TPDS.2003.1247667",
"abstract": null,
"abstracts": [
{
"abstractType": "Regular",
"content": "",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": null,
"title": "Guest Editorial: Special Section on Middleware Infrastructures",
"normalizedTitle": "Guest Editorial: Special Section on Middleware Infrastructures",
"fno": "l1057",
"hasPdf": true,
"idPrefix": "td",
"keywords": [],
"authors": [
{
"givenName": "Rachid",
"surname": "Guerraoui",
"fullName": "Rachid Guerraoui",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Willy",
"surname": "Zwaenepoel",
"fullName": "Willy Zwaenepoel",
"affiliation": "IEEE",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "11",
"pubDate": "2003-11-01 00:00:00",
"pubType": "trans",
"pages": "1057",
"year": "2003",
"issn": "1045-9219",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "trans/ts/1998/08/e0585",
"title": "Guest Editorial: Introduction To The Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1998/08/e0585/13rRUIJcWfa",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1996/09/e0601",
"title": "Guest Editorial Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1996/09/e0601/13rRUwInvLb",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2014/05/06917105",
"title": "Guest Editorial for Special Section on BIOKDD2013",
"doi": null,
"abstractUrl": "/journal/tb/2014/05/06917105/13rRUwInvjI",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1998/11/e0906",
"title": "Guest Editorial: Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1998/11/e0906/13rRUwInvup",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2017/02/07887794",
"title": "Guest Editorial for Special Section on BIBM 2014",
"doi": null,
"abstractUrl": "/journal/tb/2017/02/07887794/13rRUwbJD3u",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1999/05/e0601",
"title": "Guest Editorial: Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1999/05/e0601/13rRUwfZBWV",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2010/04/tlt2010040278",
"title": "Guest Editorial: Special Section on Game-Based Learning",
"doi": null,
"abstractUrl": "/journal/lt/2010/04/tlt2010040278/13rRUxYIN07",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/1998/09/e0681",
"title": "Guest Editorial: Introduction to the Special Section",
"doi": null,
"abstractUrl": "/journal/ts/1998/09/e0681/13rRUxYrbWi",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2008/04/04475226",
"title": "Guest Editorial Special Section on Design Verification and Validation",
"doi": null,
"abstractUrl": "/journal/si/2008/04/04475226/13rRUxlgy1m",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "l1058",
"articleId": "13rRUxOdD7S",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNxdm4Ec",
"title": "September/October",
"year": "2000",
"issueNum": "05",
"idPrefix": "cg",
"pubType": "magazine",
"volume": "20",
"label": "September/October",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUNvya3o",
"doi": "10.1109/38.865883",
"abstract": "A method for interpolating rows of data points with B-spline surfaces is presented. In each row the number points can differ, requiring a skinning-type operator to pass a surface through the points. To avoid data explosion as a result of knot merging, we introduce a new curve interpolation method that uses knots from a given input knot vector. Depending on the initial knot vector and how it is updated during interpolation from row to row, the new method reduces the number of surface control points by 60-97%.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A method for interpolating rows of data points with B-spline surfaces is presented. In each row the number points can differ, requiring a skinning-type operator to pass a surface through the points. To avoid data explosion as a result of knot merging, we introduce a new curve interpolation method that uses knots from a given input knot vector. Depending on the initial knot vector and how it is updated during interpolation from row to row, the new method reduces the number of surface control points by 60-97%.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A method for interpolating rows of data points with B-spline surfaces is presented. In each row the number points can differ, requiring a skinning-type operator to pass a surface through the points. To avoid data explosion as a result of knot merging, we introduce a new curve interpolation method that uses knots from a given input knot vector. Depending on the initial knot vector and how it is updated during interpolation from row to row, the new method reduces the number of surface control points by 60-97%.",
"title": "Reducing Control Points in Surface Interpolation",
"normalizedTitle": "Reducing Control Points in Surface Interpolation",
"fno": "mcg2000050070",
"hasPdf": true,
"idPrefix": "cg",
"keywords": [
"Data Interpolation",
"Skinning",
"B Splines",
"Curves And Surfaces",
"Algorithms"
],
"authors": [
{
"givenName": "Les A.",
"surname": "Piegl",
"fullName": "Les A. Piegl",
"affiliation": null,
"__typename": "ArticleAuthorType"
},
{
"givenName": "Wayne",
"surname": "Tiller",
"fullName": "Wayne Tiller",
"affiliation": null,
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": false,
"isOpenAccess": false,
"issueNum": "05",
"pubDate": "2000-09-01 00:00:00",
"pubType": "mags",
"pages": "70-74",
"year": "2000",
"issn": "0272-1716",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [],
"adjacentArticles": {
"previous": {
"fno": "mcg2000050067",
"articleId": "13rRUxCitBJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "mcg2000050076",
"articleId": "13rRUzphDsq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNBOUxmV",
"title": "April",
"year": "2012",
"issueNum": "04",
"idPrefix": "tk",
"pubType": "journal",
"volume": "24",
"label": "April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUEgs2Co",
"doi": "10.1109/TKDE.2010.238",
"abstract": "We study a data mining problem concerning the elastic peak detection in 2D liquid chromatography-mass spectrometry (LC-MS) data. These data can be modeled as time series, in which the X-axis represents time points and the Y-axis represents intensity values. A peak occurs in a set of 2D LC-MS data when the sum of the intensity values in a sliding time window exceeds a user-determined threshold. The elastic peak detection problem is to locate all peaks across multiple window sizes of interest in the data set. We propose a new data structure, called a Shifted Aggregation Tree or AggTree for short, and use the data structure to find the different peaks. Our method, called PeakID, solves the elastic peak detection problem in 2D LC-MS data yielding neither false positives nor false negatives. The method works by first constructing an AggTree in a bottom-up manner from the given data set, and then searching the AggTree for the peaks in a top-down manner. We describe a state-space algorithm for finding the topology and structure of an efficient AggTree to be used by PeakID. Our experimental results demonstrate the superiority of the proposed method over other methods on both synthetic and real-world data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We study a data mining problem concerning the elastic peak detection in 2D liquid chromatography-mass spectrometry (LC-MS) data. These data can be modeled as time series, in which the X-axis represents time points and the Y-axis represents intensity values. A peak occurs in a set of 2D LC-MS data when the sum of the intensity values in a sliding time window exceeds a user-determined threshold. The elastic peak detection problem is to locate all peaks across multiple window sizes of interest in the data set. We propose a new data structure, called a Shifted Aggregation Tree or AggTree for short, and use the data structure to find the different peaks. Our method, called PeakID, solves the elastic peak detection problem in 2D LC-MS data yielding neither false positives nor false negatives. The method works by first constructing an AggTree in a bottom-up manner from the given data set, and then searching the AggTree for the peaks in a top-down manner. We describe a state-space algorithm for finding the topology and structure of an efficient AggTree to be used by PeakID. Our experimental results demonstrate the superiority of the proposed method over other methods on both synthetic and real-world data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We study a data mining problem concerning the elastic peak detection in 2D liquid chromatography-mass spectrometry (LC-MS) data. These data can be modeled as time series, in which the X-axis represents time points and the Y-axis represents intensity values. A peak occurs in a set of 2D LC-MS data when the sum of the intensity values in a sliding time window exceeds a user-determined threshold. The elastic peak detection problem is to locate all peaks across multiple window sizes of interest in the data set. We propose a new data structure, called a Shifted Aggregation Tree or AggTree for short, and use the data structure to find the different peaks. Our method, called PeakID, solves the elastic peak detection problem in 2D LC-MS data yielding neither false positives nor false negatives. The method works by first constructing an AggTree in a bottom-up manner from the given data set, and then searching the AggTree for the peaks in a top-down manner. We describe a state-space algorithm for finding the topology and structure of an efficient AggTree to be used by PeakID. Our experimental results demonstrate the superiority of the proposed method over other methods on both synthetic and real-world data.",
"title": "Fast Elastic Peak Detection for Mass Spectrometry Data Mining",
"normalizedTitle": "Fast Elastic Peak Detection for Mass Spectrometry Data Mining",
"fno": "ttk2012040634",
"hasPdf": true,
"idPrefix": "tk",
"keywords": [
"Knowledge Discovery From LC MS Data",
"Time Series Data Mining",
"Bioinformatics",
"Computational Proteomics",
"Algorithms And Data Structures"
],
"authors": [
{
"givenName": "Xin",
"surname": "Zhang",
"fullName": "Xin Zhang",
"affiliation": "New York University, New York",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Dennis",
"surname": "Shasha",
"fullName": "Dennis Shasha",
"affiliation": "New York University, New York",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yang",
"surname": "Song",
"fullName": "Yang Song",
"affiliation": "New Jersey Institute of Technology and UMDNJ-New Jersey Medical School Cancer Center, Newark",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Jason T.L.",
"surname": "Wang",
"fullName": "Jason T.L. Wang",
"affiliation": "New Jersey Institute of Technology, Newark",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2012-04-01 00:00:00",
"pubType": "trans",
"pages": "634-648",
"year": "2012",
"issn": "1041-4347",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibmw/2009/5121/0/05332099",
"title": "A two-phase clustering approach for peak alignment in mining mass spectrometry data",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2009/05332099/12OmNB836IO",
"parentPublication": {
"id": "proceedings/bibmw/2009/5121/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2012/2559/0/06392625",
"title": "A neural network approach to the identification of b-/y-ions in MS/MS spectra",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2012/06392625/12OmNBOlloK",
"parentPublication": {
"id": "proceedings/bibm/2012/2559/0",
"title": "2012 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2010/8303/0/05703856",
"title": "A novel peak alignment method for LC-MS data analysis using cluster-based techniques",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2010/05703856/12OmNCdk2Bs",
"parentPublication": {
"id": "proceedings/bibmw/2010/8303/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fbie/2008/3561/0/3561a030",
"title": "Ovarian Cancer Mass Spectrometry Data Analysis Based on ICA Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/fbie/2008/3561a030/12OmNrGsDrB",
"parentPublication": {
"id": "proceedings/fbie/2008/3561/0",
"title": "2008 International Seminar on Future Biomedical Information Engineering (FBIE 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532828",
"title": "Differential protein expression analysis via liquid-chromatography/mass-spectrometry data visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532828/12OmNxvwoMs",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csb/2003/2000/0/20000415",
"title": "Probability Profiles - Novel Approach in Tandem Mass Spectrometry De Novo Sequencing",
"doi": null,
"abstractUrl": "/proceedings-article/csb/2003/20000415/12OmNym2bRe",
"parentPublication": {
"id": "proceedings/csb/2003/2000/0",
"title": "Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/03/ttb2011030760",
"title": "Peakbin Selection in Mass Spectrometry Data Using a Consensus Approach with Estimation of Distribution Algorithms",
"doi": null,
"abstractUrl": "/journal/tb/2011/03/ttb2011030760/13rRUILLktZ",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0497",
"title": "Visual Analysis of Gel-Free Proteome Data",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0497/13rRUwI5U7R",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2010/01/ttb2010010126",
"title": "Efficient Peak-Labeling Algorithms for Whole-Sample Mass Spectrometry Proteomics",
"doi": null,
"abstractUrl": "/journal/tb/2010/01/ttb2010010126/13rRUxjQyao",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttk2012040619",
"articleId": "13rRUwInvln",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttk2012040649",
"articleId": "13rRUIIVlkI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNyuya0J",
"title": "March/April",
"year": "2011",
"issueNum": "02",
"idPrefix": "tb",
"pubType": "journal",
"volume": "8",
"label": "March/April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxNW23e",
"doi": "10.1109/TCBB.2009.54",
"abstract": "Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ either MS data or MS/MS data for database searching. While MS-based methods provide wider coverage than MS/MS-based methods, their identification accuracy is lower since MS data have less information than MS/MS data. Thus, it is desired to design more sophisticated algorithms that achieve higher identification accuracy using MS data. Peptide Mass Fingerprinting (PMF) has been widely used to identify single purified proteins from MS data for many years. In this paper, we extend this technology to protein mixture identification. First, we formulate the problem of protein mixture identification as a Partial Set Covering (PSC) problem. Then, we present several algorithms that can solve the PSC problem efficiently. Finally, we extend the partial set covering model to both MS/MS data and the combination of MS data and MS/MS data. The experimental results on simulated data and real data demonstrate the advantages of our method: 1) it outperforms previous MS-based approaches significantly; 2) it is useful in the MS/MS-based protein inference; and 3) it combines MS data and MS/MS data in a unified model such that the identification performance is further improved.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ either MS data or MS/MS data for database searching. While MS-based methods provide wider coverage than MS/MS-based methods, their identification accuracy is lower since MS data have less information than MS/MS data. Thus, it is desired to design more sophisticated algorithms that achieve higher identification accuracy using MS data. Peptide Mass Fingerprinting (PMF) has been widely used to identify single purified proteins from MS data for many years. In this paper, we extend this technology to protein mixture identification. First, we formulate the problem of protein mixture identification as a Partial Set Covering (PSC) problem. Then, we present several algorithms that can solve the PSC problem efficiently. Finally, we extend the partial set covering model to both MS/MS data and the combination of MS data and MS/MS data. The experimental results on simulated data and real data demonstrate the advantages of our method: 1) it outperforms previous MS-based approaches significantly; 2) it is useful in the MS/MS-based protein inference; and 3) it combines MS data and MS/MS data in a unified model such that the identification performance is further improved.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ either MS data or MS/MS data for database searching. While MS-based methods provide wider coverage than MS/MS-based methods, their identification accuracy is lower since MS data have less information than MS/MS data. Thus, it is desired to design more sophisticated algorithms that achieve higher identification accuracy using MS data. Peptide Mass Fingerprinting (PMF) has been widely used to identify single purified proteins from MS data for many years. In this paper, we extend this technology to protein mixture identification. First, we formulate the problem of protein mixture identification as a Partial Set Covering (PSC) problem. Then, we present several algorithms that can solve the PSC problem efficiently. Finally, we extend the partial set covering model to both MS/MS data and the combination of MS data and MS/MS data. The experimental results on simulated data and real data demonstrate the advantages of our method: 1) it outperforms previous MS-based approaches significantly; 2) it is useful in the MS/MS-based protein inference; and 3) it combines MS data and MS/MS data in a unified model such that the identification performance is further improved.",
"title": "A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data",
"normalizedTitle": "A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data",
"fno": "ttb2011020368",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Protein Identification",
"Proteomics",
"Peptide Mass Fingerprinting",
"Mass Spectrometry",
"Set Covering",
"Linear Programming",
"Optimization"
],
"authors": [
{
"givenName": "Zengyou",
"surname": "He",
"fullName": "Zengyou He",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Can",
"surname": "Yang",
"fullName": "Can Yang",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Weichuan",
"surname": "Yu",
"fullName": "Weichuan Yu",
"affiliation": "Hong Kong University of Science and Technology, Hong Kong",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "02",
"pubDate": "2011-03-01 00:00:00",
"pubType": "trans",
"pages": "368-380",
"year": "2011",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/saahpc/2012/4838/0/4838a111",
"title": "FPGA-Accelerated Isotope Pattern Calculator for Use in Simulated Mass Spectrometry Peptide and Protein Chemistry",
"doi": null,
"abstractUrl": "/proceedings-article/saahpc/2012/4838a111/12OmNBTJICz",
"parentPublication": {
"id": "proceedings/saahpc/2012/4838/0",
"title": "Application Accelerators in High-Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2009/5121/0/05332141",
"title": "Polynomial-time disulfide bond determination using mass spectrometry data",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2009/05332141/12OmNBoNrqv",
"parentPublication": {
"id": "proceedings/bibmw/2009/5121/0",
"title": "2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csb/2005/2344/0/23440175",
"title": "Peptide Charge State Determination for Low-Resolution Tandem Mass Spectra",
"doi": null,
"abstractUrl": "/proceedings-article/csb/2005/23440175/12OmNCw3zaL",
"parentPublication": {
"id": "proceedings/csb/2005/2344/0",
"title": "Proceedings. 2005 IEEE Computational Systems Bioinformatics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/2/4296c500",
"title": "Mass Spectrometry in the Protein Sciences",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296c500/12OmNqOffx8",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/2",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2012/2559/0/06392718",
"title": "Incorporating semantic similarity into clustering process for identifying protein complexes from Affinity Purification/Mass Spectrometry data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2012/06392718/12OmNs5rl8c",
"parentPublication": {
"id": "proceedings/bibm/2012/2559/0",
"title": "2012 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2011/4516/0/4516a017",
"title": "BMF: Bitmapped Mass Fingerprinting for Fast Protein Identification",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2011/4516a017/12OmNvUaNrP",
"parentPublication": {
"id": "proceedings/cluster/2011/4516/0",
"title": "2011 IEEE International Conference on Cluster Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532828",
"title": "Differential protein expression analysis via liquid-chromatography/mass-spectrometry data visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532828/12OmNxvwoMs",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2008/3165/0/3165a209",
"title": "MSPtool: A Versatile Tool for Mass Spectrometry Data Preprocessing",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2008/3165a209/12OmNz4Bdju",
"parentPublication": {
"id": "proceedings/cbms/2008/3165/0",
"title": "2008 21st IEEE International Symposium on Computer-Based Medical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2013/1309/0/06732765",
"title": "Latin square dataset for evaluating the accuracy of mass spectrometry-based protein identification and quantification",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732765/12OmNz61dwH",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/05/ttb2012051273",
"title": "Improving X!Tandem on Peptide Identification from Mass Spectrometry by Self-Boosted Percolator",
"doi": null,
"abstractUrl": "/journal/tb/2012/05/ttb2012051273/13rRUILtJkf",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "ttb2011020353",
"articleId": "13rRUxYrbT2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "ttb2011020381",
"articleId": "13rRUwgQppi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNz6iObM",
"title": "July-Aug.",
"year": "2015",
"issueNum": "04",
"idPrefix": "tb",
"pubType": "journal",
"volume": "12",
"label": "July-Aug.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUxlgyab",
"doi": "10.1109/TCBB.2014.2377723",
"abstract": "We introduce a new method for normalization of data acquired by liquid chromatography coupled with mass spectrometry (LC-MS) in label-free differential expression analysis. Normalization of LC-MS data is desired prior to subsequent statistical analysis to adjust variabilities in ion intensities that are not caused by biological differences but experimental bias. There are different sources of bias including variabilities during sample collection and sample storage, poor experimental design, noise, etc. In addition, instrument variability in experiments involving a large number of LC-MS runs leads to a significant drift in intensity measurements. Although various methods have been proposed for normalization of LC-MS data, there is no universally applicable approach. In this paper, we propose a Bayesian normalization model (BNM) that utilizes scan-level information from LC-MS data. Specifically, the proposed method uses peak shapes to model the scan-level data acquired from extracted ion chromatograms (EIC) with parameters considered as a linear mixed effects model. We extended the model into BNM with drift (BNMD) to compensate for the variability in intensity measurements due to long LC-MS runs. We evaluated the performance of our method using synthetic and experimental data. In comparison with several existing methods, the proposed BNM and BNMD yielded significant improvement.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce a new method for normalization of data acquired by liquid chromatography coupled with mass spectrometry (LC-MS) in label-free differential expression analysis. Normalization of LC-MS data is desired prior to subsequent statistical analysis to adjust variabilities in ion intensities that are not caused by biological differences but experimental bias. There are different sources of bias including variabilities during sample collection and sample storage, poor experimental design, noise, etc. In addition, instrument variability in experiments involving a large number of LC-MS runs leads to a significant drift in intensity measurements. Although various methods have been proposed for normalization of LC-MS data, there is no universally applicable approach. In this paper, we propose a Bayesian normalization model (BNM) that utilizes scan-level information from LC-MS data. Specifically, the proposed method uses peak shapes to model the scan-level data acquired from extracted ion chromatograms (EIC) with parameters considered as a linear mixed effects model. We extended the model into BNM with drift (BNMD) to compensate for the variability in intensity measurements due to long LC-MS runs. We evaluated the performance of our method using synthetic and experimental data. In comparison with several existing methods, the proposed BNM and BNMD yielded significant improvement.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce a new method for normalization of data acquired by liquid chromatography coupled with mass spectrometry (LC-MS) in label-free differential expression analysis. Normalization of LC-MS data is desired prior to subsequent statistical analysis to adjust variabilities in ion intensities that are not caused by biological differences but experimental bias. There are different sources of bias including variabilities during sample collection and sample storage, poor experimental design, noise, etc. In addition, instrument variability in experiments involving a large number of LC-MS runs leads to a significant drift in intensity measurements. Although various methods have been proposed for normalization of LC-MS data, there is no universally applicable approach. In this paper, we propose a Bayesian normalization model (BNM) that utilizes scan-level information from LC-MS data. Specifically, the proposed method uses peak shapes to model the scan-level data acquired from extracted ion chromatograms (EIC) with parameters considered as a linear mixed effects model. We extended the model into BNM with drift (BNMD) to compensate for the variability in intensity measurements due to long LC-MS runs. We evaluated the performance of our method using synthetic and experimental data. In comparison with several existing methods, the proposed BNM and BNMD yielded significant improvement.",
"title": "Bayesian Normalization Model for Label-Free Quantitative Analysis by LC-MS",
"normalizedTitle": "Bayesian Normalization Model for Label-Free Quantitative Analysis by LC-MS",
"fno": "06977927",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Shape",
"Bayes Methods",
"Data Models",
"Bioinformatics",
"Biological System Modeling",
"Analytical Models",
"Noise",
"Bayesian Hierarchical Model",
"Liquid Chromatography",
"Mass Spectrometry",
"Normalization"
],
"authors": [
{
"givenName": "Mohammad R. Nezami",
"surname": "Ranjbar",
"fullName": "Mohammad R. Nezami Ranjbar",
"affiliation": "Department of Electrical and Computer Engineering, Virginia Tech, 900 N. Glebe Road, Arlington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Mahlet G.",
"surname": "Tadesse",
"fullName": "Mahlet G. Tadesse",
"affiliation": "Department of Mathematics and Statistics, Georgetown University, 308 St. Marys Hall, Washington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Yue",
"surname": "Wang",
"fullName": "Yue Wang",
"affiliation": "Department of Electrical and Computer Engineering, Virginia Tech, 900 N. Glebe Road, Arlington",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Habtom W.",
"surname": "Ressom",
"fullName": "Habtom W. Ressom",
"affiliation": "Department of Oncology, Lombardi Comprehensive Cancer Center, Georgetown University, 173 Building D, 4000 Reservoir Road NW, Washington",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": true,
"showRecommendedArticles": true,
"isOpenAccess": false,
"issueNum": "04",
"pubDate": "2015-07-01 00:00:00",
"pubType": "trans",
"pages": "914-927",
"year": "2015",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2014/5669/0/06999136",
"title": "Optimizing analytical depth and cost efficiency of IEF-LC/MS proteomics",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999136/12OmNAOKnVG",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2010/8303/0/05703775",
"title": "Using a spike-in experiment to evaluate analysis of LC-MS data",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2010/05703775/12OmNBhZ4q8",
"parentPublication": {
"id": "proceedings/bibmw/2010/8303/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2007/3031/0/30310230",
"title": "Robust Estimation and Graph-Based Meta Clustering for LC-MS Feature Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2007/30310230/12OmNCdk2Kt",
"parentPublication": {
"id": "proceedings/bibm/2007/3031/0",
"title": "2007 IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2012/2746/0/06470209",
"title": "Evaluation of normalization methods for analysis of LC-MS data",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2012/06470209/12OmNrHjqRc",
"parentPublication": {
"id": "proceedings/bibmw/2012/2746/0",
"title": "2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120444",
"title": "A Computational Pipeline for LC-MS/MS Based Metabolite Identification",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120444/12OmNvxKu07",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2011/1612/0/06112551",
"title": "Quality assessment of LC-MS metabolomic data",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2011/06112551/12OmNxX3uOz",
"parentPublication": {
"id": "proceedings/bibmw/2011/1612/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120456",
"title": "Improved Quantification of Labeled LC-MS",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120456/12OmNzaQoh9",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/02/ttb2013020494",
"title": "Profile-Based LC-MS Data Alignment - A Bayesian Approach",
"doi": null,
"abstractUrl": "/journal/tb/2013/02/ttb2013020494/13rRUwIF6cx",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2017/02/07150335",
"title": "Optimizing Analytical Depth and Cost Efficiency of IEF-LC/MS Proteomics",
"doi": null,
"abstractUrl": "/journal/tb/2017/02/07150335/13rRUy3xY6z",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09676484",
"title": "An Interpretable Deep Learning Approach for Biomarker Detection in LC-MS Proteomics Data",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09676484/1A3dhLEDej6",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07004798",
"articleId": "13rRUB7a1ej",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06977954",
"articleId": "13rRUx0Pqo0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "12OmNzd7bIV",
"title": "March-April",
"year": "2017",
"issueNum": "02",
"idPrefix": "tb",
"pubType": "journal",
"volume": "14",
"label": "March-April",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "13rRUy3xY6z",
"doi": "10.1109/TCBB.2015.2452901",
"abstract": "IEF LC-MS/MS is an analytical method that incorporates a two-step sample separation prior to MS identification of proteins. When analyzing complex samples this preparatory separation allows for higher analytical depth and improved quantification accuracy of proteins. However, cost and analysis time are greatly increased as each analyzed IEF fraction is separately profiled using LC-MS/MS. We propose an approach that selects a subset of IEF fractions for LC-MS/MS analysis that is highly informative in the context of a group of proteins of interest. Specifically, our method allows a significant reduction in cost and instrument time as compared to the standard protocol of running all fractions, with little compromise to coverage. We develop algorithmics to optimize the selection of the IEF fractions on which to run LC-MS/MS. We translate the fraction optimization task to Minimum Set Cover, a well-studied NP-hard problem. We develop heuristic solutions and compare them in terms of effectiveness and running times. We provide examples to demonstrate advantages and limitations of each algorithmic approach. Finally, we test our methodology by applying it to experimental data obtained from IEF LC-MS/MS analysis of yeast and human samples. We demonstrate the benefit of this approach for analyzing complex samples with a focus on different protein sets of interest.",
"abstracts": [
{
"abstractType": "Regular",
"content": "IEF LC-MS/MS is an analytical method that incorporates a two-step sample separation prior to MS identification of proteins. When analyzing complex samples this preparatory separation allows for higher analytical depth and improved quantification accuracy of proteins. However, cost and analysis time are greatly increased as each analyzed IEF fraction is separately profiled using LC-MS/MS. We propose an approach that selects a subset of IEF fractions for LC-MS/MS analysis that is highly informative in the context of a group of proteins of interest. Specifically, our method allows a significant reduction in cost and instrument time as compared to the standard protocol of running all fractions, with little compromise to coverage. We develop algorithmics to optimize the selection of the IEF fractions on which to run LC-MS/MS. We translate the fraction optimization task to Minimum Set Cover, a well-studied NP-hard problem. We develop heuristic solutions and compare them in terms of effectiveness and running times. We provide examples to demonstrate advantages and limitations of each algorithmic approach. Finally, we test our methodology by applying it to experimental data obtained from IEF LC-MS/MS analysis of yeast and human samples. We demonstrate the benefit of this approach for analyzing complex samples with a focus on different protein sets of interest.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "IEF LC-MS/MS is an analytical method that incorporates a two-step sample separation prior to MS identification of proteins. When analyzing complex samples this preparatory separation allows for higher analytical depth and improved quantification accuracy of proteins. However, cost and analysis time are greatly increased as each analyzed IEF fraction is separately profiled using LC-MS/MS. We propose an approach that selects a subset of IEF fractions for LC-MS/MS analysis that is highly informative in the context of a group of proteins of interest. Specifically, our method allows a significant reduction in cost and instrument time as compared to the standard protocol of running all fractions, with little compromise to coverage. We develop algorithmics to optimize the selection of the IEF fractions on which to run LC-MS/MS. We translate the fraction optimization task to Minimum Set Cover, a well-studied NP-hard problem. We develop heuristic solutions and compare them in terms of effectiveness and running times. We provide examples to demonstrate advantages and limitations of each algorithmic approach. Finally, we test our methodology by applying it to experimental data obtained from IEF LC-MS/MS analysis of yeast and human samples. We demonstrate the benefit of this approach for analyzing complex samples with a focus on different protein sets of interest.",
"title": "Optimizing Analytical Depth and Cost Efficiency of IEF-LC/MS Proteomics",
"normalizedTitle": "Optimizing Analytical Depth and Cost Efficiency of IEF-LC/MS Proteomics",
"fno": "07150335",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Proteins",
"Peptides",
"Standards",
"Proteomics",
"Algorithm Design And Analysis",
"Focusing",
"Approximation Methods",
"Coverage",
"Iso Electric Focusing",
"Minimum Set Cover",
"Greedy Heuristics",
"Analytical Depth",
"Cost Effectiveness"
],
"authors": [
{
"givenName": "Ilona",
"surname": "Kifer",
"fullName": "Ilona Kifer",
"affiliation": "Agilent Laboratories, Tel Aviv, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Rui M.",
"surname": "Branca",
"fullName": "Rui M. Branca",
"affiliation": "Karolinska Institute, Stockholm, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Amir",
"surname": "Ben-Dor",
"fullName": "Amir Ben-Dor",
"affiliation": "Agilent Laboratories, Tel Aviv, Israel",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Linhui",
"surname": "Zhai",
"fullName": "Linhui Zhai",
"affiliation": "BPRC, Beijing Institute of Radiation Medicine, Beijing, P.R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Ping",
"surname": "Xu",
"fullName": "Ping Xu",
"affiliation": "BPRC, Beijing Institute of Radiation Medicine, Beijing, P.R. China",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Janne",
"surname": "Lehtiö",
"fullName": "Janne Lehtiö",
"affiliation": "Karolinska Institute, Stockholm, Sweden",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Zohar",
"surname": "Yakhini",
"fullName": "Zohar Yakhini",
"affiliation": "Agilent Laboratories, Tel Aviv, Israel",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "02",
"pubDate": "2017-03-01 00:00:00",
"pubType": "trans",
"pages": "272-281",
"year": "2017",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2014/5669/0/06999136",
"title": "Optimizing analytical depth and cost efficiency of IEF-LC/MS proteomics",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999136/12OmNAOKnVG",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2010/8303/0/05703775",
"title": "Using a spike-in experiment to evaluate analysis of LC-MS data",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2010/05703775/12OmNBhZ4q8",
"parentPublication": {
"id": "proceedings/bibmw/2010/8303/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2013/1309/0/06732616",
"title": "GPA: An algorithm for LC/MS based glycan profile annotation",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732616/12OmNCcbE7F",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibmw/2010/8303/0/05703856",
"title": "A novel peak alignment method for LC-MS data analysis using cluster-based techniques",
"doi": null,
"abstractUrl": "/proceedings-article/bibmw/2010/05703856/12OmNCdk2Bs",
"parentPublication": {
"id": "proceedings/bibmw/2010/8303/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2007/3031/0/30310230",
"title": "Robust Estimation and Graph-Based Meta Clustering for LC-MS Feature Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2007/30310230/12OmNCdk2Kt",
"parentPublication": {
"id": "proceedings/bibm/2007/3031/0",
"title": "2007 IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2010/8306/0/05706589",
"title": "A new method for alignment of LC-MALDI-TOF data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2010/05706589/12OmNwnH4U9",
"parentPublication": {
"id": "proceedings/bibm/2010/8306/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120447",
"title": "Bayesian Alignment Model for LC-MS Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120447/12OmNzWfp5q",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120456",
"title": "Improved Quantification of Labeled LC-MS",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120456/12OmNzaQoh9",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2023/01/09676484",
"title": "An Interpretable Deep Learning Approach for Biomarker Detection in LC-MS Proteomics Data",
"doi": null,
"abstractUrl": "/journal/tb/2023/01/09676484/1A3dhLEDej6",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995258",
"title": "Deep Learning Based MS2 Feature Detection for Data-Independent Shotgun Proteomics",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995258/1JC33LZHvUs",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "07303908",
"articleId": "13rRUwd9CK9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07164288",
"articleId": "13rRUNvyarS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"webExtras": [],
"articleVideos": []
}
|
{
"issue": {
"id": "1KsQUyqsSje",
"title": "Jan.-Feb.",
"year": "2023",
"issueNum": "01",
"idPrefix": "tb",
"pubType": "journal",
"volume": "20",
"label": "Jan.-Feb.",
"downloadables": {
"hasCover": false,
"__typename": "PeriodicalIssueDownloadablesType"
},
"__typename": "PeriodicalIssue"
},
"article": {
"id": "1A3dhLEDej6",
"doi": "10.1109/TCBB.2022.3141656",
"abstract": "Analyzing mass spectrometry-based proteomics data with deep learning (DL) approaches poses several challenges due to the high dimensionality, low sample size, and high level of noise. Additionally, DL-based workflows are often hindered to be integrated into medical settings due to the lack of interpretable explanation. We present DLearnMS, a DL biomarker detection framework, to address these challenges on proteomics instances of liquid chromatography-mass spectrometry (LC-MS) - a well-established tool for quantifying complex protein mixtures. Our DLearnMS framework learns the clinical state of LC-MS data instances using convolutional neural networks. Based on the trained neural networks, we show how biomarkers can be identified using layer-wise relevance propagation. This enables detecting discriminating regions of the data and the design of more robust networks. One of the main advantages over other established methods is that no explicit preprocessing step is needed in our DLearnMS framework. Our evaluation shows that DLearnMS outperforms conventional LC-MS biomarker detection approaches in identifying fewer false positive peaks while maintaining a comparable amount of true positives peaks. Code availability: The code is available from the following GIT repository: <uri>https://github.com/SaharIravani/DlearnMS</uri>.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Analyzing mass spectrometry-based proteomics data with deep learning (DL) approaches poses several challenges due to the high dimensionality, low sample size, and high level of noise. Additionally, DL-based workflows are often hindered to be integrated into medical settings due to the lack of interpretable explanation. We present DLearnMS, a DL biomarker detection framework, to address these challenges on proteomics instances of liquid chromatography-mass spectrometry (LC-MS) - a well-established tool for quantifying complex protein mixtures. Our DLearnMS framework learns the clinical state of LC-MS data instances using convolutional neural networks. Based on the trained neural networks, we show how biomarkers can be identified using layer-wise relevance propagation. This enables detecting discriminating regions of the data and the design of more robust networks. One of the main advantages over other established methods is that no explicit preprocessing step is needed in our DLearnMS framework. Our evaluation shows that DLearnMS outperforms conventional LC-MS biomarker detection approaches in identifying fewer false positive peaks while maintaining a comparable amount of true positives peaks. Code availability: The code is available from the following GIT repository: <uri>https://github.com/SaharIravani/DlearnMS</uri>.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Analyzing mass spectrometry-based proteomics data with deep learning (DL) approaches poses several challenges due to the high dimensionality, low sample size, and high level of noise. Additionally, DL-based workflows are often hindered to be integrated into medical settings due to the lack of interpretable explanation. We present DLearnMS, a DL biomarker detection framework, to address these challenges on proteomics instances of liquid chromatography-mass spectrometry (LC-MS) - a well-established tool for quantifying complex protein mixtures. Our DLearnMS framework learns the clinical state of LC-MS data instances using convolutional neural networks. Based on the trained neural networks, we show how biomarkers can be identified using layer-wise relevance propagation. This enables detecting discriminating regions of the data and the design of more robust networks. One of the main advantages over other established methods is that no explicit preprocessing step is needed in our DLearnMS framework. Our evaluation shows that DLearnMS outperforms conventional LC-MS biomarker detection approaches in identifying fewer false positive peaks while maintaining a comparable amount of true positives peaks. Code availability: The code is available from the following GIT repository: https://github.com/SaharIravani/DlearnMS.",
"title": "An Interpretable Deep Learning Approach for Biomarker Detection in LC-MS Proteomics Data",
"normalizedTitle": "An Interpretable Deep Learning Approach for Biomarker Detection in LC-MS Proteomics Data",
"fno": "09676484",
"hasPdf": true,
"idPrefix": "tb",
"keywords": [
"Bioinformatics",
"Biology Computing",
"Chromatography",
"Convolutional Neural Nets",
"Deep Learning Artificial Intelligence",
"Mass Spectroscopic Chemical Analysis",
"Proteins",
"Proteomics",
"Complex Protein Mixtures",
"Convolutional Neural Networks",
"DL Biomarker Detection Framework",
"DL Based Workflows",
"D Learn MS Framework",
"Interpretable Deep Learning Approach",
"Layer Wise Relevance Propagation",
"LC MS Biomarker Detection",
"LC MS Proteomics Data",
"Liquid Chromatography Mass Spectrometry",
"Mass Spectrometry Based Proteomics Data",
"Trained Neural Networks",
"Deep Learning",
"Proteomics",
"Biological System Modeling",
"Feature Extraction",
"Diseases",
"Peptides",
"Training",
"Biomarker Detection",
"Mass Spectrometry",
"LC MS Proteomics",
"Deep Learning Interpretation",
"Layer Wise Relevance Propagation"
],
"authors": [
{
"givenName": "Sahar",
"surname": "Iravani",
"fullName": "Sahar Iravani",
"affiliation": "Department of Visual and Data-centric Computing, Zuse Institute of Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
},
{
"givenName": "Tim O.F.",
"surname": "Conrad",
"fullName": "Tim O.F. Conrad",
"affiliation": "Department of Visual and Data-centric Computing, Zuse Institute of Berlin, Berlin, Germany",
"__typename": "ArticleAuthorType"
}
],
"replicability": null,
"showBuyMe": false,
"showRecommendedArticles": true,
"isOpenAccess": true,
"issueNum": "01",
"pubDate": "2023-01-01 00:00:00",
"pubType": "trans",
"pages": "151-161",
"year": "2023",
"issn": "1545-5963",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2014/5669/0/06999136",
"title": "Optimizing analytical depth and cost efficiency of IEF-LC/MS proteomics",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999136/12OmNAOKnVG",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2006/2545/0/25450460",
"title": "Compression of LC/MS Proteomic Data",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2006/25450460/12OmNAndiu7",
"parentPublication": {
"id": "proceedings/dcc/2006/2545/0",
"title": "Proceedings. DCC 2006. Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2005/2268/9/22680279c",
"title": "Bioinformatics Approach for Exploring MS/MS Proteomics Data",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2005/22680279c/12OmNqyUUEM",
"parentPublication": {
"id": "proceedings/hicss/2005/2268/9",
"title": "Proceedings of the 38th Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2010/8306/0/05706589",
"title": "A new method for alignment of LC-MALDI-TOF data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2010/05706589/12OmNwnH4U9",
"parentPublication": {
"id": "proceedings/bibm/2010/8306/0",
"title": "2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2007/1509/0/04375634",
"title": "Application of Wavelet Transform to the MS-based Proteomics Data Preprocessing",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2007/04375634/12OmNx6PiE8",
"parentPublication": {
"id": "proceedings/bibe/2007/1509/0",
"title": "7th IEEE International Conference on Bioinformatics and Bioengineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2009/4879/0/05255456",
"title": "A neural network approach to multi-biomarker panel development based on LC/MS/MS proteomics profiles: A case study in breast cancer",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2009/05255456/12OmNyOHG1r",
"parentPublication": {
"id": "proceedings/cbms/2009/4879/0",
"title": "2009 22nd IEEE International Symposium on Computer-Based Medical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2011/1799/0/06120447",
"title": "Bayesian Alignment Model for LC-MS Data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2011/06120447/12OmNzWfp5q",
"parentPublication": {
"id": "proceedings/bibm/2011/1799/0",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2017/02/07150335",
"title": "Optimizing Analytical Depth and Cost Efficiency of IEF-LC/MS Proteomics",
"doi": null,
"abstractUrl": "/journal/tb/2017/02/07150335/13rRUy3xY6z",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995258",
"title": "Deep Learning Based MS2 Feature Detection for Data-Independent Shotgun Proteomics",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995258/1JC33LZHvUs",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2019/3510/0/555500a191",
"title": "LBE: A Computational Load Balancing Algorithm for Speeding up Parallel Peptide Search in Mass-Spectrometry Based Proteomics",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2019/555500a191/1c2bJCcpXxu",
"parentPublication": {
"id": "proceedings/ipdpsw/2019/3510/0",
"title": "2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"adjacentArticles": {
"previous": {
"fno": "09652089",
"articleId": "1zmuOFxGreg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09730023",
"articleId": "1BzORTQ41Lq",
"__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.