data
dict |
|---|
{
"proceeding": {
"id": "12OmNzVGcJp",
"title": "2011 IEEE International Conference on Bioinformatics and Biomedicine",
"acronym": "bibm",
"groupId": "1001586",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzWfp5q",
"doi": "10.1109/BIBM.2011.81",
"title": "Bayesian Alignment Model for LC-MS Data",
"normalizedTitle": "Bayesian Alignment Model for LC-MS Data",
"abstract": "A Bayesian alignment model (BAM) is proposed for alignment of liquid chromatography-mass spectrometry (LC-MS) data. BAM is composed of two important components: prototype function and mapping function. Estimation of both functions is crucial for the alignment result. We use Markov chain Monte Carlo (MCMC) methods for inference of model parameters. To address the trapping effect in local modes, we propose a block Metropolis-Hastings algorithm that leads to better mixing behavior in updating the mapping function coefficients. We applied BAM to both simulated and real LC-MS datasets, and compared its performance with the Bayesian hierarchical curve registration model (BHCR). Performance evaluation on both simulated and real datasets shows satisfactory results in terms of correlation coefficients and ratio of overlapping peak areas.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A Bayesian alignment model (BAM) is proposed for alignment of liquid chromatography-mass spectrometry (LC-MS) data. BAM is composed of two important components: prototype function and mapping function. Estimation of both functions is crucial for the alignment result. We use Markov chain Monte Carlo (MCMC) methods for inference of model parameters. To address the trapping effect in local modes, we propose a block Metropolis-Hastings algorithm that leads to better mixing behavior in updating the mapping function coefficients. We applied BAM to both simulated and real LC-MS datasets, and compared its performance with the Bayesian hierarchical curve registration model (BHCR). Performance evaluation on both simulated and real datasets shows satisfactory results in terms of correlation coefficients and ratio of overlapping peak areas.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A Bayesian alignment model (BAM) is proposed for alignment of liquid chromatography-mass spectrometry (LC-MS) data. BAM is composed of two important components: prototype function and mapping function. Estimation of both functions is crucial for the alignment result. We use Markov chain Monte Carlo (MCMC) methods for inference of model parameters. To address the trapping effect in local modes, we propose a block Metropolis-Hastings algorithm that leads to better mixing behavior in updating the mapping function coefficients. We applied BAM to both simulated and real LC-MS datasets, and compared its performance with the Bayesian hierarchical curve registration model (BHCR). Performance evaluation on both simulated and real datasets shows satisfactory results in terms of correlation coefficients and ratio of overlapping peak areas.",
"fno": "06120447",
"keywords": [
"Bayes Methods",
"Biology Computing",
"Cellular Biophysics",
"Chromatography",
"Data Handling",
"Markov Processes",
"Mass Spectra",
"Monte Carlo Methods",
"Proteins",
"Bayesian Alignment Model",
"LC MS Data",
"Liquid Chromatography Mass Spetrometry",
"Prototype Function",
"Mapping Function",
"Markov Chain Monte Carlo Method",
"Block Metropolis Hastings Algorithm",
"Bayesian Hierarchical Curve Registration Model",
"Correlation Coefficient",
"Data Alignment",
"Biological Samples",
"Peptide Protein Abundance",
"Bayesian Methods",
"Prototypes",
"Markov Processes",
"Monte Carlo Methods",
"Inference Algorithms",
"Proteomics",
"Proteins",
"Bayesian Inference",
"Block Metropolis Hastings Algorithm",
"Liquid Chromatography Massspectrometry LC MS",
"Markov Chain Monte Carlo MCMC"
],
"authors": [
{
"affiliation": null,
"fullName": "Tsung-Heng Tsai",
"givenName": "Tsung-Heng",
"surname": "Tsai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mahlet G. Tadesse",
"givenName": "Mahlet G.",
"surname": "Tadesse",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yue Wang",
"givenName": "Yue",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Habtom W. Ressom",
"givenName": "Habtom W.",
"surname": "Ressom",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bibm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-11-01T00:00:00",
"pubType": "proceedings",
"pages": "261-264",
"year": "2011",
"issn": null,
"isbn": "978-1-4577-1799-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06120446",
"articleId": "12OmNy7yEg9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06120448",
"articleId": "12OmNAoDi8M",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"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/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/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/icpr/2012/2216/0/06460638",
"title": "Time series alignment with Gaussian processes",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460638/12OmNyRxFun",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__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/2015/04/06977927",
"title": "Bayesian Normalization Model for Label-Free Quantitative Analysis by LC-MS",
"doi": null,
"abstractUrl": "/journal/tb/2015/04/06977927/13rRUxlgyab",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2011/05/ttb2011051417",
"title": "Probabilistic Mixture Regression Models for Alignment of LC-MS Data",
"doi": null,
"abstractUrl": "/journal/tb/2011/05/ttb2011051417/13rRUy0qnKb",
"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"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1uOtWEKbmSc",
"title": "2020 XLVI Latin American Computing Conference (CLEI)",
"acronym": "clei",
"groupId": "1801981",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1uOu1CrVz4k",
"doi": "10.1109/CLEI52000.2020.00070",
"title": "Interactive Competency-Based Curriculum Visualizations to Map and Analyze an Academic Computing Program",
"normalizedTitle": "Interactive Competency-Based Curriculum Visualizations to Map and Analyze an Academic Computing Program",
"abstract": "Higher education institutions usually show their curricula designs as static images. These images communicate the syllabus structure and elements to stakeholders. The curricula visualization area is growing interest in supporting description of competency-based curricula, curriculum analysis, and showing clear evidence of the relationship between the graduation profile and curriculum elements. This area also makes comparisons between curricula and international references; particularly in the case of computing programs, the ACM/IEEE Computing Curricula. So far, the vast majority of curriculum visualizations are static. These visualizations do not show all concepts and relationships of the curriculum, especially in the case of a competency-based curriculum. The visualization of a competency-based curriculum is a great challenge. Having so many concepts makes visualization more difficult to understand. All in all, it is necessary to develop: 1) a set of interactive visualizations with a filtering mechanism to facilitate navigation, understand concepts, and enlighten curriculum relationships, 2) visualizations that will check the relationship between competencies of the graduation profile and curriculum elements, and 3) visualizations that allow comparison with international references such as the ACM/IEEE Computing Curriculum. This work presents a prototype with nine interactive visualizations for competency-based curriculum in computing programs, which attend the above list of three needs. This prototype tool was tested and validated during the curricular reform of academic programs of the School of Systems Engineering and Computing (EISC) in the Universidad del Valle.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Higher education institutions usually show their curricula designs as static images. These images communicate the syllabus structure and elements to stakeholders. The curricula visualization area is growing interest in supporting description of competency-based curricula, curriculum analysis, and showing clear evidence of the relationship between the graduation profile and curriculum elements. This area also makes comparisons between curricula and international references; particularly in the case of computing programs, the ACM/IEEE Computing Curricula. So far, the vast majority of curriculum visualizations are static. These visualizations do not show all concepts and relationships of the curriculum, especially in the case of a competency-based curriculum. The visualization of a competency-based curriculum is a great challenge. Having so many concepts makes visualization more difficult to understand. All in all, it is necessary to develop: 1) a set of interactive visualizations with a filtering mechanism to facilitate navigation, understand concepts, and enlighten curriculum relationships, 2) visualizations that will check the relationship between competencies of the graduation profile and curriculum elements, and 3) visualizations that allow comparison with international references such as the ACM/IEEE Computing Curriculum. This work presents a prototype with nine interactive visualizations for competency-based curriculum in computing programs, which attend the above list of three needs. This prototype tool was tested and validated during the curricular reform of academic programs of the School of Systems Engineering and Computing (EISC) in the Universidad del Valle.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Higher education institutions usually show their curricula designs as static images. These images communicate the syllabus structure and elements to stakeholders. The curricula visualization area is growing interest in supporting description of competency-based curricula, curriculum analysis, and showing clear evidence of the relationship between the graduation profile and curriculum elements. This area also makes comparisons between curricula and international references; particularly in the case of computing programs, the ACM/IEEE Computing Curricula. So far, the vast majority of curriculum visualizations are static. These visualizations do not show all concepts and relationships of the curriculum, especially in the case of a competency-based curriculum. The visualization of a competency-based curriculum is a great challenge. Having so many concepts makes visualization more difficult to understand. All in all, it is necessary to develop: 1) a set of interactive visualizations with a filtering mechanism to facilitate navigation, understand concepts, and enlighten curriculum relationships, 2) visualizations that will check the relationship between competencies of the graduation profile and curriculum elements, and 3) visualizations that allow comparison with international references such as the ACM/IEEE Computing Curriculum. This work presents a prototype with nine interactive visualizations for competency-based curriculum in computing programs, which attend the above list of three needs. This prototype tool was tested and validated during the curricular reform of academic programs of the School of Systems Engineering and Computing (EISC) in the Universidad del Valle.",
"fno": "156000a546",
"keywords": [
"Computer Science Education",
"Educational Courses",
"Educational Institutions",
"Further Education",
"Computing Programs",
"Interactive Competency Based Curriculum Visualizations",
"Academic Computing Program",
"Curricula Designs",
"Syllabus Structure",
"Curricula Visualization Area",
"Competency Based Curricula",
"Curriculum Analysis",
"Graduation Profile",
"International References",
"Interactive Visualizations",
"Curriculum Relationships",
"Visualization",
"Software",
"Prototypes",
"Tools",
"Systems Engineering And Theory",
"Stakeholders",
"Software Development Management",
"Curriculum Visualizations",
"Interactive Visualizations",
"Macrocurriculum",
"Mesocurriculum",
"Learning Outcomes",
"Curriculum In Computing"
],
"authors": [
{
"affiliation": "EISC, Universidad del Valle,Cali,Colombia",
"fullName": "Leidy Johanna Carvajal Ortiz",
"givenName": "Leidy Johanna Carvajal",
"surname": "Ortiz",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "EISC, Universidad del Valle,Cali,Colombia",
"fullName": "Beatriz Eugenia Florián Gaviria",
"givenName": "Beatriz Eugenia Florián",
"surname": "Gaviria",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "clei",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-10-01T00:00:00",
"pubType": "proceedings",
"pages": "546-555",
"year": "2020",
"issn": null,
"isbn": "978-1-6654-1560-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "156000a541",
"articleId": "1uOu1q3fOPC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "156000a557",
"articleId": "1uOu36lZk9q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2008/3167/0/3167b013",
"title": "A Competency Approach: Implications for E-Learning and E-Assessment",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2008/3167b013/12OmNAMtAOs",
"parentPublication": {
"id": "proceedings/icalt/2008/3167/0",
"title": "IEEE International Conference on Advanced Learning Technologies (ICALT 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2005/9077/0/01611955",
"title": "A Project-Based Approach To First-Year Engineering Curriculum Development",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2005/01611955/12OmNwBjP1G",
"parentPublication": {
"id": "proceedings/fie/2005/9077/0",
"title": "35th Annual Frontiers in Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2005/9077/0/01612046",
"title": "ABET engineering technology criteria and competency based engineering education",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2005/01612046/12OmNwDACvv",
"parentPublication": {
"id": "proceedings/fie/2005/9077/0",
"title": "35th Annual Frontiers in Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2008/1969/0/04720392",
"title": "Work in progress - curriculum visualization",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2008/04720392/12OmNxFaLuh",
"parentPublication": {
"id": "proceedings/fie/2008/1969/0",
"title": "2008 38th Annual Frontiers in Education Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/1998/4762/3/00738690",
"title": "An overview of curriculum module development in semiconductor manufacturing technology",
"doi": null,
"abstractUrl": "/proceedings-article/fie/1998/00738690/12OmNzTH0YF",
"parentPublication": {
"id": "proceedings/fie/1998/4762/3",
"title": "FIE '98. 28th Annual Frontiers in Education Conference. Moving from 'Teacher-Centered' to 'Learner-Centered' Education. Conference Proceedings (Cat. No.98CH36214)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaml/2021/2125/0/212500a136",
"title": "Research on the Competency Model of University Teachers under the Background of Curriculum Ideological and Political Education",
"doi": null,
"abstractUrl": "/proceedings-article/icaml/2021/212500a136/1B617f1gEik",
"parentPublication": {
"id": "proceedings/icaml/2021/2125/0",
"title": "2021 3rd International Conference on Applied Machine Learning (ICAML)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eitt/2019/4288/0/428800a233",
"title": "Connect Real World: Design of Educational Resources Platform for Integrated Curriculum",
"doi": null,
"abstractUrl": "/proceedings-article/eitt/2019/428800a233/1fHkRtHnIvS",
"parentPublication": {
"id": "proceedings/eitt/2019/4288/0",
"title": "2019 Eighth International Conference of Educational Innovation through Technology (EITT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2020/8961/0/09274288",
"title": "From Knowledge-based to Competency-based Computing Education: Future Directions",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2020/09274288/1phRCtpGoZW",
"parentPublication": {
"id": "proceedings/fie/2020/8961/0",
"title": "2020 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2020/8961/0/09274008",
"title": "Design by Thread: The E4USA Engineering for Us All Curriculum",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2020/09274008/1phRuFePG92",
"parentPublication": {
"id": "proceedings/fie/2020/8961/0",
"title": "2020 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637150",
"title": "IS2020:Competency-Based Information Systems Curriculum Guidelines",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637150/1zuvJZaxAQw",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzRZpZU",
"title": "2012 IEEE VR Workshop on Perceptual Illusions in Virtual Environments",
"acronym": "pive",
"groupId": "1801625",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqJ8tiF",
"doi": "10.1109/PIVE.2012.6229794",
"title": "Learning special relativity energy laws using visio-haptic illusion",
"normalizedTitle": "Learning special relativity energy laws using visio-haptic illusion",
"abstract": "Visual analysis of complex scientific simulation data often gain to be completed by an exploration with advanced Virtual Reality modalities as the haptic channel. But exploiting the haptic channel with a force-feedback device can be problematic when the profile of the forces to be conveyed to the user is inherently nonlinear. As application domain we are interested in learning relativity. Specifically, we focused our interest in studying the evolution of the kinetic energy of an object approaching the speed of the light. Indeed, the divergent value of momentum for a fast moving object is a difficult concept to understand for students in theoretical physics. In this didactic context, we propose to use a spring launcher based visuohaptic metaphor to allows a user to i) intuitively set the speed of objects in a relativistic framework and ii) access to the law beside the momentum value through this interactive experience. In this context, we imply that a user could interpret and remember an abstract mathematical concept by experiencing it in a VR simulation without having any knowledge and experience neither with haptic rendering nor with special relativity knowledge. In this paper, the contribution of visuo-haptic illusion and pseudo-haptic techniques is analysed with respect to a standard visual-haptic coupling. After formulating the laws of haptic control for this specific problem, a first evaluation is presented with preliminary results. These first results highlight the effectiveness of pseudo-haptic rendering technique used for the interaction design with a complex force profiles and its interpretation taking into account a didactic goal.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Visual analysis of complex scientific simulation data often gain to be completed by an exploration with advanced Virtual Reality modalities as the haptic channel. But exploiting the haptic channel with a force-feedback device can be problematic when the profile of the forces to be conveyed to the user is inherently nonlinear. As application domain we are interested in learning relativity. Specifically, we focused our interest in studying the evolution of the kinetic energy of an object approaching the speed of the light. Indeed, the divergent value of momentum for a fast moving object is a difficult concept to understand for students in theoretical physics. In this didactic context, we propose to use a spring launcher based visuohaptic metaphor to allows a user to i) intuitively set the speed of objects in a relativistic framework and ii) access to the law beside the momentum value through this interactive experience. In this context, we imply that a user could interpret and remember an abstract mathematical concept by experiencing it in a VR simulation without having any knowledge and experience neither with haptic rendering nor with special relativity knowledge. In this paper, the contribution of visuo-haptic illusion and pseudo-haptic techniques is analysed with respect to a standard visual-haptic coupling. After formulating the laws of haptic control for this specific problem, a first evaluation is presented with preliminary results. These first results highlight the effectiveness of pseudo-haptic rendering technique used for the interaction design with a complex force profiles and its interpretation taking into account a didactic goal.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Visual analysis of complex scientific simulation data often gain to be completed by an exploration with advanced Virtual Reality modalities as the haptic channel. But exploiting the haptic channel with a force-feedback device can be problematic when the profile of the forces to be conveyed to the user is inherently nonlinear. As application domain we are interested in learning relativity. Specifically, we focused our interest in studying the evolution of the kinetic energy of an object approaching the speed of the light. Indeed, the divergent value of momentum for a fast moving object is a difficult concept to understand for students in theoretical physics. In this didactic context, we propose to use a spring launcher based visuohaptic metaphor to allows a user to i) intuitively set the speed of objects in a relativistic framework and ii) access to the law beside the momentum value through this interactive experience. In this context, we imply that a user could interpret and remember an abstract mathematical concept by experiencing it in a VR simulation without having any knowledge and experience neither with haptic rendering nor with special relativity knowledge. In this paper, the contribution of visuo-haptic illusion and pseudo-haptic techniques is analysed with respect to a standard visual-haptic coupling. After formulating the laws of haptic control for this specific problem, a first evaluation is presented with preliminary results. These first results highlight the effectiveness of pseudo-haptic rendering technique used for the interaction design with a complex force profiles and its interpretation taking into account a didactic goal.",
"fno": "06229794",
"keywords": [
"Digital Simulation",
"Force Feedback",
"Haptic Interfaces",
"Natural Sciences Computing",
"Physics Education",
"Relativity",
"Rendering Computer Graphics",
"Virtual Reality",
"Special Relativity Energy Laws Learning",
"Visio Haptic Illusion",
"Visual Analysis",
"Complex Scientific Simulation Data",
"Advanced Virtual Reality Modalities",
"Haptic Channel",
"Force Feedback Device",
"Kinetic Energy",
"Speed Of The Light",
"Theoretical Physics",
"Abstract Mathematical",
"VR Simulation",
"Visuo Haptic Illusion",
"Pseudo Haptic Techniques",
"Standard Visual Haptic Coupling",
"Haptic Control",
"Pseudo Haptic Rendering Technique",
"Interaction Design",
"Force",
"Rendering Computer Graphics",
"Visualization",
"Springs",
"Context",
"Force Feedback",
"H 5 2 User Interfaces Haptic I O",
"I 3 6 Methodology And Techniques Interaction Techniques",
"I 3 6 Methodology And Techniques Ergonomics"
],
"authors": [
{
"affiliation": "APC - Paris 7 University, France",
"fullName": "Nicolas Ladeveze",
"givenName": "Nicolas",
"surname": "Ladeveze",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CNRS/LIMSI/VENISE group, Orsay, France",
"fullName": "Tony Doat",
"givenName": "Tony",
"surname": "Doat",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "APC - Paris 7 University, France",
"fullName": "Etienne Parizot",
"givenName": "Etienne",
"surname": "Parizot",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CNRS/LIMSI/VENISE group, Orsay, France",
"fullName": "Jean-Marc Vézien",
"givenName": "Jean-Marc",
"surname": "Vézien",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pive",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-03-01T00:00:00",
"pubType": "proceedings",
"pages": "10-16",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-1218-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06229793",
"articleId": "12OmNrJRPoT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06229795",
"articleId": "12OmNzUxOk4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/haptic/2006/0226/0/01627126",
"title": "Haptic Force Shading Parameter Effects on Path Tracing Accuracy",
"doi": null,
"abstractUrl": "/proceedings-article/haptic/2006/01627126/12OmNqI04FQ",
"parentPublication": {
"id": "proceedings/haptic/2006/0226/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892232",
"title": "Evaluation of a penalty and a constraint-based haptic rendering algorithm with different haptic interfaces and stiffness values",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892232/12OmNxR5UMO",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2009/3943/0/04810990",
"title": "Spatialized Haptic Rendering: Providing Impact Position Information in 6DOF Haptic Simulations Using Vibrations",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2009/04810990/12OmNxw5BnV",
"parentPublication": {
"id": "proceedings/vr/2009/3943/0",
"title": "2009 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2007/0905/0/04161034",
"title": "Real-time Volumetric Haptic and Visual Burrhole Simulation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2007/04161034/12OmNy7yEem",
"parentPublication": {
"id": "proceedings/vr/2007/0905/0",
"title": "2007 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223364",
"title": "Desktop versions of the string-based haptic interface — SPIDAR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223364/12OmNyY4rj2",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nicoint/2016/2305/0/2305a029",
"title": "Development of a Whack-a-Mole Game with Haptic Feedback for Rehabilitation",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2016/2305a029/12OmNz6iOkd",
"parentPublication": {
"id": "proceedings/nicoint/2016/2305/0",
"title": "2016 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2015/04/07115121",
"title": "Experimental Study on the Perception Characteristics of Haptic Texture by Multidimensional Scaling",
"doi": null,
"abstractUrl": "/journal/th/2015/04/07115121/13rRUILtJr6",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2012/02/tth2012020097",
"title": "Abdominal Palpation Haptic Device for Colonoscopy Simulation Using Pneumatic Control",
"doi": null,
"abstractUrl": "/journal/th/2012/02/tth2012020097/13rRUwInvyJ",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2014/02/06763021",
"title": "Portable Haptic Interface with Omni-Directional Movement and Force Capability",
"doi": null,
"abstractUrl": "/journal/th/2014/02/06763021/13rRUzp02oC",
"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"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzw8jgZ",
"title": "2011 IEEE Virtual Reality (VR)",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqJ8tn2",
"doi": "10.1109/VR.2011.5759468",
"title": "A carom billiard to understand special relativity",
"normalizedTitle": "A carom billiard to understand special relativity",
"abstract": "Relativity, as introduced by Einstein, is regarded as one of the most important revolutions in the history of physics. Nevertheless, the observation of direct outcomes of this theory on mundane objects is impossible because they can only be witnessed when travelling at relative speeds approaching the velocity of light c. These effects are so counterintuitive and contradicting with our daily understanding of space and time that physics students find it hard to learn relativity beyond mathematical equations and to understand the deep implications of the theory. Advances in Computer Graphics and Interaction Technology now make it possible to actually experiment the effects of relativity in a 3D immersive environment. We propose a Virtual Reality framework to study and learn relativity as well as to develop some intuition of the relativistic effects and the quadri-dimensional reality of space-time. More precisely, an innovative rendering engine and a non-Newtonian physics engine are combined to compute relativistic effects. Experiments are proposed within a game-oriented carom billiard environment. Our work improves over previous efforts in the ability i) to render in real-time multiple relativistic objects, each moving with a different velocity vector ii) to enable interactions between objects and iii) to enable the user to interact with the objects and modify the scene dynamically. The originality of our 4D rendering engine lies in its capacity to efficiently store and retrieve non-simultaneous past space-time events that are visible by an observer at a specific location and at a given instant of his proper time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Relativity, as introduced by Einstein, is regarded as one of the most important revolutions in the history of physics. Nevertheless, the observation of direct outcomes of this theory on mundane objects is impossible because they can only be witnessed when travelling at relative speeds approaching the velocity of light c. These effects are so counterintuitive and contradicting with our daily understanding of space and time that physics students find it hard to learn relativity beyond mathematical equations and to understand the deep implications of the theory. Advances in Computer Graphics and Interaction Technology now make it possible to actually experiment the effects of relativity in a 3D immersive environment. We propose a Virtual Reality framework to study and learn relativity as well as to develop some intuition of the relativistic effects and the quadri-dimensional reality of space-time. More precisely, an innovative rendering engine and a non-Newtonian physics engine are combined to compute relativistic effects. Experiments are proposed within a game-oriented carom billiard environment. Our work improves over previous efforts in the ability i) to render in real-time multiple relativistic objects, each moving with a different velocity vector ii) to enable interactions between objects and iii) to enable the user to interact with the objects and modify the scene dynamically. The originality of our 4D rendering engine lies in its capacity to efficiently store and retrieve non-simultaneous past space-time events that are visible by an observer at a specific location and at a given instant of his proper time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Relativity, as introduced by Einstein, is regarded as one of the most important revolutions in the history of physics. Nevertheless, the observation of direct outcomes of this theory on mundane objects is impossible because they can only be witnessed when travelling at relative speeds approaching the velocity of light c. These effects are so counterintuitive and contradicting with our daily understanding of space and time that physics students find it hard to learn relativity beyond mathematical equations and to understand the deep implications of the theory. Advances in Computer Graphics and Interaction Technology now make it possible to actually experiment the effects of relativity in a 3D immersive environment. We propose a Virtual Reality framework to study and learn relativity as well as to develop some intuition of the relativistic effects and the quadri-dimensional reality of space-time. More precisely, an innovative rendering engine and a non-Newtonian physics engine are combined to compute relativistic effects. Experiments are proposed within a game-oriented carom billiard environment. Our work improves over previous efforts in the ability i) to render in real-time multiple relativistic objects, each moving with a different velocity vector ii) to enable interactions between objects and iii) to enable the user to interact with the objects and modify the scene dynamically. The originality of our 4D rendering engine lies in its capacity to efficiently store and retrieve non-simultaneous past space-time events that are visible by an observer at a specific location and at a given instant of his proper time.",
"fno": "05759468",
"keywords": [
"4 D Rendering Engine",
"Special Relativity",
"Physics",
"Computer Graphics",
"Interaction Technology",
"3 D Immersive Environment",
"Virtual Reality Framework",
"Quadridimensional Space Time Reality",
"Non Newtonian Physics Engine",
"Game Oriented Carom Billiard Environment"
],
"authors": [
{
"affiliation": "LIMSI, CNRS, Orsay, France",
"fullName": "T Doat",
"givenName": "T",
"surname": "Doat",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "APC, Paris Diderot Univ., Paris, France",
"fullName": "E Parizot",
"givenName": "E",
"surname": "Parizot",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LIMSI, CNRS, Orsay, France",
"fullName": "J-M Vezien",
"givenName": "J-M",
"surname": "Vezien",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-03-01T00:00:00",
"pubType": "proceedings",
"pages": "201-202",
"year": "2011",
"issn": null,
"isbn": "978-1-4577-0039-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05759467",
"articleId": "12OmNvoFjQv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05759469",
"articleId": "12OmNAlvHIu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ijcbs/2009/3739/0/3739a377",
"title": "YinYang Bipolar Relativity - A Unifying Theory of Nature, Agents and Life Science",
"doi": null,
"abstractUrl": "/proceedings-article/ijcbs/2009/3739a377/12OmNBO3KcJ",
"parentPublication": {
"id": "proceedings/ijcbs/2009/3739/0",
"title": "2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2007/2928/0/29280109",
"title": "Designing a Computer Game to Teach Einstein?s Theory of Relativity",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2007/29280109/12OmNBubOSk",
"parentPublication": {
"id": "proceedings/cgiv/2007/2928/0",
"title": "Computer Graphics, Imaging and Visualisation (CGIV 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2010/4166/0/4166a035",
"title": "Visual Computer Game Features for Teaching Relativity",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2010/4166a035/12OmNCwCLuJ",
"parentPublication": {
"id": "proceedings/cgiv/2010/4166/0",
"title": "2010 Seventh International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pive/2012/1218/0/06229794",
"title": "Learning special relativity energy laws using visio-haptic illusion",
"doi": null,
"abstractUrl": "/proceedings-article/pive/2012/06229794/12OmNqJ8tiF",
"parentPublication": {
"id": "proceedings/pive/2012/1218/0",
"title": "2012 IEEE VR Workshop on Perceptual Illusions in Virtual Environments",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780051",
"title": "Real-World Relativity: Image-Based Special Relativistic Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780051/12OmNrJAdYh",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532845",
"title": "Visualization in the Einstein Year 2005: a case study on explanatory and illustrative visualization of relativity and astrophysics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532845/12OmNvlxJsW",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1990/2056/0/00130108",
"title": "Time dilation visualization in relativity",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1990/00130108/12OmNxFJXs6",
"parentPublication": {
"id": "proceedings/sc/1990/2056/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660074",
"title": "Visualization in the Einstein Year 2005: A Case Study on Explanatory and Illustrative Visualization of Relativity and Astrophysics",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660074/12OmNzTH0TG",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0522",
"title": "Explanatory and Illustrative Visualization of Special and General Relativity",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0522/13rRUwjXZS0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010061243",
"title": "Special Relativistic Visualization by Local Ray Tracing",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010061243/13rRUxjyX3U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNC17hWl",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"acronym": "infvis",
"groupId": "1000371",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBU1jJ7",
"doi": "10.1109/INFVIS.2005.1532130",
"title": "Dig-CoLa: directed graph layout through constrained energy minimization",
"normalizedTitle": "Dig-CoLa: directed graph layout through constrained energy minimization",
"abstract": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"fno": "01532130",
"keywords": [
"Data Visualisation",
"Constraint Handling",
"Computational Geometry",
"Directed Graphs",
"Minimisation",
"Dig Co La",
"Directed Graph Layout",
"Constrained Energy Minimization",
"Directed Graph Visualization",
"Constraint Programming",
"Force Directed Placement Algorithm",
"Nonhierarchical Undirected Layout Algorithm",
"Directional Multidimensional Scaling",
"Constraint Optimization",
"Electronic Mail",
"Minimization Methods",
"Computer Science",
"Software Engineering",
"Visualization",
"Multidimensional Systems",
"Chromium",
"Numerical Analysis",
"Algorithm Design And Analysis"
],
"authors": [
{
"affiliation": "Sch. of Comput. Sci. & Software Eng., Monash Univ., Australia",
"fullName": "T. Dwyer",
"givenName": "T.",
"surname": "Dwyer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Y. Koren",
"givenName": "Y.",
"surname": "Koren",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "infvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-01-01T00:00:00",
"pubType": "proceedings",
"pages": "65,66,67,68,69,70,71,72",
"year": "2005",
"issn": "1522-404X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01532129",
"articleId": "12OmNqzcvFm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01532131",
"articleId": "12OmNwDACtv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2012/4771/0/4771a124",
"title": "Force-directed Graph Visualization with Pre-positioning - Improving Convergence Time and Quality of Layout",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a124/12OmNBiygtD",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900009",
"title": "DIG-COLA: Directed Graph Layout through Constrained Energy Minimization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900009/12OmNwMXnuu",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispdc/2012/2599/0/06341510",
"title": "Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods",
"doi": null,
"abstractUrl": "/proceedings-article/ispdc/2012/06341510/12OmNx3HI8B",
"parentPublication": {
"id": "proceedings/ispdc/2012/2599/0",
"title": "2012 11th International Symposium on Parallel and Distributed Computing (ISPDC 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532130",
"title": "Dig-CoLa: directed graph layout through constrained energy minimization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532130/12OmNzTppEL",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2013/3218/0/06778637",
"title": "Trust Network Visualization Based on Force-Directed Layout",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2013/06778637/12OmNzYwc8h",
"parentPublication": {
"id": "proceedings/wisa/2013/3218/0",
"title": "2013 10th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/1988/0859/0/00005177",
"title": "Directed search minimization of multiple-valued functions",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/1988/00005177/12OmNzw8iWJ",
"parentPublication": {
"id": "proceedings/ismvl/1988/0859/0",
"title": "Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0821",
"title": "IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0821/13rRUNvyat8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0536",
"title": "Drawing Directed Graphs Using Quadratic Programming",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0536/13rRUxZRbnT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0167",
"title": "Constrained Texture Synthesis via Energy Minimization",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0167/13rRUyeCka9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10024360",
"title": "Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10024360/1KaBabqZxSg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyYm2wA",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"acronym": "apvis",
"groupId": "1001657",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqH9hkO",
"doi": "10.1109/APVIS.2007.329280",
"title": "Force-directed drawing method for intersecting clustered graphs",
"normalizedTitle": "Force-directed drawing method for intersecting clustered graphs",
"abstract": "We present a novel force-directed method for drawing an intersecting clustered graph. This is based upon simulation of a virtual physical system. The graph can express complicated structures such as inclusion and intersection between vertices/clusters as well as adjacency, and it is used in diverse fields such as creativity support, software engineering, and semantic Web. We describe definitions, aesthetics, model, algorithm, performance evaluation, and applications",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a novel force-directed method for drawing an intersecting clustered graph. This is based upon simulation of a virtual physical system. The graph can express complicated structures such as inclusion and intersection between vertices/clusters as well as adjacency, and it is used in diverse fields such as creativity support, software engineering, and semantic Web. We describe definitions, aesthetics, model, algorithm, performance evaluation, and applications",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a novel force-directed method for drawing an intersecting clustered graph. This is based upon simulation of a virtual physical system. The graph can express complicated structures such as inclusion and intersection between vertices/clusters as well as adjacency, and it is used in diverse fields such as creativity support, software engineering, and semantic Web. We describe definitions, aesthetics, model, algorithm, performance evaluation, and applications",
"fno": "04126223",
"keywords": [
"Performance Evaluation",
"Force Directed Drawing Method",
"Clustered Graphs",
"Virtual Physical System Simulation"
],
"authors": [
{
"affiliation": "Sch. of Knowledge Sci., Japan Adv. Inst. of Sci.&Technol.",
"fullName": "H. Omote",
"givenName": "H.",
"surname": "Omote",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "K. Sugiyama",
"givenName": "K.",
"surname": "Sugiyama",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "apvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-02-01T00:00:00",
"pubType": "proceedings",
"pages": "85-92",
"year": "2007",
"issn": null,
"isbn": "1-4244-0808-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04126222",
"articleId": "12OmNzUxOjw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04126224",
"articleId": "12OmNwcCILb",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/2016/8942/0/8942a069",
"title": "Drawing Clustered Graphs Using Stress Majorization and Force-Directed Placements",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2016/8942a069/12OmNrMHOnz",
"parentPublication": {
"id": "proceedings/iv/2016/8942/0",
"title": "2016 20th International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2014/4103/0/4103a013",
"title": "Drawing Large Weighted Graphs Using Clustered Force-Directed Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2014/4103a013/12OmNro0I3Y",
"parentPublication": {
"id": "proceedings/iv/2014/4103/0",
"title": "2014 18th International Conference on Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126218",
"title": "Efficiently drawing a significant spanning tree of a directed graph",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126218/12OmNvA1hwj",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a038",
"title": "Visualization of Clustered Directed Acyclic Graphs without Node Overlapping",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a038/12OmNvsDHHu",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2012/4771/0/4771a454",
"title": "A Multilevel Force-directed Graph Drawing Algorithm Using Multilevel Global Force Approximation",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2012/4771a454/12OmNy2Jt2D",
"parentPublication": {
"id": "proceedings/iv/2012/4771/0",
"title": "2012 16th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126219",
"title": "Directed graphs and rectangular layouts",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126219/12OmNy3RRw8",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2004/8779/0/87790191",
"title": "Dynamic Drawing of Clustered Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2004/87790191/12OmNyugyVo",
"parentPublication": {
"id": "proceedings/ieee-infovis/2004/8779/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/01/ttg2012010081",
"title": "Graph Drawing Aesthetics—Created by Users, Not Algorithms",
"doi": null,
"abstractUrl": "/journal/tg/2012/01/ttg2012010081/13rRUwInvB2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/01/v0046",
"title": "Combining Hierarchy and Energy Drawing Directed Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2004/01/v0046/13rRUwgQpDf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0536",
"title": "Drawing Directed Graphs Using Quadratic Programming",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0536/13rRUxZRbnT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyYm2wA",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"acronym": "apvis",
"groupId": "1001657",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvA1hwj",
"doi": "10.1109/APVIS.2007.329275",
"title": "Efficiently drawing a significant spanning tree of a directed graph",
"normalizedTitle": "Efficiently drawing a significant spanning tree of a directed graph",
"abstract": "A directed graph can model any ordered relationship between objects. However, visualizing such graphs can be a challenging task. If the graph is undirected, a popular strategy is to choose a significant spanning tree, nominate a vertex as the root, for example the vertex whose distance from all other vertices is minimal, hang the significant spanning subtrees from this root and add in the remaining edges in some unobtrusive manner. In the directed case the spanning tree is a tree DAG (a directed graph without any undirected cycles) and not simply a directed tree with one appropriate root. It may have multiple sources (vertices with indegree equal to zero) that all warrant root status and so the undirected approach must be modified somewhat. In this paper, we present a method of drawing directed graphs that emphasizes a significant spanning tree. It can be considered a variation of the Sugiyama framework in that it combines two steps of the framework (leveling and crossing minimisation) by finding, in linear time, a leveling of the graph that is level planar with respect to some spanning tree and restricting the permutations of the vertices on each level to those that constitute a level planar embedding of this subgraph. The edges of the spanning tree will therefore not cross each other. Using the globally oriented Fiedler vector we choose permutations of the vertices on each level that reduce the number of crossings between the remaining edges",
"abstracts": [
{
"abstractType": "Regular",
"content": "A directed graph can model any ordered relationship between objects. However, visualizing such graphs can be a challenging task. If the graph is undirected, a popular strategy is to choose a significant spanning tree, nominate a vertex as the root, for example the vertex whose distance from all other vertices is minimal, hang the significant spanning subtrees from this root and add in the remaining edges in some unobtrusive manner. In the directed case the spanning tree is a tree DAG (a directed graph without any undirected cycles) and not simply a directed tree with one appropriate root. It may have multiple sources (vertices with indegree equal to zero) that all warrant root status and so the undirected approach must be modified somewhat. In this paper, we present a method of drawing directed graphs that emphasizes a significant spanning tree. It can be considered a variation of the Sugiyama framework in that it combines two steps of the framework (leveling and crossing minimisation) by finding, in linear time, a leveling of the graph that is level planar with respect to some spanning tree and restricting the permutations of the vertices on each level to those that constitute a level planar embedding of this subgraph. The edges of the spanning tree will therefore not cross each other. Using the globally oriented Fiedler vector we choose permutations of the vertices on each level that reduce the number of crossings between the remaining edges",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A directed graph can model any ordered relationship between objects. However, visualizing such graphs can be a challenging task. If the graph is undirected, a popular strategy is to choose a significant spanning tree, nominate a vertex as the root, for example the vertex whose distance from all other vertices is minimal, hang the significant spanning subtrees from this root and add in the remaining edges in some unobtrusive manner. In the directed case the spanning tree is a tree DAG (a directed graph without any undirected cycles) and not simply a directed tree with one appropriate root. It may have multiple sources (vertices with indegree equal to zero) that all warrant root status and so the undirected approach must be modified somewhat. In this paper, we present a method of drawing directed graphs that emphasizes a significant spanning tree. It can be considered a variation of the Sugiyama framework in that it combines two steps of the framework (leveling and crossing minimisation) by finding, in linear time, a leveling of the graph that is level planar with respect to some spanning tree and restricting the permutations of the vertices on each level to those that constitute a level planar embedding of this subgraph. The edges of the spanning tree will therefore not cross each other. Using the globally oriented Fiedler vector we choose permutations of the vertices on each level that reduce the number of crossings between the remaining edges",
"fno": "04126218",
"keywords": [
"Crossing Minimisation",
"Spanning Tree Drawing",
"Directed Graph Visualization",
"Globally Oriented Fiedler Vector"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci.&Inf. Syst., Limerick Univ.",
"fullName": "M. Harrigan",
"givenName": "M.",
"surname": "Harrigan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci.&Inf. Syst., Limerick Univ.",
"fullName": "P. Healy",
"givenName": "P.",
"surname": "Healy",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "apvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-02-01T00:00:00",
"pubType": "proceedings",
"pages": "53-59",
"year": "2007",
"issn": null,
"isbn": "1-4244-0808-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04126217",
"articleId": "12OmNAYoKou",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04126219",
"articleId": "12OmNy3RRw8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/compsac/2017/0367/2/0367b372",
"title": "Finding All Breadth First Full Spanning Trees in a Directed Graph",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2017/0367b372/12OmNB8TUaK",
"parentPublication": {
"id": "compsac/2017/0367/2",
"title": "2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1997/8197/0/81970536",
"title": "Improved approximations for shallow-light spanning trees",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1997/81970536/12OmNBKmXdQ",
"parentPublication": {
"id": "proceedings/focs/1997/8197/0",
"title": "Proceedings 38th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1989/1982/0/063516",
"title": "Generating random spanning trees",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1989/063516/12OmNBr4eFc",
"parentPublication": {
"id": "proceedings/focs/1989/1982/0",
"title": "30th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paap/2011/4575/0/4575a052",
"title": "An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes",
"doi": null,
"abstractUrl": "/proceedings-article/paap/2011/4575a052/12OmNCfjeEw",
"parentPublication": {
"id": "proceedings/paap/2011/4575/0",
"title": "Parallel Architectures, Algorithms and Programming, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apvis/2007/0808/0/04126223",
"title": "Force-directed drawing method for intersecting clustered graphs",
"doi": null,
"abstractUrl": "/proceedings-article/apvis/2007/04126223/12OmNqH9hkO",
"parentPublication": {
"id": "proceedings/apvis/2007/0808/0",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2004/2197/0/21970448",
"title": "The Euler Tour Technique and Parallel Rooted Spanning Tree",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2004/21970448/12OmNvAiSMo",
"parentPublication": {
"id": "proceedings/icpp/2004/2197/0",
"title": "International Conference on Parallel Processing, 2004. ICPP 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1996/7594/0/75940302",
"title": "A 3-approximation for the minimum tree spanning k vertices",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1996/75940302/12OmNvT2pi2",
"parentPublication": {
"id": "proceedings/focs/1996/7594/0",
"title": "Proceedings of 37th Conference on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2011/4571/0/4571a373",
"title": "Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2011/4571a373/12OmNviHKj7",
"parentPublication": {
"id": "proceedings/focs/2011/4571/0",
"title": "2011 IEEE 52nd Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aciids/2009/3580/0/3580a283",
"title": "New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem",
"doi": null,
"abstractUrl": "/proceedings-article/aciids/2009/3580a283/12OmNxAlAc6",
"parentPublication": {
"id": "proceedings/aciids/2009/3580/0",
"title": "Intelligent Information and Database Systems, Asian Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icit/2008/3513/0/3513a009",
"title": "A New Heuristic for the Minimum Routing Cost Spanning Tree Problem",
"doi": null,
"abstractUrl": "/proceedings-article/icit/2008/3513a009/12OmNz61dnI",
"parentPublication": {
"id": "proceedings/icit/2008/3513/0",
"title": "2008 International Conference on Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxH9X7w",
"title": "Information Visualization, IEEE Symposium on",
"acronym": "ieee-infovis",
"groupId": "1000371",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwMXnuu",
"doi": "10.1109/INFOVIS.2005.10",
"title": "DIG-COLA: Directed Graph Layout through Constrained Energy Minimization",
"normalizedTitle": "DIG-COLA: Directed Graph Layout through Constrained Energy Minimization",
"abstract": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force-directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP -such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identi- fies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a non-hierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low-dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force-directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP -such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identi- fies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a non-hierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low-dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force-directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP -such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identi- fies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a non-hierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low-dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"fno": "27900009",
"keywords": [],
"authors": [
{
"affiliation": "Monash University",
"fullName": "Tim Dwyer",
"givenName": "Tim",
"surname": "Dwyer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "AT& T Labs Research",
"fullName": "Yehuda Koren",
"givenName": "Yehuda",
"surname": "Koren",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-infovis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-10-01T00:00:00",
"pubType": "proceedings",
"pages": "9",
"year": "2005",
"issn": "1522-404x",
"isbn": "0-7803-9464-x",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01532145",
"articleId": "12OmNy6ZrZZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01532146",
"articleId": "12OmNAkWvOr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/date/2005/2288/2/228820902",
"title": "An Improved Multi-Level Framework for Force-Directed Placement",
"doi": null,
"abstractUrl": "/proceedings-article/date/2005/228820902/12OmNAqkSHJ",
"parentPublication": {
"id": "proceedings/date/2005/2288/2",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pact/2010/0178/0/07851516",
"title": "Feedback-directed pipeline parallelism",
"doi": null,
"abstractUrl": "/proceedings-article/pact/2010/07851516/12OmNB0X8ul",
"parentPublication": {
"id": "proceedings/pact/2010/0178/0",
"title": "2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infvis/2005/9464/0/01532130",
"title": "Dig-CoLa: directed graph layout through constrained energy minimization",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532130/12OmNBU1jJ7",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispdc/2012/2599/0/06341510",
"title": "Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods",
"doi": null,
"abstractUrl": "/proceedings-article/ispdc/2012/06341510/12OmNx3HI8B",
"parentPublication": {
"id": "proceedings/ispdc/2012/2599/0",
"title": "2012 11th International Symposium on Parallel and Distributed Computing (ISPDC 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532130",
"title": "Dig-CoLa: directed graph layout through constrained energy minimization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532130/12OmNzTppEL",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2013/3218/0/06778637",
"title": "Trust Network Visualization Based on Force-Directed Layout",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2013/06778637/12OmNzYwc8h",
"parentPublication": {
"id": "proceedings/wisa/2013/3218/0",
"title": "2013 10th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0821",
"title": "IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0821/13rRUNvyat8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0536",
"title": "Drawing Directed Graphs Using Quadratic Programming",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0536/13rRUxZRbnT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10024360",
"title": "Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10024360/1KaBabqZxSg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispass/2021/8643/0/864300a172",
"title": "Re-establishing Fetch-Directed Instruction Prefetching: An Industry Perspective",
"doi": null,
"abstractUrl": "/proceedings-article/ispass/2021/864300a172/1taFixHBFNm",
"parentPublication": {
"id": "proceedings/ispass/2021/8643/0",
"title": "2021 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyYm2wA",
"title": "Asia-Pacific Symposium on Visualisation 2007",
"acronym": "apvis",
"groupId": "1001657",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy3RRw8",
"doi": "10.1109/APVIS.2007.329276",
"title": "Directed graphs and rectangular layouts",
"normalizedTitle": "Directed graphs and rectangular layouts",
"abstract": "This paper deals with the problem, arising in practice, of drawing a directed graph as a collection of disjoint, isothetic rectangles, where the rectangles of the nodes of each edge must touch and where the placement of the rectangles respects the ordering of the edges. It provides characterizations for those graphs having the special type of rectangular layout known as a rectangular dual. It then characterizes the st-graphs having rectangular layouts in terms of the existence of certain planar embeddings and the non-existence of a particular subgraph",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper deals with the problem, arising in practice, of drawing a directed graph as a collection of disjoint, isothetic rectangles, where the rectangles of the nodes of each edge must touch and where the placement of the rectangles respects the ordering of the edges. It provides characterizations for those graphs having the special type of rectangular layout known as a rectangular dual. It then characterizes the st-graphs having rectangular layouts in terms of the existence of certain planar embeddings and the non-existence of a particular subgraph",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper deals with the problem, arising in practice, of drawing a directed graph as a collection of disjoint, isothetic rectangles, where the rectangles of the nodes of each edge must touch and where the placement of the rectangles respects the ordering of the edges. It provides characterizations for those graphs having the special type of rectangular layout known as a rectangular dual. It then characterizes the st-graphs having rectangular layouts in terms of the existence of certain planar embeddings and the non-existence of a particular subgraph",
"fno": "04126219",
"keywords": [
"Subgraph",
"Directed Graph Drawing",
"Rectangular Layouts",
"Rectangular Dual",
"St Graphs",
"Planar Embeddings"
],
"authors": [
{
"affiliation": "AT&T Labs.-Res.",
"fullName": "A.L. Buchsbaum",
"givenName": "A.L.",
"surname": "Buchsbaum",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "AT&T Labs.-Res.",
"fullName": "E.R. Gansner",
"givenName": "E.R.",
"surname": "Gansner",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "AT&T Labs.-Res.",
"fullName": "S. Venkatasubramanian",
"givenName": "S.",
"surname": "Venkatasubramanian",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "apvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-02-01T00:00:00",
"pubType": "proceedings",
"pages": "61-64",
"year": "2007",
"issn": null,
"isbn": "1-4244-0808-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04126218",
"articleId": "12OmNvA1hwj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04126220",
"articleId": "12OmNBlFR2L",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ipps/1994/5602/0/0288225",
"title": "A new combinatorial approach to optimal embeddings of rectangles",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1994/0288225/12OmNBRsVxa",
"parentPublication": {
"id": "proceedings/ipps/1994/5602/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1988/0864/0/00014832",
"title": "Automatic building of graphs for rectangular dualisation (IC floorplanning)",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1988/00014832/12OmNC0PGMm",
"parentPublication": {
"id": "proceedings/dac/1988/0864/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2011/4455/0/4455b301",
"title": "The MultiAgent Stress Analysis and Design of Rectangular Tube Forming",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2011/4455b301/12OmNvAS4rt",
"parentPublication": {
"id": "proceedings/icdma/2011/4455/0",
"title": "2011 Second International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1995/7183/0/71830453",
"title": "Computing simulations on finite and infinite graphs",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1995/71830453/12OmNvAiSBC",
"parentPublication": {
"id": "proceedings/focs/1995/7183/0",
"title": "Proceedings of IEEE 36th Annual Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730099",
"title": "G^1 Connection Between Rectangular Bezier Patches and Multisided Bezier Patch",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730099/12OmNwCJOOR",
"parentPublication": {
"id": "proceedings/cad-cg/2005/2473/0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2010/4047/3/4047c103",
"title": "On Interpolation by bivariate cubic splines on a rectangular unit with C^2-continuity",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2010/4047c103/12OmNx3q6Ww",
"parentPublication": {
"id": "proceedings/icic/2010/4047/3",
"title": "2010 Third International Conference on Information and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2012/4874/0/4874a514",
"title": "Faster Algorithms for Rectangular Matrix Multiplication",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2012/4874a514/12OmNzVXNJt",
"parentPublication": {
"id": "proceedings/focs/2012/4874/0",
"title": "2012 IEEE 53rd Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/1978/9999/0/01585160",
"title": "Representation and Generation of Rectangular Dissections",
"doi": null,
"abstractUrl": "/proceedings-article/dac/1978/01585160/12OmNzyp5Vj",
"parentPublication": {
"id": "proceedings/dac/1978/9999/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/06/ttg2010060990",
"title": "Perceptual Guidelines for Creating Rectangular Treemaps",
"doi": null,
"abstractUrl": "/journal/tg/2010/06/ttg2010060990/13rRUx0gezT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1982/09/01676109",
"title": "On Embedding Rectangular Grids in Square Grids",
"doi": null,
"abstractUrl": "/journal/tc/1982/09/01676109/13rRUx0xPHs",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxH9X7w",
"title": "Information Visualization, IEEE Symposium on",
"acronym": "ieee-infovis",
"groupId": "1000371",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzTppEL",
"doi": "10.1109/INFVIS.2005.1532130",
"title": "Dig-CoLa: directed graph layout through constrained energy minimization",
"normalizedTitle": "Dig-CoLa: directed graph layout through constrained energy minimization",
"abstract": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",
"fno": "01532130",
"keywords": [
"Data Visualisation",
"Constraint Handling",
"Computational Geometry",
"Directed Graphs",
"Minimisation",
"Dig Co La",
"Directed Graph Layout",
"Constrained Energy Minimization",
"Directed Graph Visualization",
"Constraint Programming",
"Force Directed Placement Algorithm",
"Nonhierarchical Undirected Layout Algorithm",
"Directional Multidimensional Scaling",
"Constraint Optimization",
"Electronic Mail",
"Minimization Methods",
"Computer Science",
"Software Engineering",
"Visualization",
"Multidimensional Systems",
"Chromium",
"Numerical Analysis",
"Algorithm Design And Analysis"
],
"authors": [
{
"affiliation": "Sch. of Comput. Sci. & Software Eng., Monash Univ., Australia",
"fullName": "T. Dwyer",
"givenName": "T.",
"surname": "Dwyer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Y. Koren",
"givenName": "Y.",
"surname": "Koren",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-infovis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-01-01T00:00:00",
"pubType": "proceedings",
"pages": "65,66,67,68,69,70,71,72",
"year": "2005",
"issn": "1522-404X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01532129",
"articleId": "12OmNzYwcax",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01532131",
"articleId": "12OmNwtn3ww",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/infvis/2005/9464/0/01532130",
"title": "Dig-CoLa: directed graph layout through constrained energy minimization",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532130/12OmNBU1jJ7",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900009",
"title": "DIG-COLA: Directed Graph Layout through Constrained Energy Minimization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900009/12OmNwMXnuu",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispdc/2012/2599/0/06341510",
"title": "Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods",
"doi": null,
"abstractUrl": "/proceedings-article/ispdc/2012/06341510/12OmNx3HI8B",
"parentPublication": {
"id": "proceedings/ispdc/2012/2599/0",
"title": "2012 11th International Symposium on Parallel and Distributed Computing (ISPDC 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ciis/2017/3886/0/3886a116",
"title": "Research on Application of Artificial Intelligence Algorithm in Directed Graph",
"doi": null,
"abstractUrl": "/proceedings-article/ciis/2017/3886a116/12OmNzJbQZ8",
"parentPublication": {
"id": "proceedings/ciis/2017/3886/0",
"title": "2017 International Conference on Computing Intelligence and Information System (CIIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2013/3218/0/06778637",
"title": "Trust Network Visualization Based on Force-Directed Layout",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2013/06778637/12OmNzYwc8h",
"parentPublication": {
"id": "proceedings/wisa/2013/3218/0",
"title": "2013 10th Web Information System and Application Conference (WISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/1988/0859/0/00005177",
"title": "Directed search minimization of multiple-valued functions",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/1988/00005177/12OmNzw8iWJ",
"parentPublication": {
"id": "proceedings/ismvl/1988/0859/0",
"title": "Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v0821",
"title": "IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v0821/13rRUNvyat8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0536",
"title": "Drawing Directed Graphs Using Quadratic Programming",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0536/13rRUxZRbnT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0167",
"title": "Constrained Texture Synthesis via Energy Minimization",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0167/13rRUyeCka9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10024360",
"title": "Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10024360/1KaBabqZxSg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwDAC3U",
"title": "International Conference on Advances in Computer-Human Interaction",
"acronym": "achi",
"groupId": "1001548",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrkBwHL",
"doi": "10.1109/ACHI.2009.51",
"title": "Understanding Social Robots",
"normalizedTitle": "Understanding Social Robots",
"abstract": "Research on social robots is mainly comprised of research into algorithmic problems in order to expand a robot´s capabilities to improve communication with human beings. Also, a large body of research concentrates on the appearance, i.e. aesthetic form of social robots. However, only little reference to their definition is made. In this paper we argue that form, function, and context have to be taken systematically into account in order to develop a model to help us understand social robots. Therefore, we address the questions: What is a social robot, what are the interdisciplinary research aspects of social robotics, and how are these different aspects interlinked? In order to present a comprehensive and concise overview of the various aspects we present a framework for a definition towards social robots.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Research on social robots is mainly comprised of research into algorithmic problems in order to expand a robot´s capabilities to improve communication with human beings. Also, a large body of research concentrates on the appearance, i.e. aesthetic form of social robots. However, only little reference to their definition is made. In this paper we argue that form, function, and context have to be taken systematically into account in order to develop a model to help us understand social robots. Therefore, we address the questions: What is a social robot, what are the interdisciplinary research aspects of social robotics, and how are these different aspects interlinked? In order to present a comprehensive and concise overview of the various aspects we present a framework for a definition towards social robots.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Research on social robots is mainly comprised of research into algorithmic problems in order to expand a robot´s capabilities to improve communication with human beings. Also, a large body of research concentrates on the appearance, i.e. aesthetic form of social robots. However, only little reference to their definition is made. In this paper we argue that form, function, and context have to be taken systematically into account in order to develop a model to help us understand social robots. Therefore, we address the questions: What is a social robot, what are the interdisciplinary research aspects of social robotics, and how are these different aspects interlinked? In order to present a comprehensive and concise overview of the various aspects we present a framework for a definition towards social robots.",
"fno": "3529a169",
"keywords": [
"Social Robots",
"Human Robot Interaction",
"Design",
"Anthropomorphism"
],
"authors": [
{
"affiliation": null,
"fullName": "Frank Hegel",
"givenName": "Frank",
"surname": "Hegel",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Claudia Muhl",
"givenName": "Claudia",
"surname": "Muhl",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Britta Wrede",
"givenName": "Britta",
"surname": "Wrede",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Martina Hielscher-Fastabend",
"givenName": "Martina",
"surname": "Hielscher-Fastabend",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Gerhard Sagerer",
"givenName": "Gerhard",
"surname": "Sagerer",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "achi",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-02-01T00:00:00",
"pubType": "proceedings",
"pages": "169-174",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3529-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3529a271",
"articleId": "12OmNAWpysd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3529a181",
"articleId": "12OmNrJAegF",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/acii/2009/4800/0/05349423",
"title": "Empathizing with robots: Fellow feeling along the anthropomorphic spectrum",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2009/05349423/12OmNBOCWur",
"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/vlhcc/2014/4035/0/06883046",
"title": "Tools for programming human robot interaction",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2014/06883046/12OmNC0guAO",
"parentPublication": {
"id": "proceedings/vlhcc/2014/4035/0",
"title": "2014 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/culture-computing/2015/8232/0/8232a195",
"title": "Gender Stereotypes in Cultures: Experimental Investigation of a Possibility of Reproduction by Robots in Japan",
"doi": null,
"abstractUrl": "/proceedings-article/culture-computing/2015/8232a195/12OmNCdk2MG",
"parentPublication": {
"id": "proceedings/culture-computing/2015/8232/0",
"title": "2015 International Conference on Culture and Computing (Culture Computing)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccairo/2017/6536/0/6536a069",
"title": "Body Self-Awareness for Social Robots",
"doi": null,
"abstractUrl": "/proceedings-article/iccairo/2017/6536a069/12OmNqAU6oC",
"parentPublication": {
"id": "proceedings/iccairo/2017/6536/0",
"title": "2017 International Conference on Control, Artificial Intelligence, Robotics & Optimization (ICCAIRO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2010/4040/0/4040a159",
"title": "Selecting and Commanding Individual Robots in a Multi-Robot System",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2010/4040a159/12OmNs0TKHw",
"parentPublication": {
"id": "proceedings/crv/2010/4040/0",
"title": "2010 Canadian Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2011/4513/3/4513c066",
"title": "Relationships between Robot's Self-Disclosures and Human's Anxiety toward Robots",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2011/4513c066/12OmNvkpkTX",
"parentPublication": {
"id": "proceedings/wi-iat/2011/4513/3",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2009/3728/0/3728a220",
"title": "Empathy between Human and Home Service Robots",
"doi": null,
"abstractUrl": "/proceedings-article/case/2009/3728a220/12OmNyk2ZZM",
"parentPublication": {
"id": "proceedings/case/2009/3728/0",
"title": "2009 IITA International Conference on Control, Automation and Systems Engineering, CASE 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2016/07/mco2016070020",
"title": "Graphical Instruction for Home Robots",
"doi": null,
"abstractUrl": "/magazine/co/2016/07/mco2016070020/13rRUEgs2wP",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcrait/2022/8192/0/819200a068",
"title": "Fat or thin? A study on the influence of body type of service robots on human-robot interaction willingness",
"doi": null,
"abstractUrl": "/proceedings-article/gcrait/2022/819200a068/1HcnuUAbk7m",
"parentPublication": {
"id": "proceedings/gcrait/2022/8192/0",
"title": "2022 Global Conference on Robotics, Artificial Intelligence and Information Technology (GCRAIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apwc-on-cse/2018/1390/0/139000a032",
"title": "Lexical Entrainment in Interaction with Two Robots",
"doi": null,
"abstractUrl": "/proceedings-article/apwc-on-cse/2018/139000a032/1dPoMQXl6mc",
"parentPublication": {
"id": "proceedings/apwc-on-cse/2018/1390/0",
"title": "2018 5th Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxH9X7w",
"title": "Information Visualization, IEEE Symposium on",
"acronym": "ieee-infovis",
"groupId": "1000371",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxWuig6",
"doi": "10.1109/INFOVIS.2005.7",
"title": "Baby Names, Visualization, and Social Data Analysis",
"normalizedTitle": "Baby Names, Visualization, and Social Data Analysis",
"abstract": "The NameVoyager, a web-based visualization of historical trends in baby naming, has proven remarkably popular. This paper discusses the interaction techniques it uses for smooth visual exploration of thousands of time series. We also describe design decisions behind the application and lessons learned in creating an application that makes do-it-yourself data mining popular. The prime lesson, it is hypothesized, is that an information visualization tool may be fruitfully viewed not as a tool but as part of an online social environment. In other words, to design a successful exploratory data analysis tool, one good strategy is to create a system that enables \"social\" data analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The NameVoyager, a web-based visualization of historical trends in baby naming, has proven remarkably popular. This paper discusses the interaction techniques it uses for smooth visual exploration of thousands of time series. We also describe design decisions behind the application and lessons learned in creating an application that makes do-it-yourself data mining popular. The prime lesson, it is hypothesized, is that an information visualization tool may be fruitfully viewed not as a tool but as part of an online social environment. In other words, to design a successful exploratory data analysis tool, one good strategy is to create a system that enables \"social\" data analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The NameVoyager, a web-based visualization of historical trends in baby naming, has proven remarkably popular. This paper discusses the interaction techniques it uses for smooth visual exploration of thousands of time series. We also describe design decisions behind the application and lessons learned in creating an application that makes do-it-yourself data mining popular. The prime lesson, it is hypothesized, is that an information visualization tool may be fruitfully viewed not as a tool but as part of an online social environment. In other words, to design a successful exploratory data analysis tool, one good strategy is to create a system that enables \"social\" data analysis.",
"fno": "27900001",
"keywords": [],
"authors": [
{
"affiliation": "IBM Research",
"fullName": "Martin Wattenberg",
"givenName": "Martin",
"surname": "Wattenberg",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-infovis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1",
"year": "2005",
"issn": "1522-404x",
"isbn": "0-7803-9464-x",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01532136",
"articleId": "12OmNB836Ly",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01532138",
"articleId": "12OmNzcxZaC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/csmr/2003/1902/0/19020409",
"title": "CodeCrawler - Lessons Learned in Building a Software Visualization Tool",
"doi": null,
"abstractUrl": "/proceedings-article/csmr/2003/19020409/12OmNB06l7v",
"parentPublication": {
"id": "proceedings/csmr/2003/1902/0",
"title": "Seventh European Conference onSoftware Maintenance and Reengineering, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccompanion/2012/4956/0/4956a206",
"title": "The SDAV Software Frameworks for Visualization and Analysis on Next-Generation Multi-Core and Many-Core Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956a206/12OmNBBzoks",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infvis/2005/9464/0/01532122",
"title": "Baby names, visualization, and social data analysis",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532122/12OmNCyBXhq",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/scc/2012/6218/0/06495818",
"title": "The SDAV Software Frameworks for Visualization and Analysis on Next-Generation Multi-Core and Many-Core Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/scc/2012/06495818/12OmNqN6R06",
"parentPublication": {
"id": "proceedings/scc/2012/6218/0",
"title": "2012 SC Companion: High Performance Computing, Networking, Storage and Analysis (SCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/enc/2013/5087/0/5087a060",
"title": "A Context-Aware Baby Monitor for the Automatic Selective Archiving of the Language of Infants",
"doi": null,
"abstractUrl": "/proceedings-article/enc/2013/5087a060/12OmNy1SFGP",
"parentPublication": {
"id": "proceedings/enc/2013/5087/0",
"title": "2013 Mexican International Conference on Computer Science (ENC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532122",
"title": "Baby names, visualization, and social data analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532122/12OmNyY4rl8",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2012/4702/0/4702a565",
"title": "The Impact of Social Performance Visualization on Students",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2012/4702a565/12OmNz5s0NO",
"parentPublication": {
"id": "proceedings/icalt/2012/4702/0",
"title": "Advanced Learning Technologies, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/alpit/2007/2930/0/2930a315",
"title": "Implementation of Baby Ocular Inspection System Using Face Color Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/alpit/2007/2930a315/12OmNzvz6Kh",
"parentPublication": {
"id": "proceedings/alpit/2007/2930/0",
"title": "Advanced Language Processing and Web Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0549",
"title": "Designing for Social Data Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0549/13rRUwjoNwR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2018/6614/0/661400b129",
"title": "Research on Smart Baby Stroller Based on Analysis of Infant Life Style",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2018/661400b129/183rAfXXsgU",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2018/6614/0",
"title": "2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwE9OtE",
"title": "2013 International Conference on Cloud and Green Computing (CGC)",
"acronym": "cgc",
"groupId": "1802057",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxzuMQW",
"doi": "10.1109/CGC.2013.67",
"title": "A Web-Based Tool for Collaborative Social Media Data Analysis",
"normalizedTitle": "A Web-Based Tool for Collaborative Social Media Data Analysis",
"abstract": "User-generated content on social media sites such as Twitter and Facebook provides opportunity for researchers in various fields to understand human behaviors and social phenomena. On the one hand, these human behaviors and social phenomena are very complex in nature thus require in-depth qualitative analysis. On the other, the magnitude of social media data requires large-scale data analysis techniques. In this paper, we propose a web-based tool named SWAB (Social Web Analysis Buddy) that integrates both qualitative analysis and large-scale data mining techniques. Specifically, this tool supports asynchronous collaboration among researchers conducting inductive content analysis on textural data from users' online posts and conversations. It then aggregates the results and calculates the agreement among researchers, and builds modeling algorithms based on the qualitative results to classify large-scale social media text content. This current paper focuses on the overall workflow and user interface design of this tool. We demonstrate the prototype of this tool by analyzing student-posted content on Twitter.",
"abstracts": [
{
"abstractType": "Regular",
"content": "User-generated content on social media sites such as Twitter and Facebook provides opportunity for researchers in various fields to understand human behaviors and social phenomena. On the one hand, these human behaviors and social phenomena are very complex in nature thus require in-depth qualitative analysis. On the other, the magnitude of social media data requires large-scale data analysis techniques. In this paper, we propose a web-based tool named SWAB (Social Web Analysis Buddy) that integrates both qualitative analysis and large-scale data mining techniques. Specifically, this tool supports asynchronous collaboration among researchers conducting inductive content analysis on textural data from users' online posts and conversations. It then aggregates the results and calculates the agreement among researchers, and builds modeling algorithms based on the qualitative results to classify large-scale social media text content. This current paper focuses on the overall workflow and user interface design of this tool. We demonstrate the prototype of this tool by analyzing student-posted content on Twitter.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "User-generated content on social media sites such as Twitter and Facebook provides opportunity for researchers in various fields to understand human behaviors and social phenomena. On the one hand, these human behaviors and social phenomena are very complex in nature thus require in-depth qualitative analysis. On the other, the magnitude of social media data requires large-scale data analysis techniques. In this paper, we propose a web-based tool named SWAB (Social Web Analysis Buddy) that integrates both qualitative analysis and large-scale data mining techniques. Specifically, this tool supports asynchronous collaboration among researchers conducting inductive content analysis on textural data from users' online posts and conversations. It then aggregates the results and calculates the agreement among researchers, and builds modeling algorithms based on the qualitative results to classify large-scale social media text content. This current paper focuses on the overall workflow and user interface design of this tool. We demonstrate the prototype of this tool by analyzing student-posted content on Twitter.",
"fno": "5114a383",
"keywords": [
"Media",
"Twitter",
"Data Analysis",
"Servers",
"Collaboration",
"User Interfaces",
"Databases",
"Human Computer Interaction",
"Social Media Analytics",
"Textual Content Analysis",
"Text Mining"
],
"authors": [
{
"affiliation": "Sch. of Eng. Educ., Purdue Univ., West Lafayette, IN, USA",
"fullName": "Xin Chen",
"givenName": null,
"surname": "Xin Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Sch. of Eng. Educ., Purdue Univ., West Lafayette, IN, USA",
"fullName": "Krishna Madhavan",
"givenName": "Krishna",
"surname": "Madhavan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Comput. Graphics Technol., Technol. Leadership & Innovation, Purdue Univ., West Lafayette, IN, USA",
"fullName": "Mihaela Vorvoreanu",
"givenName": "Mihaela",
"surname": "Vorvoreanu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cgc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-09-01T00:00:00",
"pubType": "proceedings",
"pages": "383-388",
"year": "2013",
"issn": null,
"isbn": "978-0-7695-5114-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "5114a377",
"articleId": "12OmNBOll4w",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "5114a389",
"articleId": "12OmNro0Ig3",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iiai-aai/2012/2719/0/06337195",
"title": "A Web Agent Based on Exploratory Event Mining in Social Media",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2012/06337195/12OmNB7LvBk",
"parentPublication": {
"id": "proceedings/iiai-aai/2012/2719/0",
"title": "2012 IIAI International Conference on Advanced Applied Informatics (IIAIAAI 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2016/4320/0/07945816",
"title": "Validating social media data for automatic persona generation",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945816/12OmNrYlmVx",
"parentPublication": {
"id": "proceedings/aiccsa/2016/4320/0",
"title": "2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mdm/2016/0883/1/0883a142",
"title": "Collaborative Co-clustering across Multiple Social Media",
"doi": null,
"abstractUrl": "/proceedings-article/mdm/2016/0883a142/12OmNwbukbt",
"parentPublication": {
"id": "proceedings/mdm/2016/0883/1",
"title": "2016 17th IEEE International Conference on Mobile Data Management (MDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chase/2012/1823/0/06223009",
"title": "Augmenting social awareness in a collaborative development environment",
"doi": null,
"abstractUrl": "/proceedings-article/chase/2012/06223009/12OmNxcMScQ",
"parentPublication": {
"id": "proceedings/chase/2012/1823/0",
"title": "2012 5th International Workshop on Cooperative and Human Aspects of Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2016/5670/0/5670b871",
"title": "A Critical Reflection on Social Media Research Using an Autoethnographic Approach",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670b871/12OmNyxFKgj",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ficloud/2014/4357/0/4357a541",
"title": "A Cloud-Based Tool for Brand Monitoring in Social Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ficloud/2014/4357a541/12OmNzcxYXL",
"parentPublication": {
"id": "proceedings/ficloud/2014/4357/0",
"title": "2014 2nd International Conference on Future Internet of Things and Cloud (FiCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cts/2016/2300/0/07871041",
"title": "The Role of Social Media in National Discourse and Mobilization of Citizens",
"doi": null,
"abstractUrl": "/proceedings-article/cts/2016/07871041/12OmNzsJ7BU",
"parentPublication": {
"id": "proceedings/cts/2016/2300/0",
"title": "2016 International Conference on Collaboration Technologies and Systems (CTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cedem/2016/1042/0/07781913",
"title": "Social Media Activism in Post-Euromaidan Ukrainian Politics and Civil Society",
"doi": null,
"abstractUrl": "/proceedings-article/cedem/2016/07781913/12OmNzsrwjd",
"parentPublication": {
"id": "proceedings/cedem/2016/1042/0",
"title": "2016 Conference for E-Democracy and Open Government (CeDEM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2014/03/06697807",
"title": "Mining Social Media Data for Understanding Students’ Learning Experiences",
"doi": null,
"abstractUrl": "/journal/lt/2014/03/06697807/13rRUwgyOcH",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2019/1547/0/154700a370",
"title": "Global Science Discussed in Local Social Media: WeChat and its Comparison with Web of Science",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2019/154700a370/1ckrDseUFz2",
"parentPublication": {
"id": "proceedings/jcdl/2019/1547/0",
"title": "2019 ACM/IEEE Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxH9X7w",
"title": "Information Visualization, IEEE Symposium on",
"acronym": "ieee-infovis",
"groupId": "1000371",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyY4rl8",
"doi": "10.1109/INFVIS.2005.1532122",
"title": "Baby names, visualization, and social data analysis",
"normalizedTitle": "Baby names, visualization, and social data analysis",
"abstract": "The Name Voyager, a Web based visualization of historical trends in baby naming, has proven remarkably popular. This paper discusses the interaction techniques it uses for smooth visual exploration of thousands of time series. We also describe design decisions behind the application and lessons learned in creating an application that makes do-it-yourself data mining popular. The prime lesson, it is hypothesized, is that an information visualization tool may be fruitfully viewed not as a tool but as part of an online social environment. In other words, to design a successful exploratory data analysis tool, one good strategy is to create a system that enables \"social\" data analysis",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Name Voyager, a Web based visualization of historical trends in baby naming, has proven remarkably popular. This paper discusses the interaction techniques it uses for smooth visual exploration of thousands of time series. We also describe design decisions behind the application and lessons learned in creating an application that makes do-it-yourself data mining popular. The prime lesson, it is hypothesized, is that an information visualization tool may be fruitfully viewed not as a tool but as part of an online social environment. In other words, to design a successful exploratory data analysis tool, one good strategy is to create a system that enables \"social\" data analysis",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Name Voyager, a Web based visualization of historical trends in baby naming, has proven remarkably popular. This paper discusses the interaction techniques it uses for smooth visual exploration of thousands of time series. We also describe design decisions behind the application and lessons learned in creating an application that makes do-it-yourself data mining popular. The prime lesson, it is hypothesized, is that an information visualization tool may be fruitfully viewed not as a tool but as part of an online social environment. In other words, to design a successful exploratory data analysis tool, one good strategy is to create a system that enables \"social\" data analysis",
"fno": "01532122",
"keywords": [
"Data Analysis",
"Data Mining",
"Data Visualisation",
"Internet",
"Social Data Analysis",
"Name Voyager",
"Web Based Visualization",
"Historical Trends",
"Baby Naming",
"Visual Exploration",
"Time Series",
"Data Mining",
"Online Social Environment",
"Exploratory Data Analysis",
"Pediatrics",
"Data Visualization",
"Data Analysis",
"Books",
"Data Mining",
"Chromium",
"Advertising",
"Educational Programs",
"Retirement",
"Blogs"
],
"authors": [
{
"affiliation": null,
"fullName": "M. Wattenberg",
"givenName": "M.",
"surname": "Wattenberg",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-infovis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-01-01T00:00:00",
"pubType": "proceedings",
"pages": "1,2,3,4,5,6,7",
"year": "2005",
"issn": "1522-404X",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01532121",
"articleId": "12OmNBSBk0J",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01532123",
"articleId": "12OmNwErptK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vizsec/2017/2693/0/08062196",
"title": "Firewall ruleset visualization analysis tool based on segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/vizsec/2017/08062196/12OmNBNM8Q4",
"parentPublication": {
"id": "proceedings/vizsec/2017/2693/0",
"title": "2017 IEEE Symposium on Visualization for Cyber Security (VizSec)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532843",
"title": "Visualization of the genus of knots",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532843/12OmNCdBDZg",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infvis/2005/9464/0/01532122",
"title": "Baby names, visualization, and social data analysis",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532122/12OmNCyBXhq",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900001",
"title": "Baby Names, Visualization, and Social Data Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900001/12OmNxWuig6",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/01/07192728",
"title": "Voyager: Exploratory Analysis via Faceted Browsing of Visualization Recommendations",
"doi": null,
"abstractUrl": "/journal/tg/2016/01/07192728/13rRUILLkDU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0549",
"title": "Designing for Social Data Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0549/13rRUwjoNwR",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903547",
"title": "Cultivating Visualization Literacy for Children Through Curiosity and Play",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903547/1GZookEFGzC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isads/2023/6451/0/10092040",
"title": "Resilient Streamlines Optimization for Baby Carriages",
"doi": null,
"abstractUrl": "/proceedings-article/isads/2023/10092040/1M9pVezZPVu",
"parentPublication": {
"id": "proceedings/isads/2023/6451/0",
"title": "2023 IEEE 15th International Symposium on Autonomous Decentralized System (ISADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2019/2838/0/283800a001",
"title": "Proportional Visualization of Genotypes and Phenotypes with Rainbow Boxes: Methods and Application to Sickle Cell Disease",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2019/283800a001/1cMF99L8ki4",
"parentPublication": {
"id": "proceedings/iv/2019/2838/0",
"title": "2019 23rd International Conference Information Visualisation (IV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/01423097",
"title": "An Introduction to Wavelets for Scientific Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/01423097/1h0N3jxcLQs",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBUAvUS",
"title": "International Conference on Internet of Things and International Conference on Cyber, Physical and Social Computing",
"acronym": "ithingscpscom",
"groupId": "1800308",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyuya31",
"doi": "10.1109/iThings/CPSCom.2011.87",
"title": "Better Organizing Your Contacts: An Empirical Study of an Intelligent Social Contact Management System",
"normalizedTitle": "Better Organizing Your Contacts: An Empirical Study of an Intelligent Social Contact Management System",
"abstract": "Human memory is generally poor and often fails in unpredictable ways, sometimes with dire consequences. On social occasions, it usually causes embarrassing situations (e.g., forgetting the name of a friend). Moreover, as the number of contacts increases, people feel difficult to maintain their social contacts with merely memory. Aiming at helping people better manage their social contacts, a powerful social contact management tool named SCM is introduced. It supports the auto-collection of rich contact data and a simple but efficient contact retrieval interface. First, an online survey is carried out with a series of questions about contact management. Based on the survey results, the SCM system is developed. Furthermore, to evaluate the usability and effectiveness of SCM, a user study of contact management is performed which proved SCM is very helpful for contact re-finding. On the other hand, several particular phenomena about social contact management and recall are discovered. The human contact-memorizing pattern is also concluded based on the result of this user study.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Human memory is generally poor and often fails in unpredictable ways, sometimes with dire consequences. On social occasions, it usually causes embarrassing situations (e.g., forgetting the name of a friend). Moreover, as the number of contacts increases, people feel difficult to maintain their social contacts with merely memory. Aiming at helping people better manage their social contacts, a powerful social contact management tool named SCM is introduced. It supports the auto-collection of rich contact data and a simple but efficient contact retrieval interface. First, an online survey is carried out with a series of questions about contact management. Based on the survey results, the SCM system is developed. Furthermore, to evaluate the usability and effectiveness of SCM, a user study of contact management is performed which proved SCM is very helpful for contact re-finding. On the other hand, several particular phenomena about social contact management and recall are discovered. The human contact-memorizing pattern is also concluded based on the result of this user study.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Human memory is generally poor and often fails in unpredictable ways, sometimes with dire consequences. On social occasions, it usually causes embarrassing situations (e.g., forgetting the name of a friend). Moreover, as the number of contacts increases, people feel difficult to maintain their social contacts with merely memory. Aiming at helping people better manage their social contacts, a powerful social contact management tool named SCM is introduced. It supports the auto-collection of rich contact data and a simple but efficient contact retrieval interface. First, an online survey is carried out with a series of questions about contact management. Based on the survey results, the SCM system is developed. Furthermore, to evaluate the usability and effectiveness of SCM, a user study of contact management is performed which proved SCM is very helpful for contact re-finding. On the other hand, several particular phenomena about social contact management and recall are discovered. The human contact-memorizing pattern is also concluded based on the result of this user study.",
"fno": "4580a283",
"keywords": [
"Social Contact Management",
"Human Memory Aid",
"Pervasive Computing",
"Human Computer Interaction",
"Empirical Study"
],
"authors": [
{
"affiliation": null,
"fullName": "Dingqi Yang",
"givenName": "Dingqi",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Bin Guo",
"givenName": "Bin",
"surname": "Guo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Daqing Zhang",
"givenName": "Daqing",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ithingscpscom",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-10-01T00:00:00",
"pubType": "proceedings",
"pages": "283-290",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4580-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06142273",
"articleId": "181W9p3mAZa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4580a291",
"articleId": "12OmNApLGQW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hisb/2011/4407/0/4407a182",
"title": "3G Smartphone Technologies for Generating Personal Social Network Contact Distributions and Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/hisb/2011/4407a182/12OmNARRYzu",
"parentPublication": {
"id": "proceedings/hisb/2011/4407/0",
"title": "Healthcare Informatics, Imaging and Systems Biology, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2008/3495/0/3495a703",
"title": "Prediction of Inter-residue Contact Clusters from Hydrophobic Cores",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2008/3495a703/12OmNAS9zPf",
"parentPublication": {
"id": "proceedings/icmla/2008/3495/0",
"title": "2008 Seventh International Conference on Machine Learning and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wowmom/2011/0352/0/05986461",
"title": "Predicting missing contacts in mobile social networks",
"doi": null,
"abstractUrl": "/proceedings-article/wowmom/2011/05986461/12OmNAkWvp3",
"parentPublication": {
"id": "proceedings/wowmom/2011/0352/0",
"title": "2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2002/1435/4/14350115b",
"title": "Managing Long Term Communications: Conversation and Contact Management",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2002/14350115b/12OmNAm4TKW",
"parentPublication": {
"id": "proceedings/hicss/2002/1435/4",
"title": "Proceedings of the 35th Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iros/1995/7108/3/71083059",
"title": "Identifying contact formations in the presence of uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/iros/1995/71083059/12OmNClQ0x1",
"parentPublication": {
"id": "proceedings/iros/1995/7108/3",
"title": "Intelligent Robots and Systems, IEEE/RSJ International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2011/4455/0/4455a189",
"title": "An Investigation of Misalignment to Contact Path of Face-Gear Drives",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2011/4455a189/12OmNvUsoq6",
"parentPublication": {
"id": "proceedings/icdma/2011/4455/0",
"title": "2011 Second International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2011/4386/0/4386a240",
"title": "Exploiting Rush Hours for Energy-Efficient Contact Probing in Opportunistic Data Collection",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2011/4386a240/12OmNvjgWHK",
"parentPublication": {
"id": "proceedings/icdcsw/2011/4386/0",
"title": "2011 31st International Conference on Distributed Computing Systems Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imstw/2015/6732/0/07177864",
"title": "Efficient contact screening of compact NVMs for high reliabilty automotive applications",
"doi": null,
"abstractUrl": "/proceedings-article/imstw/2015/07177864/12OmNy6ZrYA",
"parentPublication": {
"id": "proceedings/imstw/2015/6732/0",
"title": "2015 20th International Mixed-Signal Testing Workshop (IMSTW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2011/4513/2/4513b117",
"title": "Strategic Behavior in Interaction Selection and Contact Selection",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2011/4513b117/12OmNylsZB5",
"parentPublication": {
"id": "proceedings/wi-iat/2011/4513/2",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2011/4513/1/4513a384",
"title": "\"Read\" More from Business Cards: Toward a Smart Social Contact Management System",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2011/4513a384/12OmNzUxOjp",
"parentPublication": {
"id": "proceedings/wi-iat/2011/4513/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKir4",
"title": "2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)",
"acronym": "iciibms",
"groupId": "1811284",
"volume": "3",
"displayVolume": "3",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45Xh13r5",
"doi": "10.1109/ICIIBMS.2018.8550020",
"title": "OCA: Overlapping Clustering Application: Unsupervised Approach for Data Analysis",
"normalizedTitle": "OCA: Overlapping Clustering Application: Unsupervised Approach for Data Analysis",
"abstract": "In this paper, a new data analysis tool called Overlapping Clustering Application (OCA) was presented. It was developed to identify overlapping clusters and outliers in an unsupervised manner. Python programming language was used for the development of the OCA. One of the methods used is the k-means algorithm, because of its simplicity to solve known clustering issues. The study also considered the use of median and median absolute deviation, it is known to be one of the most robust measures that are easy to use with the presence of outliers. Maxdist (maximum distance of data objects allowed in a cluster) is another method, it is used to identify data objects assigned to multi-cluster. The main function of OCA are composed of three phases. The first phase is to segment data objects into cluster using the k-means algorithm. The second phase is the detection of the abnormal values(outliers) in the datasets using median and median absolute deviation. Finally, the last phase is the identification of overlapping clusters, it uses maxdist as a predictor of data objects that can belong to multiple clusters. Based on the experimental results, the developed OCA demonstrated its capability in terms of detecting the abnormal values (outliers) and identification of clusters with overlaps. Experiments revealed that OCA is very useful data analysis tool for data clustering, outlier detection analysis and the detection of overlapping clusters.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, a new data analysis tool called Overlapping Clustering Application (OCA) was presented. It was developed to identify overlapping clusters and outliers in an unsupervised manner. Python programming language was used for the development of the OCA. One of the methods used is the k-means algorithm, because of its simplicity to solve known clustering issues. The study also considered the use of median and median absolute deviation, it is known to be one of the most robust measures that are easy to use with the presence of outliers. Maxdist (maximum distance of data objects allowed in a cluster) is another method, it is used to identify data objects assigned to multi-cluster. The main function of OCA are composed of three phases. The first phase is to segment data objects into cluster using the k-means algorithm. The second phase is the detection of the abnormal values(outliers) in the datasets using median and median absolute deviation. Finally, the last phase is the identification of overlapping clusters, it uses maxdist as a predictor of data objects that can belong to multiple clusters. Based on the experimental results, the developed OCA demonstrated its capability in terms of detecting the abnormal values (outliers) and identification of clusters with overlaps. Experiments revealed that OCA is very useful data analysis tool for data clustering, outlier detection analysis and the detection of overlapping clusters.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, a new data analysis tool called Overlapping Clustering Application (OCA) was presented. It was developed to identify overlapping clusters and outliers in an unsupervised manner. Python programming language was used for the development of the OCA. One of the methods used is the k-means algorithm, because of its simplicity to solve known clustering issues. The study also considered the use of median and median absolute deviation, it is known to be one of the most robust measures that are easy to use with the presence of outliers. Maxdist (maximum distance of data objects allowed in a cluster) is another method, it is used to identify data objects assigned to multi-cluster. The main function of OCA are composed of three phases. The first phase is to segment data objects into cluster using the k-means algorithm. The second phase is the detection of the abnormal values(outliers) in the datasets using median and median absolute deviation. Finally, the last phase is the identification of overlapping clusters, it uses maxdist as a predictor of data objects that can belong to multiple clusters. Based on the experimental results, the developed OCA demonstrated its capability in terms of detecting the abnormal values (outliers) and identification of clusters with overlaps. Experiments revealed that OCA is very useful data analysis tool for data clustering, outlier detection analysis and the detection of overlapping clusters.",
"fno": "08550020",
"keywords": [
"Data Analysis",
"Pattern Clustering",
"Visual Databases",
"Overlapping Clusters",
"Median Deviation",
"Median Absolute Deviation",
"Multicluster",
"Multiple Clusters",
"Data Clustering",
"Outlier Detection Analysis",
"Data Analysis Tool",
"Overlapping Clustering Application",
"Data Analysis",
"Urban Areas",
"Tools",
"Clustering Algorithms",
"Object Recognition",
"Robots",
"Human Computer Interaction",
"Overlap",
"MAD",
"K Means",
"Outliers",
"GUI"
],
"authors": [
{
"affiliation": "Graduate Programs, Technological Institute of the Philippines, Quezon City, Philippines",
"fullName": "Alvincent E. Danganan",
"givenName": "Alvincent E.",
"surname": "Danganan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Studies, Emilio Aguinaldo College, San Marcelino St. Manila, Philippines",
"fullName": "Ariel M. Sison",
"givenName": "Ariel M.",
"surname": "Sison",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Graduate Programs, Technological Institute of the Philippines, Quezon City, Philippines",
"fullName": "Ruji P. Medina",
"givenName": "Ruji P.",
"surname": "Medina",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iciibms",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-10-01T00:00:00",
"pubType": "proceedings",
"pages": "273-273",
"year": "2018",
"issn": "2189-8723",
"isbn": "978-1-5386-7516-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08549995",
"articleId": "17D45Xq6dBn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08550011",
"articleId": "17D45VtKiuX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2002/1695/1/169510259",
"title": "Unsupervised Robust Clustering for Image Database Categorization",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2002/169510259/12OmNAKM00F",
"parentPublication": {
"id": "proceedings/icpr/2002/1695/1",
"title": "Proceedings of 16th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761079",
"title": "An extended version of the k-means method for overlapping clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761079/12OmNqAU6yn",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2006/2702/0/27020104",
"title": "Consensus Clustering for Detection of Overlapping Clusters in Microarray Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2006/27020104/12OmNrAv3St",
"parentPublication": {
"id": "proceedings/icdmw/2006/2702/0",
"title": "Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2008/3502/0/3502a791",
"title": "Multiplicative Mixture Models for Overlapping Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2008/3502a791/12OmNrGsDpd",
"parentPublication": {
"id": "proceedings/icdm/2008/3502/0",
"title": "2008 Eighth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2014/4143/2/4143b350",
"title": "Categorizing Overlapping Regions in Clustering Analysis Using Three-Way Decisions",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2014/4143b350/12OmNsbGvIk",
"parentPublication": {
"id": "wi-iat/2014/4143/2",
"title": "2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a051",
"title": "Overlapping Correlation Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a051/12OmNx8fi9V",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2012/4925/0/4925a486",
"title": "Overlapping Clustering with Sparseness Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2012/4925a486/12OmNzZmZq1",
"parentPublication": {
"id": "proceedings/icdmw/2012/4925/0",
"title": "2012 IEEE 12th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2010/5445/0/05447860",
"title": "Overlapping Community Search for social networks",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2010/05447860/12OmNzw8j7n",
"parentPublication": {
"id": "proceedings/icde/2010/5445/0",
"title": "2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2009/12/ttd2009121844",
"title": "Overlapping Multihop Clustering for Wireless Sensor Networks",
"doi": null,
"abstractUrl": "/journal/td/2009/12/ttd2009121844/13rRUNvgz9i",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2019/11/08425790",
"title": "Non-Exhaustive, Overlapping Clustering",
"doi": null,
"abstractUrl": "/journal/tp/2019/11/08425790/1dR0SEZN1Oo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1BByPNt70Ag",
"title": "2021 International Conference on Big Data, Artificial Intelligence and Risk Management (ICBAR)",
"acronym": "icbar",
"groupId": "1845906",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1BBySE1TvQk",
"doi": "10.1109/ICBAR55169.2021.00015",
"title": "Application of big data acquisition and analysis technology in social risk management",
"normalizedTitle": "Application of big data acquisition and analysis technology in social risk management",
"abstract": "At present, risks and challenges are related to the country's social development. The collection and analysis technology of big data has opened up a new path for social risk management. Big data technology provides powerful data information, tool capabilities and technical platform support for social risk governance. With the application of big data collection and analysis technology, the subject participation governance model has been tried, the traditional social governance model has changed, and the social risk governance has become more scientific. In the new era, social risk management should be promoted by big data acquisition and analysis technology. It is necessary to cultivate big data thinking and change the thinking paradigm of social risk management; Optimizing the institutional system and coordinating the effectiveness of social risk management; Actively participate in various parties to realize diversified and coordinated governance of social risks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "At present, risks and challenges are related to the country's social development. The collection and analysis technology of big data has opened up a new path for social risk management. Big data technology provides powerful data information, tool capabilities and technical platform support for social risk governance. With the application of big data collection and analysis technology, the subject participation governance model has been tried, the traditional social governance model has changed, and the social risk governance has become more scientific. In the new era, social risk management should be promoted by big data acquisition and analysis technology. It is necessary to cultivate big data thinking and change the thinking paradigm of social risk management; Optimizing the institutional system and coordinating the effectiveness of social risk management; Actively participate in various parties to realize diversified and coordinated governance of social risks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "At present, risks and challenges are related to the country's social development. The collection and analysis technology of big data has opened up a new path for social risk management. Big data technology provides powerful data information, tool capabilities and technical platform support for social risk governance. With the application of big data collection and analysis technology, the subject participation governance model has been tried, the traditional social governance model has changed, and the social risk governance has become more scientific. In the new era, social risk management should be promoted by big data acquisition and analysis technology. It is necessary to cultivate big data thinking and change the thinking paradigm of social risk management; Optimizing the institutional system and coordinating the effectiveness of social risk management; Actively participate in various parties to realize diversified and coordinated governance of social risks.",
"fno": "956500a032",
"keywords": [
"Big Data",
"Data Acquisition",
"Risk Management",
"Social Sciences Computing",
"Social Risk Management",
"Data Analysis Technology",
"Big Data Technology",
"Data Information",
"Social Risk Governance",
"Big Data Collection",
"Social Governance Model",
"Big Data Acquisition",
"Big Data Thinking",
"Heart",
"Analytical Models",
"Buildings",
"Process Control",
"Big Data",
"Control Systems",
"Data Models",
"Component",
"Big Data",
"Social Risk Management",
"Science And Technology"
],
"authors": [
{
"affiliation": "School of Marxism, Beijing Jiaotong University,Beijing,China",
"fullName": "TaoLin Zhou",
"givenName": "TaoLin",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icbar",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-11-01T00:00:00",
"pubType": "proceedings",
"pages": "32-35",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-9565-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "956500a028",
"articleId": "1BByUGC8Je8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "956500a036",
"articleId": "1BByPWkW1xe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "mags/co/2013/06/mco2013060032",
"title": "Corporate Governance of Big Data: Perspectives on Value, Risk, and Cost",
"doi": null,
"abstractUrl": "/magazine/co/2013/06/mco2013060032/13rRUwcAqsX",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdeim/2021/8288/0/828800a256",
"title": "Application of Big Data Technology in Students’ Sports Risk Control",
"doi": null,
"abstractUrl": "/proceedings-article/bdeim/2021/828800a256/1B4mogl49Qk",
"parentPublication": {
"id": "proceedings/bdeim/2021/8288/0",
"title": "2021 2nd International Conference on Big Data Economy and Information Management (BDEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdeim/2021/8288/0/828800a225",
"title": "Research on the Construction of Big Data Platform for Municipal Social Governance",
"doi": null,
"abstractUrl": "/proceedings-article/bdeim/2021/828800a225/1B4mq434DCw",
"parentPublication": {
"id": "proceedings/bdeim/2021/8288/0",
"title": "2021 2nd International Conference on Big Data Economy and Information Management (BDEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbar/2021/9565/0/956500a015",
"title": "Research on Big Data Security and Privacy Risk Governance",
"doi": null,
"abstractUrl": "/proceedings-article/icbar/2021/956500a015/1BBySpuF5Ru",
"parentPublication": {
"id": "proceedings/icbar/2021/9565/0",
"title": "2021 International Conference on Big Data, Artificial Intelligence and Risk Management (ICBAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbar/2021/9565/0/956500a019",
"title": "Risk management in the era of big data",
"doi": null,
"abstractUrl": "/proceedings-article/icbar/2021/956500a019/1BByVam30be",
"parentPublication": {
"id": "proceedings/icbar/2021/9565/0",
"title": "2021 International Conference on Big Data, Artificial Intelligence and Risk Management (ICBAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicas/2021/2810/0/281000a260",
"title": "Research on the Construction of Financial Risk Platform Based on Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/icicas/2021/281000a260/1ByfcMIOtfW",
"parentPublication": {
"id": "proceedings/icicas/2021/2810/0",
"title": "2021 International Conference on Intelligent Computing, Automation and Systems (ICICAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsmt/2021/2063/0/206300a069",
"title": "Risk Ranking Governance Mechanism of Short-term Rental Housing Based on an Integral Early Warning Model in the Context of Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/iccsmt/2021/206300a069/1E2wbMZBMbK",
"parentPublication": {
"id": "proceedings/iccsmt/2021/2063/0",
"title": "2021 2nd International Conference on Computer Science and Management Technology (ICCSMT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3cbit/2022/9225/0/922500a088",
"title": "Research on Intelligent Optimization Decision Support Platform of Solid Waste Environmental Risk Event Disposal Technology Under the Background of Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/3cbit/2022/922500a088/1La4M31l0go",
"parentPublication": {
"id": "proceedings/3cbit/2022/9225/0",
"title": "2022 International Conference on Cloud Computing, Big Data and Internet of Things (3CBIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pmis/2021/3872/0/387200a001",
"title": "Research on the Realistic Dilemma and Path of Intelligent Social Governance under the Background of Big Data",
"doi": null,
"abstractUrl": "/proceedings-article/pmis/2021/387200a001/1t2n3sZqp7G",
"parentPublication": {
"id": "proceedings/pmis/2021/3872/0",
"title": "2021 International Conference on Public Management and Intelligent Society (PMIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itca/2020/0378/0/037800a448",
"title": "A New Method for information security risk management in big data environment",
"doi": null,
"abstractUrl": "/proceedings-article/itca/2020/037800a448/1tpBbaUiZBC",
"parentPublication": {
"id": "proceedings/itca/2020/0378/0",
"title": "2020 2nd International Conference on Information Technology and Computer Application (ITCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1CJcAaH6aYg",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"acronym": "vrw",
"groupId": "1836626",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1CJcGDV6xag",
"doi": "10.1109/VRW55335.2022.00140",
"title": "Designing a Physiological Loop for the Adaptation of Virtual Human Characters in a Social VR Scenario",
"normalizedTitle": "Designing a Physiological Loop for the Adaptation of Virtual Human Characters in a Social VR Scenario",
"abstract": "Social virtual reality is getting mainstream not only for entertainment purposes but also for productivity and education. This makes the design of social VR scenarios functional to support the operator's performance. We present a physiologically-adaptive system that optimizes for visual complexity in a dual-task scenario based on electrodermal activity. Specifically, we propose a system that adapts the amount of non-player characters while jointly performing an N-Back task (primary) and visual detection task (secondary). Our preliminary results show that when optimizing the complexity of the secondary task, users report an improved user experience.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Social virtual reality is getting mainstream not only for entertainment purposes but also for productivity and education. This makes the design of social VR scenarios functional to support the operator's performance. We present a physiologically-adaptive system that optimizes for visual complexity in a dual-task scenario based on electrodermal activity. Specifically, we propose a system that adapts the amount of non-player characters while jointly performing an N-Back task (primary) and visual detection task (secondary). Our preliminary results show that when optimizing the complexity of the secondary task, users report an improved user experience.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Social virtual reality is getting mainstream not only for entertainment purposes but also for productivity and education. This makes the design of social VR scenarios functional to support the operator's performance. We present a physiologically-adaptive system that optimizes for visual complexity in a dual-task scenario based on electrodermal activity. Specifically, we propose a system that adapts the amount of non-player characters while jointly performing an N-Back task (primary) and visual detection task (secondary). Our preliminary results show that when optimizing the complexity of the secondary task, users report an improved user experience.",
"fno": "840200a578",
"keywords": [
"User Experience",
"Virtual Reality",
"Physiological Loop",
"Virtual Human Characters",
"Social VR Scenario",
"Social Virtual Reality",
"Entertainment Purposes",
"Productivity",
"Education",
"Physiologically Adaptive System",
"Visual Complexity",
"Dual Task Scenario",
"Nonplayer Characters",
"Visual Detection",
"Electrodermal Activity",
"N Back Task",
"User Experience",
"Productivity",
"Human Computer Interaction",
"Visualization",
"Three Dimensional Displays",
"Conferences",
"Virtual Reality",
"Physiology",
"Human Centered Computing X 2014 Human Computer Interaction HCI X 2014 Empirical Studies In HCI"
],
"authors": [
{
"affiliation": "LMU Munich,Munich,Germany",
"fullName": "Francesco Chiossi",
"givenName": "Francesco",
"surname": "Chiossi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LMU Munich,Munich,Germany",
"fullName": "Robin Welsch",
"givenName": "Robin",
"surname": "Welsch",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LMU Munich,Munich,Germany",
"fullName": "Steeven Villa",
"givenName": "Steeven",
"surname": "Villa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LMU Munich,Munich,Germany",
"fullName": "Lewis L. Chuang",
"givenName": "Lewis L.",
"surname": "Chuang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LMU Munich,Munich,Germany",
"fullName": "Sven Mayer",
"givenName": "Sven",
"surname": "Mayer",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vrw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-03-01T00:00:00",
"pubType": "proceedings",
"pages": "578-579",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8402-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1CJcGzlORlS",
"name": "pvrw202284020-09757528s1-mm_840200a578.zip",
"size": "18.5 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pvrw202284020-09757528s1-mm_840200a578.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "840200a576",
"articleId": "1CJd33f4h4k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "840200a580",
"articleId": "1CJenv6SXTO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vs-games/2016/2722/0/07590353",
"title": "Modulation of Physiological Responses and Activity Levels during Exergame Experiences",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2016/07590353/12OmNzcxZfP",
"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": "trans/ta/2013/03/06565322",
"title": "Affect and Social Processes in Online Communication--Experiments with an Affective Dialog System",
"doi": null,
"abstractUrl": "/journal/ta/2013/03/06565322/13rRUxcsYK9",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2015/10/mco2015100012",
"title": "Physiological Computing",
"doi": null,
"abstractUrl": "/magazine/co/2015/10/mco2015100012/13rRUxk89f9",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2015/10/mco2015100026",
"title": "Stress Detection Using Physiological Sensors",
"doi": null,
"abstractUrl": "/magazine/co/2015/10/mco2015100026/13rRUypGGex",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/02/08930025",
"title": "Evoking Physiological Synchrony and Empathy Using Social VR With Biofeedback",
"doi": null,
"abstractUrl": "/journal/ta/2022/02/08930025/1fCCMiUcICY",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2019/3888/0/08925474",
"title": "Computational Modeling of Psycho-physiological Arousal and Social Initiation of children with Autism in Interventions through Full-Body Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2019/08925474/1fHGE1f2lNe",
"parentPublication": {
"id": "proceedings/acii/2019/3888/0",
"title": "2019 8th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089452",
"title": "Real and Virtual Environment Mismatching Induces Arousal and Alters Movement Behavior",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089452/1jIxcobDHi0",
"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/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/acii/2021/0019/0/09597434",
"title": "Automatic Recognition of Flow During Work Activities Using Context and Physiological Signals",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2021/09597434/1yylci3qsow",
"parentPublication": {
"id": "proceedings/acii/2021/0019/0",
"title": "2021 9th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis-fall/2021/7679/0/09627412",
"title": "Physical and Physiological Data for Customizing Immersive VR Training",
"doi": null,
"abstractUrl": "/proceedings-article/icis-fall/2021/09627412/1z7dPZpx2Za",
"parentPublication": {
"id": "proceedings/icis-fall/2021/7679/0",
"title": "2021 IEEE/ACIS 20th International Fall Conference on Computer and Information Science (ICIS Fall)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvmowSE",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"acronym": "icdm",
"groupId": "1000179",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNANkoiX",
"doi": "10.1109/ICDM.2009.118",
"title": "A New MCA-Based Divisive Hierarchical Algorithm for Clustering Categorical Data",
"normalizedTitle": "A New MCA-Based Divisive Hierarchical Algorithm for Clustering Categorical Data",
"abstract": "Clustering categorical data faces two challenges, one is lacking of inherent similarity measure, and the other is that the clusters are prone to being embedded in different subspace. In this paper, we propose the first divisive hierarchical clustering algorithm for categorical data. The algorithm, which is based on Multiple Correspondence Analysis (MCA), is systematic, efficient and effective. In our algorithm, MCA plays an important role in analyzing the data globally. The proposed algorithm has five merits. First, our algorithm yields a dendrogram representing nested groupings of patterns and similarity levels at different granularities. Second, it is parameter-free, fully automatic and, most importantly, requires no assumption regarding the number of clusters. Third, it is independent of the order in which the data are processed. Forth, it is scalable to large data sets; and finally, using the novel data representation and Chi-square distance measures makes our algorithm capable of seamlessly discovering the clusters embedded in the subspaces. Experiments on both synthetic and real data demonstrate the superior performance of our algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering categorical data faces two challenges, one is lacking of inherent similarity measure, and the other is that the clusters are prone to being embedded in different subspace. In this paper, we propose the first divisive hierarchical clustering algorithm for categorical data. The algorithm, which is based on Multiple Correspondence Analysis (MCA), is systematic, efficient and effective. In our algorithm, MCA plays an important role in analyzing the data globally. The proposed algorithm has five merits. First, our algorithm yields a dendrogram representing nested groupings of patterns and similarity levels at different granularities. Second, it is parameter-free, fully automatic and, most importantly, requires no assumption regarding the number of clusters. Third, it is independent of the order in which the data are processed. Forth, it is scalable to large data sets; and finally, using the novel data representation and Chi-square distance measures makes our algorithm capable of seamlessly discovering the clusters embedded in the subspaces. Experiments on both synthetic and real data demonstrate the superior performance of our algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering categorical data faces two challenges, one is lacking of inherent similarity measure, and the other is that the clusters are prone to being embedded in different subspace. In this paper, we propose the first divisive hierarchical clustering algorithm for categorical data. The algorithm, which is based on Multiple Correspondence Analysis (MCA), is systematic, efficient and effective. In our algorithm, MCA plays an important role in analyzing the data globally. The proposed algorithm has five merits. First, our algorithm yields a dendrogram representing nested groupings of patterns and similarity levels at different granularities. Second, it is parameter-free, fully automatic and, most importantly, requires no assumption regarding the number of clusters. Third, it is independent of the order in which the data are processed. Forth, it is scalable to large data sets; and finally, using the novel data representation and Chi-square distance measures makes our algorithm capable of seamlessly discovering the clusters embedded in the subspaces. Experiments on both synthetic and real data demonstrate the superior performance of our algorithm.",
"fno": "3895b058",
"keywords": [
"Clustering",
"Categorical Data",
"MCA",
"Divisive Hierarchical"
],
"authors": [
{
"affiliation": null,
"fullName": "Tengke Xiong",
"givenName": "Tengke",
"surname": "Xiong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shengrui Wang",
"givenName": "Shengrui",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "André Mayers",
"givenName": "André",
"surname": "Mayers",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ernest Monga",
"givenName": "Ernest",
"surname": "Monga",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1058-1063",
"year": "2009",
"issn": "1550-4786",
"isbn": "978-0-7695-3895-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3895b052",
"articleId": "12OmNykkB8g",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3895b064",
"articleId": "12OmNwe2IBt",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bife/2009/3705/0/3705a170",
"title": "Fuzzy Clustering Ensemble Algorithm for Partitioning Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2009/3705a170/12OmNAoUTrW",
"parentPublication": {
"id": "proceedings/bife/2009/3705/0",
"title": "2009 International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2010/3982/2/3982b365",
"title": "A Hierarchical Clustering Algorithm for Categorical Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2010/3982b365/12OmNvzJG2A",
"parentPublication": {
"id": "proceedings/iccea/2010/3982/2",
"title": "Computer Engineering and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a854",
"title": "A New Markov Model for Clustering Categorical Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a854/12OmNxFJXPI",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccit/2008/3407/1/3407a599",
"title": "Clustering Categorical Data Based on Representatives",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407a599/12OmNxFaLCz",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/1/3962a032",
"title": "A Cluster Description Method for High Dimensional Data Clustering with Categorical Variables",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962a032/12OmNxTmHM8",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/1",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/2/4225b504",
"title": "An Extended Fuzzy k-Means Algorithm for Clustering Categorical Valued Data",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225b504/12OmNyL0TAd",
"parentPublication": {
"id": "proceedings/aici/2010/4225/2",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2005/2278/0/22780106",
"title": "Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2005/22780106/12OmNz5JC6W",
"parentPublication": {
"id": "proceedings/icdm/2005/2278/0",
"title": "Fifth IEEE International Conference on Data Mining (ICDM'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2009/3801/1/3801a614",
"title": "Hierarchical-Hyperspherical Divisive Fuzzy C-Means (H2D-FCM) Clustering for Information Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2009/3801a614/12OmNzUPprE",
"parentPublication": {
"id": "proceedings/wi-iat/2009/3801/1",
"title": "2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/03/ttk2012030413",
"title": "A Link-Based Cluster Ensemble Approach for Categorical Data Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2012/03/ttk2012030413/13rRUxlgxWU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2019/04/08520776",
"title": "Parallel Hierarchical Subspace Clustering of Categorical Data",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08520776/17D45VtKiwV",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxH9X7w",
"title": "Information Visualization, IEEE Symposium on",
"acronym": "ieee-infovis",
"groupId": "1000371",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAThXUt",
"doi": "10.1109/INFOVIS.2005.27",
"title": "Parallel Sets: Visual Analysis of Categorical Data",
"normalizedTitle": "Parallel Sets: Visual Analysis of Categorical Data",
"abstract": "The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical dimensions. Only few methods deal properly with such data, mostly because of the discrete nature of categorical data, which does not translate well into the continuous domains of space and color. Parallel Sets is a new visualization method that adopts the layout of parallel coordinates, but substitutes the individual data points by a frequency-based representation. This abstracted view, combined with a set of carefully designed interactions, supports visual data analysis of large and complex data sets. The technique allows ef- ficient work with meta data, which is particularly important when dealing with categorical datasets. By creating new dimensions from existing ones, for example, the user can filter the data according to his or her current needs. We also present the results from an interactive analysis of CRM data using Parallel Sets. We demonstrate how the flexible layout eases the process of knowledge crystallization, especially when combined with a sophisticated interaction scheme.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical dimensions. Only few methods deal properly with such data, mostly because of the discrete nature of categorical data, which does not translate well into the continuous domains of space and color. Parallel Sets is a new visualization method that adopts the layout of parallel coordinates, but substitutes the individual data points by a frequency-based representation. This abstracted view, combined with a set of carefully designed interactions, supports visual data analysis of large and complex data sets. The technique allows ef- ficient work with meta data, which is particularly important when dealing with categorical datasets. By creating new dimensions from existing ones, for example, the user can filter the data according to his or her current needs. We also present the results from an interactive analysis of CRM data using Parallel Sets. We demonstrate how the flexible layout eases the process of knowledge crystallization, especially when combined with a sophisticated interaction scheme.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical dimensions. Only few methods deal properly with such data, mostly because of the discrete nature of categorical data, which does not translate well into the continuous domains of space and color. Parallel Sets is a new visualization method that adopts the layout of parallel coordinates, but substitutes the individual data points by a frequency-based representation. This abstracted view, combined with a set of carefully designed interactions, supports visual data analysis of large and complex data sets. The technique allows ef- ficient work with meta data, which is particularly important when dealing with categorical datasets. By creating new dimensions from existing ones, for example, the user can filter the data according to his or her current needs. We also present the results from an interactive analysis of CRM data using Parallel Sets. We demonstrate how the flexible layout eases the process of knowledge crystallization, especially when combined with a sophisticated interaction scheme.",
"fno": "27900018",
"keywords": [
"Categorical Data",
"Meta Information",
"Interaction"
],
"authors": [
{
"affiliation": "VRVis Research Center",
"fullName": "Fabian Bendix",
"givenName": "Fabian",
"surname": "Bendix",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Inte Ligand",
"fullName": "Robert Kosara",
"givenName": "Robert",
"surname": "Kosara",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "VRVis Research Center",
"fullName": "Helwig Hauser",
"givenName": "Helwig",
"surname": "Hauser",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-infovis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-10-01T00:00:00",
"pubType": "proceedings",
"pages": "18",
"year": "2005",
"issn": "1522-404x",
"isbn": "0-7803-9464-x",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "27900017",
"articleId": "12OmNz2C1n3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "27900019",
"articleId": "12OmNxE2n28",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2009/3895/0/3895b058",
"title": "A New MCA-Based Divisive Hierarchical Algorithm for Clustering Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2009/3895b058/12OmNANkoiX",
"parentPublication": {
"id": "proceedings/icdm/2009/3895/0",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a003",
"title": "Interactive Quantification of Categorical Variables in Mixed Data Sets",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a003/12OmNBO3Kkh",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infvis/2005/9464/0/01532139",
"title": "Parallel sets: visual analysis of categorical data",
"doi": null,
"abstractUrl": "/proceedings-article/infvis/2005/01532139/12OmNxETa5G",
"parentPublication": {
"id": "proceedings/infvis/2005/9464/0",
"title": "IEEE Symposium on Information Visualization (InfoVis 05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a854",
"title": "A New Markov Model for Clustering Categorical Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a854/12OmNxFJXPI",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccit/2008/3407/1/3407a599",
"title": "Clustering Categorical Data Based on Representatives",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407a599/12OmNxFaLCz",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2008/3496/1/3496a411",
"title": "Grouping Categorical Anomalies",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2008/3496a411/12OmNy3147o",
"parentPublication": {
"id": "proceedings/wi-iat/2008/3496/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2005/2790/0/01532139",
"title": "Parallel sets: visual analysis of categorical data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/01532139/12OmNy6HQQZ",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2005/2278/0/22780106",
"title": "Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2005/22780106/12OmNz5JC6W",
"parentPublication": {
"id": "proceedings/icdm/2005/2278/0",
"title": "Fifth IEEE International Conference on Data Mining (ICDM'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0558",
"title": "Parallel Sets: Interactive Exploration and Visual Analysis of Categorical Data",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0558/13rRUwhpBDX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2022/2335/0/233500a151",
"title": "SET-STAT-MAP: Extending Parallel Sets for Visualizing Mixed Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2022/233500a151/1E2wfuqTfMY",
"parentPublication": {
"id": "proceedings/pacificvis/2022/2335/0",
"title": "2022 IEEE 15th Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvjgWMZ",
"title": "2008 12th International Conference Information Visualisation",
"acronym": "iv",
"groupId": "1000370",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBO3Kkh",
"doi": "10.1109/IV.2008.33",
"title": "Interactive Quantification of Categorical Variables in Mixed Data Sets",
"normalizedTitle": "Interactive Quantification of Categorical Variables in Mixed Data Sets",
"abstract": "Data sets containing a combination of categorical and continuous variables (mixed data sets) are difficult to analyse since no generalized similarity measure exists for categorical variables. Quantification of categorical variables makes it possible to represent this type of data using techniques designed for numerical data. This paper presents a quantification process of categorical variables in mixed data sets that incorporates information on relationships among the continuous variables into the process, as well as utilizing the domain knowledge of a user. An interactive visualization environment using parallel coordinates as a visual interface is provided, where the user is able to control the quantification process and analyse the result. The efficiency of the approach is demonstrated using two mixed data sets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data sets containing a combination of categorical and continuous variables (mixed data sets) are difficult to analyse since no generalized similarity measure exists for categorical variables. Quantification of categorical variables makes it possible to represent this type of data using techniques designed for numerical data. This paper presents a quantification process of categorical variables in mixed data sets that incorporates information on relationships among the continuous variables into the process, as well as utilizing the domain knowledge of a user. An interactive visualization environment using parallel coordinates as a visual interface is provided, where the user is able to control the quantification process and analyse the result. The efficiency of the approach is demonstrated using two mixed data sets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data sets containing a combination of categorical and continuous variables (mixed data sets) are difficult to analyse since no generalized similarity measure exists for categorical variables. Quantification of categorical variables makes it possible to represent this type of data using techniques designed for numerical data. This paper presents a quantification process of categorical variables in mixed data sets that incorporates information on relationships among the continuous variables into the process, as well as utilizing the domain knowledge of a user. An interactive visualization environment using parallel coordinates as a visual interface is provided, where the user is able to control the quantification process and analyse the result. The efficiency of the approach is demonstrated using two mixed data sets.",
"fno": "3268a003",
"keywords": [
"Categorical Data",
"Mixed Data",
"Parallel Coordinates",
"Quantification",
"Correspondence Analysis",
"Clustering"
],
"authors": [
{
"affiliation": null,
"fullName": "Sara Johansson",
"givenName": "Sara",
"surname": "Johansson",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mikael Jern",
"givenName": "Mikael",
"surname": "Jern",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jimmy Johansson",
"givenName": "Jimmy",
"surname": "Johansson",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-07-01T00:00:00",
"pubType": "proceedings",
"pages": "3-10",
"year": "2008",
"issn": "1550-6037",
"isbn": "978-0-7695-3268-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3268z016",
"articleId": "12OmNBTawwT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3268a011",
"articleId": "12OmNBTs7Co",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900018",
"title": "Parallel Sets: Visual Analysis of Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900018/12OmNAThXUt",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2009/3733/0/3733a260",
"title": "A Memory-Saving and Efficient Data Transformation Technique for Mixed Data Sets Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2009/3733a260/12OmNButq4U",
"parentPublication": {
"id": "proceedings/iv/2009/3733/0",
"title": "2009 13th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccima/2003/1957/0/19570102",
"title": "A GA-Based Clustering Algorithm for Large Data Sets with Mixed Numeric and Categorical Values",
"doi": null,
"abstractUrl": "/proceedings-article/iccima/2003/19570102/12OmNrkjVqz",
"parentPublication": {
"id": "proceedings/iccima/2003/1957/0",
"title": "Computational Intelligence and Multimedia Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esem/2012/1056/0/06475401",
"title": "Handling categorical variables in effort estimation",
"doi": null,
"abstractUrl": "/proceedings-article/esem/2012/06475401/12OmNvHY2GK",
"parentPublication": {
"id": "proceedings/esem/2012/1056/0",
"title": "Proceedings of the 2012 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a854",
"title": "A New Markov Model for Clustering Categorical Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a854/12OmNxFJXPI",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccit/2008/3407/1/3407a599",
"title": "Clustering Categorical Data Based on Representatives",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407a599/12OmNxFaLCz",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/1/3962a032",
"title": "A Cluster Description Method for High Dimensional Data Clustering with Categorical Variables",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962a032/12OmNxTmHM8",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/1",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-infovis/2003/2055/0/20550015",
"title": "Mapping Nominal Values to Numbers for Effective Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2003/20550015/12OmNyFU77z",
"parentPublication": {
"id": "proceedings/ieee-infovis/2003/2055/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0558",
"title": "Parallel Sets: Interactive Exploration and Visual Analysis of Categorical Data",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0558/13rRUwhpBDX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2004/02/x2014",
"title": "Scoring Levels of Categorical Variables with Heterogeneous Data",
"doi": null,
"abstractUrl": "/magazine/ex/2004/02/x2014/13rRUx0xPQ4",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzTH0FY",
"title": "2011 IEEE 11th International Conference on Data Mining",
"acronym": "icdm",
"groupId": "1000179",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxFJXPI",
"doi": "10.1109/ICDM.2011.13",
"title": "A New Markov Model for Clustering Categorical Sequences",
"normalizedTitle": "A New Markov Model for Clustering Categorical Sequences",
"abstract": "Clustering categorical sequences remains an open and challenging task due to the lack of an inherently meaningful measure of pair wise similarity between sequences. Model initialization is an unsolved problem in model-based clustering algorithms for categorical sequences. In this paper, we propose a simple and effective Markov model to approximate the conditional probability distribution (CPD) model, and use it to design a novel two-tier Markov model to represent a sequence cluster. Furthermore, we design a novel divisive hierarchical algorithm for clustering categorical sequences based on the two-tier Markov model. The experimental results on the data sets from three different domains demonstrate the promising performance of our models and clustering algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering categorical sequences remains an open and challenging task due to the lack of an inherently meaningful measure of pair wise similarity between sequences. Model initialization is an unsolved problem in model-based clustering algorithms for categorical sequences. In this paper, we propose a simple and effective Markov model to approximate the conditional probability distribution (CPD) model, and use it to design a novel two-tier Markov model to represent a sequence cluster. Furthermore, we design a novel divisive hierarchical algorithm for clustering categorical sequences based on the two-tier Markov model. The experimental results on the data sets from three different domains demonstrate the promising performance of our models and clustering algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering categorical sequences remains an open and challenging task due to the lack of an inherently meaningful measure of pair wise similarity between sequences. Model initialization is an unsolved problem in model-based clustering algorithms for categorical sequences. In this paper, we propose a simple and effective Markov model to approximate the conditional probability distribution (CPD) model, and use it to design a novel two-tier Markov model to represent a sequence cluster. Furthermore, we design a novel divisive hierarchical algorithm for clustering categorical sequences based on the two-tier Markov model. The experimental results on the data sets from three different domains demonstrate the promising performance of our models and clustering algorithm.",
"fno": "4408a854",
"keywords": [
"Categorical Sequence",
"Markov Model",
"Clustering"
],
"authors": [
{
"affiliation": null,
"fullName": "Tengke Xiong",
"givenName": "Tengke",
"surname": "Xiong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shengrui Wang",
"givenName": "Shengrui",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Qingshan Jiang",
"givenName": "Qingshan",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Joshua Zhexue Huang",
"givenName": "Joshua Zhexue",
"surname": "Huang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-12-01T00:00:00",
"pubType": "proceedings",
"pages": "854-863",
"year": "2011",
"issn": "1550-4786",
"isbn": "978-0-7695-4408-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4408a844",
"articleId": "12OmNxdm4BG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4408a864",
"articleId": "12OmNyuya4l",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2009/3895/0/3895b058",
"title": "A New MCA-Based Divisive Hierarchical Algorithm for Clustering Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2009/3895b058/12OmNANkoiX",
"parentPublication": {
"id": "proceedings/icdm/2009/3895/0",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2009/3705/0/3705a170",
"title": "Fuzzy Clustering Ensemble Algorithm for Partitioning Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2009/3705a170/12OmNAoUTrW",
"parentPublication": {
"id": "proceedings/bife/2009/3705/0",
"title": "2009 International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/2/4225b137",
"title": "Adjust and Explain the Clustering Results of Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225b137/12OmNvpw7eA",
"parentPublication": {
"id": "proceedings/aici/2010/4225/2",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2010/3982/2/3982b365",
"title": "A Hierarchical Clustering Algorithm for Categorical Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2010/3982b365/12OmNvzJG2A",
"parentPublication": {
"id": "proceedings/iccea/2010/3982/2",
"title": "Computer Engineering and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccit/2008/3407/1/3407a599",
"title": "Clustering Categorical Data Based on Representatives",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407a599/12OmNxFaLCz",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/1/3962a032",
"title": "A Cluster Description Method for High Dimensional Data Clustering with Categorical Variables",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962a032/12OmNxTmHM8",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/1",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/2/4225b504",
"title": "An Extended Fuzzy k-Means Algorithm for Clustering Categorical Valued Data",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225b504/12OmNyL0TAd",
"parentPublication": {
"id": "proceedings/aici/2010/4225/2",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2005/2278/0/22780106",
"title": "Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2005/22780106/12OmNz5JC6W",
"parentPublication": {
"id": "proceedings/icdm/2005/2278/0",
"title": "Fifth IEEE International Conference on Data Mining (ICDM'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/10/06547142",
"title": "A Novel Variable-order Markov Model for Clustering Categorical Sequences",
"doi": null,
"abstractUrl": "/journal/tk/2014/10/06547142/13rRUxlgxTQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/03/ttk2012030413",
"title": "A Link-Based Cluster Ensemble Approach for Categorical Data Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2012/03/ttk2012030413/13rRUxlgxWU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1lgood28Alq",
"title": "Convergence Information Technology, International Conference on",
"acronym": "iccit",
"groupId": "1001590",
"volume": "1",
"displayVolume": "1",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxFaLCz",
"doi": "10.1109/ICCIT.2008.337",
"title": "Clustering Categorical Data Based on Representatives",
"normalizedTitle": "Clustering Categorical Data Based on Representatives",
"abstract": "Clustering of categorical data is one of the data mining techniques, which helps in identifying clusters within the domain space. In this paper we present a new method to cluster categorical data. This new representative based method works in three phases. The dissimilarity matrix, neighbor matrix and the initial clusters are formed in first phase. Merging of clusters is performed in the second phase by relocating the objects using the neighborhood concept. In the third phase, mode of attributes of clusters is computed, and phase I and Phase II are applied for the tuples formed from these representatives. The proposed method is experimented with the well known data sets from UCI data repository, soybean, zoo and mushroom data set.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Clustering of categorical data is one of the data mining techniques, which helps in identifying clusters within the domain space. In this paper we present a new method to cluster categorical data. This new representative based method works in three phases. The dissimilarity matrix, neighbor matrix and the initial clusters are formed in first phase. Merging of clusters is performed in the second phase by relocating the objects using the neighborhood concept. In the third phase, mode of attributes of clusters is computed, and phase I and Phase II are applied for the tuples formed from these representatives. The proposed method is experimented with the well known data sets from UCI data repository, soybean, zoo and mushroom data set.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Clustering of categorical data is one of the data mining techniques, which helps in identifying clusters within the domain space. In this paper we present a new method to cluster categorical data. This new representative based method works in three phases. The dissimilarity matrix, neighbor matrix and the initial clusters are formed in first phase. Merging of clusters is performed in the second phase by relocating the objects using the neighborhood concept. In the third phase, mode of attributes of clusters is computed, and phase I and Phase II are applied for the tuples formed from these representatives. The proposed method is experimented with the well known data sets from UCI data repository, soybean, zoo and mushroom data set.",
"fno": "3407a599",
"keywords": [
"Data Mining",
"Clustering",
"Categorical Data",
"Dissimilarity",
"Mode"
],
"authors": [
{
"affiliation": null,
"fullName": "S. Aranganayagi",
"givenName": "S.",
"surname": "Aranganayagi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "K. Thangavel",
"givenName": "K.",
"surname": "Thangavel",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccit",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-11-01T00:00:00",
"pubType": "proceedings",
"pages": "599-604",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3407-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3407a593",
"articleId": "12OmNC8Msu3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3407a605",
"articleId": "12OmNBJeyJm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2009/3895/0/3895b058",
"title": "A New MCA-Based Divisive Hierarchical Algorithm for Clustering Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2009/3895b058/12OmNANkoiX",
"parentPublication": {
"id": "proceedings/icdm/2009/3895/0",
"title": "2009 Ninth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2009/3705/0/3705a170",
"title": "Fuzzy Clustering Ensemble Algorithm for Partitioning Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2009/3705a170/12OmNAoUTrW",
"parentPublication": {
"id": "proceedings/bife/2009/3705/0",
"title": "2009 International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a003",
"title": "Interactive Quantification of Categorical Variables in Mixed Data Sets",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a003/12OmNBO3Kkh",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/2/4225b137",
"title": "Adjust and Explain the Clustering Results of Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225b137/12OmNvpw7eA",
"parentPublication": {
"id": "proceedings/aici/2010/4225/2",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2010/3982/2/3982b365",
"title": "A Hierarchical Clustering Algorithm for Categorical Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2010/3982b365/12OmNvzJG2A",
"parentPublication": {
"id": "proceedings/iccea/2010/3982/2",
"title": "Computer Engineering and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a854",
"title": "A New Markov Model for Clustering Categorical Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a854/12OmNxFJXPI",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/1/3962a032",
"title": "A Cluster Description Method for High Dimensional Data Clustering with Categorical Variables",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962a032/12OmNxTmHM8",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/1",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2005/2278/0/22780106",
"title": "Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2005/22780106/12OmNz5JC6W",
"parentPublication": {
"id": "proceedings/icdm/2005/2278/0",
"title": "Fifth IEEE International Conference on Data Mining (ICDM'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/03/ttk2012030413",
"title": "A Link-Based Cluster Ensemble Approach for Categorical Data Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2012/03/ttk2012030413/13rRUxlgxWU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2019/04/08520776",
"title": "Parallel Hierarchical Subspace Clustering of Categorical Data",
"doi": null,
"abstractUrl": "/journal/tc/2019/04/08520776/17D45VtKiwV",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxETa7P",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"acronym": "wi-iat",
"groupId": "1001411",
"volume": "1",
"displayVolume": "1",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy3147o",
"doi": "10.1109/WIIAT.2008.162",
"title": "Grouping Categorical Anomalies",
"normalizedTitle": "Grouping Categorical Anomalies",
"abstract": "We present an approach for discovery of groups of unusual data points that are anomalous for similar reasons. This differs from clustering in that the points that are grouped may be quite 'distant' and can use categorical attributes, and differs from anomaly detection in that we are not looking for individual outliers.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present an approach for discovery of groups of unusual data points that are anomalous for similar reasons. This differs from clustering in that the points that are grouped may be quite 'distant' and can use categorical attributes, and differs from anomaly detection in that we are not looking for individual outliers.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present an approach for discovery of groups of unusual data points that are anomalous for similar reasons. This differs from clustering in that the points that are grouped may be quite 'distant' and can use categorical attributes, and differs from anomaly detection in that we are not looking for individual outliers.",
"fno": "3496a411",
"keywords": [
"Data Mining",
"Categorical Data",
"Anomaly",
"Outlier"
],
"authors": [
{
"affiliation": null,
"fullName": "Matthew Gebski",
"givenName": "Matthew",
"surname": "Gebski",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Alex Penev",
"givenName": "Alex",
"surname": "Penev",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Raymond K. Wong",
"givenName": "Raymond K.",
"surname": "Wong",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "wi-iat",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "411-414",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3496-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3496a407",
"articleId": "12OmNzBOhRx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3496a415",
"articleId": "12OmNzahbXg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-infovis/2005/2790/0/27900018",
"title": "Parallel Sets: Visual Analysis of Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-infovis/2005/27900018/12OmNAThXUt",
"parentPublication": {
"id": "proceedings/ieee-infovis/2005/2790/0",
"title": "Information Visualization, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2009/3705/0/3705a170",
"title": "Fuzzy Clustering Ensemble Algorithm for Partitioning Categorical Data",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2009/3705a170/12OmNAoUTrW",
"parentPublication": {
"id": "proceedings/bife/2009/3705/0",
"title": "2009 International Conference on Business Intelligence and Financial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waim/2008/3185/0/3185a270",
"title": "PerRank: Personalized Rank Retrieval with Categorical and Numerical Attributes",
"doi": null,
"abstractUrl": "/proceedings-article/waim/2008/3185a270/12OmNB0Fxix",
"parentPublication": {
"id": "proceedings/waim/2008/3185/0",
"title": "Web-Age Information Management, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2008/3268/0/3268a003",
"title": "Interactive Quantification of Categorical Variables in Mixed Data Sets",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2008/3268a003/12OmNBO3Kkh",
"parentPublication": {
"id": "proceedings/iv/2008/3268/0",
"title": "2008 12th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmla/2010/4300/0/4300a436",
"title": "Semi-Supervised Anomaly Detection for EEG Waveforms Using Deep Belief Nets",
"doi": null,
"abstractUrl": "/proceedings-article/icmla/2010/4300a436/12OmNCeaPZ6",
"parentPublication": {
"id": "proceedings/icmla/2010/4300/0",
"title": "Machine Learning and Applications, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a854",
"title": "A New Markov Model for Clustering Categorical Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a854/12OmNxFJXPI",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccit/2008/3407/1/3407a599",
"title": "Clustering Categorical Data Based on Representatives",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407a599/12OmNxFaLCz",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2005/2278/0/22780106",
"title": "Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2005/22780106/12OmNz5JC6W",
"parentPublication": {
"id": "proceedings/icdm/2005/2278/0",
"title": "Fifth IEEE International Conference on Data Mining (ICDM'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0558",
"title": "Parallel Sets: Interactive Exploration and Visual Analysis of Categorical Data",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0558/13rRUwhpBDX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/03/ttk2012030413",
"title": "A Link-Based Cluster Ensemble Approach for Categorical Data Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2012/03/ttk2012030413/13rRUxlgxWU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAH5djR",
"title": "Fifth IEEE International Conference on Data Mining (ICDM'05)",
"acronym": "icdm",
"groupId": "1000179",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNz5JC6W",
"doi": "10.1109/ICDM.2005.85",
"title": "Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values",
"normalizedTitle": "Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values",
"abstract": "Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points which are not sampled will not have their labels. Although there is a straightforward approach in the numerical domain, the problem of how to allocate those unlabeled data points into proper clusters remains as a challenging issue in the categorical domain. In this paper, a mechanism named MAximal Resemblance Data Labeling (abbreviated as MARDL) is proposed to allocate each unlabeled data point into the corresponding appropriate cluster based on the novel categorical clustering representative, namely, Node Importance Representative (abbreviated as NIR), which represents clusters by the importance of attribute values. MARDL has two advantages: (1) MARDL exhibits high execution efficiency; (2) after each unlabeled data is allocated into the proper cluster, MARDL preserves clustering characteristics, i.e., high intra-cluster similarity and low inter-cluster similarity. MARDL is empirically validated via real and synthetic data sets, and is shown to be not only more efficient than prior methods but also attaining results of better quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points which are not sampled will not have their labels. Although there is a straightforward approach in the numerical domain, the problem of how to allocate those unlabeled data points into proper clusters remains as a challenging issue in the categorical domain. In this paper, a mechanism named MAximal Resemblance Data Labeling (abbreviated as MARDL) is proposed to allocate each unlabeled data point into the corresponding appropriate cluster based on the novel categorical clustering representative, namely, Node Importance Representative (abbreviated as NIR), which represents clusters by the importance of attribute values. MARDL has two advantages: (1) MARDL exhibits high execution efficiency; (2) after each unlabeled data is allocated into the proper cluster, MARDL preserves clustering characteristics, i.e., high intra-cluster similarity and low inter-cluster similarity. MARDL is empirically validated via real and synthetic data sets, and is shown to be not only more efficient than prior methods but also attaining results of better quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points which are not sampled will not have their labels. Although there is a straightforward approach in the numerical domain, the problem of how to allocate those unlabeled data points into proper clusters remains as a challenging issue in the categorical domain. In this paper, a mechanism named MAximal Resemblance Data Labeling (abbreviated as MARDL) is proposed to allocate each unlabeled data point into the corresponding appropriate cluster based on the novel categorical clustering representative, namely, Node Importance Representative (abbreviated as NIR), which represents clusters by the importance of attribute values. MARDL has two advantages: (1) MARDL exhibits high execution efficiency; (2) after each unlabeled data is allocated into the proper cluster, MARDL preserves clustering characteristics, i.e., high intra-cluster similarity and low inter-cluster similarity. MARDL is empirically validated via real and synthetic data sets, and is shown to be not only more efficient than prior methods but also attaining results of better quality.",
"fno": "22780106",
"keywords": [
"Data Mining",
"Categorical Clustering",
"Data Labeling"
],
"authors": [
{
"affiliation": "National Taiwan University",
"fullName": "Hung-Leng Chen",
"givenName": "Hung-Leng",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Taiwan University",
"fullName": "Kun-Ta Chuang",
"givenName": "Kun-Ta",
"surname": "Chuang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Taiwan University",
"fullName": "Ming-Syan Chen",
"givenName": "Ming-Syan",
"surname": "Chen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-11-01T00:00:00",
"pubType": "proceedings",
"pages": "106-113",
"year": "2005",
"issn": "1550-4786",
"isbn": "0-7695-2278-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "22780098",
"articleId": "12OmNyQYtgx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "22780114",
"articleId": "12OmNzcxZ2k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ictai/2014/6572/0/6572a259",
"title": "Categorical Data Clustering: A Correlation-Based Approach for Unsupervised Attribute Weighting",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a259/12OmNqIzgVR",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2011/4408/0/4408a854",
"title": "A New Markov Model for Clustering Categorical Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a854/12OmNxFJXPI",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccit/2008/3407/1/3407a599",
"title": "Clustering Categorical Data Based on Representatives",
"doi": null,
"abstractUrl": "/proceedings-article/iccit/2008/3407a599/12OmNxFaLCz",
"parentPublication": {
"id": "iccit/2008/3407/1",
"title": "Convergence Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/1/3962a032",
"title": "A Cluster Description Method for High Dimensional Data Clustering with Categorical Variables",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962a032/12OmNxTmHM8",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/1",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cicn/2014/6929/0/6929a602",
"title": "Clustering Categorical Data Using Rough Membership Function",
"doi": null,
"abstractUrl": "/proceedings-article/cicn/2014/6929a602/12OmNxveNF6",
"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-iat/2008/3496/1/3496a411",
"title": "Grouping Categorical Anomalies",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2008/3496a411/12OmNy3147o",
"parentPublication": {
"id": "proceedings/wi-iat/2008/3496/1",
"title": "Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2008/11/ttk2008111458",
"title": "On Data Labeling for Clustering Categorical Data",
"doi": null,
"abstractUrl": "/journal/tk/2008/11/ttk2008111458/13rRUwd9CGj",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2009/05/ttk2009050652",
"title": "Catching the Trend: A Framework for Clustering Concept-Drifting Categorical Data",
"doi": null,
"abstractUrl": "/journal/tk/2009/05/ttk2009050652/13rRUxOvea3",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2012/03/ttk2012030413",
"title": "A Link-Based Cluster Ensemble Approach for Categorical Data Clustering",
"doi": null,
"abstractUrl": "/journal/tk/2012/03/ttk2012030413/13rRUxlgxWU",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/03/i0503",
"title": "On the Impact of Dissimilarity Measure in k-Modes Clustering Algorithm",
"doi": null,
"abstractUrl": "/journal/tp/2007/03/i0503/13rRUyfbwrT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyjLoRf",
"title": "Pattern Recognition, International Conference on",
"acronym": "icpr",
"groupId": "1000545",
"volume": "2",
"displayVolume": "2",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNARRYj9",
"doi": "10.1109/ICPR.2002.1048484",
"title": "Registration for Stereo Vision-Based Augmented Reality Based on Extendible Tracking of Markers and Natural Features",
"normalizedTitle": "Registration for Stereo Vision-Based Augmented Reality Based on Extendible Tracking of Markers and Natural Features",
"abstract": "This paper describes a method to extend the registration range of a vision-based augmented reality (AR) system. We propose to use natural feature points contained in images captured by a pair of stereo cameras in conjunction with pre-defined fixed fiducial markers. The system also incorporates an inertial sensor to achieve a robust registration method which can handle user?s fast head rotation and movement. The system first uses pre-defined fiducial markers to estimate a projection matrix between real and virtual coordinate systems. At the same time, the system picks up and tracks a set of natural feature points from the initial image. As a user moves around in an AR environment, the initial markers fall out from the camera frame and natural features are then used to recover the projection matrix. Experiments for evaluating the feasibility of the method are carried out and show the potential benefits of the method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper describes a method to extend the registration range of a vision-based augmented reality (AR) system. We propose to use natural feature points contained in images captured by a pair of stereo cameras in conjunction with pre-defined fixed fiducial markers. The system also incorporates an inertial sensor to achieve a robust registration method which can handle user?s fast head rotation and movement. The system first uses pre-defined fiducial markers to estimate a projection matrix between real and virtual coordinate systems. At the same time, the system picks up and tracks a set of natural feature points from the initial image. As a user moves around in an AR environment, the initial markers fall out from the camera frame and natural features are then used to recover the projection matrix. Experiments for evaluating the feasibility of the method are carried out and show the potential benefits of the method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper describes a method to extend the registration range of a vision-based augmented reality (AR) system. We propose to use natural feature points contained in images captured by a pair of stereo cameras in conjunction with pre-defined fixed fiducial markers. The system also incorporates an inertial sensor to achieve a robust registration method which can handle user?s fast head rotation and movement. The system first uses pre-defined fiducial markers to estimate a projection matrix between real and virtual coordinate systems. At the same time, the system picks up and tracks a set of natural feature points from the initial image. As a user moves around in an AR environment, the initial markers fall out from the camera frame and natural features are then used to recover the projection matrix. Experiments for evaluating the feasibility of the method are carried out and show the potential benefits of the method.",
"fno": "169521045",
"keywords": [],
"authors": [
{
"affiliation": "Nara Institute of Science and Technology",
"fullName": "Masayuki Kanbara",
"givenName": "Masayuki",
"surname": "Kanbara",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nara Institute of Science and Technology",
"fullName": "Naokazu Yokoya",
"givenName": "Naokazu",
"surname": "Yokoya",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Osaka University",
"fullName": "Haruo Takemura",
"givenName": "Haruo",
"surname": "Takemura",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-08-01T00:00:00",
"pubType": "proceedings",
"pages": "21045",
"year": "2002",
"issn": "1051-4651",
"isbn": "0-7695-1695-X",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "169521041",
"articleId": "12OmNAS9zGh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "169521049",
"articleId": "12OmNBAqZHi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2015/6886/0/07131765",
"title": "Spatially-multiplexed MIMO markers",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2015/07131765/12OmNB836Ih",
"parentPublication": {
"id": "proceedings/3dui/2015/6886/0",
"title": "2015 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2007/1749/0/04538857",
"title": "Visually Elegant and Robust Semi-Fiducials for Geometric Registration in Mixed Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2007/04538857/12OmNCgrD4p",
"parentPublication": {
"id": "proceedings/ismar/2007/1749/0",
"title": "2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2014/4261/0/4261a096",
"title": "A Comparative Study of Matching Algorithms for Natural Markers",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2014/4261a096/12OmNx9WT24",
"parentPublication": {
"id": "proceedings/svr/2014/4261/0",
"title": "2014 XVI Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fit/2014/7505/0/7505a269",
"title": "Classification of Markers in the ARTool Kit Library to Reduce Inter-marker Confusion",
"doi": null,
"abstractUrl": "/proceedings-article/fit/2014/7505a269/12OmNxvwoVo",
"parentPublication": {
"id": "proceedings/fit/2014/7505/0",
"title": "2014 12th International Conference on Frontiers of Information Technology (FIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2011/2183/0/06092394",
"title": "Deformable random dot markers",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2011/06092394/12OmNyS6RGK",
"parentPublication": {
"id": "proceedings/ismar/2011/2183/0",
"title": "2011 10th IEEE International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2012/0233/0/06163037",
"title": "Mutual occlusion between real and virtual elements in Augmented Reality based on fiducial markers",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2012/06163037/12OmNynsbwT",
"parentPublication": {
"id": "proceedings/wacv/2012/0233/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vsmm/2001/1402/0/14020455",
"title": "A Stereo Vision-Based Augmented Reality System with Marker and Natural Feature Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/vsmm/2001/14020455/12OmNzwHv9L",
"parentPublication": {
"id": "proceedings/vsmm/2001/1402/0",
"title": "Proceedings Seventh International Conference on Virtual Systems and MultiMedia Enhanced Realities: Augmented and Unplugged",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0569",
"title": "Registration Using Natural Features for Augmented Reality Systems",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0569/13rRUxBJhFn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2018/1360/0/136000a768",
"title": "Landmark-less Registration of Craniomaxillofacial Images Acquired for 3D Photography and CBCT",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2018/136000a768/1gjRpvPERuo",
"parentPublication": {
"id": "proceedings/csci/2018/1360/0",
"title": "2018 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqJ8taA",
"title": "Augmented Reality, International Workshop on",
"acronym": "iwar",
"groupId": "1000063",
"volume": "0",
"displayVolume": "0",
"year": "1999",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBkfRhh",
"doi": "10.1109/IWAR.1999.803811",
"title": "Registration with a Zoom Lens Camera for Augmented Reality Applications",
"normalizedTitle": "Registration with a Zoom Lens Camera for Augmented Reality Applications",
"abstract": "We focus in this paper on the problem of adding computer-generated objects in video sequences that have been shot with a zoom lens camera. While numerous papers have been devoted to registration with fixed focal length, little attention has been brought to zoom lens cameras. In this paper, we propose an efficient two-stage algorithm for handling zoom changing which are are likely to happen in a video sequence. We first attempt to partition the video into camera motions and zoom variations. Then, classical registration methods are used on the image frames labeled \"camera motion\" while keeping the internal parameters constant, whereas the zoom parameters are only updated for the frames labeled \"zoom variations\". Results are presented demonstrating registration on various sequences. Augmented video sequences are also shown.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We focus in this paper on the problem of adding computer-generated objects in video sequences that have been shot with a zoom lens camera. While numerous papers have been devoted to registration with fixed focal length, little attention has been brought to zoom lens cameras. In this paper, we propose an efficient two-stage algorithm for handling zoom changing which are are likely to happen in a video sequence. We first attempt to partition the video into camera motions and zoom variations. Then, classical registration methods are used on the image frames labeled \"camera motion\" while keeping the internal parameters constant, whereas the zoom parameters are only updated for the frames labeled \"zoom variations\". Results are presented demonstrating registration on various sequences. Augmented video sequences are also shown.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We focus in this paper on the problem of adding computer-generated objects in video sequences that have been shot with a zoom lens camera. While numerous papers have been devoted to registration with fixed focal length, little attention has been brought to zoom lens cameras. In this paper, we propose an efficient two-stage algorithm for handling zoom changing which are are likely to happen in a video sequence. We first attempt to partition the video into camera motions and zoom variations. Then, classical registration methods are used on the image frames labeled \"camera motion\" while keeping the internal parameters constant, whereas the zoom parameters are only updated for the frames labeled \"zoom variations\". Results are presented demonstrating registration on various sequences. Augmented video sequences are also shown.",
"fno": "03590103",
"keywords": [
"Augmented Reality",
"Vision Based Registration",
"Zoom Lens Camera"
],
"authors": [
{
"affiliation": "LORIA",
"fullName": "Gilles Simon",
"givenName": "Gilles",
"surname": "Simon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LORIA",
"fullName": "Marie-Odile Berger",
"givenName": "Marie-Odile",
"surname": "Berger",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iwar",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1999-10-01T00:00:00",
"pubType": "proceedings",
"pages": "103",
"year": "1999",
"issn": null,
"isbn": "0-7695-0359-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "03590095",
"articleId": "12OmNyQGRY2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "03590115",
"articleId": "12OmNqNG3km",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyqRn7h",
"title": "Proceedings. International Symposium on Mixed and Augmented Reality",
"acronym": "ismar",
"groupId": "1000465",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvDqsP9",
"doi": "10.1109/ISMAR.2002.1115123",
"title": "Online 6 DOF Augmented Reality Registration from Natural Features",
"normalizedTitle": "Online 6 DOF Augmented Reality Registration from Natural Features",
"abstract": "We present a complete scalable system for 6 d.o.f. camera tracking based on natural features. Crucially, the calculation is based only on pre-captured reference images and previous estimates of the camera pose and is hence suitable for online applications. We match natural features in the current frame to two spatially separated reference images. We overcome the wide baseline matching problem by matching to the previous frame and transferring point positions to the reference images. We then minimize deviations from the two-view and three-view constraints between the reference images and the current frame as a function of the camera position parameters. We stabilize this calculation using a recursive form of temporal regularization that is similar in spirit to the Kalman filter. We can track camera pose over hundreds of frames and realistically integrate virtual objects with only slight jitter.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a complete scalable system for 6 d.o.f. camera tracking based on natural features. Crucially, the calculation is based only on pre-captured reference images and previous estimates of the camera pose and is hence suitable for online applications. We match natural features in the current frame to two spatially separated reference images. We overcome the wide baseline matching problem by matching to the previous frame and transferring point positions to the reference images. We then minimize deviations from the two-view and three-view constraints between the reference images and the current frame as a function of the camera position parameters. We stabilize this calculation using a recursive form of temporal regularization that is similar in spirit to the Kalman filter. We can track camera pose over hundreds of frames and realistically integrate virtual objects with only slight jitter.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a complete scalable system for 6 d.o.f. camera tracking based on natural features. Crucially, the calculation is based only on pre-captured reference images and previous estimates of the camera pose and is hence suitable for online applications. We match natural features in the current frame to two spatially separated reference images. We overcome the wide baseline matching problem by matching to the previous frame and transferring point positions to the reference images. We then minimize deviations from the two-view and three-view constraints between the reference images and the current frame as a function of the camera position parameters. We stabilize this calculation using a recursive form of temporal regularization that is similar in spirit to the Kalman filter. We can track camera pose over hundreds of frames and realistically integrate virtual objects with only slight jitter.",
"fno": "17810305",
"keywords": [
"Augmented Reality",
"Natural Feature Tracking",
"Visual Registration",
"Camera Pose Estimation"
],
"authors": [
{
"affiliation": "National University of Singapore",
"fullName": "Kar Wee Chia",
"givenName": "Kar Wee",
"surname": "Chia",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National University of Singapore",
"fullName": "Adrian David Cheok",
"givenName": "Adrian David",
"surname": "Cheok",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National University of Singapore",
"fullName": "Simon J.D. Prince",
"givenName": "Simon J.D.",
"surname": "Prince",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ismar",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-09-01T00:00:00",
"pubType": "proceedings",
"pages": "305",
"year": "2002",
"issn": null,
"isbn": "0-7695-1781-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "17810295",
"articleId": "12OmNwoxSap",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "17810317",
"articleId": "12OmNvTjZSz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2011/0394/0/05995464",
"title": "A novel parametrization of the perspective-three-point problem for a direct computation of absolute camera position and orientation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995464/12OmNAle6qp",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2000/0743/0/07430499",
"title": "Video-Based Camera Registration for Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2000/07430499/12OmNAm4TGk",
"parentPublication": {
"id": "proceedings/iv/2000/0743/0",
"title": "2000 IEEE Conference on Information Visualization. An International Conference on Computer Visualization and Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwar/1999/0359/0/03590103",
"title": "Registration with a Zoom Lens Camera for Augmented Reality Applications",
"doi": null,
"abstractUrl": "/proceedings-article/iwar/1999/03590103/12OmNBkfRhh",
"parentPublication": {
"id": "proceedings/iwar/1999/0359/0",
"title": "Augmented Reality, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrais/1995/7084/0/70840189",
"title": "Dynamic registration correction in augmented-reality systems",
"doi": null,
"abstractUrl": "/proceedings-article/vrais/1995/70840189/12OmNz5JBYV",
"parentPublication": {
"id": "proceedings/vrais/1995/7084/0",
"title": "Virtual Reality Annual International Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2010/3984/0/3984a398",
"title": "Interactive Manipulation of Augmented Objects in Marker-Less AR Using Vision-Based Hand Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2010/3984a398/12OmNznkJTM",
"parentPublication": {
"id": "proceedings/itng/2010/3984/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1995/05/mcg1995050052",
"title": "Dynamic Registration Correction in Video-Based Augmented Reality Systems",
"doi": null,
"abstractUrl": "/magazine/cg/1995/05/mcg1995050052/13rRUIJcWfT",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/05/ttp2009050783",
"title": "Branch-and-Bound Methods for Euclidean Registration Problems",
"doi": null,
"abstractUrl": "/journal/tp/2009/05/ttp2009050783/13rRUwI5U3X",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/01/v0001",
"title": "Calibration-Free Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/1998/01/v0001/13rRUwgQpDb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0569",
"title": "Registration Using Natural Features for Augmented Reality Systems",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0569/13rRUxBJhFn",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/03/v0254",
"title": "Registration Based on Projective Reconstruction Technique for Augmented Reality Systems",
"doi": null,
"abstractUrl": "/journal/tg/2005/03/v0254/13rRUxlgxO9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzVGcIy",
"title": "Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "1997",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx0RIWi",
"doi": "10.1109/CVPR.1997.609345",
"title": "Projective registration with difference decomposition",
"normalizedTitle": "Projective registration with difference decomposition",
"abstract": "Current methods for registering image regions perform well for simple transformations or large image regions. The author presents a new method that is better able to handle small image regions as they deform with nonlinear transformations. He introduces difference decomposition, a novel approach to solving the registration problem. The method is a generalization of previous methods and can better handle nonlinear transforms. Although the methods are general, he focuses on projective transformations and introduces piecewise-projective transformations for modeling the motions of non-planar objects. He concludes with examples from a prototype implementation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Current methods for registering image regions perform well for simple transformations or large image regions. The author presents a new method that is better able to handle small image regions as they deform with nonlinear transformations. He introduces difference decomposition, a novel approach to solving the registration problem. The method is a generalization of previous methods and can better handle nonlinear transforms. Although the methods are general, he focuses on projective transformations and introduces piecewise-projective transformations for modeling the motions of non-planar objects. He concludes with examples from a prototype implementation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Current methods for registering image regions perform well for simple transformations or large image regions. The author presents a new method that is better able to handle small image regions as they deform with nonlinear transformations. He introduces difference decomposition, a novel approach to solving the registration problem. The method is a generalization of previous methods and can better handle nonlinear transforms. Although the methods are general, he focuses on projective transformations and introduces piecewise-projective transformations for modeling the motions of non-planar objects. He concludes with examples from a prototype implementation.",
"fno": "78220331",
"keywords": [
"Image Registration Projective Registration Difference Decomposition Image Region Registration Performance Image Transformations Nonlinear Transformations Piecewise Projective Transformations Nonplanar Object Motion Modeling Prototype Implementation"
],
"authors": [
{
"affiliation": "Apple Res. Labs., Cupertino, CA, USA",
"fullName": "M. Gleicher",
"givenName": "M.",
"surname": "Gleicher",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1997-06-01T00:00:00",
"pubType": "proceedings",
"pages": "331",
"year": "1997",
"issn": "1063-6919",
"isbn": "0-8186-7822-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "78220325",
"articleId": "12OmNASraBq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "78220338",
"articleId": "12OmNywxlQo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBqMDBD",
"title": "Proceedings IEEE Virtual Reality 2002",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNylboC4",
"doi": "10.1109/VR.2002.996508",
"title": "A Testbed for Precise Registration, Natural Occlusion and Interaction in an Augmented Environment Using a Head-Mounted Projective Display (HMPD)",
"normalizedTitle": "A Testbed for Precise Registration, Natural Occlusion and Interaction in an Augmented Environment Using a Head-Mounted Projective Display (HMPD)",
"abstract": "A head-mounted projective display (HMPD) consists of a pair of miniature projection lenses, beamsplitters, and displays mounted on the helmet and retro-reflective sheeting materials placed strategically in the environment. It has been recently proposed as an alternative to existing 3D visualization devices. In this paper, we first briefly review the HMPD technology, including its featured capabilities and the recent development in both display implementations and applications. Then the implementation of a testbed, namely \"playing 'GO' game with a remote opponent in a 3D augmented environment,\" is described. The testbed not only demonstrates the capabilities of virtual-real augmentation and registration, natural occlusion of virtual objects by real, interaction with augmented environments, as well as networking collaboration, but also embodies part of our long-term objective to develop a collaborative framework in 3D augmented environments. Through the testbed, major calibration issues, such as accommodation/convergence considerations and determination of viewing transformations, are studied and discussed in detail. Both calibration methods and results are included, which are applicable to other applications. Finally, experimental results of the testbed implementation are presented.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A head-mounted projective display (HMPD) consists of a pair of miniature projection lenses, beamsplitters, and displays mounted on the helmet and retro-reflective sheeting materials placed strategically in the environment. It has been recently proposed as an alternative to existing 3D visualization devices. In this paper, we first briefly review the HMPD technology, including its featured capabilities and the recent development in both display implementations and applications. Then the implementation of a testbed, namely \"playing 'GO' game with a remote opponent in a 3D augmented environment,\" is described. The testbed not only demonstrates the capabilities of virtual-real augmentation and registration, natural occlusion of virtual objects by real, interaction with augmented environments, as well as networking collaboration, but also embodies part of our long-term objective to develop a collaborative framework in 3D augmented environments. Through the testbed, major calibration issues, such as accommodation/convergence considerations and determination of viewing transformations, are studied and discussed in detail. Both calibration methods and results are included, which are applicable to other applications. Finally, experimental results of the testbed implementation are presented.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A head-mounted projective display (HMPD) consists of a pair of miniature projection lenses, beamsplitters, and displays mounted on the helmet and retro-reflective sheeting materials placed strategically in the environment. It has been recently proposed as an alternative to existing 3D visualization devices. In this paper, we first briefly review the HMPD technology, including its featured capabilities and the recent development in both display implementations and applications. Then the implementation of a testbed, namely \"playing 'GO' game with a remote opponent in a 3D augmented environment,\" is described. The testbed not only demonstrates the capabilities of virtual-real augmentation and registration, natural occlusion of virtual objects by real, interaction with augmented environments, as well as networking collaboration, but also embodies part of our long-term objective to develop a collaborative framework in 3D augmented environments. Through the testbed, major calibration issues, such as accommodation/convergence considerations and determination of viewing transformations, are studied and discussed in detail. Both calibration methods and results are included, which are applicable to other applications. Finally, experimental results of the testbed implementation are presented.",
"fno": "14920081",
"keywords": [
"Head Mounted Projective Display HMPD",
"Head Mounted Display HMD",
"Augmented Reality AR",
"Augmented Environment AE",
"Remote Collaboration"
],
"authors": [
{
"affiliation": "University of Illinois at Urbana-Champaign",
"fullName": "Hong Hua",
"givenName": "Hong",
"surname": "Hua",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Illinois at Urbana-Champaign",
"fullName": "Chunyu Gao",
"givenName": "Chunyu",
"surname": "Gao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Illinois at Urbana-Champaign",
"fullName": "Leonard D. Brown",
"givenName": "Leonard D.",
"surname": "Brown",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Illinois at Urbana-Champaign",
"fullName": "Narendra Ahuja",
"givenName": "Narendra",
"surname": "Ahuja",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Central Florida",
"fullName": "Jannick P. Rolland",
"givenName": "Jannick P.",
"surname": "Rolland",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-03-01T00:00:00",
"pubType": "proceedings",
"pages": "81",
"year": "2002",
"issn": "1087-8270",
"isbn": "0-7695-1492-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "14920073",
"articleId": "12OmNqIhG6b",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "14920093",
"articleId": "12OmNAi6vVS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqAU6tm",
"title": "Intelligent Systems Design and Applications, International Conference on",
"acronym": "isda",
"groupId": "1001454",
"volume": "1",
"displayVolume": "1",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwudQRk",
"doi": "10.1109/ISDA.2008.109",
"title": "Fuzzy Assessment for Sampling Survey Defuzzification by Signed Distance Method",
"normalizedTitle": "Fuzzy Assessment for Sampling Survey Defuzzification by Signed Distance Method",
"abstract": "Traditional sampling survey via questionnaire is difficult in reflecting interviewee's incomplete assessment and uncertain thought. Therefore, if we can use fuzzy sense of sampling to express the degree of interviewee's feelings based on his own concept, the result will be closer to interviewee's real thought. In this study, a new method for the defuzzification of fuzzy assessment for sampling survey is developed in this paper. We propose a model to do aggregative assessment for sampling survey by signed distance method with the linear order character of symmetric fuzzy linguistics. The proposed fuzzy assessment method on sampling survey analysis is easily to assess the sampling survey and make the aggregative evaluation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Traditional sampling survey via questionnaire is difficult in reflecting interviewee's incomplete assessment and uncertain thought. Therefore, if we can use fuzzy sense of sampling to express the degree of interviewee's feelings based on his own concept, the result will be closer to interviewee's real thought. In this study, a new method for the defuzzification of fuzzy assessment for sampling survey is developed in this paper. We propose a model to do aggregative assessment for sampling survey by signed distance method with the linear order character of symmetric fuzzy linguistics. The proposed fuzzy assessment method on sampling survey analysis is easily to assess the sampling survey and make the aggregative evaluation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Traditional sampling survey via questionnaire is difficult in reflecting interviewee's incomplete assessment and uncertain thought. Therefore, if we can use fuzzy sense of sampling to express the degree of interviewee's feelings based on his own concept, the result will be closer to interviewee's real thought. In this study, a new method for the defuzzification of fuzzy assessment for sampling survey is developed in this paper. We propose a model to do aggregative assessment for sampling survey by signed distance method with the linear order character of symmetric fuzzy linguistics. The proposed fuzzy assessment method on sampling survey analysis is easily to assess the sampling survey and make the aggregative evaluation.",
"fno": "3382a626",
"keywords": [
"Signed Distance Method",
"Sampling Survey",
"Fuzzy Assessment"
],
"authors": [
{
"affiliation": null,
"fullName": "Lily Lin",
"givenName": "Lily",
"surname": "Lin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Huey-Ming Lee",
"givenName": "Huey-Ming",
"surname": "Lee",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isda",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-11-01T00:00:00",
"pubType": "proceedings",
"pages": "626-630",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3382-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3382a622",
"articleId": "12OmNxX3uJt",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3382a631",
"articleId": "12OmNBWzHPh",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fie/2004/8552/0/01408641",
"title": "Comparing alumni survey data over time to close the assessment loop",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2004/01408641/12OmNBIWXBn",
"parentPublication": {
"id": "proceedings/fie/2004/8552/0",
"title": "34th Annual Frontiers in Education, 2004. FIE 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2010/4108/0/4108b202",
"title": "CUDA-based Signed Distance Field Calculation for Adaptive Grids",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2010/4108b202/12OmNCwlagS",
"parentPublication": {
"id": "proceedings/cit/2010/4108/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fit/2011/4625/0/4625a025",
"title": "Assessment and Support for Software Capstone Projects at the Undergraduate Level: A Survey and Rubrics",
"doi": null,
"abstractUrl": "/proceedings-article/fit/2011/4625a025/12OmNxWcHdM",
"parentPublication": {
"id": "proceedings/fit/2011/4625/0",
"title": "Frontiers of Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b579",
"title": "A Model on Sampling Rate of OD Survey",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b579/12OmNxy4MYa",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2012/2310/0/06468679",
"title": "Natural disaster information statistics study based on stratified random sampling survey statistical methods",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2012/06468679/12OmNy6Zs0y",
"parentPublication": {
"id": "proceedings/grc/2012/2310/0",
"title": "2012 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2008/3161/0/31610150",
"title": "Aggregative Assessment Method for Sampling Survey with the Linear Order Character of Symmetric Fuzzy Linguistics",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2008/31610150/12OmNyz5JYP",
"parentPublication": {
"id": "proceedings/icicic/2008/3161/0",
"title": "Innovative Computing ,Information and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/03/v0243",
"title": "Signed Distance Computation Using the Angle Weighted Pseudonormal",
"doi": null,
"abstractUrl": "/journal/tg/2005/03/v0243/13rRUxYINf3",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2018/5321/0/08499064",
"title": "Active Sampling for Subjective Video Quality Assessment",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2018/08499064/17D45W1Oa5A",
"parentPublication": {
"id": "proceedings/bigmm/2018/5321/0",
"title": "2018 IEEE Fourth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2023/02/10042090",
"title": "A Survey on Deep Learning Resilience Assessment Methodologies",
"doi": null,
"abstractUrl": "/magazine/co/2023/02/10042090/1KEtnn3CTQI",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2019/5584/0/558400b306",
"title": "Approximate Quality Assessment with Sampling Approaches",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2019/558400b306/1jdDPsfB6Xm",
"parentPublication": {
"id": "proceedings/csci/2019/5584/0",
"title": "2019 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvk7JJV",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"acronym": "icmtma",
"groupId": "1002837",
"volume": "1",
"displayVolume": "1",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzaQoA8",
"doi": "10.1109/ICMTMA.2011.27",
"title": "A Laser Distance Tracking 3D Coordinate Vision Measuring System",
"normalizedTitle": "A Laser Distance Tracking 3D Coordinate Vision Measuring System",
"abstract": "A laser distance tracking 3D coordinates vision measuring system is proposed. It mainly consists of a CCD camera, a laser rangefinder, a computer and a light pen. When measuring, the CCD camera registers the direction of every light-reflecting point mounted on the light pen. According to these measured directions, the laser rangefinder can track and capture each light-reflecting point, and record the distance between one of the four light-reflecting points and the laser rangefinder. Using the measured directions and distance, the system can calculate the 3D coordinates of the point touched by the pen-point. Based on the perspective n-point problem principle, the system mathematic model is established. By introducing the distance parameter, this model can be solved linearly, and its solution is unique. On the basis of the redundancy technology, the 3D coordinates analytic equations of the measured point and its solving method are given. Compared with the single CCD camera coordinates measuring system, experiment result shows that this system measuring stability precision is 0.336mm, 0.031mm and 0.011mm higher than that of the former in the direction of Z, Y, X axis respectively.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A laser distance tracking 3D coordinates vision measuring system is proposed. It mainly consists of a CCD camera, a laser rangefinder, a computer and a light pen. When measuring, the CCD camera registers the direction of every light-reflecting point mounted on the light pen. According to these measured directions, the laser rangefinder can track and capture each light-reflecting point, and record the distance between one of the four light-reflecting points and the laser rangefinder. Using the measured directions and distance, the system can calculate the 3D coordinates of the point touched by the pen-point. Based on the perspective n-point problem principle, the system mathematic model is established. By introducing the distance parameter, this model can be solved linearly, and its solution is unique. On the basis of the redundancy technology, the 3D coordinates analytic equations of the measured point and its solving method are given. Compared with the single CCD camera coordinates measuring system, experiment result shows that this system measuring stability precision is 0.336mm, 0.031mm and 0.011mm higher than that of the former in the direction of Z, Y, X axis respectively.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A laser distance tracking 3D coordinates vision measuring system is proposed. It mainly consists of a CCD camera, a laser rangefinder, a computer and a light pen. When measuring, the CCD camera registers the direction of every light-reflecting point mounted on the light pen. According to these measured directions, the laser rangefinder can track and capture each light-reflecting point, and record the distance between one of the four light-reflecting points and the laser rangefinder. Using the measured directions and distance, the system can calculate the 3D coordinates of the point touched by the pen-point. Based on the perspective n-point problem principle, the system mathematic model is established. By introducing the distance parameter, this model can be solved linearly, and its solution is unique. On the basis of the redundancy technology, the 3D coordinates analytic equations of the measured point and its solving method are given. Compared with the single CCD camera coordinates measuring system, experiment result shows that this system measuring stability precision is 0.336mm, 0.031mm and 0.011mm higher than that of the former in the direction of Z, Y, X axis respectively.",
"fno": "4296a083",
"keywords": [
"Tracking Distance Measuremen",
"3 D Coordinates Vision Measurement",
"Perspective N Point Problem Pn P",
"Redundancy Technology"
],
"authors": [
{
"affiliation": null,
"fullName": "Li Baozhang",
"givenName": "Li",
"surname": "Baozhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Huang Fengshan",
"givenName": "Huang",
"surname": "Fengshan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icmtma",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-01-01T00:00:00",
"pubType": "proceedings",
"pages": "83-87",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4296-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4296a078",
"articleId": "12OmNwp74D3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4296a088",
"articleId": "12OmNwB2dTp",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isdea/2010/8333/2/05743412",
"title": "Research on Measuring the Surface Texture Based on Laser Light Scattering Method",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2010/05743412/12OmNAoUT4h",
"parentPublication": {
"id": "proceedings/isdea/2010/8333/2",
"title": "2010 International Conference on Intelligent System Design and Engineering Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csa/2015/9961/0/9961a052",
"title": "A Seam Deviation Real-Time Detection Method Based on Laser Vision Technology",
"doi": null,
"abstractUrl": "/proceedings-article/csa/2015/9961a052/12OmNCbkQDo",
"parentPublication": {
"id": "proceedings/csa/2015/9961/0",
"title": "2015 International Conference on Computer Science and Applications (CSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdciem/2011/4350/0/4350a265",
"title": "Research on Estimation of Trees Crown Volume by 3D Laser Scanning System",
"doi": null,
"abstractUrl": "/proceedings-article/cdciem/2011/4350a265/12OmNvUaNqF",
"parentPublication": {
"id": "proceedings/cdciem/2011/4350/0",
"title": "Computer Distributed Control and Intelligent Environmental Monitoring, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2011/4455/0/4455a878",
"title": "Real-Time Measuring the Distance between Laser's Mouth and Workpiece",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2011/4455a878/12OmNvjyxtJ",
"parentPublication": {
"id": "proceedings/icdma/2011/4455/0",
"title": "2011 Second International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2009/3883/0/3883a790",
"title": "Investigation of Ice Shape Measurement Technique Based on Laser Sheet and Machine Vision in Icing Wind Tunnel",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2009/3883a790/12OmNwCsdEb",
"parentPublication": {
"id": "proceedings/icig/2009/3883/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ettandgrs/2008/3563/2/3563b320",
"title": "Quality Evaluation of Spatial Point-Cloud Data Collected by Vehicle-Borne Laser Scanner",
"doi": null,
"abstractUrl": "/proceedings-article/ettandgrs/2008/3563b320/12OmNy7yEmh",
"parentPublication": {
"id": "ettandgrs/2008/3563/2",
"title": "Education Technology and Training & Geoscience and Remote Sensing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisp/2008/3119/2/3119b349",
"title": "Cultural Relic 3D Reconstruction from Digital Images and Laser Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119b349/12OmNzvQHS4",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/3",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1993/03/mcg1993030015",
"title": "White Laser, Synced Scan (3D Scanner)",
"doi": null,
"abstractUrl": "/magazine/cg/1993/03/mcg1993030015/13rRUwbs258",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2012/11/ttp2012112097",
"title": "A Minimal Solution for the Extrinsic Calibration of a Camera and a Laser-Rangefinder",
"doi": null,
"abstractUrl": "/journal/tp/2012/11/ttp2012112097/13rRUy0HYL1",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icceai/2021/3960/0/396000a427",
"title": "Target Locating of Robots Based on the Fusion of Binocular Vision and Laser Scanning",
"doi": null,
"abstractUrl": "/proceedings-article/icceai/2021/396000a427/1xqyMMYIp56",
"parentPublication": {
"id": "proceedings/icceai/2021/3960/0",
"title": "2021 International Conference on Computer Engineering and Artificial Intelligence (ICCEAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKir6",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45XH89nC",
"doi": "10.1109/ICPR.2018.8546138",
"title": "Confocal Ellipse-based Distance and Confocal Elliptical Field for polygonal shapes",
"normalizedTitle": "Confocal Ellipse-based Distance and Confocal Elliptical Field for polygonal shapes",
"abstract": "The paper introduces a novel confocal ellipse-based distance (CED), that is based on the properties of the confocal ellipses. This distance is used to produce a confocal elliptical field (CEF). The Euclidean Distance Transform (EDT) of a single point (called seed) generates a distance field of concentric circles. The sum of two such distance fields of two distinct seed points produces a distance field of confocal ellipses. This fact enables to adapt CED and CEF to the discrete case, referred to as CED-DT and CEF-DT. The properties of the CEF and CEF-DT make them useful for skeletonization, in particular for efficient removal of the spurious branches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The paper introduces a novel confocal ellipse-based distance (CED), that is based on the properties of the confocal ellipses. This distance is used to produce a confocal elliptical field (CEF). The Euclidean Distance Transform (EDT) of a single point (called seed) generates a distance field of concentric circles. The sum of two such distance fields of two distinct seed points produces a distance field of confocal ellipses. This fact enables to adapt CED and CEF to the discrete case, referred to as CED-DT and CEF-DT. The properties of the CEF and CEF-DT make them useful for skeletonization, in particular for efficient removal of the spurious branches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The paper introduces a novel confocal ellipse-based distance (CED), that is based on the properties of the confocal ellipses. This distance is used to produce a confocal elliptical field (CEF). The Euclidean Distance Transform (EDT) of a single point (called seed) generates a distance field of concentric circles. The sum of two such distance fields of two distinct seed points produces a distance field of confocal ellipses. This fact enables to adapt CED and CEF to the discrete case, referred to as CED-DT and CEF-DT. The properties of the CEF and CEF-DT make them useful for skeletonization, in particular for efficient removal of the spurious branches.",
"fno": "08546138",
"keywords": [
"Image Segmentation",
"Image Thinning",
"Transforms",
"Novel Confocal Ellipse Based Distance",
"Confocal Elliptical Field",
"Euclidean Distance Transform",
"Distance Field",
"Distinct Seed Points",
"CEF DT",
"Polygonal Shapes",
"Concentric Circles",
"Skeletonization",
"Spurious Branches",
"Shape",
"Skeleton",
"Transforms",
"Image Processing",
"Euclidean Distance",
"Two Dimensional Displays",
"Pattern Recognition"
],
"authors": [
{
"affiliation": "Pattern Recognition and Image Processing group, Technische Universität Wien, Vienna, Austria",
"fullName": "Aysylu Gabdulkhakova",
"givenName": "Aysylu",
"surname": "Gabdulkhakova",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pattern Recognition and Image Processing group, Technische Universität Wien, Vienna, Austria",
"fullName": "Walter G. Kropatsch",
"givenName": "Walter G.",
"surname": "Kropatsch",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-08-01T00:00:00",
"pubType": "proceedings",
"pages": "3025-3030",
"year": "2018",
"issn": "1051-4651",
"isbn": "978-1-5386-3788-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08545222",
"articleId": "17D45WZZ7HM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08545684",
"articleId": "17D45WHONrt",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ipps/1996/7255/0/72550424",
"title": "The chessboard distance transform and the medial axis transform are interchangeable",
"doi": null,
"abstractUrl": "/proceedings-article/ipps/1996/72550424/12OmNBpVQc0",
"parentPublication": {
"id": "proceedings/ipps/1996/7255/0",
"title": "Parallel Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1987/5428/0/04568252",
"title": "Delaunay graphs are almost as good as complete graphs",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1987/04568252/12OmNCctfcB",
"parentPublication": {
"id": "proceedings/focs/1987/5428/0",
"title": "28th Annual Symposium on Foundations of Computer Science (sfcs 1987)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2011/0529/0/05981692",
"title": "Efficient nonlinear DTI registration using DCT basis functions",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2011/05981692/12OmNvRU0jv",
"parentPublication": {
"id": "proceedings/cvprw/2011/0529/0",
"title": "CVPR 2011 WORKSHOPS",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1994/6265/1/00576381",
"title": "Using polyballs to approximate shapes and skeletons",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00576381/12OmNwDACpP",
"parentPublication": {
"id": "proceedings/icpr/1994/6265/1",
"title": "Proceedings of 12th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109a237",
"title": "Incremental Distance Transforms (IDT)",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a237/12OmNxFaLv6",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2017/0560/0/08026258",
"title": "A distance transform based tip point detection method for neurons in confocal microscopy images",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2017/08026258/12OmNzmLxU6",
"parentPublication": {
"id": "proceedings/icmew/2017/0560/0",
"title": "2017 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/03/i0437",
"title": "Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension",
"doi": null,
"abstractUrl": "/journal/tp/2007/03/i0437/13rRUNvyaac",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/11/06717981",
"title": "Fast Exact Euclidean Distance (FEED): A New Class of Adaptable Distance Transforms",
"doi": null,
"abstractUrl": "/journal/tp/2014/11/06717981/13rRUwdIOW2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1996/11/i1055",
"title": "On the Generation of Skeletons from Discrete Euclidean Distance Maps",
"doi": null,
"abstractUrl": "/journal/tp/1996/11/i1055/13rRUx0gegc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2003/02/i0265",
"title": "A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions",
"doi": null,
"abstractUrl": "/journal/tp/2003/02/i0265/13rRUygT7gf",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1H1gVMlkl32",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1H1lZAsxk2Y",
"doi": "10.1109/CVPR52688.2022.01874",
"title": "Representing 3D Shapes with Probabilistic Directed Distance Fields",
"normalizedTitle": "Representing 3D Shapes with Probabilistic Directed Distance Fields",
"abstract": "Differentiable rendering is an essential operation in modern vision, allowing inverse graphics approaches to 3D understanding to be utilized in modern machine learning frameworks. Explicit shape representations (voxels, point clouds, or meshes), while relatively easily rendered, often suffer from limited geometric fidelity or topological con-straints. On the other hand, implicit representations (occu-pancy, distance, or radiance fields) preserve greater fidelity, but suffer from complex or inefficient rendering processes, limiting scalability. In this work, we endeavour to address both shortcomings with a novel shape representation that allows fast differentiable rendering within an implicit ar-chitecture. Building on implicit distance representations, we define Directed Distance Fields (DDFs), which map an oriented point (position and direction) to surface visibility and depth. Such a field can render a depth map with a single forward pass per pixel, enable differential surface geometry extraction (e.g., surface normals and curvatures) via network derivatives, be easily composed, and permit extraction of classical unsigned distance fields. Using probabilistic DDFs (PDDFs), we show how to model inherent discontinuities in the underlying field. Finally, we apply our method to fitting single shapes, unpaired 3D-aware generative image modelling, and single-image 3D reconstruction tasks, showcasing strong performance with simple architectural components via the versatility of our representation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Differentiable rendering is an essential operation in modern vision, allowing inverse graphics approaches to 3D understanding to be utilized in modern machine learning frameworks. Explicit shape representations (voxels, point clouds, or meshes), while relatively easily rendered, often suffer from limited geometric fidelity or topological con-straints. On the other hand, implicit representations (occu-pancy, distance, or radiance fields) preserve greater fidelity, but suffer from complex or inefficient rendering processes, limiting scalability. In this work, we endeavour to address both shortcomings with a novel shape representation that allows fast differentiable rendering within an implicit ar-chitecture. Building on implicit distance representations, we define Directed Distance Fields (DDFs), which map an oriented point (position and direction) to surface visibility and depth. Such a field can render a depth map with a single forward pass per pixel, enable differential surface geometry extraction (e.g., surface normals and curvatures) via network derivatives, be easily composed, and permit extraction of classical unsigned distance fields. Using probabilistic DDFs (PDDFs), we show how to model inherent discontinuities in the underlying field. Finally, we apply our method to fitting single shapes, unpaired 3D-aware generative image modelling, and single-image 3D reconstruction tasks, showcasing strong performance with simple architectural components via the versatility of our representation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Differentiable rendering is an essential operation in modern vision, allowing inverse graphics approaches to 3D understanding to be utilized in modern machine learning frameworks. Explicit shape representations (voxels, point clouds, or meshes), while relatively easily rendered, often suffer from limited geometric fidelity or topological con-straints. On the other hand, implicit representations (occu-pancy, distance, or radiance fields) preserve greater fidelity, but suffer from complex or inefficient rendering processes, limiting scalability. In this work, we endeavour to address both shortcomings with a novel shape representation that allows fast differentiable rendering within an implicit ar-chitecture. Building on implicit distance representations, we define Directed Distance Fields (DDFs), which map an oriented point (position and direction) to surface visibility and depth. Such a field can render a depth map with a single forward pass per pixel, enable differential surface geometry extraction (e.g., surface normals and curvatures) via network derivatives, be easily composed, and permit extraction of classical unsigned distance fields. Using probabilistic DDFs (PDDFs), we show how to model inherent discontinuities in the underlying field. Finally, we apply our method to fitting single shapes, unpaired 3D-aware generative image modelling, and single-image 3D reconstruction tasks, showcasing strong performance with simple architectural components via the versatility of our representation.",
"fno": "694600t9321",
"keywords": [
"Computer Vision",
"Image Reconstruction",
"Image Representation",
"Learning Artificial Intelligence",
"Rendering Computer Graphics",
"Solid Modelling",
"Explicit Shape Representations",
"Point Clouds",
"Geometric Fidelity",
"Implicit Representations",
"Complex Rendering Processes",
"Inefficient Rendering Processes",
"Shape Representation",
"Fast Differentiable Rendering",
"Implicit Distance Representations",
"Depth Map",
"Differential Surface Geometry Extraction",
"Surface Normals",
"Probabilistic DD Fs",
"3 D Aware Generative Image Modelling",
"Single Image 3 D Reconstruction Tasks",
"3 D Shape Representation",
"Probabilistic Directed Distance Fields",
"Inverse Graphics Approaches",
"Machine Learning Framework",
"Surface Reconstruction",
"Solid Modeling",
"Three Dimensional Displays",
"Shape",
"Scalability",
"Rendering Computer Graphics",
"Probabilistic Logic",
"Representation Learning 3 D From Single Images Segmentation",
"Grouping And Shape Analysis Vision Graphics"
],
"authors": [
{
"affiliation": "Samsung AI Centre Toronto",
"fullName": "Tristan Aumentado-Armstrong",
"givenName": "Tristan",
"surname": "Aumentado-Armstrong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Samsung AI Centre Toronto",
"fullName": "Stavros Tsogkas",
"givenName": "Stavros",
"surname": "Tsogkas",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Samsung AI Centre Toronto",
"fullName": "Sven Dickinson",
"givenName": "Sven",
"surname": "Dickinson",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Samsung AI Centre Toronto",
"fullName": "Allan Jepson",
"givenName": "Allan",
"surname": "Jepson",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "19321-19332",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1H1lZwGDQRO",
"name": "pcvpr202269460-09878913s1-mm_694600t9321.zip",
"size": "10.8 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202269460-09878913s1-mm_694600t9321.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "694600t9311",
"articleId": "1H1iHl2iyEo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600t9333",
"articleId": "1H0LzpvsrTi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1989/1952/0/00037894",
"title": "Representing and comparing shapes using shape polynomials",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1989/00037894/12OmNCctf8S",
"parentPublication": {
"id": "proceedings/cvpr/1989/1952/0",
"title": "1989 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200f569",
"title": "UNISURF: Unifying Neural Implicit Surfaces and Radiance Fields for Multi-View Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200f569/1BmEEU96fmg",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200g505",
"title": "Learning Signed Distance Field for Multi-view Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g505/1BmFLjuiAKs",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09845414",
"title": "Controllable Free Viewpoint Video Reconstruction Based on Neural Radiance Fields and Motion Graphs",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09845414/1Fu4IsDCz72",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600f595",
"title": "SelfRecon: Self Reconstruction Your Digital Avatar from Monocular Video",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600f595/1H0NDIYvq0g",
"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/wacv/2023/9346/0/934600e319",
"title": "Recovering Fine Details for Neural Implicit Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600e319/1KxUSVbk6He",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b248",
"title": "SDFDiff: Differentiable Rendering of Signed Distance Fields for 3D Shape Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b248/1m3nwOmON4Q",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800d501",
"title": "Differentiable Volumetric Rendering: Learning Implicit 3D Representations Without 3D Supervision",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800d501/1m3nwXQXEAw",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800c562",
"title": "SAL: Sign Agnostic Learning of Shapes From Raw Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c562/1m3o8t6Fe9y",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900l1353",
"title": "Neural Geometric Level of Detail: Real-time Rendering with Implicit 3D Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900l1353/1yeInvm2ApO",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNscfI2M",
"title": "SC Conference",
"acronym": "sc",
"groupId": "1000729",
"volume": "0",
"displayVolume": "0",
"year": "1993",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrHjqNg",
"doi": "10.1109/SUPERC.1993.1263475",
"title": "Multi-CPU plasma fluid turbulence calculations on a CRAY Y-MP C90",
"normalizedTitle": "Multi-CPU plasma fluid turbulence calculations on a CRAY Y-MP C90",
"abstract": "Significant improvements in real-time efficiency have been obtained for plasma fluid turbulence calculations by microtasking the nonlinear fluid code KITE in which they are implemented on the CRAY Y-MP C90 at the National Energy Research Supercomputer Center (NERSC). The number of processors accessed concurrently scales linearly with problem size. Close to six concurrent processors have so far been obtained with a three-dimensional nonlinear production calculation at the currently allowed memory size of 80 Mword. With a calculation size corresponding to the maximum allowed memory of 200 Mword in the next system configuration, the authors expect to be able to access close to ten processors of the C90 concurrently with a commensurate improvement in real-time efficiency. These improvements in performance are comparable to those expected from a massively parallel implementation of the same calculations on the Intel Paragon.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Significant improvements in real-time efficiency have been obtained for plasma fluid turbulence calculations by microtasking the nonlinear fluid code KITE in which they are implemented on the CRAY Y-MP C90 at the National Energy Research Supercomputer Center (NERSC). The number of processors accessed concurrently scales linearly with problem size. Close to six concurrent processors have so far been obtained with a three-dimensional nonlinear production calculation at the currently allowed memory size of 80 Mword. With a calculation size corresponding to the maximum allowed memory of 200 Mword in the next system configuration, the authors expect to be able to access close to ten processors of the C90 concurrently with a commensurate improvement in real-time efficiency. These improvements in performance are comparable to those expected from a massively parallel implementation of the same calculations on the Intel Paragon.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Significant improvements in real-time efficiency have been obtained for plasma fluid turbulence calculations by microtasking the nonlinear fluid code KITE in which they are implemented on the CRAY Y-MP C90 at the National Energy Research Supercomputer Center (NERSC). The number of processors accessed concurrently scales linearly with problem size. Close to six concurrent processors have so far been obtained with a three-dimensional nonlinear production calculation at the currently allowed memory size of 80 Mword. With a calculation size corresponding to the maximum allowed memory of 200 Mword in the next system configuration, the authors expect to be able to access close to ten processors of the C90 concurrently with a commensurate improvement in real-time efficiency. These improvements in performance are comparable to those expected from a massively parallel implementation of the same calculations on the Intel Paragon.",
"fno": "01263475",
"keywords": [
"Multi CPU Plasma Fluid Turbulence",
"CRAY Y MP C 90",
"Real Time Efficiency",
"Plasma Fluid Turbulence Calculations",
"Microtasking",
"Nonlinear Fluid Code KITE",
"Concurrent Processors",
"Three Dimensional Nonlinear Production Calculation",
"Massively Parallel Implementation",
"Intel Paragon"
],
"authors": [
{
"affiliation": "Oak Ridge Nat. Lab., TN, USA",
"fullName": "Lynch",
"givenName": null,
"surname": "Lynch",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Oak Ridge Nat. Lab., TN, USA",
"fullName": "Carreras",
"givenName": null,
"surname": "Carreras",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Oak Ridge Nat. Lab., TN, USA",
"fullName": "Leboeuf",
"givenName": null,
"surname": "Leboeuf",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Curtis",
"givenName": null,
"surname": "Curtis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Troutman",
"givenName": null,
"surname": "Troutman",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1993-11-01T00:00:00",
"pubType": "proceedings",
"pages": "308-316",
"year": "1993",
"issn": null,
"isbn": "0-8186-4340-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01263492",
"articleId": "1D85yygOyhG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01263493",
"articleId": "1D85qrG1z9e",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/euromicro/1996/7487/0/74870127",
"title": "Application of the V-Ray Technology for Optimization of the TRFD and FL052 Perfect Club Benchmarks to CRAY Y-MP and CRAY T3D Supercomputers",
"doi": null,
"abstractUrl": "/proceedings-article/euromicro/1996/74870127/12OmNC8dgjs",
"parentPublication": {
"id": "proceedings/euromicro/1996/7487/0",
"title": "EUROMICRO Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1992/2630/0/00236674",
"title": "Performance of a plasma fluid code on the Intel parallel computers",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1992/00236674/12OmNs5rkTc",
"parentPublication": {
"id": "proceedings/sc/1992/2630/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2011/4335/0/4335a081",
"title": "Resistance Calculations of Trimaran Hull Form Using Computational Fluid Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2011/4335a081/12OmNvDqsAO",
"parentPublication": {
"id": "proceedings/cso/2011/4335/0",
"title": "2011 Fourth International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/1988/0872/0/00025651",
"title": "The Cray Y-MP-a VLSI supercomputer",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/1988/00025651/12OmNvStcM4",
"parentPublication": {
"id": "proceedings/iccd/1988/0872/0",
"title": "Proceedings 1988 IEEE International Conference on Computer Design: VLSI",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/superc/1997/985/0/01592623",
"title": "Numerical Tokamak Turbulence Calculations on the CRAY T3E",
"doi": null,
"abstractUrl": "/proceedings-article/superc/1997/01592623/12OmNvT2p3W",
"parentPublication": {
"id": "proceedings/superc/1997/985/0",
"title": "ACM/IEEE SC 1997 Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1992/2630/0/00236659",
"title": "Parallel-and-vector implementation of the event-driven logic simulation algorithm on the Cray Y-MP supercomputer",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1992/00236659/12OmNwMXnst",
"parentPublication": {
"id": "proceedings/sc/1992/2630/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1997/1982/0/19820042",
"title": "Numerical Tokamak Turbulence Calculations on the CRAY T3E",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1997/19820042/12OmNxWuict",
"parentPublication": {
"id": "proceedings/sc/1997/1982/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06042858",
"title": "Baroclinic Turbulence with Varying Density and Temperature",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06042858/13rRUwdIOUH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2009/02/mcs2009020052",
"title": "Using Graphics Processors for High-Performance Computation and Visualization of Plasma Turbulence",
"doi": null,
"abstractUrl": "/magazine/cs/2009/02/mcs2009020052/13rRUxN5ewZ",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1993/4340/0/01263475",
"title": "Multi-CPU plasma fluid turbulence calculations on a CRAY Y-MP C90",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1993/01263475/1D85rCCVZJe",
"parentPublication": {
"id": "proceedings/sc/1993/4340/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyKJiaV",
"title": "Pattern Recognition, International Conference on",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBrV1PN",
"doi": "10.1109/ICPR.2010.422",
"title": "An Information Fusion Approach for Multiview Feature Tracking",
"normalizedTitle": "An Information Fusion Approach for Multiview Feature Tracking",
"abstract": "We propose an information fusion approach to tracking objects from different viewpoints that can detect and recover from tracking failures. We introduce a reliability measure that is a combination of terms associated with correlation-based template matching and the epipolar geometry of the cameras. The measure is computed to evaluate the performance of 2D trackers in each camera view and detect tracking failures. The 3D object trajectory is constructed using stereoscopy and evaluated to predict the next 3D position of the object. In case of track loss in one camera view, the projection of the predicted 3D position onto the image plane of this view is used to reinitialize the lost 2D tracker. We conducted experiments with 34 subjects to evaluate our proposed system on videos of facial feature movements during human-computer interaction. The system successfully detected feature loss and gave promising results on accurate re-initialization of the feature.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose an information fusion approach to tracking objects from different viewpoints that can detect and recover from tracking failures. We introduce a reliability measure that is a combination of terms associated with correlation-based template matching and the epipolar geometry of the cameras. The measure is computed to evaluate the performance of 2D trackers in each camera view and detect tracking failures. The 3D object trajectory is constructed using stereoscopy and evaluated to predict the next 3D position of the object. In case of track loss in one camera view, the projection of the predicted 3D position onto the image plane of this view is used to reinitialize the lost 2D tracker. We conducted experiments with 34 subjects to evaluate our proposed system on videos of facial feature movements during human-computer interaction. The system successfully detected feature loss and gave promising results on accurate re-initialization of the feature.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose an information fusion approach to tracking objects from different viewpoints that can detect and recover from tracking failures. We introduce a reliability measure that is a combination of terms associated with correlation-based template matching and the epipolar geometry of the cameras. The measure is computed to evaluate the performance of 2D trackers in each camera view and detect tracking failures. The 3D object trajectory is constructed using stereoscopy and evaluated to predict the next 3D position of the object. In case of track loss in one camera view, the projection of the predicted 3D position onto the image plane of this view is used to reinitialize the lost 2D tracker. We conducted experiments with 34 subjects to evaluate our proposed system on videos of facial feature movements during human-computer interaction. The system successfully detected feature loss and gave promising results on accurate re-initialization of the feature.",
"fno": "4109b706",
"keywords": [
"Multiview Tracking",
"Robust Tracking"
],
"authors": [
{
"affiliation": null,
"fullName": "Esra Ataer Cansizoglu",
"givenName": "Esra Ataer",
"surname": "Cansizoglu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Margrit Betke",
"givenName": "Margrit",
"surname": "Betke",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-08-01T00:00:00",
"pubType": "proceedings",
"pages": "1706-1709",
"year": "2010",
"issn": "1051-4651",
"isbn": "978-0-7695-4109-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4109b702",
"articleId": "12OmNzYNN3a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4109b710",
"articleId": "12OmNwnYFWR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icinis/2012/4855/0/4855a033",
"title": "Multi-feature Fusion for Video Object Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2012/4855a033/12OmNAlvI5Z",
"parentPublication": {
"id": "proceedings/icinis/2012/4855/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/womot/2001/1171/0/11710043",
"title": "Towards Reliable Real-Time Multiview Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/womot/2001/11710043/12OmNApcuie",
"parentPublication": {
"id": "proceedings/womot/2001/1171/0",
"title": "Multi-Object Tracking, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460600",
"title": "3D tracking of deformable surface by propagating feature correspondences",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460600/12OmNApcukQ",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/330P3A19",
"title": "3D Constrained Local Model for rigid and non-rigid facial tracking",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/330P3A19/12OmNBKmXge",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2005/9385/0/01577310",
"title": "A robust facial feature tracking system",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2005/01577310/12OmNC3FGks",
"parentPublication": {
"id": "proceedings/avss/2005/9385/0",
"title": "IEEE Conference on Advanced Video and Signal Based Surveillance, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460355",
"title": "Model-based feature refinement by ellipsoidal face tracking",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460355/12OmNwxlrgl",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vspets/2005/9424/0/01570892",
"title": "Validation of blind region learning and tracking",
"doi": null,
"abstractUrl": "/proceedings-article/vspets/2005/01570892/12OmNxXUhQC",
"parentPublication": {
"id": "proceedings/vspets/2005/9424/0",
"title": "Proceedings. 2nd Joint IEEE International Workshop on Visual Surveillance and Performance Evaluation of Tracking and Surveillance (VS-PETS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d128",
"title": "Multiple Feature Fusion via Weighted Entropy for Visual Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d128/12OmNzdoMn4",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a255",
"title": "An Adaptive KCF Tracking Via Multi-feature Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a255/1ap5AlLcPbq",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev-&-icivpr/2020/9331/0/09306599",
"title": "Triplet Network with Multi-level Feature Fusion for Object Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-&-icivpr/2020/09306599/1qcicleh5G8",
"parentPublication": {
"id": "proceedings/iciev-&-icivpr/2020/9331/0",
"title": "2020 Joint 9th International Conference on Informatics, Electronics & Vision (ICIEV) and 2020 4th International Conference on Imaging, Vision & Pattern Recognition (icIVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAsk4yu",
"title": "The Second IEEE and ACM International Symposium on Mixed and Augmented Reality, 2003. Proceedings.",
"acronym": "ismar",
"groupId": "1000465",
"volume": "0",
"displayVolume": "0",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwNOaQp",
"doi": "10.1109/ISMAR.2003.1240686",
"title": "A real-time tracker for markerless augmented reality",
"normalizedTitle": "A real-time tracker for markerless augmented reality",
"abstract": "Augmented Reality has now progressed to the point where real-time applications are being considered and needed. At the same time it is important that synthetic elements are rendered and aligned in the scene in an accurate and visually acceptable way. In order to address these issues a real-time, robust and efficient 3D model-based tracking algorithm is proposed for a 'video see through' monocular vision system. The tracking of objects in the scene amounts to calculating the pose between the camera and the objects. Virtual objects can then be projected into the scene using the pose. Here, non-linear pose computation is formulated by means of a virtual visual servoing approach. In this context, the derivation of point-to-curves interaction matrices are given for different features including lines, circles, cylinders and spheres. A local moving edges tracker is used in order to provide real-time tracking of points normal to the object contours. A method is proposed for combining local position uncertainty and global pose uncertainty in an efficient and accurate way by propagating uncertainty. Robustness is obtained by integrating a M-estimator into the visual control law via an iteratively re-weighted least squares implementation. The method presented in this paper has been validated on several complex image sequences including outdoor environments. Results show the method to be robust to occlusion, changes in illumination and miss-tracking.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Augmented Reality has now progressed to the point where real-time applications are being considered and needed. At the same time it is important that synthetic elements are rendered and aligned in the scene in an accurate and visually acceptable way. In order to address these issues a real-time, robust and efficient 3D model-based tracking algorithm is proposed for a 'video see through' monocular vision system. The tracking of objects in the scene amounts to calculating the pose between the camera and the objects. Virtual objects can then be projected into the scene using the pose. Here, non-linear pose computation is formulated by means of a virtual visual servoing approach. In this context, the derivation of point-to-curves interaction matrices are given for different features including lines, circles, cylinders and spheres. A local moving edges tracker is used in order to provide real-time tracking of points normal to the object contours. A method is proposed for combining local position uncertainty and global pose uncertainty in an efficient and accurate way by propagating uncertainty. Robustness is obtained by integrating a M-estimator into the visual control law via an iteratively re-weighted least squares implementation. The method presented in this paper has been validated on several complex image sequences including outdoor environments. Results show the method to be robust to occlusion, changes in illumination and miss-tracking.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Augmented Reality has now progressed to the point where real-time applications are being considered and needed. At the same time it is important that synthetic elements are rendered and aligned in the scene in an accurate and visually acceptable way. In order to address these issues a real-time, robust and efficient 3D model-based tracking algorithm is proposed for a 'video see through' monocular vision system. The tracking of objects in the scene amounts to calculating the pose between the camera and the objects. Virtual objects can then be projected into the scene using the pose. Here, non-linear pose computation is formulated by means of a virtual visual servoing approach. In this context, the derivation of point-to-curves interaction matrices are given for different features including lines, circles, cylinders and spheres. A local moving edges tracker is used in order to provide real-time tracking of points normal to the object contours. A method is proposed for combining local position uncertainty and global pose uncertainty in an efficient and accurate way by propagating uncertainty. Robustness is obtained by integrating a M-estimator into the visual control law via an iteratively re-weighted least squares implementation. The method presented in this paper has been validated on several complex image sequences including outdoor environments. Results show the method to be robust to occlusion, changes in illumination and miss-tracking.",
"fno": "20060036",
"keywords": [],
"authors": [
{
"affiliation": "IRISA - INRIA Rennes",
"fullName": "Andrew I. Comport",
"givenName": "Andrew I.",
"surname": "Comport",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IRISA - INRIA Rennes",
"fullName": "?ric Marchand",
"givenName": "?ric",
"surname": "Marchand",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "IRISA - INRIA Rennes",
"fullName": "Fran?ois Chaumette",
"givenName": "Fran?ois",
"surname": "Chaumette",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ismar",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-10-01T00:00:00",
"pubType": "proceedings",
"pages": "36",
"year": "2003",
"issn": null,
"isbn": "0-7695-2006-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "20060028",
"articleId": "12OmNzVXNV2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "20060046",
"articleId": "12OmNz6iOQ4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isar/2001/1375/0/13750087",
"title": "Markerless Augmented Reality with a Real-Time Affine Region Tracker",
"doi": null,
"abstractUrl": "/proceedings-article/isar/2001/13750087/12OmNC4wtAV",
"parentPublication": {
"id": "proceedings/isar/2001/1375/0",
"title": "Proceedings IEEE and ACM International Symposium on Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2013/4983/0/4983a226",
"title": "A Markerless Augmented Reality System for Mobile Devices",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2013/4983a226/12OmNrNh0u8",
"parentPublication": {
"id": "proceedings/crv/2013/4983/0",
"title": "2013 International Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2013/4795/0/06549440",
"title": "Providing guidance for maintenance operations using automatic markerless augmented reality system",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2013/06549440/12OmNxcMSep",
"parentPublication": {
"id": "proceedings/vr/2013/4795/0",
"title": "2013 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2003/2006/0/20060142",
"title": "A Tracker Alignment Framework for Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2003/20060142/12OmNyTOssz",
"parentPublication": {
"id": "proceedings/ismar/2003/2006/0",
"title": "The Second IEEE and ACM International Symposium on Mixed and Augmented Reality, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2008/1971/0/04480766",
"title": "Hybrid Feature Tracking and User Interaction for Markerless Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2008/04480766/12OmNyaGeH3",
"parentPublication": {
"id": "proceedings/vr/2008/1971/0",
"title": "IEEE Virtual Reality 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispan-fcst-iscc/2017/0840/0/0840a127",
"title": "A Real-Time Markerless Augmented Reality Framework Based on SLAM Technique",
"doi": null,
"abstractUrl": "/proceedings-article/ispan-fcst-iscc/2017/0840a127/12OmNzsJ7rZ",
"parentPublication": {
"id": "proceedings/ispan-fcst-iscc/2017/0840/0",
"title": "2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third International Symposium of Creative Computing (ISPAN-FCST-ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iswc/2007/1452/0/04373785",
"title": "Handy AR: Markerless Inspection of Augmented Reality Objects Using Fingertip Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/iswc/2007/04373785/12OmNzxPTMb",
"parentPublication": {
"id": "proceedings/iswc/2007/1452/0",
"title": "2007 11th IEEE International Symposium on Wearable Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/03/ttg2009030355",
"title": "Multithreaded Hybrid Feature Tracking for Markerless Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2009/03/ttg2009030355/13rRUwdrdSt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2000/04/v0319",
"title": "Analysis of Head Pose Accuracy in Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2000/04/v0319/13rRUyv53Fb",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0615",
"title": "Real-Time Markerless Tracking for Augmented Reality: The Virtual Visual Servoing Framework",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0615/13rRUzpzeAP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxE2mWh",
"title": "2013 IEEE Virtual Reality (VR)",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxcMSep",
"doi": "10.1109/VR.2013.6549440",
"title": "Providing guidance for maintenance operations using automatic markerless augmented reality system",
"normalizedTitle": "Providing guidance for maintenance operations using automatic markerless augmented reality system",
"abstract": "A real-time Augmented Reality system that assists in maintenance is presented (Figure 1). The novelty of the proposed system relies on its ability of being a complete framework that is self supplied. All the data is extracted automatically during an offlne phase from a collection of 3D parts that are provided as untextured 3D triangle meshes. Our disassembly planning module computes the assembly/disassembly sequence finding collision-free trajectories [1]. Moreover, some basic geometric features, such as edges and junctions, are extracted to address the tracking problem. Additionally, these geometric features let us perform the 3D model recognition, which solves the first camera pose problem and performs the recovery in case of tracking failure [3]. During the online phase, these geometric features are used to build a markerless tracking that updates continuously the camera pose from a monocular image. This markerless tracking combines an edge tracker, a point based tracker and a 3D particle filter to offer a robust 3D tracking against undesirable conditions [2]. Once the camera pose has been computed, the system offers an augmented instruction, indicating how to assemble/disassemble the next part. Thus, the proposed AR system is a complete framework that runs in real-time and tries to facilitate the work of workers, replacing the paper-based documentation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A real-time Augmented Reality system that assists in maintenance is presented (Figure 1). The novelty of the proposed system relies on its ability of being a complete framework that is self supplied. All the data is extracted automatically during an offlne phase from a collection of 3D parts that are provided as untextured 3D triangle meshes. Our disassembly planning module computes the assembly/disassembly sequence finding collision-free trajectories [1]. Moreover, some basic geometric features, such as edges and junctions, are extracted to address the tracking problem. Additionally, these geometric features let us perform the 3D model recognition, which solves the first camera pose problem and performs the recovery in case of tracking failure [3]. During the online phase, these geometric features are used to build a markerless tracking that updates continuously the camera pose from a monocular image. This markerless tracking combines an edge tracker, a point based tracker and a 3D particle filter to offer a robust 3D tracking against undesirable conditions [2]. Once the camera pose has been computed, the system offers an augmented instruction, indicating how to assemble/disassemble the next part. Thus, the proposed AR system is a complete framework that runs in real-time and tries to facilitate the work of workers, replacing the paper-based documentation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A real-time Augmented Reality system that assists in maintenance is presented (Figure 1). The novelty of the proposed system relies on its ability of being a complete framework that is self supplied. All the data is extracted automatically during an offlne phase from a collection of 3D parts that are provided as untextured 3D triangle meshes. Our disassembly planning module computes the assembly/disassembly sequence finding collision-free trajectories [1]. Moreover, some basic geometric features, such as edges and junctions, are extracted to address the tracking problem. Additionally, these geometric features let us perform the 3D model recognition, which solves the first camera pose problem and performs the recovery in case of tracking failure [3]. During the online phase, these geometric features are used to build a markerless tracking that updates continuously the camera pose from a monocular image. This markerless tracking combines an edge tracker, a point based tracker and a 3D particle filter to offer a robust 3D tracking against undesirable conditions [2]. Once the camera pose has been computed, the system offers an augmented instruction, indicating how to assemble/disassemble the next part. Thus, the proposed AR system is a complete framework that runs in real-time and tries to facilitate the work of workers, replacing the paper-based documentation.",
"fno": "06549440",
"keywords": [
"Assembly Planning",
"Augmented Reality",
"Computational Geometry",
"Maintenance Engineering",
"Mesh Generation",
"Particle Filtering Numerical Methods",
"Production Engineering Computing",
"Solid Modelling",
"Paper Based Documentation",
"Augmented Instruction",
"Point Based Tracker",
"3 D Particle Filter",
"Tracking Failure",
"Camera Pose Problem",
"3 D Model Recognition",
"Tracking Problem",
"Geometric Features",
"Collision Free Trajectories",
"Assembly Disassembly Sequence",
"Disassembly Planning Module",
"Untextured 3 D Triangle Meshes",
"3 D Parts",
"Offlne Phase",
"Automatic Markerless Augmented Reality System",
"Maintenance Operations",
"Three Dimensional Displays",
"Augmented Reality",
"Feature Extraction",
"Cameras",
"Electronic Mail",
"Real Time Systems",
"Planning"
],
"authors": [
{
"affiliation": "CEIT and Tecnun (University of Navarra), Spain",
"fullName": "Hugo Álvarez",
"givenName": "Hugo",
"surname": "Álvarez",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CEIT and Tecnun (University of Navarra), Spain",
"fullName": "Iker Aquinaqa",
"givenName": "Iker",
"surname": "Aquinaqa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CEIT and Tecnun (University of Navarra), Spain",
"fullName": "Diego Borro",
"givenName": "Diego",
"surname": "Borro",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-03-01T00:00:00",
"pubType": "proceedings",
"pages": "1-1",
"year": "2013",
"issn": "1087-8270",
"isbn": "978-1-4673-4795-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06549439",
"articleId": "12OmNBh8h2t",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06549441",
"articleId": "12OmNyUFfJC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ismar/2005/2459/0/24590130",
"title": "Lens Model Selection for a Markerless AR Tracking System",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2005/24590130/12OmNAle6UN",
"parentPublication": {
"id": "proceedings/ismar/2005/2459/0",
"title": "Fourth IEEE and ACM International Symposium on Mixed and Augmented Reality (ISMAR'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2007/1749/0/04538829",
"title": "Automatic contour model creation out of polygonal CAD models for markerless Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2007/04538829/12OmNBp52FX",
"parentPublication": {
"id": "proceedings/ismar/2007/1749/0",
"title": "2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2013/6097/0/06550212",
"title": "Poster: Markerless fingertip-based 3D interaction for handheld augmented reality in a small workspace",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2013/06550212/12OmNBsue2b",
"parentPublication": {
"id": "proceedings/3dui/2013/6097/0",
"title": "2013 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/Ismar-mashd/2015/9628/0/9628a059",
"title": "Augmented Reality Tool for Markerless Virtual Try-on around Human Arm",
"doi": null,
"abstractUrl": "/proceedings-article/Ismar-mashd/2015/9628a059/12OmNBtCCIY",
"parentPublication": {
"id": "proceedings/Ismar-mashd/2015/9628/0",
"title": "2015 IEEE International Symposium on Mixed and Augmented Reality - Media, Art, Social Science, Humanities and Design (ISMAR-MASH'D)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2013/2869/0/06671808",
"title": "Augmenting markerless complex 3D objects by combining geometrical and color edge information",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2013/06671808/12OmNxYbSX3",
"parentPublication": {
"id": "proceedings/ismar/2013/2869/0",
"title": "2013 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2008/2242/0/04587520",
"title": "Markerless motion capture of man-machine interaction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2008/04587520/12OmNyLiuzH",
"parentPublication": {
"id": "proceedings/cvpr/2008/2242/0",
"title": "2008 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2011/2183/0/06092385",
"title": "Providing guidance for maintenance operations using automatic markerless augmented reality system",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2011/06092385/12OmNyVes4G",
"parentPublication": {
"id": "proceedings/ismar/2011/2183/0",
"title": "2011 10th IEEE International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2018/5889/0/08441049",
"title": "An Improvement on ArUco Marker for Pose Tracking Using Kalman Filter",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2018/08441049/13bd1fph1yr",
"parentPublication": {
"id": "proceedings/snpd/2018/5889/0",
"title": "2018 19th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cphs/2022/8203/0/820300a024",
"title": "Here To Stay: A Quantitative Comparison of Virtual Object Stability in Markerless Mobile AR",
"doi": null,
"abstractUrl": "/proceedings-article/cphs/2022/820300a024/1Eyj6ObtdWU",
"parentPublication": {
"id": "proceedings/cphs/2022/8203/0",
"title": "2022 2nd International Workshop on Cyber-Physical-Human System Design and Implementation (CPHS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a433",
"title": "Mixed Reality Application: A Framework of Markerless Assembly Guidance System with Hololens Glass",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a433/1ap5zkHZ9OU",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1vF12OhpdAc",
"title": "2021 International Conference on Information and Digital Technologies (IDT)",
"acronym": "idt",
"groupId": "1802716",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1vF18YHUBHi",
"doi": "10.1109/IDT52577.2021.9497555",
"title": "Securing Constrained Edges in a Triangulation",
"normalizedTitle": "Securing Constrained Edges in a Triangulation",
"abstract": "Computing triangular meshes with constrained edges requires both advanced mathematics and thoughtful logic of the implemented algorithm. Our approach to this is modifying an already created triangulation (e.g., Delaunay triangulation), which can be constructed by a simple algorithm. By swapping edges between triangles and splitting them in needed scenarios, we achieve a mathematically simple algorithm, that supports the construction of wanted edges. This algorithm has been tested in a scenario where it was used to automatically generate terrain based on an infrastructure of a railway station model.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computing triangular meshes with constrained edges requires both advanced mathematics and thoughtful logic of the implemented algorithm. Our approach to this is modifying an already created triangulation (e.g., Delaunay triangulation), which can be constructed by a simple algorithm. By swapping edges between triangles and splitting them in needed scenarios, we achieve a mathematically simple algorithm, that supports the construction of wanted edges. This algorithm has been tested in a scenario where it was used to automatically generate terrain based on an infrastructure of a railway station model.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computing triangular meshes with constrained edges requires both advanced mathematics and thoughtful logic of the implemented algorithm. Our approach to this is modifying an already created triangulation (e.g., Delaunay triangulation), which can be constructed by a simple algorithm. By swapping edges between triangles and splitting them in needed scenarios, we achieve a mathematically simple algorithm, that supports the construction of wanted edges. This algorithm has been tested in a scenario where it was used to automatically generate terrain based on an infrastructure of a railway station model.",
"fno": "09497555",
"keywords": [
"Geographic Information Systems",
"Mesh Generation",
"Railways",
"Constrained Edges",
"Triangular Meshes",
"Advanced Mathematics",
"Thoughtful Logic",
"Implemented Algorithm",
"Created Triangulation",
"Delaunay Triangulation",
"Mathematically Simple Algorithm",
"Wanted Edges",
"Railway Station Model",
"Delay Effects",
"Rail Transportation",
"Real Time Systems",
"Iterative Algorithms",
"Time Factors",
"Mathematical Model",
"Triangulation",
"Constrained Triangulation",
"Securing Edges",
"Terrain Generation"
],
"authors": [
{
"affiliation": "University of žilina Univerzitná 8215/1,Faculty of Management Science and Informatics,Department of Informatics,žilina,Slovak Republic,01026",
"fullName": "Ján Kučera",
"givenName": "Ján",
"surname": "Kučera",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of žilina Univerzitná 8215/1,Faculty of Management Science and Informatics,Department of Mathematical Methods and Operations Research,žilina,Slovak Republic,01026",
"fullName": "Norbert Adamko",
"givenName": "Norbert",
"surname": "Adamko",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of žilina Univerzitná 8215/1,Faculty of Management Science and Informatics,Department of Informatics,žilina,Slovak Republic,01026",
"fullName": "Michal Varga",
"givenName": "Michal",
"surname": "Varga",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "idt",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-06-01T00:00:00",
"pubType": "proceedings",
"pages": "326-330",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-3692-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09497531",
"articleId": "1vF1b4NAyIw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09497534",
"articleId": "1vF175ICCWI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2011/4353/2/05750952",
"title": "Image Completion Using Constrained Delaunay Triangulation",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2011/05750952/12OmNBNM8Sj",
"parentPublication": {
"id": "icicta/2011/4353/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apdc/1997/7876/0/78760131",
"title": "An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers",
"doi": null,
"abstractUrl": "/proceedings-article/apdc/1997/78760131/12OmNBTawsE",
"parentPublication": {
"id": "proceedings/apdc/1997/7876/0",
"title": "Advances in Parallel and Distributed Computing Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2010/3999/0/3999a081",
"title": "An Ant Colony Algorithm for the Minimum Weight Triangulation",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2010/3999a081/12OmNrEL2Bo",
"parentPublication": {
"id": "proceedings/iccsa/2010/3999/0",
"title": "2010 International Conference on Computational Science and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/kse/2009/3846/0/3846a179",
"title": "An Extreme Algorithm for Network-Topology Construction Based on Constrained Delaunay Triangulation",
"doi": null,
"abstractUrl": "/proceedings-article/kse/2009/3846a179/12OmNrHB1SW",
"parentPublication": {
"id": "proceedings/kse/2009/3846/0",
"title": "Knowledge and Systems Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1988/0878/0/00028293",
"title": "Constrained Delaunay triangulation for multiresolution surface description",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028293/12OmNxR5USd",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2000/0662/2/06622218",
"title": "Edge-Constrained Joint View Triangulation for Image Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2000/06622218/12OmNyVerYE",
"parentPublication": {
"id": "proceedings/cvpr/2000/0662/2",
"title": "Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aspdac/2001/6633/0/00913303",
"title": "Efficient minimum spanning tree construction without Delaunay triangulation [VLSI CAD]",
"doi": null,
"abstractUrl": "/proceedings-article/aspdac/2001/00913303/12OmNzZEAA3",
"parentPublication": {
"id": "proceedings/aspdac/2001/6633/0",
"title": "Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050736",
"title": "Computing 2D Constrained Delaunay Triangulation Using the GPU",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050736/13rRUxASuSM",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/01423095",
"title": "An Edge-Preserving, Data-Dependent Triangulation Scheme for Hierarchical Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/01423095/1h0N3AJDJwQ",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09392369",
"title": "Deterministic Linear Time Constrained Triangulation Using Simplified Earcut",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09392369/1sq7wsDegjC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAolGQx",
"title": "2008 International Conference on Computer and Electrical Engineering (ICCEE)",
"acronym": "iccee",
"groupId": "1002575",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwogh8A",
"doi": "10.1109/ICCEE.2008.44",
"title": "Polygon Mesh Simplification Based on Visual Resolution Principle",
"normalizedTitle": "Polygon Mesh Simplification Based on Visual Resolution Principle",
"abstract": "There are many algorithms to simplify meshes. But, most of them are to realize real-time rendering circumstance or models in virtual reality. This paper introduces a novel scheme to simplify meshes from a different view point--visual resolution. This paper uses visual recognizing object principle to simplify meshes. The model or scheme gives a reasonable standard which decides what extent the 3D model is simplified. This scheme can be used in the 3D object-recognition and the robot vision. In this paper, 3D model is the convex model.",
"abstracts": [
{
"abstractType": "Regular",
"content": "There are many algorithms to simplify meshes. But, most of them are to realize real-time rendering circumstance or models in virtual reality. This paper introduces a novel scheme to simplify meshes from a different view point--visual resolution. This paper uses visual recognizing object principle to simplify meshes. The model or scheme gives a reasonable standard which decides what extent the 3D model is simplified. This scheme can be used in the 3D object-recognition and the robot vision. In this paper, 3D model is the convex model.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "There are many algorithms to simplify meshes. But, most of them are to realize real-time rendering circumstance or models in virtual reality. This paper introduces a novel scheme to simplify meshes from a different view point--visual resolution. This paper uses visual recognizing object principle to simplify meshes. The model or scheme gives a reasonable standard which decides what extent the 3D model is simplified. This scheme can be used in the 3D object-recognition and the robot vision. In this paper, 3D model is the convex model.",
"fno": "3504a402",
"keywords": [
"Visual Resolution Principle",
"Polygon Mesh Simplification"
],
"authors": [
{
"affiliation": null,
"fullName": "ZhenGang Zhai",
"givenName": "ZhenGang",
"surname": "Zhai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "HuiMin Ma",
"givenName": "HuiMin",
"surname": "Ma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yao Lu",
"givenName": "Yao",
"surname": "Lu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "ChunXiao Gao",
"givenName": "ChunXiao",
"surname": "Gao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccee",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "402-406",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3504-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3504a398",
"articleId": "12OmNBhpS7I",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3504a407",
"articleId": "12OmNBigFvm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2001/7200/0/7200cohen",
"title": "Hybrid Simplification: Combining Multi-Resolution Polygon and Point Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200cohen/12OmNBSSVcR",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ast-e/2009/3672/0/3672a056",
"title": "Mesh Smoothing for Parameterized Body Model with Loop Subdivision Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/ast-e/2009/3672a056/12OmNBTs7Bu",
"parentPublication": {
"id": "proceedings/ast-e/2009/3672/0",
"title": "Advanced Science and Technology, International e-Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498isenburg",
"title": "Compressing Polygon Mesh Geometry with Parallelogram Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498isenburg/12OmNroijmR",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300061",
"title": "Large Mesh Simplification using Processing Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300061/12OmNweBUR1",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2010/4110/0/4110a160",
"title": "Parallel Implementation of Mesh Simplification on a Beowulf Cluster",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2010/4110a160/12OmNxVlTLo",
"parentPublication": {
"id": "proceedings/dcabes/2010/4110/0",
"title": "2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science",
"__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": "proceedings/csse/2008/3336/2/3336c971",
"title": "Adaptive Mesh Simplification Using Vertex Clustering with Topology Preserving",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336c971/12OmNyRg4mT",
"parentPublication": {
"id": "proceedings/csse/2008/3336/6",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0640",
"title": "An Improved Vertex Caching Scheme for 3D Mesh Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0640/13rRUwhHcJc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1996/03/mcg1996030064",
"title": "Superfaces: Polygonal Mesh Simplification with Bounded Error",
"doi": null,
"abstractUrl": "/magazine/cg/1996/03/mcg1996030064/13rRUxYIMXs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1999/03/v0224",
"title": "Simplification of Tetrahedral Meshes with Error Bounds",
"doi": null,
"abstractUrl": "/journal/tg/1999/03/v0224/13rRUxly95r",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzuIjed",
"title": "Computer Science and Software Engineering, International Conference on",
"acronym": "csse",
"groupId": "1002553",
"volume": "2",
"displayVolume": "2",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyRg4mT",
"doi": "10.1109/CSSE.2008.1146",
"title": "Adaptive Mesh Simplification Using Vertex Clustering with Topology Preserving",
"normalizedTitle": "Adaptive Mesh Simplification Using Vertex Clustering with Topology Preserving",
"abstract": "An improved adaptive mesh simplification method based on vertex clustering is presented in this paper. This algorithm can preserve the model topology and geometric features better than traditional vertex-clustering methods. Using the adjacency relationship of all points, the unit normal corresponding to each vertex can be calculated firstly. Then the algorithm adopts the octree structure to subdivide the mesh model adaptively with the guidance of these normal vectors. This subdivision will continue until the angles between the normal vectors in one cell satisfy the predefined threshold. The vertices in this cell are then replaced by a unique vertex, which is a weighted sum of all inside points. Therein, the weight is the normalized cosine value of the angle between the normal and their mean. Experimental results have demonstrated the presented algorithm can not only simplify 3D meshes effectively but also preserve the geometric characters vividly.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An improved adaptive mesh simplification method based on vertex clustering is presented in this paper. This algorithm can preserve the model topology and geometric features better than traditional vertex-clustering methods. Using the adjacency relationship of all points, the unit normal corresponding to each vertex can be calculated firstly. Then the algorithm adopts the octree structure to subdivide the mesh model adaptively with the guidance of these normal vectors. This subdivision will continue until the angles between the normal vectors in one cell satisfy the predefined threshold. The vertices in this cell are then replaced by a unique vertex, which is a weighted sum of all inside points. Therein, the weight is the normalized cosine value of the angle between the normal and their mean. Experimental results have demonstrated the presented algorithm can not only simplify 3D meshes effectively but also preserve the geometric characters vividly.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An improved adaptive mesh simplification method based on vertex clustering is presented in this paper. This algorithm can preserve the model topology and geometric features better than traditional vertex-clustering methods. Using the adjacency relationship of all points, the unit normal corresponding to each vertex can be calculated firstly. Then the algorithm adopts the octree structure to subdivide the mesh model adaptively with the guidance of these normal vectors. This subdivision will continue until the angles between the normal vectors in one cell satisfy the predefined threshold. The vertices in this cell are then replaced by a unique vertex, which is a weighted sum of all inside points. Therein, the weight is the normalized cosine value of the angle between the normal and their mean. Experimental results have demonstrated the presented algorithm can not only simplify 3D meshes effectively but also preserve the geometric characters vividly.",
"fno": "3336c971",
"keywords": [
"Mesh Simplification",
"Vertex Clustering",
"Topology Preserving",
"Normal Vector"
],
"authors": [
{
"affiliation": null,
"fullName": "Gao Pengdong",
"givenName": "Gao",
"surname": "Pengdong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Li Ameng",
"givenName": "Li",
"surname": "Ameng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lu Yongquan",
"givenName": "Lu",
"surname": "Yongquan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wang Jintao",
"givenName": "Wang",
"surname": "Jintao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Li Nan",
"givenName": "Li",
"surname": "Nan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yu Wenhua",
"givenName": "Yu",
"surname": "Wenhua",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "csse",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "971-974",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3336-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04722211",
"articleId": "12OmNARAngf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3336c975",
"articleId": "12OmNqBbI2O",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2001/1227/0/12270012",
"title": "An Effective Feature-Preserving Mesh Simplification Scheme Based on Face Constriction",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270012/12OmNAGepW6",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200walter",
"title": "Attribute Preserving Dataset Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200walter/12OmNAKcNMB",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ihmsc/2009/3752/1/3752a347",
"title": "Influencing Factors on Vertex Normal Accuracy for Triangular Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2009/3752a347/12OmNAMbZHZ",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2009/3789/0/3789a164",
"title": "Volume Cost Based Mesh Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2009/3789a164/12OmNBDgZ2q",
"parentPublication": {
"id": "proceedings/cgiv/2009/3789/0",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2005/9331/0/01521413",
"title": "Area of surface as a basis for vertex removal based mesh simplification",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2005/01521413/12OmNCeK2gZ",
"parentPublication": {
"id": "proceedings/icme/2005/9331/0",
"title": "2005 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880505",
"title": "Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880505/12OmNvjgWoK",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csie/2009/3507/1/3507a698",
"title": "A Topology Preserved Mesh Simplification Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/csie/2009/3507a698/12OmNyFU73Z",
"parentPublication": {
"id": "csie/2009/3507/1",
"title": "Computer Science and Information Engineering, World Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2008/3494/1/3494a150",
"title": "A New Adaptive Mesh Simplification Method Using Vertex Clustering with Topology-and-Detail Preserving",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a150/12OmNz61dnL",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__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/icicse/2009/4027/0/4027a060",
"title": "An Efficient Mesh Simplification Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icicse/2009/4027a060/12OmNzxyiCQ",
"parentPublication": {
"id": "proceedings/icicse/2009/4027/0",
"title": "2009 Fourth International Conference on Internet Computing for Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAkWva9",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"acronym": "icassp",
"groupId": "1000002",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAoDhYX",
"doi": "10.1109/ICASSP.2009.4959761",
"title": "Modeling of contours in wavelet domain for generalized lifting image compression",
"normalizedTitle": "Modeling of contours in wavelet domain for generalized lifting image compression",
"abstract": "This paper introduces the design of context-based models of contours in the wavelet domain, which are used to construct generalized lifting (GL) mappings for image compression. The GL context-based mapping may significantly reduce the signal energy and the resulting bitrate. Here, we propose a strategy to define a reduced set of structured models to design the GL. The models capture the contour structures and are contrast-invariant. Initial experimental results applying the strategy on a wavelet subband exhibit potential gains. Iterations of the GL scheme as well as an adaptive entropy coding strategy may increase the coding gain.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduces the design of context-based models of contours in the wavelet domain, which are used to construct generalized lifting (GL) mappings for image compression. The GL context-based mapping may significantly reduce the signal energy and the resulting bitrate. Here, we propose a strategy to define a reduced set of structured models to design the GL. The models capture the contour structures and are contrast-invariant. Initial experimental results applying the strategy on a wavelet subband exhibit potential gains. Iterations of the GL scheme as well as an adaptive entropy coding strategy may increase the coding gain.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduces the design of context-based models of contours in the wavelet domain, which are used to construct generalized lifting (GL) mappings for image compression. The GL context-based mapping may significantly reduce the signal energy and the resulting bitrate. Here, we propose a strategy to define a reduced set of structured models to design the GL. The models capture the contour structures and are contrast-invariant. Initial experimental results applying the strategy on a wavelet subband exhibit potential gains. Iterations of the GL scheme as well as an adaptive entropy coding strategy may increase the coding gain.",
"fno": "04959761",
"keywords": [],
"authors": [
{
"affiliation": "Technical University of Catalonia (UPC), Dept. of Signal Theory and Communications, Spain",
"fullName": "Julio C. Rolon",
"givenName": "Julio C.",
"surname": "Rolon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Southern California (USC), Signal and Image Processing Institute, USA",
"fullName": "Antonio Ortega",
"givenName": "Antonio",
"surname": "Ortega",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technical University of Catalonia (UPC), Dept. of Signal Theory and Communications, Spain",
"fullName": "Philippe Salembier",
"givenName": "Philippe",
"surname": "Salembier",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icassp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-04-01T00:00:00",
"pubType": "proceedings",
"pages": "1025-1028",
"year": "2009",
"issn": null,
"isbn": "978-1-4244-2353-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04959760",
"articleId": "12OmNyqRnoA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04959762",
"articleId": "12OmNBE7MnJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2001/1198/0/11980093",
"title": "MOTION COMPENSATED LIFTING WAVELET AND ITS APPLICATION IN VIDEO CODING",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2001/11980093/12OmNAYXWHl",
"parentPublication": {
"id": "proceedings/icme/2001/1198/0",
"title": "IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisp/2008/3119/1/3119a534",
"title": "Embedded Zerotree Wavelet Based Image Coding via Quincunx Lifting",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119a534/12OmNscOUb8",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/1",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2007/1834/0/04458015",
"title": "Wavelet Compression of Multiview Video with Disparity-Compensated Lifting",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2007/04458015/12OmNvF83rt",
"parentPublication": {
"id": "proceedings/isspit/2007/1834/0",
"title": "2007 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1999/5041/6/00757508",
"title": "Generalized variable dimensional set partitioning for embedded wavelet image compression",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1999/00757508/12OmNwAKCMB",
"parentPublication": {
"id": "proceedings/icassp/1999/5041/6",
"title": "1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2001/7041/3/00941289",
"title": "Three-dimensional lifting schemes for motion compensated video compression",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2001/00941289/12OmNx4Q6GK",
"parentPublication": {
"id": "proceedings/icassp/2001/7041/3",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2010/4360/0/4360a129",
"title": "A Data Compression Method for Traffic Loop Detectors' Signals Based on Lifting Wavelet Transformation and Entropy Coding",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2010/4360a129/12OmNx4gUlv",
"parentPublication": {
"id": "proceedings/isise/2010/4360/0",
"title": "2010 Third International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/reconfig/2006/0689/0/04099992",
"title": "Reconfigurable Implementation of Wavelet Integer Lifting Transforms for Image Compression",
"doi": null,
"abstractUrl": "/proceedings-article/reconfig/2006/04099992/12OmNylbouB",
"parentPublication": {
"id": "proceedings/reconfig/2006/0689/0",
"title": "Reconfigurable Computing and FPGAs, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev/2013/0400/0/06572638",
"title": "Image compression using lifting based wavelet transform coupled with SPIHT algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iciev/2013/06572638/12OmNzBOhOt",
"parentPublication": {
"id": "proceedings/iciev/2013/0400/0",
"title": "2013 2nd International Conference on Informatics, Electronics and Vision (ICIEV 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccms/2010/3941/1/3941a360",
"title": "Speech Compression with Best Wavelet Packet Transform and SPIHT Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccms/2010/3941a360/12OmNzC5Tc2",
"parentPublication": {
"id": "proceedings/iccms/2010/3941/3",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2003/7965/1/7965373",
"title": "Light field compression using disparity-compensated lifting",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2003/7965373/12OmNzUPpdW",
"parentPublication": {
"id": "proceedings/icme/2003/7965/1",
"title": "2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrJiCDn",
"title": "Intelligent Human-Machine Systems and Cybernetics, International Conference on",
"acronym": "ihmsc",
"groupId": "1002959",
"volume": "1",
"displayVolume": "1",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAsTgS0",
"doi": "10.1109/IHMSC.2010.84",
"title": "Infrared Image Enhancement Based on Wavelet Transformation and Retinex",
"normalizedTitle": "Infrared Image Enhancement Based on Wavelet Transformation and Retinex",
"abstract": "As infrared image enhancement method based on wavelet transformation has the problem of poor visual effect, the method based on wavelet transformation and Retinex was proposed. Firstly, the infrared image is decomposed into high frequency detail and low frequency approximation components at various resolutions; Secondly, the low frequency subband of the bottom level is enhanced by multiscale Retinex algorithm, thus the gain coefficients of high frequency subbands are available by calculating the local compatibility of the enhanced low frequency subband of the same level, and the gain coefficients are multiplied by the corresponding detail image to get enhanced high frequency subband images; Finally, the enhanced image is reconstructed by the low frequency subband and high frequency subbands. Experimental results show that the proposed method enhances image details, suppresses noise, and achieves a better visual effect by comparing with infrared image enhancement method based on stationary wavelet transform.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As infrared image enhancement method based on wavelet transformation has the problem of poor visual effect, the method based on wavelet transformation and Retinex was proposed. Firstly, the infrared image is decomposed into high frequency detail and low frequency approximation components at various resolutions; Secondly, the low frequency subband of the bottom level is enhanced by multiscale Retinex algorithm, thus the gain coefficients of high frequency subbands are available by calculating the local compatibility of the enhanced low frequency subband of the same level, and the gain coefficients are multiplied by the corresponding detail image to get enhanced high frequency subband images; Finally, the enhanced image is reconstructed by the low frequency subband and high frequency subbands. Experimental results show that the proposed method enhances image details, suppresses noise, and achieves a better visual effect by comparing with infrared image enhancement method based on stationary wavelet transform.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As infrared image enhancement method based on wavelet transformation has the problem of poor visual effect, the method based on wavelet transformation and Retinex was proposed. Firstly, the infrared image is decomposed into high frequency detail and low frequency approximation components at various resolutions; Secondly, the low frequency subband of the bottom level is enhanced by multiscale Retinex algorithm, thus the gain coefficients of high frequency subbands are available by calculating the local compatibility of the enhanced low frequency subband of the same level, and the gain coefficients are multiplied by the corresponding detail image to get enhanced high frequency subband images; Finally, the enhanced image is reconstructed by the low frequency subband and high frequency subbands. Experimental results show that the proposed method enhances image details, suppresses noise, and achieves a better visual effect by comparing with infrared image enhancement method based on stationary wavelet transform.",
"fno": "4151a313",
"keywords": [
"Image Enhancement",
"Wavelet Transformation",
"Multiscale Retinex",
"Fuzzy Rules"
],
"authors": [
{
"affiliation": null,
"fullName": "Bichao Zhan",
"givenName": "Bichao",
"surname": "Zhan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yiquan Wu",
"givenName": "Yiquan",
"surname": "Wu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ihmsc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-08-01T00:00:00",
"pubType": "proceedings",
"pages": "313-316",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4151-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4151a309",
"articleId": "12OmNwIHooT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4151a317",
"articleId": "12OmNxuo0gX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/eait/2011/4329/0/4329a093",
"title": "Color Image Enhancement Using Multiscale Retinex with Modified Color Restoration Technique",
"doi": null,
"abstractUrl": "/proceedings-article/eait/2011/4329a093/12OmNAndiwp",
"parentPublication": {
"id": "proceedings/eait/2011/4329/0",
"title": "Emerging Applications of Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2009/3557/2/3557c350",
"title": "An Image Enhancement Algorithm Based on Retinex Theory",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557c350/12OmNBhZ4lw",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2011/4501/0/4501a022",
"title": "An Enhancement Algorithm for Video Surveillance Image Based on Multi-scale Retinex",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2011/4501a022/12OmNBkfRh7",
"parentPublication": {
"id": "proceedings/iccis/2011/4501/0",
"title": "2011 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icm/2011/4522/3/4522c015",
"title": "Remote Sensing Image Enhancement Method Based on Multi-scale Retinex",
"doi": null,
"abstractUrl": "/proceedings-article/icm/2011/4522c015/12OmNqyDjow",
"parentPublication": {
"id": "proceedings/icm/2011/4522/3",
"title": "Information Technology, Computer Engineering and Management Sciences, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2010/4249/0/4249a039",
"title": "Novel Image Enhancement Algorithm Based on Wavelet Multiscale",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2010/4249a039/12OmNrAdszn",
"parentPublication": {
"id": "proceedings/icinis/2010/4249/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itcs/2009/3688/1/3688a476",
"title": "An Image Enhancement Approach Using Retinex and YIQ",
"doi": null,
"abstractUrl": "/proceedings-article/itcs/2009/3688a476/12OmNrMHOcE",
"parentPublication": {
"id": "proceedings/itcs/2009/3688/1",
"title": "Information Technology and Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscid/2010/4198/1/4198a182",
"title": "A Method to Improve the Retinex Image Enhancement Algorithm Based on Wavelet Theory",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2010/4198a182/12OmNwCsdMe",
"parentPublication": {
"id": "proceedings/iscid/2010/4198/1",
"title": "Computational Intelligence and Design, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiki/2015/8637/0/8637a305",
"title": "Research of Knee Infrared Image Noise Reduction and Enhancement",
"doi": null,
"abstractUrl": "/proceedings-article/iiki/2015/8637a305/12OmNx3Zjq5",
"parentPublication": {
"id": "proceedings/iiki/2015/8637/0",
"title": "2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013a301",
"title": "Enhancement Method for Infrared Dim-Small Target Images Based on Rough Set",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013a301/12OmNyGtjk6",
"parentPublication": {
"id": "proceedings/icisce/2017/3013/0",
"title": "2017 4th International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoip/2010/4252/2/4252b666",
"title": "Tire-Imprints Image Enhancement Algorithm Based on Wavelet Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252b666/12OmNyrIas2",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxwENvc",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"acronym": "icassp",
"groupId": "1000002",
"volume": "3",
"displayVolume": "3",
"year": "2004",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqBbHL9",
"doi": "10.1109/ICASSP.2004.1326501",
"title": "Mesh-based motion models for wavelet video coding",
"normalizedTitle": "Mesh-based motion models for wavelet video coding",
"abstract": "Discrete wavelet transforms, implemented using lifting along motion trajectories, are effective and efficient temporal decomposition tools that facilitate video compression competitive with the current standards. As recently shown, however, in order that a lifting-based motion-compensated wavelet transform be equivalent to its transversal (standard) implementation, motion transformation must be invertible and motion composition between frames must be well-defined. In this paper, we discuss various mesh-based motion models that satisfy requirements of invertibility and composition, and thus are suitable for use in motion-compensated lifting-based wavelet transforms. We propose a new mesh configuration that preserves regularity of the mesh structure but provides better motion compensation compared to previously-reported mesh topologies, particularly in the proximity of image boundaries. Our results show that an improvement in motion compensation and overall compression performance is possible with only a fractional increase in motion overhead bit-rate.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Discrete wavelet transforms, implemented using lifting along motion trajectories, are effective and efficient temporal decomposition tools that facilitate video compression competitive with the current standards. As recently shown, however, in order that a lifting-based motion-compensated wavelet transform be equivalent to its transversal (standard) implementation, motion transformation must be invertible and motion composition between frames must be well-defined. In this paper, we discuss various mesh-based motion models that satisfy requirements of invertibility and composition, and thus are suitable for use in motion-compensated lifting-based wavelet transforms. We propose a new mesh configuration that preserves regularity of the mesh structure but provides better motion compensation compared to previously-reported mesh topologies, particularly in the proximity of image boundaries. Our results show that an improvement in motion compensation and overall compression performance is possible with only a fractional increase in motion overhead bit-rate.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Discrete wavelet transforms, implemented using lifting along motion trajectories, are effective and efficient temporal decomposition tools that facilitate video compression competitive with the current standards. As recently shown, however, in order that a lifting-based motion-compensated wavelet transform be equivalent to its transversal (standard) implementation, motion transformation must be invertible and motion composition between frames must be well-defined. In this paper, we discuss various mesh-based motion models that satisfy requirements of invertibility and composition, and thus are suitable for use in motion-compensated lifting-based wavelet transforms. We propose a new mesh configuration that preserves regularity of the mesh structure but provides better motion compensation compared to previously-reported mesh topologies, particularly in the proximity of image boundaries. Our results show that an improvement in motion compensation and overall compression performance is possible with only a fractional increase in motion overhead bit-rate.",
"fno": "01326501",
"keywords": [
"Video Coding",
"Discrete Wavelet Transforms",
"Mesh Generation",
"Motion Compensation",
"DWT",
"Wavelet Video Coding",
"Mesh Based Motion Models",
"Discrete Wavelet Transforms",
"Motion Trajectories",
"Video Decomposition",
"Video Compression",
"Lifting Based Motion Compensated Wavelet Transform",
"Invertible Motion Transformation",
"Motion Compensation",
"Motion Overhead Bit Rate",
"Video Coding",
"Discrete Wavelet Transforms",
"Motion Compensation",
"Topology",
"Motion Estimation",
"Transversal Filters",
"Filtering",
"Deformable Models",
"Video Compression",
"Image Coding"
],
"authors": [
{
"affiliation": "Dept. of Electr. & Comput. Eng., Boston Univ., MA, USA",
"fullName": "N. Bozinovic",
"givenName": "N.",
"surname": "Bozinovic",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electr. & Comput. Eng., Boston Univ., MA, USA",
"fullName": "J. Konrad",
"givenName": "J.",
"surname": "Konrad",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icassp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2004-01-01T00:00:00",
"pubType": "proceedings",
"pages": "iii-141-4 vol.3",
"year": "2004",
"issn": "1520-6149",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01326500",
"articleId": "12OmNBO3KjC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01326502",
"articleId": "12OmNy2Jt5g",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2001/1198/0/11980093",
"title": "MOTION COMPENSATED LIFTING WAVELET AND ITS APPLICATION IN VIDEO CODING",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2001/11980093/12OmNAYXWHl",
"parentPublication": {
"id": "proceedings/icme/2001/1198/0",
"title": "IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2004/2051/1/205110549",
"title": "A Mesh-based Multiple Description Coding Method for Network Video",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2004/205110549/12OmNBRbksE",
"parentPublication": {
"id": "proceedings/aina/2004/2051/1",
"title": "18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/3/01326496",
"title": "(N,0) motion-compensated lifting-based wavelet transform",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326496/12OmNqJHFBm",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/3",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2008/3382/3/3382c376",
"title": "Mesh-Based In-band Motion Estimation Method",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2008/3382c376/12OmNvjyxXH",
"parentPublication": {
"id": "proceedings/isda/2008/3382/3",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2010/6425/0/05453490",
"title": "Arbitrary ROI-Based Wavelet Video Coding",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2010/05453490/12OmNwJgAJf",
"parentPublication": {
"id": "proceedings/dcc/2010/6425/0",
"title": "2010 Data Compression Conference (DCC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/2/3336c959",
"title": "Multiple Description Video Coding Based on Motion-Compensated Correlation",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336c959/12OmNwpGgIP",
"parentPublication": {
"id": "proceedings/csse/2008/3336/6",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284901",
"title": "Adaptive Selection of Motion Models for Panoramic Video Coding",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284901/12OmNwswg4d",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/1/73100566",
"title": "Hierarchical coding of motion vector fields",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73100566/12OmNy7Qfmt",
"parentPublication": {
"id": "proceedings/icip/1995/7310/1",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284757",
"title": "A High Performance Motion Mode Adaptive Lifting Motion Compensation Wavelet Video Codec",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284757/12OmNzDehe7",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/3/01326497",
"title": "Highly scalable video coding by bidirectional predict-update 3-band schemes",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326497/12OmNzV70qD",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/3",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwDSdOI",
"title": "Electrical and Control Engineering, International Conference on",
"acronym": "icece",
"groupId": "1800179",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqBtiNo",
"doi": "10.1109/iCECE.2010.277",
"title": "Gray Image Watermark Algorithm in Integer Wavelet Transform Domain",
"normalizedTitle": "Gray Image Watermark Algorithm in Integer Wavelet Transform Domain",
"abstract": "Integer wavelet transform based on lifting scheme is a kind of invertible integer to integer transform and can reconstruct original signal simply and accurately. Used this characteristic, reversible image watermark algorithm in integer wavelet transform domain is presented in this paper. A binary meaningful image is encrypted by chaotic encryption algorithm to form watermark. In watermark embedding process, a gray image carrier is done by 2-level 9/7-M(4, 2) integer wavelet transform and the encrypted data are embedded into the coefficients of second level high subband. When the watermark extracted, according to the computing algorithm, the data may be entirely gotten back in the integer wavelet domain of the watermarked image and decoded into original image. From results of experimental test, the presented image watermark technology meets requirements of reversibility, security and imperceptibility.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Integer wavelet transform based on lifting scheme is a kind of invertible integer to integer transform and can reconstruct original signal simply and accurately. Used this characteristic, reversible image watermark algorithm in integer wavelet transform domain is presented in this paper. A binary meaningful image is encrypted by chaotic encryption algorithm to form watermark. In watermark embedding process, a gray image carrier is done by 2-level 9/7-M(4, 2) integer wavelet transform and the encrypted data are embedded into the coefficients of second level high subband. When the watermark extracted, according to the computing algorithm, the data may be entirely gotten back in the integer wavelet domain of the watermarked image and decoded into original image. From results of experimental test, the presented image watermark technology meets requirements of reversibility, security and imperceptibility.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Integer wavelet transform based on lifting scheme is a kind of invertible integer to integer transform and can reconstruct original signal simply and accurately. Used this characteristic, reversible image watermark algorithm in integer wavelet transform domain is presented in this paper. A binary meaningful image is encrypted by chaotic encryption algorithm to form watermark. In watermark embedding process, a gray image carrier is done by 2-level 9/7-M(4, 2) integer wavelet transform and the encrypted data are embedded into the coefficients of second level high subband. When the watermark extracted, according to the computing algorithm, the data may be entirely gotten back in the integer wavelet domain of the watermarked image and decoded into original image. From results of experimental test, the presented image watermark technology meets requirements of reversibility, security and imperceptibility.",
"fno": "4031b096",
"keywords": [
"Image Watermark",
"Integer Wavelet Transform",
"Lifting Scheme",
"Chaotic Encryption"
],
"authors": [
{
"affiliation": null,
"fullName": "Chen Yongqiang",
"givenName": "Chen",
"surname": "Yongqiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hu Hanping",
"givenName": "Hu",
"surname": "Hanping",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icece",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1096-1099",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4031-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4031b092",
"articleId": "12OmNwwd304",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4031b100",
"articleId": "12OmNxj23cB",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cisp/2008/3119/1/3119a007",
"title": "Medical Image Authentication Using Hash Function and Integer Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119a007/12OmNAIdBTs",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/1",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2008/3278/0/3278a994",
"title": "A New Wavelet Watermark Scheme of Color Image Based on Chaotic Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a994/12OmNB9KHuL",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/2/4077c403",
"title": "Gray Image Watermark Method Based on Fractal Compression",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077c403/12OmNBBhN3u",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/3/3336e729",
"title": "Toward Color Logo Watermark to JPEG2000 Compressed Images",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336e729/12OmNBLdKM5",
"parentPublication": {
"id": "proceedings/csse/2008/3336/3",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/2/3859b437",
"title": "Digital Image Watermarking Algorithm Based on Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859b437/12OmNBp52Cz",
"parentPublication": {
"id": "proceedings/iita/2009/3859/2",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iitsi/2010/4020/0/4020a781",
"title": "A Blind Watermark Algorithm for Color Image Based on Dual Scrambling Technique",
"doi": null,
"abstractUrl": "/proceedings-article/iitsi/2010/4020a781/12OmNC2fGxO",
"parentPublication": {
"id": "proceedings/iitsi/2010/4020/0",
"title": "Intelligent Information Technology and Security Informatics, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2005/9313/0/01577111",
"title": "Fast integer-to-integer reversible lifting transform with reduced memory consumption",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2005/01577111/12OmNs0TKLp",
"parentPublication": {
"id": "proceedings/isspit/2005/9313/0",
"title": "2005 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncis/2011/4355/1/4355a413",
"title": "A Color Image Blind Watermarking Algorithm Based on Chaotic Scrambling and Integer Wavelet",
"doi": null,
"abstractUrl": "/proceedings-article/ncis/2011/4355a413/12OmNxveNSw",
"parentPublication": {
"id": "proceedings/ncis/2011/4355/1",
"title": "Network Computing and Information Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ams/2012/4730/0/4730a087",
"title": "Digital Image Steganography Based on Integer Wavelet Transform and Assignment Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/ams/2012/4730a087/12OmNy68ED1",
"parentPublication": {
"id": "proceedings/ams/2012/4730/0",
"title": "Asia International Conference on Modelling & Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031e576",
"title": "A Blind Watermarking Algorithm Based on Lifting Wavelet Transform and Scrambling Technology",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031e576/12OmNzRZpWI",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx2zjwe",
"title": "Ninth IEEE International Symposium on Multimedia (ISM 2007)",
"acronym": "ism",
"groupId": "1001094",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrAv3NX",
"doi": "10.1109/ISM.2007.27",
"title": "Complexity Reduction and Fast Algorithm for 2-D Integer Discrete Wavelet Transform Using Symmetric Mask-Based Scheme",
"normalizedTitle": "Complexity Reduction and Fast Algorithm for 2-D Integer Discrete Wavelet Transform Using Symmetric Mask-Based Scheme",
"abstract": "Wavelet coding has been shown to be better than Discrete Cosine Transform (DCT) in image/video processing. Moreover, it has the feature of scalability, which is involved in modern video standards. This work presents novel algorithms, namely 2-D Symmetric Mask-based Discrete Wavelet Transform (SMDWT), to improve the critical issue of the 2-D Lifting-based Discrete Wavelet Transform (LDWT), and then obtains the benefit of low latency, high-speed operation, and low temporal memory. The SMDWT also has the advantages of high-performance embedded periodic extension boundary treatment, reduced complexity, regular signal coding, short critical path, reduced latency time, and independent subband coding processing. Moreover, the 2-D lifting-based DWT performance can also be easily improved by exploiting appropriate parallel method inherently in SMDWT. Comparing with the normal 2-D 5/3 integer lifting-based DWT, the proposed method significantly improves lifting-based latency and complexity in 2-D DWT without degradation in image quality. The algorithm can be applied to real-time image/video applications, such as JPEG2000, MPEG-4 still texture object decoding, and wavlet-based Scalable Video Coding (SVC). Keywords: critical path, latency, discrete wavelet transform, lifting-based discrete wavelet transform, symmetric mask-based discrete wavelet transform, temporal memory.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Wavelet coding has been shown to be better than Discrete Cosine Transform (DCT) in image/video processing. Moreover, it has the feature of scalability, which is involved in modern video standards. This work presents novel algorithms, namely 2-D Symmetric Mask-based Discrete Wavelet Transform (SMDWT), to improve the critical issue of the 2-D Lifting-based Discrete Wavelet Transform (LDWT), and then obtains the benefit of low latency, high-speed operation, and low temporal memory. The SMDWT also has the advantages of high-performance embedded periodic extension boundary treatment, reduced complexity, regular signal coding, short critical path, reduced latency time, and independent subband coding processing. Moreover, the 2-D lifting-based DWT performance can also be easily improved by exploiting appropriate parallel method inherently in SMDWT. Comparing with the normal 2-D 5/3 integer lifting-based DWT, the proposed method significantly improves lifting-based latency and complexity in 2-D DWT without degradation in image quality. The algorithm can be applied to real-time image/video applications, such as JPEG2000, MPEG-4 still texture object decoding, and wavlet-based Scalable Video Coding (SVC). Keywords: critical path, latency, discrete wavelet transform, lifting-based discrete wavelet transform, symmetric mask-based discrete wavelet transform, temporal memory.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Wavelet coding has been shown to be better than Discrete Cosine Transform (DCT) in image/video processing. Moreover, it has the feature of scalability, which is involved in modern video standards. This work presents novel algorithms, namely 2-D Symmetric Mask-based Discrete Wavelet Transform (SMDWT), to improve the critical issue of the 2-D Lifting-based Discrete Wavelet Transform (LDWT), and then obtains the benefit of low latency, high-speed operation, and low temporal memory. The SMDWT also has the advantages of high-performance embedded periodic extension boundary treatment, reduced complexity, regular signal coding, short critical path, reduced latency time, and independent subband coding processing. Moreover, the 2-D lifting-based DWT performance can also be easily improved by exploiting appropriate parallel method inherently in SMDWT. Comparing with the normal 2-D 5/3 integer lifting-based DWT, the proposed method significantly improves lifting-based latency and complexity in 2-D DWT without degradation in image quality. The algorithm can be applied to real-time image/video applications, such as JPEG2000, MPEG-4 still texture object decoding, and wavlet-based Scalable Video Coding (SVC). Keywords: critical path, latency, discrete wavelet transform, lifting-based discrete wavelet transform, symmetric mask-based discrete wavelet transform, temporal memory.",
"fno": "30580057",
"keywords": [],
"authors": [
{
"affiliation": null,
"fullName": "Chih-Hsien Hsia",
"givenName": "Chih-Hsien",
"surname": "Hsia",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jing-Ming Guo",
"givenName": "Jing-Ming",
"surname": "Guo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jen-Shiun Chiang",
"givenName": "Jen-Shiun",
"surname": "Chiang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ism",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-12-01T00:00:00",
"pubType": "proceedings",
"pages": "57-64",
"year": "2007",
"issn": null,
"isbn": "0-7695-3058-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "30580045",
"articleId": "12OmNBOCWq8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "30580065",
"articleId": "12OmNBOll5Z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ias/2009/3744/1/3744a173",
"title": "Moving Object Tracking Using Symmetric Mask-Based Scheme",
"doi": null,
"abstractUrl": "/proceedings-article/ias/2009/3744a173/12OmNBO3JUo",
"parentPublication": {
"id": "proceedings/ias/2009/3744/1",
"title": "Information Assurance and Security, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-padw/2014/7014/0/7014a001",
"title": "2-D Discrete Wavelet Transform Using GPU",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-padw/2014/7014a001/12OmNvStctt",
"parentPublication": {
"id": "proceedings/sbac-padw/2014/7014/0",
"title": "2014 International Symposium on Computer Architecture and High Performance Computing Workshop (SBAC-PADW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsap/2009/3594/0/05163817",
"title": "Parallel Pipelined VLSI Architectures for Lifting-Based Two-Dimensional Forward Discrete Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/icsap/2009/05163817/12OmNwErpNv",
"parentPublication": {
"id": "proceedings/icsap/2009/3594/0",
"title": "Signal Acquisition and Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2008/3161/0/31610178",
"title": "The Corner Detection Algorithm Based on 2-D Discrete Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2008/31610178/12OmNxRF79Q",
"parentPublication": {
"id": "proceedings/icicic/2008/3161/0",
"title": "Innovative Computing ,Information and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iolts/2009/4596/0/05196003",
"title": "Error detection in 2-D Discrete Wavelet lifting transforms",
"doi": null,
"abstractUrl": "/proceedings-article/iolts/2009/05196003/12OmNyXMQbM",
"parentPublication": {
"id": "proceedings/iolts/2009/4596/0",
"title": "2009 15th IEEE International On-Line Testing Symposium (IOLTS 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2003/1868/0/18680202",
"title": "A Novel Architecture for Lifting-Based Discrete Wavelet Transform for JPEG2000 Standard suitable for VLSI implementation",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2003/18680202/12OmNz6iOLp",
"parentPublication": {
"id": "proceedings/vlsid/2003/1868/0",
"title": "VLSI Design, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paap/2010/9482/0/05715075",
"title": "GPU Acceleration of Integer Wavelet Transform for TIFF Image",
"doi": null,
"abstractUrl": "/proceedings-article/paap/2010/05715075/12OmNzDNtto",
"parentPublication": {
"id": "proceedings/paap/2010/9482/0",
"title": "Third International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/date/2005/2288/3/228830032",
"title": "Area and Throughput Trade-Offs in the Design of Pipelined Discrete Wavelet Transform Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/date/2005/228830032/12OmNzdoMxT",
"parentPublication": {
"id": "proceedings/date/2005/2288/3",
"title": "Design, Automation & Test in Europe Conference & Exhibition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccima/2007/3050/3/30500495",
"title": "Performance Comparison of Discrete Wavelet Transform and Dual Tree Discrete Wavelet Transform for Automatic Airborne Target Detection",
"doi": null,
"abstractUrl": "/proceedings-article/iccima/2007/30500495/12OmNzw8jic",
"parentPublication": {
"id": "proceedings/iccima/2007/3050/3",
"title": "2007 International Conference on Computational Intelligence and Multimedia Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2006/2528/2/04021762",
"title": "Algorithm of Targets Detection Based on Integer Wavelet Transform and Realize on TV Tracking System",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2006/04021762/141Anq5Yjbs",
"parentPublication": {
"id": "proceedings/isda/2006/2528/2",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCcbEda",
"title": "2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05)",
"acronym": "asap",
"groupId": "1000037",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrYCXKH",
"doi": "10.1109/ASAP.2005.51",
"title": "Performance Comparison of SIMD Implementations of the Discrete Wavelet Transform",
"normalizedTitle": "Performance Comparison of SIMD Implementations of the Discrete Wavelet Transform",
"abstract": "This paper focuses on SIMD implementations of the 2D discrete wavelet transform (DWT). The transforms considered are Daubechies? real-to-real method of four coef ficients (Daub-4) and the integer-to-integer (5, 3) lifting scheme. Daub-4 is implemented using SSE and the lifting scheme using MMX, and their performance is compared to C implementations on a Pentium 4 processor. The MMX implementation of the lifting scheme is up to 4.0x faster than the corresponding C program for a 1-level 2D DWT, while the SSE implementation of Daub-4 is up to 2.6x faster than the C version. It is shown that for some image sizes, the performance is significantly hampered by the so-called 64K aliasing problem, which occurs in the Pentium 4 when two data blocks are accessed that are a multiple of 64K apart. It is also shown that for the (5, 3) lifting scheme, a 12-bit word size is sufficient for a 5-level decomposition of the 2D DWT for images of up to 10 bits per pixel.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper focuses on SIMD implementations of the 2D discrete wavelet transform (DWT). The transforms considered are Daubechies? real-to-real method of four coef ficients (Daub-4) and the integer-to-integer (5, 3) lifting scheme. Daub-4 is implemented using SSE and the lifting scheme using MMX, and their performance is compared to C implementations on a Pentium 4 processor. The MMX implementation of the lifting scheme is up to 4.0x faster than the corresponding C program for a 1-level 2D DWT, while the SSE implementation of Daub-4 is up to 2.6x faster than the C version. It is shown that for some image sizes, the performance is significantly hampered by the so-called 64K aliasing problem, which occurs in the Pentium 4 when two data blocks are accessed that are a multiple of 64K apart. It is also shown that for the (5, 3) lifting scheme, a 12-bit word size is sufficient for a 5-level decomposition of the 2D DWT for images of up to 10 bits per pixel.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper focuses on SIMD implementations of the 2D discrete wavelet transform (DWT). The transforms considered are Daubechies? real-to-real method of four coef ficients (Daub-4) and the integer-to-integer (5, 3) lifting scheme. Daub-4 is implemented using SSE and the lifting scheme using MMX, and their performance is compared to C implementations on a Pentium 4 processor. The MMX implementation of the lifting scheme is up to 4.0x faster than the corresponding C program for a 1-level 2D DWT, while the SSE implementation of Daub-4 is up to 2.6x faster than the C version. It is shown that for some image sizes, the performance is significantly hampered by the so-called 64K aliasing problem, which occurs in the Pentium 4 when two data blocks are accessed that are a multiple of 64K apart. It is also shown that for the (5, 3) lifting scheme, a 12-bit word size is sufficient for a 5-level decomposition of the 2D DWT for images of up to 10 bits per pixel.",
"fno": "24070393",
"keywords": [
"Discrete Wavelet Transform",
"Lifting Scheme",
"SIMD Extensions"
],
"authors": [
{
"affiliation": "Computer Engineering Laboratory Faculty of Electrical Engineering, Mathematics, and Computer Science Delft University of Technology, The Netherlands",
"fullName": "Asadollah Shahbahrami",
"givenName": "Asadollah",
"surname": "Shahbahrami",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Computer Engineering Laboratory Faculty of Electrical Engineering, Mathematics, and Computer Science Delft University of Technology, The Netherlands",
"fullName": "Ben Juurlink",
"givenName": "Ben",
"surname": "Juurlink",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Computer Engineering Laboratory Faculty of Electrical Engineering, Mathematics, and Computer Science Delft University of Technology, The Netherlands",
"fullName": "Stamatis Vassiliadis",
"givenName": "Stamatis",
"surname": "Vassiliadis",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "asap",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-07-01T00:00:00",
"pubType": "proceedings",
"pages": "393-398",
"year": "2005",
"issn": "1063-6862",
"isbn": "0-7695-2407-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "24070387",
"articleId": "12OmNzmclzE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "24070399",
"articleId": "12OmNBU1jOP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ams/2008/3136/0/3136a998",
"title": "High-Speed and Power Efficient Lifting-Based VLSI Architecture for Two-Dimesional Discrete Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/ams/2008/3136a998/12OmNCfAPF0",
"parentPublication": {
"id": "proceedings/ams/2008/3136/0",
"title": "Asia International Conference on Modelling & Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031b096",
"title": "Gray Image Watermark Algorithm in Integer Wavelet Transform Domain",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031b096/12OmNqBtiNo",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcecs/2008/3555/0/3555a021",
"title": "Speech Compression FPGA Design by Using Different Discrete Wavelet Transform Schemes",
"doi": null,
"abstractUrl": "/proceedings-article/wcecs/2008/3555a021/12OmNrFBQ0K",
"parentPublication": {
"id": "proceedings/wcecs/2008/3555/0",
"title": "World Congress on Engineering and Computer Science, Advances in Electrical and Electronics Engineering - IAENG Special Edition of the",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2005/9331/0/01521548",
"title": "An Efficient Architecture for Lifting-Based Forward and Inverse Discrete Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2005/01521548/12OmNvCi43o",
"parentPublication": {
"id": "proceedings/icme/2005/9331/0",
"title": "2005 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisp/2008/3119/4/3119d362",
"title": "FPGA Design of Fast Lifting Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119d362/12OmNwE9OUM",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/4",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2003/1926/0/19260228b",
"title": "Vectorization of the 2D Wavelet Lifting Transform Using SIMD Extensions",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2003/19260228b/12OmNx5Yvdi",
"parentPublication": {
"id": "proceedings/ipdps/2003/1926/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2008/3278/0/3278a647",
"title": "A Novel Efficient VLSI Architecture of 2-D Discrete Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a647/12OmNx7ov5J",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/1/4296a032",
"title": "A Design of M-Channels Lifting Wavelet Filter in Signal Processing",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296a032/12OmNzFv4eb",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/1",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2011/08/ttc2011081207",
"title": "Efficient Multi-Input/Multi-Output VLSI Architecture for Two-Dimensional Lifting-Based Discrete Wavelet Transform",
"doi": null,
"abstractUrl": "/journal/tc/2011/08/ttc2011081207/13rRUwhpBNq",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2004/04/t0386",
"title": "VLSI Implementation for One-Dimensional Multilevel Lifting-Based Wavelet Transform",
"doi": null,
"abstractUrl": "/journal/tc/2004/04/t0386/13rRUxZ0o0y",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBqMDBv",
"title": "Computer, Consumer and Control, International Symposium on",
"acronym": "is3c",
"groupId": "1801670",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrYlmPl",
"doi": "10.1109/IS3C.2012.106",
"title": "Enhancement Speech Compression Technique Using Modern Wavelet Transforms",
"normalizedTitle": "Enhancement Speech Compression Technique Using Modern Wavelet Transforms",
"abstract": "The Discrete Wavelet Transform is the most powerful and new signal compression technique which uses multi-resolution analysis for analyzing speech signal. This article proposes the frequency loss less comparison of the modern wavelets based on speech compression technique. Haar wavelet (Haar), Biorthogonal wavelet (Bior) and Discrete approximation of Meyer wavelet (Dmey) are investigated in this experiment with eighty speech signal from male and female. The experiments indicated that the Bior provides the best performance in time and frequency domain. Also it can also gain the compression rate as 2.67 to the original speech signal.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The Discrete Wavelet Transform is the most powerful and new signal compression technique which uses multi-resolution analysis for analyzing speech signal. This article proposes the frequency loss less comparison of the modern wavelets based on speech compression technique. Haar wavelet (Haar), Biorthogonal wavelet (Bior) and Discrete approximation of Meyer wavelet (Dmey) are investigated in this experiment with eighty speech signal from male and female. The experiments indicated that the Bior provides the best performance in time and frequency domain. Also it can also gain the compression rate as 2.67 to the original speech signal.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The Discrete Wavelet Transform is the most powerful and new signal compression technique which uses multi-resolution analysis for analyzing speech signal. This article proposes the frequency loss less comparison of the modern wavelets based on speech compression technique. Haar wavelet (Haar), Biorthogonal wavelet (Bior) and Discrete approximation of Meyer wavelet (Dmey) are investigated in this experiment with eighty speech signal from male and female. The experiments indicated that the Bior provides the best performance in time and frequency domain. Also it can also gain the compression rate as 2.67 to the original speech signal.",
"fno": "4655a393",
"keywords": [
"Speech Signal Compression",
"Haar Wavelet",
"Biorthogonal Wavelet",
"Discrete Approximation Of Meyer Wavelet"
],
"authors": [
{
"affiliation": null,
"fullName": "Supatinee Kornsing",
"givenName": "Supatinee",
"surname": "Kornsing",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jakkree Srinonchat",
"givenName": "Jakkree",
"surname": "Srinonchat",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "is3c",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-06-01T00:00:00",
"pubType": "proceedings",
"pages": "393-396",
"year": "2012",
"issn": null,
"isbn": "978-0-7695-4655-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4655a389",
"articleId": "12OmNvrvjcA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4655a397",
"articleId": "12OmNy7QfoV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icci/2006/0475/1/04216414",
"title": "Multivariate Statistical Modeling for Medical Image Compression Using Wavelet Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/icci/2006/04216414/12OmNBU1jHD",
"parentPublication": {
"id": "proceedings/icci/2006/0475/1",
"title": "Cognitive Informatics, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2011/4367/0/4367b054",
"title": "Enhancement of Discrete Wavelet Transform (DWT) for Image Transmission over Internet",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2011/4367b054/12OmNBpEeTc",
"parentPublication": {
"id": "proceedings/itng/2011/4367/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/1995/7012/0/70120232",
"title": "Self-quantized wavelet subtrees: a wavelet-based theory for fractal image compression",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1995/70120232/12OmNBpmDDb",
"parentPublication": {
"id": "proceedings/dcc/1995/7012/0",
"title": "Proceedings DCC '95 Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcecs/2008/3555/0/3555a021",
"title": "Speech Compression FPGA Design by Using Different Discrete Wavelet Transform Schemes",
"doi": null,
"abstractUrl": "/proceedings-article/wcecs/2008/3555a021/12OmNrFBQ0K",
"parentPublication": {
"id": "proceedings/wcecs/2008/3555/0",
"title": "World Congress on Engineering and Computer Science, Advances in Electrical and Electronics Engineering - IAENG Special Edition of the",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apwcs/2010/4003/0/4003a315",
"title": "Linear-Regression Model Based Wavelet Filter Evaluation for Image Compression",
"doi": null,
"abstractUrl": "/proceedings-article/apwcs/2010/4003a315/12OmNrJAeh8",
"parentPublication": {
"id": "proceedings/apwcs/2010/4003/0",
"title": "Wearable Computing Systems, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2010/4215/0/4215a077",
"title": "Improvement of Speech Source Localization in Noisy Environment Using Overcomplete Rational-Dilation Wavelet Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2010/4215a077/12OmNyKa68p",
"parentPublication": {
"id": "proceedings/cw/2010/4215/0",
"title": "2010 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/reconfig/2006/0689/0/04099992",
"title": "Reconfigurable Implementation of Wavelet Integer Lifting Transforms for Image Compression",
"doi": null,
"abstractUrl": "/proceedings-article/reconfig/2006/04099992/12OmNylbouB",
"parentPublication": {
"id": "proceedings/reconfig/2006/0689/0",
"title": "Reconfigurable Computing and FPGAs, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iptc/2010/4196/0/4196a479",
"title": "The Compressive Sensing Based on Biorthogonal Wavelet Basis",
"doi": null,
"abstractUrl": "/proceedings-article/iptc/2010/4196a479/12OmNyyeWxG",
"parentPublication": {
"id": "proceedings/iptc/2010/4196/0",
"title": "Intelligence Information Processing and Trusted Computing, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccms/2010/3941/1/3941a360",
"title": "Speech Compression with Best Wavelet Packet Transform and SPIHT Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/iccms/2010/3941a360/12OmNzC5Tc2",
"parentPublication": {
"id": "proceedings/iccms/2010/3941/3",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/1999/0293/0/02930147",
"title": "An Efficient Wavelet-Based Compression Method for Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/pg/1999/02930147/12OmNzZmZif",
"parentPublication": {
"id": "proceedings/pg/1999/0293/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxwncA6",
"title": "2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS 2009)",
"acronym": "paccs",
"groupId": "1002867",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxZTtI1",
"doi": "10.1109/PACCS.2009.133",
"title": "Based on Lifting Scheme Improve Double Adaptive Wavelet Transforms",
"normalizedTitle": "Based on Lifting Scheme Improve Double Adaptive Wavelet Transforms",
"abstract": "Because of the better temporal and frequency properties, the wavelet linear approximation can approximate smooth signals very efficiently with the constant size filter. However, standard wavelet linear approximation techniques cannot achieve similar results for signal which are not smooth. Based on the adaptive lifting scheme with perfect reconstruction presented by G. Piella and the author’s previous research, this paper proposed the improved double adaptive wavelet transform which can achieve the better linear approximation for the piecewise continuous signals.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Because of the better temporal and frequency properties, the wavelet linear approximation can approximate smooth signals very efficiently with the constant size filter. However, standard wavelet linear approximation techniques cannot achieve similar results for signal which are not smooth. Based on the adaptive lifting scheme with perfect reconstruction presented by G. Piella and the author’s previous research, this paper proposed the improved double adaptive wavelet transform which can achieve the better linear approximation for the piecewise continuous signals.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Because of the better temporal and frequency properties, the wavelet linear approximation can approximate smooth signals very efficiently with the constant size filter. However, standard wavelet linear approximation techniques cannot achieve similar results for signal which are not smooth. Based on the adaptive lifting scheme with perfect reconstruction presented by G. Piella and the author’s previous research, this paper proposed the improved double adaptive wavelet transform which can achieve the better linear approximation for the piecewise continuous signals.",
"fno": "3614a698",
"keywords": [
"Lifting Scheme Adaptive Wavelet Transform Piecewise Continuous Signals"
],
"authors": [
{
"affiliation": null,
"fullName": "Gao Guangchun",
"givenName": "Gao",
"surname": "Guangchun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zhao Shengying",
"givenName": "Zhao",
"surname": "Shengying",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zhu Hongli",
"givenName": "Zhu",
"surname": "Hongli",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shang Lina",
"givenName": "Shang",
"surname": "Lina",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "paccs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-05-01T00:00:00",
"pubType": "proceedings",
"pages": "698-701",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3614-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3614a694",
"articleId": "12OmNBbsij4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3614a702",
"articleId": "12OmNvkpkV7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iwcfta/2009/3853/0/3853a157",
"title": "Adaptive Noise Reduction Method for Chaotic Signals Using Dual-Lifting Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iwcfta/2009/3853a157/12OmNAfPITI",
"parentPublication": {
"id": "proceedings/iwcfta/2009/3853/0",
"title": "Chaos-Fractals Theories and Applications, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2008/3494/1/3494a281",
"title": "Fabric Defect Detection Based on Wavelet Decomposition with One Resolution Level",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a281/12OmNvwC5vN",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisp/2008/3119/4/3119d362",
"title": "FPGA Design of Fast Lifting Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119d362/12OmNwE9OUM",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/4",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/prdc/2004/2076/0/20760227",
"title": "Protecting Wavelet Lifting Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/prdc/2004/20760227/12OmNwFid6u",
"parentPublication": {
"id": "proceedings/prdc/2004/2076/0",
"title": "Pacific Rim International Symposium on Dependable Computing, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/reconfig/2006/0689/0/04099992",
"title": "Reconfigurable Implementation of Wavelet Integer Lifting Transforms for Image Compression",
"doi": null,
"abstractUrl": "/proceedings-article/reconfig/2006/04099992/12OmNylbouB",
"parentPublication": {
"id": "proceedings/reconfig/2006/0689/0",
"title": "Reconfigurable Computing and FPGAs, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/kam/2008/3488/0/3488a628",
"title": "Wavelets Based on Lifting Scheme and Its Application on Image Processing",
"doi": null,
"abstractUrl": "/proceedings-article/kam/2008/3488a628/12OmNz5s0V6",
"parentPublication": {
"id": "proceedings/kam/2008/3488/0",
"title": "Knowledge Acquisition and Modeling, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/1/4296a032",
"title": "A Design of M-Channels Lifting Wavelet Filter in Signal Processing",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296a032/12OmNzFv4eb",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/1",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2011/4409/0/4409a911",
"title": "New Object Detection for On-board Robot Vision by Lifting Complex Wavelet Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2011/4409a911/12OmNzRqdDS",
"parentPublication": {
"id": "proceedings/icdmw/2011/4409/0",
"title": "2011 IEEE 11th International Conference on Data Mining Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/04/v0649",
"title": "Mean Square Error Approximation for Wavelet-Based Semiregular Mesh Compression",
"doi": null,
"abstractUrl": "/journal/tg/2006/04/v0649/13rRUwfZC02",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2004/04/t0386",
"title": "VLSI Implementation for One-Dimensional Multilevel Lifting-Based Wavelet Transform",
"doi": null,
"abstractUrl": "/journal/tc/2004/04/t0386/13rRUxZ0o0y",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvk7JJV",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"acronym": "icmtma",
"groupId": "1002837",
"volume": "1",
"displayVolume": "1",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzFv4eb",
"doi": "10.1109/ICMTMA.2011.15",
"title": "A Design of M-Channels Lifting Wavelet Filter in Signal Processing",
"normalizedTitle": "A Design of M-Channels Lifting Wavelet Filter in Signal Processing",
"abstract": "The key idea of the lifting scheme is constructed wavelet filters by several predict operators and update operators. We know that the poly-phase matrix can be factored into finite matrixes, and these matrixes can be regarded as the predict operators and update operators. According to the theory of M-channels wavelet transform, the construction of the M-channels wavelet filters based on the lifting scheme are given in this paper. It’s different to the traditional method. Any filters based on the lifting scheme are automatically satisfied with the exact reconstruction condition, the constructing predict filters are satisfied with degree dual vanishing moments and the constructing update filters are satisfied with degree basal vanishing moments, and some examples are given.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The key idea of the lifting scheme is constructed wavelet filters by several predict operators and update operators. We know that the poly-phase matrix can be factored into finite matrixes, and these matrixes can be regarded as the predict operators and update operators. According to the theory of M-channels wavelet transform, the construction of the M-channels wavelet filters based on the lifting scheme are given in this paper. It’s different to the traditional method. Any filters based on the lifting scheme are automatically satisfied with the exact reconstruction condition, the constructing predict filters are satisfied with degree dual vanishing moments and the constructing update filters are satisfied with degree basal vanishing moments, and some examples are given.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The key idea of the lifting scheme is constructed wavelet filters by several predict operators and update operators. We know that the poly-phase matrix can be factored into finite matrixes, and these matrixes can be regarded as the predict operators and update operators. According to the theory of M-channels wavelet transform, the construction of the M-channels wavelet filters based on the lifting scheme are given in this paper. It’s different to the traditional method. Any filters based on the lifting scheme are automatically satisfied with the exact reconstruction condition, the constructing predict filters are satisfied with degree dual vanishing moments and the constructing update filters are satisfied with degree basal vanishing moments, and some examples are given.",
"fno": "4296a032",
"keywords": [
"Wavelet Transform",
"Lifting Scheme",
"Wavelet Filters"
],
"authors": [
{
"affiliation": null,
"fullName": "Lin Zhenxian",
"givenName": "Lin",
"surname": "Zhenxian",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xue Wen",
"givenName": "Xue",
"surname": "Wen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icmtma",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-01-01T00:00:00",
"pubType": "proceedings",
"pages": "32-35",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4296-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4296a028",
"articleId": "12OmNC1oT4Y",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4296a036",
"articleId": "12OmNx7G69B",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icoip/2010/4252/1/4252a619",
"title": "Incipient Fault Feature Extraction Using Lifting Scheme Packet",
"doi": null,
"abstractUrl": "/proceedings-article/icoip/2010/4252a619/12OmNAi6vV1",
"parentPublication": {
"id": "proceedings/icoip/2010/4252/2",
"title": "Optoelectronics and Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iptc/2010/4196/0/4196a659",
"title": "Image Fusion Based on Lifting Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iptc/2010/4196a659/12OmNApu5nJ",
"parentPublication": {
"id": "proceedings/iptc/2010/4196/0",
"title": "Intelligence Information Processing and Trusted Computing, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ihmsc/2009/3752/1/3752a025",
"title": "Image Edge Detection Based on Lifting Wavelet",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2009/3752a025/12OmNCwlacG",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/3/01326496",
"title": "(N,0) motion-compensated lifting-based wavelet transform",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326496/12OmNqJHFBm",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/3",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/2005/2407/0/24070393",
"title": "Performance Comparison of SIMD Implementations of the Discrete Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2005/24070393/12OmNrYCXKH",
"parentPublication": {
"id": "proceedings/asap/2005/2407/0",
"title": "2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2010/4360/0/4360a129",
"title": "A Data Compression Method for Traffic Loop Detectors' Signals Based on Lifting Wavelet Transformation and Entropy Coding",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2010/4360a129/12OmNx4gUlv",
"parentPublication": {
"id": "proceedings/isise/2010/4360/0",
"title": "2010 Third International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paccs/2009/3614/0/3614a698",
"title": "Based on Lifting Scheme Improve Double Adaptive Wavelet Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/paccs/2009/3614a698/12OmNxZTtI1",
"parentPublication": {
"id": "proceedings/paccs/2009/3614/0",
"title": "2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2011/4501/0/4501a216",
"title": "Digital Watermarking Algorithm for Relational Database Based on Lifting Wavelet Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2011/4501a216/12OmNyGtjlw",
"parentPublication": {
"id": "proceedings/iccis/2011/4501/0",
"title": "2011 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031e576",
"title": "A Blind Watermarking Algorithm Based on Lifting Wavelet Transform and Scrambling Technology",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031e576/12OmNzRZpWI",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2004/04/t0386",
"title": "VLSI Implementation for One-Dimensional Multilevel Lifting-Based Wavelet Transform",
"doi": null,
"abstractUrl": "/journal/tc/2004/04/t0386/13rRUxZ0o0y",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBC8AAD",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC4eSyd",
"doi": "10.1109/VR.2010.5444758",
"title": "Dynamic control of multiple focal-plane projections for eliminating defocus and occlusion",
"normalizedTitle": "Dynamic control of multiple focal-plane projections for eliminating defocus and occlusion",
"abstract": "This paper presents a novel dynamic control of multiple focal-plane projections. Our approach multiplexes the projectors' focal-planes so that all the displayed images are focused. The projectors are placed at various locations with various directions in the scene so that there is no occlusion of the projection light even for dynamically moving objects. Our approach compensates for defocus blur, oblique blur (loss of high-spatial-frequency components according to the incidence angle of the projection light), and cast shadows of projected images. This is achieved by selecting an optimal projector that can display the finest image for each point of the object surface by comparing the projectors' point spread functions (PSFs). The proposed approach requires geometric calibration to be performed only once in advance. Our approach can compute PSFs without any additional calibrations even when the surface moves if it is tracked by an external sensor. The method is particularly useful in interactive systems in which the object to be projected is tracked.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a novel dynamic control of multiple focal-plane projections. Our approach multiplexes the projectors' focal-planes so that all the displayed images are focused. The projectors are placed at various locations with various directions in the scene so that there is no occlusion of the projection light even for dynamically moving objects. Our approach compensates for defocus blur, oblique blur (loss of high-spatial-frequency components according to the incidence angle of the projection light), and cast shadows of projected images. This is achieved by selecting an optimal projector that can display the finest image for each point of the object surface by comparing the projectors' point spread functions (PSFs). The proposed approach requires geometric calibration to be performed only once in advance. Our approach can compute PSFs without any additional calibrations even when the surface moves if it is tracked by an external sensor. The method is particularly useful in interactive systems in which the object to be projected is tracked.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a novel dynamic control of multiple focal-plane projections. Our approach multiplexes the projectors' focal-planes so that all the displayed images are focused. The projectors are placed at various locations with various directions in the scene so that there is no occlusion of the projection light even for dynamically moving objects. Our approach compensates for defocus blur, oblique blur (loss of high-spatial-frequency components according to the incidence angle of the projection light), and cast shadows of projected images. This is achieved by selecting an optimal projector that can display the finest image for each point of the object surface by comparing the projectors' point spread functions (PSFs). The proposed approach requires geometric calibration to be performed only once in advance. Our approach can compute PSFs without any additional calibrations even when the surface moves if it is tracked by an external sensor. The method is particularly useful in interactive systems in which the object to be projected is tracked.",
"fno": "05444758",
"keywords": [
"Interactive Systems",
"Dynamic Control",
"Multiple Focal Plane Projections",
"Occlusion",
"Dynamically Moving Objects",
"Defocus Blur",
"Oblique Blur",
"High Spatial Frequency Components",
"Incidence Angle",
"Projection Light",
"Optimal Projector",
"Point Spread Functions",
"Geometric Calibration"
],
"authors": [
{
"affiliation": "Grad. Sch. of Eng. Sci., Osaka Univ., Suita, Japan",
"fullName": "Momoyo Nagase",
"givenName": "Momoyo",
"surname": "Nagase",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Grad. Sch. of Eng. Sci., Osaka Univ., Suita, Japan",
"fullName": "Daisuke Iwai",
"givenName": "Daisuke",
"surname": "Iwai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Grad. Sch. of Eng. Sci., Osaka Univ., Suita, Japan",
"fullName": "Kosuke Sato",
"givenName": "Kosuke",
"surname": "Sato",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-03-01T00:00:00",
"pubType": "proceedings",
"pages": "293-294",
"year": "2010",
"issn": null,
"isbn": "978-1-4244-6237-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05444761",
"articleId": "12OmNyQ7FNa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05444759",
"articleId": "12OmNB0nWfz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icip/1995/7310/3/73103636",
"title": "A block shift-variant blur model for recovering depth from defocused images",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73103636/12OmNxiKrYX",
"parentPublication": {
"id": "proceedings/icip/1995/7310/3",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1999/07/i0577",
"title": "An MRF Model-Based Approach to Simultaneous Recovery of Depth and Restoration from Defocused Images",
"doi": null,
"abstractUrl": "/journal/tp/1999/07/i0577/13rRUEgarkr",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/07/i0699",
"title": "Local Scale Control for Edge Detection and Blur Estimation",
"doi": null,
"abstractUrl": "/journal/tp/1998/07/i0699/13rRUwInvg9",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/06/i0652",
"title": "Recovering Affine Motion and Defocus Blur Simultaneously",
"doi": null,
"abstractUrl": "/journal/tp/1998/06/i0652/13rRUxC0SF6",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyoiYVp",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"acronym": "3dv",
"groupId": "1800494",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCmpcHL",
"doi": "10.1109/3DV.2016.67",
"title": "Discriminative Filters for Depth from Defocus",
"normalizedTitle": "Discriminative Filters for Depth from Defocus",
"abstract": "Depth from defocus (DFD) requires estimating the depth dependent defocus blur at every pixel. Several approaches for accomplishing this have been proposed over the years. For a pair of images this is done by modeling the defocus relationship between the two differently defocused images and for single defocused images by relying on the the properties of the point spread function and the characteristics of the latent sharp image. We propose depth discriminative filters for DFD that can represent many of the widely used models such as the relative blur, Blur Equalization Technique, deconvolution based depth estimation, and subspace projection methods. We show that by optimizing the parameters of this general model we can obtain state-of-the-art result on synthetic and real defocused images with single or multiple defocused images with different apertures.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Depth from defocus (DFD) requires estimating the depth dependent defocus blur at every pixel. Several approaches for accomplishing this have been proposed over the years. For a pair of images this is done by modeling the defocus relationship between the two differently defocused images and for single defocused images by relying on the the properties of the point spread function and the characteristics of the latent sharp image. We propose depth discriminative filters for DFD that can represent many of the widely used models such as the relative blur, Blur Equalization Technique, deconvolution based depth estimation, and subspace projection methods. We show that by optimizing the parameters of this general model we can obtain state-of-the-art result on synthetic and real defocused images with single or multiple defocused images with different apertures.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Depth from defocus (DFD) requires estimating the depth dependent defocus blur at every pixel. Several approaches for accomplishing this have been proposed over the years. For a pair of images this is done by modeling the defocus relationship between the two differently defocused images and for single defocused images by relying on the the properties of the point spread function and the characteristics of the latent sharp image. We propose depth discriminative filters for DFD that can represent many of the widely used models such as the relative blur, Blur Equalization Technique, deconvolution based depth estimation, and subspace projection methods. We show that by optimizing the parameters of this general model we can obtain state-of-the-art result on synthetic and real defocused images with single or multiple defocused images with different apertures.",
"fno": "5407a592",
"keywords": [
"Convolution",
"Estimation",
"Deconvolution",
"Apertures",
"Cameras",
"Optics",
"Image Reconstruction",
"Subspace Projection",
"Depth From Defocus",
"Discriminative Filters",
"Relative Blur",
"Blur Equalization Technique",
"Deconvolution"
],
"authors": [
{
"affiliation": null,
"fullName": "Fahim Mannan",
"givenName": "Fahim",
"surname": "Mannan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Michael S. Langer",
"givenName": "Michael S.",
"surname": "Langer",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "3dv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-10-01T00:00:00",
"pubType": "proceedings",
"pages": "592-600",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-5407-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "5407a582",
"articleId": "12OmNxFJXQ7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "5407a601",
"articleId": "12OmNxA3YYR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2015/8332/0/8332a326",
"title": "Optimal Camera Parameters for Depth from Defocus",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2015/8332a326/12OmNC8MsHb",
"parentPublication": {
"id": "proceedings/3dv/2015/8332/0",
"title": "2015 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2016/2491/0/2491a281",
"title": "Blur Calibration for Depth from Defocus",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2016/2491a281/12OmNs59JP3",
"parentPublication": {
"id": "proceedings/crv/2016/2491/0",
"title": "2016 13th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2016/2491/0/2491a273",
"title": "What is a Good Model for Depth from Defocus?",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2016/2491a273/12OmNvCzFe8",
"parentPublication": {
"id": "proceedings/crv/2016/2491/0",
"title": "2016 13th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457e773",
"title": "Depth from Defocus in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457e773/12OmNx5Yvot",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a370",
"title": "Video Depth-from-Defocus",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a370/12OmNy5hRoj",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2001/1143/1/00937556",
"title": "Depth from defocus in presence of partial self occlusion",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/00937556/12OmNzyYib1",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/06/06702415",
"title": "A Unified Approach for Registration and Depth in Depth from Defocus",
"doi": null,
"abstractUrl": "/journal/tp/2014/06/06702415/13rRUy0HYL2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2020/9891/0/09108672",
"title": "Depth from Defocus on a Transmissive Diffraction Mask-based Sensor",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2020/09108672/1kpIGXFofZe",
"parentPublication": {
"id": "proceedings/crv/2020/9891/0",
"title": "2020 17th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2020/8128/0/812800b206",
"title": "A Novel Depth from Defocus Framework Based on a Thick Lens Camera Model",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2020/812800b206/1qyxoyCLZbW",
"parentPublication": {
"id": "proceedings/3dv/2020/8128/0",
"title": "2020 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2021/1952/0/09466261",
"title": "Depth from Defocus with Learned Optics for Imaging and Occlusion-aware Depth Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2021/09466261/1uSSVCuXE7C",
"parentPublication": {
"id": "proceedings/iccp/2021/1952/0",
"title": "2021 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyKJiaV",
"title": "Pattern Recognition, International Conference on",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqGRGkM",
"doi": "10.1109/ICPR.2010.1104",
"title": "Colour Constant Image Sharpening",
"normalizedTitle": "Colour Constant Image Sharpening",
"abstract": "In this paper, we introduce a new sharpening method which guarantees colour constancy and resolves the problem of equiluminance colours. The algorithm is similar to unsharp masking in that the gradients are calculated at different scales by blurring the original with a variable size kernel. The main difference is in the blurring stage where we calculate the average of an n times n neighborhood by projecting each colour vector onto the space of the center pixel before averaging. Thus starting with the center pixel we define a projection matrix onto the space of that vector. Each neighboring colour is then projected onto the center and the result is summed up. The projection step results in an average vector which shares the direction of the original center pixel. The difference between the center pixel and the average is by definition a vector which is scalar away from the center pixel. Thus adding the average to the center pixel is guaranteed not to result in colour shifts. This projection step is also shown to remedy the problem of equiluminance colours and can be used for Z_$m$_Z-dimensional data. Finally, the results indicate that the new sharpening method results in better sharpening than that achieved using unsharp masking with noticeably less halos around strong edges. The latter aspect of the algorithm is believed to be due to the asymmetric nature of the projection step.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we introduce a new sharpening method which guarantees colour constancy and resolves the problem of equiluminance colours. The algorithm is similar to unsharp masking in that the gradients are calculated at different scales by blurring the original with a variable size kernel. The main difference is in the blurring stage where we calculate the average of an n times n neighborhood by projecting each colour vector onto the space of the center pixel before averaging. Thus starting with the center pixel we define a projection matrix onto the space of that vector. Each neighboring colour is then projected onto the center and the result is summed up. The projection step results in an average vector which shares the direction of the original center pixel. The difference between the center pixel and the average is by definition a vector which is scalar away from the center pixel. Thus adding the average to the center pixel is guaranteed not to result in colour shifts. This projection step is also shown to remedy the problem of equiluminance colours and can be used for $m$-dimensional data. Finally, the results indicate that the new sharpening method results in better sharpening than that achieved using unsharp masking with noticeably less halos around strong edges. The latter aspect of the algorithm is believed to be due to the asymmetric nature of the projection step.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we introduce a new sharpening method which guarantees colour constancy and resolves the problem of equiluminance colours. The algorithm is similar to unsharp masking in that the gradients are calculated at different scales by blurring the original with a variable size kernel. The main difference is in the blurring stage where we calculate the average of an n times n neighborhood by projecting each colour vector onto the space of the center pixel before averaging. Thus starting with the center pixel we define a projection matrix onto the space of that vector. Each neighboring colour is then projected onto the center and the result is summed up. The projection step results in an average vector which shares the direction of the original center pixel. The difference between the center pixel and the average is by definition a vector which is scalar away from the center pixel. Thus adding the average to the center pixel is guaranteed not to result in colour shifts. This projection step is also shown to remedy the problem of equiluminance colours and can be used for --dimensional data. Finally, the results indicate that the new sharpening method results in better sharpening than that achieved using unsharp masking with noticeably less halos around strong edges. The latter aspect of the algorithm is believed to be due to the asymmetric nature of the projection step.",
"fno": "4109e545",
"keywords": [
"Image",
"Sharpening"
],
"authors": [
{
"affiliation": null,
"fullName": "Ali Alsam",
"givenName": "Ali",
"surname": "Alsam",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-08-01T00:00:00",
"pubType": "proceedings",
"pages": "4545-4548",
"year": "2010",
"issn": "1051-4651",
"isbn": "978-0-7695-4109-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4109e541",
"articleId": "12OmNzVoBB0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4109e549",
"articleId": "12OmNxWLTon",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/crv/2010/4040/0/4040a079",
"title": "The Effect of Colour Space on Image Sharpening Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2010/4040a079/12OmNApu5gg",
"parentPublication": {
"id": "proceedings/crv/2010/4040/0",
"title": "2010 Canadian Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2920/0/00202088",
"title": "Colour image segmentation using boundary relaxation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00202088/12OmNCeaPZ9",
"parentPublication": {
"id": "proceedings/icpr/1992/2920/0",
"title": "11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dese/2016/5487/0/07930661",
"title": "Colour Constancy Using K-Means Clustering Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/dese/2016/07930661/12OmNrFTr5A",
"parentPublication": {
"id": "proceedings/dese/2016/5487/0",
"title": "2016 9th International Conference on Developments in eSystems Engineering (DeSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2013/3755/0/06755054",
"title": "Local colour statistics for edge definition",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2013/06755054/12OmNwCaCsF",
"parentPublication": {
"id": "proceedings/iscc/2013/3755/0",
"title": "2013 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109c214",
"title": "Content-Adaptive Automatic Image Sharpening",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109c214/12OmNx7ouY3",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2008/3508/1/3508a285",
"title": "Semi-Fragile Watermarking Based on Image Gradient",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2008/3508a285/12OmNxjjEeg",
"parentPublication": {
"id": "proceedings/cis/2008/3508/1",
"title": "2008 International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2009/3736/2/3736b424",
"title": "Research on Real-Time Image Sharpening Methods Based on Optimized Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736b424/12OmNxjjEma",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/2",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2004/2244/0/01410385",
"title": "Novel histogram processing for colour image enhancement",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2004/01410385/12OmNxwncjk",
"parentPublication": {
"id": "proceedings/icig/2004/2244/0",
"title": "Proceedings. Third International Conference on Image and Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/2/81832326",
"title": "Text and image sharpening of scanned images in the JPEG domain",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81832326/12OmNyugyWC",
"parentPublication": {
"id": "proceedings/icip/1997/8183/2",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/3/3336e579",
"title": "A Semi-fragile Watermarking Tolerant of Laplacian Sharpening",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336e579/12OmNywfKDx",
"parentPublication": {
"id": "proceedings/csse/2008/3336/3",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyKJiwQ",
"title": "2013 IEEE International Conference on Computational Photography (ICCP)",
"acronym": "iccp",
"groupId": "1800125",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxUMHoq",
"doi": "10.1109/ICCPhot.2013.6528303",
"title": "High-rank coded aperture projection for extended depth of field",
"normalizedTitle": "High-rank coded aperture projection for extended depth of field",
"abstract": "Projectors require large apertures to maximize light throughput. Unfortunately, this leads to shallow depths of field (DOF), hence blurry images, when projecting on non-planar surfaces, such as cultural heritage sites, curved screens, or when sharing visual information in everyday environments. We introduce high-rank coded aperture projectors - a new computational display technology that combines optical designs with computational processing to overcome depth of field limitations of conventional devices. In particular, we employ high-speed spatial light modulators (SLMs) on the image plane and in the aperture of modified projectors. The patterns displayed on these SLMs are computed with a new mathematical framework that uses high-rank light field factorizations and directly exploits the limited temporal resolution and contrast sensitivity of the human visual system. With an experimental prototype projector, we demonstrate significantly increased DOF as compared to conventional technology.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Projectors require large apertures to maximize light throughput. Unfortunately, this leads to shallow depths of field (DOF), hence blurry images, when projecting on non-planar surfaces, such as cultural heritage sites, curved screens, or when sharing visual information in everyday environments. We introduce high-rank coded aperture projectors - a new computational display technology that combines optical designs with computational processing to overcome depth of field limitations of conventional devices. In particular, we employ high-speed spatial light modulators (SLMs) on the image plane and in the aperture of modified projectors. The patterns displayed on these SLMs are computed with a new mathematical framework that uses high-rank light field factorizations and directly exploits the limited temporal resolution and contrast sensitivity of the human visual system. With an experimental prototype projector, we demonstrate significantly increased DOF as compared to conventional technology.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Projectors require large apertures to maximize light throughput. Unfortunately, this leads to shallow depths of field (DOF), hence blurry images, when projecting on non-planar surfaces, such as cultural heritage sites, curved screens, or when sharing visual information in everyday environments. We introduce high-rank coded aperture projectors - a new computational display technology that combines optical designs with computational processing to overcome depth of field limitations of conventional devices. In particular, we employ high-speed spatial light modulators (SLMs) on the image plane and in the aperture of modified projectors. The patterns displayed on these SLMs are computed with a new mathematical framework that uses high-rank light field factorizations and directly exploits the limited temporal resolution and contrast sensitivity of the human visual system. With an experimental prototype projector, we demonstrate significantly increased DOF as compared to conventional technology.",
"fno": "06528303",
"keywords": [
"Apertures",
"Transmission Line Matrix Methods",
"Sensitivity",
"Image Quality",
"Optical Imaging",
"Approximation Methods",
"Image Resolution"
],
"authors": [
{
"affiliation": "Dept. of Autom., Tsinghua Univ., Beijing, China",
"fullName": "Chenguang Ma",
"givenName": null,
"surname": "Chenguang Ma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Autom., Tsinghua Univ., Beijing, China",
"fullName": "Jinli Suo",
"givenName": null,
"surname": "Jinli Suo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Autom., Tsinghua Univ., Beijing, China",
"fullName": "Qionghai Dai",
"givenName": null,
"surname": "Qionghai Dai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "MIT Media Lab., Cambridge, MA, USA",
"fullName": "R. Raskar",
"givenName": "R.",
"surname": "Raskar",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "MIT Media Lab., Cambridge, MA, USA",
"fullName": "G. Wetzstein",
"givenName": "G.",
"surname": "Wetzstein",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-04-01T00:00:00",
"pubType": "proceedings",
"pages": "1-9",
"year": "2013",
"issn": null,
"isbn": "978-1-4673-6463-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06528302",
"articleId": "12OmNxUMHo6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06528304",
"articleId": "12OmNrJAeb1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2012/2216/0/06460424",
"title": "Coded aperture for projector and camera for robust 3D measurement",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460424/12OmNBpVQ2Y",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2013/5050/0/5050a612",
"title": "All-in-Focus Image Reconstruction Based on Plenoptic Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a612/12OmNs0C9JA",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2013/5050/0/5050a034",
"title": "Unstructured Synthetic Aperture Photograph Based Occluded Object Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a034/12OmNvk7K1n",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2016/1437/0/1437a910",
"title": "Depth Camera Based on Color-Coded Aperture",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437a910/12OmNvm6VHm",
"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/iccv/2015/8391/0/8391d568",
"title": "Active One-Shot Scan for Wide Depth Range Using a Light Field Projector Based on Coded Aperture",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d568/12OmNxdm4Cp",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200c672",
"title": "Time-Multiplexed Coded Aperture Imaging: Learned Coded Aperture and Pixel Exposures for Compressive Imaging Systems",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c672/1BmLc0RAlck",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a449",
"title": "Extended Depth-of-Field Projector using Learned Diffractive Optics",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a449/1MNgNe272U0",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2019/3263/0/08747333",
"title": "Depth From Texture Integration",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2019/08747333/1bcJvSXKrEA",
"parentPublication": {
"id": "proceedings/iccp/2019/3263/0",
"title": "2019 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600a001",
"title": "Privacy-Preserving Action Recognition Using Coded Aperture Videos",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600a001/1iTvt9n9FaE",
"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/11/09523844",
"title": "Directionally Decomposing Structured Light for Projector Calibration",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09523844/1wpqmnzDSzm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy5hRda",
"title": "Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)",
"acronym": "3dpvt",
"groupId": "1000000",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxWuidZ",
"doi": "10.1109/3DPVT.2006.136",
"title": "The Reverse Projection Correlation Principle for Depth from Defocus",
"normalizedTitle": "The Reverse Projection Correlation Principle for Depth from Defocus",
"abstract": "In this paper, we address the problem of finding depth from defocus in a fundamentally new way. Most previous methods have used an approximate model in which blurring is shift invariant and pixel area is negligible. Our model avoids these assumptions. We consider the area in the scene whose radiance is recorded by a pixel on the sensor, and relate the size and shape of that area to the scene's position with respect to the plane of focus. This is the notion of reverse projection, which allows us to illustrate that, when out of focus, neighboring pixels will record light from overlapping regions in the scene. This overlap results in a measurable change in the correlation between the pixels' intensity values. We demonstrate that this relationship can be characterized in such a way as to recover depth from defocused images. Experimental results show the ability of this relationship to accurately predict depth from correlation measurements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we address the problem of finding depth from defocus in a fundamentally new way. Most previous methods have used an approximate model in which blurring is shift invariant and pixel area is negligible. Our model avoids these assumptions. We consider the area in the scene whose radiance is recorded by a pixel on the sensor, and relate the size and shape of that area to the scene's position with respect to the plane of focus. This is the notion of reverse projection, which allows us to illustrate that, when out of focus, neighboring pixels will record light from overlapping regions in the scene. This overlap results in a measurable change in the correlation between the pixels' intensity values. We demonstrate that this relationship can be characterized in such a way as to recover depth from defocused images. Experimental results show the ability of this relationship to accurately predict depth from correlation measurements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we address the problem of finding depth from defocus in a fundamentally new way. Most previous methods have used an approximate model in which blurring is shift invariant and pixel area is negligible. Our model avoids these assumptions. We consider the area in the scene whose radiance is recorded by a pixel on the sensor, and relate the size and shape of that area to the scene's position with respect to the plane of focus. This is the notion of reverse projection, which allows us to illustrate that, when out of focus, neighboring pixels will record light from overlapping regions in the scene. This overlap results in a measurable change in the correlation between the pixels' intensity values. We demonstrate that this relationship can be characterized in such a way as to recover depth from defocused images. Experimental results show the ability of this relationship to accurately predict depth from correlation measurements.",
"fno": "04155780",
"keywords": [
"Image Restoration",
"Reverse Projection Correlation Principle",
"Correlation Measurements",
"Defocused Images",
"Layout",
"Focusing",
"Lenses",
"Computer Vision",
"Humans",
"Shape",
"Cameras",
"Image Reconstruction",
"Equations",
"Optical Sensors"
],
"authors": [
{
"affiliation": "McGill University, Canada",
"fullName": "Scott McCloskey",
"givenName": "Scott",
"surname": "McCloskey",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "McGill University, Canada",
"fullName": "Michael Langer",
"givenName": "Michael",
"surname": "Langer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "McGill University, Canada",
"fullName": "Kaleem Siddiqi",
"givenName": "Kaleem",
"surname": "Siddiqi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "3dpvt",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-06-01T00:00:00",
"pubType": "proceedings",
"pages": "607-614",
"year": "2006",
"issn": null,
"isbn": "0-7695-2825-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "282500599",
"articleId": "12OmNAle6j2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "282500615",
"articleId": "12OmNBubOP7",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2009/3992/0/05206583",
"title": "Uncalibrated synthetic aperture for defocus control",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206583/12OmNAle6ZA",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccms/2010/5642/2/05421108",
"title": "Depth Recovery from Defocus Images Using Total Variation",
"doi": null,
"abstractUrl": "/proceedings-article/iccms/2010/05421108/12OmNBbaH6r",
"parentPublication": {
"id": "proceedings/iccms/2010/5642/2",
"title": "2010 Second International Conference on Computer Modeling and Simulation (ICCMS 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761514",
"title": "Depth recovery using defocus blur at infinity",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761514/12OmNBkxstu",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a592",
"title": "Discriminative Filters for Depth from Defocus",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a592/12OmNCmpcHL",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2016/2491/0/2491a281",
"title": "Blur Calibration for Depth from Defocus",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2016/2491a281/12OmNs59JP3",
"parentPublication": {
"id": "proceedings/crv/2016/2491/0",
"title": "2016 13th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/1993/3752/0/00262992",
"title": "Convolution reverse-projection",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/1993/00262992/12OmNwI8ceM",
"parentPublication": {
"id": "proceedings/cbms/1993/3752/0",
"title": "Proceedings of the Sixth Annual 1993 IEEE Symposium Computer-Based Medical Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1989/1952/0/00037890",
"title": "A depth recovery algorithm using defocus information",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1989/00037890/12OmNy1SFHc",
"parentPublication": {
"id": "proceedings/cvpr/1989/1952/0",
"title": "1989 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/04/07014259",
"title": "Extended Depth-of-Field Projector by Fast Focal Sweep Projection",
"doi": null,
"abstractUrl": "/journal/tg/2015/04/07014259/13rRUxAASVV",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2017/03/07452621",
"title": "Shape Estimation from Shading, Defocus, and Correspondence Using Light-Field Angular Coherence",
"doi": null,
"abstractUrl": "/journal/tp/2017/03/07452621/13rRUxYIN5A",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2019/9552/0/955200a109",
"title": "F-Number Adaptation for Maximizing the Sensor Usage of Light Field Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2019/955200a109/1cdOO2cNfyg",
"parentPublication": {
"id": "proceedings/icme/2019/9552/0",
"title": "2019 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwt5sgJ",
"title": "CVPR 2011",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCzb9vc",
"doi": "10.1109/CVPR.2011.5995603",
"title": "A theory of differential photometric stereo for unknown isotropic BRDFs",
"normalizedTitle": "A theory of differential photometric stereo for unknown isotropic BRDFs",
"abstract": "This paper presents a comprehensive theory of photometric surface reconstruction from image derivatives. For unknown isotropic BRDFs, we show that two measurements of spatial and temporal image derivatives, under unknown light sources on a circle, suffice to determine the surface. This result is the culmination of a series of fundamental observations. First, we discover a photometric invariant that relates image derivatives to the surface geometry, regardless of the form of isotropic BRDF. Next, we show that just two pairs of differential images from unknown light directions suffice to recover surface information from the photometric invariant. This is shown to be equivalent to determining isocontours of constant magnitude of the surface gradient, as well as isocontours of constant depth. Further, we prove that specification of the surface normal at a single point completely determines the surface depth from these isocontours. In addition, we propose practical algorithms that require additional initial or boundary information, but recover depth from lower order derivatives. Our theoretical results are illustrated with several examples on synthetic and real data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a comprehensive theory of photometric surface reconstruction from image derivatives. For unknown isotropic BRDFs, we show that two measurements of spatial and temporal image derivatives, under unknown light sources on a circle, suffice to determine the surface. This result is the culmination of a series of fundamental observations. First, we discover a photometric invariant that relates image derivatives to the surface geometry, regardless of the form of isotropic BRDF. Next, we show that just two pairs of differential images from unknown light directions suffice to recover surface information from the photometric invariant. This is shown to be equivalent to determining isocontours of constant magnitude of the surface gradient, as well as isocontours of constant depth. Further, we prove that specification of the surface normal at a single point completely determines the surface depth from these isocontours. In addition, we propose practical algorithms that require additional initial or boundary information, but recover depth from lower order derivatives. Our theoretical results are illustrated with several examples on synthetic and real data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a comprehensive theory of photometric surface reconstruction from image derivatives. For unknown isotropic BRDFs, we show that two measurements of spatial and temporal image derivatives, under unknown light sources on a circle, suffice to determine the surface. This result is the culmination of a series of fundamental observations. First, we discover a photometric invariant that relates image derivatives to the surface geometry, regardless of the form of isotropic BRDF. Next, we show that just two pairs of differential images from unknown light directions suffice to recover surface information from the photometric invariant. This is shown to be equivalent to determining isocontours of constant magnitude of the surface gradient, as well as isocontours of constant depth. Further, we prove that specification of the surface normal at a single point completely determines the surface depth from these isocontours. In addition, we propose practical algorithms that require additional initial or boundary information, but recover depth from lower order derivatives. Our theoretical results are illustrated with several examples on synthetic and real data.",
"fno": "05995603",
"keywords": [
"Surface Gradient",
"Unknown Isotropic BRDF",
"Differential Photometric Stereo Theory",
"Photometric Surface Reconstruction",
"Image Derivatives",
"Surface Geometry",
"Constant Magnitude Isocontours"
],
"authors": [
{
"affiliation": "Univ. of California, Berkeley, CA, USA",
"fullName": "M. Chandraker",
"givenName": "M.",
"surname": "Chandraker",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Univ. of California, Berkeley, CA, USA",
"fullName": "Jiamin Bai",
"givenName": null,
"surname": "Jiamin Bai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Univ. of California, Berkeley, CA, USA",
"fullName": "R. Ramamoorthi",
"givenName": "R.",
"surname": "Ramamoorthi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-06-01T00:00:00",
"pubType": "proceedings",
"pages": "2505-2512",
"year": "2011",
"issn": null,
"isbn": "978-1-4577-0394-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05995602",
"articleId": "12OmNz3bdHn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05995604",
"articleId": "12OmNxuXcAn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2017/1034/0/1034a501",
"title": "Deep Photometric Stereo Network",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a501/12OmNBbsie0",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1999/0149/1/01491119",
"title": "An Integral Formulation for Differential Photometric Stereo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1999/01491119/12OmNqBKU5y",
"parentPublication": {
"id": "proceedings/cvpr/1999/0149/2",
"title": "Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995343",
"title": "Interreflection removal for photometric stereo by using spectrum-dependent albedo",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995343/12OmNxwWoEi",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2005/2327/0/23270326",
"title": "Efficient Photometric Stereo Technique for Three-Dimensional Surfaces with Unknown BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2005/23270326/12OmNyQpgXH",
"parentPublication": {
"id": "proceedings/3dim/2005/2327/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457494",
"title": "Improving photometric stereo with laser sectioning",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457494/12OmNyvY9rH",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/033P1A33",
"title": "Optimal integration of photometric and geometric surface measurements using inaccurate reflectance/illumination knowledge",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/033P1A33/12OmNzYNN7C",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04408881",
"title": "Toward Reconstructing Surfaces With Arbitrary Isotropic Reflectance : A Stratified Photometric Stereo Approach",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04408881/12OmNzcPAFm",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/12/ttp2009122282",
"title": "Optimal Reconstruction of Approximate Planar Surfaces Using Photometric Stereo",
"doi": null,
"abstractUrl": "/journal/tp/2009/12/ttp2009122282/13rRUxDItij",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/03/ttp2010030546",
"title": "Photometric Stereo via Expectation Maximization",
"doi": null,
"abstractUrl": "/journal/tp/2010/03/ttp2010030546/13rRUxNmPF1",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/12/ttp2013122941",
"title": "On Differential Photometric Reconstruction for Unknown, Isotropic BRDFs",
"doi": null,
"abstractUrl": "/journal/tp/2013/12/ttp2013122941/13rRUygT7oc",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy6qfOu",
"title": "Visualization Conference, IEEE",
"acronym": "ieee-vis",
"groupId": "1000796",
"volume": "0",
"displayVolume": "0",
"year": "1999",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqGRGjJ",
"doi": "10.1109/VISUAL.1999.809876",
"title": "Time Critical Multiresolution Scene Rendering",
"normalizedTitle": "Time Critical Multiresolution Scene Rendering",
"abstract": "We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a scene description in which objects are represented as multiresolution meshes. We perform a constrained optimization at each frame to choose the resolution of each potentially visible object that generates the best quality image while meeting timing constraints. The technique provides smooth level-of-detail control and aims at guaranteeing a uniform, bounded frame rate even for widely changing viewing conditions. The optimization algorithm is independent from the particular data structure used to represent multiresolution meshes. The only requirements are the ability to represent a mesh with an arbitrary number of triangles and to traverse a mesh structure at an arbitrary resolution in a short predictable time. A data structure satisfying these criteria is described and experimental results are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a scene description in which objects are represented as multiresolution meshes. We perform a constrained optimization at each frame to choose the resolution of each potentially visible object that generates the best quality image while meeting timing constraints. The technique provides smooth level-of-detail control and aims at guaranteeing a uniform, bounded frame rate even for widely changing viewing conditions. The optimization algorithm is independent from the particular data structure used to represent multiresolution meshes. The only requirements are the ability to represent a mesh with an arbitrary number of triangles and to traverse a mesh structure at an arbitrary resolution in a short predictable time. A data structure satisfying these criteria is described and experimental results are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a scene description in which objects are represented as multiresolution meshes. We perform a constrained optimization at each frame to choose the resolution of each potentially visible object that generates the best quality image while meeting timing constraints. The technique provides smooth level-of-detail control and aims at guaranteeing a uniform, bounded frame rate even for widely changing viewing conditions. The optimization algorithm is independent from the particular data structure used to represent multiresolution meshes. The only requirements are the ability to represent a mesh with an arbitrary number of triangles and to traverse a mesh structure at an arbitrary resolution in a short predictable time. A data structure satisfying these criteria is described and experimental results are discussed.",
"fno": "58970018",
"keywords": [
"Multiresolution Modeling",
"Level Of Detail",
"Adaptive Rendering",
"Time Critical Graphics"
],
"authors": [
{
"affiliation": "CRS4",
"fullName": "Enrico Gobbetti",
"givenName": "Enrico",
"surname": "Gobbetti",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CRS4",
"fullName": "Eric Bouvier",
"givenName": "Eric",
"surname": "Bouvier",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1999-10-01T00:00:00",
"pubType": "proceedings",
"pages": "18",
"year": "1999",
"issn": "1070-2385",
"isbn": "0-7803-5897-X",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "58970017",
"articleId": "12OmNy6ZrZu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "58970019",
"articleId": "12OmNBkxswI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2001/1227/0/12270060",
"title": "Multiresolution Interpolation Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270060/12OmNAYGlnv",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2001/1227/0/12270022",
"title": "FastMesh: Efficient View-Dependent Meshing",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270022/12OmNqNG3iy",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660026",
"title": "Interactive Rendering of Large Unstructured Grids Using Dynamic Level-of-Detail",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660026/12OmNrIaear",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2010/4360/0/4360a117",
"title": "A Multiresolution Viewpoint Based Rendering for Large-scale Point Models",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2010/4360a117/12OmNrMHOpQ",
"parentPublication": {
"id": "proceedings/isise/2010/4360/0",
"title": "2010 Third International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498gregorsk",
"title": "Interactive View-Dependent Rendering of Large IsoSurfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498gregorsk/12OmNyQGSjm",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498decoro",
"title": "XFastMesh: Fast View-dependent Meshing from External Memory",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498decoro/12OmNzVGcTe",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dagstuhl/1997/0503/0/05030332",
"title": "Multiresolution and Adaptive Rendering Techniques for Structured, Curvilinear Data",
"doi": null,
"abstractUrl": "/proceedings-article/dagstuhl/1997/05030332/12OmNzwZ6pF",
"parentPublication": {
"id": "proceedings/dagstuhl/1997/0503/0",
"title": "Dagstuhl '97 - Scientific Visualization Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1999/5897/0/00809876",
"title": "Time-critical multiresolution scene rendering",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1999/00809876/12OmNzwpU3V",
"parentPublication": {
"id": "proceedings/visual/1999/5897/0",
"title": "Proceedings Visualization '99",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0139",
"title": "A Multiresolution Representation for Massive Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0139/13rRUwcAqq4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/03/v0353",
"title": "Efficient Implementation of Real-Time View-Dependent Multiresolution Meshing",
"doi": null,
"abstractUrl": "/journal/tg/2004/03/v0353/13rRUwfI0PX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNynsbx3",
"title": "Visualization Conference, IEEE",
"acronym": "ieee-vis",
"groupId": "1000796",
"volume": "0",
"displayVolume": "0",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNweBUR1",
"doi": "10.1109/VISUAL.2003.1250408",
"title": "Large Mesh Simplification using Processing Sequences",
"normalizedTitle": "Large Mesh Simplification using Processing Sequences",
"abstract": "In this paper we show how out-of-core mesh processing techniques can be adapted to perform their computations based on the new processing sequence paradigm [Isenburg and Gumhold 2003; Isenburg et al. 2003], using mesh simplification as an example. We believe that this processing concept will also prove useful for other tasks, such as parameterization, remeshing, or smoothing, for which currently only in-core solutions exist. A processing sequence represents a mesh as a particular inter-leaved ordering of indexed triangles and vertices. This representation allows streaming very large meshes through main memory while maintaining information about the visitation status of edges and vertices. At any time, only a small portion of the mesh is kept in-core, with the bulk of the mesh data residing on disk. Mesh access is restricted to a fixed traversal order, but full connectivity and geometry information is available for the active elements of the traversal. This provides seamless and highly efficient out-of-core access to very large meshes for algorithms that can adapt their computations to this fixed ordering. The two abstractions that are naturally supported by this representation are boundary-based and buffer-based processing. We illustrate both abstractions by adapting two different simplification methods to perform their computation using a prototype of our mesh processing sequence API. Both algorithms benefit from using processing sequences in terms of improved quality, more efficient execution, and smaller memory footprints.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we show how out-of-core mesh processing techniques can be adapted to perform their computations based on the new processing sequence paradigm [Isenburg and Gumhold 2003; Isenburg et al. 2003], using mesh simplification as an example. We believe that this processing concept will also prove useful for other tasks, such as parameterization, remeshing, or smoothing, for which currently only in-core solutions exist. A processing sequence represents a mesh as a particular inter-leaved ordering of indexed triangles and vertices. This representation allows streaming very large meshes through main memory while maintaining information about the visitation status of edges and vertices. At any time, only a small portion of the mesh is kept in-core, with the bulk of the mesh data residing on disk. Mesh access is restricted to a fixed traversal order, but full connectivity and geometry information is available for the active elements of the traversal. This provides seamless and highly efficient out-of-core access to very large meshes for algorithms that can adapt their computations to this fixed ordering. The two abstractions that are naturally supported by this representation are boundary-based and buffer-based processing. We illustrate both abstractions by adapting two different simplification methods to perform their computation using a prototype of our mesh processing sequence API. Both algorithms benefit from using processing sequences in terms of improved quality, more efficient execution, and smaller memory footprints.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we show how out-of-core mesh processing techniques can be adapted to perform their computations based on the new processing sequence paradigm [Isenburg and Gumhold 2003; Isenburg et al. 2003], using mesh simplification as an example. We believe that this processing concept will also prove useful for other tasks, such as parameterization, remeshing, or smoothing, for which currently only in-core solutions exist. A processing sequence represents a mesh as a particular inter-leaved ordering of indexed triangles and vertices. This representation allows streaming very large meshes through main memory while maintaining information about the visitation status of edges and vertices. At any time, only a small portion of the mesh is kept in-core, with the bulk of the mesh data residing on disk. Mesh access is restricted to a fixed traversal order, but full connectivity and geometry information is available for the active elements of the traversal. This provides seamless and highly efficient out-of-core access to very large meshes for algorithms that can adapt their computations to this fixed ordering. The two abstractions that are naturally supported by this representation are boundary-based and buffer-based processing. We illustrate both abstractions by adapting two different simplification methods to perform their computation using a prototype of our mesh processing sequence API. Both algorithms benefit from using processing sequences in terms of improved quality, more efficient execution, and smaller memory footprints.",
"fno": "20300061",
"keywords": [
"Out Of Core Algorithms",
"Processing Sequences",
"Mesh Simplification",
"Large Meshes"
],
"authors": [
{
"affiliation": "University of North Carolina at Chapel Hill",
"fullName": "Martin Isenburg",
"givenName": "Martin",
"surname": "Isenburg",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Lawrence Livermore National Laboratory",
"fullName": "Peter Lindstrom",
"givenName": "Peter",
"surname": "Lindstrom",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tübingen",
"fullName": "Stefan Gumhold",
"givenName": "Stefan",
"surname": "Gumhold",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of North Carolina at Chapel Hill",
"fullName": "Jack Snoeyink",
"givenName": "Jack",
"surname": "Snoeyink",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-10-01T00:00:00",
"pubType": "proceedings",
"pages": "61",
"year": "2003",
"issn": null,
"isbn": "0-7695-2030-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "20300060",
"articleId": "12OmNBlFR2C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "20300062",
"articleId": "12OmNypIYCJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2001/1227/0/12270012",
"title": "An Effective Feature-Preserving Mesh Simplification Scheme Based on Face Constriction",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270012/12OmNAGepW6",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithingscpscom/2011/4580/0/4580a660",
"title": "Edge-Collapse Mesh Simplification Method Based on Gauss Curvature",
"doi": null,
"abstractUrl": "/proceedings-article/ithingscpscom/2011/4580a660/12OmNwLfMzZ",
"parentPublication": {
"id": "proceedings/ithingscpscom/2011/4580/0",
"title": "International Conference on Internet of Things and International Conference on Cyber, Physical and Social Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300021",
"title": "Real-Time Refinement and Simplification of Adaptive Triangular Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300021/12OmNwp74DZ",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isvd/2011/4483/0/4483a039",
"title": "Isotropic Mesh Simplification by Evolving the Geodesic Delaunay Triangulation",
"doi": null,
"abstractUrl": "/proceedings-article/isvd/2011/4483a039/12OmNwwd2VI",
"parentPublication": {
"id": "proceedings/isvd/2011/4483/0",
"title": "2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498garland",
"title": "A Multiphase Approach to Efficient Surface Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498garland/12OmNxwENQ0",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498zhang3",
"title": "Visibility-Guided Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498zhang3/12OmNyKrHaa",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__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": "proceedings/isise/2008/3494/1/3494a150",
"title": "A New Adaptive Mesh Simplification Method Using Vertex Clustering with Topology-and-Detail Preserving",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a150/12OmNz61dnL",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200shaffer",
"title": "Efficient Adaptive Simplification of Massive Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200shaffer/12OmNzV70Bx",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1996/03/mcg1996030064",
"title": "Superfaces: Polygonal Mesh Simplification with Bounded Error",
"doi": null,
"abstractUrl": "/magazine/cg/1996/03/mcg1996030064/13rRUxYIMXs",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNynsbx3",
"title": "Visualization Conference, IEEE",
"acronym": "ieee-vis",
"groupId": "1000796",
"volume": "0",
"displayVolume": "0",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwp74DZ",
"doi": "10.1109/VISUAL.2003.1250367",
"title": "Real-Time Refinement and Simplification of Adaptive Triangular Meshes",
"normalizedTitle": "Real-Time Refinement and Simplification of Adaptive Triangular Meshes",
"abstract": "In this paper we present a generic method for incremental mesh adaptation based on hierarchy of semi-regular meshes. Our method supports any refinement rule mapping vertices onto vertices such as 1-to-4 split or \\sqrt3-subdivision. Resulting adaptive mesh has subdivision connectivity and hence good aspect ratio of triangles. Hierarchic representation of the mesh allows incremental local refinement and simplification operations exploiting frame-to-frame coherence. We also present an out-of-core storage layout scheme designed for semi-regular meshes of arbitrary subdivision connectivity. It provides high cache coherency in the data retrieval and relies on the interleaved storage of resolution levels and maintaining good geometrical proximity within each level. The efficiency of the proposed method is demonstrated with applications in physically-based cloth simulation, real-time terrain visualization and procedural modeling.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we present a generic method for incremental mesh adaptation based on hierarchy of semi-regular meshes. Our method supports any refinement rule mapping vertices onto vertices such as 1-to-4 split or \\sqrt3-subdivision. Resulting adaptive mesh has subdivision connectivity and hence good aspect ratio of triangles. Hierarchic representation of the mesh allows incremental local refinement and simplification operations exploiting frame-to-frame coherence. We also present an out-of-core storage layout scheme designed for semi-regular meshes of arbitrary subdivision connectivity. It provides high cache coherency in the data retrieval and relies on the interleaved storage of resolution levels and maintaining good geometrical proximity within each level. The efficiency of the proposed method is demonstrated with applications in physically-based cloth simulation, real-time terrain visualization and procedural modeling.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we present a generic method for incremental mesh adaptation based on hierarchy of semi-regular meshes. Our method supports any refinement rule mapping vertices onto vertices such as 1-to-4 split or \\sqrt3-subdivision. Resulting adaptive mesh has subdivision connectivity and hence good aspect ratio of triangles. Hierarchic representation of the mesh allows incremental local refinement and simplification operations exploiting frame-to-frame coherence. We also present an out-of-core storage layout scheme designed for semi-regular meshes of arbitrary subdivision connectivity. It provides high cache coherency in the data retrieval and relies on the interleaved storage of resolution levels and maintaining good geometrical proximity within each level. The efficiency of the proposed method is demonstrated with applications in physically-based cloth simulation, real-time terrain visualization and procedural modeling.",
"fno": "20300021",
"keywords": [
"Adaptive Meshes",
"Refinement And Simplification",
"Subdivision",
"Multiresoluton",
"Level Of Detail",
"Frame To Frame Coherence",
"Out Of Core Visualization"
],
"authors": [
{
"affiliation": "Moscow Institute of Physics and Technology",
"fullName": "Vasily Volkov",
"givenName": "Vasily",
"surname": "Volkov",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Curtin University of Technology",
"fullName": "Ling Li",
"givenName": "Ling",
"surname": "Li",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-10-01T00:00:00",
"pubType": "proceedings",
"pages": "21",
"year": "2003",
"issn": null,
"isbn": "0-7695-2030-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "20300020",
"articleId": "12OmNy3iFlB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "20300022",
"articleId": "12OmNvvtGXd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cscwd/2005/0002/1/01504152",
"title": "A new approach to constructing subdivision connectivity meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cscwd/2005/01504152/12OmNAMbZEz",
"parentPublication": {
"id": "proceedings/cscwd/2005/0002/1",
"title": "International Conference on Computer Supported Cooperative Work in Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2000/0878/0/08780131",
"title": "Semi-Regular 4-8 Refinement and Box Spline Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2000/08780131/12OmNBV9Ifa",
"parentPublication": {
"id": "proceedings/sibgrapi/2000/0878/0",
"title": "Proceedings 13th Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00878)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970011",
"title": "Progressive Compression of Arbitrary Triangular Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970011/12OmNCgrDbG",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300061",
"title": "Large Mesh Simplification using Processing Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300061/12OmNweBUR1",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730119",
"title": "Adaptive Refinement Scheme for Subdivision Surfaces based on Triangular Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730119/12OmNwwd2I6",
"parentPublication": {
"id": "proceedings/cad-cg/2005/2473/0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/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": "proceedings/ieee-vis/2001/7200/0/7200shaffer",
"title": "Efficient Adaptive Simplification of Massive Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200shaffer/12OmNzV70Bx",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/04/v0525",
"title": "External Memory Management and Simplification of Huge Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2003/04/v0525/13rRUxjQyp4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/03/v0306",
"title": "Uniform Remeshing with an Adaptive Domain: A New Scheme for View-Dependent Level-of-Detail Rendering of Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2005/03/v0306/13rRUxly8Xu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/02/v0145",
"title": "Constructing Hierarchies for Triangle Meshes",
"doi": null,
"abstractUrl": "/journal/tg/1998/02/v0145/13rRUy0qnGc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqGA5hz",
"title": "2010 International Conference on Computational Science and Its Applications",
"acronym": "iccsa",
"groupId": "1001290",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx0RIZW",
"doi": "10.1109/ICCSA.2010.45",
"title": "Adaptive Keyframing Animation on the GPU Using Triangle Strips",
"normalizedTitle": "Adaptive Keyframing Animation on the GPU Using Triangle Strips",
"abstract": "Deforming surfaces are present in scientific applications, movies and video games. In these fields, polygonal meshes are preferred to represent them. However, these meshes are usually complex and contain much more detail than is necessary for a given frame. A possible solution to efficiently manage such a large amount of information consists in using multiresolution modeling or level of detail. However, most of the work carried out in this respect has focused on managing static meshes, and only a few take advantage of using optimized primitives such as triangle strips or the new capabilities of current GPUs. In this paper, we present a view-dependent method for interactive rendering of keyframing animations in the GPU. Our strip-based approach is capable of managing the level of detail of this type of deforming meshes. We demonstrate the successful use of this method on the GPU. We can generate adaptive levels of detail during all frames of an animation in real-time while providing, at the same time, accurate approximations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Deforming surfaces are present in scientific applications, movies and video games. In these fields, polygonal meshes are preferred to represent them. However, these meshes are usually complex and contain much more detail than is necessary for a given frame. A possible solution to efficiently manage such a large amount of information consists in using multiresolution modeling or level of detail. However, most of the work carried out in this respect has focused on managing static meshes, and only a few take advantage of using optimized primitives such as triangle strips or the new capabilities of current GPUs. In this paper, we present a view-dependent method for interactive rendering of keyframing animations in the GPU. Our strip-based approach is capable of managing the level of detail of this type of deforming meshes. We demonstrate the successful use of this method on the GPU. We can generate adaptive levels of detail during all frames of an animation in real-time while providing, at the same time, accurate approximations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Deforming surfaces are present in scientific applications, movies and video games. In these fields, polygonal meshes are preferred to represent them. However, these meshes are usually complex and contain much more detail than is necessary for a given frame. A possible solution to efficiently manage such a large amount of information consists in using multiresolution modeling or level of detail. However, most of the work carried out in this respect has focused on managing static meshes, and only a few take advantage of using optimized primitives such as triangle strips or the new capabilities of current GPUs. In this paper, we present a view-dependent method for interactive rendering of keyframing animations in the GPU. Our strip-based approach is capable of managing the level of detail of this type of deforming meshes. We demonstrate the successful use of this method on the GPU. We can generate adaptive levels of detail during all frames of an animation in real-time while providing, at the same time, accurate approximations.",
"fno": "3999a135",
"keywords": [
"GPU",
"Animation",
"Multiresolution Models",
"Level Of Detail",
"Triangle Strip",
"Simplification"
],
"authors": [
{
"affiliation": null,
"fullName": "Francisco Ramos",
"givenName": "Francisco",
"surname": "Ramos",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Miguel Chover",
"givenName": "Miguel",
"surname": "Chover",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Oscar Ripolles",
"givenName": "Oscar",
"surname": "Ripolles",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccsa",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-03-01T00:00:00",
"pubType": "proceedings",
"pages": "135-142",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-3999-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3999a129",
"articleId": "12OmNz4SOxM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3999a145",
"articleId": "12OmNzC5SPk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300060",
"title": "Visibility based methods and assessment for detail-recovery",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300060/12OmNBlFR2C",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620379",
"title": "Smooth hierarchical surface triangulations",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620379/12OmNqH9hgj",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660026",
"title": "Interactive Rendering of Large Unstructured Grids Using Dynamic Level-of-Detail",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660026/12OmNrIaear",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2011/4584/0/4584a312",
"title": "Real-time LOD Algorithm Based on Triangle Collapse Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2011/4584a312/12OmNwtWfT0",
"parentPublication": {
"id": "proceedings/cis/2011/4584/0",
"title": "2011 Seventh International Conference on Computational Intelligence and Security",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2011/4602/0/4602a046",
"title": "An Adaptive Method for Shader Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2011/4602a046/12OmNy2agWs",
"parentPublication": {
"id": "proceedings/icvrv/2011/4602/0",
"title": "2011 International Conference on Virtual Reality and Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2004/2171/0/21710002",
"title": "Multi-Path Algorithm for Triangle Strips",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2004/21710002/12OmNykkB84",
"parentPublication": {
"id": "proceedings/cgi/2004/2171/0",
"title": "Proceedings. Computer Graphics International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498elsana",
"title": "Optimized View-Dependent Rendering for Large Polygonal Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498elsana/12OmNzmclHv",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/03/v0353",
"title": "Efficient Implementation of Real-Time View-Dependent Multiresolution Meshing",
"doi": null,
"abstractUrl": "/journal/tg/2004/03/v0353/13rRUwfI0PX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1997/02/v0171",
"title": "Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models",
"doi": null,
"abstractUrl": "/journal/tg/1997/02/v0171/13rRUxASuv6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/02/v0145",
"title": "Constructing Hierarchies for Triangle Meshes",
"doi": null,
"abstractUrl": "/journal/tg/1998/02/v0145/13rRUy0qnGc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBkfRgM",
"title": "Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE",
"acronym": "paciia",
"groupId": "1002599",
"volume": "1",
"displayVolume": "1",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAQrYD4",
"doi": "10.1109/PACIIA.2008.179",
"title": "Fabric Defect Detection Based on Wavelet Characteristics",
"normalizedTitle": "Fabric Defect Detection Based on Wavelet Characteristics",
"abstract": "On the basis of wavelet and singular signal characteristic analysis, a new defect detection method based on wavelet characteristics is presented. Firstly, to select wavelet filters of compact support and high vanishing moment properties are regarded as finite biorthogonal filters. Secondly, the new wavelet with concussive and filters coefficients of centralized distribution is constructed by lifting scheme, which is matching with test fabric texture properties. Lastly, the detail signal feature after wavelet decomposition of fabric image is extracted, and it is compared with the detail signal feature of normal fabric image decomposition to determine whether there exists defect. The experimental result confirms that the proposed method is validity and the detection accuracy is over 92.5%.",
"abstracts": [
{
"abstractType": "Regular",
"content": "On the basis of wavelet and singular signal characteristic analysis, a new defect detection method based on wavelet characteristics is presented. Firstly, to select wavelet filters of compact support and high vanishing moment properties are regarded as finite biorthogonal filters. Secondly, the new wavelet with concussive and filters coefficients of centralized distribution is constructed by lifting scheme, which is matching with test fabric texture properties. Lastly, the detail signal feature after wavelet decomposition of fabric image is extracted, and it is compared with the detail signal feature of normal fabric image decomposition to determine whether there exists defect. The experimental result confirms that the proposed method is validity and the detection accuracy is over 92.5%.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "On the basis of wavelet and singular signal characteristic analysis, a new defect detection method based on wavelet characteristics is presented. Firstly, to select wavelet filters of compact support and high vanishing moment properties are regarded as finite biorthogonal filters. Secondly, the new wavelet with concussive and filters coefficients of centralized distribution is constructed by lifting scheme, which is matching with test fabric texture properties. Lastly, the detail signal feature after wavelet decomposition of fabric image is extracted, and it is compared with the detail signal feature of normal fabric image decomposition to determine whether there exists defect. The experimental result confirms that the proposed method is validity and the detection accuracy is over 92.5%.",
"fno": "3490a366",
"keywords": [
"Wavelet Characteristics",
"Lifting Sheme",
"Feature Extraction",
"Defect Detection"
],
"authors": [
{
"affiliation": null,
"fullName": "Shengqi Guan",
"givenName": "Shengqi",
"surname": "Guan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xiuhua Shi",
"givenName": "Xiuhua",
"surname": "Shi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Haiying Cui",
"givenName": "Haiying",
"surname": "Cui",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yuqin Song",
"givenName": "Yuqin",
"surname": "Song",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "paciia",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "366-370",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3490-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3490a360",
"articleId": "12OmNBubOT3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3490a371",
"articleId": "12OmNwwMf2J",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/gcis/2009/3571/3/3571c184",
"title": "Fabric Defect Detection Method Based on Gabor Filter Mask",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2009/3571c184/12OmNB0nWgi",
"parentPublication": {
"id": "proceedings/gcis/2009/3571/3",
"title": "2009 WRI Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fskd/2009/3735/6/3735f191",
"title": "Fabric Defect Detection Using Fuzzy Inductive Reasoning Based on Image Histogram Statistic Variables",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735f191/12OmNBUAvVY",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/6",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iuce/2009/3619/0/3619a210",
"title": "Detection of Fabric Defect Based on Optimal Tree Structure of Wavelet Decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/iuce/2009/3619a210/12OmNs5rl8u",
"parentPublication": {
"id": "proceedings/iuce/2009/3619/0",
"title": "2009 International Symposium on Intelligent Ubiquitous Computing and Education, IUCE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/3/81833201",
"title": "Wavelet methods for texture defect detection",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81833201/12OmNvTjZX8",
"parentPublication": {
"id": "proceedings/icip/1997/8183/3",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2008/3494/1/3494a281",
"title": "Fabric Defect Detection Based on Wavelet Decomposition with One Resolution Level",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a281/12OmNvwC5vN",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2009/3859/2/3859b217",
"title": "A New Algorithm for Fabric Defect Detection Based on Image Distance Difference",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2009/3859b217/12OmNxvO03O",
"parentPublication": {
"id": "proceedings/iita/2009/3859/2",
"title": "2009 Third International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2001/7041/6/00940645",
"title": "Fabric defect detection using adaptive wavelet",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2001/00940645/12OmNyaGeEL",
"parentPublication": {
"id": "proceedings/icassp/2001/7041/6",
"title": "2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccae/2009/3569/0/3569a026",
"title": "Defect Detection in Textiles Using Morphological Analysis of Optimal Gabor Wavelet Filter Response",
"doi": null,
"abstractUrl": "/proceedings-article/iccae/2009/3569a026/12OmNymjN0J",
"parentPublication": {
"id": "proceedings/iccae/2009/3569/0",
"title": "2009 International Conference on Computer and Automation Engineering. ICCAE 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2011/4415/0/4415a192",
"title": "Fabric Defect Detection Based on Projected Transform for Feature Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2011/4415a192/12OmNzYeAW8",
"parentPublication": {
"id": "proceedings/dcabes/2011/4415/0",
"title": "2011 10th International Symposium on Distributed Computing and Applications to Business, Engineering and Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2003/2029/0/20290163",
"title": "Defect Detection on Patterned Jacquard Fabric",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2003/20290163/12OmNzwHvvp",
"parentPublication": {
"id": "proceedings/aipr/2003/2029/0",
"title": "32nd Applied Imagery Pattern Recognition Workshop, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvkYx8q",
"title": "XXIV International Conference of the Chilean Computer Science Society",
"acronym": "sccc",
"groupId": "1001489",
"volume": "0",
"displayVolume": "0",
"year": "2004",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrkT7rh",
"doi": "10.1109/QEST.2004.19",
"title": "Shiftability and filter bank design using Morlet wavelet",
"normalizedTitle": "Shiftability and filter bank design using Morlet wavelet",
"abstract": "A multi-resolution representation through wavelet transform has proved to be beneficial for many signal processing applications. For example, Morlet wavelet has shown good performance in tasks like audio coding and image enhancement. Unfortunately, wavelet transforms are unstable when the input signal is shifted in position. Prior works formalize this problem by defining a type of translation invariance called shiftability. Shiftability constraint is equivalent to the constraint that the response power of the transform in the sub-band is preserved with respect to translations of the input signal. In this paper, we propose constraints for filter bank design that guarantee shiftability. Also, we use the proposed constraints to design a filter bank that implements the Morlet wavelet transform. We use the Morlet wavelet based on the fact that it has good properties in joint time-frequency localization and it has shown approximate shiftability. The filter bank proposed presents good results with respect to shiftability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A multi-resolution representation through wavelet transform has proved to be beneficial for many signal processing applications. For example, Morlet wavelet has shown good performance in tasks like audio coding and image enhancement. Unfortunately, wavelet transforms are unstable when the input signal is shifted in position. Prior works formalize this problem by defining a type of translation invariance called shiftability. Shiftability constraint is equivalent to the constraint that the response power of the transform in the sub-band is preserved with respect to translations of the input signal. In this paper, we propose constraints for filter bank design that guarantee shiftability. Also, we use the proposed constraints to design a filter bank that implements the Morlet wavelet transform. We use the Morlet wavelet based on the fact that it has good properties in joint time-frequency localization and it has shown approximate shiftability. The filter bank proposed presents good results with respect to shiftability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A multi-resolution representation through wavelet transform has proved to be beneficial for many signal processing applications. For example, Morlet wavelet has shown good performance in tasks like audio coding and image enhancement. Unfortunately, wavelet transforms are unstable when the input signal is shifted in position. Prior works formalize this problem by defining a type of translation invariance called shiftability. Shiftability constraint is equivalent to the constraint that the response power of the transform in the sub-band is preserved with respect to translations of the input signal. In this paper, we propose constraints for filter bank design that guarantee shiftability. Also, we use the proposed constraints to design a filter bank that implements the Morlet wavelet transform. We use the Morlet wavelet based on the fact that it has good properties in joint time-frequency localization and it has shown approximate shiftability. The filter bank proposed presents good results with respect to shiftability.",
"fno": "01372114",
"keywords": [
"Filtering Theory",
"Wavelet Transforms",
"Signal Processing",
"Filter Bank Design",
"Multiresolution Representation",
"Signal Processing Application",
"Audio Coding",
"Image Enhancement",
"Translation Invariance",
"Morlet Wavelet Transform",
"Joint Time Frequency Localization",
"Approximate Shiftability",
"Shiftability Constraint",
"Filter Bank",
"Wavelet Transforms",
"Computer Science",
"Signal Processing",
"Application Software",
"Informatics",
"Audio Coding",
"Image Enhancement",
"Societies",
"Computer Applications"
],
"authors": [
{
"affiliation": "Informatics Dept., Tech. Univ. Federico Santa Maria, Valparaiso, Chile",
"fullName": "G. Hernandez",
"givenName": "G.",
"surname": "Hernandez",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "M. Mendoza",
"givenName": "M.",
"surname": "Mendoza",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "B. Reusch",
"givenName": "B.",
"surname": "Reusch",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "L. Salinas",
"givenName": "L.",
"surname": "Salinas",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sccc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2004-01-01T00:00:00",
"pubType": "proceedings",
"pages": "141-148",
"year": "2004",
"issn": null,
"isbn": "0-7695-2185-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01372113",
"articleId": "12OmNz4Bdp5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01372115",
"articleId": "12OmNzd7bWI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isise/2008/3494/1/3494a574",
"title": "A Steerable Filter Bank for Image Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2008/3494a574/12OmNAio6ZF",
"parentPublication": {
"id": "proceedings/isise/2008/3494/1",
"title": "2008 International Symposium on Information Science and Engieering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761620",
"title": "Moving object segmentation using the 9/7–10/8 dual-tree complex filter bank",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761620/12OmNB1wkLo",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1993/4120/0/00342437",
"title": "Statistical wavelet and filter bank optimization",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1993/00342437/12OmNCeK28X",
"parentPublication": {
"id": "proceedings/acssc/1993/4120/0",
"title": "Proceedings of 27th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/2/4077c576",
"title": "Iris Recognition Method Based on the Coefficients of Morlet Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077c576/12OmNCfAPCI",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1993/4120/0/00342442",
"title": "Practical nonunitary filter banks for subband coding of images",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1993/00342442/12OmNCulYmG",
"parentPublication": {
"id": "proceedings/acssc/1993/4120/0",
"title": "Proceedings of 27th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2011/4388/0/4388a197",
"title": "Wavelet Filter Bank-Based Non Uniform Multi-tone Transceiver for Digital Subscriber Line",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2011/4388a197/12OmNwpGgIu",
"parentPublication": {
"id": "proceedings/cit/2011/4388/0",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wmwa/2009/3646/0/3646a142",
"title": "Integer M-channel Filter Bank Design for H.264/AVC Intra Coding",
"doi": null,
"abstractUrl": "/proceedings-article/wmwa/2009/3646a142/12OmNxA3YWw",
"parentPublication": {
"id": "proceedings/wmwa/2009/3646/0",
"title": "Web Mining and Web-based Application, Pacific-Asia Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1997/8316/1/00680534",
"title": "Nonlinear phase Mth band filter and applications in filter bank design",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1997/00680534/12OmNyvY9Ai",
"parentPublication": {
"id": "proceedings/acssc/1997/8316/1",
"title": "Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36163)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccet/2009/3521/2/3521b084",
"title": "Face Recognition Combining 3-channel Filter Bank and 2DLDA",
"doi": null,
"abstractUrl": "/proceedings-article/iccet/2009/3521b084/12OmNzV70E0",
"parentPublication": {
"id": "proceedings/iccet/2009/3521/1",
"title": "Computer Engineering and Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/is3c/2018/7036/0/703600a197",
"title": "Designs of Bipartite Graph Filter Bank Using Graph Fourier Transform and Digital Filter Bank",
"doi": null,
"abstractUrl": "/proceedings-article/is3c/2018/703600a197/17QjJdGFWYp",
"parentPublication": {
"id": "proceedings/is3c/2018/7036/0",
"title": "2018 International Symposium on Computer, Consumer and Control (IS3C)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwD1pU4",
"title": "2010 Third International Symposium on Information Science and Engineering",
"acronym": "isise",
"groupId": "1002561",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx4gUlv",
"doi": "10.1109/ISISE.2010.19",
"title": "A Data Compression Method for Traffic Loop Detectors' Signals Based on Lifting Wavelet Transformation and Entropy Coding",
"normalizedTitle": "A Data Compression Method for Traffic Loop Detectors' Signals Based on Lifting Wavelet Transformation and Entropy Coding",
"abstract": "For the urgent demand of real-time data compression of large scale traffic loop detector system, a novel real-time data compression and reconstruction method combining lifting wavelet transform and hybrid entropy coding is proposed. The signal to be compressed is firstly decomposed with biorthogonali filters based on lifting wavelet transform and the hard-threshold method is then applied to the wavelet coefficients. In order to implement higher efficient compression, a hybrid entropy coding scheme is employed to code the reserved coefficients. This method has been applied to the real-time data acquired from a group of loop detectors. Simulation results indicate that the proposed scheme which combines both lossy and loss less compression techniques can achieve satisfactory compression performance in applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "For the urgent demand of real-time data compression of large scale traffic loop detector system, a novel real-time data compression and reconstruction method combining lifting wavelet transform and hybrid entropy coding is proposed. The signal to be compressed is firstly decomposed with biorthogonali filters based on lifting wavelet transform and the hard-threshold method is then applied to the wavelet coefficients. In order to implement higher efficient compression, a hybrid entropy coding scheme is employed to code the reserved coefficients. This method has been applied to the real-time data acquired from a group of loop detectors. Simulation results indicate that the proposed scheme which combines both lossy and loss less compression techniques can achieve satisfactory compression performance in applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "For the urgent demand of real-time data compression of large scale traffic loop detector system, a novel real-time data compression and reconstruction method combining lifting wavelet transform and hybrid entropy coding is proposed. The signal to be compressed is firstly decomposed with biorthogonali filters based on lifting wavelet transform and the hard-threshold method is then applied to the wavelet coefficients. In order to implement higher efficient compression, a hybrid entropy coding scheme is employed to code the reserved coefficients. This method has been applied to the real-time data acquired from a group of loop detectors. Simulation results indicate that the proposed scheme which combines both lossy and loss less compression techniques can achieve satisfactory compression performance in applications.",
"fno": "4360a129",
"keywords": [
"Data Compression",
"Wavelet Transform",
"Lifting Scheme",
"Entropy Coding",
"Detected Traffic Data"
],
"authors": [
{
"affiliation": null,
"fullName": "Xiao-fa Shi",
"givenName": "Xiao-fa",
"surname": "Shi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lin-lin Liang",
"givenName": "Lin-lin",
"surname": "Liang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isise",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-12-01T00:00:00",
"pubType": "proceedings",
"pages": "129-132",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4360-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4360a125",
"articleId": "12OmNyoiZfd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4360a133",
"articleId": "12OmNAkWvBT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ihmsc/2009/3752/1/3752a025",
"title": "Image Edge Detection Based on Lifting Wavelet",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2009/3752a025/12OmNCwlacG",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iita/2008/3497/1/3497a648",
"title": "Aerial Remote Sensing Image Compression Based on Modified CDF97 Lifting Scheme",
"doi": null,
"abstractUrl": "/proceedings-article/iita/2008/3497a648/12OmNvlxJpZ",
"parentPublication": {
"id": "proceedings/iita/2008/3497/3",
"title": "2008 Second International Symposium on Intelligent Information Technology Application",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisp/2008/3119/4/3119d362",
"title": "FPGA Design of Fast Lifting Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119d362/12OmNwE9OUM",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/4",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paccs/2009/3614/0/3614a698",
"title": "Based on Lifting Scheme Improve Double Adaptive Wavelet Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/paccs/2009/3614a698/12OmNxZTtI1",
"parentPublication": {
"id": "proceedings/paccs/2009/3614/0",
"title": "2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2011/4501/0/4501a216",
"title": "Digital Watermarking Algorithm for Relational Database Based on Lifting Wavelet Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2011/4501a216/12OmNyGtjlw",
"parentPublication": {
"id": "proceedings/iccis/2011/4501/0",
"title": "2011 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2009/3959/0/3959a073",
"title": "Modified Lifting Scheme Characterization for the Compression of EMG Signals",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2009/3959a073/12OmNyrIaKS",
"parentPublication": {
"id": "proceedings/sitis/2009/3959/0",
"title": "2009 Fifth International Conference on Signal Image Technology and Internet Based Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/kam/2008/3488/0/3488a628",
"title": "Wavelets Based on Lifting Scheme and Its Application on Image Processing",
"doi": null,
"abstractUrl": "/proceedings-article/kam/2008/3488a628/12OmNz5s0V6",
"parentPublication": {
"id": "proceedings/kam/2008/3488/0",
"title": "Knowledge Acquisition and Modeling, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/1/4296a032",
"title": "A Design of M-Channels Lifting Wavelet Filter in Signal Processing",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296a032/12OmNzFv4eb",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/1",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031e576",
"title": "A Blind Watermarking Algorithm Based on Lifting Wavelet Transform and Scrambling Technology",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031e576/12OmNzRZpWI",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2004/04/t0386",
"title": "VLSI Implementation for One-Dimensional Multilevel Lifting-Based Wavelet Transform",
"doi": null,
"abstractUrl": "/journal/tc/2004/04/t0386/13rRUxZ0o0y",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNro0Ib6",
"title": "2004 Southwest Symposium on Image Analysis and Interpretation",
"acronym": "iai",
"groupId": "1000345",
"volume": "0",
"displayVolume": "0",
"year": "2004",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzJbR24",
"doi": "10.1109/IAI.2004.1300967",
"title": "Frequency implementation of discrete wavelet transforms",
"normalizedTitle": "Frequency implementation of discrete wavelet transforms",
"abstract": "The paper implements the discrete wavelet transform in the discrete Fourier domain. The need for such an approach arose out of our desire to find a convenient means of realizing a new class of non-separable orientation selective 2D wavelet filter banks that are designed directly in the DFT domain. The filter bank design process begins with a conventional separable 2D perfect reconstruction parallel filter bank that is not orientation selective. In the DFT domain, each non-low pass channel is decomposed into the sum of two orientation selective frequency responses that are each supported on only two quadrants of the 2D frequency plane. The resulting filter bank possesses the good joint localization properties of orthogonal wavelet transforms and offers both perfect reconstruction and orientation selectivity. However, the orientation selective channels are non-separable - they cannot be implemented as iterated 1D convolutions according to the usual separable 2D wavelet transform paradigm. To overcome this difficulty, we develop straightforward techniques for implementing the DWT directly in the DFT domain.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The paper implements the discrete wavelet transform in the discrete Fourier domain. The need for such an approach arose out of our desire to find a convenient means of realizing a new class of non-separable orientation selective 2D wavelet filter banks that are designed directly in the DFT domain. The filter bank design process begins with a conventional separable 2D perfect reconstruction parallel filter bank that is not orientation selective. In the DFT domain, each non-low pass channel is decomposed into the sum of two orientation selective frequency responses that are each supported on only two quadrants of the 2D frequency plane. The resulting filter bank possesses the good joint localization properties of orthogonal wavelet transforms and offers both perfect reconstruction and orientation selectivity. However, the orientation selective channels are non-separable - they cannot be implemented as iterated 1D convolutions according to the usual separable 2D wavelet transform paradigm. To overcome this difficulty, we develop straightforward techniques for implementing the DWT directly in the DFT domain.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The paper implements the discrete wavelet transform in the discrete Fourier domain. The need for such an approach arose out of our desire to find a convenient means of realizing a new class of non-separable orientation selective 2D wavelet filter banks that are designed directly in the DFT domain. The filter bank design process begins with a conventional separable 2D perfect reconstruction parallel filter bank that is not orientation selective. In the DFT domain, each non-low pass channel is decomposed into the sum of two orientation selective frequency responses that are each supported on only two quadrants of the 2D frequency plane. The resulting filter bank possesses the good joint localization properties of orthogonal wavelet transforms and offers both perfect reconstruction and orientation selectivity. However, the orientation selective channels are non-separable - they cannot be implemented as iterated 1D convolutions according to the usual separable 2D wavelet transform paradigm. To overcome this difficulty, we develop straightforward techniques for implementing the DWT directly in the DFT domain.",
"fno": "01300967",
"keywords": [
"Channel Bank Filters",
"Discrete Wavelet Transforms",
"Discrete Fourier Transforms",
"Signal Reconstruction",
"Convolution",
"Iterative Methods",
"Image Processing",
"Frequency Domain Analysis",
"Discrete Wavelet Transforms",
"Discrete Fourier Domain",
"DFT Domain",
"Nonseparable Filter Banks",
"Orientation Selective Filter Banks",
"2 D Wavelet Filter Banks",
"Perfect Reconstruction",
"Iterated 1 D Convolutions",
"Frequency Domain Decomposition",
"Discrete Wavelet Transforms",
"Frequency",
"Filter Bank",
"Discrete Fourier Transforms",
"Image Reconstruction",
"Gabor Filters",
"Wavelet Domain",
"Wavelet Transforms",
"Convolution",
"Fourier Transforms"
],
"authors": [
{
"affiliation": "Sch. of Electr. & Comput. Eng., Oklahoma Univ., Norman, OK, USA",
"fullName": "P.C. Tay",
"givenName": "P.C.",
"surname": "Tay",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Sch. of Electr. & Comput. Eng., Oklahoma Univ., Norman, OK, USA",
"fullName": "J.P. Havlicek",
"givenName": "J.P.",
"surname": "Havlicek",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2004-01-01T00:00:00",
"pubType": "proceedings",
"pages": "167-171",
"year": "2004",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01300966",
"articleId": "12OmNApcudm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01300968",
"articleId": "12OmNyOq518",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icassp/2004/8484/2/01326416",
"title": "Video denoising using oriented complex wavelet transforms",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326416/12OmNASILYY",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/2",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acct/2015/8488/0/8488a437",
"title": "BER Analysis in Wavelet Based SC-FDMA for LTE Uplink Transmission",
"doi": null,
"abstractUrl": "/proceedings-article/acct/2015/8488a437/12OmNAWpymc",
"parentPublication": {
"id": "proceedings/acct/2015/8488/0",
"title": "2015 Fifth International Conference on Advanced Computing & Communication Technologies (ACCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asap/1992/2967/0/00218570",
"title": "Discrete wavelet transforms in VLSI",
"doi": null,
"abstractUrl": "/proceedings-article/asap/1992/00218570/12OmNAmE5WI",
"parentPublication": {
"id": "proceedings/asap/1992/2967/0",
"title": "Proceedings of the International Conference on Application Specific Array Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2007/2776/0/04151814",
"title": "Vehicle Recognition Based on Fourier, Wavelet and Curvelet Transforms - a Comparative Study",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2007/04151814/12OmNBlofSV",
"parentPublication": {
"id": "proceedings/itng/2007/2776/0",
"title": "2007 4th International Conference on Information Technology New Generations",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2002/7402/2/05744029",
"title": "Shiftable, projection-based complex wavelet transforms",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2002/05744029/12OmNCdk2LT",
"parentPublication": {
"id": "proceedings/icassp/2002/7402/2",
"title": "Proceedings of International Conference on Acoustics, Speech and Signal Processing (CASSP'02)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssst/1994/5320/0/00287872",
"title": "A parallel implementation of the discrete wavelet transform",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1994/00287872/12OmNwc3wrS",
"parentPublication": {
"id": "proceedings/ssst/1994/5320/0",
"title": "Proceedings of 26th Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1994/6405/2/00471630",
"title": "Generalized wavelet transforms and the cortex transform",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1994/00471630/12OmNx4gUwR",
"parentPublication": {
"id": "proceedings/acssc/1994/6405/1",
"title": "Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icat/2017/3337/0/08171647",
"title": "Fault classification using multi-resolution analysis and discrete wavelet transforms",
"doi": null,
"abstractUrl": "/proceedings-article/icat/2017/08171647/12OmNxcMSmP",
"parentPublication": {
"id": "proceedings/icat/2017/3337/0",
"title": "2017 XXVI International Conference on Information, Communication and Automation Technologies (ICAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/1995/7012/0/00515551",
"title": "PPT based fast architecture & algorithm for discrete wavelet transforms",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1995/00515551/12OmNy6HQXD",
"parentPublication": {
"id": "proceedings/dcc/1995/7012/0",
"title": "Proceedings DCC '95 Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/5/01327049",
"title": "Automatically generated high-performance code for discrete wavelet transforms",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01327049/12OmNzZWbMG",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/5",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx5GU1N",
"title": "Image Processing, International Conference on",
"acronym": "icip",
"groupId": "1000349",
"volume": "1",
"displayVolume": "1",
"year": "1997",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzayNFE",
"doi": "10.1109/ICIP.1997.647999",
"title": "Wavelet decomposition and reconstruction using arbitrary kernels: a new approach",
"normalizedTitle": "Wavelet decomposition and reconstruction using arbitrary kernels: a new approach",
"abstract": "In a previous paper, we presented a method to design perfect reconstruction filters using arbitrary lowpass filter kernels and presented fast filters with compression performance surpassing the well-known 9/7 biorthogonal filters. This paper improves the results obtained by Polyak and Pearlman (see Proc. IEEE International Conference on Image Processing, Santa Barbara, CA, vol.1, p.660-63, 1997), presenting filters comparable in compression performance and faster than the biorthogonal 10/18 filters. Furthermore, we combine our approach with the lifting and prediction schemes similar to the ones discussed by Said and Pearlman (see IEEE Trans. on Image Processing, vol.5, p.1303-10, 1996) in deriving the SS-P filters and later extended by Sweldens (see Appl. Comput. Harm. Anal., vol.3, no.2, p.186-200, 1996), thus obtaining integer to integer transforms whose performance is comparable to one of the S+P filters. At this stage, our algorithms are, however considerably slower. In any case it seems that the flexibility of our method shows some promise to serve as a basis for finding new integer to integer filters.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In a previous paper, we presented a method to design perfect reconstruction filters using arbitrary lowpass filter kernels and presented fast filters with compression performance surpassing the well-known 9/7 biorthogonal filters. This paper improves the results obtained by Polyak and Pearlman (see Proc. IEEE International Conference on Image Processing, Santa Barbara, CA, vol.1, p.660-63, 1997), presenting filters comparable in compression performance and faster than the biorthogonal 10/18 filters. Furthermore, we combine our approach with the lifting and prediction schemes similar to the ones discussed by Said and Pearlman (see IEEE Trans. on Image Processing, vol.5, p.1303-10, 1996) in deriving the SS-P filters and later extended by Sweldens (see Appl. Comput. Harm. Anal., vol.3, no.2, p.186-200, 1996), thus obtaining integer to integer transforms whose performance is comparable to one of the S+P filters. At this stage, our algorithms are, however considerably slower. In any case it seems that the flexibility of our method shows some promise to serve as a basis for finding new integer to integer filters.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In a previous paper, we presented a method to design perfect reconstruction filters using arbitrary lowpass filter kernels and presented fast filters with compression performance surpassing the well-known 9/7 biorthogonal filters. This paper improves the results obtained by Polyak and Pearlman (see Proc. IEEE International Conference on Image Processing, Santa Barbara, CA, vol.1, p.660-63, 1997), presenting filters comparable in compression performance and faster than the biorthogonal 10/18 filters. Furthermore, we combine our approach with the lifting and prediction schemes similar to the ones discussed by Said and Pearlman (see IEEE Trans. on Image Processing, vol.5, p.1303-10, 1996) in deriving the SS-P filters and later extended by Sweldens (see Appl. Comput. Harm. Anal., vol.3, no.2, p.186-200, 1996), thus obtaining integer to integer transforms whose performance is comparable to one of the S+P filters. At this stage, our algorithms are, however considerably slower. In any case it seems that the flexibility of our method shows some promise to serve as a basis for finding new integer to integer filters.",
"fno": "81831660",
"keywords": [
"Wavelet Transforms Wavelet Decomposition Wavelet Reconstruction Perfect Reconstruction Filters Arbitrary Lowpass Filter Kernels Fast Filters Compression Performance Biorthogonal Filters Prediction Scheme Lifting Scheme Integer Filters Two Channel Filter Bank Recursive Filtering"
],
"authors": [
{
"affiliation": "Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA",
"fullName": "N. Polyak",
"givenName": "N.",
"surname": "Polyak",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA",
"fullName": "W.A. Pearlman",
"givenName": "W.A.",
"surname": "Pearlman",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icip",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1997-10-01T00:00:00",
"pubType": "proceedings",
"pages": "660",
"year": "1997",
"issn": null,
"isbn": "0-8186-8183-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "81831656",
"articleId": "12OmNqOOrL3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "81831663",
"articleId": "12OmNC4eSqK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzRZpZS",
"title": "Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36163)",
"acronym": "acssc",
"groupId": "1000671",
"volume": "2",
"displayVolume": "2",
"year": "1997",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzmLxPc",
"doi": "10.1109/ACSSC.1997.679103",
"title": "Asymptotic convergence of biorthogonal wavelet filters",
"normalizedTitle": "Asymptotic convergence of biorthogonal wavelet filters",
"abstract": "We study the asymptotic behavior of the dual filters associated with biorthogonal spline wavelets (BSWs) and general biorthogonal Coifman wavelets (GBCWs). As the order of wavelet systems approaches infinity the BSW filters either diverge or converge to some non-ideal filters, the GBCW synthesis filters converge to an ideal halfband lowpass (HBLP) filter without exhibiting any Gibbs-like phenomenon, and a subclass of the analysis filters also converge to an ideal HBLP filter but with a one-sided Gibbs-like behavior. The two approximations of the ideal HBLP filter by Daubechies orthonormal wavelet filters and by the GBCW synthesis filters are also compared.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We study the asymptotic behavior of the dual filters associated with biorthogonal spline wavelets (BSWs) and general biorthogonal Coifman wavelets (GBCWs). As the order of wavelet systems approaches infinity the BSW filters either diverge or converge to some non-ideal filters, the GBCW synthesis filters converge to an ideal halfband lowpass (HBLP) filter without exhibiting any Gibbs-like phenomenon, and a subclass of the analysis filters also converge to an ideal HBLP filter but with a one-sided Gibbs-like behavior. The two approximations of the ideal HBLP filter by Daubechies orthonormal wavelet filters and by the GBCW synthesis filters are also compared.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We study the asymptotic behavior of the dual filters associated with biorthogonal spline wavelets (BSWs) and general biorthogonal Coifman wavelets (GBCWs). As the order of wavelet systems approaches infinity the BSW filters either diverge or converge to some non-ideal filters, the GBCW synthesis filters converge to an ideal halfband lowpass (HBLP) filter without exhibiting any Gibbs-like phenomenon, and a subclass of the analysis filters also converge to an ideal HBLP filter but with a one-sided Gibbs-like behavior. The two approximations of the ideal HBLP filter by Daubechies orthonormal wavelet filters and by the GBCW synthesis filters are also compared.",
"fno": "00679103",
"keywords": [
"Wavelet Transforms",
"Filtering Theory",
"Convergence Of Numerical Methods",
"Low Pass Filters",
"Asymptotic Stability",
"FIR Filters",
"Biorthogonal Wavelet Filters",
"Dual Filters",
"Asymptotic Convergence",
"Biorthogonal Spline Wavelets",
"General Biorthogonal Coifman Wavelets",
"Non Ideal Filters",
"Ideal Halfband Lowpass Filter",
"Analysis Filters",
"Gibbs Like Phenomenon",
"Daubechies Orthonormal Wavelet Filters",
"FIR Filters",
"Convergence",
"Finite Impulse Response Filter",
"Wavelet Analysis",
"Frequency",
"Spline",
"Transfer Functions",
"Filter Bank",
"Laboratories",
"H Infinity Control",
"Digital Filters"
],
"authors": [
{
"affiliation": "Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA",
"fullName": "Dong Wei",
"givenName": null,
"surname": "Dong Wei",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "A.C. Bovik",
"givenName": "A.C.",
"surname": "Bovik",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "acssc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1997-01-01T00:00:00",
"pubType": "proceedings",
"pages": "1244,1245,1246,1247,1248",
"year": "1997",
"issn": "1058-6393",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00679102",
"articleId": "12OmNzZmZlH",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00679104",
"articleId": "12OmNAKuoUt",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icassp/2004/8484/2/01326425",
"title": "Dyadic-based structure for regular biorthogonal filter banks with linear phase",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326425/12OmNARiM0a",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/2",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109c282",
"title": "On the Design of a Class of Odd-Length Biorthogonal Wavelet Filter Banks for Signal and Image Processing",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109c282/12OmNBOllpr",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1994/6405/2/00471607",
"title": "Statistically optimal synthesis banks for subband coders",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1994/00471607/12OmNBW0vyv",
"parentPublication": {
"id": "proceedings/acssc/1994/6405/1",
"title": "Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcis/2010/4304/2/4304b162",
"title": "The Intelligent Traits Regarding Biorthogonal Trivariate Wavelet Packs",
"doi": null,
"abstractUrl": "/proceedings-article/gcis/2010/4304b162/12OmNBtUdGw",
"parentPublication": {
"id": "proceedings/gcis/2010/4304/2",
"title": "2010 Second WRI Global Congress on Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/1996/7358/0/73580387",
"title": "Optimal bit allocation for biorthogonal wavelet coding",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1996/73580387/12OmNrAv3Hf",
"parentPublication": {
"id": "proceedings/dcc/1996/7358/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1991/0003/0/00150946",
"title": "Recursive biorthogonal wavelet transform for image coding",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1991/00150946/12OmNs4S8GL",
"parentPublication": {
"id": "proceedings/icassp/1991/0003/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/2/81832246",
"title": "Biorthogonal quincunx Coifman wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81832246/12OmNwDACvz",
"parentPublication": {
"id": "proceedings/icip/1997/8183/2",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/5/01327081",
"title": "Polyphase structures for multiplierless biorthogonal filter banks [image compression applications]",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01327081/12OmNwtn3Dq",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/5",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/1/81831660",
"title": "Wavelet decomposition and reconstruction using arbitrary kernels: a new approach",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81831660/12OmNzayNFE",
"parentPublication": {
"id": "proceedings/icip/1997/8183/1",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1991/0003/0/00150922",
"title": "Edge detection using recursive biorthogonal wavelet transform",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1991/00150922/12OmNzdGnvT",
"parentPublication": {
"id": "proceedings/icassp/1991/0003/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqG0SXH",
"title": "Computer Graphics and Applications, Pacific Conference on",
"acronym": "pg",
"groupId": "1000130",
"volume": "0",
"displayVolume": "0",
"year": "2000",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAWYKFX",
"doi": "10.1109/PCCGA.2000.883969",
"title": "Progressive Geometry Compression for Meshes",
"normalizedTitle": "Progressive Geometry Compression for Meshes",
"abstract": "A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations using an improved simplification method, in which each level of the mesh can be refined into the next level by carrying out a group of vertex split operations in any order. Consequently, the PM representation can be effectively encoded by permuting the vertex split operations in each group. Meanwhile, a geometry predicator using Laplacian operator is designed to predict each new vertex position using its neighbors. The correction is quantized and encoded using Huffman coding scheme. Experimental results show that our algorithm obtains higher compression ratios than the previous work. It is very suitable for progressive transmission of geometry models over Internet.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations using an improved simplification method, in which each level of the mesh can be refined into the next level by carrying out a group of vertex split operations in any order. Consequently, the PM representation can be effectively encoded by permuting the vertex split operations in each group. Meanwhile, a geometry predicator using Laplacian operator is designed to predict each new vertex position using its neighbors. The correction is quantized and encoded using Huffman coding scheme. Experimental results show that our algorithm obtains higher compression ratios than the previous work. It is very suitable for progressive transmission of geometry models over Internet.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations using an improved simplification method, in which each level of the mesh can be refined into the next level by carrying out a group of vertex split operations in any order. Consequently, the PM representation can be effectively encoded by permuting the vertex split operations in each group. Meanwhile, a geometry predicator using Laplacian operator is designed to predict each new vertex position using its neighbors. The correction is quantized and encoded using Huffman coding scheme. Experimental results show that our algorithm obtains higher compression ratios than the previous work. It is very suitable for progressive transmission of geometry models over Internet.",
"fno": "08680408",
"keywords": [
"Triangular Mesh Geometry Compression Manifold Surface Progressive Mesh"
],
"authors": [
{
"affiliation": "Zhejiang University",
"fullName": "Xinguo Liu",
"givenName": "Xinguo",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhejiang University",
"fullName": "Hujun Bao",
"givenName": "Hujun",
"surname": "Bao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhejiang University",
"fullName": "Qunsheng Peng",
"givenName": "Qunsheng",
"surname": "Peng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Chinese University of Hong Kong",
"fullName": "PhengAnn Heng",
"givenName": "PhengAnn",
"surname": "Heng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Chinese University of Hong Kong",
"fullName": "TienTsin Wong",
"givenName": "TienTsin",
"surname": "Wong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Chinese University of Hong Kong",
"fullName": "Hanqiu Sun",
"givenName": "Hanqiu",
"surname": "Sun",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pg",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2000-10-01T00:00:00",
"pubType": "proceedings",
"pages": "408",
"year": "2000",
"issn": null,
"isbn": "0-7695-0868-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08680406",
"articleId": "12OmNBc1uuy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08680411",
"articleId": "12OmNx3q6XH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzZmZqY",
"title": "International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)",
"acronym": "cgiv",
"groupId": "1001775",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBOllmm",
"doi": "10.1109/CGIV.2006.73",
"title": "Rate-Distortion Optimized Progressive Geometry Compression",
"normalizedTitle": "Rate-Distortion Optimized Progressive Geometry Compression",
"abstract": "During progressive transmission of 3D geometry models, the transmission order of details at different region has great effects on the quality of reconstructed models at low bit-rate. This work presents a ratedistortion (R-D) optimized progressive geometry compression scheme to improve the quality of reconstructed models by adjusting the transmission order of details. In this scheme, the input mesh is partitioned into parts, then each part is encoded into bit-stream independently, and the encoded bit-streams are truncated into segments while getting the R-D characteristics of every segment, at last all segments are assembled into a codestream based on R-D optimization, which ensure the region with rich detail will be transmitted early and make the reconstructed mesh achieve better quality as soon as possible. Experimental results show that, as compared with the well-known PGC method, the proposed one provides better R-D performance. Moreover, it provides a novel way to realize the region of interest (ROI) coding of 3D meshes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "During progressive transmission of 3D geometry models, the transmission order of details at different region has great effects on the quality of reconstructed models at low bit-rate. This work presents a ratedistortion (R-D) optimized progressive geometry compression scheme to improve the quality of reconstructed models by adjusting the transmission order of details. In this scheme, the input mesh is partitioned into parts, then each part is encoded into bit-stream independently, and the encoded bit-streams are truncated into segments while getting the R-D characteristics of every segment, at last all segments are assembled into a codestream based on R-D optimization, which ensure the region with rich detail will be transmitted early and make the reconstructed mesh achieve better quality as soon as possible. Experimental results show that, as compared with the well-known PGC method, the proposed one provides better R-D performance. Moreover, it provides a novel way to realize the region of interest (ROI) coding of 3D meshes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "During progressive transmission of 3D geometry models, the transmission order of details at different region has great effects on the quality of reconstructed models at low bit-rate. This work presents a ratedistortion (R-D) optimized progressive geometry compression scheme to improve the quality of reconstructed models by adjusting the transmission order of details. In this scheme, the input mesh is partitioned into parts, then each part is encoded into bit-stream independently, and the encoded bit-streams are truncated into segments while getting the R-D characteristics of every segment, at last all segments are assembled into a codestream based on R-D optimization, which ensure the region with rich detail will be transmitted early and make the reconstructed mesh achieve better quality as soon as possible. Experimental results show that, as compared with the well-known PGC method, the proposed one provides better R-D performance. Moreover, it provides a novel way to realize the region of interest (ROI) coding of 3D meshes.",
"fno": "26060207",
"keywords": [
"Rate Distortion Optimization Progressive Compression Mesh Partition"
],
"authors": [
{
"affiliation": "Beijing University of Technology, China",
"fullName": "Zhang WenBo",
"givenName": "Zhang",
"surname": "WenBo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Beijing University of Technology, China",
"fullName": "Liu Bo",
"givenName": "Liu",
"surname": "Bo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Beijing University of Technology, China",
"fullName": "Zhang Hongbin",
"givenName": "Zhang",
"surname": "Hongbin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cgiv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-07-01T00:00:00",
"pubType": "proceedings",
"pages": "207-210",
"year": "2006",
"issn": null,
"isbn": "0-7695-2606-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "26060200",
"articleId": "12OmNBuL15q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "26060211",
"articleId": "12OmNy7Qfnv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icip/1997/8183/3/81833086",
"title": "Modified Rate-Distortion Function with Optimal Classification for Wavelet Coding",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81833086/12OmNAObbMH",
"parentPublication": {
"id": "proceedings/icip/1997/8183/3",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2000/0868/0/08680408",
"title": "Progressive Geometry Compression for Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680408/12OmNAWYKFX",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2010/6425/0/05453530",
"title": "Region Based Rate-Distortion Analysis for 3D Video Coding",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2010/05453530/12OmNAle6oW",
"parentPublication": {
"id": "proceedings/dcc/2010/6425/0",
"title": "2010 Data Compression Conference (DCC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2004/8603/1/01394148",
"title": "Rate control for MPEG-4 FGS coded video using piecewise rate distortion model",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394148/12OmNAnuTyY",
"parentPublication": {
"id": "proceedings/icme/2004/8603/1",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sitis/2010/4319/0/4319a051",
"title": "A Region-Based Progressive Coding of Semi-Regular 3-D Meshes for View-Dependent Transmission",
"doi": null,
"abstractUrl": "/proceedings-article/sitis/2010/4319a051/12OmNBU1jJg",
"parentPublication": {
"id": "proceedings/sitis/2010/4319/0",
"title": "2010 Sixth International Conference on Signal-Image Technology and Internet Based Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacific-graphics/2010/4205/0/4205a070",
"title": "Rate-Distortion Optimized Progressive 3D Reconstruction from Multi-view Images",
"doi": null,
"abstractUrl": "/proceedings-article/pacific-graphics/2010/4205a070/12OmNBigFwD",
"parentPublication": {
"id": "proceedings/pacific-graphics/2010/4205/0",
"title": "Pacific Conference on Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2011/4589/0/4589a482",
"title": "Quality Improvement of Video Codec by Rate-Distortion Optimized Quantization",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2011/4589a482/12OmNrY3LBZ",
"parentPublication": {
"id": "proceedings/ism/2011/4589/0",
"title": "2011 IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2009/6325/0/05447178",
"title": "An Amended Rate Model on the Intra-rate and Quantization Parameter for Video Coding under the Complexity Constrains",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2009/05447178/12OmNx4yvwe",
"parentPublication": {
"id": "proceedings/isise/2009/6325/0",
"title": "2009 Second International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2004/8603/2/01394489",
"title": "R-D hint tracks for low-complexity R-D optimized video streaming [rate-distortion hint track]",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394489/12OmNzwpU5y",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102752",
"title": "Towards Perceptually-Optimized Compression Of User Generated Content (UGC): Prediction Of UGC Rate-Distortion Category",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102752/1kwr1RyxbHO",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyaXPP0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"acronym": "cad-cg",
"groupId": "1001488",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBTJIAu",
"doi": "10.1109/CAD-CG.2005.4",
"title": "A Global Laplacian Smoothing Approach with Feature Preservation",
"normalizedTitle": "A Global Laplacian Smoothing Approach with Feature Preservation",
"abstract": "This paper presents a novel approach for surface smoothing with feature preservation on arbitrary meshes. Laplacian operator is performed in a global way over the mesh. The surface smoothing is formulated as a quadratic optimization problem, which is easily solved a sparse linear system. The cost function to be optimized penalizes deviations from the global Laplacian operator while maintaining the overall shape of the original mesh. The features of the original mesh can be preserved by adding feature constraints and barycenter constraints in the system. Our approach is simple, non-iterative, fast, and does not cause surface shrinkage and distortion. Many experimental results are presented to show the applicability and flexibility of the approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a novel approach for surface smoothing with feature preservation on arbitrary meshes. Laplacian operator is performed in a global way over the mesh. The surface smoothing is formulated as a quadratic optimization problem, which is easily solved a sparse linear system. The cost function to be optimized penalizes deviations from the global Laplacian operator while maintaining the overall shape of the original mesh. The features of the original mesh can be preserved by adding feature constraints and barycenter constraints in the system. Our approach is simple, non-iterative, fast, and does not cause surface shrinkage and distortion. Many experimental results are presented to show the applicability and flexibility of the approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a novel approach for surface smoothing with feature preservation on arbitrary meshes. Laplacian operator is performed in a global way over the mesh. The surface smoothing is formulated as a quadratic optimization problem, which is easily solved a sparse linear system. The cost function to be optimized penalizes deviations from the global Laplacian operator while maintaining the overall shape of the original mesh. The features of the original mesh can be preserved by adding feature constraints and barycenter constraints in the system. Our approach is simple, non-iterative, fast, and does not cause surface shrinkage and distortion. Many experimental results are presented to show the applicability and flexibility of the approach.",
"fno": "24730269",
"keywords": [
"Triangular Mesh",
"Mesh Smoothing",
"Laplace Operator",
"Least Squares",
"Feature Preservation"
],
"authors": [
{
"affiliation": "Zhejiang University, China",
"fullName": "Zhongping Ji",
"givenName": "Zhongping",
"surname": "Ji",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhejiang University, China",
"fullName": "Ligang Liu",
"givenName": "Ligang",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhejiang University, China",
"fullName": "Guojin Wang",
"givenName": "Guojin",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cad-cg",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-12-01T00:00:00",
"pubType": "proceedings",
"pages": "269-274",
"year": "2005",
"issn": null,
"isbn": "0-7695-2473-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "24730259",
"articleId": "12OmNxVV5RK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "24730275",
"articleId": "12OmNBJNL1l",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pg/2000/0868/0/08680408",
"title": "Progressive Geometry Compression for Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2000/08680408/12OmNAWYKFX",
"parentPublication": {
"id": "proceedings/pg/2000/0868/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2012/4899/0/4899a151",
"title": "Creases-persevering Mesh Smoothing Based on the Discrete Differential Operators",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2012/4899a151/12OmNAXxX7P",
"parentPublication": {
"id": "proceedings/icdh/2012/4899/0",
"title": "4th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci/2009/4642/0/05250681",
"title": "Surface representation and processing",
"doi": null,
"abstractUrl": "/proceedings-article/icci/2009/05250681/12OmNApcu9f",
"parentPublication": {
"id": "proceedings/icci/2009/4642/0",
"title": "Cognitive Informatics, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmap/2000/0562/0/00838255",
"title": "Polyhedral surface smoothing with simultaneous mesh regularization",
"doi": null,
"abstractUrl": "/proceedings-article/gmap/2000/00838255/12OmNBSjJ0r",
"parentPublication": {
"id": "proceedings/gmap/2000/0562/0",
"title": "Proceedings Geometric Modeling and Processing 2000. Theory and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ast-e/2009/3672/0/3672a056",
"title": "Mesh Smoothing for Parameterized Body Model with Loop Subdivision Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/ast-e/2009/3672a056/12OmNBTs7Bu",
"parentPublication": {
"id": "proceedings/ast-e/2009/3672/0",
"title": "Advanced Science and Technology, International e-Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dpvt/2004/2223/0/22230076",
"title": "Linear Shift-Invariant Operators for Processing Surface Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2004/22230076/12OmNBhpS1n",
"parentPublication": {
"id": "proceedings/3dpvt/2004/2223/0",
"title": "3D Data Processing Visualization and Transmission, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmp/2000/0562/0/05620229",
"title": "Polyhedral Surface Smoothing with Simultaneous Mesh Regularization",
"doi": null,
"abstractUrl": "/proceedings-article/gmp/2000/05620229/12OmNs0TL2V",
"parentPublication": {
"id": "proceedings/gmp/2000/0562/0",
"title": "Geometric Modeling and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2016/2823/0/2823a588",
"title": "Locality-Aware Laplacian Mesh Smoothing",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2016/2823a588/12OmNynJMIp",
"parentPublication": {
"id": "proceedings/icpp/2016/2823/0",
"title": "2016 45th International Conference on Parallel Processing (ICPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccee/2009/3925/2/3925b258",
"title": "Feature-Preserving Smoothing Algorithm for Triangular Mesh Denoising",
"doi": null,
"abstractUrl": "/proceedings-article/iccee/2009/3925b258/12OmNyv7miu",
"parentPublication": {
"id": "proceedings/iccee/2009/3925/2",
"title": "Computer and Electrical Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsmt/2021/2063/0/206300a224",
"title": "A Projective Noise Reduction Algorithm Based on Laplacian Smoothing",
"doi": null,
"abstractUrl": "/proceedings-article/iccsmt/2021/206300a224/1E2waZnuNAA",
"parentPublication": {
"id": "proceedings/iccsmt/2021/2063/0",
"title": "2021 2nd International Conference on Computer Science and Management Technology (ICCSMT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8wTfL",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwcUk5e",
"doi": "10.1109/ICPR.2008.4761298",
"title": "Adaptive Laplacian eigenfunctions as bases for regression analysis",
"normalizedTitle": "Adaptive Laplacian eigenfunctions as bases for regression analysis",
"abstract": "Regression or least squares fitting is an important problem in statistics, data mining and many other applications. In recent years, basis functions derived from the underlying geometry of data, primarily Laplacian eigenfunctions, have attracted much interest. In this paper, we present a new framework based on adaptive Laplacian eigenfunctions and show the benefit of using a time-varying basis in regression analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Regression or least squares fitting is an important problem in statistics, data mining and many other applications. In recent years, basis functions derived from the underlying geometry of data, primarily Laplacian eigenfunctions, have attracted much interest. In this paper, we present a new framework based on adaptive Laplacian eigenfunctions and show the benefit of using a time-varying basis in regression analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Regression or least squares fitting is an important problem in statistics, data mining and many other applications. In recent years, basis functions derived from the underlying geometry of data, primarily Laplacian eigenfunctions, have attracted much interest. In this paper, we present a new framework based on adaptive Laplacian eigenfunctions and show the benefit of using a time-varying basis in regression analysis.",
"fno": "04761298",
"keywords": [
"Curve Fitting",
"Differential Geometry",
"Eigenvalues And Eigenfunctions",
"Laplace Equations",
"Least Mean Squares Methods",
"Regression Analysis",
"Adaptive Laplacian Eigenfunction",
"Regression Analysis",
"Least Squares Fitting",
"Time Varying Basis",
"Data Geometry",
"Differential Geometry",
"Laplace Equations",
"Eigenvalues And Eigenfunctions",
"Regression Analysis",
"Geometry",
"Least Squares Methods",
"Computer Science",
"Data Engineering",
"Statistical Analysis",
"Data Mining",
"Application Software"
],
"authors": [
{
"affiliation": "Department of Computer Science and Engineering, The Ohio State University, Columbus, 43210 USA",
"fullName": "Lei Ding",
"givenName": null,
"surname": "Lei Ding",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science and Engineering, The Ohio State University, Columbus, 43210 USA",
"fullName": "Xiaole Bai",
"givenName": null,
"surname": "Xiaole Bai",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": "1051-4651",
"isbn": "978-1-4244-2174-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04761297",
"articleId": "12OmNBNM93C",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04761299",
"articleId": "12OmNyuPKTC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ipccc/2014/7575/0/07017060",
"title": "JLMC: A clustering method based on Jordan-Form of Laplacian-Matrix",
"doi": null,
"abstractUrl": "/proceedings-article/ipccc/2014/07017060/12OmNARRYxS",
"parentPublication": {
"id": "proceedings/ipccc/2014/7575/0",
"title": "2014 IEEE International Performance Computing and Communications Conference (IPCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730269",
"title": "A Global Laplacian Smoothing Approach with Feature Preservation",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730269/12OmNBTJIAu",
"parentPublication": {
"id": "proceedings/cad-cg/2005/2473/0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mmbia/2012/0354/0/06164736",
"title": "Sparse shape representation using the Laplace-Beltrami eigenfunctions and its application to modeling subcortical structures",
"doi": null,
"abstractUrl": "/proceedings-article/mmbia/2012/06164736/12OmNvk7K4h",
"parentPublication": {
"id": "proceedings/mmbia/2012/0354/0",
"title": "2012 IEEE Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2011/0529/0/05981743",
"title": "Laplace-Beltrami eigenfunction metrics and geodesic shape distance features for shape matching in synthetic aperture sonar",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2011/05981743/12OmNwkhTgo",
"parentPublication": {
"id": "proceedings/cvprw/2011/0529/0",
"title": "CVPR 2011 WORKSHOPS",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460450",
"title": "Shape signature using the edge-based Laplacian",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460450/12OmNwudQLH",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2008/2242/0/04587538",
"title": "Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2008/04587538/12OmNyQph7m",
"parentPublication": {
"id": "proceedings/cvpr/2008/2242/0",
"title": "2008 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2016/5407/0/5407a499",
"title": "SpectroMeter: Amortized Sublinear Spectral Approximation of Distance on Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2016/5407a499/12OmNzdoMNK",
"parentPublication": {
"id": "proceedings/3dv/2016/5407/0",
"title": "2016 Fourth International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0171",
"title": "Geometry-Aware Bases for Shape Approximation",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0171/13rRUwfZC01",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2018/7449/0/744900a564",
"title": "An Improved Laplacian Semi-Supervised Regression",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2018/744900a564/17D45XDIXUq",
"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/compsac/2022/8810/0/881000a426",
"title": "Preliminary Study for the Impact of Small Eigenvalues on Laplacian Anomaly Detection of Dynamic Networks",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2022/881000a426/1FJ5ywzr4zu",
"parentPublication": {
"id": "proceedings/compsac/2022/8810/0",
"title": "2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqHItAr",
"title": "Proceedings of International Conference on Image Processing",
"acronym": "icip",
"groupId": "1000349",
"volume": "3",
"displayVolume": "3",
"year": "1997",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyYm2A3",
"doi": "10.1109/ICIP.1997.632151",
"title": "2-D Mesh Geometry and Motion Compression for Efficient Object-Based Video Representation",
"normalizedTitle": "2-D Mesh Geometry and Motion Compression for Efficient Object-Based Video Representation",
"abstract": "Methods for object-based compression and composition of natural and synthetic video content are current emerging in standards such as MPEG-4 and VRML. This paper describes novel techniques for compression of 2-D triangular mesh geometry and motion, enabling efficient representation and manipulation of video content. Specifically, mesh geometry is compressed by predictive coding of mesh node locations. Mesh node motion vectors are compressed by predictive techniques as well. Preliminary results show that the mesh data can be coded at a fraction of the bits used to code a typical video object.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Methods for object-based compression and composition of natural and synthetic video content are current emerging in standards such as MPEG-4 and VRML. This paper describes novel techniques for compression of 2-D triangular mesh geometry and motion, enabling efficient representation and manipulation of video content. Specifically, mesh geometry is compressed by predictive coding of mesh node locations. Mesh node motion vectors are compressed by predictive techniques as well. Preliminary results show that the mesh data can be coded at a fraction of the bits used to code a typical video object.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Methods for object-based compression and composition of natural and synthetic video content are current emerging in standards such as MPEG-4 and VRML. This paper describes novel techniques for compression of 2-D triangular mesh geometry and motion, enabling efficient representation and manipulation of video content. Specifically, mesh geometry is compressed by predictive coding of mesh node locations. Mesh node motion vectors are compressed by predictive techniques as well. Preliminary results show that the mesh data can be coded at a fraction of the bits used to code a typical video object.",
"fno": "81833440",
"keywords": [],
"authors": [
{
"affiliation": "University of Rochester",
"fullName": "P.J.L. Van Beek",
"givenName": "P.J.L.",
"surname": "Van Beek",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Rochester",
"fullName": "A.M. Tekalp",
"givenName": "A.M.",
"surname": "Tekalp",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Rochester",
"fullName": "A. Puri",
"givenName": "A.",
"surname": "Puri",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icip",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1997-10-01T00:00:00",
"pubType": "proceedings",
"pages": "440",
"year": "1997",
"issn": null,
"isbn": "0-8186-8183-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "81833436",
"articleId": "12OmNxH9X89",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "81833444",
"articleId": "12OmNzBOhtC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNylsZKi",
"title": "Visualization Conference, IEEE",
"acronym": "ieee-vis",
"groupId": "1000796",
"volume": "0",
"displayVolume": "0",
"year": "1998",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwpXRUW",
"doi": "10.1109/VISUAL.1998.745283",
"title": "Efficient Implementation of Multi-Triangulations",
"normalizedTitle": "Efficient Implementation of Multi-Triangulations",
"abstract": "TheMulti-Triangulation (MT) is a general framework for managing the Level-of-Detail in large triangle meshes, which we have introduced in our previous work. In this paper, we describe an efficient implementation of an MT based on vertex decimation. We present general techniques for querying an MT, which are independent of a specific application, and which can be applied for solving problems, such as selective refinement, windowing, point location, and other spatial interference queries. We describe alternative data structures for encoding an MT, which achieve different trade-offs between space and performance. Experimental results are discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "TheMulti-Triangulation (MT) is a general framework for managing the Level-of-Detail in large triangle meshes, which we have introduced in our previous work. In this paper, we describe an efficient implementation of an MT based on vertex decimation. We present general techniques for querying an MT, which are independent of a specific application, and which can be applied for solving problems, such as selective refinement, windowing, point location, and other spatial interference queries. We describe alternative data structures for encoding an MT, which achieve different trade-offs between space and performance. Experimental results are discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "TheMulti-Triangulation (MT) is a general framework for managing the Level-of-Detail in large triangle meshes, which we have introduced in our previous work. In this paper, we describe an efficient implementation of an MT based on vertex decimation. We present general techniques for querying an MT, which are independent of a specific application, and which can be applied for solving problems, such as selective refinement, windowing, point location, and other spatial interference queries. We describe alternative data structures for encoding an MT, which achieve different trade-offs between space and performance. Experimental results are discussed.",
"fno": "91760043",
"keywords": [
"Coding And Information Theory",
"Data Compaction And Compression",
"Picture Image Generation",
"Display Algorithms",
"Computational Geometry And Object Modeling",
"Curve",
"Surface",
"Solid And Object Representations",
"Geometric Algorithms",
"Three Dimensional Graphics And Realism",
"Virtual Reality"
],
"authors": [
{
"affiliation": "Università di Genova",
"fullName": "Leila De Floriani",
"givenName": "Leila",
"surname": "De Floriani",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Università di Genova",
"fullName": "Paola Magillo",
"givenName": "Paola",
"surname": "Magillo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Consiglio Nazionale delle Ricerche",
"fullName": "Enrico Puppo",
"givenName": "Enrico",
"surname": "Puppo",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1998-10-01T00:00:00",
"pubType": "proceedings",
"pages": "43",
"year": "1998",
"issn": null,
"isbn": "0-8186-9176-x",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "91760035",
"articleId": "12OmNBV9Ijx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "91760051",
"articleId": "12OmNzVoBtU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isspit/2014/1812/0/07300560",
"title": "Design of efficient decimation filter structure for WiMAX applications with memory saving approach",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2014/07300560/12OmNA14AiA",
"parentPublication": {
"id": "proceedings/isspit/2014/1812/0",
"title": "2014 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1998/8295/0/82950614",
"title": "A Cubist Approach to Object Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1998/82950614/12OmNBUS78z",
"parentPublication": {
"id": "proceedings/iccv/1998/8295/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200ying",
"title": "Nonmanifold Subdivision",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200ying/12OmNBuL14k",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmai/2007/2901/0/29010067",
"title": "A Comparison of Efficient Decimation Algorithms for Polygonal Models",
"doi": null,
"abstractUrl": "/proceedings-article/gmai/2007/29010067/12OmNx9nGLs",
"parentPublication": {
"id": "proceedings/gmai/2007/2901/0",
"title": "2007 Geometric Modeling and Imaging: New Advances",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1994/1775/2/00389487",
"title": "Adaptive multi-feature motion estimation",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1994/00389487/12OmNzBOiha",
"parentPublication": {
"id": "proceedings/icassp/1994/1775/2",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1998/9176/0/91760255",
"title": "High Quality Rendering of Attributed Volume Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1998/91760255/12OmNzTYC1D",
"parentPublication": {
"id": "proceedings/ieee-vis/1998/9176/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880211",
"title": "Compatible Triangulations of Spatial Decompositions",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880211/12OmNzWfoTC",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/03/ttg2008030640",
"title": "Silhouette Smoothing for Real-Time Rendering of Mesh Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2008/03/ttg2008030640/13rRUwI5TQP",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2005/09/i1446",
"title": "An Efficient Parameterless Quadrilateral-Based Image Segmentation Method",
"doi": null,
"abstractUrl": "/journal/tp/2005/09/i1446/13rRUwdIOTf",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/06/07927461",
"title": "Good Random Multi-Triangulation of Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2018/06/07927461/13rRUxly9e2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNC8dg91",
"title": "2016 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx2zjw5",
"doi": "10.1109/BigData.2016.7840674",
"title": "Efficient triangle listing for billion-scale graphs",
"normalizedTitle": "Efficient triangle listing for billion-scale graphs",
"abstract": "This paper addresses the classical triangle listing problem, which aims at enumerating all the tuples of three vertices connected with each other by edges. This problem has been intensively studied in internal and external memory, but it is still an urgent challenge in distributed environment where multiple machines across the network can be utilized to achieve good performance and scalability. As one of the de facto computing methodologies in distributed environment, MapReduce has been used in some of existing triangle listing algorithms. However, these algorithms usually need to shuffle a huge amount of intermediate data, which seriously hinders the scalability on large scale graphs. In this paper, we propose a new triangle listing algorithm in MapReduce, FTL, which utilizes a light weight data structure to substantially reduce the intermediate data transferred during the shuffle stage, and also is equipped with multiple-round techniques to ease the burden on memory and network bandwidth when dealing with graphs at billion scale. We prove that the size of the intermediate data can be well bounded near to the number of triangles in the graph. To further reduce the shuffle size in each round, we also devise a compact data structure to store the intermediate data, which can save space up to 2/3. The extensive experimental results show that our algorithms outperform existing competitors by several times on large real world graphs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper addresses the classical triangle listing problem, which aims at enumerating all the tuples of three vertices connected with each other by edges. This problem has been intensively studied in internal and external memory, but it is still an urgent challenge in distributed environment where multiple machines across the network can be utilized to achieve good performance and scalability. As one of the de facto computing methodologies in distributed environment, MapReduce has been used in some of existing triangle listing algorithms. However, these algorithms usually need to shuffle a huge amount of intermediate data, which seriously hinders the scalability on large scale graphs. In this paper, we propose a new triangle listing algorithm in MapReduce, FTL, which utilizes a light weight data structure to substantially reduce the intermediate data transferred during the shuffle stage, and also is equipped with multiple-round techniques to ease the burden on memory and network bandwidth when dealing with graphs at billion scale. We prove that the size of the intermediate data can be well bounded near to the number of triangles in the graph. To further reduce the shuffle size in each round, we also devise a compact data structure to store the intermediate data, which can save space up to 2/3. The extensive experimental results show that our algorithms outperform existing competitors by several times on large real world graphs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper addresses the classical triangle listing problem, which aims at enumerating all the tuples of three vertices connected with each other by edges. This problem has been intensively studied in internal and external memory, but it is still an urgent challenge in distributed environment where multiple machines across the network can be utilized to achieve good performance and scalability. As one of the de facto computing methodologies in distributed environment, MapReduce has been used in some of existing triangle listing algorithms. However, these algorithms usually need to shuffle a huge amount of intermediate data, which seriously hinders the scalability on large scale graphs. In this paper, we propose a new triangle listing algorithm in MapReduce, FTL, which utilizes a light weight data structure to substantially reduce the intermediate data transferred during the shuffle stage, and also is equipped with multiple-round techniques to ease the burden on memory and network bandwidth when dealing with graphs at billion scale. We prove that the size of the intermediate data can be well bounded near to the number of triangles in the graph. To further reduce the shuffle size in each round, we also devise a compact data structure to store the intermediate data, which can save space up to 2/3. The extensive experimental results show that our algorithms outperform existing competitors by several times on large real world graphs.",
"fno": "07840674",
"keywords": [
"Data Handling",
"Graph Theory",
"Network Theory Graphs",
"Parallel Processing",
"Storage Management",
"Triangle Listing Problem",
"Billion Scale Graphs",
"Internal Memory",
"External Memory",
"Distributed Environment",
"Multiple Machines",
"Map Reduce",
"Partitioning Algorithms",
"Data Structures",
"Algorithm Design And Analysis",
"Scalability",
"Big Data",
"Clustering Algorithms",
"Twitter"
],
"authors": [
{
"affiliation": "State Key Laboratory of Software Engineering, Wuhan University, China",
"fullName": "Hao Zhang",
"givenName": "Hao",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "State Key Laboratory of Software Engineering, Wuhan University, China",
"fullName": "Yuanyuan Zhu",
"givenName": "Yuanyuan",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Centre for Quantum Computation and Intelligent Systems, University of Technology, Sydney, Australia",
"fullName": "Lu Qin",
"givenName": "Lu",
"surname": "Qin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Chinese University of Hong Kong, Hong Kong, China",
"fullName": "Hong Cheng",
"givenName": "Hong",
"surname": "Cheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Chinese University of Hong Kong, Hong Kong, China",
"fullName": "Jeffrey Xu Yu",
"givenName": "Jeffrey Xu",
"surname": "Yu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-12-01T00:00:00",
"pubType": "proceedings",
"pages": "813-822",
"year": "2016",
"issn": null,
"isbn": "978-1-4673-9005-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07840673",
"articleId": "12OmNzZ5olW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07840675",
"articleId": "12OmNAKM03y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdcs/2017/1792/0/1792a775",
"title": "DeGPar: Large Scale Topic Detection Using Node-Cut Partitioning on Dense Weighted Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2017/1792a775/12OmNAfPIOD",
"parentPublication": {
"id": "proceedings/icdcs/2017/1792/0",
"title": "2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2017/2293/0/229301a002",
"title": "Exact and Parallel Triangle Counting in Dynamic Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2017/229301a002/12OmNBgQFJA",
"parentPublication": {
"id": "proceedings/hipc/2017/2293/0",
"title": "2017 IEEE 24th International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2018/3649/0/364901a545",
"title": "An Efficient Triangle Enumeration on Parallel and Distributed Frameworks",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2018/364901a545/12OmNCd2rMA",
"parentPublication": {
"id": "proceedings/bigcomp/2018/3649/0",
"title": "2018 IEEE International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/la-web/2014/6953/0/6953a033",
"title": "Listing Dense Subgraphs in Small Memory",
"doi": null,
"abstractUrl": "/proceedings-article/la-web/2014/6953a033/12OmNwudQPu",
"parentPublication": {
"id": "proceedings/la-web/2014/6953/0",
"title": "2014 9th Latin American Web Congress (LA-WEB)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcomp/2016/8796/0/07425819",
"title": "Exploiting CPU parallelism for triangle listing using hybrid summarized bit batch vector",
"doi": null,
"abstractUrl": "/proceedings-article/bigcomp/2016/07425819/12OmNxuXcDi",
"parentPublication": {
"id": "proceedings/bigcomp/2016/8796/0",
"title": "2016 International Conference on Big Data and Smart Computing (BigComp)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2015/7587/0/7587a370",
"title": "PDTL: Parallel and Distributed Triangle Listing for Massive Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2015/7587a370/12OmNxuo0j9",
"parentPublication": {
"id": "proceedings/icpp/2015/7587/0",
"title": "2015 44th International Conference on Parallel Processing (ICPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2016/5473/0/07837834",
"title": "On Efficient External-Memory Triangle Listing",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07837834/12OmNybfqZI",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/04/09120364",
"title": "Improving I/O Complexity of Triangle Enumeration",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09120364/1kLe6QmQecw",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2020/9621/0/962100a786",
"title": "Monochromatic Triangles, Triangle Listing and APSP",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2020/962100a786/1qyxA1Zx8Mo",
"parentPublication": {
"id": "proceedings/focs/2020/9621/0",
"title": "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2021/9184/0/918400b332",
"title": "DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2021/918400b332/1uGXjHEfQhG",
"parentPublication": {
"id": "proceedings/icde/2021/9184/0",
"title": "2021 IEEE 37th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwHz03N",
"title": "2017 IEEE International Conference on Data Mining (ICDM)",
"acronym": "icdm",
"groupId": "1000179",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyL0TuS",
"doi": "10.1109/ICDM.2017.143",
"title": "WRS: Waiting Room Sampling for Accurate Triangle Counting in Real Graph Streams",
"normalizedTitle": "WRS: Waiting Room Sampling for Accurate Triangle Counting in Real Graph Streams",
"abstract": "If we cannot store all edges in a graph stream, which edges should we store to estimate the triangle count accurately?Counting triangles (i.e., cycles of length three) is a fundamental graph problem with many applications in social network analysis, web mining, anomaly detection, etc. Recently, much effort has been made to accurately estimate global and local triangle counts in streaming settings with limited space. Although existing methods use sampling techniques without considering temporal dependencies in edges, we observe temporal locality in real dynamic graphs. That is, future edges are more likely to form triangles with recent edges than with older edges. In this work, we propose a single-pass streaming algorithm called Waiting-Room Sampling (WRS) for global and local triangle counting. WRS exploits the temporal locality by always storing the most recent edges, which future edges are more likely to form triangles with, in the waiting room, while it uses reservoir sampling for the remaining edges. Our theoretical and empirical analyses show that WRS is: (a) Fast and 'any time': runs in linear time, always maintaining and updating estimates while new edges arrive, (b) Effective: yields up to 47% smaller estimation error than its best competitors, and (c) Theoretically sound: gives unbiased estimates with small variances under the temporal locality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "If we cannot store all edges in a graph stream, which edges should we store to estimate the triangle count accurately?Counting triangles (i.e., cycles of length three) is a fundamental graph problem with many applications in social network analysis, web mining, anomaly detection, etc. Recently, much effort has been made to accurately estimate global and local triangle counts in streaming settings with limited space. Although existing methods use sampling techniques without considering temporal dependencies in edges, we observe temporal locality in real dynamic graphs. That is, future edges are more likely to form triangles with recent edges than with older edges. In this work, we propose a single-pass streaming algorithm called Waiting-Room Sampling (WRS) for global and local triangle counting. WRS exploits the temporal locality by always storing the most recent edges, which future edges are more likely to form triangles with, in the waiting room, while it uses reservoir sampling for the remaining edges. Our theoretical and empirical analyses show that WRS is: (a) Fast and 'any time': runs in linear time, always maintaining and updating estimates while new edges arrive, (b) Effective: yields up to 47% smaller estimation error than its best competitors, and (c) Theoretically sound: gives unbiased estimates with small variances under the temporal locality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "If we cannot store all edges in a graph stream, which edges should we store to estimate the triangle count accurately?Counting triangles (i.e., cycles of length three) is a fundamental graph problem with many applications in social network analysis, web mining, anomaly detection, etc. Recently, much effort has been made to accurately estimate global and local triangle counts in streaming settings with limited space. Although existing methods use sampling techniques without considering temporal dependencies in edges, we observe temporal locality in real dynamic graphs. That is, future edges are more likely to form triangles with recent edges than with older edges. In this work, we propose a single-pass streaming algorithm called Waiting-Room Sampling (WRS) for global and local triangle counting. WRS exploits the temporal locality by always storing the most recent edges, which future edges are more likely to form triangles with, in the waiting room, while it uses reservoir sampling for the remaining edges. Our theoretical and empirical analyses show that WRS is: (a) Fast and 'any time': runs in linear time, always maintaining and updating estimates while new edges arrive, (b) Effective: yields up to 47% smaller estimation error than its best competitors, and (c) Theoretically sound: gives unbiased estimates with small variances under the temporal locality.",
"fno": "3835b087",
"keywords": [
"Computational Complexity",
"Estimation Theory",
"Graph Theory",
"Sampling Methods",
"WRS",
"Real Graph Streams",
"Fundamental Graph Problem",
"Temporal Locality",
"Dynamic Graphs",
"Single Pass Streaming Algorithm",
"Waiting Room Sampling",
"Global Triangle Counting",
"Local Triangle Counting",
"Reservoir Sampling",
"Global Triangle Counts Estimation",
"Local Triangle Counts Estimation",
"Social Network Services",
"Reservoirs",
"Estimation Error",
"Heuristic Algorithms",
"Image Edge Detection",
"Algorithm Design And Analysis",
"Electronic Mail",
"Triangle Counting",
"Graph Stream",
"Edge Sampling"
],
"authors": [
{
"affiliation": null,
"fullName": "Kijung Shin",
"givenName": "Kijung",
"surname": "Shin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-11-01T00:00:00",
"pubType": "proceedings",
"pages": "1087-1092",
"year": "2017",
"issn": "2374-8486",
"isbn": "978-1-5386-3835-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3835b081",
"articleId": "12OmNrMZpxr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3835b093",
"articleId": "12OmNzsrwkw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hipc/2017/2293/0/229301a002",
"title": "Exact and Parallel Triangle Counting in Dynamic Graphs",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2017/229301a002/12OmNBgQFJA",
"parentPublication": {
"id": "proceedings/hipc/2017/2293/0",
"title": "2017 IEEE 24th International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2004/2171/0/21710278",
"title": "Memory Efficient Adjacent Triangle Connectivity of a Vertex Using Triangle Strips",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2004/21710278/12OmNvA1h9i",
"parentPublication": {
"id": "proceedings/cgi/2004/2171/0",
"title": "Proceedings. Computer Graphics International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2013/1293/0/06691744",
"title": "Approximate triangle counting algorithms on multi-cores",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2013/06691744/12OmNvzJGdR",
"parentPublication": {
"id": "proceedings/big-data/2013/1293/0",
"title": "2013 IEEE International Conference on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asonam/2018/6051/0/08508789",
"title": "Improved Triangle Counting in Graph Streams: Power of Multi-Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/asonam/2018/08508789/14Fq0WE0DK2",
"parentPublication": {
"id": "proceedings/asonam/2018/6051/0",
"title": "2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2018/8384/0/838400a171",
"title": "TriCore: Parallel Triangle Counting on GPUs",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2018/838400a171/17D45W9KVFm",
"parentPublication": {
"id": "proceedings/sc/2018/8384/0",
"title": "2018 SC18: The International Conference for High Performance Computing, Networking, Storage, and Analysis (SC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10015766",
"title": "Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10015766/1JSl2CJeoFi",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10115002",
"title": "Balanced and Unbalanced Triangle Count in Signed Networks",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10115002/1MQv8i7BkSk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2019/7474/0/747400a758",
"title": "REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2019/747400a758/1aDT4baxxrW",
"parentPublication": {
"id": "proceedings/icde/2019/7474/0",
"title": "2019 IEEE 35th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2019/2583/0/258300a294",
"title": "Distributed Triangle Counting Algorithms in Simple Graph Stream",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2019/258300a294/1h5Wl59CPpC",
"parentPublication": {
"id": "proceedings/icpads/2019/2583/0",
"title": "2019 IEEE 25th International Conference on Parallel and Distributed Systems (ICPADS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/02/09468328",
"title": "A Block-Based Triangle Counting Algorithm on Heterogeneous Environments",
"doi": null,
"abstractUrl": "/journal/td/2022/02/09468328/1uPuRchcQYU",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1h0F9OLLALm",
"title": "2019 4th International Conference on Mechanical, Control and Computer Engineering (ICMCCE)",
"acronym": "icmcce",
"groupId": "1824464",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1h0FeG7eXhS",
"doi": "10.1109/ICMCCE48743.2019.00197",
"title": "Research on Command and Control Network Load Redistribution Algorithm Based on "Triangle" Structure",
"normalizedTitle": "Research on Command and Control Network Load Redistribution Algorithm Based on \"Triangle\" Structure",
"abstract": "As an important channel of information transmission in the network, the key edge plays a vital role in the network information flow. In order to solve the problem of load redistribution of cascade failure network, this paper mainly does the following work. Firstly, When cascade failure occurs in the network, the process of cascading failure is analyzed according to the \"triangle\" position of the failed edge, thereby the load of the failed edge is allocated to the synergy edge or the skip-level edge according to the idle capacity. Secondly, a load redistribution method based on \"triangle\" structure is proposed. Finally, by randomly deleting edges, the carrying capacity of the network is simulated when the network is attacked. The experimental results show that the load redistribution algorithm proposed in this paper improves the destruction resistance of the command and control network.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As an important channel of information transmission in the network, the key edge plays a vital role in the network information flow. In order to solve the problem of load redistribution of cascade failure network, this paper mainly does the following work. Firstly, When cascade failure occurs in the network, the process of cascading failure is analyzed according to the \"triangle\" position of the failed edge, thereby the load of the failed edge is allocated to the synergy edge or the skip-level edge according to the idle capacity. Secondly, a load redistribution method based on \"triangle\" structure is proposed. Finally, by randomly deleting edges, the carrying capacity of the network is simulated when the network is attacked. The experimental results show that the load redistribution algorithm proposed in this paper improves the destruction resistance of the command and control network.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As an important channel of information transmission in the network, the key edge plays a vital role in the network information flow. In order to solve the problem of load redistribution of cascade failure network, this paper mainly does the following work. Firstly, When cascade failure occurs in the network, the process of cascading failure is analyzed according to the \"triangle\" position of the failed edge, thereby the load of the failed edge is allocated to the synergy edge or the skip-level edge according to the idle capacity. Secondly, a load redistribution method based on \"triangle\" structure is proposed. Finally, by randomly deleting edges, the carrying capacity of the network is simulated when the network is attacked. The experimental results show that the load redistribution algorithm proposed in this paper improves the destruction resistance of the command and control network.",
"fno": "468900a866",
"keywords": [
"Complex Networks",
"Edge Detection",
"Graph Theory",
"Network Theory Graphs",
"Resource Allocation",
"Information Transmission",
"Network Information Flow",
"Cascade Failure Network",
"Triangle Position",
"Failed Edge",
"Synergy Edge",
"Skip Level Edge",
"Idle Capacity",
"Load Redistribution Method",
"Carrying Capacity",
"Load Redistribution Algorithm",
"Command And Control Network Load Redistribution Algorithm",
"Power System Faults",
"Power System Protection",
"Manganese",
"Load Modeling",
"Command And Control Systems",
"Peer To Peer Computing",
"Network Topology",
"C 2 Networks",
"Cascading Failure",
"X 0022 Triangle X 0022 Structure",
"Load Redistribution"
],
"authors": [
{
"affiliation": "Dalian University",
"fullName": "Shaoming Qiu",
"givenName": "Shaoming",
"surname": "Qiu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dalian University",
"fullName": "Tao Yu",
"givenName": "Tao",
"surname": "Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dalian University",
"fullName": "Xiuli Du",
"givenName": "Xiuli",
"surname": "Du",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dalian University",
"fullName": "Xiaoshuang Chen",
"givenName": "Xiaoshuang",
"surname": "Chen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icmcce",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-10-01T00:00:00",
"pubType": "proceedings",
"pages": "866-8664",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-4689-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "468900a862",
"articleId": "1h0FeZiAeic",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "468900a871",
"articleId": "1h0Fk5EOikg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ipdpsw/2017/3408/0/07965174",
"title": "Automated Dynamic Data Redistribution",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2017/07965174/12OmNAlvHLu",
"parentPublication": {
"id": "proceedings/ipdpsw/2017/3408/0",
"title": "2017 IEEE International Parallel and Distributed Processing Symposium: Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infcom/1988/0833/0/00013013",
"title": "Selective load redistribution in packet-switched networks",
"doi": null,
"abstractUrl": "/proceedings-article/infcom/1988/00013013/12OmNrkT7rq",
"parentPublication": {
"id": "proceedings/infcom/1988/0833/0",
"title": "IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rta/1994/6375/0/00316135",
"title": "Optimal dynamic redistribution of divisible load in distributed real-time systems",
"doi": null,
"abstractUrl": "/proceedings-article/rta/1994/00316135/12OmNviZldQ",
"parentPublication": {
"id": "proceedings/rta/1994/6375/0",
"title": "Proceedings of 2nd IEEE Workshop on Real-Time Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pdp/2004/2083/0/20830326",
"title": "Minimizing the Load Redistribution Cost in Cluster Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/pdp/2004/20830326/12OmNx5piZJ",
"parentPublication": {
"id": "proceedings/pdp/2004/2083/0",
"title": "12th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'04)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2016/5411/0/07839673",
"title": "Efficient Data Redistribution to Speedup Big Data Analytics in Large Systems",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2016/07839673/12OmNx7G62D",
"parentPublication": {
"id": "proceedings/hipc/2016/5411/0",
"title": "2016 IEEE 23rd International Conference on High-Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2017/1993/0/1993a042",
"title": "Taming Performance Hotspots in Cloud Storage with Dynamic Load Redistribution",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2017/1993a042/12OmNzxPTNz",
"parentPublication": {
"id": "proceedings/cloud/2017/1993/0",
"title": "2017 IEEE 10th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2012/09/ttd2012091731",
"title": "Quantitative Analysis of Load Redistribution Attacks in Power Systems",
"doi": null,
"abstractUrl": "/journal/td/2012/09/ttd2012091731/13rRUB7a1fr",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2007/06/l0849",
"title": "Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks",
"doi": null,
"abstractUrl": "/journal/td/2007/06/l0849/13rRUNvgz9e",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2018/03/08344567",
"title": "Attack Vulnerability of Power Systems Under an Equal Load Redistribution Model",
"doi": null,
"abstractUrl": "/journal/nt/2018/03/08344567/13rRUxZ0nYR",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1983/09/01676329",
"title": "Load Redistribution Under Failure in Distributed Systems",
"doi": null,
"abstractUrl": "/journal/tc/1983/09/01676329/13rRUxlgxSh",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyNQSGO",
"title": "2007 IEEE Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBQkx7b",
"doi": "10.1109/CVPR.2007.383466",
"title": "Geometric Modeling and Calibration of Planar Multi-Projector Displays Using Rational Bezier Patches",
"normalizedTitle": "Geometric Modeling and Calibration of Planar Multi-Projector Displays Using Rational Bezier Patches",
"abstract": "In order to achieve seamless imagery in a planar multiprojector display, geometric distortions and misalignment of images within and across projectors have to be removed. Camera-based calibration methods are popular for achieving this in an automated fashion. Previous methods for geometric calibration fall into two categories: (a) Methods that model the geometric function relating the projectors to cameras using simple linear models, like homography, to calibrate the display. These models assume perfect linear devices and cannot address projector non-linearities, like lens distortions, which are common in most commodity projectors. (b) Methods that use piecewise linear approximations to model the relationship between projectors and cameras. These require a dense sampling of the function space to achieve good calibration. In this paper, we present a new closed-form model that relates projectors to cameras in planar multi-projector displays, using rational Bezier patches. This model overcomes the shortcomings of the previous methods by allowing for projectors with significant lens distortion. It can be further used to develop an efficient and accurate geometric calibration method with a sparse sampling of the function.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In order to achieve seamless imagery in a planar multiprojector display, geometric distortions and misalignment of images within and across projectors have to be removed. Camera-based calibration methods are popular for achieving this in an automated fashion. Previous methods for geometric calibration fall into two categories: (a) Methods that model the geometric function relating the projectors to cameras using simple linear models, like homography, to calibrate the display. These models assume perfect linear devices and cannot address projector non-linearities, like lens distortions, which are common in most commodity projectors. (b) Methods that use piecewise linear approximations to model the relationship between projectors and cameras. These require a dense sampling of the function space to achieve good calibration. In this paper, we present a new closed-form model that relates projectors to cameras in planar multi-projector displays, using rational Bezier patches. This model overcomes the shortcomings of the previous methods by allowing for projectors with significant lens distortion. It can be further used to develop an efficient and accurate geometric calibration method with a sparse sampling of the function.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In order to achieve seamless imagery in a planar multiprojector display, geometric distortions and misalignment of images within and across projectors have to be removed. Camera-based calibration methods are popular for achieving this in an automated fashion. Previous methods for geometric calibration fall into two categories: (a) Methods that model the geometric function relating the projectors to cameras using simple linear models, like homography, to calibrate the display. These models assume perfect linear devices and cannot address projector non-linearities, like lens distortions, which are common in most commodity projectors. (b) Methods that use piecewise linear approximations to model the relationship between projectors and cameras. These require a dense sampling of the function space to achieve good calibration. In this paper, we present a new closed-form model that relates projectors to cameras in planar multi-projector displays, using rational Bezier patches. This model overcomes the shortcomings of the previous methods by allowing for projectors with significant lens distortion. It can be further used to develop an efficient and accurate geometric calibration method with a sparse sampling of the function.",
"fno": "04270464",
"keywords": [],
"authors": [
{
"affiliation": "Department of Computer Science, University of California, Irvine. ebhasker@ics.uci.edu",
"fullName": "Ezekiel S. Bhasker",
"givenName": "Ezekiel S.",
"surname": "Bhasker",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, University of California, Irvine. majumder@ics.uci.edu",
"fullName": "Aditi Majumder",
"givenName": "Aditi",
"surname": "Majumder",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2007",
"issn": null,
"isbn": "1-4244-1179-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04270463",
"articleId": "12OmNAJVcCL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04270465",
"articleId": "12OmNyRg4sd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2004/2128/1/212810014",
"title": "Auto-Calibration of Multi-Projector Display Walls",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212810014/12OmNCb3fwi",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2009/3994/0/05204317",
"title": "Geometric video projector auto-calibration",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2009/05204317/12OmNCxtyKC",
"parentPublication": {
"id": "proceedings/cvprw/2009/3994/0",
"title": "2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2006/2646/0/26460004",
"title": "Autocalibration of an Ad Hoc Construction of Multi-Projector Displays",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2006/26460004/12OmNqBbHEj",
"parentPublication": {
"id": "proceedings/cvprw/2006/2646/0",
"title": "2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780017",
"title": "Achieving Color Uniformity Across Multi-Projector Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780017/12OmNwlHSVv",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2012/4873/0/4873a464",
"title": "Simple, Accurate, and Robust Projector-Camera Calibration",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2012/4873a464/12OmNx0RIZY",
"parentPublication": {
"id": "proceedings/3dimpvt/2012/4873/0",
"title": "2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2001/1272/2/127220151",
"title": "Dynamic Shadow Elimination for Multi-Projector Displays",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2001/127220151/12OmNz5JCeX",
"parentPublication": {
"id": "proceedings/cvpr/2001/1272/2",
"title": "Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2009/3943/0/04810996",
"title": "A Distributed Cooperative Framework for Continuous Multi-Projector Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2009/04810996/12OmNzV70vz",
"parentPublication": {
"id": "proceedings/vr/2009/3943/0",
"title": "2009 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1101",
"title": "Asynchronous Distributed Calibration for Scalable and Reconfigurable Multi-Projector Displays",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1101/13rRUwInvJ9",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/06/v1368",
"title": "Registration Techniques for Using Imperfect and Par tially Calibrated Devices in Planar Multi-Projector Displays",
"doi": null,
"abstractUrl": "/journal/tg/2007/06/v1368/13rRUwInvyp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08889677",
"title": "Automated Geometric Registration for Multi-Projector Displays on Arbitrary 3D Shapes Using Uncalibrated Devices",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08889677/1eBugxXEgLe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNASrawz",
"title": "2009 IEEE Virtual Reality Conference",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqIhG73",
"doi": "10.1109/VR.2009.4811032",
"title": "A Unified Calibration Method with a Parametric Approach for Wide-Field-of-View Multiprojector Displays",
"normalizedTitle": "A Unified Calibration Method with a Parametric Approach for Wide-Field-of-View Multiprojector Displays",
"abstract": "In this paper, we describe techniques for supporting a wide-field-of-view multiprojector curved screen display system. Our main contribution is in achieving automatic geometric calibration and efficient rendering for seamless displays, which is effective even in the presence of panoramic surround screens with the multiview calibration method without polygonal representation of the display surface. We show several prototype systems that use a stereo camera for capturing and a new rendering method for quadric curved screens. Previous approaches have required a calibration camera at the sweet spot. Due to parameterized representation, however, our unified calibration method is independent of the orientation and field of view of the calibration camera. This method can simplify the tedious and complicated installation process as well as the maintenance of large multiprojector displays in planetariums, virtual reality systems, and other visualization venues.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we describe techniques for supporting a wide-field-of-view multiprojector curved screen display system. Our main contribution is in achieving automatic geometric calibration and efficient rendering for seamless displays, which is effective even in the presence of panoramic surround screens with the multiview calibration method without polygonal representation of the display surface. We show several prototype systems that use a stereo camera for capturing and a new rendering method for quadric curved screens. Previous approaches have required a calibration camera at the sweet spot. Due to parameterized representation, however, our unified calibration method is independent of the orientation and field of view of the calibration camera. This method can simplify the tedious and complicated installation process as well as the maintenance of large multiprojector displays in planetariums, virtual reality systems, and other visualization venues.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we describe techniques for supporting a wide-field-of-view multiprojector curved screen display system. Our main contribution is in achieving automatic geometric calibration and efficient rendering for seamless displays, which is effective even in the presence of panoramic surround screens with the multiview calibration method without polygonal representation of the display surface. We show several prototype systems that use a stereo camera for capturing and a new rendering method for quadric curved screens. Previous approaches have required a calibration camera at the sweet spot. Due to parameterized representation, however, our unified calibration method is independent of the orientation and field of view of the calibration camera. This method can simplify the tedious and complicated installation process as well as the maintenance of large multiprojector displays in planetariums, virtual reality systems, and other visualization venues.",
"fno": "04811032",
"keywords": [
"Computer Graphics",
"Display Instrumentation",
"Image Sensors",
"Optical Projectors",
"Virtual Reality",
"Unified Calibration Method",
"Wide Field Of View Multiprojector Displays",
"Curved Screen Display System",
"Automatic Geometric Calibration",
"Polygonal Representation",
"Virtual Reality Systems",
"Calibration",
"Cameras",
"Computer Graphics",
"Predistortion",
"Computer Vision",
"Image Resolution",
"Prototypes",
"Stereo Vision",
"Computer Displays",
"Virtual Reality",
"I 3 2 Computer Graphics Graphics Systems Distributed Network Graphics",
"I 4 9 Image Processing And Computer Vision Calibration Imaging Geometry",
"I 3 3 Computer Systems Picture Image Generation Display Algorithms"
],
"authors": [
{
"affiliation": "Mitsubishi Precision Co., Ltd. e-mail: ogata@mpcnet.co.jp",
"fullName": "Masato Ogata",
"givenName": "Masato",
"surname": "Ogata",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Mitsubishi Precision Co., Ltd. e-mail: hwada@mpcnet.co.jp",
"fullName": "Hiroyuki Wada",
"givenName": "Hiroyuki",
"surname": "Wada",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Disney Research Zürich e-mail: jvanbaar@disney.com",
"fullName": "Jeroen van Baar",
"givenName": "Jeroen",
"surname": "van Baar",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "MIT Media Lab e-mail: raskar@media.mit.edu",
"fullName": "Ramesh Raskar",
"givenName": "Ramesh",
"surname": "Raskar",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-03-01T00:00:00",
"pubType": "proceedings",
"pages": "235-236",
"year": "2009",
"issn": "1087-8270",
"isbn": "978-1-4244-3943-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04811030",
"articleId": "12OmNvIxf0F",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04811033",
"articleId": "12OmNzZEAqd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/etcs/2009/3557/3/3557e273",
"title": "Camera Calibration via Stereo Vision Using Tsai's Method",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557e273/12OmNASraID",
"parentPublication": {
"id": "proceedings/etcs/2009/3557/3",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2007/2929/0/29290007",
"title": "Calibration Accuracy Evaluation with Stereo Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2007/29290007/12OmNAlNiK6",
"parentPublication": {
"id": "proceedings/icig/2007/2929/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2017/4822/0/07926707",
"title": "Automatic Calibration of a Multiple-Projector Spherical Fish Tank VR Display",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2017/07926707/12OmNAoDhTe",
"parentPublication": {
"id": "proceedings/wacv/2017/4822/0",
"title": "2017 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2009/3816/3/3816c128",
"title": "A Self-Calibration Method for Rotational Stereo Vision",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2009/3816c128/12OmNAsTgTw",
"parentPublication": {
"id": "proceedings/aici/2009/3816/3",
"title": "2009 International Conference on Artificial Intelligence and Computational Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2013/2869/0/06671779",
"title": "A camera-based calibration for automotive augmented reality Head-Up-Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2013/06671779/12OmNBrlPB1",
"parentPublication": {
"id": "proceedings/ismar/2013/2869/0",
"title": "2013 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/1995/7190/0/71900169",
"title": "Dynamic camera calibration",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/1995/71900169/12OmNwl8GCC",
"parentPublication": {
"id": "proceedings/iscv/1995/7190/0",
"title": "Computer Vision, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1999/0149/1/01491022",
"title": "Planar Catadioptric Stereo: Geometry and Calibration",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1999/01491022/12OmNzUxO9t",
"parentPublication": {
"id": "proceedings/cvpr/1999/0149/2",
"title": "Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/08/i1322",
"title": "A Variational Approach to Problems in Calibration of Multiple Cameras",
"doi": null,
"abstractUrl": "/journal/tp/2007/08/i1322/13rRUEgs2D4",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/02/v0177",
"title": "Color Nonuniformity in Projection-Based Displays: Analysis and Solutions",
"doi": null,
"abstractUrl": "/journal/tg/2004/02/v0177/13rRUwfI0PW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1990/07/i0663",
"title": "A Unified Approach to the Linear Camera Calibration Problem",
"doi": null,
"abstractUrl": "/journal/tp/1990/07/i0663/13rRUyfbwrH",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyNQSGO",
"title": "2007 IEEE Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwCJOUc",
"doi": "10.1109/CVPR.2007.383464",
"title": "Improved Legibility of Text for Multiprojector Tiled Displays",
"normalizedTitle": "Improved Legibility of Text for Multiprojector Tiled Displays",
"abstract": "Displaying small text on large multiprojector tiled displays is challenging. Problems arise because text is badly affected by the image-warping techniques that these displays apply to rectify projector misalignment. As a consequence, there has been little progress with important large-display applications that require small text, such as collaborative tutoring or web-browsing. In this paper we present a new warping technique designed to preserve crisp text, based on recent work by Hereld and Stevens. Our technique produces good results, free of artifacts, when used in today's multiprojector displays. We evaluate the legibility of our technique against conventional interpolation-based warping and find that users prefer our technique. We describe an efficient and reusable implementation, and show how the increased legibility has allowed us to investigate two new applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Displaying small text on large multiprojector tiled displays is challenging. Problems arise because text is badly affected by the image-warping techniques that these displays apply to rectify projector misalignment. As a consequence, there has been little progress with important large-display applications that require small text, such as collaborative tutoring or web-browsing. In this paper we present a new warping technique designed to preserve crisp text, based on recent work by Hereld and Stevens. Our technique produces good results, free of artifacts, when used in today's multiprojector displays. We evaluate the legibility of our technique against conventional interpolation-based warping and find that users prefer our technique. We describe an efficient and reusable implementation, and show how the increased legibility has allowed us to investigate two new applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Displaying small text on large multiprojector tiled displays is challenging. Problems arise because text is badly affected by the image-warping techniques that these displays apply to rectify projector misalignment. As a consequence, there has been little progress with important large-display applications that require small text, such as collaborative tutoring or web-browsing. In this paper we present a new warping technique designed to preserve crisp text, based on recent work by Hereld and Stevens. Our technique produces good results, free of artifacts, when used in today's multiprojector displays. We evaluate the legibility of our technique against conventional interpolation-based warping and find that users prefer our technique. We describe an efficient and reusable implementation, and show how the increased legibility has allowed us to investigate two new applications.",
"fno": "04270462",
"keywords": [],
"authors": [
{
"affiliation": "University of Cambridge Computer Laboratory, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK. Philip.Tud",
"fullName": "Philip Tuddenham",
"givenName": "Philip",
"surname": "Tuddenham",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Cambridge Computer Laboratory, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK. Peter.Robi",
"fullName": "Peter Robinson",
"givenName": "Peter",
"surname": "Robinson",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2007",
"issn": null,
"isbn": "1-4244-1179-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04270461",
"articleId": "12OmNxFsmJx",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04270463",
"articleId": "12OmNAJVcCL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2009/3943/0/04811032",
"title": "A Unified Calibration Method with a Parametric Approach for Wide-Field-of-View Multiprojector Displays",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2009/04811032/12OmNqIhG73",
"parentPublication": {
"id": "proceedings/vr/2009/3943/0",
"title": "2009 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2001/1263/0/12630997",
"title": "Prediction of Handwriting Legibility",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2001/12630997/12OmNqJZgM0",
"parentPublication": {
"id": "proceedings/icdar/2001/1263/0",
"title": "Proceedings of Sixth International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdar/2017/3586/1/3586a175",
"title": "Legibility and Aesthetic Analysis of Handwriting",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2017/3586a175/12OmNwx3Q55",
"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/tabletop/2007/3013/0/30130105",
"title": "Examination of Text-Entry Methods for Tabletop Displays",
"doi": null,
"abstractUrl": "/proceedings-article/tabletop/2007/30130105/12OmNx0RIT3",
"parentPublication": {
"id": "proceedings/tabletop/2007/3013/0",
"title": "Horizontal Interactive Human-Computer Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2005/2660/0/237230104",
"title": "Pixel-Aligned Warping for Multiprojector Tiled Displays",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2005/237230104/12OmNy3RRBG",
"parentPublication": {
"id": "proceedings/cvprw/2005/2660/0",
"title": "2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2013/4795/0/06549411",
"title": "Early steps towards understanding text legibility in handheld augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2013/06549411/12OmNy6HQV1",
"parentPublication": {
"id": "proceedings/vr/2013/4795/0",
"title": "2013 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acsat/2013/2758/0/2758a521",
"title": "Legibility of Web Page on Full High Definition Display",
"doi": null,
"abstractUrl": "/proceedings-article/acsat/2013/2758a521/12OmNywxlNx",
"parentPublication": {
"id": "proceedings/acsat/2013/2758/0",
"title": "2013 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/02/v0177",
"title": "Color Nonuniformity in Projection-Based Displays: Analysis and Solutions",
"doi": null,
"abstractUrl": "/journal/tg/2004/02/v0177/13rRUwfI0PW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/02/mcg2015020052",
"title": "Legibility in Industrial AR: Text Style, Color Coding, and Illuminance",
"doi": null,
"abstractUrl": "/magazine/cg/2015/02/mcg2015020052/13rRUxjQyxG",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090496",
"title": "The influence of text rotation, font and distance on legibility in VR",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090496/1jIxn3eRfnq",
"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"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAWpykB",
"title": "2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops",
"acronym": "cvprw",
"groupId": "1001809",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy3RRBG",
"doi": "10.1109/CVPR.2005.509",
"title": "Pixel-Aligned Warping for Multiprojector Tiled Displays",
"normalizedTitle": "Pixel-Aligned Warping for Multiprojector Tiled Displays",
"abstract": "Multiprojector tiled displays offer a scalable path to high-resolution display systems, often in a large format. Such displays have been employed in a range of applications from scientific visualization to collaborative virtual environments. Images projected onto these systems have always looked less sharp than expected owing to the image warping required to achieve geometrical alignment of the partial images to form the seamless whole. Similar degradation of image quality accompanies keystone correction techniques and image warping onto nonplanar surfaces used in single projector applications. In this paper we discuss the underlying cause of the degradation of apparent image resolution, and we introduce a new class of warping techniques, called pixel-aligned warping, that tend to preserve image sharpness at the expense of strict adherence to underlying geometrical constraints that define the desired warp. We demonstrate how such techniques can be used to significantly improve the apparent sharpness of the final image.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Multiprojector tiled displays offer a scalable path to high-resolution display systems, often in a large format. Such displays have been employed in a range of applications from scientific visualization to collaborative virtual environments. Images projected onto these systems have always looked less sharp than expected owing to the image warping required to achieve geometrical alignment of the partial images to form the seamless whole. Similar degradation of image quality accompanies keystone correction techniques and image warping onto nonplanar surfaces used in single projector applications. In this paper we discuss the underlying cause of the degradation of apparent image resolution, and we introduce a new class of warping techniques, called pixel-aligned warping, that tend to preserve image sharpness at the expense of strict adherence to underlying geometrical constraints that define the desired warp. We demonstrate how such techniques can be used to significantly improve the apparent sharpness of the final image.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Multiprojector tiled displays offer a scalable path to high-resolution display systems, often in a large format. Such displays have been employed in a range of applications from scientific visualization to collaborative virtual environments. Images projected onto these systems have always looked less sharp than expected owing to the image warping required to achieve geometrical alignment of the partial images to form the seamless whole. Similar degradation of image quality accompanies keystone correction techniques and image warping onto nonplanar surfaces used in single projector applications. In this paper we discuss the underlying cause of the degradation of apparent image resolution, and we introduce a new class of warping techniques, called pixel-aligned warping, that tend to preserve image sharpness at the expense of strict adherence to underlying geometrical constraints that define the desired warp. We demonstrate how such techniques can be used to significantly improve the apparent sharpness of the final image.",
"fno": "237230104",
"keywords": [],
"authors": [
{
"affiliation": "Mathematics and Computer Science Division, Argonne National Laboratory",
"fullName": "Mark Hereld",
"givenName": "Mark",
"surname": "Hereld",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Computation Institute, University of Chicago and Argonne National Laboratory",
"fullName": "Rick L. Stevens",
"givenName": "Rick L.",
"surname": "Stevens",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvprw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-06-01T00:00:00",
"pubType": "proceedings",
"pages": "104",
"year": "2005",
"issn": "1063-6919",
"isbn": "0-7695-2660-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "237230103",
"articleId": "12OmNyFCvVZ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01565424",
"articleId": "12OmNAYoKjQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2012/1226/0/007P1A07",
"title": "Scene warping: Layer-based stereoscopic image resizing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/007P1A07/12OmNAiFI8D",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2012/4711/0/4711a302",
"title": "Warping-Based Novel View Synthesis from a Binocular Image for Autostereoscopic Displays",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2012/4711a302/12OmNAoUTsE",
"parentPublication": {
"id": "proceedings/icme/2012/4711/0",
"title": "2012 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1994/6952/1/00413331",
"title": "An image warping approach to image sequence interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1994/00413331/12OmNBhHtcm",
"parentPublication": {
"id": "proceedings/icip/1994/6952/3",
"title": "Proceedings of 1st International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2011/348/0/06012182",
"title": "Automatic content creation for multiview autostereoscopic displays using image domain warping",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06012182/12OmNrAdsH9",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2007/1179/0/04270462",
"title": "Improved Legibility of Text for Multiprojector Tiled Displays",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2007/04270462/12OmNwCJOUc",
"parentPublication": {
"id": "proceedings/cvpr/2007/1179/0",
"title": "2007 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/07410844",
"title": "Dual-Feature Warping-Based Motion Model Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/07410844/12OmNyL0Tkn",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1992/2897/0/00235194",
"title": "Volume warping",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1992/00235194/12OmNyRPgAy",
"parentPublication": {
"id": "proceedings/visual/1992/2897/0",
"title": "Proceedings Visualization '92",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/3/73103244",
"title": "High-resolution image acquisition based on temporal integration with hierarchical estimation of image warping",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73103244/12OmNyRxFma",
"parentPublication": {
"id": "proceedings/icip/1995/7310/3",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2004/2159/5/215950076",
"title": "Direct Image Matching by Dynamic Warping",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2004/215950076/12OmNz3bdDA",
"parentPublication": {
"id": "proceedings/cvprw/2004/2159/5",
"title": "2004 Conference on Computer Vision and Pattern Recognition Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09928218",
"title": "Metameric Inpainting for Image Warping",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09928218/1HJuJYF342Y",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqyUUIX",
"title": "Shape Modeling and Applications, International Conference on",
"acronym": "smi",
"groupId": "1000664",
"volume": "0",
"displayVolume": "0",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBCZnSy",
"doi": "10.1109/SMI.2003.1199620",
"title": "Finger Sculpting with Digital Clay: 3D Shape Input and Output through a Computer-Controlled Real Surface",
"normalizedTitle": "Finger Sculpting with Digital Clay: 3D Shape Input and Output through a Computer-Controlled Real Surface",
"abstract": "The NSF Digital Clay project is focused on the design, prototyping, integration, and validation of a computer-controlled physical device capable of taking any of a wide range of possible shapes in response to changes in a digital 3D model or to changes in the pressure exercised upon it by human hands. Although it clearly is a natural and unavoidable evolution of 3D graphical user interfaces, its unprecedented capabilities constitute a major leap in technologies and paradigms for 3D display, for 3D input, and for collaborative 3D design. In this paper, we provide an overview of the Digital Clay project and discuss the challenges, design choices, and initial solutions for a new Finger Sculpting interface designed for the Digital Clay and prototyped using conventional 3D I/O hardware.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The NSF Digital Clay project is focused on the design, prototyping, integration, and validation of a computer-controlled physical device capable of taking any of a wide range of possible shapes in response to changes in a digital 3D model or to changes in the pressure exercised upon it by human hands. Although it clearly is a natural and unavoidable evolution of 3D graphical user interfaces, its unprecedented capabilities constitute a major leap in technologies and paradigms for 3D display, for 3D input, and for collaborative 3D design. In this paper, we provide an overview of the Digital Clay project and discuss the challenges, design choices, and initial solutions for a new Finger Sculpting interface designed for the Digital Clay and prototyped using conventional 3D I/O hardware.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The NSF Digital Clay project is focused on the design, prototyping, integration, and validation of a computer-controlled physical device capable of taking any of a wide range of possible shapes in response to changes in a digital 3D model or to changes in the pressure exercised upon it by human hands. Although it clearly is a natural and unavoidable evolution of 3D graphical user interfaces, its unprecedented capabilities constitute a major leap in technologies and paradigms for 3D display, for 3D input, and for collaborative 3D design. In this paper, we provide an overview of the Digital Clay project and discuss the challenges, design choices, and initial solutions for a new Finger Sculpting interface designed for the Digital Clay and prototyped using conventional 3D I/O hardware.",
"fno": "18450229",
"keywords": [],
"authors": [
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Jarek Rossignac",
"givenName": "Jarek",
"surname": "Rossignac",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Mark Allen",
"givenName": "Mark",
"surname": "Allen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Wayne J. Book",
"givenName": "Wayne J.",
"surname": "Book",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Ari Glezer",
"givenName": "Ari",
"surname": "Glezer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Imme Ebert-Uphoff",
"givenName": "Imme",
"surname": "Ebert-Uphoff",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Chris Shaw",
"givenName": "Chris",
"surname": "Shaw",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "David Rosen",
"givenName": "David",
"surname": "Rosen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Stephen Askins",
"givenName": "Stephen",
"surname": "Askins",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Jing Bai",
"givenName": "Jing",
"surname": "Bai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Paul Bosscher",
"givenName": "Paul",
"surname": "Bosscher",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Joshua Gargus",
"givenName": "Joshua",
"surname": "Gargus",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "ByungMoon Kim",
"givenName": "ByungMoon",
"surname": "Kim",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Ignacio Llamas",
"givenName": "Ignacio",
"surname": "Llamas",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Austina Nguyen",
"givenName": "Austina",
"surname": "Nguyen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Guang Yuan",
"givenName": "Guang",
"surname": "Yuan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Haihong Zhu",
"givenName": "Haihong",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "smi",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-05-01T00:00:00",
"pubType": "proceedings",
"pages": "229",
"year": "2003",
"issn": null,
"isbn": "0-7695-1909-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "18450216",
"articleId": "12OmNyuy9X6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "18450235",
"articleId": "12OmNvTBB0F",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2004/8603/2/01394335",
"title": "Feature refinement strategy for extended marching cubes: Handling on dynamic nature of real-time sculpting application",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2004/01394335/12OmNBE7Mtn",
"parentPublication": {
"id": "proceedings/icme/2004/8603/2",
"title": "2004 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2003/1845/0/18450296",
"title": "Finger Sculpting with Digital Clay: 3D Shape Input and Output through a Computer-Controlled Real Surface",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2003/18450296/12OmNBTJIJf",
"parentPublication": {
"id": "proceedings/smi/2003/1845/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223392",
"title": "Coupled-clay: Physical-virtual 3D collaborative interaction environment",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223392/12OmNC3FGl1",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2009/3804/2/3804b045",
"title": "Force Feedback Rendering with Material Removal Rate in Virtual Clay Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804b045/12OmNvAiSHP",
"parentPublication": {
"id": "proceedings/icicta/2009/3804/3",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2016/4571/0/4571a173",
"title": "Similarity Retrieval of 3D Models with Query by Clay Sketch",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2016/4571a173/12OmNvk7JML",
"parentPublication": {
"id": "proceedings/ism/2016/4571/0",
"title": "2016 IEEE International Symposium on Multimedia (ISM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2002/1656/0/16560664",
"title": "Virtual Sculpting and Deformable Volume Modelling",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2002/16560664/12OmNwoxSf0",
"parentPublication": {
"id": "proceedings/iv/2002/1656/0",
"title": "Proceedings Sixth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2008/2047/0/04476588",
"title": "Tech Note: Digital Foam",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2008/04476588/12OmNwuvrVb",
"parentPublication": {
"id": "proceedings/3dui/2008/2047/0",
"title": "2008 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tpcg/2004/2137/0/21370024",
"title": "An Investigation of Multiple Tools Actions for Virtual Sculpting Using Implicit Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/tpcg/2004/21370024/12OmNx9FhLj",
"parentPublication": {
"id": "proceedings/tpcg/2004/2137/0",
"title": "Theory and Practice of Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2008/2260/0/04548000",
"title": "Hands on virtual clay",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2008/04548000/12OmNxGja12",
"parentPublication": {
"id": "proceedings/smi/2008/2260/0",
"title": "IEEE International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0217",
"title": "Warp Sculpting",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0217/13rRUwjoNwN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrAdstn",
"title": "Computer Graphics and Applications, Pacific Conference on",
"acronym": "pg",
"groupId": "1000130",
"volume": "0",
"displayVolume": "0",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBJNKYa",
"doi": "10.1109/PCCGA.2003.1238254",
"title": "Dynamic Sculpting and Deformation of Point Set Surfaces",
"normalizedTitle": "Dynamic Sculpting and Deformation of Point Set Surfaces",
"abstract": "This paper presents a novel paradigm for point set surface editing, which takes advantages of the potential of implicit surfaces, the strength of physics based modeling techniques, and the simplicity of point sampled surfaces. Our point set surface is evaluated as the zero set of the weighted sum of the collection of the scalar trivariate B-spline functions defined over the local domain of each point sample. The implicit representation of the point set surfaces allows users to easily modify the topology of the sculpted objects. The deformation of the surfaces is conducted by dynamically modifying the local reference domains, as well as their scalar control coefficients. We have developed a variety of sculpting toolkits that can dynamically manipulate the implicit point set surface and easily perform CSG boolean operation on arbitrarily shaped objects. Our research work complements existing point rendering and modeling pipelines for efficient interactive sculpting and deformation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a novel paradigm for point set surface editing, which takes advantages of the potential of implicit surfaces, the strength of physics based modeling techniques, and the simplicity of point sampled surfaces. Our point set surface is evaluated as the zero set of the weighted sum of the collection of the scalar trivariate B-spline functions defined over the local domain of each point sample. The implicit representation of the point set surfaces allows users to easily modify the topology of the sculpted objects. The deformation of the surfaces is conducted by dynamically modifying the local reference domains, as well as their scalar control coefficients. We have developed a variety of sculpting toolkits that can dynamically manipulate the implicit point set surface and easily perform CSG boolean operation on arbitrarily shaped objects. Our research work complements existing point rendering and modeling pipelines for efficient interactive sculpting and deformation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a novel paradigm for point set surface editing, which takes advantages of the potential of implicit surfaces, the strength of physics based modeling techniques, and the simplicity of point sampled surfaces. Our point set surface is evaluated as the zero set of the weighted sum of the collection of the scalar trivariate B-spline functions defined over the local domain of each point sample. The implicit representation of the point set surfaces allows users to easily modify the topology of the sculpted objects. The deformation of the surfaces is conducted by dynamically modifying the local reference domains, as well as their scalar control coefficients. We have developed a variety of sculpting toolkits that can dynamically manipulate the implicit point set surface and easily perform CSG boolean operation on arbitrarily shaped objects. Our research work complements existing point rendering and modeling pipelines for efficient interactive sculpting and deformation.",
"fno": "20280123",
"keywords": [],
"authors": [
{
"affiliation": "State University of New York at Stony Brook",
"fullName": "Xiaohu Guo",
"givenName": "Xiaohu",
"surname": "Guo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "State University of New York at Stony Brook",
"fullName": "Hong Qin",
"givenName": "Hong",
"surname": "Qin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pg",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-10-01T00:00:00",
"pubType": "proceedings",
"pages": "123",
"year": "2003",
"issn": null,
"isbn": "0-7695-2028-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "20280115",
"articleId": "12OmNyr8YvV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "20280131",
"articleId": "12OmNrH1PFr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/smi/2003/1845/0/18450272",
"title": "Ray Tracing Point Set Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2003/18450272/12OmNqGRG73",
"parentPublication": {
"id": "proceedings/smi/2003/1845/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2009/3843/1/3843a645",
"title": "Multi-level Partition of Unity Algebraic Point Set Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2009/3843a645/12OmNrAv3QE",
"parentPublication": {
"id": "proceedings/mines/2009/3843/1",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/tpcg/2004/2137/0/21370024",
"title": "An Investigation of Multiple Tools Actions for Virtual Sculpting Using Implicit Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/tpcg/2004/21370024/12OmNx9FhLj",
"parentPublication": {
"id": "proceedings/tpcg/2004/2137/0",
"title": "Theory and Practice of Computer Graphics",
"__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/whc/2007/2738/0/27380513",
"title": "Haptic Rendering of Point Set Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/whc/2007/27380513/12OmNyyO8HC",
"parentPublication": {
"id": "proceedings/whc/2007/2738/0",
"title": "2007 2nd Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environments and Teleoperator Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2001/1227/0/12270254",
"title": "Haptic Sculpting of Volumetric Implicit Functions",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2001/12270254/12OmNzV70HP",
"parentPublication": {
"id": "proceedings/pg/2001/1227/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2002/1546/0/15460175",
"title": "Volume Sculpting Using the Level-Set Method",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2002/15460175/12OmNzcPA7T",
"parentPublication": {
"id": "proceedings/smi/2002/1546/0",
"title": "Proceedings SMI. Shape Modeling International 2002",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/02/ttg2012020188",
"title": "Visualizing Nonmanifold and Singular Implicit Surfaces with Point Clouds",
"doi": null,
"abstractUrl": "/journal/tg/2012/02/ttg2012020188/13rRUwd9CLK",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2004/04/mcg2004040043",
"title": "Scalar-Function-Driven Editing on Point Set Surfaces",
"doi": null,
"abstractUrl": "/magazine/cg/2004/04/mcg2004040043/13rRUwhpBGu",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2004/06/mcg2004060031",
"title": "Touch-Based Haptics for Interactive Editing on Point Set Surfaces",
"doi": null,
"abstractUrl": "/magazine/cg/2004/06/mcg2004060031/13rRUygT7hw",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrIJqwn",
"title": "Virtual Reality Conference, IEEE",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx8wTkx",
"doi": "10.1109/VR.2001.913789",
"title": "Collaborative Distributed Virtual Sculpting",
"normalizedTitle": "Collaborative Distributed Virtual Sculpting",
"abstract": "A lot of effort is now being put into developing collaborative distributed virtual environments. However, very few projects address collaborative virtual sculpting in which the shapes of the target objects are likely changing continuously.Some major issues including user interaction, data transmission, concurrent object editin by multiple clients and rendering of deforming objects must be addressed in a real-time context. In this paper, we propose a framework for collaborative virtual sculpting in a distributed virtual environment. The system is based on a hybrid model which merges the client-server and the peer-to-peer architectures to allow fast data replication. To support real-time deformation and rendering of deformable objects, we model each of these objects using NURBS surfaces and render them using the real-time deformable NURBS rendering method that we have developed. We will present a data structure for the transmission of these deformable objects. We will also introduce the idea of editing region and the corresponding locking mechanism for simultaneous editing of the same object by multiple clients. Toward the end of the paper, we will show some performance results of the prototype system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A lot of effort is now being put into developing collaborative distributed virtual environments. However, very few projects address collaborative virtual sculpting in which the shapes of the target objects are likely changing continuously.Some major issues including user interaction, data transmission, concurrent object editin by multiple clients and rendering of deforming objects must be addressed in a real-time context. In this paper, we propose a framework for collaborative virtual sculpting in a distributed virtual environment. The system is based on a hybrid model which merges the client-server and the peer-to-peer architectures to allow fast data replication. To support real-time deformation and rendering of deformable objects, we model each of these objects using NURBS surfaces and render them using the real-time deformable NURBS rendering method that we have developed. We will present a data structure for the transmission of these deformable objects. We will also introduce the idea of editing region and the corresponding locking mechanism for simultaneous editing of the same object by multiple clients. Toward the end of the paper, we will show some performance results of the prototype system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A lot of effort is now being put into developing collaborative distributed virtual environments. However, very few projects address collaborative virtual sculpting in which the shapes of the target objects are likely changing continuously.Some major issues including user interaction, data transmission, concurrent object editin by multiple clients and rendering of deforming objects must be addressed in a real-time context. In this paper, we propose a framework for collaborative virtual sculpting in a distributed virtual environment. The system is based on a hybrid model which merges the client-server and the peer-to-peer architectures to allow fast data replication. To support real-time deformation and rendering of deformable objects, we model each of these objects using NURBS surfaces and render them using the real-time deformable NURBS rendering method that we have developed. We will present a data structure for the transmission of these deformable objects. We will also introduce the idea of editing region and the corresponding locking mechanism for simultaneous editing of the same object by multiple clients. Toward the end of the paper, we will show some performance results of the prototype system.",
"fno": "09480217",
"keywords": [],
"authors": [
{
"affiliation": "City University of Hong Kong",
"fullName": "Frederick W.B. Li",
"givenName": "Frederick W.B.",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "City University of Hong Kong",
"fullName": "Rynson W.H. Lau",
"givenName": "Rynson W.H.",
"surname": "Lau",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "City University of Hong Kong",
"fullName": "Frederick F.C. Ng",
"givenName": "Frederick F.C.",
"surname": "Ng",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-03-01T00:00:00",
"pubType": "proceedings",
"pages": "217",
"year": "2001",
"issn": "1087-8270",
"isbn": "0-7695-0948-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09480209",
"articleId": "12OmNCcbEaq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09480225",
"articleId": "12OmNCctfnc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNywfKyH",
"title": "Geometric Modeling and Imaging - New Trends",
"acronym": "gmai",
"groupId": "1001947",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzYeASB",
"doi": "10.1109/GMAI.2006.36",
"title": "Modeling Deformable Objects for Computer-Aided Sculpting (CAS)Modeling Deformable Objects for Computer-Aided Sculpting (CAS)",
"normalizedTitle": "Modeling Deformable Objects for Computer-Aided Sculpting (CAS)Modeling Deformable Objects for Computer-Aided Sculpting (CAS)",
"abstract": "Software tools for modeling complex freeform objects require the designer to use sophisticated procedures and complex protocols that do not inherently support the creative design process. Typical tasks include tedious control point manipulation and manual surface patch stitching operations. An interactive computer-aided sculpting (CAS) framework based upon deformable geometric models is described in this paper. The technique exploits the topology and learning algorithm of a self-organizing feature map (SOFM) to generate an adaptive volumetric mesh comprised of hexahedral elements. The pre-ordered lattice of the SOFM maintains the relative connectivity of neighbouring nodes in the mesh as it transforms under external and internal forces. Prior to virtual sculpting, the shape primitive is either retrieved from the object database or created by fitting a deformable mesh to representative surface points. Material and dynamic properties are incorporated into the deformable solid model by treating the surface and interior nodes as point masses connected with a network of springs. Illustrations are provided to demonstrate the virtual sculpting framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Software tools for modeling complex freeform objects require the designer to use sophisticated procedures and complex protocols that do not inherently support the creative design process. Typical tasks include tedious control point manipulation and manual surface patch stitching operations. An interactive computer-aided sculpting (CAS) framework based upon deformable geometric models is described in this paper. The technique exploits the topology and learning algorithm of a self-organizing feature map (SOFM) to generate an adaptive volumetric mesh comprised of hexahedral elements. The pre-ordered lattice of the SOFM maintains the relative connectivity of neighbouring nodes in the mesh as it transforms under external and internal forces. Prior to virtual sculpting, the shape primitive is either retrieved from the object database or created by fitting a deformable mesh to representative surface points. Material and dynamic properties are incorporated into the deformable solid model by treating the surface and interior nodes as point masses connected with a network of springs. Illustrations are provided to demonstrate the virtual sculpting framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Software tools for modeling complex freeform objects require the designer to use sophisticated procedures and complex protocols that do not inherently support the creative design process. Typical tasks include tedious control point manipulation and manual surface patch stitching operations. An interactive computer-aided sculpting (CAS) framework based upon deformable geometric models is described in this paper. The technique exploits the topology and learning algorithm of a self-organizing feature map (SOFM) to generate an adaptive volumetric mesh comprised of hexahedral elements. The pre-ordered lattice of the SOFM maintains the relative connectivity of neighbouring nodes in the mesh as it transforms under external and internal forces. Prior to virtual sculpting, the shape primitive is either retrieved from the object database or created by fitting a deformable mesh to representative surface points. Material and dynamic properties are incorporated into the deformable solid model by treating the surface and interior nodes as point masses connected with a network of springs. Illustrations are provided to demonstrate the virtual sculpting framework.",
"fno": "26040003",
"keywords": [],
"authors": [
{
"affiliation": "The University of Western Ontario, Canada",
"fullName": "Philip C. Igwe",
"givenName": "Philip C.",
"surname": "Igwe",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Western Ontario, Canada",
"fullName": "George K. Knopf",
"givenName": "George K.",
"surname": "Knopf",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "gmai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-07-01T00:00:00",
"pubType": "proceedings",
"pages": "3-8",
"year": "2006",
"issn": null,
"isbn": "0-7695-2604-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01648735",
"articleId": "12OmNxGALcD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "26040009",
"articleId": "12OmNANTAye",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2004/2128/2/212820249",
"title": "Surface Sculpting with Stochastic Deformable 3D Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212820249/12OmNAmE61i",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2003/2028/0/20280123",
"title": "Dynamic Sculpting and Deformation of Point Set Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2003/20280123/12OmNBJNKYa",
"parentPublication": {
"id": "proceedings/pg/2003/2028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2013/2246/0/2246a338",
"title": "Stable Simulations of Deformable Objects Using Explicit Integration",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2013/2246a338/12OmNvAiSG8",
"parentPublication": {
"id": "proceedings/cw/2013/2246/0",
"title": "2013 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2015/1986/0/1986a184",
"title": "A Perceptual Depth Shape-based CRF Model for Deformable Surface Labeling",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2015/1986a184/12OmNvT2pa5",
"parentPublication": {
"id": "proceedings/crv/2015/1986/0",
"title": "2015 12th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2002/1656/0/16560664",
"title": "Virtual Sculpting and Deformable Volume Modelling",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2002/16560664/12OmNwoxSf0",
"parentPublication": {
"id": "proceedings/iv/2002/1656/0",
"title": "Proceedings Sixth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2001/0948/0/09480217",
"title": "Collaborative Distributed Virtual Sculpting",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2001/09480217/12OmNx8wTkx",
"parentPublication": {
"id": "proceedings/vr/2001/0948/0",
"title": "Virtual Reality Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2006/2686/0/26860213",
"title": "Adapted Dynamic Meshes for Deformable Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2006/26860213/12OmNzBOi0T",
"parentPublication": {
"id": "proceedings/sibgrapi/2006/2686/0",
"title": "2006 19th Brazilian Symposium on Computer Graphics and Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459161",
"title": "Modeling deformable objects from a single depth camera",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459161/12OmNzTH11c",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwcse/2009/3881/2/3881b126",
"title": "Deformable Surface 3D Tracking Using Linear Programming",
"doi": null,
"abstractUrl": "/proceedings-article/iwcse/2009/3881b126/12OmNzV70yW",
"parentPublication": {
"id": "proceedings/iwcse/2009/3881/2",
"title": "Computer Science and Engineering, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0217",
"title": "Warp Sculpting",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0217/13rRUwjoNwN",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwpGgL7",
"title": "Proceedings SMI. Shape Modeling International 2002",
"acronym": "smi",
"groupId": "1000664",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzcPA7T",
"doi": "10.1109/SMI.2002.10013",
"title": "Volume Sculpting Using the Level-Set Method",
"normalizedTitle": "Volume Sculpting Using the Level-Set Method",
"abstract": "In this paper, we propose the use of the Level-Set Method as the underlying technology of a volume sculpting system. The main motivation is that this leads to a very generic technique for deformation of volumetric solids. In addition, our method preserves a distance field volume representation. A scaling window is used to adapt the Level- Set Method to local deformations and to allow the user to control the intensity of the tool. Level-Set based tools have been implemented in an interactive sculpting system, and we show sculptures created using the system.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose the use of the Level-Set Method as the underlying technology of a volume sculpting system. The main motivation is that this leads to a very generic technique for deformation of volumetric solids. In addition, our method preserves a distance field volume representation. A scaling window is used to adapt the Level- Set Method to local deformations and to allow the user to control the intensity of the tool. Level-Set based tools have been implemented in an interactive sculpting system, and we show sculptures created using the system.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose the use of the Level-Set Method as the underlying technology of a volume sculpting system. The main motivation is that this leads to a very generic technique for deformation of volumetric solids. In addition, our method preserves a distance field volume representation. A scaling window is used to adapt the Level- Set Method to local deformations and to allow the user to control the intensity of the tool. Level-Set based tools have been implemented in an interactive sculpting system, and we show sculptures created using the system.",
"fno": "15460175",
"keywords": [],
"authors": [
{
"affiliation": null,
"fullName": "J. Andreas Bærentzen",
"givenName": "J. Andreas",
"surname": "Bærentzen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Niels Jorgen Christensen",
"givenName": "Niels Jorgen",
"surname": "Christensen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "smi",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-05-01T00:00:00",
"pubType": "proceedings",
"pages": "175",
"year": "2002",
"issn": null,
"isbn": "0-7695-1546-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "15460165",
"articleId": "12OmNCesrcO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "15460183",
"articleId": "12OmNBpEeKv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzlUKpz",
"title": "2006 IEEE International Conference on Multimedia and Expo",
"acronym": "icme",
"groupId": "1000477",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBa2iA8",
"doi": "10.1109/ICME.2006.262603",
"title": "Applications of Autostereoscopic Displays in Ophthalmologic Studies",
"normalizedTitle": "Applications of Autostereoscopic Displays in Ophthalmologic Studies",
"abstract": "Autostereoscopic displays are an emerging technology which provide 3D viewing experiences without the need of glasses or other encumbering viewing aids. In this paper we explore their potential in ophthalmologic studies. While the vast majority of applications of autostereoscopic displays in other fields is merely based on producing 3D viewing effects, we can distinguish between several classes of ophthalmologic tasks in which autostereoscopic displays play a very different role. Three concrete applications are described. With the steady improvements in autostereoscopic displays we expect to develop qualitatively new ophthalmologic tests in future.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Autostereoscopic displays are an emerging technology which provide 3D viewing experiences without the need of glasses or other encumbering viewing aids. In this paper we explore their potential in ophthalmologic studies. While the vast majority of applications of autostereoscopic displays in other fields is merely based on producing 3D viewing effects, we can distinguish between several classes of ophthalmologic tasks in which autostereoscopic displays play a very different role. Three concrete applications are described. With the steady improvements in autostereoscopic displays we expect to develop qualitatively new ophthalmologic tests in future.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Autostereoscopic displays are an emerging technology which provide 3D viewing experiences without the need of glasses or other encumbering viewing aids. In this paper we explore their potential in ophthalmologic studies. While the vast majority of applications of autostereoscopic displays in other fields is merely based on producing 3D viewing effects, we can distinguish between several classes of ophthalmologic tasks in which autostereoscopic displays play a very different role. Three concrete applications are described. With the steady improvements in autostereoscopic displays we expect to develop qualitatively new ophthalmologic tests in future.",
"fno": "04037019",
"keywords": [],
"authors": [
{
"affiliation": "Department of Mathematics and Computer Science, University of M?nster, Germany. Email: xjiang@math.uni-muenster.de",
"fullName": "Xiaoyi Jiang",
"givenName": "Xiaoyi",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Kantonsspital St. Gallen, Department of Neuro-Ophthalmology, Switzerland. Email: daniel.mojon@kssg.ch",
"fullName": "Daniel Mojon",
"givenName": "Daniel",
"surname": "Mojon",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icme",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-07-01T00:00:00",
"pubType": "proceedings",
"pages": "1993-1996",
"year": "2006",
"issn": null,
"isbn": "1-4244-0366-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04037018",
"articleId": "12OmNzUPpB9",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04037035",
"articleId": "12OmNyL0Tw4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/apcip/2009/3699/2/3699b031",
"title": "3D Multi-view Autostereoscopic Display and Its Key Technologie",
"doi": null,
"abstractUrl": "/proceedings-article/apcip/2009/3699b031/12OmNvAS4pe",
"parentPublication": {
"id": "proceedings/apcip/2009/3699/1",
"title": "Information Processing, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2006/0224/0/01667679",
"title": "Long Visualization Depth Autostereoscopic Display using Light Field Rendering based Integral Videography",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2006/01667679/12OmNvDZEZe",
"parentPublication": {
"id": "proceedings/vr/2006/0224/0",
"title": "IEEE Virtual Reality Conference (VR 2006)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2006/2602/0/26020778",
"title": "A Projection-Based Multi-view Time-multiplexed Autostereoscopic 3D Display System",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2006/26020778/12OmNwDSdGX",
"parentPublication": {
"id": "proceedings/iv/2006/2602/0",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2010/7491/0/05583204",
"title": "MUTED and HELIUM3D autostereoscopic displays",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2010/05583204/12OmNwDSdhI",
"parentPublication": {
"id": "proceedings/icme/2010/7491/0",
"title": "2010 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2007/0907/0/04142851",
"title": "Character Interaction System with Autostereoscopic Display and Range Sensor",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2007/04142851/12OmNwc3wsr",
"parentPublication": {
"id": "proceedings/3dui/2007/0907/0",
"title": "2007 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2006/0366/0/04036944",
"title": "A Roadmap for Autostereoscopic Multi-Viewer Domestic TV Displays",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2006/04036944/12OmNynsbBJ",
"parentPublication": {
"id": "proceedings/icme/2006/0366/0",
"title": "2006 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2015/7082/0/07177519",
"title": "Active crosstalk reduction system for multiview autostereoscopic displays",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2015/07177519/12OmNzgeLCa",
"parentPublication": {
"id": "proceedings/icme/2015/7082/0",
"title": "2015 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2005/08/r8031",
"title": "Autostereoscopic 3D Displays",
"doi": null,
"abstractUrl": "/magazine/co/2005/08/r8031/13rRUB7a16j",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0228",
"title": "Correcting Interperspective Aliasing in Autostereoscopic Displays",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0228/13rRUwgyOj8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/11/ttg2011111690",
"title": "Autostereoscopic 3D Display with Long Visualization Depth Using Referential Viewing Area-Based Integral Photography",
"doi": null,
"abstractUrl": "/journal/tg/2011/11/ttg2011111690/13rRUyfKIHG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx7ouU1",
"title": "2010 International Conference on Cyberworlds",
"acronym": "cw",
"groupId": "1000175",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBv2CkF",
"doi": "10.1109/CW.2010.27",
"title": "A System for Capturing, Rendering and Multiplexing Images on Multi-view Autostereoscopic Display",
"normalizedTitle": "A System for Capturing, Rendering and Multiplexing Images on Multi-view Autostereoscopic Display",
"abstract": "Current trends in digital display technology show a marked interest towards 3D displays, which allow three dimensional images to be conveyed to viewers. Among various 3D display techniques, auto stereoscopic display appears to be promising due to the use of optical trickery at the display, allowing glass-free viewing. However, the cost of generating and transmitting the auto stereoscopic images is usually quite high due to the huge amount of data. Hence, it is challenging to acquire artifact-free 3D images in real-time. This paper presents a system to generate and display high-resolution auto stereoscopic images at full HD resolution, i.e., 1920*1080*24. We show that the video-plus-depth data representation enables a scalable system architecture and efficient data transition. The proposed GPU accelerated depth image-based rendering (DIBR) algorithm and multiplexing algorithm are able to synthesize auto stereoscopic images in real-time. The synthesized images are then displayed on the auto stereoscopic screen that is mounted on a conventional LCD monitor. We demonstrate our system to both indoor activities and natural scenes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Current trends in digital display technology show a marked interest towards 3D displays, which allow three dimensional images to be conveyed to viewers. Among various 3D display techniques, auto stereoscopic display appears to be promising due to the use of optical trickery at the display, allowing glass-free viewing. However, the cost of generating and transmitting the auto stereoscopic images is usually quite high due to the huge amount of data. Hence, it is challenging to acquire artifact-free 3D images in real-time. This paper presents a system to generate and display high-resolution auto stereoscopic images at full HD resolution, i.e., 1920*1080*24. We show that the video-plus-depth data representation enables a scalable system architecture and efficient data transition. The proposed GPU accelerated depth image-based rendering (DIBR) algorithm and multiplexing algorithm are able to synthesize auto stereoscopic images in real-time. The synthesized images are then displayed on the auto stereoscopic screen that is mounted on a conventional LCD monitor. We demonstrate our system to both indoor activities and natural scenes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Current trends in digital display technology show a marked interest towards 3D displays, which allow three dimensional images to be conveyed to viewers. Among various 3D display techniques, auto stereoscopic display appears to be promising due to the use of optical trickery at the display, allowing glass-free viewing. However, the cost of generating and transmitting the auto stereoscopic images is usually quite high due to the huge amount of data. Hence, it is challenging to acquire artifact-free 3D images in real-time. This paper presents a system to generate and display high-resolution auto stereoscopic images at full HD resolution, i.e., 1920*1080*24. We show that the video-plus-depth data representation enables a scalable system architecture and efficient data transition. The proposed GPU accelerated depth image-based rendering (DIBR) algorithm and multiplexing algorithm are able to synthesize auto stereoscopic images in real-time. The synthesized images are then displayed on the auto stereoscopic screen that is mounted on a conventional LCD monitor. We demonstrate our system to both indoor activities and natural scenes.",
"fno": "4215a325",
"keywords": [
"Autostereoscopic Display",
"Multi View Synthesis",
"GPU",
"3 D Shape Acquisition"
],
"authors": [
{
"affiliation": null,
"fullName": "Hock Soon Tan",
"givenName": "Hock Soon",
"surname": "Tan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jiazhi Xia",
"givenName": "Jiazhi",
"surname": "Xia",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ying He",
"givenName": "Ying",
"surname": "He",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "YQ Guan",
"givenName": "YQ",
"surname": "Guan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-10-01T00:00:00",
"pubType": "proceedings",
"pages": "325-330",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4215-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4215a319",
"articleId": "12OmNzd7bNI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4215a331",
"articleId": "12OmNxYbSXU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2012/4711/0/4711a302",
"title": "Warping-Based Novel View Synthesis from a Binocular Image for Autostereoscopic Displays",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2012/4711a302/12OmNAoUTsE",
"parentPublication": {
"id": "proceedings/icme/2012/4711/0",
"title": "2012 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2010/4030/2/4030b444",
"title": "Virtual View Synthesis for Multi-view 3D Display",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2010/4030b444/12OmNBkfRmx",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apcip/2009/3699/2/3699b031",
"title": "3D Multi-view Autostereoscopic Display and Its Key Technologie",
"doi": null,
"abstractUrl": "/proceedings-article/apcip/2009/3699b031/12OmNvAS4pe",
"parentPublication": {
"id": "proceedings/apcip/2009/3699/1",
"title": "Information Processing, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2006/2602/0/26020778",
"title": "A Projection-Based Multi-view Time-multiplexed Autostereoscopic 3D Display System",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2006/26020778/12OmNwDSdGX",
"parentPublication": {
"id": "proceedings/iv/2006/2602/0",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2007/0907/0/04142851",
"title": "Character Interaction System with Autostereoscopic Display and Range Sensor",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2007/04142851/12OmNwc3wsr",
"parentPublication": {
"id": "proceedings/3dui/2007/0907/0",
"title": "2007 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2006/2606/0/26060128",
"title": "3D Images Compression for Multi-View Auto-Stereoscopic Displays",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2006/26060128/12OmNxzMnL1",
"parentPublication": {
"id": "proceedings/cgiv/2006/2606/0",
"title": "International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2005/08/r8031",
"title": "Autostereoscopic 3D Displays",
"doi": null,
"abstractUrl": "/magazine/co/2005/08/r8031/13rRUB7a16j",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2008/01/ttg2008010084",
"title": "Toward the Light Field Display: Autostereoscopic Rendering via a Cluster of Projectors",
"doi": null,
"abstractUrl": "/journal/tg/2008/01/ttg2008010084/13rRUwI5TXu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0228",
"title": "Correcting Interperspective Aliasing in Autostereoscopic Displays",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0228/13rRUwgyOj8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/11/ttg2011111690",
"title": "Autostereoscopic 3D Display with Long Visualization Depth Using Referential Viewing Area-Based Integral Photography",
"doi": null,
"abstractUrl": "/journal/tg/2011/11/ttg2011111690/13rRUyfKIHG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzEVRUb",
"title": "2009 International Joint Conference on Artificial Intelligence (JCAI)",
"acronym": "jcai",
"groupId": "1002794",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCeaPTj",
"doi": "10.1109/JCAI.2009.134",
"title": "Research and Design of Multi-channel Programmable Anti-aliasing Filter Circuit",
"normalizedTitle": "Research and Design of Multi-channel Programmable Anti-aliasing Filter Circuit",
"abstract": "In electric power quality monitor system, spectrum aliasing during analog signal sampling, and interference effect from external various noise signal will lead to decrease of monitor accuracy and precision. This paper design a multi-channel four-step active Butterworth low-passing filter, which can realize multi-channel cutoff frequency adjustable anti-aliasing design by data collection card sending controlling signal, and effectively improve monitor precision. This circuit has good application in electric power quality monitor and can complete 200Hz~15kHz cut-off frequency programmable adjusting, which can realize more electric power parameter monitor field. This paper introduces design method and module circuit diagram in detail. The circuit has advantages of modularization design, strong transplantation, and has widely use value and application prospect.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In electric power quality monitor system, spectrum aliasing during analog signal sampling, and interference effect from external various noise signal will lead to decrease of monitor accuracy and precision. This paper design a multi-channel four-step active Butterworth low-passing filter, which can realize multi-channel cutoff frequency adjustable anti-aliasing design by data collection card sending controlling signal, and effectively improve monitor precision. This circuit has good application in electric power quality monitor and can complete 200Hz~15kHz cut-off frequency programmable adjusting, which can realize more electric power parameter monitor field. This paper introduces design method and module circuit diagram in detail. The circuit has advantages of modularization design, strong transplantation, and has widely use value and application prospect.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In electric power quality monitor system, spectrum aliasing during analog signal sampling, and interference effect from external various noise signal will lead to decrease of monitor accuracy and precision. This paper design a multi-channel four-step active Butterworth low-passing filter, which can realize multi-channel cutoff frequency adjustable anti-aliasing design by data collection card sending controlling signal, and effectively improve monitor precision. This circuit has good application in electric power quality monitor and can complete 200Hz~15kHz cut-off frequency programmable adjusting, which can realize more electric power parameter monitor field. This paper introduces design method and module circuit diagram in detail. The circuit has advantages of modularization design, strong transplantation, and has widely use value and application prospect.",
"fno": "3615a845",
"keywords": [
"Power Quality",
"Multiplexing Technology",
"Spectrum Aliasing",
"Low Passing Filter",
"Anti Aliasing Filter Circuit",
"Visual Instrument"
],
"authors": [
{
"affiliation": null,
"fullName": "Yu Chen",
"givenName": "Yu",
"surname": "Chen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "jcai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-04-01T00:00:00",
"pubType": "proceedings",
"pages": "845-848",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3615-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3615a841",
"articleId": "12OmNxwWoKf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3615a849",
"articleId": "12OmNBp52CZ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icime/2009/3595/0/3595a406",
"title": "Design and Implementation of Active Filter for Data Acquisition System",
"doi": null,
"abstractUrl": "/proceedings-article/icime/2009/3595a406/12OmNBKEyzF",
"parentPublication": {
"id": "proceedings/icime/2009/3595/0",
"title": "Information Management and Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620197",
"title": "An anti-aliasing technique for splatting",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620197/12OmNBUS74c",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi-t/2012/4830/0/4830a050",
"title": "Transparency and Anti-Aliasing Techniques for Real-Time Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi-t/2012/4830a050/12OmNCbCrMH",
"parentPublication": {
"id": "proceedings/sibgrapi-t/2012/4830/0",
"title": "2012 25th SIBGRAPI Conference on Graphics, Patterns and Images Tutorials",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vts/1995/7000/0/70000118",
"title": "Signature analysis and aliasing for sequential circuits",
"doi": null,
"abstractUrl": "/proceedings-article/vts/1995/70000118/12OmNrMHOkA",
"parentPublication": {
"id": "proceedings/vts/1995/7000/0",
"title": "Proceedings 13th IEEE VLSI Test Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ihmsc/2010/4151/1/4151a147",
"title": "Anti-aliasing Filter Circuit Design for Active Power Filter",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2010/4151a147/12OmNrkBwyh",
"parentPublication": {
"id": "proceedings/ihmsc/2010/4151/1",
"title": "Intelligent Human-Machine Systems and Cybernetics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icece/2010/4031/0/4031a066",
"title": "A High Accuracy Displacement Detection Method for Magnetic Bearing",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031a066/12OmNyS6RNQ",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0228",
"title": "Correcting Interperspective Aliasing in Autostereoscopic Displays",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0228/13rRUwgyOj8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2005/12/t1614",
"title": "Aliasing Probability Calculations for Arbitrary Compaction under Independently Selected Random Test Vectors",
"doi": null,
"abstractUrl": "/journal/tc/2005/12/t1614/13rRUxASuS0",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1995/11/t1283",
"title": "Zero-Aliasing for Modeled Faults",
"doi": null,
"abstractUrl": "/journal/tc/1995/11/t1283/13rRUyeCk9h",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1998/11/t1171",
"title": "Optimal Zero-Aliasing Space Compaction of Test Responses",
"doi": null,
"abstractUrl": "/journal/tc/1998/11/t1171/13rRUyft7C9",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyFCvPp",
"title": "Tenth International Conference on Information Visualisation (IV'06)",
"acronym": "iv",
"groupId": "1000370",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwDSdGX",
"doi": "10.1109/IV.2006.11",
"title": "A Projection-Based Multi-view Time-multiplexed Autostereoscopic 3D Display System",
"normalizedTitle": "A Projection-Based Multi-view Time-multiplexed Autostereoscopic 3D Display System",
"abstract": "This paper presents our implementation of a multiview autostereoscopic 3D display system by using timemultiplexing approach, Digital Micro-mirror Devices (DMD), and the optical Wedge?. The whole system consists of three major parts: high frame rate DMD projector, an active shutter, and an optical Wedge?. This research investigates and develops the approaches to interface and control DMDs at very high bit rates and ultra-high frame rates to drive a novel flicker-free 3D flat panel device, with a wide viewing area and without need of special viewing glasses or head-tracking system. It needs to design a digital interface circuit capable of receiving video image data in a conventional format and translating it into a form appropriate for display on a DMD light modulator. This approach differs from existing ones in that it facilitates the modulation of the DMD to achieve much high frame rates, though with a trade-off in greyscale resolution. The outcomes of this research will have the great potential for commercialising the autostereoscopic display systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents our implementation of a multiview autostereoscopic 3D display system by using timemultiplexing approach, Digital Micro-mirror Devices (DMD), and the optical Wedge?. The whole system consists of three major parts: high frame rate DMD projector, an active shutter, and an optical Wedge?. This research investigates and develops the approaches to interface and control DMDs at very high bit rates and ultra-high frame rates to drive a novel flicker-free 3D flat panel device, with a wide viewing area and without need of special viewing glasses or head-tracking system. It needs to design a digital interface circuit capable of receiving video image data in a conventional format and translating it into a form appropriate for display on a DMD light modulator. This approach differs from existing ones in that it facilitates the modulation of the DMD to achieve much high frame rates, though with a trade-off in greyscale resolution. The outcomes of this research will have the great potential for commercialising the autostereoscopic display systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents our implementation of a multiview autostereoscopic 3D display system by using timemultiplexing approach, Digital Micro-mirror Devices (DMD), and the optical Wedge?. The whole system consists of three major parts: high frame rate DMD projector, an active shutter, and an optical Wedge?. This research investigates and develops the approaches to interface and control DMDs at very high bit rates and ultra-high frame rates to drive a novel flicker-free 3D flat panel device, with a wide viewing area and without need of special viewing glasses or head-tracking system. It needs to design a digital interface circuit capable of receiving video image data in a conventional format and translating it into a form appropriate for display on a DMD light modulator. This approach differs from existing ones in that it facilitates the modulation of the DMD to achieve much high frame rates, though with a trade-off in greyscale resolution. The outcomes of this research will have the great potential for commercialising the autostereoscopic display systems.",
"fno": "26020778",
"keywords": [
"Autostereoscopic Display",
"Projection Display",
"Digital Micro Mirror Device",
"Time Multiplexed 3 D Display",
"Digital Light Processing",
"View Sequential 3 D Display",
"Virtual Environment"
],
"authors": [
{
"affiliation": "University of Cambridge",
"fullName": "Ying Zhang",
"givenName": "Ying",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Cambridge",
"fullName": "Adrian Travis",
"givenName": "Adrian",
"surname": "Travis",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-07-01T00:00:00",
"pubType": "proceedings",
"pages": "778-784",
"year": "2006",
"issn": "1550-6037",
"isbn": "0-7695-2602-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "26020772",
"articleId": "12OmNBDgZ1k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "26020785",
"articleId": "12OmNwpoFAX",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cw/2010/4215/0/4215a325",
"title": "A System for Capturing, Rendering and Multiplexing Images on Multi-view Autostereoscopic Display",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2010/4215a325/12OmNBv2CkF",
"parentPublication": {
"id": "proceedings/cw/2010/4215/0",
"title": "2010 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apcip/2009/3699/2/3699b031",
"title": "3D Multi-view Autostereoscopic Display and Its Key Technologie",
"doi": null,
"abstractUrl": "/proceedings-article/apcip/2009/3699b031/12OmNvAS4pe",
"parentPublication": {
"id": "proceedings/apcip/2009/3699/1",
"title": "Information Processing, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2007/0907/0/04142851",
"title": "Character Interaction System with Autostereoscopic Display and Range Sensor",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2007/04142851/12OmNwc3wsr",
"parentPublication": {
"id": "proceedings/3dui/2007/0907/0",
"title": "2007 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2004/8415/0/84150059",
"title": "TWISTER: An Immersive Autostereoscopic Display",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2004/84150059/12OmNx5piYo",
"parentPublication": {
"id": "proceedings/vr/2004/8415/0",
"title": "Virtual Reality Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2002/1489/0/14890271",
"title": "Autostereoscopic and Haptic Visualization for Space Exploration and Mission Design",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2002/14890271/12OmNzUPphO",
"parentPublication": {
"id": "proceedings/haptics/2002/1489/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2005/08/r8031",
"title": "Autostereoscopic 3D Displays",
"doi": null,
"abstractUrl": "/magazine/co/2005/08/r8031/13rRUB7a16j",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2005/08/r8046",
"title": "Computer-Generated Holography as a Generic Display Technology",
"doi": null,
"abstractUrl": "/magazine/co/2005/08/r8046/13rRUB7a16k",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/02/v0228",
"title": "Correcting Interperspective Aliasing in Autostereoscopic Displays",
"doi": null,
"abstractUrl": "/journal/tg/2005/02/v0228/13rRUwgyOj8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2005/08/01492262",
"title": "Guest Editor's Introduction: The Ultimate Display--What Will It Be?",
"doi": null,
"abstractUrl": "/magazine/co/2005/08/01492262/13rRUy3gmVt",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/11/ttg2011111690",
"title": "Autostereoscopic 3D Display with Long Visualization Depth Using Referential Viewing Area-Based Integral Photography",
"doi": null,
"abstractUrl": "/journal/tg/2011/11/ttg2011111690/13rRUyfKIHG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzlUKpz",
"title": "2006 IEEE International Conference on Multimedia and Expo",
"acronym": "icme",
"groupId": "1000477",
"volume": "0",
"displayVolume": "0",
"year": "2006",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNynsbBJ",
"doi": "10.1109/ICME.2006.262875",
"title": "A Roadmap for Autostereoscopic Multi-Viewer Domestic TV Displays",
"normalizedTitle": "A Roadmap for Autostereoscopic Multi-Viewer Domestic TV Displays",
"abstract": "This paper presents a brief overview of the current technologies and technical approaches that may lead to viable and user-acceptable domestic autostereoscopic multi-viewer television displays. It illustrates the performance attributes of the various technological approaches and points to the most likely approaches to succeed within the next 10 years. Finally, it shows possible timescales for the enabling technologies for 3D display, and concludes that multi-user autostereoscopic displays may be the first to gain widespread use.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a brief overview of the current technologies and technical approaches that may lead to viable and user-acceptable domestic autostereoscopic multi-viewer television displays. It illustrates the performance attributes of the various technological approaches and points to the most likely approaches to succeed within the next 10 years. Finally, it shows possible timescales for the enabling technologies for 3D display, and concludes that multi-user autostereoscopic displays may be the first to gain widespread use.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a brief overview of the current technologies and technical approaches that may lead to viable and user-acceptable domestic autostereoscopic multi-viewer television displays. It illustrates the performance attributes of the various technological approaches and points to the most likely approaches to succeed within the next 10 years. Finally, it shows possible timescales for the enabling technologies for 3D display, and concludes that multi-user autostereoscopic displays may be the first to gain widespread use.",
"fno": "04036944",
"keywords": [],
"authors": [
{
"affiliation": "De Montfort University, UK",
"fullName": "P. Surman",
"givenName": "P.",
"surname": "Surman",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fraunhofer-Institute for Telecommunications - Heinrich-Hertz-Institut, Germany",
"fullName": "K. Hopf",
"givenName": "K.",
"surname": "Hopf",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "De Montfort University, UK",
"fullName": "I. Sexton",
"givenName": "I.",
"surname": "Sexton",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "De Montfort University, UK",
"fullName": "W. Lee",
"givenName": "W.",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "De Montfort University, UK",
"fullName": "R. Bates",
"givenName": "R.",
"surname": "Bates",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icme",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2006-07-01T00:00:00",
"pubType": "proceedings",
"pages": "1693-1696",
"year": "2006",
"issn": null,
"isbn": "1-4244-0366-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04036943",
"articleId": "12OmNzn391k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04036945",
"articleId": "12OmNylKATL",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ismar/2010/9343/0/05643563",
"title": "A practical multi-viewer tabletop autostereoscopic display",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2010/05643563/12OmNAJDBux",
"parentPublication": {
"id": "proceedings/ismar/2010/9343/0",
"title": "2010 IEEE International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2006/0366/0/04037019",
"title": "Applications of Autostereoscopic Displays in Ophthalmologic Studies",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2006/04037019/12OmNBa2iA8",
"parentPublication": {
"id": "proceedings/icme/2006/0366/0",
"title": "2006 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2011/348/0/06012182",
"title": "Automatic content creation for multiview autostereoscopic displays using image domain warping",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06012182/12OmNrAdsH9",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apcip/2009/3699/2/3699b031",
"title": "3D Multi-view Autostereoscopic Display and Its Key Technologie",
"doi": null,
"abstractUrl": "/proceedings-article/apcip/2009/3699b031/12OmNvAS4pe",
"parentPublication": {
"id": "proceedings/apcip/2009/3699/1",
"title": "Information Processing, Asia-Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2010/7491/0/05583204",
"title": "MUTED and HELIUM3D autostereoscopic displays",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2010/05583204/12OmNwDSdhI",
"parentPublication": {
"id": "proceedings/icme/2010/7491/0",
"title": "2010 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2007/0907/0/04142851",
"title": "Character Interaction System with Autostereoscopic Display and Range Sensor",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2007/04142851/12OmNwc3wsr",
"parentPublication": {
"id": "proceedings/3dui/2007/0907/0",
"title": "2007 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2007/0905/0/04161015",
"title": "A GPU Sub-pixel Algorithm for Autostereoscopic Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2007/04161015/12OmNwlqhRb",
"parentPublication": {
"id": "proceedings/vr/2007/0905/0",
"title": "2007 IEEE Virtual Reality Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2002/1489/0/14890271",
"title": "Autostereoscopic and Haptic Visualization for Space Exploration and Mission Design",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2002/14890271/12OmNzUPphO",
"parentPublication": {
"id": "proceedings/haptics/2002/1489/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2015/7082/0/07177519",
"title": "Active crosstalk reduction system for multiview autostereoscopic displays",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2015/07177519/12OmNzgeLCa",
"parentPublication": {
"id": "proceedings/icme/2015/7082/0",
"title": "2015 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2005/08/r8031",
"title": "Autostereoscopic 3D Displays",
"doi": null,
"abstractUrl": "/magazine/co/2005/08/r8031/13rRUB7a16j",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxFJXGd",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"acronym": "icme",
"groupId": "1000477",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrMZpjL",
"doi": "10.1109/ICME.2017.8019391",
"title": "Object trajectory proposal",
"normalizedTitle": "Object trajectory proposal",
"abstract": "We propose a novel method for video object proposal to generate sequences of bounding boxes for each object candidate in videos, namely object trajectory proposals. Unlike the image-based methods that produce object proposals independently in each video frame, our method generates temporally consistent proposals in the form of object trajectories, which is crucial for subsequent analysis of object appearance and motion characteristics. Given a video, we extract motion seeds through estimating the outliers of global motion, and generate moving object trajectory proposals from the seeds. By ignoring the motion outliers, we consistently sample bounding boxes with pruning to form static object trajectory proposals. Finally, we rank both the moving and static object trajectory proposals under a unified scoring mechanism. The experimental results show that our method can effectively generate object trajectory proposals and outperform the state-of-the-art methods.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a novel method for video object proposal to generate sequences of bounding boxes for each object candidate in videos, namely object trajectory proposals. Unlike the image-based methods that produce object proposals independently in each video frame, our method generates temporally consistent proposals in the form of object trajectories, which is crucial for subsequent analysis of object appearance and motion characteristics. Given a video, we extract motion seeds through estimating the outliers of global motion, and generate moving object trajectory proposals from the seeds. By ignoring the motion outliers, we consistently sample bounding boxes with pruning to form static object trajectory proposals. Finally, we rank both the moving and static object trajectory proposals under a unified scoring mechanism. The experimental results show that our method can effectively generate object trajectory proposals and outperform the state-of-the-art methods.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a novel method for video object proposal to generate sequences of bounding boxes for each object candidate in videos, namely object trajectory proposals. Unlike the image-based methods that produce object proposals independently in each video frame, our method generates temporally consistent proposals in the form of object trajectories, which is crucial for subsequent analysis of object appearance and motion characteristics. Given a video, we extract motion seeds through estimating the outliers of global motion, and generate moving object trajectory proposals from the seeds. By ignoring the motion outliers, we consistently sample bounding boxes with pruning to form static object trajectory proposals. Finally, we rank both the moving and static object trajectory proposals under a unified scoring mechanism. The experimental results show that our method can effectively generate object trajectory proposals and outperform the state-of-the-art methods.",
"fno": "08019391",
"keywords": [
"Trajectory",
"Proposals",
"Tracking",
"Optical Imaging",
"Motion Segmentation",
"Cameras",
"Image Segmentation",
"Video Object Proposal",
"Trajectory Proposal",
"Motion Seed",
"Consistent Sampling"
],
"authors": [
{
"affiliation": "School of Computing, National University of Singapore, Singapore",
"fullName": "Xindi Shang",
"givenName": "Xindi",
"surname": "Shang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, China",
"fullName": "Tongwei Ren",
"givenName": "Tongwei",
"surname": "Ren",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computing, National University of Singapore, Singapore",
"fullName": "Hanwang Zhang",
"givenName": "Hanwang",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "State Key Laboratory for Novel Software Technology, Nanjing University, China",
"fullName": "Gangshan Wu",
"givenName": "Gangshan",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computing, National University of Singapore, Singapore",
"fullName": "Tat-Seng Chua",
"givenName": "Tat-Seng",
"surname": "Chua",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icme",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-07-01T00:00:00",
"pubType": "proceedings",
"pages": "331-336",
"year": "2017",
"issn": "1945-788X",
"isbn": "978-1-5090-6067-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08019390",
"articleId": "12OmNwAt1FT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08019392",
"articleId": "12OmNy7Qfu9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2017/6067/0/08019535",
"title": "Learning to generate video object segment proposals",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019535/12OmNAZOJWI",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2014/4985/0/06836017",
"title": "Video segmentation with joint object and trajectory labeling",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2014/06836017/12OmNB836MP",
"parentPublication": {
"id": "proceedings/wacv/2014/4985/0",
"title": "2014 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00219958",
"title": "Trajectory filtering and prediction for automated tracking and grasping of a moving object",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00219958/12OmNqBKTT9",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv-motion/2005/2271/1/227110242",
"title": "Evaluation of Matching Metrics for Trajectory-Based Indexing and Retrieval of Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/wacv-motion/2005/227110242/12OmNqGA58i",
"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/icme/2011/348/0/06012069",
"title": "Trajectory based video object manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06012069/12OmNvIfDQQ",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d227",
"title": "Fully Connected Object Proposals for Video Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d227/12OmNwlHSTH",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2017/6067/0/08019504",
"title": "Object tracking via online trajectory optimization with multi-feature fusion",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2017/08019504/12OmNxdDFJD",
"parentPublication": {
"id": "proceedings/icme/2017/6067/0",
"title": "2017 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391b680",
"title": "Learning to Combine Mid-Level Cues for Object Proposal Generation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391b680/12OmNyfdOZk",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800g796",
"title": "TPNet: Trajectory Proposal Network for Motion Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800g796/1m3offWYKI0",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900c443",
"title": "Learning a Proposal Classifier for Multiple Object Tracking",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900c443/1yeKQpsByRG",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "18j8Ecq0jn2",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"acronym": "wacv",
"groupId": "1000040",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "18j8GAYK76w",
"doi": "10.1109/WACV.2019.00041",
"title": "Learning On-Road Visual Control for Self-Driving Vehicles With Auxiliary Tasks",
"normalizedTitle": "Learning On-Road Visual Control for Self-Driving Vehicles With Auxiliary Tasks",
"abstract": "A safe and robust on-road navigation system is a crucial component of achieving fully automated vehicles. NVIDIA recently proposed an End-to-End algorithm that can directly learn steering commands from raw pixels of a front camera by using one convolutional neural network. In this paper, we leverage auxiliary information aside from raw images and design a novel network structure, called Auxiliary Task Network (ATN), to help boost the driving performance while maintaining the advantage of minimal training data and an End-to-End training method. In this network, we introduce human prior knowledge into vehicle navigation by transferring features from image recognition tasks. Image semantic segmentation is applied as an auxiliary task for navigation. We consider temporal information by introducing an LSTM module and optical flow to the network. Finally, we combine vehicle kinematics with a sensor fusion step. We discuss the benefits of our method over state-of-the-art visual navigation methods both in the Udacity simulation environment and on the real-world Comma.ai dataset.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A safe and robust on-road navigation system is a crucial component of achieving fully automated vehicles. NVIDIA recently proposed an End-to-End algorithm that can directly learn steering commands from raw pixels of a front camera by using one convolutional neural network. In this paper, we leverage auxiliary information aside from raw images and design a novel network structure, called Auxiliary Task Network (ATN), to help boost the driving performance while maintaining the advantage of minimal training data and an End-to-End training method. In this network, we introduce human prior knowledge into vehicle navigation by transferring features from image recognition tasks. Image semantic segmentation is applied as an auxiliary task for navigation. We consider temporal information by introducing an LSTM module and optical flow to the network. Finally, we combine vehicle kinematics with a sensor fusion step. We discuss the benefits of our method over state-of-the-art visual navigation methods both in the Udacity simulation environment and on the real-world Comma.ai dataset.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A safe and robust on-road navigation system is a crucial component of achieving fully automated vehicles. NVIDIA recently proposed an End-to-End algorithm that can directly learn steering commands from raw pixels of a front camera by using one convolutional neural network. In this paper, we leverage auxiliary information aside from raw images and design a novel network structure, called Auxiliary Task Network (ATN), to help boost the driving performance while maintaining the advantage of minimal training data and an End-to-End training method. In this network, we introduce human prior knowledge into vehicle navigation by transferring features from image recognition tasks. Image semantic segmentation is applied as an auxiliary task for navigation. We consider temporal information by introducing an LSTM module and optical flow to the network. Finally, we combine vehicle kinematics with a sensor fusion step. We discuss the benefits of our method over state-of-the-art visual navigation methods both in the Udacity simulation environment and on the real-world Comma.ai dataset.",
"fno": "197500a331",
"keywords": [
"Convolutional Neural Nets",
"Image Recognition",
"Image Segmentation",
"Image Sequences",
"Navigation",
"Road Vehicles",
"Self Driving Vehicles",
"On Road Navigation System",
"Fully Automated Vehicles",
"Steering Commands",
"Convolutional Neural Network",
"Network Structure",
"Vehicle Navigation",
"Image Recognition Tasks",
"Image Semantic Segmentation",
"Temporal Information",
"Vehicle Kinematics",
"On Road Visual Control",
"Visual Navigation Methods",
"End To End Training Method",
"Auxiliary Task Network",
"Task Analysis",
"Image Segmentation",
"Optical Imaging",
"Training",
"Optical Sensors",
"Neural Networks",
"Kinematics"
],
"authors": [
{
"affiliation": null,
"fullName": "Yilun Chen",
"givenName": "Yilun",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Palanisamy Praveen",
"givenName": "Palanisamy",
"surname": "Praveen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mudalige Priyantha",
"givenName": "Mudalige",
"surname": "Priyantha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Katherina Muelling",
"givenName": "Katherina",
"surname": "Muelling",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "John Dolan",
"givenName": "John",
"surname": "Dolan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "wacv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-01-01T00:00:00",
"pubType": "proceedings",
"pages": "331-338",
"year": "2019",
"issn": "1550-5790",
"isbn": "978-1-7281-1975-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "197500a321",
"articleId": "18j8Q7gaiwE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "197500a339",
"articleId": "18j8M65Lhrq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2017/3050/0/08217755",
"title": "Predictive deep network with leveraging clinical measure as auxiliary task",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2017/08217755/12OmNrHB1Uh",
"parentPublication": {
"id": "proceedings/bibm/2017/3050/0",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200q6097",
"title": "Auxiliary Tasks and Exploration Enable ObjectGoal Navigation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200q6097/1BmFjj4jXva",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200g964",
"title": "Leveraging Auxiliary Tasks with Affinity Learning for Weakly Supervised Semantic Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g964/1BmGw6EYGHe",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2022/9062/0/09956695",
"title": "Improving End-to-End Text Image Translation From the Auxiliary Text Translation Task",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956695/1IHp1smIlCU",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600b104",
"title": "Structure-Encoding Auxiliary Tasks for Improved Visual Representation in Vision-and-Language Navigation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600b104/1KxUN8QrZ1C",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/08/09018142",
"title": "DENAO: Monocular Depth Estimation Network With Auxiliary Optical Flow",
"doi": null,
"abstractUrl": "/journal/tp/2021/08/09018142/1hN4m1DJDNu",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2020/4905/0/09049658",
"title": "SmartNavi: A Smart Navigation Application with Main and Auxiliary Distinguishing Using Deep Learning Approach",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2020/09049658/1iES2KECR4A",
"parentPublication": {
"id": "proceedings/icnc/2020/4905/0",
"title": "2020 International Conference on Computing, Networking and Communications (ICNC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093325",
"title": "DATNet: Dense Auxiliary Tasks for Object Detection",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093325/1jPbtRMVBxm",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800k0009",
"title": "Vision-Language Navigation With Self-Supervised Auxiliary Reasoning Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800k0009/1m3nTvLItDG",
"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/wacv/2021/0477/0/047700a717",
"title": "Auxiliary Tasks for Efficient Learning of Point-Goal Navigation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700a717/1uqGrMNPGBG",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1H1gVMlkl32",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1H1mKTNQH16",
"doi": "10.1109/CVPR52688.2022.00485",
"title": "Cloning Outfits from Real-World Images to 3D Characters for Generalizable Person Re-Identification",
"normalizedTitle": "Cloning Outfits from Real-World Images to 3D Characters for Generalizable Person Re-Identification",
"abstract": "Recently, large-scale synthetic datasets are shown to be very useful for generalizable person re-identification. However, synthesized persons in existing datasets are mostly cartoon-like and in random dress collocation, which limits their performance. To address this, in this work, an automatic approach is proposed to directly clone the whole outfits from real-world person images to virtual 3D characters, such that any virtual person thus created will appear very similar to its real-world counterpart. Specifically, based on UV texture mapping, two cloning methods are designed, namely registered clothes mapping and homogeneous cloth expansion. Given clothes keypoints detected on person images and labeled on regular UV maps with clear clothes structures, registered mapping applies perspective homography to warp real-world clothes to the counterparts on the UV map. As for invisible clothes parts and irregular UV maps, homogeneous expansion segments a homogeneous area on clothes as a realistic cloth pattern or cell, and expand the cell to fill the UV map. Furthermore, a similarity-diversity expansion strategy is proposed, by clustering person images, sampling images per cluster, and cloning outfits for 3D character generation. This way, virtual persons can be scaled up densely in visual similarity to challenge model learning, and diversely in population to enrich sample distribution. Finally, by rendering the cloned characters in Unity3D scenes, a more realistic virtual dataset called ClonedPerson is created, with 5,621 identities and 887,766 images. Experimental results show that the model trained on ClonedPerson has a better generalization performance, superior to that trained on other popular real-world and synthetic person re-identification datasets. The ClonedPerson project is available at https://github.com/Yanan-Wang-cs/ClonedPerson.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recently, large-scale synthetic datasets are shown to be very useful for generalizable person re-identification. However, synthesized persons in existing datasets are mostly cartoon-like and in random dress collocation, which limits their performance. To address this, in this work, an automatic approach is proposed to directly clone the whole outfits from real-world person images to virtual 3D characters, such that any virtual person thus created will appear very similar to its real-world counterpart. Specifically, based on UV texture mapping, two cloning methods are designed, namely registered clothes mapping and homogeneous cloth expansion. Given clothes keypoints detected on person images and labeled on regular UV maps with clear clothes structures, registered mapping applies perspective homography to warp real-world clothes to the counterparts on the UV map. As for invisible clothes parts and irregular UV maps, homogeneous expansion segments a homogeneous area on clothes as a realistic cloth pattern or cell, and expand the cell to fill the UV map. Furthermore, a similarity-diversity expansion strategy is proposed, by clustering person images, sampling images per cluster, and cloning outfits for 3D character generation. This way, virtual persons can be scaled up densely in visual similarity to challenge model learning, and diversely in population to enrich sample distribution. Finally, by rendering the cloned characters in Unity3D scenes, a more realistic virtual dataset called ClonedPerson is created, with 5,621 identities and 887,766 images. Experimental results show that the model trained on ClonedPerson has a better generalization performance, superior to that trained on other popular real-world and synthetic person re-identification datasets. The ClonedPerson project is available at https://github.com/Yanan-Wang-cs/ClonedPerson.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recently, large-scale synthetic datasets are shown to be very useful for generalizable person re-identification. However, synthesized persons in existing datasets are mostly cartoon-like and in random dress collocation, which limits their performance. To address this, in this work, an automatic approach is proposed to directly clone the whole outfits from real-world person images to virtual 3D characters, such that any virtual person thus created will appear very similar to its real-world counterpart. Specifically, based on UV texture mapping, two cloning methods are designed, namely registered clothes mapping and homogeneous cloth expansion. Given clothes keypoints detected on person images and labeled on regular UV maps with clear clothes structures, registered mapping applies perspective homography to warp real-world clothes to the counterparts on the UV map. As for invisible clothes parts and irregular UV maps, homogeneous expansion segments a homogeneous area on clothes as a realistic cloth pattern or cell, and expand the cell to fill the UV map. Furthermore, a similarity-diversity expansion strategy is proposed, by clustering person images, sampling images per cluster, and cloning outfits for 3D character generation. This way, virtual persons can be scaled up densely in visual similarity to challenge model learning, and diversely in population to enrich sample distribution. Finally, by rendering the cloned characters in Unity3D scenes, a more realistic virtual dataset called ClonedPerson is created, with 5,621 identities and 887,766 images. Experimental results show that the model trained on ClonedPerson has a better generalization performance, superior to that trained on other popular real-world and synthetic person re-identification datasets. The ClonedPerson project is available at https://github.com/Yanan-Wang-cs/ClonedPerson.",
"fno": "694600e890",
"keywords": [
"Clothing",
"Deep Learning Artificial Intelligence",
"Image Sampling",
"Image Segmentation",
"Image Texture",
"Pattern Clustering",
"Rendering Computer Graphics",
"Solid Modelling",
"Virtual Reality",
"Cloning Outfits",
"Generalizable Person Re Identification",
"Random Dress Collocation",
"Virtual 3 D Characters",
"UV Texture Mapping",
"Cloning Methods",
"Homogeneous Cloth Expansion",
"Homogeneous Expansion Segments",
"Realistic Cloth Pattern",
"Realistic Virtual Dataset",
"Synthetic Person Re Identification Datasets",
"Clothes Mapping",
"Sample Images Per Cluster",
"Cluster Person Images",
"Visualization",
"Image Segmentation",
"Three Dimensional Displays",
"Computational Modeling",
"Soft Sensors",
"Sociology",
"Cloning",
"Recognition Detection",
"Categorization",
"Retrieval Datasets And Evaluation Image And Video Synthesis And Generation"
],
"authors": [
{
"affiliation": "Inception Institute of Artificial Intelligence (IIAI),Masdar City, Abu Dhabi,UAE",
"fullName": "Yanan Wang",
"givenName": "Yanan",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Mohamed bin Zayed University of Artificial Intelligence,Masdar City, Abu Dhabi,UAE",
"fullName": "Xuezhi Liang",
"givenName": "Xuezhi",
"surname": "Liang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Inception Institute of Artificial Intelligence (IIAI),Masdar City, Abu Dhabi,UAE",
"fullName": "Shengcai Liao",
"givenName": "Shengcai",
"surname": "Liao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "4890-4899",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1H1mKCwiWZy",
"name": "pcvpr202269460-09879811s1-mm_694600e890.zip",
"size": "18.9 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202269460-09879811s1-mm_694600e890.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "694600e879",
"articleId": "1H0KygllKxy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600e900",
"articleId": "1H0NuTHB2uc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2022/6946/0/694600b050",
"title": "Clothes-Changing Person Re-identification with RGB Modality Only",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600b050/1H0N5zRSY4o",
"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/09956160",
"title": "A Cloth-Irrelevant Harmonious Attention Network for Cloth-Changing Person Re-identification",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956160/1IHovRiYyWc",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600b634",
"title": "MEVID: Multi-view Extended Videos with Identities for Video Person Re-Identification",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600b634/1L8qxeA8b5u",
"parentPublication": {
"id": "proceedings/wacv/2023/9346/0",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2021/06/08936426",
"title": "Person Re-Identification by Contour Sketch Under Moderate Clothing Change",
"doi": null,
"abstractUrl": "/journal/tp/2021/06/08936426/1fRz11hD8Tm",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150855",
"title": "When Person Re-identification Meets Changing Clothes",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150855/1lPGZLNgCTC",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800k0696",
"title": "Learning Longterm Representations for Person Re-Identification Using Radio Signals",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800k0696/1m3nQMz5mpi",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800d140",
"title": "Style Normalization and Restitution for Generalizable Person Re-Identification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800d140/1m3nYSyYuDm",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800d397",
"title": "COCAS: A Large-Scale Clothes Changing Person Dataset for Re-Identification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800d397/1m3nvQPB3BS",
"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/icmcce/2020/2314/0/231400c009",
"title": "Clothes-Changing Image Generation Based on Attention for Person Re-identification",
"doi": null,
"abstractUrl": "/proceedings-article/icmcce/2020/231400c009/1tzyNugptjW",
"parentPublication": {
"id": "proceedings/icmcce/2020/2314/0",
"title": "2020 5th International Conference on Mechanical, Control and Computer Engineering (ICMCCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2021/4989/0/09455980",
"title": "Cluster-Based Distribution Alignment For Generalizable Person Re-Identification",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2021/09455980/1uCgua7JuKs",
"parentPublication": {
"id": "proceedings/icmew/2021/4989/0",
"title": "2021 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvjgWN1",
"title": "2014 Second International Symposium on Computing and Networking (CANDAR)",
"acronym": "candar",
"groupId": "1803431",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAtK4ib",
"doi": "10.1109/CANDAR.2014.76",
"title": "Hybrid Visualization of Sparse Point-Based Data Using GPGPU",
"normalizedTitle": "Hybrid Visualization of Sparse Point-Based Data Using GPGPU",
"abstract": "Direct point-based rendering is a popular method in scientific visualization, since the number of point-based datasets increased dramatically in the past few years. At the same time, rendering of point primitives is becoming less efficient as the data size increases. Point splatting, volume-based rendering, or is surface extraction are well-known approaches that can be utilized. Unfortunately, high visual accuracy is often sacrificed. Furthermore, unstructured sparse point-based data is more difficult to visualize, since no surface geometry and topology can be implicitly defined. This paper introduces a novel hybrid visualization method that utilizes point-based and volume-based rendering of sparse point-based data. The visualization is done entirely with a custom rendering pipeline by using GPGPU, which provides accelerated rendering. The method achieves real-time visualization, while retaining high visual accuracy, as shown on cosmological dark matter SPH-based dataset.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Direct point-based rendering is a popular method in scientific visualization, since the number of point-based datasets increased dramatically in the past few years. At the same time, rendering of point primitives is becoming less efficient as the data size increases. Point splatting, volume-based rendering, or is surface extraction are well-known approaches that can be utilized. Unfortunately, high visual accuracy is often sacrificed. Furthermore, unstructured sparse point-based data is more difficult to visualize, since no surface geometry and topology can be implicitly defined. This paper introduces a novel hybrid visualization method that utilizes point-based and volume-based rendering of sparse point-based data. The visualization is done entirely with a custom rendering pipeline by using GPGPU, which provides accelerated rendering. The method achieves real-time visualization, while retaining high visual accuracy, as shown on cosmological dark matter SPH-based dataset.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Direct point-based rendering is a popular method in scientific visualization, since the number of point-based datasets increased dramatically in the past few years. At the same time, rendering of point primitives is becoming less efficient as the data size increases. Point splatting, volume-based rendering, or is surface extraction are well-known approaches that can be utilized. Unfortunately, high visual accuracy is often sacrificed. Furthermore, unstructured sparse point-based data is more difficult to visualize, since no surface geometry and topology can be implicitly defined. This paper introduces a novel hybrid visualization method that utilizes point-based and volume-based rendering of sparse point-based data. The visualization is done entirely with a custom rendering pipeline by using GPGPU, which provides accelerated rendering. The method achieves real-time visualization, while retaining high visual accuracy, as shown on cosmological dark matter SPH-based dataset.",
"fno": "4152a178",
"keywords": [
"Rendering Computer Graphics",
"Three Dimensional Displays",
"Graphics Processing Units",
"Casting",
"Data Visualization",
"Visualization",
"Pipelines",
"CUDA",
"Scientific Visualization",
"Hybrid Rendering",
"SVO",
"GPGPU"
],
"authors": [
{
"affiliation": null,
"fullName": "Niko Lukac",
"givenName": "Niko",
"surname": "Lukac",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Denis pelic",
"givenName": "Denis",
"surname": "pelic",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Borut alik",
"givenName": "Borut",
"surname": "alik",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "candar",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-12-01T00:00:00",
"pubType": "proceedings",
"pages": "178-184",
"year": "2014",
"issn": null,
"isbn": "978-1-4799-4152-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4152a171",
"articleId": "12OmNz2TCvK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4152a185",
"articleId": "12OmNym2bZD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pbg/2005/20/0/01500315",
"title": "Voronoi rasterization of sparse point sets",
"doi": null,
"abstractUrl": "/proceedings-article/pbg/2005/01500315/12OmNBfZSmM",
"parentPublication": {
"id": "proceedings/pbg/2005/20/0",
"title": "Point-Based Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2002/7641/0/76410123",
"title": "A Hardware-Assisted Hybrid Rendering Technique for Interactive Volume Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2002/76410123/12OmNC4eSsE",
"parentPublication": {
"id": "proceedings/vv/2002/7641/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a267",
"title": "Application of Stochastic Point-Based Rendering to Transparent Visualization of Large-Scale Laser-Scanned Data of 3D Cultural Assets",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a267/12OmNvC0sXI",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vg/2005/26/0/01500534",
"title": "Combining point clouds and volume objects in volume scene graphs",
"doi": null,
"abstractUrl": "/proceedings-article/vg/2005/01500534/12OmNyQGS6g",
"parentPublication": {
"id": "proceedings/vg/2005/26/0",
"title": "Volume Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2014/5215/0/07013209",
"title": "Out-of-core visualization of time-varying hybrid-grid volume data",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2014/07013209/12OmNyoiZc2",
"parentPublication": {
"id": "proceedings/ldav/2014/5215/0",
"title": "2014 IEEE 4th Symposium on Large Data Analysis and Visualization (LDAV)",
"__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": "trans/tg/2020/10/08695851",
"title": "Interactive Visualization and On-Demand Processing of Large Volume Data: A Fully GPU-Based Out-of-Core Approach",
"doi": null,
"abstractUrl": "/journal/tg/2020/10/08695851/19sOOqzUp7W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2022/02/09722973",
"title": "<italic>In Situ</italic> Visualization of Regional-Scale Natural Hazards With Galaxy and Material Point Method",
"doi": null,
"abstractUrl": "/magazine/cs/2022/02/09722973/1BmTaqFQLU4",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2019/4528/0/452800a593",
"title": "Efficient Randomized Hierarchy Construction for Interactive Visualization of Large Scale Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2019/452800a593/1fHjRqYiXuw",
"parentPublication": {
"id": "proceedings/dsc/2019/4528/0",
"title": "2019 IEEE Fourth International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/07/09264699",
"title": "Learning Adaptive Sampling and Reconstruction for Volume Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2022/07/09264699/1oSTZCzu3YI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNC2fGtw",
"title": "2013 First International Symposium on Computing and Networking - Across Practical Development and Theoretical Research (CANDAR)",
"acronym": "candar",
"groupId": "1803431",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvlxJrZ",
"doi": "10.1109/CANDAR.2013.14",
"title": "A Fast Runtime Visualization of a GPU-Based 3D-FDTD Electromagnetic Simulation",
"normalizedTitle": "A Fast Runtime Visualization of a GPU-Based 3D-FDTD Electromagnetic Simulation",
"abstract": "In this paper, we present design and implementation of a fast runtime visualizer for a GPU-based 3D-FDTD electromagnetic simulation. We focus on improving the productivity of simulator development without compromising simulation performance. In order to keep the portability, we implemented a visualizer with the MVC model, where simulation kernels and visualization process were completely separated. For high-speed visualization, an interoperability mechanism between OpenGL and CUDA was used in addition to efficient utilization of programmable shaders. We also propose an asynchronous multi-threaded execution with a triple-buffering technique so that developers can concentrate on developing their simulation kernels. As a result of empirical visualization experiments of electromagnetic simulations for practical antenna design, it was revealed that our implementation achieved a rendering throughput of 90 FPS for a view port of 512 x 512 pixels, which corresponds to a 12.9 times speedup compared to when the OpenGL-CUDA interoperability mechanism was not utilized. When a standard visualization throughput of 60 FPS was selected, the performance overhead imposed by the visualization process was 15.8%, which was reasonably low compared to a speedup of the simulation kernel gained by the GPU acceleration.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present design and implementation of a fast runtime visualizer for a GPU-based 3D-FDTD electromagnetic simulation. We focus on improving the productivity of simulator development without compromising simulation performance. In order to keep the portability, we implemented a visualizer with the MVC model, where simulation kernels and visualization process were completely separated. For high-speed visualization, an interoperability mechanism between OpenGL and CUDA was used in addition to efficient utilization of programmable shaders. We also propose an asynchronous multi-threaded execution with a triple-buffering technique so that developers can concentrate on developing their simulation kernels. As a result of empirical visualization experiments of electromagnetic simulations for practical antenna design, it was revealed that our implementation achieved a rendering throughput of 90 FPS for a view port of 512 x 512 pixels, which corresponds to a 12.9 times speedup compared to when the OpenGL-CUDA interoperability mechanism was not utilized. When a standard visualization throughput of 60 FPS was selected, the performance overhead imposed by the visualization process was 15.8%, which was reasonably low compared to a speedup of the simulation kernel gained by the GPU acceleration.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present design and implementation of a fast runtime visualizer for a GPU-based 3D-FDTD electromagnetic simulation. We focus on improving the productivity of simulator development without compromising simulation performance. In order to keep the portability, we implemented a visualizer with the MVC model, where simulation kernels and visualization process were completely separated. For high-speed visualization, an interoperability mechanism between OpenGL and CUDA was used in addition to efficient utilization of programmable shaders. We also propose an asynchronous multi-threaded execution with a triple-buffering technique so that developers can concentrate on developing their simulation kernels. As a result of empirical visualization experiments of electromagnetic simulations for practical antenna design, it was revealed that our implementation achieved a rendering throughput of 90 FPS for a view port of 512 x 512 pixels, which corresponds to a 12.9 times speedup compared to when the OpenGL-CUDA interoperability mechanism was not utilized. When a standard visualization throughput of 60 FPS was selected, the performance overhead imposed by the visualization process was 15.8%, which was reasonably low compared to a speedup of the simulation kernel gained by the GPU acceleration.",
"fno": "06726876",
"keywords": [
"Computational Electromagnetics",
"Data Visualisation",
"Electromagnetic Field Theory",
"Finite Difference Time Domain Analysis",
"Graphics Processing Units",
"Multi Threading",
"Open Systems",
"Parallel Architectures",
"Rendering Computer Graphics",
"Software Portability",
"Runtime Visualization",
"GPU Based 3 D FDTD Electromagnetic Simulation",
"Runtime Visualizer",
"Productivity",
"Simulator Development",
"Simulation Performance",
"Portability",
"MVC Model",
"Simulation Kernels",
"Visualization Process",
"High Speed Visualization",
"Programmable Shaders",
"Asynchronous Multithreaded Execution",
"Triple Buffering Technique",
"Visualization Experiments",
"Electromagnetic Simulations",
"Antenna Design",
"Rendering Throughput",
"Open GL CUDA Interoperability Mechanism",
"Visualization Throughput",
"FPS",
"Performance Overhead",
"GPU Acceleration",
"Graphics Processing Units",
"Kernel",
"Memory",
"Rendering Computer Graphics",
"Data Visualization",
"Computational Modeling",
"Interoperability",
"GPGPU",
"3 D FDTD",
"Visualization Framework",
"GPU",
"Open GL",
"CUDA"
],
"authors": [
{
"affiliation": null,
"fullName": "Kota Aoki",
"givenName": "Kota",
"surname": "Aoki",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Keisuke Dohi",
"givenName": "Keisuke",
"surname": "Dohi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yuichiro Shibata",
"givenName": "Yuichiro",
"surname": "Shibata",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kiyoshi Oguri",
"givenName": "Kiyoshi",
"surname": "Oguri",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Takafumi Fujimoto",
"givenName": "Takafumi",
"surname": "Fujimoto",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "candar",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-12-01T00:00:00",
"pubType": "proceedings",
"pages": "30-37",
"year": "2013",
"issn": "2379-1888",
"isbn": "978-1-4799-2796-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06726875",
"articleId": "12OmNAkWvvq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06726877",
"articleId": "12OmNBEYzPE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isecs/2010/8231/0/05557408",
"title": "Research on Visualization of Electromagnetic Information in Virtual Environment",
"doi": null,
"abstractUrl": "/proceedings-article/isecs/2010/05557408/12OmNvRU0iJ",
"parentPublication": {
"id": "proceedings/isecs/2010/8231/0",
"title": "2010 Third International Symposium on Electronic Commerce and Security (ISECS 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isorc/2014/4430/0/4430a032",
"title": "Modular Distributed Visualization and Collaboration for a Real-Time 3D Visualizer",
"doi": null,
"abstractUrl": "/proceedings-article/isorc/2014/4430a032/12OmNvxsSUP",
"parentPublication": {
"id": "proceedings/isorc/2014/4430/0",
"title": "2014 IEEE 17th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2012/2049/0/06266300",
"title": "A flexible Java GPU-enhanced visualization framework and its applications",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2012/06266300/12OmNwHQBby",
"parentPublication": {
"id": "proceedings/cbms/2012/2049/0",
"title": "2012 25th IEEE International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2015/8828/0/8828a692",
"title": "GPU Based Sound Simulation and Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2015/8828a692/12OmNwMob6x",
"parentPublication": {
"id": "proceedings/itng/2015/8828/0",
"title": "2015 12th International Conference on Information Technology - New Generations (ITNG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/03/mcg2013030005",
"title": "Using GPU Shaders for Visualization, Part 3",
"doi": null,
"abstractUrl": "/magazine/cg/2013/03/mcg2013030005/13rRUwhpBQ5",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/05/mcg2009050096",
"title": "Using GPU Shaders for Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2009/05/mcg2009050096/13rRUxBa5pc",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2011/02/mcg2011020067",
"title": "Using GPU Shaders for Visualization, Part 2",
"doi": null,
"abstractUrl": "/magazine/cg/2011/02/mcg2011020067/13rRUyg2jQ5",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__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/ismii/2021/1290/0/129000a252",
"title": "Research on the visualization method of two dimensions underwater flow simulation",
"doi": null,
"abstractUrl": "/proceedings-article/ismii/2021/129000a252/1sZ2LY99qFy",
"parentPublication": {
"id": "proceedings/ismii/2021/1290/0",
"title": "2021 7th International Symposium on Mechatronics and Industrial Informatics (ISMII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwkhTjj",
"title": "2017 International Conference on High-Performance Computing & Simulation (HPCS)",
"acronym": "hpcs",
"groupId": "1800007",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx5YviR",
"doi": "10.1109/HPCS.2017.54",
"title": "Distributed Particle-Based Rendering Framework for Large Data Visualization on HPC Environments",
"normalizedTitle": "Distributed Particle-Based Rendering Framework for Large Data Visualization on HPC Environments",
"abstract": "In this paper, we present a distributed data visualization framework for HPC environments based on the PBVR (Particle Based Volume Rendering) method. The PBVR method is a kind of point-based rendering approach where the volumetric data to be visualized is represented as a set of small and opaque particles. This method has the object-space and image-space variants, defined by the place (object or image- space) where the particle data sets are generated. We focused on the object-space approach, which has the advantage when handling large-scale simulation data sets such as those generated by modern HPC systems. In the object-space approach, the particle generation and the subsequent rendering processes can be easily decoupled. In this work, we took advantage of this separability to implement the proposed distributed rendering framework. The particle generation process utilizes the functionalities provided by the KVS (Kyoto Visualization System), and the particle rendering process utilizes the functionalities provided by the HIVE (Heterogeneously Integrated Visual- analytics Environment). The proposed distributed visualization framework is targeted to work also on systems without any hardware graphics acceleration capability, which are commonly found on modern HPC operational environments. We evaluated this PBVR-based distributed visualization infrastructure on the K computer operational environment by utilizing a CPU-only processing server for the particle data generation and rendering. In this preliminary evaluation, using some CFD (Computational Fluid Dynamics) simulation data sets, we obtained encouraging results for pushing further the development in order to make this system available as an effective visualization alternative for the HPC users.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a distributed data visualization framework for HPC environments based on the PBVR (Particle Based Volume Rendering) method. The PBVR method is a kind of point-based rendering approach where the volumetric data to be visualized is represented as a set of small and opaque particles. This method has the object-space and image-space variants, defined by the place (object or image- space) where the particle data sets are generated. We focused on the object-space approach, which has the advantage when handling large-scale simulation data sets such as those generated by modern HPC systems. In the object-space approach, the particle generation and the subsequent rendering processes can be easily decoupled. In this work, we took advantage of this separability to implement the proposed distributed rendering framework. The particle generation process utilizes the functionalities provided by the KVS (Kyoto Visualization System), and the particle rendering process utilizes the functionalities provided by the HIVE (Heterogeneously Integrated Visual- analytics Environment). The proposed distributed visualization framework is targeted to work also on systems without any hardware graphics acceleration capability, which are commonly found on modern HPC operational environments. We evaluated this PBVR-based distributed visualization infrastructure on the K computer operational environment by utilizing a CPU-only processing server for the particle data generation and rendering. In this preliminary evaluation, using some CFD (Computational Fluid Dynamics) simulation data sets, we obtained encouraging results for pushing further the development in order to make this system available as an effective visualization alternative for the HPC users.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a distributed data visualization framework for HPC environments based on the PBVR (Particle Based Volume Rendering) method. The PBVR method is a kind of point-based rendering approach where the volumetric data to be visualized is represented as a set of small and opaque particles. This method has the object-space and image-space variants, defined by the place (object or image- space) where the particle data sets are generated. We focused on the object-space approach, which has the advantage when handling large-scale simulation data sets such as those generated by modern HPC systems. In the object-space approach, the particle generation and the subsequent rendering processes can be easily decoupled. In this work, we took advantage of this separability to implement the proposed distributed rendering framework. The particle generation process utilizes the functionalities provided by the KVS (Kyoto Visualization System), and the particle rendering process utilizes the functionalities provided by the HIVE (Heterogeneously Integrated Visual- analytics Environment). The proposed distributed visualization framework is targeted to work also on systems without any hardware graphics acceleration capability, which are commonly found on modern HPC operational environments. We evaluated this PBVR-based distributed visualization infrastructure on the K computer operational environment by utilizing a CPU-only processing server for the particle data generation and rendering. In this preliminary evaluation, using some CFD (Computational Fluid Dynamics) simulation data sets, we obtained encouraging results for pushing further the development in order to make this system available as an effective visualization alternative for the HPC users.",
"fno": "08035093",
"keywords": [
"Computational Fluid Dynamics",
"Data Visualisation",
"Digital Simulation",
"Parallel Processing",
"Rendering Computer Graphics",
"Distributed Data Visualization Framework",
"PBVR Method",
"Particle Based Volume Rendering",
"Volumetric Data",
"Opaque Particles",
"Image Space Variants",
"Particle Data Sets",
"Object Space Approach",
"Large Scale Simulation Data Sets",
"Modern HPC Systems",
"Particle Generation Process",
"Kyoto Visualization System",
"Particle Rendering Process",
"Heterogeneously Integrated Visual Analytics Environment",
"K Computer Operational Environment",
"Particle Data Generation",
"HPC Users",
"Distributed Particle Based Rendering Framework",
"HPC Operational Environments",
"KVS",
"HIVE",
"Hardware Graphics Acceleratin Capability",
"CFD Simulation Data Sets",
"Computational Fluid Dynamics",
"Data Visualization",
"Rendering Computer Graphics",
"Hardware",
"Distributed Databases",
"Libraries",
"Data Models",
"Computational Modeling",
"Parallel Rendering",
"Scientific Visualization",
"Particle Based Rendering",
"High Performance Visualization"
],
"authors": [
{
"affiliation": null,
"fullName": "Jorji Nonaka",
"givenName": "Jorji",
"surname": "Nonaka",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Naohisa Sakamoto",
"givenName": "Naohisa",
"surname": "Sakamoto",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Takashi Shimizu",
"givenName": "Takashi",
"surname": "Shimizu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Masahiro Fujita",
"givenName": "Masahiro",
"surname": "Fujita",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kenji Ono",
"givenName": "Kenji",
"surname": "Ono",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Koji Koyamada",
"givenName": "Koji",
"surname": "Koyamada",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hpcs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-07-01T00:00:00",
"pubType": "proceedings",
"pages": "300-307",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-3250-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08035092",
"articleId": "12OmNxFJXLU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08035094",
"articleId": "12OmNqBbHUD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sccompanion/2012/4956/0/4956b481",
"title": "Poster: Remote Visualization for Large-Scale Simulation Using Particle-Based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/sccompanion/2012/4956b481/12OmNAoUTbm",
"parentPublication": {
"id": "proceedings/sccompanion/2012/4956/0",
"title": "2012 SC Companion: High Performance Computing, Networking Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2017/5738/0/08031593",
"title": "Using interactive particle-based rendering to visualize a large-scale time-varying unstructured volume with mixed cell types",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2017/08031593/12OmNBRKwBs",
"parentPublication": {
"id": "proceedings/pacificvis/2017/5738/0",
"title": "2017 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isav/2016/3872/0/07836396",
"title": "In-Situ Visual Exploration of Multivariate Volume Data Based on Particle Based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/isav/2016/07836396/12OmNwHhoMV",
"parentPublication": {
"id": "proceedings/isav/2016/3872/0",
"title": "2016 Second Workshop on In-Situ Infrastructures for Enabling Extreme-Scale Analysis and Visualization (ISAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2002/1524/0/15240019",
"title": "Advanced Visualization Technology for Terascale Particle Accelerator Simulations",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2002/15240019/12OmNyKrHjh",
"parentPublication": {
"id": "proceedings/sc/2002/1524/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2016/8815/0/8815a276",
"title": "Performance Modeling of In Situ Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2016/8815a276/12OmNyTfg9O",
"parentPublication": {
"id": "proceedings/sc/2016/8815/0",
"title": "SC16: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017605",
"title": "Screen-Space Normal Distribution Function Caching for Consistent Multi-Resolution Rendering of Large Particle Data",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017605/13rRUxly9dZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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": "trans/tg/2015/02/06881728",
"title": "MegaMol—A Prototyping Framework for Particle-Based Visualization",
"doi": null,
"abstractUrl": "/journal/tg/2015/02/06881728/13rRUygT7n0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2019/2605/0/08944369",
"title": "PxStream: Remote Visualization for Distributed Rendering Frameworks",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2019/08944369/1grOFLtqVIk",
"parentPublication": {
"id": "proceedings/ldav/2019/2605/0",
"title": "2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/01/09552900",
"title": "Probabilistic Occlusion Culling using Confidence Maps for High-Quality Rendering of Large Particle Data",
"doi": null,
"abstractUrl": "/journal/tg/2022/01/09552900/1xic6f4Sc6I",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNs4S8wj",
"title": "Second IEEE International Information Assurance Workshop (IWIA'04)",
"acronym": "iwia",
"groupId": "1000360",
"volume": "0",
"displayVolume": "0",
"year": "2004",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB0X8ti",
"doi": "10.1109/IWIA.2004.1288044",
"title": "A Role-Based Trust Model for Peer-to-Peer Communities and Dynamic Coalitions",
"normalizedTitle": "A Role-Based Trust Model for Peer-to-Peer Communities and Dynamic Coalitions",
"abstract": "Although P2P systems are usually used for information exchange between peers, they have either protected peers' anonymity, or required transacting peers to trust each other implicitly. Both these approaches are vulnerable to attacks by malicious peers who could abuse the P2P system to spread viruses, incorrect, or damaging information. In this paper, we propose an approach for trust management in P2P systems. We introduce an optimistic role-based model for trust amongst peers and show that it is scalable, dynamic, revocable, secure and transitive. Our proposed solution permits asymmetric trust relationships that can be verified by any peer in the system through a simple, low-cost algorithm. This paper introduces a metric known as iComplex that combines a peer's trust value for each of its roles into a single, relative, probabilistic guarantee of trust. Finally, we discuss how our trust model allows peers to revoke relationships with malicious peers, and the non-repudiation of peer relations. We use simulations to illustrate the trust value distribution amongst peers in the network. Our analysis and experiments demonstrates the low-cost involved to verify and validate trust values. Lastly, we establish the effectiveness of using sum as the aggregation function to combine trust values of a peer.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Although P2P systems are usually used for information exchange between peers, they have either protected peers' anonymity, or required transacting peers to trust each other implicitly. Both these approaches are vulnerable to attacks by malicious peers who could abuse the P2P system to spread viruses, incorrect, or damaging information. In this paper, we propose an approach for trust management in P2P systems. We introduce an optimistic role-based model for trust amongst peers and show that it is scalable, dynamic, revocable, secure and transitive. Our proposed solution permits asymmetric trust relationships that can be verified by any peer in the system through a simple, low-cost algorithm. This paper introduces a metric known as iComplex that combines a peer's trust value for each of its roles into a single, relative, probabilistic guarantee of trust. Finally, we discuss how our trust model allows peers to revoke relationships with malicious peers, and the non-repudiation of peer relations. We use simulations to illustrate the trust value distribution amongst peers in the network. Our analysis and experiments demonstrates the low-cost involved to verify and validate trust values. Lastly, we establish the effectiveness of using sum as the aggregation function to combine trust values of a peer.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Although P2P systems are usually used for information exchange between peers, they have either protected peers' anonymity, or required transacting peers to trust each other implicitly. Both these approaches are vulnerable to attacks by malicious peers who could abuse the P2P system to spread viruses, incorrect, or damaging information. In this paper, we propose an approach for trust management in P2P systems. We introduce an optimistic role-based model for trust amongst peers and show that it is scalable, dynamic, revocable, secure and transitive. Our proposed solution permits asymmetric trust relationships that can be verified by any peer in the system through a simple, low-cost algorithm. This paper introduces a metric known as iComplex that combines a peer's trust value for each of its roles into a single, relative, probabilistic guarantee of trust. Finally, we discuss how our trust model allows peers to revoke relationships with malicious peers, and the non-repudiation of peer relations. We use simulations to illustrate the trust value distribution amongst peers in the network. Our analysis and experiments demonstrates the low-cost involved to verify and validate trust values. Lastly, we establish the effectiveness of using sum as the aggregation function to combine trust values of a peer.",
"fno": "21170141",
"keywords": [
"Communities",
"Dynamic Coalitions",
"Peer To Peer",
"Trust"
],
"authors": [
{
"affiliation": "Microsoft Corporation",
"fullName": "Mujtaba Khambatti",
"givenName": "Mujtaba",
"surname": "Khambatti",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Arizona State University",
"fullName": "Partha Dasgupta",
"givenName": "Partha",
"surname": "Dasgupta",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Arizona State University",
"fullName": "Kyung Dong Ryu",
"givenName": "Kyung Dong",
"surname": "Ryu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iwia",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2004-04-01T00:00:00",
"pubType": "proceedings",
"pages": "141",
"year": "2004",
"issn": "1527-1366",
"isbn": "0-7695-2205-X",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "21170129",
"articleId": "12OmNyv7mjp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "21170155",
"articleId": "12OmNzWfp52",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icmecg/2008/3366/0/3366a399",
"title": "A New Security Trust Model for Peer-to-Peer E-Commerce",
"doi": null,
"abstractUrl": "/proceedings-article/icmecg/2008/3366a399/12OmNApu5KA",
"parentPublication": {
"id": "proceedings/icmecg/2008/3366/0",
"title": "Management of e-Commerce and e-Government, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscsct/2008/3498/2/3498b175",
"title": "Hierarchical Fuzzy Trust Management for Customer-to-Customer in Peer-to-Peer eCommerce",
"doi": null,
"abstractUrl": "/proceedings-article/iscsct/2008/3498b175/12OmNBQTJfY",
"parentPublication": {
"id": "proceedings/iscsct/2008/3498/1",
"title": "2008 International Symposium on Computer Science and Computational Technology (ISCSCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/colcom/2005/0030/0/01651236",
"title": "Q-Chain: building reputation based trust chains in decentralized peer-to-peer networks",
"doi": null,
"abstractUrl": "/proceedings-article/colcom/2005/01651236/12OmNrAv3Ju",
"parentPublication": {
"id": "proceedings/colcom/2005/0030/0",
"title": "International Conference on Collaborative Computing: Networking, Applications and Worksharing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2006/2641/0/26410687",
"title": "Developing and Managing Trust in Peer-to-Peer Systems",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2006/26410687/12OmNrJAdVc",
"parentPublication": {
"id": "proceedings/dexa/2006/2641/0",
"title": "17th International Workshop on Database and Expert Systems Applications (DEXA'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwias/2004/2117/0/01288044",
"title": "A role-based trust model for peer-to-peer communities and dynamic coalitions",
"doi": null,
"abstractUrl": "/proceedings-article/iwias/2004/01288044/12OmNvDZEY4",
"parentPublication": {
"id": "proceedings/iwias/2004/2117/0",
"title": "Proceedings. Second IEEE International Information Assurance Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icee/2010/3997/0/3997b687",
"title": "Trust-Based Robust Mechanism in Peer-to-peer Computing",
"doi": null,
"abstractUrl": "/proceedings-article/icee/2010/3997b687/12OmNx6xHkG",
"parentPublication": {
"id": "proceedings/icee/2010/3997/0",
"title": "International Conference on E-Business and E-Government",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/5/3336j213",
"title": "Voting Agreement Based Trust Model for Peer-to-Peer E-commerce",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336j213/12OmNyvoXaQ",
"parentPublication": {
"id": "proceedings/csse/2008/3336/5",
"title": "2008 International Conference on Computer Science and Software Engineering (CSSE 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2009/01/ttd2009010083",
"title": "Heuristic Discovery of Role-Based Trust Chains in Peer-to-Peer Networks",
"doi": null,
"abstractUrl": "/journal/td/2009/01/ttd2009010083/13rRUxcKzUZ",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2004/07/k0843",
"title": "PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities",
"doi": null,
"abstractUrl": "/journal/tk/2004/07/k0843/13rRUyeTVih",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwia/2004/2117/0/01288044",
"title": "A role-based trust model for peer-to-peer communities and dynamic coalitions",
"doi": null,
"abstractUrl": "/proceedings-article/iwia/2004/01288044/1iES7yeuly0",
"parentPublication": {
"id": "proceedings/iwia/2004/2117/0",
"title": "Second IEEE International Information Assurance Workshop (IWIA'04)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvStcTJ",
"title": "Information and Multimedia Technology, International Conference on",
"acronym": "icimt",
"groupId": "1003080",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB0nWfN",
"doi": "10.1109/ICIMT.2009.50",
"title": "An Adaptive Architecture for Personalized Search ?Engine in Ubiquitous Environment with Peer to Peer Systems",
"normalizedTitle": "An Adaptive Architecture for Personalized Search ?Engine in Ubiquitous Environment with Peer to Peer Systems",
"abstract": "Future ubiquitous environments will be emerged over many of the computers that are dynamically networked. The personalized data collected by ubiquitous environment provide important information for ubiquitous applications. This type of application will form a peer to peer system over the Internet to offer common services. Providing architecture for large-scale personalized peer to peer information retrieval, e. g. personalized searching of the ubiquitous environment is an appealing application for Peer to Peer systems. In this paper, we propose an adaptive architecture to structure Peer to Peer systems. An Adaptive Architecture for personalized information retrieval considering user’s profile is important. We present the first architecture for personalized information retrieval in ubiquitous environment with peer-to-peer systems. This paper introduces a novel overlay design architecture, called AIR (Adaptive Information Retrieval), for efficient, scalable, collaborative, adaptive and personalized information retrieval.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Future ubiquitous environments will be emerged over many of the computers that are dynamically networked. The personalized data collected by ubiquitous environment provide important information for ubiquitous applications. This type of application will form a peer to peer system over the Internet to offer common services. Providing architecture for large-scale personalized peer to peer information retrieval, e. g. personalized searching of the ubiquitous environment is an appealing application for Peer to Peer systems. In this paper, we propose an adaptive architecture to structure Peer to Peer systems. An Adaptive Architecture for personalized information retrieval considering user’s profile is important. We present the first architecture for personalized information retrieval in ubiquitous environment with peer-to-peer systems. This paper introduces a novel overlay design architecture, called AIR (Adaptive Information Retrieval), for efficient, scalable, collaborative, adaptive and personalized information retrieval.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Future ubiquitous environments will be emerged over many of the computers that are dynamically networked. The personalized data collected by ubiquitous environment provide important information for ubiquitous applications. This type of application will form a peer to peer system over the Internet to offer common services. Providing architecture for large-scale personalized peer to peer information retrieval, e. g. personalized searching of the ubiquitous environment is an appealing application for Peer to Peer systems. In this paper, we propose an adaptive architecture to structure Peer to Peer systems. An Adaptive Architecture for personalized information retrieval considering user’s profile is important. We present the first architecture for personalized information retrieval in ubiquitous environment with peer-to-peer systems. This paper introduces a novel overlay design architecture, called AIR (Adaptive Information Retrieval), for efficient, scalable, collaborative, adaptive and personalized information retrieval.",
"fno": "3922a107",
"keywords": [
"Ubiquitous Environment",
"Personalization",
"Peer To Peer"
],
"authors": [
{
"affiliation": null,
"fullName": "Alimohammad Saghiri",
"givenName": "Alimohammad",
"surname": "Saghiri",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Alireza Bagheri",
"givenName": "Alireza",
"surname": "Bagheri",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icimt",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-12-01T00:00:00",
"pubType": "proceedings",
"pages": "107-111",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3922-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3922a099",
"articleId": "12OmNzwHviR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3922a112",
"articleId": "12OmNywfKCc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pccc/2004/8396/0/01395013",
"title": "Coopeer: a peer-to-peer Web search engine towards collaboration, humanization and personalization",
"doi": null,
"abstractUrl": "/proceedings-article/pccc/2004/01395013/12OmNqJq4yh",
"parentPublication": {
"id": "proceedings/pccc/2004/8396/0",
"title": "Conference Proceedings of the 2004 IEEE International Performance, Computing, and Communications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2008/3099/0/3099a615",
"title": "Personalized Negotiation Based on Individualization: Incorporating Personalization into Peer-to-Peer System",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2008/3099a615/12OmNrkjVgy",
"parentPublication": {
"id": "proceedings/itng/2008/3099/0",
"title": "2008 5th International Conference on Information Technology: New Generation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wetice/2008/3315/0/3315a099",
"title": "Personalized Recommendations in Peer-to-Peer Systems",
"doi": null,
"abstractUrl": "/proceedings-article/wetice/2008/3315a099/12OmNvFpEyV",
"parentPublication": {
"id": "proceedings/wetice/2008/3315/0",
"title": "2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mobiquitous/2006/0498/0/04141791",
"title": "Ubiquitous Access Control and Policy Management in Personal Networks",
"doi": null,
"abstractUrl": "/proceedings-article/mobiquitous/2006/04141791/12OmNvs4vta",
"parentPublication": {
"id": "proceedings/mobiquitous/2006/0498/0",
"title": "2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2008/3167/0/3167a097",
"title": "A Model of Personalized Collaborative Computer Support Ubiquitous Learning Environment",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2008/3167a097/12OmNxd4tlq",
"parentPublication": {
"id": "proceedings/icalt/2008/3167/0",
"title": "IEEE International Conference on Advanced Learning Technologies (ICALT 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/incos/2009/3858/0/05370941",
"title": "A Personalized Device Recommender System in Ubiquitous Environments",
"doi": null,
"abstractUrl": "/proceedings-article/incos/2009/05370941/12OmNyrqzrG",
"parentPublication": {
"id": "proceedings/incos/2009/3858/0",
"title": "Intelligent Networking and Collaborative Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2011/4367/0/4367a632",
"title": "An Adaptive and Personalized Ubiquitous Learning Middleware Support for Handicapped Learners",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2011/4367a632/12OmNzDvSph",
"parentPublication": {
"id": "proceedings/itng/2011/4367/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/2009/02/tsc2009020140",
"title": "Personalized Recommendation over a Customer Network for Ubiquitous Shopping",
"doi": null,
"abstractUrl": "/journal/sc/2009/02/tsc2009020140/13rRUEgJDyr",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2009/01/mpc2009010058",
"title": "Personalized Service Discovery in Ubiquitous Computing Environments",
"doi": null,
"abstractUrl": "/magazine/pc/2009/01/mpc2009010058/13rRUEgs2qH",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wmte/2006/2723/0/04032534",
"title": "Learner-Space Knowledge Awareness Map in Computer Supported Ubiquitous Learning",
"doi": null,
"abstractUrl": "/proceedings-article/wmte/2006/04032534/17D45Wt3ExE",
"parentPublication": {
"id": "proceedings/wmte/2006/2723/0",
"title": "4th International Workshop on Wireless, Mobile and Ubiquitous Technology in Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwvVrMQ",
"title": "2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops",
"acronym": "waina",
"groupId": "1001766",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBDQbeK",
"doi": "10.1109/WAINA.2010.163",
"title": "A P2P Network Construction Method Based on Cycle of Sensing in Ubiquitous Sensor Environment",
"normalizedTitle": "A P2P Network Construction Method Based on Cycle of Sensing in Ubiquitous Sensor Environment",
"abstract": "Recent advance in ubiquitous technology has led the development of ubiquitous sensor environment in which various kinds of sensor devices provide sensor data. In this environment, since an enormous number of sensor devices join the network, it is effective to construct a P2P network for efficient retrieval of sensor data. In general, each sensor device periodically performs sensing based on the cycle set by itself. On the other hand, users often issue queries to acquire sensor data that were sensed at a specific time. In such a case, only the sensor devices (peers) that perform sensing at the specified time have to return their sensor readings. In this paper, we propose a novel P2P network construction method to achieve effective sensor data collection considering queries that specify a certain time. Our method clusters peers which perform sensing simultaneously, and constructs logical links between clusters whose peers sometimes perform sensing at a same time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent advance in ubiquitous technology has led the development of ubiquitous sensor environment in which various kinds of sensor devices provide sensor data. In this environment, since an enormous number of sensor devices join the network, it is effective to construct a P2P network for efficient retrieval of sensor data. In general, each sensor device periodically performs sensing based on the cycle set by itself. On the other hand, users often issue queries to acquire sensor data that were sensed at a specific time. In such a case, only the sensor devices (peers) that perform sensing at the specified time have to return their sensor readings. In this paper, we propose a novel P2P network construction method to achieve effective sensor data collection considering queries that specify a certain time. Our method clusters peers which perform sensing simultaneously, and constructs logical links between clusters whose peers sometimes perform sensing at a same time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent advance in ubiquitous technology has led the development of ubiquitous sensor environment in which various kinds of sensor devices provide sensor data. In this environment, since an enormous number of sensor devices join the network, it is effective to construct a P2P network for efficient retrieval of sensor data. In general, each sensor device periodically performs sensing based on the cycle set by itself. On the other hand, users often issue queries to acquire sensor data that were sensed at a specific time. In such a case, only the sensor devices (peers) that perform sensing at the specified time have to return their sensor readings. In this paper, we propose a novel P2P network construction method to achieve effective sensor data collection considering queries that specify a certain time. Our method clusters peers which perform sensing simultaneously, and constructs logical links between clusters whose peers sometimes perform sensing at a same time.",
"fno": "4019a950",
"keywords": [
"Peer To Peer",
"Sensor Network",
"Cycle Of Sensing"
],
"authors": [
{
"affiliation": null,
"fullName": "Yoshihiro Kosaka",
"givenName": "Yoshihiro",
"surname": "Kosaka",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Akimitsu Kanzaki",
"givenName": "Akimitsu",
"surname": "Kanzaki",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Takahiro Hara",
"givenName": "Takahiro",
"surname": "Hara",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shojiro Nishio",
"givenName": "Shojiro",
"surname": "Nishio",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "waina",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-04-01T00:00:00",
"pubType": "proceedings",
"pages": "950-955",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4019-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4019a944",
"articleId": "12OmNzzxuvN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4019a956",
"articleId": "12OmNyTwRgg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iscc/2017/1629/0/08024600",
"title": "Resource-constrained P2P streaming overlay construction for efficient joining under flash crowds",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2017/08024600/12OmNBSSVls",
"parentPublication": {
"id": "proceedings/iscc/2017/1629/0",
"title": "2017 IEEE Symposium on Computers and Communications (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gcc/2010/4313/0/4313a235",
"title": "Fair Exchange Mechanism for P2P Systems",
"doi": null,
"abstractUrl": "/proceedings-article/gcc/2010/4313a235/12OmNqIhG3b",
"parentPublication": {
"id": "proceedings/gcc/2010/4313/0",
"title": "Grid and Cloud Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2011/4338/0/4338a532",
"title": "A P2P Network Construction Method Based on Cycle of Sensing and Location in Ubiquitous Sensor Environment",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2011/4338a532/12OmNrAv3QL",
"parentPublication": {
"id": "proceedings/waina/2011/4338/0",
"title": "2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saint/2008/3297/0/3297a417",
"title": "An Implementation Methodology of Geographical Location Based Peer-to-peer Networks for Managing Ubiquitous Sensors",
"doi": null,
"abstractUrl": "/proceedings-article/saint/2008/3297a417/12OmNs0TKNE",
"parentPublication": {
"id": "proceedings/saint/2008/3297/0",
"title": "2008 International Symposium on Applications and the Internet",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nswctc/2009/3610/2/3610b715",
"title": "An Incentive Mechanism Using Game Theory for P2P Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nswctc/2009/3610b715/12OmNwErpvD",
"parentPublication": {
"id": "proceedings/nswctc/2009/3610/2",
"title": "Networks Security, Wireless Communications and Trusted Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ainaw/2008/3096/0/3096a489",
"title": "WindChimer: The Partially Centralized and Controlled P2P System for Better Discovery",
"doi": null,
"abstractUrl": "/proceedings-article/ainaw/2008/3096a489/12OmNykTNlY",
"parentPublication": {
"id": "proceedings/ainaw/2008/3096/0",
"title": "2008 22nd International Conference on Advanced Information Networking and Applications (AINA 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2006/2466/2/246620702",
"title": "A Multilayer Topic-Group based P2P Network",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2006/246620702/12OmNz5JBOG",
"parentPublication": {
"id": "proceedings/aina/2006/2466/2",
"title": "20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmc/2010/3989/1/3989a309",
"title": "Enhanced Context Searching Based on Structured P2P",
"doi": null,
"abstractUrl": "/proceedings-article/cmc/2010/3989a309/12OmNzDNtun",
"parentPublication": {
"id": "proceedings/cmc/2010/3989/1",
"title": "Communications and Mobile Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sisap/2009/3765/0/3765a124",
"title": "Dynamic P2P Indexing and Search Based on Compact Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/sisap/2009/3765a124/12OmNzwHvpc",
"parentPublication": {
"id": "proceedings/sisap/2009/3765/0",
"title": "Similarity Search and Applications, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2010/10/ttd2010101473",
"title": "Group-Based Negotiations in P2P Systems",
"doi": null,
"abstractUrl": "/journal/td/2010/10/ttd2010101473/13rRUy3gn74",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvoWV2I",
"title": "International Symposium on Parallel and Distributed Processing with Applications",
"acronym": "ispa",
"groupId": "1002557",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBEYzMu",
"doi": "10.1109/ISPA.2011.26",
"title": "A Two-Level Caching Protocol for Hierarchical Peer-to-Peer File Sharing Systems",
"normalizedTitle": "A Two-Level Caching Protocol for Hierarchical Peer-to-Peer File Sharing Systems",
"abstract": "In hierarchical Peer-to-Peer (P2P) systems, several selected peers are promoted as super-peers to provide an efficient lookup service for the ordinary peers, although it would cause a service bottleneck and a heavy workload at the point of the promoted peers. In this paper, we propose a two-level caching architecture consisting of level-1 cache and level-2 cache to relax such bottlenecks in hierarchical P2Ps. Each cache is partitioned into two parts so that it could manage both of static and dynamic data in a space-efficient manner, where static data indicates popular pages which are frequently requested by many users and dynamic data indicates pages which may not be popular but repeatedly requested during a short time period. The performance of the proposed method is evaluated by simulation. The result indicates that our caching protocol significantly reduces the network traffic and exhibits a high hit rate even in small cache sizes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In hierarchical Peer-to-Peer (P2P) systems, several selected peers are promoted as super-peers to provide an efficient lookup service for the ordinary peers, although it would cause a service bottleneck and a heavy workload at the point of the promoted peers. In this paper, we propose a two-level caching architecture consisting of level-1 cache and level-2 cache to relax such bottlenecks in hierarchical P2Ps. Each cache is partitioned into two parts so that it could manage both of static and dynamic data in a space-efficient manner, where static data indicates popular pages which are frequently requested by many users and dynamic data indicates pages which may not be popular but repeatedly requested during a short time period. The performance of the proposed method is evaluated by simulation. The result indicates that our caching protocol significantly reduces the network traffic and exhibits a high hit rate even in small cache sizes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In hierarchical Peer-to-Peer (P2P) systems, several selected peers are promoted as super-peers to provide an efficient lookup service for the ordinary peers, although it would cause a service bottleneck and a heavy workload at the point of the promoted peers. In this paper, we propose a two-level caching architecture consisting of level-1 cache and level-2 cache to relax such bottlenecks in hierarchical P2Ps. Each cache is partitioned into two parts so that it could manage both of static and dynamic data in a space-efficient manner, where static data indicates popular pages which are frequently requested by many users and dynamic data indicates pages which may not be popular but repeatedly requested during a short time period. The performance of the proposed method is evaluated by simulation. The result indicates that our caching protocol significantly reduces the network traffic and exhibits a high hit rate even in small cache sizes.",
"fno": "4428a195",
"keywords": [
"Peer To Peer",
"Super Peer",
"Cache"
],
"authors": [
{
"affiliation": null,
"fullName": "Qiying Wei",
"givenName": "Qiying",
"surname": "Wei",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Tingting Qin",
"givenName": "Tingting",
"surname": "Qin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Satoshi Fujita",
"givenName": "Satoshi",
"surname": "Fujita",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ispa",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-05-01T00:00:00",
"pubType": "proceedings",
"pages": "195-200",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4428-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4428a189",
"articleId": "12OmNwekjEr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4428a201",
"articleId": "12OmNzXFoIa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/perser/2005/9032/0/01506408",
"title": "Reliable file sharing scheme for mobile peer-to-peer users using epidemic selective caching",
"doi": null,
"abstractUrl": "/proceedings-article/perser/2005/01506408/12OmNAKuoSJ",
"parentPublication": {
"id": "proceedings/perser/2005/9032/0",
"title": "Proceedings. International Conference on Pervasive Services 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispan/2008/3125/0/3125a059",
"title": "M-Ring: A Distributed, Self-Organized, Load-Balanced Communication Method on Super Peer Network",
"doi": null,
"abstractUrl": "/proceedings-article/ispan/2008/3125a059/12OmNAtaS1T",
"parentPublication": {
"id": "proceedings/ispan/2008/3125/0",
"title": "Parallel Architectures, Algorithms, and Networks, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2008/3172/0/3172a168",
"title": "Peer-to-Peer File Sharing Based on Network Coding",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2008/3172a168/12OmNvxbhK8",
"parentPublication": {
"id": "proceedings/icdcs/2008/3172/0",
"title": "2008 The 28th International Conference on Distributed Computing Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candar/2013/2796/0/06726896",
"title": "Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing Systems",
"doi": null,
"abstractUrl": "/proceedings-article/candar/2013/06726896/12OmNwFicTO",
"parentPublication": {
"id": "proceedings/candar/2013/2796/0",
"title": "2013 First International Symposium on Computing and Networking - Across Practical Development and Theoretical Research (CANDAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2011/4569/0/4569a302",
"title": "File Diffusion Time as Function of Peer Speed Distribution in BitTorrent-Like Networks with Super-Seed Mode",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2011/4569a302/12OmNxFJXUE",
"parentPublication": {
"id": "proceedings/icnc/2011/4569/0",
"title": "2011 Second International Conference on Networking and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pccc/2005/8991/0/01460541",
"title": "Efficient file sharing strategy in DHT based P2P systems",
"doi": null,
"abstractUrl": "/proceedings-article/pccc/2005/01460541/12OmNyLA5Aw",
"parentPublication": {
"id": "proceedings/pccc/2005/8991/0",
"title": "Conference Proceedings of the 2005 IEEE International Performance, Computing and Communications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpads/2008/3434/0/3434a344",
"title": "Maximizing Download Bandwidth for File Sharing in BitTorrent-like Peer-to-Peer Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icpads/2008/3434a344/12OmNyTfgaa",
"parentPublication": {
"id": "proceedings/icpads/2008/3434/0",
"title": "2008 14th IEEE International Conference on Parallel and Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/incos/2011/4579/0/4579a344",
"title": "Efficient Contents Sharing Using Differences between Versions in Peer-to-Peer Networks",
"doi": null,
"abstractUrl": "/proceedings-article/incos/2011/4579a344/12OmNylsZTB",
"parentPublication": {
"id": "proceedings/incos/2011/4579/0",
"title": "Intelligent Networking and Collaborative Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcw/2005/2455/0/01541211",
"title": "A two-level semantic caching scheme for super-peer networks",
"doi": null,
"abstractUrl": "/proceedings-article/wcw/2005/01541211/12OmNz4SOva",
"parentPublication": {
"id": "proceedings/wcw/2005/2455/0",
"title": "10th International Workshop on Web Content Caching and Distribution",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2014/08/06497042",
"title": "Applying Network Coding to Peer-to-Peer File Sharing",
"doi": null,
"abstractUrl": "/journal/tc/2014/08/06497042/13rRUwI5U21",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8wTfI",
"title": "Proceedings First International Conference on Peer-to-Peer Computing",
"acronym": "p2p",
"groupId": "1000546",
"volume": "0",
"displayVolume": "0",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCcKQC8",
"doi": "10.1109/P2P.2001.990428",
"title": "An XML-based Middleware for Peer-to-Peer computing",
"normalizedTitle": "An XML-based Middleware for Peer-to-Peer computing",
"abstract": "An increasing number of distributed applications will be written for mobile hosts, such as laptop computers, third generation mobile phones, personal digital assistants, watches and the like, with focus on peer-to-peer collaboration. Application engineers have to deal with a new set of problems caused by mobility, such as low bandwidth, context changes or loss of connectivity. During disconnection, independently from each others, users will typically update local replicas of shared data, possibly generated by peers. The resulting inconsistent replicas need to be reconciled upon re-connection. To support building mobile applications that use both replication and reconciliation over ad-hoc networks, we have designed XMIDDLE, a peer-topeer middleware that targets mobile computing settings. In this paper we describe XMIDDLE and give a flavour of how reflection capabilities are used to allow application engineers to influence replication and reconciliation techniques. XMIDDLE enables the transparent sharing of XML documents across heterogeneous mobile peers, allowing on-line and off-line access to data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An increasing number of distributed applications will be written for mobile hosts, such as laptop computers, third generation mobile phones, personal digital assistants, watches and the like, with focus on peer-to-peer collaboration. Application engineers have to deal with a new set of problems caused by mobility, such as low bandwidth, context changes or loss of connectivity. During disconnection, independently from each others, users will typically update local replicas of shared data, possibly generated by peers. The resulting inconsistent replicas need to be reconciled upon re-connection. To support building mobile applications that use both replication and reconciliation over ad-hoc networks, we have designed XMIDDLE, a peer-topeer middleware that targets mobile computing settings. In this paper we describe XMIDDLE and give a flavour of how reflection capabilities are used to allow application engineers to influence replication and reconciliation techniques. XMIDDLE enables the transparent sharing of XML documents across heterogeneous mobile peers, allowing on-line and off-line access to data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An increasing number of distributed applications will be written for mobile hosts, such as laptop computers, third generation mobile phones, personal digital assistants, watches and the like, with focus on peer-to-peer collaboration. Application engineers have to deal with a new set of problems caused by mobility, such as low bandwidth, context changes or loss of connectivity. During disconnection, independently from each others, users will typically update local replicas of shared data, possibly generated by peers. The resulting inconsistent replicas need to be reconciled upon re-connection. To support building mobile applications that use both replication and reconciliation over ad-hoc networks, we have designed XMIDDLE, a peer-topeer middleware that targets mobile computing settings. In this paper we describe XMIDDLE and give a flavour of how reflection capabilities are used to allow application engineers to influence replication and reconciliation techniques. XMIDDLE enables the transparent sharing of XML documents across heterogeneous mobile peers, allowing on-line and off-line access to data.",
"fno": "15030069",
"keywords": [
"Mobile Computing",
"Middleware",
"Meta Data",
"Peer To Peer"
],
"authors": [
{
"affiliation": "University College London",
"fullName": "Cecilia Mascolo",
"givenName": "Cecilia",
"surname": "Mascolo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University College London",
"fullName": "Licia Capra",
"givenName": "Licia",
"surname": "Capra",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University College London",
"fullName": "Wolfgang Emmerich",
"givenName": "Wolfgang",
"surname": "Emmerich",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "p2p",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-08-01T00:00:00",
"pubType": "proceedings",
"pages": "0069",
"year": "2001",
"issn": null,
"isbn": "0-7695-1503-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "15030062",
"articleId": "12OmNvpew4p",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "15030075",
"articleId": "12OmNApu5hA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.