data
dict |
|---|
{
"proceeding": {
"id": "12OmNyGbI52",
"title": "2018 IEEE International Conference on Computational Photography (ICCP)",
"acronym": "iccp",
"groupId": "1800125",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzkMlWO",
"doi": "10.1109/ICCPHOT.2018.8368461",
"title": "Acquiring and characterizing plane-to-ray indirect light transport",
"normalizedTitle": "Acquiring and characterizing plane-to-ray indirect light transport",
"abstract": "Separation of light transport into direct and indirect paths has enabled new visualizations of light in everyday scenes. However, indirect light itself contains a variety of components from subsurface scattering to diffuse and specular interreflections, all of which contribute to complex visual appearance. In this paper, we present a new imaging technique that captures and analyzes these components of indirect light via light transport between epipolar planes of illumination and rays of received light. This plane-to-ray light transport is captured using a rectified projector-camera system where we vary the offset between projector and camera rows (implemented as synchronization delay) as well as the exposure of each camera row. The resulting delay-exposure stack of images can capture live short and long-range indirect light transport, disambiguate subsurface scattering, diffuse and specular interreflections, and distinguish materials according to their subsurface scattering properties.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Separation of light transport into direct and indirect paths has enabled new visualizations of light in everyday scenes. However, indirect light itself contains a variety of components from subsurface scattering to diffuse and specular interreflections, all of which contribute to complex visual appearance. In this paper, we present a new imaging technique that captures and analyzes these components of indirect light via light transport between epipolar planes of illumination and rays of received light. This plane-to-ray light transport is captured using a rectified projector-camera system where we vary the offset between projector and camera rows (implemented as synchronization delay) as well as the exposure of each camera row. The resulting delay-exposure stack of images can capture live short and long-range indirect light transport, disambiguate subsurface scattering, diffuse and specular interreflections, and distinguish materials according to their subsurface scattering properties.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Separation of light transport into direct and indirect paths has enabled new visualizations of light in everyday scenes. However, indirect light itself contains a variety of components from subsurface scattering to diffuse and specular interreflections, all of which contribute to complex visual appearance. In this paper, we present a new imaging technique that captures and analyzes these components of indirect light via light transport between epipolar planes of illumination and rays of received light. This plane-to-ray light transport is captured using a rectified projector-camera system where we vary the offset between projector and camera rows (implemented as synchronization delay) as well as the exposure of each camera row. The resulting delay-exposure stack of images can capture live short and long-range indirect light transport, disambiguate subsurface scattering, diffuse and specular interreflections, and distinguish materials according to their subsurface scattering properties.",
"fno": "08368461",
"keywords": [
"Cameras",
"Lighting",
"Delays",
"Synchronization",
"Multiplexing",
"Scattering"
],
"authors": [
{
"affiliation": "Nara Institute of Science and Technology",
"fullName": "Hiroyuki Kubo",
"givenName": "Hiroyuki",
"surname": "Kubo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Carnegie Mellon University",
"fullName": "Suren Jayasuriya",
"givenName": "Suren",
"surname": "Jayasuriya",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nara Institute of Science and Technology",
"fullName": "Takafumi Iwaguchi",
"givenName": "Takafumi",
"surname": "Iwaguchi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nara Institute of Science and Technology",
"fullName": "Takuya Funatomi",
"givenName": "Takuya",
"surname": "Funatomi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nara Institute of Science and Technology",
"fullName": "Yasuhiro Mukaigawa",
"givenName": "Yasuhiro",
"surname": "Mukaigawa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Carnegie Mellon University",
"fullName": "Srinivasa G. Narasimhan",
"givenName": "Srinivasa G.",
"surname": "Narasimhan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-05-01T00:00:00",
"pubType": "proceedings",
"pages": "1-10",
"year": "2018",
"issn": "2472-7636",
"isbn": "978-1-5386-2526-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "08368462",
"articleId": "12OmNrAv3PS",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/nicoint/2016/2305/0/2305a182",
"title": "Acquiring Curvature-Dependent Reflectance Function from Translucent Material",
"doi": null,
"abstractUrl": "/proceedings-article/nicoint/2016/2305a182/12OmNAnMuJp",
"parentPublication": {
"id": "proceedings/nicoint/2016/2305/0",
"title": "2016 Nicograph International (NicoInt)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2017/2089/0/2089a056",
"title": "Voxel-Based Interactive Rendering of Translucent Materials under Area Lights Using Sparse Samples",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2017/2089a056/12OmNvDqsQf",
"parentPublication": {
"id": "proceedings/cw/2017/2089/0",
"title": "2017 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2012/1226/0/047O1A02",
"title": "Decomposing global light transport using time of flight imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/047O1A02/12OmNwCJOTg",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vg/2005/26/0/01500525",
"title": "A simplified model for inhomogeneous subsurface scattering",
"doi": null,
"abstractUrl": "/proceedings-article/vg/2005/01500525/12OmNzRZq0C",
"parentPublication": {
"id": "proceedings/vg/2005/26/0",
"title": "Volume Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761892",
"title": "Analysis of subsurface scattering under generic illumination",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761892/12OmNzd7bV9",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2013/03/mcg2013030066",
"title": "Double- and Multiple-Scattering Effects in Translucent Materials",
"doi": null,
"abstractUrl": "/magazine/cg/2013/03/mcg2013030066/13rRUIJcWfX",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/07/06658758",
"title": "Translucent Radiosity: Efficiently CombiningDiffuse Inter-Reflection andSubsurface Scattering",
"doi": null,
"abstractUrl": "/journal/tg/2014/07/06658758/13rRUwInvJg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/03/v0620",
"title": "Physics-Based Subsurface Visualization of Human Tissue",
"doi": null,
"abstractUrl": "/journal/tg/2007/03/v0620/13rRUwwaKsY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/07/08600345",
"title": "Precomputed Multiple Scattering for Rapid Light Simulation in Participating Media",
"doi": null,
"abstractUrl": "/journal/tg/2020/07/08600345/17D45Xh13tH",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08877764",
"title": "Programmable Non-Epipolar Indirect Light Transport: Capture and Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08877764/1emy95qb1NS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1BmEezmpGrm",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1BmLtCLCybe",
"doi": "10.1109/ICCV48922.2021.00244",
"title": "Virtual light transport matrices for non-line-of-sight imaging",
"normalizedTitle": "Virtual light transport matrices for non-line-of-sight imaging",
"abstract": "The light transport matrix (LTM) is an instrumental tool in line-of-sight (LOS) imaging, describing how light interacts with the scene and enabling applications such as relighting or separation of illumination components. We introduce a framework to estimate the LTM of non-line-of-sight (NLOS) scenarios, coupling recent virtual forward light propagation models for NLOS imaging with the LOS light transport equation. We design computational projector-camera setups, and use these virtual imaging systems to estimate the transport matrix of hidden scenes. We introduce the specific illumination functions to compute the different elements of the matrix, overcoming the challenging wide-aperture conditions of NLOS setups. Our NLOS light transport matrix allows us to (re)illuminate specific locations of a hidden scene, and separate direct, first-order indirect, and higher-order indirect illumination of complex cluttered hidden scenes, similar to existing LOS techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The light transport matrix (LTM) is an instrumental tool in line-of-sight (LOS) imaging, describing how light interacts with the scene and enabling applications such as relighting or separation of illumination components. We introduce a framework to estimate the LTM of non-line-of-sight (NLOS) scenarios, coupling recent virtual forward light propagation models for NLOS imaging with the LOS light transport equation. We design computational projector-camera setups, and use these virtual imaging systems to estimate the transport matrix of hidden scenes. We introduce the specific illumination functions to compute the different elements of the matrix, overcoming the challenging wide-aperture conditions of NLOS setups. Our NLOS light transport matrix allows us to (re)illuminate specific locations of a hidden scene, and separate direct, first-order indirect, and higher-order indirect illumination of complex cluttered hidden scenes, similar to existing LOS techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The light transport matrix (LTM) is an instrumental tool in line-of-sight (LOS) imaging, describing how light interacts with the scene and enabling applications such as relighting or separation of illumination components. We introduce a framework to estimate the LTM of non-line-of-sight (NLOS) scenarios, coupling recent virtual forward light propagation models for NLOS imaging with the LOS light transport equation. We design computational projector-camera setups, and use these virtual imaging systems to estimate the transport matrix of hidden scenes. We introduce the specific illumination functions to compute the different elements of the matrix, overcoming the challenging wide-aperture conditions of NLOS setups. Our NLOS light transport matrix allows us to (re)illuminate specific locations of a hidden scene, and separate direct, first-order indirect, and higher-order indirect illumination of complex cluttered hidden scenes, similar to existing LOS techniques.",
"fno": "281200c420",
"keywords": [
"Couplings",
"Surface Reconstruction",
"Instruments",
"Lighting",
"Imaging",
"Mathematical Models",
"Topology"
],
"authors": [
{
"affiliation": "Universidad de Zaragoza",
"fullName": "Julio Marco",
"givenName": "Julio",
"surname": "Marco",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Universidad de Zaragoza",
"fullName": "Adrian Jarabo",
"givenName": "Adrian",
"surname": "Jarabo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Wisconsin – Madison",
"fullName": "Ji Hyun Nam",
"givenName": "Ji Hyun",
"surname": "Nam",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Wisconsin – Madison",
"fullName": "Xiaochun Liu",
"givenName": "Xiaochun",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Universidad de Zaragoza",
"fullName": "Miguel Ángel Cosculluela",
"givenName": "Miguel Ángel",
"surname": "Cosculluela",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Wisconsin – Madison",
"fullName": "Andreas Velten",
"givenName": "Andreas",
"surname": "Velten",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Universidad de Zaragoza",
"fullName": "Diego Gutierrez",
"givenName": "Diego",
"surname": "Gutierrez",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-10-01T00:00:00",
"pubType": "proceedings",
"pages": "2420-2429",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-2812-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "281200c410",
"articleId": "1BmF5h05v4k",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "281200c430",
"articleId": "1BmFg4NKuJ2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2012/1226/0/047O1A02",
"title": "Decomposing global light transport using time of flight imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/047O1A02/12OmNwCJOTg",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2014/5209/0/5209b987",
"title": "Learning Room Occupancy Patterns from Sparsely Recovered Light Transport Models",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209b987/12OmNyOq54I",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2014/4308/0/4308a252",
"title": "3D Scene Estimation with Perturbation-Modulated Light and Distributed Sensors",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2014/4308a252/12OmNzZ5ojN",
"parentPublication": {
"id": "proceedings/cvprw/2014/4308/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09874257",
"title": "Physics to the Rescue: Deep Non-Line-of-Sight Reconstruction for High-Speed Imaging",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09874257/1GjwyS313JC",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2019/3263/0/08747343",
"title": "Thermal Non-Line-of-Sight Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2019/08747343/1bcJx0AA5NK",
"parentPublication": {
"id": "proceedings/iccp/2019/3263/0",
"title": "2019 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300g783",
"title": "Steady-State Non-Line-Of-Sight Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300g783/1gysdM9stLW",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300b545",
"title": "Beyond Volumetric Albedo — A Surface Optimization Framework for Non-Line-Of-Sight Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300b545/1gysf2VqFO0",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b404",
"title": "Non-Line-of-Sight Surface Reconstruction Using the Directional Light-Cone Transform",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b404/1m3nmtpZT8I",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800c133",
"title": "Polarized Non-Line-of-Sight Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800c133/1m3oizGbFF6",
"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/iccvw/2021/0191/0/019100b165",
"title": "Efficient light transport acquisition by coded illumination and robust photometric stereo by dual photography using deep neural network",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100b165/1yNhyihZako",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1bcJvMu62Bi",
"title": "2019 IEEE International Conference on Computational Photography (ICCP)",
"acronym": "iccp",
"groupId": "1800125",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1bcJxL9EdLW",
"doi": "10.1109/ICCPHOT.2019.8747326",
"title": "Episcan360: Active Epipolar Imaging for Live Omni-directional Stereo",
"normalizedTitle": "Episcan360: Active Epipolar Imaging for Live Omni-directional Stereo",
"abstract": "Active epipolar imaging simultaneously illuminates and images a scene along epipolar planes. The recent devices based on this principle, such as Episcan [1] and EpiToF [2], significantly reduce the effects of indirect light transport and ambient light, resulting in live capture of high resolution 3D at longer ranges indoors and outdoors. However, these devices are designed for narrow fields of view where lens distortion can be ignored and epipolar plane/line constraints are satisfied. In this work, we extend active epipolar imaging to obtain live-omnidirectional stereo for the first time. Instead of using a 2D sensor/projector, we use a 1D sensor and 1D light sheet source that are placed in a rectified configuration. We observe that when the lens center axis and the sensor are aligned, the distortion is mostly along that axis and epipolar plane constraint remains satisfied. This allows us to use small wide-angle lenses resulting in a compact 1D Episcan. This 1D Episcan is then spun quickly to obtain an near-spherical field of view. Based on this design, we demonstrate a custom-built hand-held working prototype for live capture of omni-directional active stereo images.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Active epipolar imaging simultaneously illuminates and images a scene along epipolar planes. The recent devices based on this principle, such as Episcan [1] and EpiToF [2], significantly reduce the effects of indirect light transport and ambient light, resulting in live capture of high resolution 3D at longer ranges indoors and outdoors. However, these devices are designed for narrow fields of view where lens distortion can be ignored and epipolar plane/line constraints are satisfied. In this work, we extend active epipolar imaging to obtain live-omnidirectional stereo for the first time. Instead of using a 2D sensor/projector, we use a 1D sensor and 1D light sheet source that are placed in a rectified configuration. We observe that when the lens center axis and the sensor are aligned, the distortion is mostly along that axis and epipolar plane constraint remains satisfied. This allows us to use small wide-angle lenses resulting in a compact 1D Episcan. This 1D Episcan is then spun quickly to obtain an near-spherical field of view. Based on this design, we demonstrate a custom-built hand-held working prototype for live capture of omni-directional active stereo images.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Active epipolar imaging simultaneously illuminates and images a scene along epipolar planes. The recent devices based on this principle, such as Episcan [1] and EpiToF [2], significantly reduce the effects of indirect light transport and ambient light, resulting in live capture of high resolution 3D at longer ranges indoors and outdoors. However, these devices are designed for narrow fields of view where lens distortion can be ignored and epipolar plane/line constraints are satisfied. In this work, we extend active epipolar imaging to obtain live-omnidirectional stereo for the first time. Instead of using a 2D sensor/projector, we use a 1D sensor and 1D light sheet source that are placed in a rectified configuration. We observe that when the lens center axis and the sensor are aligned, the distortion is mostly along that axis and epipolar plane constraint remains satisfied. This allows us to use small wide-angle lenses resulting in a compact 1D Episcan. This 1D Episcan is then spun quickly to obtain an near-spherical field of view. Based on this design, we demonstrate a custom-built hand-held working prototype for live capture of omni-directional active stereo images.",
"fno": "08747326",
"keywords": [
"Image Resolution",
"Image Sensors",
"Lenses",
"Stereo Image Processing",
"Episcan 360",
"Active Epipolar Imaging",
"Epipolar Planes",
"Indirect Light Transport",
"Live Capture",
"Epipolar Plane Line Constraints",
"Live Omnidirectional Stereo",
"1 D Light Sheet Source",
"Epipolar Plane Constraint",
"Omni Directional Active Stereo Images",
"Ambient Light",
"High Resolution 3 D",
"1 D Sensor",
"Lens Center Axis",
"Wide Angle Lenses",
"1 D Episcan",
"Near Spherical Field Of View",
"Cameras",
"Image Resolution",
"Lenses",
"Laser Noise",
"Semiconductor Lasers",
"Distortion",
"Computational Photography",
"Omni Directional Imaging",
"Epipolar Imaging"
],
"authors": [
{
"affiliation": "The Robotics Institute, Carnegie Mellon University, Pittsburgh, USA",
"fullName": "D. W. Wilson Hamilton",
"givenName": "D. W.",
"surname": "Wilson Hamilton",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Robotics Institute, Carnegie Mellon University, Pittsburgh, USA",
"fullName": "Jaime Bourne",
"givenName": "Jaime",
"surname": "Bourne",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Robotics Institute, Carnegie Mellon University, Pittsburgh, USA",
"fullName": "Jeffrey D. McMahill",
"givenName": "Jeffrey D.",
"surname": "McMahill",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Robotics Institute, Carnegie Mellon University, Pittsburgh, USA",
"fullName": "Joan Campoy",
"givenName": "Joan",
"surname": "Campoy",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Robotics Institute, Carnegie Mellon University, Pittsburgh, USA",
"fullName": "Herman Herman",
"givenName": "Herman",
"surname": "Herman",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Robotics Institute, Carnegie Mellon University, Pittsburgh, USA",
"fullName": "Srinivasa G. Narasimhan",
"givenName": "Srinivasa G.",
"surname": "Narasimhan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-05-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-3263-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08747335",
"articleId": "1bcJwaY8Oek",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08747325",
"articleId": "1bcJxhe6ouc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2013/2840/0/2840a489",
"title": "A Rotational Stereo Model Based on XSlit Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840a489/12OmNAPjA5D",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2015/6759/0/07301373",
"title": "Fresnel lens imaging with post-capture image processing",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2015/07301373/12OmNBLdKJ7",
"parentPublication": {
"id": "proceedings/cvprw/2015/6759/0",
"title": "2015 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460391",
"title": "Direct imaging with printed microlens arrays",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460391/12OmNs0TL48",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2011/4353/2/05750979",
"title": "Research on Resolution of the Volume Holography Imaging Systems",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2011/05750979/12OmNwFicVh",
"parentPublication": {
"id": "icicta/2011/4353/2",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457a125",
"title": "A Practical Method for Fully Automatic Intrinsic Camera Calibration Using Directionally Encoded Light",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a125/12OmNxxdZCj",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2017/3013/0/3013b467",
"title": "Diffraction Effect in Compressive Sensing Ghost Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2017/3013b467/12OmNyuPL0N",
"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/bigmm/2018/5321/0/08499086",
"title": "Light Filed Image Quality Assessment by Local and Global Features of Epipolar Plane Image",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2018/08499086/17D45VsBTVe",
"parentPublication": {
"id": "proceedings/bigmm/2018/5321/0",
"title": "2018 IEEE Fourth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08877764",
"title": "Programmable Non-Epipolar Indirect Light Transport: Capture and Analysis",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08877764/1emy95qb1NS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2019/1651/0/08935808",
"title": "The Study of the Object Depth Estimation Based on Point Pair Features on Images",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2019/08935808/1fThdLgWVRS",
"parentPublication": {
"id": "proceedings/snpd/2019/1651/0",
"title": "2019 20th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiea/2020/8288/0/828800a732",
"title": "Analysis on the Advancement in the Performance of GaN-Based LDs in the Selected Application",
"doi": null,
"abstractUrl": "/proceedings-article/aiea/2020/828800a732/1nTumlzHRmw",
"parentPublication": {
"id": "proceedings/aiea/2020/8288/0",
"title": "2020 International Conference on Artificial Intelligence and Electromechanical Automation (AIEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1wzs0vrjyWQ",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"acronym": "cvprw",
"groupId": "1001809",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1yXsHPkKPJu",
"doi": "10.1109/CVPRW53098.2021.00120",
"title": "Towards Indirect Top-Down Road Transport Emissions Estimation",
"normalizedTitle": "Towards Indirect Top-Down Road Transport Emissions Estimation",
"abstract": "Road transportation is one of the largest sectors of greenhouse gas (GHG) emissions affecting climate change. Tackling climate change as a global community will require new capabilities to measure and inventory road transport emissions. However, the large scale and distributed nature of vehicle emissions make this sector especially challenging for existing inventory methods. In this work, we develop machine learning models that use satellite imagery to perform indirect top-down estimation of road transport emissions. Our initial experiments focus on the United States, where a bottom-up inventory was available for training our models. We achieved a mean absolute error (MAE) of 39.5 kg CO<inf>2</inf> of annual road transport emissions, calculated on a pixel-by-pixel (100 m<sup>2</sup>) basis in Sentinel-2 imagery. We also discuss key model assumptions and challenges that need to be addressed to develop models capable of generalizing to global geography. We believe this work is the first published approach for automated indirect top-down estimation of road transport sector emissions using visual imagery and represents a critical step towards scalable, global, near-real-time road transportation emissions inventories that are measured both independently and objectively.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Road transportation is one of the largest sectors of greenhouse gas (GHG) emissions affecting climate change. Tackling climate change as a global community will require new capabilities to measure and inventory road transport emissions. However, the large scale and distributed nature of vehicle emissions make this sector especially challenging for existing inventory methods. In this work, we develop machine learning models that use satellite imagery to perform indirect top-down estimation of road transport emissions. Our initial experiments focus on the United States, where a bottom-up inventory was available for training our models. We achieved a mean absolute error (MAE) of 39.5 kg CO<inf>2</inf> of annual road transport emissions, calculated on a pixel-by-pixel (100 m<sup>2</sup>) basis in Sentinel-2 imagery. We also discuss key model assumptions and challenges that need to be addressed to develop models capable of generalizing to global geography. We believe this work is the first published approach for automated indirect top-down estimation of road transport sector emissions using visual imagery and represents a critical step towards scalable, global, near-real-time road transportation emissions inventories that are measured both independently and objectively.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Road transportation is one of the largest sectors of greenhouse gas (GHG) emissions affecting climate change. Tackling climate change as a global community will require new capabilities to measure and inventory road transport emissions. However, the large scale and distributed nature of vehicle emissions make this sector especially challenging for existing inventory methods. In this work, we develop machine learning models that use satellite imagery to perform indirect top-down estimation of road transport emissions. Our initial experiments focus on the United States, where a bottom-up inventory was available for training our models. We achieved a mean absolute error (MAE) of 39.5 kg CO2 of annual road transport emissions, calculated on a pixel-by-pixel (100 m2) basis in Sentinel-2 imagery. We also discuss key model assumptions and challenges that need to be addressed to develop models capable of generalizing to global geography. We believe this work is the first published approach for automated indirect top-down estimation of road transport sector emissions using visual imagery and represents a critical step towards scalable, global, near-real-time road transportation emissions inventories that are measured both independently and objectively.",
"fno": "489900b092",
"keywords": [
"Training",
"Climate Change",
"Visualization",
"Satellites",
"Uncertainty",
"Roads",
"Estimation"
],
"authors": [
{
"affiliation": "Johns Hopkins University,Applied Physics Laboratory",
"fullName": "Ryan Mukherjee",
"givenName": "Ryan",
"surname": "Mukherjee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Johns Hopkins University,Applied Physics Laboratory",
"fullName": "Derek Rollend",
"givenName": "Derek",
"surname": "Rollend",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Johns Hopkins University,Applied Physics Laboratory",
"fullName": "Gordon Christie",
"givenName": "Gordon",
"surname": "Christie",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Johns Hopkins University,Applied Physics Laboratory",
"fullName": "Armin Hadzic",
"givenName": "Armin",
"surname": "Hadzic",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Johns Hopkins University,Applied Physics Laboratory",
"fullName": "Sally Matson",
"givenName": "Sally",
"surname": "Matson",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Johns Hopkins University,Applied Physics Laboratory",
"fullName": "Anshu Saksena",
"givenName": "Anshu",
"surname": "Saksena",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Johns Hopkins University,Applied Physics Laboratory",
"fullName": "Marisa Hughes",
"givenName": "Marisa",
"surname": "Hughes",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvprw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1092-1101",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-4899-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "489900b082",
"articleId": "1yXsE9ufLoI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "489900b102",
"articleId": "1yXsDnerEqI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icece/2010/4031/0/4031d443",
"title": "Carbon Emissions Trading and Sustainable Development of Power Industry",
"doi": null,
"abstractUrl": "/proceedings-article/icece/2010/4031d443/12OmNvkGW2S",
"parentPublication": {
"id": "proceedings/icece/2010/4031/0",
"title": "Electrical and Control Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbi/2016/3231/1/3231a163",
"title": "Introducing Greenhouse Emissions in Cost Optimization of Fault-Tolerant Data Center Design",
"doi": null,
"abstractUrl": "/proceedings-article/cbi/2016/3231a163/12OmNzDNtuZ",
"parentPublication": {
"id": "proceedings/cbi/2016/3231/2",
"title": "2016 IEEE 18th Conference on Business Informatics (CBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wetice/2014/4249/0/4249a021",
"title": "Carbon Efficient Transport Management Using Multi-agent System",
"doi": null,
"abstractUrl": "/proceedings-article/wetice/2014/4249a021/12OmNzmclTw",
"parentPublication": {
"id": "proceedings/wetice/2014/4249/0",
"title": "2014 IEEE 23rd International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprise (WETICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmss/2022/9685/0/968500a141",
"title": "Analysis on the Influencing Factors of the Carbon Emissions in China's Air Transport Industry",
"doi": null,
"abstractUrl": "/proceedings-article/icmss/2022/968500a141/1F8z6aqtLnW",
"parentPublication": {
"id": "proceedings/icmss/2022/9685/0",
"title": "2022 International Conference on Management Engineering, Software Engineering and Service Sciences (ICMSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900b471",
"title": "SpaceNet 8 - The Detection of Flooded Roads and Buildings",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900b471/1G562AxvvH2",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedcs/2022/5541/0/554100a281",
"title": "Intelligent Prediction Model of Emissions Based on Whale Algorithm Optimized BP Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icedcs/2022/554100a281/1JC1AyGh6iQ",
"parentPublication": {
"id": "proceedings/icedcs/2022/5541/0",
"title": "2022 International Conference on Electronics and Devices, Computational Science (ICEDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aipr/2019/4732/0/09174564",
"title": "Estimating the Population of Large Animals in the Wild Using Satellite Imagery: A Case Study of Hippos in Zambia’s Luangwa River",
"doi": null,
"abstractUrl": "/proceedings-article/aipr/2019/09174564/1myv6oY865O",
"parentPublication": {
"id": "proceedings/aipr/2019/4732/0",
"title": "2019 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pmis/2021/3872/0/387200a337",
"title": "Research on One Belt One Road International Road Transport Development Strategies under Regular Epidemic Prevention Situation",
"doi": null,
"abstractUrl": "/proceedings-article/pmis/2021/387200a337/1t2mYWsD72w",
"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/037800a420",
"title": "Research on Decomposition and Periodic Fluctuation of Influencing Factors of China's Carbon Emissions Based on Data Mining Technology",
"doi": null,
"abstractUrl": "/proceedings-article/itca/2020/037800a420/1tpBk4gHahi",
"parentPublication": {
"id": "proceedings/itca/2020/0378/0",
"title": "2020 2nd International Conference on Information Technology and Computer Application (ITCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900c311",
"title": "Reconsidering CO2 emissions from Computer Vision",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900c311/1yJYrEXtHwc",
"parentPublication": {
"id": "proceedings/cvprw/2021/4899/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrIaeeQ",
"title": "2011 International Conference on Internet Computing and Information Services (ICICIS 2011)",
"acronym": "icicis",
"groupId": "1800549",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNB1eJEi",
"doi": "10.1109/ICICIS.2011.169",
"title": "Importance Driven Contour Tree Simplification",
"normalizedTitle": "Importance Driven Contour Tree Simplification",
"abstract": "Real-world data sets produce unmanageably large contour trees because of noise and artifacts. It makes the contour tree impractical in data analysis and visualization. This paper proposes an importance-driven contour tree simplification approach which combines different measures of importance through an importance triangle to maximize advantages of each measure of importance. Extended Gaussian image, map projection, and K-Means clustering are used to manipulate importance measure vectors, which makes the simplification more meaningful and efficient. The proposed approach can be generalized to process branches with more than three measures.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Real-world data sets produce unmanageably large contour trees because of noise and artifacts. It makes the contour tree impractical in data analysis and visualization. This paper proposes an importance-driven contour tree simplification approach which combines different measures of importance through an importance triangle to maximize advantages of each measure of importance. Extended Gaussian image, map projection, and K-Means clustering are used to manipulate importance measure vectors, which makes the simplification more meaningful and efficient. The proposed approach can be generalized to process branches with more than three measures.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Real-world data sets produce unmanageably large contour trees because of noise and artifacts. It makes the contour tree impractical in data analysis and visualization. This paper proposes an importance-driven contour tree simplification approach which combines different measures of importance through an importance triangle to maximize advantages of each measure of importance. Extended Gaussian image, map projection, and K-Means clustering are used to manipulate importance measure vectors, which makes the simplification more meaningful and efficient. The proposed approach can be generalized to process branches with more than three measures.",
"fno": "06063247",
"keywords": [
"Mathematics Computing",
"Topology",
"Trees Mathematics",
"Importance Driven Contour Tree Simplification",
"Importance Triangle",
"Extended Gaussian Image",
"Map Projection",
"K Means Clustering",
"Internet",
"Information Services"
],
"authors": [
{
"affiliation": null,
"fullName": "Jianlong Zhou",
"givenName": "Jianlong",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Masahiro Takatsuka",
"givenName": "Masahiro",
"surname": "Takatsuka",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icicis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-09-01T00:00:00",
"pubType": "proceedings",
"pages": "265-268",
"year": "2011",
"issn": null,
"isbn": "978-1-4577-1561-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06063246",
"articleId": "12OmNz2TCxm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06063248",
"articleId": "12OmNrFTrbj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2014/5209/0/5209d132",
"title": "Maximal Max-Tree Simplification",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2014/5209d132/12OmNBLdKFL",
"parentPublication": {
"id": "proceedings/icpr/2014/5209/0",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csie/2009/3507/2/3507b679",
"title": "Mesh Simplification with Global Contour Feature Preservation",
"doi": null,
"abstractUrl": "/proceedings-article/csie/2009/3507b679/12OmNBh8gSp",
"parentPublication": {
"id": "proceedings/csie/2009/3507/2",
"title": "Computer Science and Information Engineering, World Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1994/6952/2/00413605",
"title": "Contour simplification and motion compensation for very low bit-rate video coding",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1994/00413605/12OmNvqW6VU",
"parentPublication": {
"id": "proceedings/icip/1994/6952/2",
"title": "Proceedings of 1st International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2010/3962/2/3962c537",
"title": "Joint Failure-Importance of Components in Fault Tree",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2010/3962c537/12OmNweBUCJ",
"parentPublication": {
"id": "proceedings/icmtma/2010/3962/2",
"title": "2010 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880497",
"title": "Simplifying Flexible Isosurfaces Using Local Geometric Measures",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880497/12OmNxUMHnw",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2016/3568/0/3568a313",
"title": "A Max-Tree Simplification Proposal and Applications for the Interactive Max-Tree Visualization Tool",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2016/3568a313/12OmNykkB4V",
"parentPublication": {
"id": "proceedings/sibgrapi/2016/3568/0",
"title": "2016 29th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2010/7491/0/05582617",
"title": "Tree model simplification with hybrid polygon/billboard approach and human-centered quality evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2010/05582617/12OmNylsZOA",
"parentPublication": {
"id": "proceedings/icme/2010/7491/0",
"title": "2010 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pma/2009/3988/0/3988a368",
"title": "Tree Axis Structure Simplification Correspondent to Botanical Properties",
"doi": null,
"abstractUrl": "/proceedings-article/pma/2009/3988a368/12OmNzIUfTs",
"parentPublication": {
"id": "proceedings/pma/2009/3988/0",
"title": "Plant Growth Modeling and Applications, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2016/5659/0/07874312",
"title": "Parallel peak pruning for scalable SMP contour tree computation",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2016/07874312/12OmNzYwcb1",
"parentPublication": {
"id": "proceedings/ldav/2016/5659/0",
"title": "2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08889727",
"title": "Scalable Contour Tree Computation by Data Parallel Peak Pruning",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08889727/1eBufO7qLle",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8OunG",
"title": "1992 Fourth International Conference on Computing and Information",
"acronym": "icci",
"groupId": "1000159",
"volume": "0",
"displayVolume": "0",
"year": "1992",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBtl1Bq",
"doi": "10.1109/ICCI.1992.227710",
"title": "Algorithms for a k-tree core of a tree",
"normalizedTitle": "Algorithms for a k-tree core of a tree",
"abstract": "The authors define a generalization of a core which they call a k-tree core. Given a tree T and parameter k, a k-tree core is a subtree T' of T containing exactly k leaves that minimizes d(T')= Sigma /sub upsilon in V(T)/d( upsilon , T'), where d( upsilon , T') is the distance from vertex upsilon to subtree T'. They then give two algorithms to find a k-tree core of a tree with n vertices. The complexities of these algorithms are O(kn) and O(n lg n) respectively. This work is motivated by a resource allocation problem dealing with a partially replicated distributed database defined on a tree network.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors define a generalization of a core which they call a k-tree core. Given a tree T and parameter k, a k-tree core is a subtree T' of T containing exactly k leaves that minimizes d(T')= Sigma /sub upsilon in V(T)/d( upsilon , T'), where d( upsilon , T') is the distance from vertex upsilon to subtree T'. They then give two algorithms to find a k-tree core of a tree with n vertices. The complexities of these algorithms are O(kn) and O(n lg n) respectively. This work is motivated by a resource allocation problem dealing with a partially replicated distributed database defined on a tree network.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors define a generalization of a core which they call a k-tree core. Given a tree T and parameter k, a k-tree core is a subtree T' of T containing exactly k leaves that minimizes d(T')= Sigma /sub upsilon in V(T)/d( upsilon , T'), where d( upsilon , T') is the distance from vertex upsilon to subtree T'. They then give two algorithms to find a k-tree core of a tree with n vertices. The complexities of these algorithms are O(kn) and O(n lg n) respectively. This work is motivated by a resource allocation problem dealing with a partially replicated distributed database defined on a tree network.",
"fno": "00227710",
"keywords": [
"Computational Complexity",
"Distributed Databases",
"Resource Allocation",
"Trees Mathematics",
"Resource Allocation",
"Partially Replicated Distributed Database",
"Distributed Databases",
"Terminology",
"Computer Science",
"Resource Management"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",
"fullName": "Shietung Peng",
"givenName": null,
"surname": "Shietung Peng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",
"fullName": "A.B. Stephens",
"givenName": "A.B.",
"surname": "Stephens",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",
"fullName": "Yelena Yesha",
"givenName": null,
"surname": "Yelena Yesha",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icci",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1992-01-01T00:00:00",
"pubType": "proceedings",
"pages": "38,39,40,41",
"year": "1992",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00227709",
"articleId": "12OmNAH5dm2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00227711",
"articleId": "12OmNrAMEML",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icicic/2009/3873/0/pid978998",
"title": "Efficient Algorithms for Constructing a (k, l)- Center and a (k, l)- Core in a Tree Network",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2009/pid978998/12OmNAsk4E5",
"parentPublication": {
"id": "proceedings/icicic/2009/3873/0",
"title": "Innovative Computing ,Information and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/2008/3075/0/30750471",
"title": "K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2008/30750471/12OmNBsue4b",
"parentPublication": {
"id": "proceedings/hicss/2008/3075/0",
"title": "Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2010/5445/0/05447905",
"title": "TASM: Top-k Approximate Subtree Matching",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2010/05447905/12OmNvAAtoP",
"parentPublication": {
"id": "proceedings/icde/2010/5445/0",
"title": "2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2008/3173/0/3173a267",
"title": "The (k,l) Coredian Tree for Ad Hoc Networks",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2008/3173a267/12OmNwLfMBl",
"parentPublication": {
"id": "proceedings/icdcsw/2008/3173/0",
"title": "2008 The 28th International Conference on Distributed Computing Systems Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispan/2008/3125/0/3125a053",
"title": "K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ispan/2008/3125a053/12OmNwdbVcF",
"parentPublication": {
"id": "proceedings/ispan/2008/3125/0",
"title": "Parallel Architectures, Algorithms, and Networks, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcasia/1997/7901/0/79010355",
"title": "Constant Time Algorithms for Euler Tour and Tree Operations on CRAP",
"doi": null,
"abstractUrl": "/proceedings-article/hpcasia/1997/79010355/12OmNzaQoK8",
"parentPublication": {
"id": "proceedings/hpcasia/1997/7901/0",
"title": "High Performance Computing and Grid in Asia Pacific Region, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1998/02/l0186",
"title": "Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel",
"doi": null,
"abstractUrl": "/journal/td/1998/02/l0186/13rRUIJuxuQ",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2018/05/08186208",
"title": "Z_$K$_Z -Ary Tree Hashing for Fast Graph Classification",
"doi": null,
"abstractUrl": "/journal/tk/2018/05/08186208/13rRUxASuAX",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity/2020/7649/0/764900a841",
"title": "Fast Algorithms for Spatial K-Core Discovery and Maintenance",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity/2020/764900a841/1t7n4DuBUEo",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity/2020/7649/0",
"title": "2020 IEEE 22nd International Conference on High Performance Computing and Communications; IEEE 18th International Conference on Smart City; IEEE 6th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/03/09580703",
"title": "Efficient and Optimal Algorithms for Tree Summarization With Weighted Terminologies",
"doi": null,
"abstractUrl": "/journal/tk/2023/03/09580703/1xPnZzu3u9O",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxWcHe9",
"title": "2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)",
"acronym": "ldav",
"groupId": "1800568",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzYwcb1",
"doi": "10.1109/LDAV.2016.7874312",
"title": "Parallel peak pruning for scalable SMP contour tree computation",
"normalizedTitle": "Parallel peak pruning for scalable SMP contour tree computation",
"abstract": "As data sets grow to exascale, automated data analysis and visualisation are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, withfor-mal guarantees of O(lgnlgt) parallel steps and O(n lgn) work, and implementations with up to 10x parallel speed up in OpenMP and up to 50x speed up in NVIDIA Thrust.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As data sets grow to exascale, automated data analysis and visualisation are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, withfor-mal guarantees of O(lgnlgt) parallel steps and O(n lgn) work, and implementations with up to 10x parallel speed up in OpenMP and up to 50x speed up in NVIDIA Thrust.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As data sets grow to exascale, automated data analysis and visualisation are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, withfor-mal guarantees of O(lgnlgt) parallel steps and O(n lgn) work, and implementations with up to 10x parallel speed up in OpenMP and up to 50x speed up in NVIDIA Thrust.",
"fno": "07874312",
"keywords": [
"Data Parallel Algorithms",
"Topological Analysis",
"Contour Tree",
"Merge Tree"
],
"authors": [
{
"affiliation": "University of Leeds",
"fullName": "Hamish A. Carr",
"givenName": "Hamish A.",
"surname": "Carr",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Lawrence Berkeley National Laboratory, University of California, Davis",
"fullName": "Gunther H. Weber",
"givenName": "Gunther H.",
"surname": "Weber",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Los Alamos National Laboratory",
"fullName": "Christopher M. Sewell",
"givenName": "Christopher M.",
"surname": "Sewell",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Los Alamos National Laboratory",
"fullName": "James P. Ahrens",
"givenName": "James P.",
"surname": "Ahrens",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ldav",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-10-01T00:00:00",
"pubType": "proceedings",
"pages": "75-84",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-5659-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07874311",
"articleId": "12OmNxbW4VE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07874333",
"articleId": "12OmNx9FhTQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pacificvis/2013/4797/0/06596141",
"title": "Joint Contour Nets: Computation and properties",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2013/06596141/12OmNCcbE47",
"parentPublication": {
"id": "proceedings/pacificvis/2013/4797/0",
"title": "2013 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498pascucci",
"title": "Efficient Computation of the Topology of Level Sets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498pascucci/12OmNvkpl7Y",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2016/5659/0/07874333",
"title": "Contour forests: Fast multi-threaded augmented contour trees",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2016/07874333/12OmNx9FhTQ",
"parentPublication": {
"id": "proceedings/ldav/2016/5659/0",
"title": "2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/11/ttg2011111599",
"title": "Drawing Contour Trees in the Plane",
"doi": null,
"abstractUrl": "/journal/tg/2011/11/ttg2011111599/13rRUwbs2go",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/05/ttp2011050898",
"title": "Contour Detection and Hierarchical Image Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/2011/05/ttp2011050898/13rRUxASuqw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2019/08/08637719",
"title": "Task-Based Augmented Contour Trees with Fibonacci Heaps",
"doi": null,
"abstractUrl": "/journal/td/2019/08/08637719/17D45VsBU7G",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2022/9156/0/09966394",
"title": "Distributed Hierarchical Contour Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2022/09966394/1IT0D2NIYAE",
"parentPublication": {
"id": "proceedings/ldav/2022/9156/0",
"title": "2022 IEEE 12th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/08889727",
"title": "Scalable Contour Tree Computation by Data Parallel Peak Pruning",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/08889727/1eBufO7qLle",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2020/8468/0/846800a012",
"title": "Data Parallel Hypersweeps for in Situ Topological Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2020/846800a012/1pZ0Ty0tRU4",
"parentPublication": {
"id": "proceedings/ldav/2020/8468/0",
"title": "2020 IEEE 10th Symposium on Large Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/10/09372897",
"title": "Optimization and Augmentation for Data Parallel Contour Trees",
"doi": null,
"abstractUrl": "/journal/tg/2022/10/09372897/1rNP1agwwco",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyr8Ytt",
"title": "2015 19th International Conference on Information Visualisation (iV)",
"acronym": "iv",
"groupId": "1000370",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwtEEHp",
"doi": "10.1109/iV.2015.37",
"title": "Visualizing Timed, Hierarchical Code Structures in AscoGraph",
"normalizedTitle": "Visualizing Timed, Hierarchical Code Structures in AscoGraph",
"abstract": "Antescofo is a state-of-the-art software package for mixed music authorship and performance. In this paper, we apply an information visualisation perspective to a set of revisions in the timeline-based representation of action items in Asco Graph, the dedicated user interface to Antescofo. Our contribution is two-fold: (a) a design study of the proposed new model, and (b) a technical, algorithmic component. In the former, we show how our model relates to principles of information coherence and clarity, facility of seeking and navigation, hierarchical distinction and explicit linking. In the latter, we frame the problem of arranging action rectangles in a 2D space as a strip packing problem, with the additional constraint that the (horizontal) time coordinates of each block are fixed. We introduce three algorithms of increasing complexity for automatic arrangement, estimate their packing performance and analyse their strengths and weaknesses. We evaluate the systemic improvements achieved and their applicability for other time-based datasets, while noting the limitations of the model and resulting directions for future research.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Antescofo is a state-of-the-art software package for mixed music authorship and performance. In this paper, we apply an information visualisation perspective to a set of revisions in the timeline-based representation of action items in Asco Graph, the dedicated user interface to Antescofo. Our contribution is two-fold: (a) a design study of the proposed new model, and (b) a technical, algorithmic component. In the former, we show how our model relates to principles of information coherence and clarity, facility of seeking and navigation, hierarchical distinction and explicit linking. In the latter, we frame the problem of arranging action rectangles in a 2D space as a strip packing problem, with the additional constraint that the (horizontal) time coordinates of each block are fixed. We introduce three algorithms of increasing complexity for automatic arrangement, estimate their packing performance and analyse their strengths and weaknesses. We evaluate the systemic improvements achieved and their applicability for other time-based datasets, while noting the limitations of the model and resulting directions for future research.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Antescofo is a state-of-the-art software package for mixed music authorship and performance. In this paper, we apply an information visualisation perspective to a set of revisions in the timeline-based representation of action items in Asco Graph, the dedicated user interface to Antescofo. Our contribution is two-fold: (a) a design study of the proposed new model, and (b) a technical, algorithmic component. In the former, we show how our model relates to principles of information coherence and clarity, facility of seeking and navigation, hierarchical distinction and explicit linking. In the latter, we frame the problem of arranging action rectangles in a 2D space as a strip packing problem, with the additional constraint that the (horizontal) time coordinates of each block are fixed. We introduce three algorithms of increasing complexity for automatic arrangement, estimate their packing performance and analyse their strengths and weaknesses. We evaluate the systemic improvements achieved and their applicability for other time-based datasets, while noting the limitations of the model and resulting directions for future research.",
"fno": "7568a157",
"keywords": [
"Poles And Towers",
"Strips",
"Visualization",
"Coherence",
"Layout",
"Compounds",
"Approximation Algorithms",
"Time Coherence",
"Interactive Music Notation",
"GUI",
"Linear Timeline",
"2 D Strip Packing"
],
"authors": [
{
"affiliation": null,
"fullName": "Grigore Burloiu",
"givenName": "Grigore",
"surname": "Burloiu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Arshia Cont",
"givenName": "Arshia",
"surname": "Cont",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-07-01T00:00:00",
"pubType": "proceedings",
"pages": "157-162",
"year": "2015",
"issn": "1550-6037",
"isbn": "978-1-4673-7568-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "7568a152",
"articleId": "12OmNxRWId2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "7568a163",
"articleId": "12OmNxGALbC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdma/2010/4286/1/05701152",
"title": "Application Research of the Rosette Packing in Sodium Alkali Flue Gas Desulfurization",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2010/05701152/12OmNCcbE00",
"parentPublication": {
"id": "proceedings/icdma/2010/4286/1",
"title": "2010 International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460987",
"title": "Learning action symbols for hierarchical grammar induction",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460987/12OmNqHItCS",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2015/9957/0/07374008",
"title": "Valence Bond©-Integrating Scientific Visualization Mechanism in a Tower Defense Game for Chemical Bond Concept Learning in High School",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2015/07374008/12OmNrAMEKB",
"parentPublication": {
"id": "proceedings/iiai-aai/2015/9957/0",
"title": "2015 IIAI 4th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2015/7644/0/7644a162",
"title": "Analysis about Seismic Constrained System of Single Tower Cable-Stayed Bridge",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2015/7644a162/12OmNx57HGF",
"parentPublication": {
"id": "proceedings/icicta/2015/7644/0",
"title": "2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032b899",
"title": "Hierarchical Multimodal LSTM for Dense Visual-Semantic Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032b899/12OmNyKJiAQ",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733c249",
"title": "Action-Affect-Gender Classification Using Multi-task Representation Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733c249/12OmNzcxYW8",
"parentPublication": {
"id": "proceedings/cvprw/2017/0733/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lics/2016/4391/0/08576445",
"title": "Constructions with Non-Recursive Higher Inductive Types",
"doi": null,
"abstractUrl": "/proceedings-article/lics/2016/08576445/17D45We0UD0",
"parentPublication": {
"id": "proceedings/lics/2016/4391/0",
"title": "2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcmeim/2021/2172/0/217200a167",
"title": "Study on Kinematics and Dynamics of Intelligent Connector of Safety Cable to Tower Imitating Crocodile Mouth Action",
"doi": null,
"abstractUrl": "/proceedings-article/wcmeim/2021/217200a167/1ANLyCMCZsQ",
"parentPublication": {
"id": "proceedings/wcmeim/2021/2172/0",
"title": "2021 4th World Conference on Mechanical Engineering and Intelligent Manufacturing (WCMEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icedme/2020/8145/0/09122073",
"title": "Corrosion and Protection of Metal Equipment in West Inner Mongolian Power Grid",
"doi": null,
"abstractUrl": "/proceedings-article/icedme/2020/09122073/1kRSEZ0Xfdm",
"parentPublication": {
"id": "proceedings/icedme/2020/8145/0",
"title": "2020 3rd International Conference on Electron Device and Mechanical Engineering (ICEDME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmeas/2020/9272/0/927200a034",
"title": "Structural design of twin towers with vibration absorbers",
"doi": null,
"abstractUrl": "/proceedings-article/icmeas/2020/927200a034/1rsiDCwNNYY",
"parentPublication": {
"id": "proceedings/icmeas/2020/9272/0",
"title": "2020 6th International Conference on Mechanical Engineering and Automation Science (ICMEAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1q2kHIXTSAU",
"title": "2020 IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC)",
"acronym": "p3hpc",
"groupId": "1830324",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1q2kIox02wE",
"doi": "10.1109/P3HPC51967.2020.00007",
"title": "Interpreting and Visualizing Performance Portability Metrics",
"normalizedTitle": "Interpreting and Visualizing Performance Portability Metrics",
"abstract": "Recent work has introduced a number of tools and techniques for reasoning about the interplay between application performance and portability, or \"performance portability\". These tools have proven useful for setting goals and guiding high-level discussions, but our understanding of the performance portability problem remains incomplete. Different views of the same performance efficiency data offer different insights into an application's performance portability (or lack thereof): standard statistical measures such as the mean and standard deviation require careful interpretation, and even metrics designed specifically to measure performance portability may obscure differences between applications.This paper offers a critical assessment of existing approaches for summarizing performance efficiency data across different platforms, and proposes visualization as a means to extract useful information about the underlying distribution. We explore a number of alternative visualizations, outlining a new methodology that enables developers to reason about the performance portability of their applications and how it might be improved. This study unpicks what it might mean to be \"performance portable\" and provides useful tools to explore that question.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent work has introduced a number of tools and techniques for reasoning about the interplay between application performance and portability, or \"performance portability\". These tools have proven useful for setting goals and guiding high-level discussions, but our understanding of the performance portability problem remains incomplete. Different views of the same performance efficiency data offer different insights into an application's performance portability (or lack thereof): standard statistical measures such as the mean and standard deviation require careful interpretation, and even metrics designed specifically to measure performance portability may obscure differences between applications.This paper offers a critical assessment of existing approaches for summarizing performance efficiency data across different platforms, and proposes visualization as a means to extract useful information about the underlying distribution. We explore a number of alternative visualizations, outlining a new methodology that enables developers to reason about the performance portability of their applications and how it might be improved. This study unpicks what it might mean to be \"performance portable\" and provides useful tools to explore that question.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent work has introduced a number of tools and techniques for reasoning about the interplay between application performance and portability, or \"performance portability\". These tools have proven useful for setting goals and guiding high-level discussions, but our understanding of the performance portability problem remains incomplete. Different views of the same performance efficiency data offer different insights into an application's performance portability (or lack thereof): standard statistical measures such as the mean and standard deviation require careful interpretation, and even metrics designed specifically to measure performance portability may obscure differences between applications.This paper offers a critical assessment of existing approaches for summarizing performance efficiency data across different platforms, and proposes visualization as a means to extract useful information about the underlying distribution. We explore a number of alternative visualizations, outlining a new methodology that enables developers to reason about the performance portability of their applications and how it might be improved. This study unpicks what it might mean to be \"performance portable\" and provides useful tools to explore that question.",
"fno": "108800a014",
"keywords": [
"Program Visualisation",
"Software Metrics",
"Software Performance Evaluation",
"Statistical Analysis",
"Performance Efficiency Data",
"Performance Portable",
"Application Performance",
"Performance Portability Metrics Visualization",
"Standard Statistical Measures",
"Measurement",
"Tools",
"Hardware",
"Data Visualization",
"Standards",
"Proteins",
"Productivity",
"High Performance Computing",
"Performance Portability"
],
"authors": [
{
"affiliation": "Intel Corporation,Santa Clara,USA",
"fullName": "Jason Sewall",
"givenName": "Jason",
"surname": "Sewall",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Intel Corporation,Santa Clara,USA",
"fullName": "S. John Pennycook",
"givenName": "S. John",
"surname": "Pennycook",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Intel Corporation,Santa Clara,USA",
"fullName": "Douglas Jacobsen",
"givenName": "Douglas",
"surname": "Jacobsen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Bristol,Department of Computer Science,UK",
"fullName": "Tom Deakin",
"givenName": "Tom",
"surname": "Deakin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Bristol,Department of Computer Science,UK",
"fullName": "and Simon McIntosh-Smith",
"givenName": "and Simon",
"surname": "McIntosh-Smith",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "p3hpc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-11-01T00:00:00",
"pubType": "proceedings",
"pages": "14-24",
"year": "2020",
"issn": null,
"isbn": "978-1-6654-2287-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "108800a001",
"articleId": "1q2kHWBdjX2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "108800a025",
"articleId": "1q2kHSHEGg8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/asap/2013/0494/0/06567577",
"title": "Reconfigurable computing middleware for application portability and productivity",
"doi": null,
"abstractUrl": "/proceedings-article/asap/2013/06567577/12OmNzVGcDb",
"parentPublication": {
"id": "proceedings/asap/2013/0494/0",
"title": "2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/p3hpc/2018/0220/0/022000a024",
"title": "Effective Performance Portability",
"doi": null,
"abstractUrl": "/proceedings-article/p3hpc/2018/022000a024/17PYEiNBqoB",
"parentPublication": {
"id": "proceedings/p3hpc/2018/0220/0",
"title": "2018 IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/p3hpc/2018/0220/0/022000a037",
"title": "Evaluating the Impact of Proposed OpenMP 5.0 Features on Performance, Portability and Productivity",
"doi": null,
"abstractUrl": "/proceedings-article/p3hpc/2018/022000a037/17PYEjeQUSL",
"parentPublication": {
"id": "proceedings/p3hpc/2018/0220/0",
"title": "2018 IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/p3hpc/2018/0220/0/022000a047",
"title": "Performance Portability Challenges for Fortran Applications",
"doi": null,
"abstractUrl": "/proceedings-article/p3hpc/2018/022000a047/17PYEjh7HVf",
"parentPublication": {
"id": "proceedings/p3hpc/2018/0220/0",
"title": "2018 IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/p3hpc/2019/6003/0/600300a050",
"title": "On Applying Performance Portability Metrics",
"doi": null,
"abstractUrl": "/proceedings-article/p3hpc/2019/600300a050/1gjRSDfA640",
"parentPublication": {
"id": "proceedings/p3hpc/2019/6003/0",
"title": "2019 IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/p3hpc/2019/6003/0/600300a026",
"title": "Performance Portability of Multi-Material Kernels",
"doi": null,
"abstractUrl": "/proceedings-article/p3hpc/2019/600300a026/1gjRScgPWxO",
"parentPublication": {
"id": "proceedings/p3hpc/2019/6003/0",
"title": "2019 IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/p3hpc/2019/6003/0/600300a001",
"title": "Performance Portability across Diverse Computer Architectures",
"doi": null,
"abstractUrl": "/proceedings-article/p3hpc/2019/600300a001/1gjRSwxayfm",
"parentPublication": {
"id": "proceedings/p3hpc/2019/6003/0",
"title": "2019 IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2020/2292/0/229200a021",
"title": "Towards High Performance, Portability, and Productivity: Lightweight Augmented Neural Networks for Performance Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2020/229200a021/1taEZHZfJW8",
"parentPublication": {
"id": "proceedings/hipc/2020/2292/0",
"title": "2020 IEEE 27th International Conference on High Performance Computing, Data, and Analytics (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2021/05/09484790",
"title": "Navigating Performance, Portability, and Productivity",
"doi": null,
"abstractUrl": "/magazine/cs/2021/05/09484790/1veom8UgDss",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/p3hpc/2021/2439/0/243900a001",
"title": "Revisiting a Metric for Performance Portability",
"doi": null,
"abstractUrl": "/proceedings-article/p3hpc/2021/243900a001/1zHICK5FYGs",
"parentPublication": {
"id": "proceedings/p3hpc/2021/2439/0",
"title": "2021 International Workshop on Performance, Portability and Productivity in HPC (P3HPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1q7jyoZnNSg",
"title": "2020 IEEE/ACM International Workshop on HPC User Support Tools (HUST) and Workshop on Programming and Performance Visualization Tools (ProTools)",
"acronym": "hust-protools",
"groupId": "1805685",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1q7jzq60ENy",
"doi": "10.1109/HUSTProtools51951.2020.00013",
"title": "Usability and Performance Improvements in Hatchet",
"normalizedTitle": "Usability and Performance Improvements in Hatchet",
"abstract": "Performance analysis is critical for pinpointing bottlenecks in parallel applications. Several profilers exist to instrument parallel programs on HPC systems and gather performance data. Hatchet is an open-source Python library that can read profiling output of several tools, and enables the user to perform a variety of programmatic analyses on hierarchical performance profiles. In this paper, we augment Hatchet to support new features: a query language for representing call path patterns that can be used to filter a calling context tree, visualization support for displaying and interacting with performance profiles, and new operations for performing analyses on multiple datasets. Additionally, we present performance optimizations in Hatchet’s HPCToolkit reader and the unify operation to enable scalable analysis of large datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Performance analysis is critical for pinpointing bottlenecks in parallel applications. Several profilers exist to instrument parallel programs on HPC systems and gather performance data. Hatchet is an open-source Python library that can read profiling output of several tools, and enables the user to perform a variety of programmatic analyses on hierarchical performance profiles. In this paper, we augment Hatchet to support new features: a query language for representing call path patterns that can be used to filter a calling context tree, visualization support for displaying and interacting with performance profiles, and new operations for performing analyses on multiple datasets. Additionally, we present performance optimizations in Hatchet’s HPCToolkit reader and the unify operation to enable scalable analysis of large datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Performance analysis is critical for pinpointing bottlenecks in parallel applications. Several profilers exist to instrument parallel programs on HPC systems and gather performance data. Hatchet is an open-source Python library that can read profiling output of several tools, and enables the user to perform a variety of programmatic analyses on hierarchical performance profiles. In this paper, we augment Hatchet to support new features: a query language for representing call path patterns that can be used to filter a calling context tree, visualization support for displaying and interacting with performance profiles, and new operations for performing analyses on multiple datasets. Additionally, we present performance optimizations in Hatchet’s HPCToolkit reader and the unify operation to enable scalable analysis of large datasets.",
"fno": "107000a049",
"keywords": [
"Data Visualisation",
"Ergonomics",
"Parallel Programming",
"Program Diagnostics",
"Public Domain Software",
"Python",
"Query Languages",
"Query Processing",
"Software Libraries",
"Software Performance Evaluation",
"Trees Mathematics",
"HPC Systems",
"Performance Data",
"Open Source Python Library",
"Hierarchical Performance Profiles",
"Query Language",
"Calling Context Tree",
"Visualization Support",
"Performance Optimizations",
"Performance Analysis",
"Parallel Applications",
"Profilers",
"Parallel Programs",
"Call Path Patterns",
"Hatchet HPC Toolkit Reader",
"Usability",
"Libraries",
"Database Languages",
"Tools",
"Vegetation",
"Measurement",
"Data Visualization",
"Data Models",
"Performance Analysis Tools",
"Parallel Profiles",
"Calling Context Tree",
"Call Graph",
"Graph Analytics"
],
"authors": [
{
"affiliation": "Lawrence Livermore National Laboratory,Livermore,CA,USA",
"fullName": "Stephanie Brink",
"givenName": "Stephanie",
"surname": "Brink",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tennessee,Department of Electrical Engineering and Computer Science,Knoxville,TN,USA",
"fullName": "Ian Lumsden",
"givenName": "Ian",
"surname": "Lumsden",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Arizona,Department of Computer Science,Tucson,AZ,USA",
"fullName": "Connor Scully-Allison",
"givenName": "Connor",
"surname": "Scully-Allison",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Arizona,Department of Computer Science,Tucson,AZ,USA",
"fullName": "Katy Williams",
"givenName": "Katy",
"surname": "Williams",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Lawrence Livermore National Laboratory,Livermore,CA,USA",
"fullName": "Olga Pearce",
"givenName": "Olga",
"surname": "Pearce",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Lawrence Livermore National Laboratory,Livermore,CA,USA",
"fullName": "Todd Gamblin",
"givenName": "Todd",
"surname": "Gamblin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tennessee,Department of Electrical Engineering and Computer Science,Knoxville,TN,USA",
"fullName": "Michela Taufer",
"givenName": "Michela",
"surname": "Taufer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Arizona,Department of Computer Science,Tucson,AZ,USA",
"fullName": "Katherine E. Isaacs",
"givenName": "Katherine E.",
"surname": "Isaacs",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Maryland, College Park,Department of Computer Science,MD,USA",
"fullName": "Abhinav Bhatele",
"givenName": "Abhinav",
"surname": "Bhatele",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hust-protools",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-11-01T00:00:00",
"pubType": "proceedings",
"pages": "49-58",
"year": "2020",
"issn": null,
"isbn": "978-1-6654-2280-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "107000a038",
"articleId": "1q7jztVAUFy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "107000a059",
"articleId": "1q7jzmFYiDm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/1984/0533/0/07271273",
"title": "A semantic approach to usability in relational database systems",
"doi": null,
"abstractUrl": "/proceedings-article/icde/1984/07271273/12OmNAWpyt8",
"parentPublication": {
"id": "proceedings/icde/1984/0533/0",
"title": "1984 IEEE First International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/llvm-hpc/2014/7023/0/7023a022",
"title": "SamplePGO - The Power of Profile Guided Optimizations without the Usability Burden",
"doi": null,
"abstractUrl": "/proceedings-article/llvm-hpc/2014/7023a022/12OmNxX3uKZ",
"parentPublication": {
"id": "proceedings/llvm-hpc/2014/7023/0",
"title": "2014 LLVM Compiler Infrastructure in HPC (LLVM-HPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2017/3292/0/6173a258",
"title": "Computational Improvements in Parallelized K-Anonymous Microaggregation of Large Databases",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2017/6173a258/12OmNyKrH9u",
"parentPublication": {
"id": "proceedings/icdcsw/2017/3292/0",
"title": "2017 IEEE 37th International Conference on Distributed Computing Systems Workshops (ICDCSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2013/3073/0/06606602",
"title": "Toddler: Detecting performance problems via similar memory-access patterns",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2013/06606602/12OmNyvY9D1",
"parentPublication": {
"id": "proceedings/icse/2013/3073/0",
"title": "2013 35th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/saner/2015/8469/0/07081872",
"title": "Understanding software performance regressions using differential flame graphs",
"doi": null,
"abstractUrl": "/proceedings-article/saner/2015/07081872/12OmNz61dq6",
"parentPublication": {
"id": "proceedings/saner/2015/8469/0",
"title": "2015 IEEE 22nd International Conference on Software Analysis, Evolution and Reengineering (SANER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "letters/ca/2011/02/lca2011020045",
"title": "Experience with Improving Distributed Shared Cache Performance on Tilera's Tile Processor",
"doi": null,
"abstractUrl": "/journal/ca/2011/02/lca2011020045/13rRUx0ge7U",
"parentPublication": {
"id": "letters/ca",
"title": "IEEE Computer Architecture Letters",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2008/04/mmu2008040058",
"title": "3G Video Uploading Applications: Performance and Improvements",
"doi": null,
"abstractUrl": "/magazine/mu/2008/04/mmu2008040058/13rRUxcKzXi",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2018/05/08016384",
"title": "Optimizing Phylogenetic Queries for Performance",
"doi": null,
"abstractUrl": "/journal/tb/2018/05/08016384/14dcDYelGkh",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2022/7956/0/795600a499",
"title": "Perun: Performance Version System",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2022/795600a499/1JeFaH89Ydi",
"parentPublication": {
"id": "proceedings/icsme/2022/7956/0",
"title": "2022 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hoti/2019/5525/0/552500a049",
"title": "Communication Profiling and Characterization of Deep Learning Workloads on Clusters with High-Performance Interconnects",
"doi": null,
"abstractUrl": "/proceedings-article/hoti/2019/552500a049/1jdD2VjSmu4",
"parentPublication": {
"id": "proceedings/hoti/2019/5525/0",
"title": "2019 IEEE Symposium on High-Performance Interconnects (HOTI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAYoKlH",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"acronym": "aici",
"groupId": "1003069",
"volume": "2",
"displayVolume": "2",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxwncmW",
"doi": "10.1109/AICI.2010.169",
"title": "Distortion Correction of Data Matrix Symbol Directly Marked on Cylinder Surface",
"normalizedTitle": "Distortion Correction of Data Matrix Symbol Directly Marked on Cylinder Surface",
"abstract": "The existing distortion correction methods are not fully suitable the multi-distortion image of Data Matrix symbol directly marked on cylinder surface, so an ellipse-arc grid method is proposed to correct this kind of distortion image. Firstly, two ellipse-arc boundaries and two line boundaries are detected based on the symbol contour point set, Secondly, two groups of ellipse-arc and line are interpolated respectively along the symbol distortion and un-distortion directions and form a data grid, the grid intersection points correspond to the binary values of every data module, they are stored in the standard pattern for decoding. The tests show that the proposed method can make the accuracy rate of the symbol data modules improve to 98.7% when its ¡°L¡± length doesn¡¯t exceed 68.75% of cylinder diameter, and the symbol is decoded successfully after the distortion correction. The method promotes full application of directly marked Data Matrix symbol in the product lifecycle real-time tracking.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The existing distortion correction methods are not fully suitable the multi-distortion image of Data Matrix symbol directly marked on cylinder surface, so an ellipse-arc grid method is proposed to correct this kind of distortion image. Firstly, two ellipse-arc boundaries and two line boundaries are detected based on the symbol contour point set, Secondly, two groups of ellipse-arc and line are interpolated respectively along the symbol distortion and un-distortion directions and form a data grid, the grid intersection points correspond to the binary values of every data module, they are stored in the standard pattern for decoding. The tests show that the proposed method can make the accuracy rate of the symbol data modules improve to 98.7% when its ¡°L¡± length doesn¡¯t exceed 68.75% of cylinder diameter, and the symbol is decoded successfully after the distortion correction. The method promotes full application of directly marked Data Matrix symbol in the product lifecycle real-time tracking.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The existing distortion correction methods are not fully suitable the multi-distortion image of Data Matrix symbol directly marked on cylinder surface, so an ellipse-arc grid method is proposed to correct this kind of distortion image. Firstly, two ellipse-arc boundaries and two line boundaries are detected based on the symbol contour point set, Secondly, two groups of ellipse-arc and line are interpolated respectively along the symbol distortion and un-distortion directions and form a data grid, the grid intersection points correspond to the binary values of every data module, they are stored in the standard pattern for decoding. The tests show that the proposed method can make the accuracy rate of the symbol data modules improve to 98.7% when its ¡°L¡± length doesn¡¯t exceed 68.75% of cylinder diameter, and the symbol is decoded successfully after the distortion correction. The method promotes full application of directly marked Data Matrix symbol in the product lifecycle real-time tracking.",
"fno": "4225b225",
"keywords": [
"Directly Marked",
"Data Matrix Symbol",
"Cylinder Surface",
"Distortion Correction",
"Ellipse Arc Grid"
],
"authors": [
{
"affiliation": null,
"fullName": "Lei Lei",
"givenName": "Lei",
"surname": "Lei",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Weiping He",
"givenName": "Weiping",
"surname": "He",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wei Zhang",
"givenName": "Wei",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "aici",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-10-01T00:00:00",
"pubType": "proceedings",
"pages": "225-229",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4225-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4225b220",
"articleId": "12OmNz61cY8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4225b230",
"articleId": "12OmNBbsie2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdar/2011/4520/0/4520a982",
"title": "Symbol Spotting in Line Drawings through Graph Paths Hashing",
"doi": null,
"abstractUrl": "/proceedings-article/icdar/2011/4520a982/12OmNB7LvDN",
"parentPublication": {
"id": "proceedings/icdar/2011/4520/0",
"title": "2011 International Conference on Document Analysis and Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/2/3118b544",
"title": "A Method for Extracting 3D Information of Cylinder in C-arm Image",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118b544/12OmNBqv2cQ",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/2",
"title": "BioMedical Engineering and Informatics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2011/4296/1/4296a013",
"title": "A Calculation for Smoothing the Axial Profile Shape of Grinding Wheel Based on Numerical Control Form Grinding Cylinder Gear",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2011/4296a013/12OmNyQ7FHc",
"parentPublication": {
"id": "proceedings/icmtma/2011/4296/1",
"title": "2011 Third International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robio/2006/0570/0/04141961",
"title": "Determining Camera Pose based on Cylinder",
"doi": null,
"abstractUrl": "/proceedings-article/robio/2006/04141961/12OmNz5JBSH",
"parentPublication": {
"id": "proceedings/robio/2006/0570/0",
"title": "IEEE International Conference on Robotics and Biomimetics - ROBIO2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxH9X7L",
"title": "2014 Canadian Conference on Computer and Robot Vision (CRV)",
"acronym": "crv",
"groupId": "1001794",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzWx0bU",
"doi": "10.1109/CRV.2014.34",
"title": "Camera Matrix Calibration Using Circular Control Points and Separate Correction of the Geometric Distortion Field",
"normalizedTitle": "Camera Matrix Calibration Using Circular Control Points and Separate Correction of the Geometric Distortion Field",
"abstract": "We achieve a precise camera calibration using circular control points by, first, separation of the lens distortion parameters from other camera parameters and computation of the distortion field in advance by using a calibration harp. Second, in order to compensate for perspective bias, which is prone to occur when using a circled pattern, we incorporate conic affine transformation into the minimization error when estimating the homography, and leave all the other calibration steps as they are used in the literature. Such an error function allows to compensate for the perspective bias. Combined with precise key point detection, the approach is shown to be more stable than current state-of-the-art global calibration method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We achieve a precise camera calibration using circular control points by, first, separation of the lens distortion parameters from other camera parameters and computation of the distortion field in advance by using a calibration harp. Second, in order to compensate for perspective bias, which is prone to occur when using a circled pattern, we incorporate conic affine transformation into the minimization error when estimating the homography, and leave all the other calibration steps as they are used in the literature. Such an error function allows to compensate for the perspective bias. Combined with precise key point detection, the approach is shown to be more stable than current state-of-the-art global calibration method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We achieve a precise camera calibration using circular control points by, first, separation of the lens distortion parameters from other camera parameters and computation of the distortion field in advance by using a calibration harp. Second, in order to compensate for perspective bias, which is prone to occur when using a circled pattern, we incorporate conic affine transformation into the minimization error when estimating the homography, and leave all the other calibration steps as they are used in the literature. Such an error function allows to compensate for the perspective bias. Combined with precise key point detection, the approach is shown to be more stable than current state-of-the-art global calibration method.",
"fno": "4337a195",
"keywords": [
"Calibration",
"Cameras",
"Nonlinear Distortion",
"Mathematical Model",
"Lenses",
"Equations",
"Transmission Line Matrix Methods",
"Conic Based Affine Transformation",
"Camera Calibration",
"Camera Intrinsics",
"Perspective Bias",
"Distortion Bias",
"High Precision Calibration",
"Planar Homography"
],
"authors": [
{
"affiliation": null,
"fullName": "Victoria Rudakova",
"givenName": "Victoria",
"surname": "Rudakova",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Pascal Monasse",
"givenName": "Pascal",
"surname": "Monasse",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "crv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-05-01T00:00:00",
"pubType": "proceedings",
"pages": "195-202",
"year": "2014",
"issn": null,
"isbn": "978-1-4799-4337-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4337a189",
"articleId": "12OmNzDehc3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4337a203",
"articleId": "12OmNzYNNeV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isme/2010/7669/2/05573869",
"title": "A New Camera Calibration Method Based on Two Stages Distortion Model",
"doi": null,
"abstractUrl": "/proceedings-article/isme/2010/05573869/12OmNwBT1lH",
"parentPublication": {
"id": "proceedings/isme/2010/7669/2",
"title": "2010 International Conference of Information Science and Management Engineering. ISME 2010",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2013/4795/0/06549353",
"title": "A robust camera-based method for optical distortion calibration of head-mounted displays",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2013/06549353/12OmNwvVrHy",
"parentPublication": {
"id": "proceedings/vr/2013/4795/0",
"title": "2013 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1997/7822/0/78220602",
"title": "Lens distortion calibration using point correspondences",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1997/78220602/12OmNxzMnY3",
"parentPublication": {
"id": "proceedings/cvpr/1997/7822/0",
"title": "Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2000/0750/1/07501423",
"title": "Violating Rotating Camera Geometry: The Effect of Radial Distortion on Self-Calibration",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2000/07501423/12OmNyQYtkT",
"parentPublication": {
"id": "proceedings/icpr/2000/0750/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391c345",
"title": "On the Equivalence of Moving Entrance Pupil and Radial Distortion for Camera Calibration",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391c345/12OmNyshmIc",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispan-fcst-iscc/2017/0840/0/0840a305",
"title": "Accurate Camera Calibration Using Iteratively Optimized Algorithm of Control Points",
"doi": null,
"abstractUrl": "/proceedings-article/ispan-fcst-iscc/2017/0840a305/12OmNzllxYA",
"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": "trans/tp/2000/10/i1066",
"title": "Geometric Camera Calibration Using Circular Control Points",
"doi": null,
"abstractUrl": "/journal/tp/2000/10/i1066/13rRUwInvzt",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2007/08/i1309",
"title": "Parameter-Free Radial Distortion Correction with Center of Distortion Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2007/08/i1309/13rRUxASuqt",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1992/11/i1095",
"title": "Simple Calibration Algorithm for High-Distortion Lens Camera",
"doi": null,
"abstractUrl": "/journal/tp/1992/11/i1095/13rRUyYjK5R",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2019/4765/0/476500a259",
"title": "OSTNet: Calibration Method for Optical See-Through Head-Mounted Displays via Non-Parametric Distortion Map Generation",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2019/476500a259/1gysj1o4L16",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2019/4765/0",
"title": "2019 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyO8tMM",
"title": "2016 Data Compression Conference (DCC)",
"acronym": "dcc",
"groupId": "1000177",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzwZ6jy",
"doi": "10.1109/DCC.2016.37",
"title": "On the Minimum Distortion of Quantizers with Heterogeneous Reproduction Points",
"normalizedTitle": "On the Minimum Distortion of Quantizers with Heterogeneous Reproduction Points",
"abstract": "In quantization theory, one typically works with a unique distortion function (e.g. the squared-error distortion function) that quantifies the cost of quantizing a given source sample to any given reproduction point of the quantizer. Many applications, however, induce quantization problems where different distortion functions should be associated with different reproduction points. In this paper, we consider the case where the distortion of a given reproduction point is the squared distance to the source sample weighted by a factor that varies from one reproduction point to another. For a uniform distribution of source samples, we determine the corresponding optimal scalar quantizers and their distortions. We also find upper and lower bounds on the distortion of optimal vector quantizers. For non-uniform distributions, we provide a high resolution analysis of the minimum possible distortion. As a byproduct of our analysis, we show that for certain distributions of weights, a tessellation of non-congruent quantization cells can outperform tessellations of congruent polytopes. This suggests that Gersho's conjecture cannot be extended to the case of squared-error distortion functions with weighted reproduction points.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In quantization theory, one typically works with a unique distortion function (e.g. the squared-error distortion function) that quantifies the cost of quantizing a given source sample to any given reproduction point of the quantizer. Many applications, however, induce quantization problems where different distortion functions should be associated with different reproduction points. In this paper, we consider the case where the distortion of a given reproduction point is the squared distance to the source sample weighted by a factor that varies from one reproduction point to another. For a uniform distribution of source samples, we determine the corresponding optimal scalar quantizers and their distortions. We also find upper and lower bounds on the distortion of optimal vector quantizers. For non-uniform distributions, we provide a high resolution analysis of the minimum possible distortion. As a byproduct of our analysis, we show that for certain distributions of weights, a tessellation of non-congruent quantization cells can outperform tessellations of congruent polytopes. This suggests that Gersho's conjecture cannot be extended to the case of squared-error distortion functions with weighted reproduction points.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In quantization theory, one typically works with a unique distortion function (e.g. the squared-error distortion function) that quantifies the cost of quantizing a given source sample to any given reproduction point of the quantizer. Many applications, however, induce quantization problems where different distortion functions should be associated with different reproduction points. In this paper, we consider the case where the distortion of a given reproduction point is the squared distance to the source sample weighted by a factor that varies from one reproduction point to another. For a uniform distribution of source samples, we determine the corresponding optimal scalar quantizers and their distortions. We also find upper and lower bounds on the distortion of optimal vector quantizers. For non-uniform distributions, we provide a high resolution analysis of the minimum possible distortion. As a byproduct of our analysis, we show that for certain distributions of weights, a tessellation of non-congruent quantization cells can outperform tessellations of congruent polytopes. This suggests that Gersho's conjecture cannot be extended to the case of squared-error distortion functions with weighted reproduction points.",
"fno": "07786159",
"keywords": [
"Signal Sampling",
"Vector Quantisation",
"Weighted Reproduction Points",
"Squared Error Distortion Functions",
"Gersho Conjecture",
"Noncongruent Quantization Cell Tessellation",
"Weight Distribution",
"High Resolution Analysis",
"Nonuniform Distribution",
"Optimal Vector Quantizer Distortion",
"Lower Bounds",
"Upper Bounds",
"Optimal Scalar Quantizers",
"Uniform Source Sample Distribution",
"Weighted Source Sample",
"Squared Distance",
"Squared Error Distortion Function",
"Quantization Theory",
"Heterogeneous Reproduction Points",
"Minimum Quantizer Distortion",
"Distortion",
"Quantization Signal",
"Encoding",
"Sensors",
"Distortion Measurement",
"Indexes",
"Context"
],
"authors": [
{
"affiliation": null,
"fullName": "Erdem Koyuncu",
"givenName": "Erdem",
"surname": "Koyuncu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hamid Jafarkhani",
"givenName": "Hamid",
"surname": "Jafarkhani",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dcc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-03-01T00:00:00",
"pubType": "proceedings",
"pages": "151-160",
"year": "2016",
"issn": "1068-0314",
"isbn": "978-1-5090-1853-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07786158",
"articleId": "12OmNBUS7ce",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07786160",
"articleId": "12OmNyKrH2X",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dcc/1991/9202/0/00213316",
"title": "Rate distortion performance of VQ and PVQ compression algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1991/00213316/12OmNAPjA8O",
"parentPublication": {
"id": "proceedings/dcc/1991/9202/0",
"title": "1991 Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2009/3592/0/3592a391",
"title": "Highly Accurate Distortion Estimation for JPEG2000 through PDF-Based Estimators",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2009/3592a391/12OmNAnuTEr",
"parentPublication": {
"id": "proceedings/dcc/2009/3592/0",
"title": "2009 Data Compression Conference. DCC 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2011/279/0/05749522",
"title": "Accurate Distortion Measurement Using Analytical Model for the B-Spline-Based Shape Coding",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2011/05749522/12OmNBTs7F0",
"parentPublication": {
"id": "proceedings/dcc/2011/279/0",
"title": "2011 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2015/7079/0/07169808",
"title": "Hardware-oriented rate-distortion optimization algorithm for HEVC intra-frame encoder",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2015/07169808/12OmNBhZ4hA",
"parentPublication": {
"id": "proceedings/icmew/2015/7079/0",
"title": "2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/1996/7358/0/73580340",
"title": "Distortion-limited vector quantization",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1996/73580340/12OmNBsueaS",
"parentPublication": {
"id": "proceedings/dcc/1996/7358/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmsp/2011/4356/1/4356a175",
"title": "A Perceptual Rate-Distortion Based Quantization Level Adjustment Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/cmsp/2011/4356a175/12OmNviHKf1",
"parentPublication": {
"id": "proceedings/cmsp/2011/4356/1",
"title": "Multimedia and Signal Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2017/3299/0/08110042",
"title": "Nonlinear distortion modulating signals in quantization",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2017/08110042/12OmNwO5LYU",
"parentPublication": {
"id": "proceedings/ewdts/2017/3299/0",
"title": "2017 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2920/0/00202048",
"title": "Optimal search in random quantizers",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00202048/12OmNxj2393",
"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/acssc/1994/6405/2/00471655",
"title": "Analysis of high rate LPC vector quantizers designed by minimizing suboptimal error measures",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1994/00471655/12OmNyv7mbW",
"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/bigmm/2017/6549/0/07966724",
"title": "Fast Rate Distortion Optimized Quantization Method Based on Early Detection of Zero Block for HEVC",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2017/07966724/12OmNzuZUtB",
"parentPublication": {
"id": "proceedings/bigmm/2017/6549/0",
"title": "2017 IEEE Third International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1qyxsFaq4YU",
"title": "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)",
"acronym": "focs",
"groupId": "1000292",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1qyxymv2Du0",
"doi": "10.1109/FOCS46700.2020.00134",
"title": "Resolving the Optimal Metric Distortion Conjecture",
"normalizedTitle": "Resolving the Optimal Metric Distortion Conjecture",
"abstract": "We study the following metric distortion problem: there are two finite sets of points, V and C, that lie in the same metric space, and our goal is to choose a point in C whose total distance from the points in V is as small as possible. However, rather than having access to the underlying distance metric, we only know, for each point in V, a ranking of its distances to the points in C. We propose algorithms that choose a point in C using only these rankings as input and we provide bounds on their distortion (worst-case approximation ratio). A prominent motivation for this problem comes from voting theory, where V represents a set of voters, C represents a set of candidates, and the rankings correspond to ordinal preferences of the voters. A major conjecture in this framework is that the optimal deterministic algorithm has distortion 3. We resolve this conjecture by providing a polynomial-time algorithm that achieves distortion 3, matching a known lower bound. We do so by proving a novel lemma about matching voters to candidates, which we refer to as the ranking-matching lemma. This lemma induces a family of novel algorithms, which may be of independent interest, and we show that a special algorithm in this family achieves distortion 3. We also provide more refined, parameterized, bounds using the notion of decisiveness, which quantifies the extent to which a voter may prefer her top choice relative to all others. Finally, we introduce a new randomized algorithm with improved distortion compared to known results, and also provide improved lower bounds on the distortion of all deterministic and randomized algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We study the following metric distortion problem: there are two finite sets of points, V and C, that lie in the same metric space, and our goal is to choose a point in C whose total distance from the points in V is as small as possible. However, rather than having access to the underlying distance metric, we only know, for each point in V, a ranking of its distances to the points in C. We propose algorithms that choose a point in C using only these rankings as input and we provide bounds on their distortion (worst-case approximation ratio). A prominent motivation for this problem comes from voting theory, where V represents a set of voters, C represents a set of candidates, and the rankings correspond to ordinal preferences of the voters. A major conjecture in this framework is that the optimal deterministic algorithm has distortion 3. We resolve this conjecture by providing a polynomial-time algorithm that achieves distortion 3, matching a known lower bound. We do so by proving a novel lemma about matching voters to candidates, which we refer to as the ranking-matching lemma. This lemma induces a family of novel algorithms, which may be of independent interest, and we show that a special algorithm in this family achieves distortion 3. We also provide more refined, parameterized, bounds using the notion of decisiveness, which quantifies the extent to which a voter may prefer her top choice relative to all others. Finally, we introduce a new randomized algorithm with improved distortion compared to known results, and also provide improved lower bounds on the distortion of all deterministic and randomized algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We study the following metric distortion problem: there are two finite sets of points, V and C, that lie in the same metric space, and our goal is to choose a point in C whose total distance from the points in V is as small as possible. However, rather than having access to the underlying distance metric, we only know, for each point in V, a ranking of its distances to the points in C. We propose algorithms that choose a point in C using only these rankings as input and we provide bounds on their distortion (worst-case approximation ratio). A prominent motivation for this problem comes from voting theory, where V represents a set of voters, C represents a set of candidates, and the rankings correspond to ordinal preferences of the voters. A major conjecture in this framework is that the optimal deterministic algorithm has distortion 3. We resolve this conjecture by providing a polynomial-time algorithm that achieves distortion 3, matching a known lower bound. We do so by proving a novel lemma about matching voters to candidates, which we refer to as the ranking-matching lemma. This lemma induces a family of novel algorithms, which may be of independent interest, and we show that a special algorithm in this family achieves distortion 3. We also provide more refined, parameterized, bounds using the notion of decisiveness, which quantifies the extent to which a voter may prefer her top choice relative to all others. Finally, we introduce a new randomized algorithm with improved distortion compared to known results, and also provide improved lower bounds on the distortion of all deterministic and randomized algorithms.",
"fno": "962100b427",
"keywords": [
"Approximation Theory",
"Computational Complexity",
"Deterministic Algorithms",
"Randomised Algorithms",
"Set Theory",
"Ordinal Preferences",
"Voter",
"Optimal Deterministic Algorithm",
"Polynomial Time Algorithm",
"Ranking Matching Lemma",
"Randomized Algorithm",
"Deterministic Algorithms",
"Randomized Algorithms",
"Optimal Metric Distortion Conjecture",
"Metric Distortion Problem",
"Finite Sets",
"Metric Space",
"Total Distance",
"Distance Metric",
"Worst Case Approximation Ratio",
"Distortion",
"Measurement",
"Computer Science",
"Bipartite Graph",
"Approximation Algorithms",
"Linear Programming",
"Indexes",
"Distortion",
"Metric",
"Voting"
],
"authors": [
{
"affiliation": "Drexel University,Computer Science Department,Philadelphia,USA",
"fullName": "Vasilis Gkatzelis",
"givenName": "Vasilis",
"surname": "Gkatzelis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Toronto,Computer Science Department,Toronto,Canada",
"fullName": "Daniel Halpern",
"givenName": "Daniel",
"surname": "Halpern",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Toronto,Computer Science Department,Toronto,Canada",
"fullName": "Nisarg Shah",
"givenName": "Nisarg",
"surname": "Shah",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "focs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-11-01T00:00:00",
"pubType": "proceedings",
"pages": "1427-1438",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-9621-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "962100b416",
"articleId": "1qyxumdZoLm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "962100b439",
"articleId": "1qyxuiCjugw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/i-span/2012/5064/0/06428818",
"title": "Attainability of the Chromatic Number of Functigraphs",
"doi": null,
"abstractUrl": "/proceedings-article/i-span/2012/06428818/12OmNBSBkdo",
"parentPublication": {
"id": "proceedings/i-span/2012/5064/0",
"title": "2012 12th International Symposium on Pervasive Systems, Algorithms, and Networks (I-SPAN 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiki/2016/5952/0/5952a567",
"title": "Risk Concentration Based on the Tail Distortion Risk Measure under Generalized FGM Copula",
"doi": null,
"abstractUrl": "/proceedings-article/iiki/2016/5952a567/12OmNButpYn",
"parentPublication": {
"id": "proceedings/iiki/2016/5952/0",
"title": "2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2014/7981/0/7981b134",
"title": "On the Minimum Hub Set Problem",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2014/7981b134/12OmNwDACde",
"parentPublication": {
"id": "proceedings/cse/2014/7981/0",
"title": "2014 IEEE 17th International Conference on Computational Science and Engineering (CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccc/2013/4997/0/4997a266",
"title": "On the Parameterized and Approximation Hardness of Metric Dimension",
"doi": null,
"abstractUrl": "/proceedings-article/ccc/2013/4997a266/12OmNx4Q6Au",
"parentPublication": {
"id": "proceedings/ccc/2013/4997/0",
"title": "2013 IEEE Conference on Computational Complexity (CCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/1996/7620/0/76200214",
"title": "Nonparametric Correction of Distortion",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/1996/76200214/12OmNy3Agqz",
"parentPublication": {
"id": "proceedings/wacv/1996/7620/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2011/279/0/05749521",
"title": "A Hybrid Admissible Distortion Checking Algorithm for the B-Spline-Based Operational Rate-Distortion Optimal Shape Coding",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2011/05749521/12OmNyKJiaR",
"parentPublication": {
"id": "proceedings/dcc/2011/279/0",
"title": "2011 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2011/348/0/06011924",
"title": "Optimal distortion redistribution in block-based image coding using successive convex optimization",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06011924/12OmNyQphls",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2016/1853/0/07786159",
"title": "On the Minimum Distortion of Quantizers with Heterogeneous Reproduction Points",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2016/07786159/12OmNzwZ6jy",
"parentPublication": {
"id": "proceedings/dcc/2016/1853/0",
"title": "2016 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000g228",
"title": "The Perception-Distortion Tradeoff",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000g228/17D45XuDNEk",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2022/2055/0/205500a492",
"title": "Hop-Constrained Metric Embeddings and their Applications",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2022/205500a492/1BtfEy951OU",
"parentPublication": {
"id": "proceedings/focs/2022/2055/0",
"title": "2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzZmZr0",
"title": "2013 IEEE International Conference on Pervasive Computing and Communications (PerCom 2013)",
"acronym": "percom",
"groupId": "1000551",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC4eSkn",
"doi": "10.1109/PerCom.2013.6526726",
"title": "OpenCapSense: A rapid prototyping toolkit for pervasive interaction using capacitive sensing",
"normalizedTitle": "OpenCapSense: A rapid prototyping toolkit for pervasive interaction using capacitive sensing",
"abstract": "Capacitive sensing allows the creation of unobtrusive user interfaces that are based on measuring the proximity to objects or recognizing their dielectric properties. Combining the data of many sensors, applications such as in-the-air gesture recognition, location tracking or fluid-level sensing can be realized. We present OpenCapSense, a highly flexible open-source toolkit that enables researchers to implement new types of pervasive user interfaces with low effort. The toolkit offers a high temporal resolution with sensor update rates up to 1 kHz. The typical spatial resolution varies between one millimeter at close object proximity and around one centimeter at distances of 35cm or above.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Capacitive sensing allows the creation of unobtrusive user interfaces that are based on measuring the proximity to objects or recognizing their dielectric properties. Combining the data of many sensors, applications such as in-the-air gesture recognition, location tracking or fluid-level sensing can be realized. We present OpenCapSense, a highly flexible open-source toolkit that enables researchers to implement new types of pervasive user interfaces with low effort. The toolkit offers a high temporal resolution with sensor update rates up to 1 kHz. The typical spatial resolution varies between one millimeter at close object proximity and around one centimeter at distances of 35cm or above.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Capacitive sensing allows the creation of unobtrusive user interfaces that are based on measuring the proximity to objects or recognizing their dielectric properties. Combining the data of many sensors, applications such as in-the-air gesture recognition, location tracking or fluid-level sensing can be realized. We present OpenCapSense, a highly flexible open-source toolkit that enables researchers to implement new types of pervasive user interfaces with low effort. The toolkit offers a high temporal resolution with sensor update rates up to 1 kHz. The typical spatial resolution varies between one millimeter at close object proximity and around one centimeter at distances of 35cm or above.",
"fno": "06526726",
"keywords": [
"Electrodes",
"Spatial Resolution",
"Capacitive Sensors",
"Materials",
"Loading",
"Receivers",
"Smart Environments",
"Capacitive Sensing",
"Pervasive Interfaces",
"Proximity Sensing"
],
"authors": [
{
"affiliation": "Fraunhofer Inst. for Comput. Graphics Res. IGD, Darmstadt, Germany",
"fullName": "T. Grosse-Puppendahl",
"givenName": "T.",
"surname": "Grosse-Puppendahl",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tech. Univ. Darmstadt, Darmstadt, Germany",
"fullName": "Y. Berghoefer",
"givenName": "Y.",
"surname": "Berghoefer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fraunhofer Inst. for Comput. Graphics Res. IGD, Darmstadt, Germany",
"fullName": "A. Braun",
"givenName": "A.",
"surname": "Braun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Univ. of Regensburg, Regensburg, Germany",
"fullName": "R. Wimmer",
"givenName": "R.",
"surname": "Wimmer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Fraunhofer Inst. for Comput. Graphics Res. IGD, Darmstadt, Germany",
"fullName": "A. Kuijper",
"givenName": "A.",
"surname": "Kuijper",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "percom",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-03-01T00:00:00",
"pubType": "proceedings",
"pages": "152-159",
"year": "2013",
"issn": null,
"isbn": "978-1-4673-4573-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06526724",
"articleId": "12OmNwO5LVi",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06526727",
"articleId": "12OmNBK5ma9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/robot/1991/2163/0/00131932",
"title": "A high-resolution capacitative imaging sensor for manufacturing applications",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1991/00131932/12OmNBLdKQh",
"parentPublication": {
"id": "proceedings/robot/1991/2163/0",
"title": "Proceedings. 1991 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2012/4687/0/4687a539",
"title": "Toward a Framework for Rapid Prototyping of Touchless User Interfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2012/4687a539/12OmNxGSm2Y",
"parentPublication": {
"id": "proceedings/cisis/2012/4687/0",
"title": "2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percomw/2015/8425/0/07134029",
"title": "Demo abstract: Inviz: Low-power personalized gesture recognition using wearable textile capacitive sensor arrays",
"doi": null,
"abstractUrl": "/proceedings-article/percomw/2015/07134029/12OmNxT56Dh",
"parentPublication": {
"id": "proceedings/percomw/2015/8425/0",
"title": "2015 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cts/2016/2300/0/07871021",
"title": "RapIoT Toolkit: Rapid Prototyping of Collaborative Internet of Things Applications",
"doi": null,
"abstractUrl": "/proceedings-article/cts/2016/07871021/12OmNxbW4Rn",
"parentPublication": {
"id": "proceedings/cts/2016/2300/0",
"title": "2016 International Conference on Collaboration Technologies and Systems (CTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom/2009/3304/0/04912754",
"title": "DTT: A Distributed Trust Toolkit for pervasive systems",
"doi": null,
"abstractUrl": "/proceedings-article/percom/2009/04912754/12OmNyp9MhT",
"parentPublication": {
"id": "proceedings/percom/2009/3304/0",
"title": "2009 IEEE International Conference on Pervasive Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom/2007/2787/0/27870171",
"title": "A Capacitive Sensing Toolkit for Pervasive Activity Detection and Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/percom/2007/27870171/12OmNzXFoAj",
"parentPublication": {
"id": "proceedings/percom/2007/2787/0",
"title": "Fifth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom'07)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom/2015/8033/0/07146529",
"title": "Inviz: Low-power personalized gesture recognition using wearable textile capacitive sensor arrays",
"doi": null,
"abstractUrl": "/proceedings-article/percom/2015/07146529/12OmNzl3WRy",
"parentPublication": {
"id": "proceedings/percom/2015/8033/0",
"title": "2015 IEEE International Conference on Pervasive Computing and Communications (PerCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/1999/05/w5041",
"title": "Virtual Instrument Toolkit: Rapid Prototyping on the Web",
"doi": null,
"abstractUrl": "/magazine/ic/1999/05/w5041/13rRUIM2Vy6",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09920171",
"title": "Touchscreens Can Reveal User Identity: Capacitive Plethysmogram-Based Biometrics",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09920171/1HxSjl47M0o",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/09309382",
"title": "Capacitive Sensing for Improving Contact Rendering With Tangible Objects in VR",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/09309382/1pVCQ6Ou2Dm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyvoX8L",
"title": "2011 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems",
"acronym": "dft",
"groupId": "1000190",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx7ouQm",
"doi": "10.1109/DFT.2011.33",
"title": "Creating Defect Tolerance in Microfluidic Capacitive/Photonic Biosensors",
"normalizedTitle": "Creating Defect Tolerance in Microfluidic Capacitive/Photonic Biosensors",
"abstract": "Many biomedical sensors combine micro fluidic, electronic capacitive, and/or photonic capabilities. Micro fluidic sensors involve sealed channels through which the sample fluid containing biomedical materials flows with capacitive or photonic sensors detecting parameters contained in the liquid. However micro fluidic devices are prone to faults occurring when foreign particles in the bioliquid, or fluid bubbles, get lodged in the paths blocking a channel, thereby changing the fluidic flow in the device and affecting the parameters to be sensed. Thus, these systems require defect tolerant design in the micro fluidic and knowledge of how these changes will affect the parameters being sensed. To achieve fault tolerance we investigate a Cathedral Chamber design, with pillars supporting the roof at regular intervals. This prevents single blockages from stopping fluid flow through the system in a channel, as there are many paths. We discuss the potential causes and effects of such blockages. Monte Carlo analysis and simulations based on both randomly placed blockages and blockages occurring in low flow areas show that the Cathedral Chamber design significantly increases lifetime of the system, an average of 6 times more particles are required before full blockage occurs compared to an array of parallel channels. Fluid flow modeling shows parallel channels show rapid rise of pressure with the number of blockages while the Cathedral chamber shows much slower rise, which reaches a plateau pressure until it is blocked. The impact of these defects on the sensed parameters, such as capacitive measurement of the fluid or photonic measurements, is discussed.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many biomedical sensors combine micro fluidic, electronic capacitive, and/or photonic capabilities. Micro fluidic sensors involve sealed channels through which the sample fluid containing biomedical materials flows with capacitive or photonic sensors detecting parameters contained in the liquid. However micro fluidic devices are prone to faults occurring when foreign particles in the bioliquid, or fluid bubbles, get lodged in the paths blocking a channel, thereby changing the fluidic flow in the device and affecting the parameters to be sensed. Thus, these systems require defect tolerant design in the micro fluidic and knowledge of how these changes will affect the parameters being sensed. To achieve fault tolerance we investigate a Cathedral Chamber design, with pillars supporting the roof at regular intervals. This prevents single blockages from stopping fluid flow through the system in a channel, as there are many paths. We discuss the potential causes and effects of such blockages. Monte Carlo analysis and simulations based on both randomly placed blockages and blockages occurring in low flow areas show that the Cathedral Chamber design significantly increases lifetime of the system, an average of 6 times more particles are required before full blockage occurs compared to an array of parallel channels. Fluid flow modeling shows parallel channels show rapid rise of pressure with the number of blockages while the Cathedral chamber shows much slower rise, which reaches a plateau pressure until it is blocked. The impact of these defects on the sensed parameters, such as capacitive measurement of the fluid or photonic measurements, is discussed.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many biomedical sensors combine micro fluidic, electronic capacitive, and/or photonic capabilities. Micro fluidic sensors involve sealed channels through which the sample fluid containing biomedical materials flows with capacitive or photonic sensors detecting parameters contained in the liquid. However micro fluidic devices are prone to faults occurring when foreign particles in the bioliquid, or fluid bubbles, get lodged in the paths blocking a channel, thereby changing the fluidic flow in the device and affecting the parameters to be sensed. Thus, these systems require defect tolerant design in the micro fluidic and knowledge of how these changes will affect the parameters being sensed. To achieve fault tolerance we investigate a Cathedral Chamber design, with pillars supporting the roof at regular intervals. This prevents single blockages from stopping fluid flow through the system in a channel, as there are many paths. We discuss the potential causes and effects of such blockages. Monte Carlo analysis and simulations based on both randomly placed blockages and blockages occurring in low flow areas show that the Cathedral Chamber design significantly increases lifetime of the system, an average of 6 times more particles are required before full blockage occurs compared to an array of parallel channels. Fluid flow modeling shows parallel channels show rapid rise of pressure with the number of blockages while the Cathedral chamber shows much slower rise, which reaches a plateau pressure until it is blocked. The impact of these defects on the sensed parameters, such as capacitive measurement of the fluid or photonic measurements, is discussed.",
"fno": "06104442",
"keywords": [
"Bio MEMS",
"Biosensors",
"Capacitive Sensors",
"Fault Tolerance",
"Microchannel Flow",
"Microsensors",
"Monte Carlo Methods",
"Microfluidic Photonic Biosensors",
"Microfluidic Capacitive Biosensors",
"Electronic Capacitive Sensors",
"Sealed Channels",
"Biomedical Material Flows",
"Bioliquid",
"Fluid Bubbles",
"Channel Blocking Paths",
"Defect Tolerant Design",
"Fault Tolerance",
"Cathedral Chamber Design",
"Monte Carlo Analysis",
"Randomly Placed Blockages",
"Parallel Channel Array",
"Fluid Flow Modeling",
"Photonic Measurements",
"Capacitive Measurement",
"Microfluidics",
"Fluids",
"Fabrication",
"Biosensors",
"Capacitive Sensors",
"Fault Tolerance",
"Fault Tolerant Microfluidics",
"Capacitive Biosensors",
"Encapsulated Microfluidic Chamber",
"Photonics Sensors",
"Microfluidic Blockage",
"Defect Avoidance"
],
"authors": [
{
"affiliation": null,
"fullName": "Glenn H. Chapman",
"givenName": "Glenn H.",
"surname": "Chapman",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Bonnie L. Gray",
"givenName": "Bonnie L.",
"surname": "Gray",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Vijay K. Jain",
"givenName": "Vijay K.",
"surname": "Jain",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dft",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-10-01T00:00:00",
"pubType": "proceedings",
"pages": "181-189",
"year": "2011",
"issn": "1550-5774",
"isbn": "978-1-4577-1713-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06104441",
"articleId": "12OmNC2xhCL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06104443",
"articleId": "12OmNzTppFP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/memsys/1997/3744/0/00581840",
"title": "Microfluidic plastic capillaries on silicon substrates: a new inexpensive technology for bioanalysis chips",
"doi": null,
"abstractUrl": "/proceedings-article/memsys/1997/00581840/12OmNBTawwy",
"parentPublication": {
"id": "proceedings/memsys/1997/3744/0",
"title": "Proceedings IEEE The Tenth Annual International Workshop on Micro Electro Mechanical Systems. An Investigation of Micro Structures, Sensors, Actuators, Machines and Robots",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ewdts/2017/3299/0/08110052",
"title": "Simulating fluid flow in “Shrinky Dink” microfluidic chips — Potential for combination with low-cost DIY microPIV",
"doi": null,
"abstractUrl": "/proceedings-article/ewdts/2017/08110052/12OmNvC0sWN",
"parentPublication": {
"id": "proceedings/ewdts/2017/3299/0",
"title": "2017 IEEE East-West Design & Test Symposium (EWDTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev-iscmht/2017/1023/0/08338530",
"title": "Microfluidic manipulation based on thermoplasmonic marangoni effect",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-iscmht/2017/08338530/12OmNwp74BB",
"parentPublication": {
"id": "proceedings/iciev-iscmht/2017/1023/0",
"title": "2017 6th International Conference on Informatics, Electronics and Vision & 2017 7th International Symposium in Computational Medical and Health Technology (ICIEV-ISCMHT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/case/2012/0430/0/06386440",
"title": "Pressure-drop studies of resistance components for integration into a SFM-based fluidic circuit",
"doi": null,
"abstractUrl": "/proceedings-article/case/2012/06386440/12OmNym2bRE",
"parentPublication": {
"id": "proceedings/case/2012/0430/0",
"title": "2012 IEEE International Conference on Automation Science and Engineering (CASE 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2018/7568/0/08642774",
"title": "Modeling 3D Printed Check Valves for Microfluidic Systems",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2018/08642774/17QjJf2Hdtw",
"parentPublication": {
"id": "proceedings/isspit/2018/7568/0",
"title": "2018 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2019/0409/0/040900a185",
"title": "Modeling, Fabrication and Investigation of Mixing in Low-Cost Passive PDMS Micromixers",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2019/040900a185/1a3wYsk0qEE",
"parentPublication": {
"id": "proceedings/vlsid/2019/0409/0",
"title": "2019 32nd International Conference on VLSI Design and 2019 18th International Conference on Embedded Systems (VLSID)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrYlmQQ",
"title": "2015 19th International Symposium on VLSI Design and Test (VDAT)",
"acronym": "vdat",
"groupId": "1803900",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNz2C1nx",
"doi": "10.1109/ISVDAT.2015.7208118",
"title": "Design and simulative analysis of a batteryless Teflon coated capacitive pressure sensor for glaucoma diagnosis",
"normalizedTitle": "Design and simulative analysis of a batteryless Teflon coated capacitive pressure sensor for glaucoma diagnosis",
"abstract": "This paper presents the design and simulative analysis of MEMS sensor which can be used as pressure sensitive capacitor of Intraocular Pressure (IOP) sensor. An IOP sensor is an LC tank circuit which can be used as diagnostic device for glaucoma disease. This sensor detects pressure in Intraocular range i.e. 0–60mmHg in terms of capacitance. In this paper, different shapes and structures of diaphragm are investigated and found that 4 slotted square diaphragm as optimum. A battery less design was proposed by coating the diaphragm with Teflon (polytetrafluoroethylene) which is highly electronegative. The sensor yields a displacement sensitivity of 9.577×10−5μm/Pa and 13.186×10−5μm/Pa for diaphragm with and without Teflon coating respectively. The capacitive sensitivity has also increased from 5.916×10−7 1/Pa to 10.758×10−7 1/Pa with Teflon coating. It can be seen that, displacement and capacitive sensitivities were improved by 1.3 and 1.8 times respectively by using 4 slotted square diaphragm coated with Teflon. The greatest advantage of the proposed design is the removal of external biasing.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents the design and simulative analysis of MEMS sensor which can be used as pressure sensitive capacitor of Intraocular Pressure (IOP) sensor. An IOP sensor is an LC tank circuit which can be used as diagnostic device for glaucoma disease. This sensor detects pressure in Intraocular range i.e. 0–60mmHg in terms of capacitance. In this paper, different shapes and structures of diaphragm are investigated and found that 4 slotted square diaphragm as optimum. A battery less design was proposed by coating the diaphragm with Teflon (polytetrafluoroethylene) which is highly electronegative. The sensor yields a displacement sensitivity of 9.577×10−5μm/Pa and 13.186×10−5μm/Pa for diaphragm with and without Teflon coating respectively. The capacitive sensitivity has also increased from 5.916×10−7 1/Pa to 10.758×10−7 1/Pa with Teflon coating. It can be seen that, displacement and capacitive sensitivities were improved by 1.3 and 1.8 times respectively by using 4 slotted square diaphragm coated with Teflon. The greatest advantage of the proposed design is the removal of external biasing.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents the design and simulative analysis of MEMS sensor which can be used as pressure sensitive capacitor of Intraocular Pressure (IOP) sensor. An IOP sensor is an LC tank circuit which can be used as diagnostic device for glaucoma disease. This sensor detects pressure in Intraocular range i.e. 0–60mmHg in terms of capacitance. In this paper, different shapes and structures of diaphragm are investigated and found that 4 slotted square diaphragm as optimum. A battery less design was proposed by coating the diaphragm with Teflon (polytetrafluoroethylene) which is highly electronegative. The sensor yields a displacement sensitivity of 9.577×10−5μm/Pa and 13.186×10−5μm/Pa for diaphragm with and without Teflon coating respectively. The capacitive sensitivity has also increased from 5.916×10−7 1/Pa to 10.758×10−7 1/Pa with Teflon coating. It can be seen that, displacement and capacitive sensitivities were improved by 1.3 and 1.8 times respectively by using 4 slotted square diaphragm coated with Teflon. The greatest advantage of the proposed design is the removal of external biasing.",
"fno": "07208118",
"keywords": [
"Sensitivity",
"Capacitance",
"Coatings",
"Batteries",
"Electrodes",
"Micromechanical Devices",
"Capacitive Sensors"
],
"authors": [
{
"affiliation": "Department of Electronics & Communication Engg., NIT Hamirpur, Hamirpur, India",
"fullName": "Y. Mary Asha Latha",
"givenName": "Y. Mary Asha",
"surname": "Latha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Electronics & Communication Engg., NIT Hamirpur, Hamirpur, India",
"fullName": "G. Khanna",
"givenName": "G.",
"surname": "Khanna",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vdat",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1-5",
"year": "2015",
"issn": null,
"isbn": "978-1-4799-1743-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07208117",
"articleId": "12OmNzICEIS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07208119",
"articleId": "12OmNwErpIU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/greencom-ithingscpscom/2013/5046/0/06682319",
"title": "Investigation of Polymer-Coated Film Bulk Acoustic Wave Resonator for Acetone Vapor Detection",
"doi": null,
"abstractUrl": "/proceedings-article/greencom-ithingscpscom/2013/06682319/12OmNAPjA7N",
"parentPublication": {
"id": "proceedings/greencom-ithingscpscom/2013/5046/0",
"title": "2013 IEEE International Conference on Green Computing and Communications (GreenCom) and IEEE Internet of Things(iThings) and IEEE Cyber, Physical and Social Computing(CPSCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmens/2009/3938/0/3938a029",
"title": "Ultra-Low Noise Charge Sensitive Amplifier for MEMS Gyroscope",
"doi": null,
"abstractUrl": "/proceedings-article/icmens/2009/3938a029/12OmNyNQSPF",
"parentPublication": {
"id": "proceedings/icmens/2009/3938/0",
"title": "MEMS, NANO, and Smart Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spi/2009/4490/0/05089849",
"title": "Polarization mode basis functions for modeling insulator-coated through-silicon via (TSV) interconnections",
"doi": null,
"abstractUrl": "/proceedings-article/spi/2009/05089849/12OmNzJbQZ0",
"parentPublication": {
"id": "proceedings/spi/2009/4490/0",
"title": "2009 IEEE Workshop on Signal Propagation on Interconnects (SPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vdat/2015/1743/0/07208106",
"title": "Design and analysis of a touch mode MEMS capacitive pressure sensor for IUPC",
"doi": null,
"abstractUrl": "/proceedings-article/vdat/2015/07208106/12OmNzb7Zns",
"parentPublication": {
"id": "proceedings/vdat/2015/1743/0",
"title": "2015 19th International Symposium on VLSI Design and Test (VDAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/memsys/1997/3744/0/00581828",
"title": "Touch mode capacitive pressure sensors for industrial applications",
"doi": null,
"abstractUrl": "/proceedings-article/memsys/1997/00581828/12OmNzd7c1H",
"parentPublication": {
"id": "proceedings/memsys/1997/3744/0",
"title": "Proceedings IEEE The Tenth Annual International Workshop on Micro Electro Mechanical Systems. An Investigation of Micro Structures, Sensors, Actuators, Machines and Robots",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom/2015/8033/0/07146529",
"title": "Inviz: Low-power personalized gesture recognition using wearable textile capacitive sensor arrays",
"doi": null,
"abstractUrl": "/proceedings-article/percom/2015/07146529/12OmNzl3WRy",
"parentPublication": {
"id": "proceedings/percom/2015/8033/0",
"title": "2015 IEEE International Conference on Pervasive Computing and Communications (PerCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chase/2018/7206/0/720600a017",
"title": "Connected Capacitive Sensor Array for Upper-Extremity Motor Rehabilitation",
"doi": null,
"abstractUrl": "/proceedings-article/chase/2018/720600a017/181W9nRyTao",
"parentPublication": {
"id": "proceedings/chase/2018/7206/0",
"title": "2018 IEEE/ACM International Conference on Connected Health: Applications, Systems and Engineering Technologies (CHASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicas/2021/2810/0/281000a080",
"title": "Design and Experimental Research on Flexible Capacitive Tactile Sensor Based on Micro-Electro-Mechanical-System",
"doi": null,
"abstractUrl": "/proceedings-article/icicas/2021/281000a080/1Byf69cqfwQ",
"parentPublication": {
"id": "proceedings/icicas/2021/2810/0",
"title": "2021 International Conference on Intelligent Computing, Automation and Systems (ICICAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/5555/01/09920171",
"title": "Touchscreens Can Reveal User Identity: Capacitive Plethysmogram-Based Biometrics",
"doi": null,
"abstractUrl": "/journal/tm/5555/01/09920171/1HxSjl47M0o",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smartiot/2020/6514/0/09192389",
"title": "A low power circuit for medical drip infusion monitoring system",
"doi": null,
"abstractUrl": "/proceedings-article/smartiot/2020/09192389/1n0IqScBhGU",
"parentPublication": {
"id": "proceedings/smartiot/2020/6514/0",
"title": "2020 IEEE International Conference on Smart Internet of Things (SmartIoT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNs0C9QD",
"title": "Proceedings IEEE The Tenth Annual International Workshop on Micro Electro Mechanical Systems. An Investigation of Micro Structures, Sensors, Actuators, Machines and Robots",
"acronym": "memsys",
"groupId": "1000438",
"volume": "0",
"displayVolume": "0",
"year": "1997",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzd7c1H",
"doi": "10.1109/MEMSYS.1997.581828",
"title": "Touch mode capacitive pressure sensors for industrial applications",
"normalizedTitle": "Touch mode capacitive pressure sensors for industrial applications",
"abstract": "The principle, simulation, design, characteristics and application of touch mode capacitive pressure sensors for industrial applications, including embedded monitoring of tire pressure are presented. In touch mode operation, the diaphragm of the capacitive pressure sensor touches the substrate structure. The advantages of touch mode of operation are: near linear output, large over-range pressure and robust structure that make it capable to withstand harsh industrial field environment. When properly packaged, the device can be used to measure fluid now, force, acceleration, and displacement, etc. in industrial applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The principle, simulation, design, characteristics and application of touch mode capacitive pressure sensors for industrial applications, including embedded monitoring of tire pressure are presented. In touch mode operation, the diaphragm of the capacitive pressure sensor touches the substrate structure. The advantages of touch mode of operation are: near linear output, large over-range pressure and robust structure that make it capable to withstand harsh industrial field environment. When properly packaged, the device can be used to measure fluid now, force, acceleration, and displacement, etc. in industrial applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The principle, simulation, design, characteristics and application of touch mode capacitive pressure sensors for industrial applications, including embedded monitoring of tire pressure are presented. In touch mode operation, the diaphragm of the capacitive pressure sensor touches the substrate structure. The advantages of touch mode of operation are: near linear output, large over-range pressure and robust structure that make it capable to withstand harsh industrial field environment. When properly packaged, the device can be used to measure fluid now, force, acceleration, and displacement, etc. in industrial applications.",
"fno": "00581828",
"keywords": [
"Pressure Sensors",
"Electric Sensing Devices",
"Flow Measurement",
"Force Measurement",
"Finite Element Analysis",
"Digital Simulation",
"Simulation",
"Displacement Measurement",
"Acceleration Measurement",
"Capacitors",
"Microsensors",
"Touch Mode Capacitive Pressure Sensors",
"Industrial Applications",
"Simulation",
"Design",
"Characteristics",
"Embedded Monitoring",
"Tire Pressure",
"Near Linear Output",
"Over Range Pressure",
"Robust Structure",
"Harsh Industrial Field Environment",
"Force Measurement",
"Acceleration Measurement",
"Displacement Measurement",
"Capacitive Sensors",
"Tactile Sensors",
"Sensor Phenomena And Characterization",
"Force Measurement",
"Monitoring",
"Tires",
"Robustness",
"Packaging",
"Displacement Measurement",
"Force Sensors"
],
"authors": [
{
"affiliation": "Dept. of Electr. Eng. & Appl. Phys., Case Western Reserve Univ., Cleveland, OH, USA",
"fullName": "W.H. Ko",
"givenName": "W.H.",
"surname": "Ko",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Qiang Wang",
"givenName": null,
"surname": "Qiang Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "memsys",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1997-01-01T00:00:00",
"pubType": "proceedings",
"pages": "284,285,286,287,288,289",
"year": "1997",
"issn": "1084-6999",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00581826",
"articleId": "12OmNzXnNpR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00581830",
"articleId": "12OmNBlofPx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2013/4795/0/06549433",
"title": "Emoballoon: A balloon-shaped interface recognizing social touch interactions",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2013/06549433/12OmNqIhFYr",
"parentPublication": {
"id": "proceedings/vr/2013/4795/0",
"title": "2013 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ectc/2017/6315/0/07999692",
"title": "Novel High Temperature Capacitive Pressure Sensor Utilizing SiC Integrated Circuit Twin Ring Oscillators",
"doi": null,
"abstractUrl": "/proceedings-article/ectc/2017/07999692/12OmNvAAtLX",
"parentPublication": {
"id": "proceedings/ectc/2017/6315/0",
"title": "2017 IEEE 67th Electronic Components and Technology Conference (ECTC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/1/4077a771",
"title": "Application of PLC in Constant Air Pressure Control",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077a771/12OmNwD1q1R",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/1",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dft/2011/1713/0/06104442",
"title": "Creating Defect Tolerance in Microfluidic Capacitive/Photonic Biosensors",
"doi": null,
"abstractUrl": "/proceedings-article/dft/2011/06104442/12OmNx7ouQm",
"parentPublication": {
"id": "proceedings/dft/2011/1713/0",
"title": "2011 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmens/2004/2189/0/21890473",
"title": "A Monolithically Packaged Cordless Sensor System Embedding MEMS A/D Converter and Saw Transponder",
"doi": null,
"abstractUrl": "/proceedings-article/icmens/2004/21890473/12OmNxvO02s",
"parentPublication": {
"id": "proceedings/icmens/2004/2189/0",
"title": "International Conference on MEMS, NANO and Smart Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icons/2008/3105/0/3105a047",
"title": "Digital Synchronization Utilizing Harmonic Signal Generator for Capacitive Pressure Sensor Measurement",
"doi": null,
"abstractUrl": "/proceedings-article/icons/2008/3105a047/12OmNyz5JTY",
"parentPublication": {
"id": "proceedings/icons/2008/3105/0",
"title": "Third International Conference on Systems (icons 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vdat/2015/1743/0/07208106",
"title": "Design and analysis of a touch mode MEMS capacitive pressure sensor for IUPC",
"doi": null,
"abstractUrl": "/proceedings-article/vdat/2015/07208106/12OmNzb7Zns",
"parentPublication": {
"id": "proceedings/vdat/2015/1743/0",
"title": "2015 19th International Symposium on VLSI Design and Test (VDAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccee/2009/3925/1/3925a188",
"title": "An Improved Switched Capacitor Signal Conditioning Circuit for Differential Capacitive Sensors",
"doi": null,
"abstractUrl": "/proceedings-article/iccee/2009/3925a188/12OmNzfXaxw",
"parentPublication": {
"id": "iccee/2009/3925/1",
"title": "Computer and Electrical Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/irc/2021/3416/0/341600a056",
"title": "FingerVision with Whiskers: Light Touch Detection with Vision-based Tactile Sensors",
"doi": null,
"abstractUrl": "/proceedings-article/irc/2021/341600a056/1ANLLKEhH7G",
"parentPublication": {
"id": "proceedings/irc/2021/3416/0",
"title": "2021 Fifth IEEE International Conference on Robotic Computing (IRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/irc/2020/5237/0/523700a344",
"title": "Robust Distance Estimation of Capacitive Proximity Sensors in HRI using Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/irc/2020/523700a344/1pP3VbVYI5a",
"parentPublication": {
"id": "proceedings/irc/2020/5237/0",
"title": "2020 Fourth IEEE International Conference on Robotic Computing (IRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1J6hzKkIqdi",
"title": "2022 IEEE 22nd International Conference on Bioinformatics and Bioengineering (BIBE)",
"acronym": "bibe",
"groupId": "9973398",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1J6hDpuDF2o",
"doi": "10.1109/BIBE55377.2022.00080",
"title": "Using Conductive Fabric for Multi-Channel Capacitive ECG Measurement",
"normalizedTitle": "Using Conductive Fabric for Multi-Channel Capacitive ECG Measurement",
"abstract": "One of the attractive long-term health monitoring methods is Capacitive electrocardiogram (cECG) measurement. However, there is little literature available on carrying out the multi-channel cECG system in standard limb leads and the circuit diagram. This paper presents a multi-channel limb-lead cECG system that utilized conductive fabrics as the capacitive sensor, including the capacitive driven-body (CDB) circuit used to reduce the common-mode power-line interference (PLI), and verify the stability of the system through theoretic analysis and long-term experiments. The design criteria of this system and the corresponding circuit diagram are described. The signals obtained by the system presented are competitive with those by commercially available ECG machines. The sensor manufactured by conductive fabrics and the feasible size and the distance of the subjects were tested and evaluated. According to the test results, the sensor area for cECG measurement is suggested to be greater than 60 cm2, and the distance should not exceed 3 mm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "One of the attractive long-term health monitoring methods is Capacitive electrocardiogram (cECG) measurement. However, there is little literature available on carrying out the multi-channel cECG system in standard limb leads and the circuit diagram. This paper presents a multi-channel limb-lead cECG system that utilized conductive fabrics as the capacitive sensor, including the capacitive driven-body (CDB) circuit used to reduce the common-mode power-line interference (PLI), and verify the stability of the system through theoretic analysis and long-term experiments. The design criteria of this system and the corresponding circuit diagram are described. The signals obtained by the system presented are competitive with those by commercially available ECG machines. The sensor manufactured by conductive fabrics and the feasible size and the distance of the subjects were tested and evaluated. According to the test results, the sensor area for cECG measurement is suggested to be greater than 60 cm2, and the distance should not exceed 3 mm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "One of the attractive long-term health monitoring methods is Capacitive electrocardiogram (cECG) measurement. However, there is little literature available on carrying out the multi-channel cECG system in standard limb leads and the circuit diagram. This paper presents a multi-channel limb-lead cECG system that utilized conductive fabrics as the capacitive sensor, including the capacitive driven-body (CDB) circuit used to reduce the common-mode power-line interference (PLI), and verify the stability of the system through theoretic analysis and long-term experiments. The design criteria of this system and the corresponding circuit diagram are described. The signals obtained by the system presented are competitive with those by commercially available ECG machines. The sensor manufactured by conductive fabrics and the feasible size and the distance of the subjects were tested and evaluated. According to the test results, the sensor area for cECG measurement is suggested to be greater than 60 cm2, and the distance should not exceed 3 mm.",
"fno": "848700a359",
"keywords": [
"Biomedical Measurement",
"Capacitive Sensors",
"Circuit Diagrams",
"Electrocardiography",
"Capacitive Electrocardiogram Measurement",
"Capacitive Sensor",
"C ECG Measurement",
"Circuit Diagram",
"Common Mode Power Line Interference",
"Conductive Fabric",
"Driven Body Circuit",
"Long Term Health Monitoring Methods",
"Multichannel Capacitive ECG Measurement",
"Multichannel Limb Lead C ECG System",
"Size 3 0 Mm",
"Standard Limb Leads",
"Stability Criteria",
"Interference",
"Electrocardiography",
"Conductivity Measurement",
"Fabrics",
"Capacitive Sensors",
"Frequency Response",
"Capacitive Electrocardiogram",
"Conductive Fabrics",
"Multi Channel Capacitive ECG Measurement"
],
"authors": [
{
"affiliation": "Feng Chia University,Master's Program of Biomedical Informatics and Biomedical Engineering,Taichung,Taiwan",
"fullName": "Yin Sheng Chen",
"givenName": "Yin Sheng",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Industrial Technology Reserarch Insitute (ITRI),Intelligent Hybird Electronics System Divisio, Electronic and Optoelectronic System Research Laboratories,Circuit Design & Integration Department,Hsinchu,Taiwan",
"fullName": "Tai-Jui Wang",
"givenName": "Tai-Jui",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Industrial Technology Reserarch Insitute (ITRI),Intelligent Hybird Electronics System Divisio, Electronic and Optoelectronic System Research Laboratories,Circuit Design & Integration Department,Hsinchu,Taiwan",
"fullName": "Hsien Wei Chiu",
"givenName": "Hsien Wei",
"surname": "Chiu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Feng Chia University,Master's Program of Biomedical Informatics and Biomedical Engineering,Taichung,Taiwan",
"fullName": "Yue-Der Lin",
"givenName": "Yue-Der",
"surname": "Lin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bibe",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-11-01T00:00:00",
"pubType": "proceedings",
"pages": "359-362",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8487-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "848700a355",
"articleId": "1J6hAmDZMFa",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "848700a363",
"articleId": "1J6hCOK9vWw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bsn/2006/2547/0/25470027",
"title": "DC Behavior of Conductive Fabric Networks with Application to Wearable Sensor Nodes",
"doi": null,
"abstractUrl": "/proceedings-article/bsn/2006/25470027/12OmNAoUT99",
"parentPublication": {
"id": "proceedings/bsn/2006/2547/0",
"title": "BSN 2006. International Workshop on Wearable and Implantable Body Sensor Networks",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ectc/2017/6315/0/07999997",
"title": "Stretchable Capacitive Strain Sensors Based on a Novel Polymer Composite Blend",
"doi": null,
"abstractUrl": "/proceedings-article/ectc/2017/07999997/12OmNvA1hEm",
"parentPublication": {
"id": "proceedings/ectc/2017/6315/0",
"title": "2017 IEEE 67th Electronic Components and Technology Conference (ECTC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bsn/2009/3644/0/3644a246",
"title": "Non-contact Low Power EEG/ECG Electrode for High Density Wearable Biopotential Sensor Networks",
"doi": null,
"abstractUrl": "/proceedings-article/bsn/2009/3644a246/12OmNwE9OKC",
"parentPublication": {
"id": "proceedings/bsn/2009/3644/0",
"title": "2009 Sixth International Workshop on Wearable & Implantable Body Sensor Networks Conference (BSN 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mcmc/1995/6970/0/00512026",
"title": "Application of capacitive coupling to switch fabrics",
"doi": null,
"abstractUrl": "/proceedings-article/mcmc/1995/00512026/12OmNwHhoQp",
"parentPublication": {
"id": "proceedings/mcmc/1995/6970/0",
"title": "Proceedings of 1995 IEEE Multi-Chip Module Conference (MCMC-95)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iswc/2010/9046/0/05665876",
"title": "The Textile Interface Swatchbook: Creating graphical user interface-like widgets with conductive embroidery",
"doi": null,
"abstractUrl": "/proceedings-article/iswc/2010/05665876/12OmNxFsmqh",
"parentPublication": {
"id": "proceedings/iswc/2010/9046/0",
"title": "International Symposium on Wearable Computers (ISWC) 2010",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iswc/2011/0774/0/05959581",
"title": "Fabrics Capable of Capacitive Energy Storage",
"doi": null,
"abstractUrl": "/proceedings-article/iswc/2011/05959581/12OmNxdDFLj",
"parentPublication": {
"id": "proceedings/iswc/2011/0774/0",
"title": "2011 15th Annual International Symposium on Wearable Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/pc/2007/01/b1052",
"title": "Conductive Fabric Garment for a Cable-Free Body Area Network",
"doi": null,
"abstractUrl": "/magazine/pc/2007/01/b1052/13rRUxBJhDc",
"parentPublication": {
"id": "mags/pc",
"title": "IEEE Pervasive Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2022/8487/0/848700a367",
"title": "Capactive EMG Measurement with Passive Capacitive Electrode",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2022/848700a367/1J6hEDHmT6g",
"parentPublication": {
"id": "proceedings/bibe/2022/8487/0",
"title": "2022 IEEE 22nd International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fccm/2020/5803/0/09114833",
"title": "FPGA-Based Gesture Recognition with Capacitive Sensor Array using Recurrent Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/fccm/2020/09114833/1kzG9Ygi1nW",
"parentPublication": {
"id": "proceedings/fccm/2020/5803/0",
"title": "2020 IEEE 28th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/irc/2020/5237/0/523700a344",
"title": "Robust Distance Estimation of Capacitive Proximity Sensors in HRI using Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/irc/2020/523700a344/1pP3VbVYI5a",
"parentPublication": {
"id": "proceedings/irc/2020/5237/0",
"title": "2020 Fourth IEEE International Conference on Robotic Computing (IRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx8Ounz",
"title": "2010 IEEE Haptics Symposium (Formerly known as Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems)",
"acronym": "haptics",
"groupId": "1000312",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAFWOO7",
"doi": "10.1109/HAPTIC.2010.5444652",
"title": "Virtual object manipulation system with substitutive display of tangential force and slip by control of vibrotactile phantom sensation",
"normalizedTitle": "Virtual object manipulation system with substitutive display of tangential force and slip by control of vibrotactile phantom sensation",
"abstract": "We propose a substitutive multi-degree-of-freedom force display method that utilizes vibrotactile phantom sensation (VPS), in which the tangential force is substituted by the VPS position displacement and the slip is displayed as the oscillatory displacement of the VPS position. Based on the proposed method, we prototyped a virtual object manipulation system that consists of two 20 mm × 20 mm × 20 mm fingertip-wearable devices with four vibrating pins, a magnetic tracking system, a potentiometer for finger position measurement, and a physics simulator. The preliminary experiments demonstrated the feasibility to display the mass of an object, the slipping-down of an object between fingers, and the reaction torque induced by the rotation of the object-grasping hand.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a substitutive multi-degree-of-freedom force display method that utilizes vibrotactile phantom sensation (VPS), in which the tangential force is substituted by the VPS position displacement and the slip is displayed as the oscillatory displacement of the VPS position. Based on the proposed method, we prototyped a virtual object manipulation system that consists of two 20 mm × 20 mm × 20 mm fingertip-wearable devices with four vibrating pins, a magnetic tracking system, a potentiometer for finger position measurement, and a physics simulator. The preliminary experiments demonstrated the feasibility to display the mass of an object, the slipping-down of an object between fingers, and the reaction torque induced by the rotation of the object-grasping hand.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a substitutive multi-degree-of-freedom force display method that utilizes vibrotactile phantom sensation (VPS), in which the tangential force is substituted by the VPS position displacement and the slip is displayed as the oscillatory displacement of the VPS position. Based on the proposed method, we prototyped a virtual object manipulation system that consists of two 20 mm × 20 mm × 20 mm fingertip-wearable devices with four vibrating pins, a magnetic tracking system, a potentiometer for finger position measurement, and a physics simulator. The preliminary experiments demonstrated the feasibility to display the mass of an object, the slipping-down of an object between fingers, and the reaction torque induced by the rotation of the object-grasping hand.",
"fno": "05444652",
"keywords": [
"Digital Simulation",
"Haptic Interfaces",
"Position Measurement",
"Vibration Measurement",
"Virtual Reality",
"Tangential Force Substitutive Display",
"Substitutive Multidegree Of Freedom Force Display Method",
"Vibrotactile Phantom Sensation",
"Tangential Force",
"VPS Position Displacement",
"Oscillatory Displacement",
"Virtual Object Manipulation System",
"Fingertip Wearable Devices",
"Magnetic Tracking System",
"Vibrating Pins",
"Finger Position Measurement",
"Physics Simulator",
"Reaction Torque",
"Object Grasping Hand",
"Displays",
"Force Control",
"Control Systems",
"Imaging Phantoms",
"Fingers",
"Virtual Prototyping",
"Pins",
"Magnetic Devices",
"Potentiometers",
"Position Measurement",
"Vibrotactile Display",
"Phantom Sensation",
"Tangential Force",
"Slip"
],
"authors": [
{
"affiliation": "Tokyo University of Agriculture and Technology, Japan",
"fullName": "Tatsuya Ooka",
"givenName": "Tatsuya",
"surname": "Ooka",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tokyo University of Agriculture and Technology, Japan",
"fullName": "Kinya Fujita",
"givenName": "Kinya",
"surname": "Fujita",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "haptics",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-03-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2010",
"issn": "2324-7347",
"isbn": "978-1-4244-6821-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05444655",
"articleId": "12OmNxEBzn1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05444653",
"articleId": "12OmNqJ8tn9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/robot/1992/2720/0/00220072",
"title": "Soft sensored grippers in assembly process",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220072/12OmNBCHMLz",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1988/0852/0/00012126",
"title": "Cartesian stiffness control of the JPL/Stanford/Salisbury hand",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1988/00012126/12OmNqEjhVZ",
"parentPublication": {
"id": "proceedings/robot/1988/0852/0",
"title": "Proceedings. 1988 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00220018",
"title": "Self-posture changeability (SPC) for 3-D link system",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220018/12OmNqFJhAo",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2005/8929/0/01492759",
"title": "Precise and rapid interaction through scaled manipulation in immersive virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2005/01492759/12OmNqHItGo",
"parentPublication": {
"id": "proceedings/vr/2005/8929/0",
"title": "IEEE Virtual Reality 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1991/2163/0/00131612",
"title": "The condition for contact grasp stability",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1991/00131612/12OmNqIzgXW",
"parentPublication": {
"id": "proceedings/robot/1991/2163/0",
"title": "Proceedings. 1991 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1988/0852/0/00012056",
"title": "Enhancing the dexterity of a robot hand using controlled slip",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1988/00012056/12OmNvD8RzM",
"parentPublication": {
"id": "proceedings/robot/1988/0852/0",
"title": "Proceedings. 1988 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1989/1938/0/00100004",
"title": "Grasping polyhedral objects with slip",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1989/00100004/12OmNvkpliD",
"parentPublication": {
"id": "proceedings/robot/1989/1938/0",
"title": "1989 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2015/01/07031940",
"title": "Tactile Phantom Sensation for Coaching Respiration Timing",
"doi": null,
"abstractUrl": "/journal/th/2015/01/07031940/13rRUB7a11c",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzTppA7",
"title": "2017 International Symposium on Ubiquitous Virtual Reality (ISUVR)",
"acronym": "isuvr",
"groupId": "1002009",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNApcu9E",
"doi": "10.1109/ISUVR.2017.12",
"title": "Duplication Based Distance-Free Freehand Virtual Object Manipulation",
"normalizedTitle": "Duplication Based Distance-Free Freehand Virtual Object Manipulation",
"abstract": "In this paper, we propose duplication based distance-free freehand virtual object manipulation system for AR. Importance of freehand interaction with virtual objects is getting more attention as research on AR environment is extending its technological basis and AR applications are rising fast. However, a proper freehand virtual object manipulation system with overwhelming performances has not been established yet. In order to achieve both accurate selection and intuitive manipulation, we implement simple idea that user can always manipulate the object by simple grabbing whether the object is within reach or not. Our system utilizes ray-casting based selection of remote object followed by duplication of selected remote object which is located in front of user. Duplicate object can be directly manipulated using user's own hand. Our method suggests delicate manipulation of remote object regardless of distance from the user as well as consistent and flexible operations of both selection and manipulation mode.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose duplication based distance-free freehand virtual object manipulation system for AR. Importance of freehand interaction with virtual objects is getting more attention as research on AR environment is extending its technological basis and AR applications are rising fast. However, a proper freehand virtual object manipulation system with overwhelming performances has not been established yet. In order to achieve both accurate selection and intuitive manipulation, we implement simple idea that user can always manipulate the object by simple grabbing whether the object is within reach or not. Our system utilizes ray-casting based selection of remote object followed by duplication of selected remote object which is located in front of user. Duplicate object can be directly manipulated using user's own hand. Our method suggests delicate manipulation of remote object regardless of distance from the user as well as consistent and flexible operations of both selection and manipulation mode.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose duplication based distance-free freehand virtual object manipulation system for AR. Importance of freehand interaction with virtual objects is getting more attention as research on AR environment is extending its technological basis and AR applications are rising fast. However, a proper freehand virtual object manipulation system with overwhelming performances has not been established yet. In order to achieve both accurate selection and intuitive manipulation, we implement simple idea that user can always manipulate the object by simple grabbing whether the object is within reach or not. Our system utilizes ray-casting based selection of remote object followed by duplication of selected remote object which is located in front of user. Duplicate object can be directly manipulated using user's own hand. Our method suggests delicate manipulation of remote object regardless of distance from the user as well as consistent and flexible operations of both selection and manipulation mode.",
"fno": "3091a010",
"keywords": [
"Three Dimensional Displays",
"Tracking",
"Virtual Environments",
"Cameras",
"Indexes",
"Thumb",
"Remote Object Manipulation",
"Accurate Selection",
"Intuitive Manipulation",
"Ray Casting",
"Duplication Of Selected Object"
],
"authors": [
{
"affiliation": null,
"fullName": "Whie Jung",
"givenName": "Whie",
"surname": "Jung",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Woon Tack Woo",
"givenName": "Woon Tack",
"surname": "Woo",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isuvr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-06-01T00:00:00",
"pubType": "proceedings",
"pages": "10-13",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-3091-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3091a008",
"articleId": "12OmNwF0C8M",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3091a014",
"articleId": "12OmNzRZq2p",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/3dui/2008/2047/0/04476592",
"title": "Tech-note: rapMenu: Remote Menu Selection Using Freehand Gestural Input",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2008/04476592/12OmNAS9zL1",
"parentPublication": {
"id": "proceedings/3dui/2008/2047/0",
"title": "2008 IEEE Symposium on 3D User Interfaces",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2017/6327/0/6327a321",
"title": "BoostHand : Distance-free Object Manipulation System with Switchable Non-linear Mapping for Augmented Reality Classrooms",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2017/6327a321/12OmNqHqSB7",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2017/6327/0",
"title": "2017 IEEE International Symposium on Mixed and Augmented Reality (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2014/6184/0/06948467",
"title": "[Poster] Touch gestures for improved 3D object manipulation in mobile augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2014/06948467/12OmNrkT7xo",
"parentPublication": {
"id": "proceedings/ismar/2014/6184/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2012/1204/0/06184185",
"title": "3D Marking menu selection with freehand gestures",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2012/06184185/12OmNwpoFFr",
"parentPublication": {
"id": "proceedings/3dui/2012/1204/0",
"title": "2012 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2016/0836/0/07504707",
"title": "Depth-based 3D gesture multi-level radial menu for virtual object manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504707/12OmNx3HI96",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2015/1727/0/07223418",
"title": "HorizontalDragger: A freehand remote selector for object acquisition",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223418/12OmNzcxZx6",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2016/0842/0/07460065",
"title": "Smartwatch-assisted robust 6-DOF hand tracker for object manipulation in HMD-based augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2016/07460065/12OmNzlUKES",
"parentPublication": {
"id": "proceedings/3dui/2016/0842/0",
"title": "2016 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446598",
"title": "Smart Choices for Deviceless and Device-Based Manipulation in Immersive Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446598/13bd1eSlyu4",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a538",
"title": "Effects of Clutching Mechanism on Remote Object Manipulation Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a538/1CJf9GYjHMc",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2020/1485/0/09106037",
"title": "Towards Neural Ar: Unsupervised Object Segmentation with 3d Scanned Model Through Relative",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2020/09106037/1kwqMJmzvMY",
"parentPublication": {
"id": "proceedings/icmew/2020/1485/0",
"title": "2020 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBqMDBD",
"title": "Proceedings IEEE Virtual Reality 2002",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBQC890",
"doi": "10.1109/VR.2002.996529",
"title": "Efficient Manipulation of Object Groups in Virtual Environments",
"normalizedTitle": "Efficient Manipulation of Object Groups in Virtual Environments",
"abstract": "In this paper, we describe simple techniques for object group manipulation, an important operation in user interaction with a Virtual Environment. All presented manipulation techniques exploit constraints to simplify user interaction. The techniques are based on how humans perceive groups and afford direct manipulation of such groups. Furthermore, we introduce two new intuitive ways to create a whole group of objects: drag-add and random drag-add. Finally, we present an evaluation of the presented techniques.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we describe simple techniques for object group manipulation, an important operation in user interaction with a Virtual Environment. All presented manipulation techniques exploit constraints to simplify user interaction. The techniques are based on how humans perceive groups and afford direct manipulation of such groups. Furthermore, we introduce two new intuitive ways to create a whole group of objects: drag-add and random drag-add. Finally, we present an evaluation of the presented techniques.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we describe simple techniques for object group manipulation, an important operation in user interaction with a Virtual Environment. All presented manipulation techniques exploit constraints to simplify user interaction. The techniques are based on how humans perceive groups and afford direct manipulation of such groups. Furthermore, we introduce two new intuitive ways to create a whole group of objects: drag-add and random drag-add. Finally, we present an evaluation of the presented techniques.",
"fno": "14920251",
"keywords": [],
"authors": [
{
"affiliation": "York University",
"fullName": "Wolfgang Stuerzlinger",
"givenName": "Wolfgang",
"surname": "Stuerzlinger",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "York University",
"fullName": "Graham Smith",
"givenName": "Graham",
"surname": "Smith",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-03-01T00:00:00",
"pubType": "proceedings",
"pages": "251",
"year": "2002",
"issn": "1087-8270",
"isbn": "0-7695-1492-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "14920243",
"articleId": "12OmNylKB3I",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "14920261",
"articleId": "12OmNqJ8t97",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxFJXDa",
"title": "International Symposium on Ubiquitous Virtual Reality",
"acronym": "isuvr",
"groupId": "1002009",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqHqSs6",
"doi": "10.1109/ISUVR.2011.14",
"title": "ARWand: Phone-Based 3D Object Manipulation in Augmented Reality Environment",
"normalizedTitle": "ARWand: Phone-Based 3D Object Manipulation in Augmented Reality Environment",
"abstract": "In this paper, we suggest a mobile phone-based indirect 3D object manipulation method that uses sensor information in an augmented reality environment. Specifically, we propose 1) a method that exploits a 2D touch screen, a 3DOF accelerometer, and compass sensors information to manipulate 3D objects in 3D space, 2) design transfer functions to map the control space of mobile phones to an augmented reality (AR) display space, and 3) confirm the feasibility of the transfer functions by implementation. Our work could be applicable to the design and implementation of a future mobile phone-based 3D user interface for AR application in normal indoor and outdoor environments without any special tracking installations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we suggest a mobile phone-based indirect 3D object manipulation method that uses sensor information in an augmented reality environment. Specifically, we propose 1) a method that exploits a 2D touch screen, a 3DOF accelerometer, and compass sensors information to manipulate 3D objects in 3D space, 2) design transfer functions to map the control space of mobile phones to an augmented reality (AR) display space, and 3) confirm the feasibility of the transfer functions by implementation. Our work could be applicable to the design and implementation of a future mobile phone-based 3D user interface for AR application in normal indoor and outdoor environments without any special tracking installations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we suggest a mobile phone-based indirect 3D object manipulation method that uses sensor information in an augmented reality environment. Specifically, we propose 1) a method that exploits a 2D touch screen, a 3DOF accelerometer, and compass sensors information to manipulate 3D objects in 3D space, 2) design transfer functions to map the control space of mobile phones to an augmented reality (AR) display space, and 3) confirm the feasibility of the transfer functions by implementation. Our work could be applicable to the design and implementation of a future mobile phone-based 3D user interface for AR application in normal indoor and outdoor environments without any special tracking installations.",
"fno": "4420b044",
"keywords": [
"Augmented Reality",
"HMD Based Wearable Computing",
"3 D Object Manipulation",
"Sensor Based Interaction",
"Mobile Phone"
],
"authors": [
{
"affiliation": null,
"fullName": "Taejin Ha",
"givenName": "Taejin",
"surname": "Ha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Woontack Woo",
"givenName": "Woontack",
"surname": "Woo",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isuvr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-07-01T00:00:00",
"pubType": "proceedings",
"pages": "44-47",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4420-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4420b040",
"articleId": "12OmNzcPAzO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4420b048",
"articleId": "12OmNB836Iy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ismar/2011/2183/0/06162914",
"title": "Bare-hand-based augmented reality interface on mobile phone",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2011/06162914/12OmNAoUT6D",
"parentPublication": {
"id": "proceedings/ismar/2011/2183/0",
"title": "2011 10th IEEE International Symposium on Mixed and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2012/4660/0/06402556",
"title": "Tablet versus phone: Depth perception in handheld augmented reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2012/06402556/12OmNBQ2VVh",
"parentPublication": {
"id": "proceedings/ismar/2012/4660/0",
"title": "2012 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2011/0039/0/05759460",
"title": "Mobile Augmented Reality at the Hollywood Walk of Fame",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2011/05759460/12OmNrIaea8",
"parentPublication": {
"id": "proceedings/vr/2011/0039/0",
"title": "2011 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2008/1971/0/04480755",
"title": "Augmented Reality for Industrial Building Acceptance",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2008/04480755/12OmNwc3wyn",
"parentPublication": {
"id": "proceedings/vr/2008/1971/0",
"title": "IEEE Virtual Reality 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuvr/2009/3704/0/3704a007",
"title": "History and Future of Tracking for Mobile Phone Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2009/3704a007/12OmNx2QUEf",
"parentPublication": {
"id": "proceedings/isuvr/2009/3704/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcse/2009/3570/1/3570a264",
"title": "The MagicARPhone: An AR-Based Game on Phone Offering Personalized Enjoyment",
"doi": null,
"abstractUrl": "/proceedings-article/wcse/2009/3570a264/12OmNy5hRiu",
"parentPublication": {
"id": "proceedings/wcse/2009/3570/1",
"title": "2009 WRI World Congress on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2011/0039/0/05759473",
"title": "Mobile Augmented Reality using scalable recognition and tracking",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2011/05759473/12OmNyRPgLh",
"parentPublication": {
"id": "proceedings/vr/2011/0039/0",
"title": "2011 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iswc/2000/0795/0/07950189",
"title": "Two Wearable Testbeds for Augmented Reality: itWARNS and WIMMIS",
"doi": null,
"abstractUrl": "/proceedings-article/iswc/2000/07950189/12OmNykCcbx",
"parentPublication": {
"id": "proceedings/iswc/2000/0795/0",
"title": "Digest of Papers. Fourth International Symposium on Wearable Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isuvr/2011/4420/0/4420b055",
"title": "Graphical Menus Using a Mobile Phone for Wearable AR Systems",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2011/4420b055/12OmNz2C1y4",
"parentPublication": {
"id": "proceedings/isuvr/2011/4420/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2012/2719/0/06337162",
"title": "Simulation Teaching in 3D Augmented Reality Environment",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2012/06337162/12OmNzdGnxC",
"parentPublication": {
"id": "proceedings/iiai-aai/2012/2719/0",
"title": "2012 IIAI International Conference on Advanced Applied Informatics (IIAIAAI 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy1SFB7",
"title": "2008 IEEE International Test Conference",
"acronym": "itc",
"groupId": "1000753",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNsd6vkD",
"doi": "10.1109/TEST.2008.4700628",
"title": "Boundary-Scan Testing of Power/Ground Pins",
"normalizedTitle": "Boundary-Scan Testing of Power/Ground Pins",
"abstract": "Most integrated circuits today possess large numbers of power and ground pins in addition to signal pins. Boundary-scan technology will adequately test the signals, but in general does not address open defects on the power/ground pins. Some ICs could get at least partial coverage on some of these pins due to their internal power/ground distribution structure. Thus boundary-scan could be used to test, diagnose and claim coverage for these defects. What is needed is an extension to BSDL to support this capability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Most integrated circuits today possess large numbers of power and ground pins in addition to signal pins. Boundary-scan technology will adequately test the signals, but in general does not address open defects on the power/ground pins. Some ICs could get at least partial coverage on some of these pins due to their internal power/ground distribution structure. Thus boundary-scan could be used to test, diagnose and claim coverage for these defects. What is needed is an extension to BSDL to support this capability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Most integrated circuits today possess large numbers of power and ground pins in addition to signal pins. Boundary-scan technology will adequately test the signals, but in general does not address open defects on the power/ground pins. Some ICs could get at least partial coverage on some of these pins due to their internal power/ground distribution structure. Thus boundary-scan could be used to test, diagnose and claim coverage for these defects. What is needed is an extension to BSDL to support this capability.",
"fno": "04700628",
"keywords": [
"Boundary Scan Testing",
"Integrated Circuit Testing",
"Boundary Scan Testing",
"Integrated Circuits",
"Least Partial Coverage",
"Internal Power Ground Distribution Structure",
"Power Pins",
"Ground Pins",
"Pins",
"Circuit Testing",
"Rails",
"Integrated Circuit Testing",
"Integrated Circuit Technology",
"Educational Institutions",
"Power Engineering And Energy",
"Integrated Circuit Packaging",
"Integrated Circuit Modeling",
"Jacobian Matrices"
],
"authors": [
{
"affiliation": "Agilent Technologies and Xilinx Corporation, Loveland, Colorado and San Jose, California. kenneth_parker@agilent.com",
"fullName": "Kenneth P. Parker",
"givenName": "Kenneth P.",
"surname": "Parker",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Agilent Technologies and Xilinx Corporation, Loveland, Colorado and San Jose, California. neil.jacobson@xilinx.com",
"fullName": "Neil G. Jacobson",
"givenName": "Neil G.",
"surname": "Jacobson",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "itc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-10-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": "1089-3539",
"isbn": "978-1-4244-2402-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04700627",
"articleId": "12OmNyoSbfy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04700629",
"articleId": "12OmNBpVQct",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/itc/2004/2741/0/01386993",
"title": "Integrating boundary scan into multi-GHz I/O circuitry",
"doi": null,
"abstractUrl": "/proceedings-article/itc/2004/01386993/12OmNAMtAPg",
"parentPublication": {
"id": "proceedings/itc/2004/2741/0",
"title": "2004 International Conferce on Test",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vts/2004/2134/0/21340347",
"title": "Boundary scan for 5-GHz RF pins using LC isolation networks",
"doi": null,
"abstractUrl": "/proceedings-article/vts/2004/21340347/12OmNBJw9Sw",
"parentPublication": {
"id": "proceedings/vts/2004/2134/0",
"title": "22nd IEEE VLSI Test Symposium, 2004. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccad/1992/3010/0/00279406",
"title": "Configuration of boundary scan chain for optimal testing of clusters of non boundary scan devices",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/1992/00279406/12OmNrIae6F",
"parentPublication": {
"id": "proceedings/iccad/1992/3010/0",
"title": "1992 IEEE/ACM International Conference on Computer-Aided Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/1989/1947/0/00037804",
"title": "A boundary scan architecture using multiple-valued logic",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/1989/00037804/12OmNrMHOeA",
"parentPublication": {
"id": "proceedings/ismvl/1989/1947/0",
"title": "Proceedings The Nineteenth International Symposium on Multiple-Valued Logic",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/test/1995/2992/0/00529917",
"title": "Improved boundary scan design",
"doi": null,
"abstractUrl": "/proceedings-article/test/1995/00529917/12OmNrkBwGq",
"parentPublication": {
"id": "proceedings/test/1995/2992/0",
"title": "Proceedings of 1995 IEEE International Test Conference (ITC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/test/1993/1430/0/00470705",
"title": "Utilizing boundary scan to implement BIST",
"doi": null,
"abstractUrl": "/proceedings-article/test/1993/00470705/12OmNvk7JXE",
"parentPublication": {
"id": "proceedings/test/1993/1430/0",
"title": "Proceedings of IEEE International Test Conference - (ITC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/test/1989/9999/0/00082358",
"title": "Testing of glue logic interconnects using boundary scan architecture",
"doi": null,
"abstractUrl": "/proceedings-article/test/1989/00082358/12OmNwE9Ozz",
"parentPublication": {
"id": "proceedings/test/1989/9999/0",
"title": "1989 International Test Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itc/2009/4868/0/05355662",
"title": "Testing bridges to nowhere - combining Boundary Scan and capacitive sensing",
"doi": null,
"abstractUrl": "/proceedings-article/itc/2009/05355662/12OmNwoPtkd",
"parentPublication": {
"id": "proceedings/itc/2009/4868/0",
"title": "2009 International Test Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itc/2008/2402/0/04700580",
"title": "Augmenting Boundary-Scan Tests for Enhanced Defect Coverage",
"doi": null,
"abstractUrl": "/proceedings-article/itc/2008/04700580/12OmNyRPgJS",
"parentPublication": {
"id": "proceedings/itc/2008/2402/0",
"title": "2008 IEEE International Test Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ats/1993/3930/0/00398806",
"title": "The driver/receiver conflict problem in interconnect testing with boundary-scan",
"doi": null,
"abstractUrl": "/proceedings-article/ats/1993/00398806/12OmNzvz6Fp",
"parentPublication": {
"id": "proceedings/ats/1993/3930/0",
"title": "Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "13bd1eJgoia",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "13bd1eSlyu4",
"doi": "10.1109/VR.2018.8446598",
"title": "Smart Choices for Deviceless and Device-Based Manipulation in Immersive Virtual Reality",
"normalizedTitle": "Smart Choices for Deviceless and Device-Based Manipulation in Immersive Virtual Reality",
"abstract": "The choice of a suitable method for object manipulation is one of the most critical aspects of virtual environment design. It has been shown that different environments or applications might benefit from direct manipulation approaches, while others might be more usable with indirect ones, exploiting, for example, three dimensional virtual widgets. When it comes to mid-air interactions, the success of a manipulation technique is not only defined by the kind of application but also by the hardware setup, especially when specific restrictions exist. In this paper we present an experimental evaluation of different techniques and hardware for mid-air object manipulation in immersive virtual environments (IVE). We compared task performances using both deviceless and device-based tracking solutions, combined with direct and widget-based approaches. We also tested, in the case of freehand manipulation, the effects of different visual feedback, comparing the use of a realistic virtual hand rendering with a simple cursor-like visualization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The choice of a suitable method for object manipulation is one of the most critical aspects of virtual environment design. It has been shown that different environments or applications might benefit from direct manipulation approaches, while others might be more usable with indirect ones, exploiting, for example, three dimensional virtual widgets. When it comes to mid-air interactions, the success of a manipulation technique is not only defined by the kind of application but also by the hardware setup, especially when specific restrictions exist. In this paper we present an experimental evaluation of different techniques and hardware for mid-air object manipulation in immersive virtual environments (IVE). We compared task performances using both deviceless and device-based tracking solutions, combined with direct and widget-based approaches. We also tested, in the case of freehand manipulation, the effects of different visual feedback, comparing the use of a realistic virtual hand rendering with a simple cursor-like visualization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The choice of a suitable method for object manipulation is one of the most critical aspects of virtual environment design. It has been shown that different environments or applications might benefit from direct manipulation approaches, while others might be more usable with indirect ones, exploiting, for example, three dimensional virtual widgets. When it comes to mid-air interactions, the success of a manipulation technique is not only defined by the kind of application but also by the hardware setup, especially when specific restrictions exist. In this paper we present an experimental evaluation of different techniques and hardware for mid-air object manipulation in immersive virtual environments (IVE). We compared task performances using both deviceless and device-based tracking solutions, combined with direct and widget-based approaches. We also tested, in the case of freehand manipulation, the effects of different visual feedback, comparing the use of a realistic virtual hand rendering with a simple cursor-like visualization.",
"fno": "08446598",
"keywords": [
"Data Visualisation",
"Interactive Systems",
"Virtual Reality",
"Immersive Virtual Environments",
"Freehand Manipulation",
"Realistic Virtual Hand",
"Smart Choices",
"Immersive Virtual Reality",
"Critical Aspects",
"Virtual Environment Design",
"Direct Manipulation Approaches",
"Indirect Ones",
"Dimensional Virtual Widgets",
"Mid Air Interactions",
"Manipulation Technique",
"Hardware Setup",
"Experimental Evaluation",
"Mid Air Object Manipulation",
"Visual Feedback",
"Specific Restrictions",
"Deviceless Tracking Solutions",
"Device Based Tracking Solutions",
"IVE",
"Realistic Virtual Hand Rendering",
"Cursor Like Visualization",
"Task Analysis",
"Three Dimensional Displays",
"Visualization",
"Virtual Environments",
"Pins",
"Tracking",
"Human Centered Computing Interaction Techniques Human Centered Computing User Studies Human Centered Computing HCI Design And Evaluation Methods Human Centered Computing Virtual Reality"
],
"authors": [
{
"affiliation": "University of Verona",
"fullName": "Fabio M. Caputo",
"givenName": "Fabio M.",
"surname": "Caputo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "INESC-ID Lisboa",
"fullName": "Daniel Mendes",
"givenName": "Daniel",
"surname": "Mendes",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Verona",
"fullName": "Alessia Bonetti",
"givenName": "Alessia",
"surname": "Bonetti",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Verona",
"fullName": "Giacomo Saletti",
"givenName": "Giacomo",
"surname": "Saletti",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Verona",
"fullName": "Andrea Giachetti",
"givenName": "Andrea",
"surname": "Giachetti",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-03-01T00:00:00",
"pubType": "proceedings",
"pages": "1-2",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-3365-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08446346",
"articleId": "13bd1fHrlRY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08446410",
"articleId": "13bd1gzWkRf",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isuvr/2017/3091/0/3091a010",
"title": "Duplication Based Distance-Free Freehand Virtual Object Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2017/3091a010/12OmNApcu9E",
"parentPublication": {
"id": "proceedings/isuvr/2017/3091/0",
"title": "2017 International Symposium on Ubiquitous Virtual Reality (ISUVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2017/3588/0/3588a169",
"title": "An Immersive Visualization Study on Molecules Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2017/3588a169/12OmNApcubh",
"parentPublication": {
"id": "proceedings/svr/2017/3588/0",
"title": "2017 19th Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2017/6716/0/07893332",
"title": "Mid-air modeling with Boolean operations in VR",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2017/07893332/12OmNyGbI5i",
"parentPublication": {
"id": "proceedings/3dui/2017/6716/0",
"title": "2017 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446189",
"title": "Towards Revisiting Passability Judgments in Real and Immersive Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446189/13bd1fdV4lC",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2019/03/08640072",
"title": "Comfortable Immersive Analytics With the VirtualDesk Metaphor",
"doi": null,
"abstractUrl": "/magazine/cg/2019/03/08640072/17D45VObpOa",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imet/2022/7016/0/09929445",
"title": "Explorative Study on Asymmetric Sketch Interactions for Object Retrieval in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/imet/2022/09929445/1HYuRB6nAty",
"parentPublication": {
"id": "proceedings/imet/2022/7016/0",
"title": "2022 International Conference on Interactive Media, Smart Systems and Emerging Technologies (IMET)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/05/10049698",
"title": "Gaining the High Ground: Teleportation to Mid-Air Targets in Immersive Virtual Environments",
"doi": null,
"abstractUrl": "/journal/tg/2023/05/10049698/1KYotugT0xW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798155",
"title": "Grasping objects in immersive Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798155/1cJ0SxJIrrW",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798036",
"title": "Vibro-tactile Feedback for Real-world Awareness in Immersive Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798036/1cJ15HGOeqc",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/09068439",
"title": "PinNPivot: Object Manipulation Using Pins in Immersive Virtual Environments",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/09068439/1j3163JSb8A",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBqdr70",
"title": "Proceedings of the IEEE Workshop on Visual Motion",
"acronym": "wvm",
"groupId": "1000794",
"volume": "0",
"displayVolume": "0",
"year": "1991",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxdDFI5",
"doi": "10.1109/WVM.1991.212766",
"title": "Motion tracking on the spatiotemporal surface",
"normalizedTitle": "Motion tracking on the spatiotemporal surface",
"abstract": "The spatiotemporal (ST) surface has been shown to be a useful representation of projected scene dynamics. The authors previous use of this representation has focused on geometric recovery of scene static structure from the analysis of relative motions on the moving image plane. That earlier work (Int. J. of Comput. Vis., vol.2, no.1, p.51-72 (1989); p.33-50, (1989); vol.1, no.1, p.7-55 (1987)), exploited the implicit partitioning of motions along epipolar lines to enable search-free feature tracking and position estimation. The ST manifolds provide explicit information about feature 3D contiguity, and their use leads to the recovery of feature 3D position, object 3D contours, and scene 3D surfaces. The authors have turned their attention to the task of interpretating non-static scenes, and track and estimate motions of independently moving objects and background by their appearance and behavior on the ST surface. Selecting the most reliable and discriminating information in the scene, the system demonstrates robust feature tracking over a large range of feature sizes and velocities. When coupled with the more mature epipolar-plane image analysis system, this motion analysis capability will enable camera solving, dynamics tracking, and scene reconstruction within a unified framework.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "The spatiotemporal (ST) surface has been shown to be a useful representation of projected scene dynamics. The authors previous use of this representation has focused on geometric recovery of scene static structure from the analysis of relative motions on the moving image plane. That earlier work (Int. J. of Comput. Vis., vol.2, no.1, p.51-72 (1989); p.33-50, (1989); vol.1, no.1, p.7-55 (1987)), exploited the implicit partitioning of motions along epipolar lines to enable search-free feature tracking and position estimation. The ST manifolds provide explicit information about feature 3D contiguity, and their use leads to the recovery of feature 3D position, object 3D contours, and scene 3D surfaces. The authors have turned their attention to the task of interpretating non-static scenes, and track and estimate motions of independently moving objects and background by their appearance and behavior on the ST surface. Selecting the most reliable and discriminating information in the scene, the system demonstrates robust feature tracking over a large range of feature sizes and velocities. When coupled with the more mature epipolar-plane image analysis system, this motion analysis capability will enable camera solving, dynamics tracking, and scene reconstruction within a unified framework.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The spatiotemporal (ST) surface has been shown to be a useful representation of projected scene dynamics. The authors previous use of this representation has focused on geometric recovery of scene static structure from the analysis of relative motions on the moving image plane. That earlier work (Int. J. of Comput. Vis., vol.2, no.1, p.51-72 (1989); p.33-50, (1989); vol.1, no.1, p.7-55 (1987)), exploited the implicit partitioning of motions along epipolar lines to enable search-free feature tracking and position estimation. The ST manifolds provide explicit information about feature 3D contiguity, and their use leads to the recovery of feature 3D position, object 3D contours, and scene 3D surfaces. The authors have turned their attention to the task of interpretating non-static scenes, and track and estimate motions of independently moving objects and background by their appearance and behavior on the ST surface. Selecting the most reliable and discriminating information in the scene, the system demonstrates robust feature tracking over a large range of feature sizes and velocities. When coupled with the more mature epipolar-plane image analysis system, this motion analysis capability will enable camera solving, dynamics tracking, and scene reconstruction within a unified framework.",
"fno": "00212766",
"keywords": [
"Motion Estimation",
"Tracking",
"Spatio Temporal Surface",
"Spatiotemporal Surface",
"Projected Scene Dynamics",
"Geometric Recovery",
"Discriminating Information",
"Robust",
"Feature Tracking",
"Epipolar Plane Image Analysis System",
"Motion Analysis",
"Camera Solving",
"Dynamics Tracking",
"Scene Reconstruction",
"Tracking",
"Spatiotemporal Phenomena",
"Layout",
"Image Motion Analysis",
"Motion Analysis",
"Motion Estimation",
"Image Analysis",
"Surface Reconstruction",
"Robustness",
"Cameras"
],
"authors": [
{
"affiliation": "Artificial Intelligence Center, SRI Int., Menlo Park, CA, USA",
"fullName": "H.H. Baker",
"givenName": "H.H.",
"surname": "Baker",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Artificial Intelligence Center, SRI Int., Menlo Park, CA, USA",
"fullName": "T.D. Garvey",
"givenName": "T.D.",
"surname": "Garvey",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "wvm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1991-01-01T00:00:00",
"pubType": "proceedings",
"pages": "340,341,342,343,344,345",
"year": "1991",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": null,
"next": {
"fno": "00212767",
"articleId": "12OmNwDACp6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/visapp/2014/8133/1/07294874",
"title": "Uncertainty fusion based object recognition and tracking in maritime scenes using spatiotemporal active contours",
"doi": null,
"abstractUrl": "/proceedings-article/visapp/2014/07294874/12OmNAQJzST",
"parentPublication": {
"id": "proceedings/visapp/2014/8133/1",
"title": "2014 International Conference on Computer Vision Theory and Applications (VISAPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1990/2057/0/00139490",
"title": "Computing spatiotemporal surface flow",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1990/00139490/12OmNC0y5FW",
"parentPublication": {
"id": "proceedings/iccv/1990/2057/0",
"title": "Proceedings Third International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206728",
"title": "Spatiotemporal stereo via spatiotemporal quadric element (stequel) matching",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206728/12OmNqAU6nF",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1993/3880/0/00341007",
"title": "Spatiotemporal representation of dynamic objects",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341007/12OmNqBtiUz",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1994/5825/0/00323865",
"title": "MDL-based spatiotemporal segmentation from motion in a long image sequence",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1994/00323865/12OmNxFaLfN",
"parentPublication": {
"id": "proceedings/cvpr/1994/5825/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1988/0862/0/00196209",
"title": "Generalizing epipolar-plane image analysis on the spatiotemporal surface",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1988/00196209/12OmNxFsmyM",
"parentPublication": {
"id": "proceedings/cvpr/1988/0862/0",
"title": "Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1994/6952/2/00413575",
"title": "Motion perception using spatiotemporal frequency analysis",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1994/00413575/12OmNy7QfkT",
"parentPublication": {
"id": "proceedings/icip/1994/6952/2",
"title": "Proceedings of 1st International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1991/2148/0/00139706",
"title": "Long-range spatiotemporal motion understanding using spatiotemporal flow curves",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1991/00139706/12OmNzcxYZx",
"parentPublication": {
"id": "proceedings/cvpr/1991/2148/0",
"title": "Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/1/00118130",
"title": "Cyclic motion detection using spatiotemporal surfaces and curves",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118130/12OmNzwZ6kF",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800b977",
"title": "Active 3D Motion Visualization Based on Spatiotemporal Light-Ray Integration",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800b977/1m3ooMFEqCk",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAWH9tO",
"title": "Proceedings of International Conference on Acoustics, Speech and Signal Processing (CASSP'02)",
"acronym": "icassp",
"groupId": "1000002",
"volume": "4",
"displayVolume": "4",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyRPgVi",
"doi": "10.1109/ICASSP.2002.5745450",
"title": "Real-time camera motion classification for content-based indexing and retrieval using templates",
"normalizedTitle": "Real-time camera motion classification for content-based indexing and retrieval using templates",
"abstract": "In this paper, a simple approach to camera motion analysis is proposed to index videos compressed using MPEG (Moving Picture Experts Group) −1, 2 in faster than real time. Specifically, this paper presents a template-matching algorithm to classify basic camera operations. The proposed approach involves 1) the construction of motion vector fields (MVFs) and filtering out noise; and 2) the sub-MVFs which come from dividing an MVF into several non-overlapping areas for the template matching of camera motions. A fine segmentation also can be obtained for a video, based on the homogeneity of the camera operation in each unit. The advantages of this method lie in real-time processing and robustness to noisy environments such as false motion vectors and object motions. The experimental results show that the proposed algorithm successfully classifies the camera movements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, a simple approach to camera motion analysis is proposed to index videos compressed using MPEG (Moving Picture Experts Group) −1, 2 in faster than real time. Specifically, this paper presents a template-matching algorithm to classify basic camera operations. The proposed approach involves 1) the construction of motion vector fields (MVFs) and filtering out noise; and 2) the sub-MVFs which come from dividing an MVF into several non-overlapping areas for the template matching of camera motions. A fine segmentation also can be obtained for a video, based on the homogeneity of the camera operation in each unit. The advantages of this method lie in real-time processing and robustness to noisy environments such as false motion vectors and object motions. The experimental results show that the proposed algorithm successfully classifies the camera movements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, a simple approach to camera motion analysis is proposed to index videos compressed using MPEG (Moving Picture Experts Group) −1, 2 in faster than real time. Specifically, this paper presents a template-matching algorithm to classify basic camera operations. The proposed approach involves 1) the construction of motion vector fields (MVFs) and filtering out noise; and 2) the sub-MVFs which come from dividing an MVF into several non-overlapping areas for the template matching of camera motions. A fine segmentation also can be obtained for a video, based on the homogeneity of the camera operation in each unit. The advantages of this method lie in real-time processing and robustness to noisy environments such as false motion vectors and object motions. The experimental results show that the proposed algorithm successfully classifies the camera movements.",
"fno": "05745450",
"keywords": [
"Optical Imaging",
"Adaptive Optics",
"Manuals",
"Motion Pictures",
"Spatiotemporal Phenomena",
"Indexing",
"Cameras"
],
"authors": [
{
"affiliation": "Georgia Institute of Technology, Center for Signal and Image Processing, Atlanta, 30325, U.S.A.",
"fullName": "Sangkeun Lee",
"givenName": "Sangkeun",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology, Center for Signal and Image Processing, Atlanta, 30325, U.S.A.",
"fullName": "Monson H. Hayes",
"givenName": "Monson H.",
"surname": "Hayes",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icassp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-05-01T00:00:00",
"pubType": "proceedings",
"pages": "IV-3664-IV-3667",
"year": "2002",
"issn": "1520-6149",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05745449",
"articleId": "12OmNAtst8K",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05745451",
"articleId": "12OmNBpEeQC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2006/0224/0/02240011",
"title": "Camera Motions Improve the Sensation of Walking in Virtual Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2006/02240011/12OmNqFrGss",
"parentPublication": {
"id": "proceedings/vr/2006/0224/0",
"title": "IEEE Virtual Reality Conference (VR 2006)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2008/2357/0/04594664",
"title": "An indexing scheme for efficient camera angle invariant image retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2008/04594664/12OmNs4S8Lu",
"parentPublication": {
"id": "proceedings/cit/2008/2357/0",
"title": "2008 8th IEEE International Conference on Computer and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccea/2010/6079/1/05445823",
"title": "Plays from Motions for Baseball Video Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/iccea/2010/05445823/12OmNvqmUJr",
"parentPublication": {
"id": "proceedings/iccea/2010/6079/1",
"title": "2010 Second International Conference on Computer Engineering and Applications (ICCEA 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457f816",
"title": "Event-Based Visual Inertial Odometry",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457f816/12OmNxETa9z",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1999/0164/1/01640190",
"title": "Estimation of Composite Object and Camera Image Motion",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1999/01640190/12OmNxFJXtY",
"parentPublication": {
"id": "proceedings/iccv/1999/0164/1",
"title": "Proceedings of the Seventh IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2006/2542/0/25420007",
"title": "Interpreting Camera Operations in the Context of Content-based Video Indexing and Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2006/25420007/12OmNy5R3yN",
"parentPublication": {
"id": "proceedings/crv/2006/2542/0",
"title": "The 3rd Canadian Conference on Computer and Robot Vision (CRV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2017/0560/0/08026297",
"title": "Toward efficient background reconstruction for 3D-view synthesis in dynamic scenes",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2017/08026297/12OmNzT7OuF",
"parentPublication": {
"id": "proceedings/icmew/2017/0560/0",
"title": "2017 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2016/0836/0/07504721",
"title": "Space-sharing AR interaction on multiple mobile devices with a depth camera",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504721/12OmNzZ5ogy",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2014/02/mmu2014020011",
"title": "Toward Haptic Cinematography: Enhancing Movie Experiences with Camera-Based Haptic Effects",
"doi": null,
"abstractUrl": "/magazine/mu/2014/02/mmu2014020011/13rRUILtJnT",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/10/ttg2013101677",
"title": "Content-Aware Video Retargeting Using Object-Preserving Warping",
"doi": null,
"abstractUrl": "/journal/tg/2013/10/ttg2013101677/13rRUxASuMC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyoiYVr",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzICEOm",
"doi": "10.1109/CVPR.2017.786",
"title": "Temporal Residual Networks for Dynamic Scene Recognition",
"normalizedTitle": "Temporal Residual Networks for Dynamic Scene Recognition",
"abstract": "This paper combines three contributions to establish a new state-of-the-art in dynamic scene recognition. First, we present a novel ConvNet architecture based on temporal residual units that is fully convolutional in spacetime. Our model augments spatial ResNets with convolutions across time to hierarchically add temporal residuals as the depth of the network increases. Second, existing approaches to video-based recognition are categorized and a baseline of seven previously top performing algorithms is selected for comparative evaluation on dynamic scenes. Third, we introduce a new and challenging video database of dynamic scenes that more than doubles the size of those previously available. This dataset is explicitly split into two subsets of equal size that contain videos with and without camera motion to allow for systematic study of how this variable interacts with the defining dynamics of the scene per se. Our evaluations verify the particular strengths and weaknesses of the baseline algorithms with respect to various scene classes and camera motion parameters. Finally, our temporal ResNet boosts recognition performance and establishes a new state-of-the-art on dynamic scene recognition, as well as on the complementary task of action recognition.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper combines three contributions to establish a new state-of-the-art in dynamic scene recognition. First, we present a novel ConvNet architecture based on temporal residual units that is fully convolutional in spacetime. Our model augments spatial ResNets with convolutions across time to hierarchically add temporal residuals as the depth of the network increases. Second, existing approaches to video-based recognition are categorized and a baseline of seven previously top performing algorithms is selected for comparative evaluation on dynamic scenes. Third, we introduce a new and challenging video database of dynamic scenes that more than doubles the size of those previously available. This dataset is explicitly split into two subsets of equal size that contain videos with and without camera motion to allow for systematic study of how this variable interacts with the defining dynamics of the scene per se. Our evaluations verify the particular strengths and weaknesses of the baseline algorithms with respect to various scene classes and camera motion parameters. Finally, our temporal ResNet boosts recognition performance and establishes a new state-of-the-art on dynamic scene recognition, as well as on the complementary task of action recognition.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper combines three contributions to establish a new state-of-the-art in dynamic scene recognition. First, we present a novel ConvNet architecture based on temporal residual units that is fully convolutional in spacetime. Our model augments spatial ResNets with convolutions across time to hierarchically add temporal residuals as the depth of the network increases. Second, existing approaches to video-based recognition are categorized and a baseline of seven previously top performing algorithms is selected for comparative evaluation on dynamic scenes. Third, we introduce a new and challenging video database of dynamic scenes that more than doubles the size of those previously available. This dataset is explicitly split into two subsets of equal size that contain videos with and without camera motion to allow for systematic study of how this variable interacts with the defining dynamics of the scene per se. Our evaluations verify the particular strengths and weaknesses of the baseline algorithms with respect to various scene classes and camera motion parameters. Finally, our temporal ResNet boosts recognition performance and establishes a new state-of-the-art on dynamic scene recognition, as well as on the complementary task of action recognition.",
"fno": "0457h435",
"keywords": [
"Image Motion Analysis",
"Image Recognition",
"Video Signal Processing",
"Temporal Residual Networks",
"Dynamic Scene Recognition",
"Temporal Residual Units",
"Temporal Residuals",
"Video Based Recognition",
"Dynamic Scenes",
"Temporal Res Net Boosts Recognition Performance",
"Conv Net Architecture",
"Spatial Res Nets",
"Camera Motion",
"Baseline Algorithms",
"Action Recognition",
"Spatiotemporal Phenomena",
"Dynamics",
"Cameras",
"Databases",
"Image Recognition",
"Kernel"
],
"authors": [
{
"affiliation": null,
"fullName": "Christoph Feichtenhofer",
"givenName": "Christoph",
"surname": "Feichtenhofer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Axel Pinz",
"givenName": "Axel",
"surname": "Pinz",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Richard P. Wildes",
"givenName": "Richard P.",
"surname": "Wildes",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-07-01T00:00:00",
"pubType": "proceedings",
"pages": "7435-7444",
"year": "2017",
"issn": "1063-6919",
"isbn": "978-1-5386-0457-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "0457h426",
"articleId": "12OmNrH1PER",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "0457h445",
"articleId": "12OmNBlXs3a",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2012/1226/0/165P2A15",
"title": "Dynamic scene understanding: The role of orientation features in space and time in scene classification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/165P2A15/12OmNBV9Ikj",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c681",
"title": "Bags of Spacetime Energies for Dynamic Scene Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c681/12OmNwDACyg",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2012/1611/0/06239184",
"title": "Real-time gesture recognition using bio inspired 3D vision sensor",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2012/06239184/12OmNyL0TKk",
"parentPublication": {
"id": "proceedings/cvprw/2012/1611/0",
"title": "2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/12/07399428",
"title": "Dynamic Scene Recognition with Complementary Spatiotemporal Features",
"doi": null,
"abstractUrl": "/journal/tp/2016/12/07399428/13rRUxOdD9w",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200c513",
"title": "Super Resolve Dynamic Scene from Continuous Spike Streams",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c513/1BmEhlqauQ0",
"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/281200h456",
"title": "Spatio-Temporal Dynamic Inference Network for Group Activity Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200h456/1BmJuUSFXck",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/05/10049689",
"title": "NeRFPlayer: A Streamable Dynamic Scene Representation with Decomposed Neural Radiance Fields",
"doi": null,
"abstractUrl": "/journal/tg/2023/05/10049689/1KYolO0fxks",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/04/09089319",
"title": "Scene Summarization via Motion Normalization",
"doi": null,
"abstractUrl": "/journal/tg/2021/04/09089319/1jDwB51dnqg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/02/09151354",
"title": "Spatiotemporal Bundle Adjustment for Dynamic 3D Human Reconstruction in the Wild",
"doi": null,
"abstractUrl": "/journal/tp/2022/02/09151354/1lPCkW5UbPG",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ecie/2021/1869/0/186900a310",
"title": "Spatiotemporal Residual Network for Dynamic Scene Recognition based on ResNeXt",
"doi": null,
"abstractUrl": "/proceedings-article/ecie/2021/186900a310/1sXnTF10eU8",
"parentPublication": {
"id": "proceedings/ecie/2021/1869/0",
"title": "2021 International Conference on Electronics, Circuits and Information Engineering (ECIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1G4EUUmGcrS",
"title": "2022 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"acronym": "icmew",
"groupId": "1801805",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1G4EZmupnoY",
"doi": "10.1109/ICMEW56448.2022.9859348",
"title": "Bottleneck Detection in Crowded Video Scenes Utilizing Lagrangian Motion Analysis Via Density and Arc Length Measures",
"normalizedTitle": "Bottleneck Detection in Crowded Video Scenes Utilizing Lagrangian Motion Analysis Via Density and Arc Length Measures",
"abstract": "Bottleneck situations can occur in overcrowded areas such as entrances or narrowed passages and are associated with a great danger to the life and health of involved people. The automated detection of such bottlenecks is the first crucial step to mitigate these dangers. In this work, we utilize the dynamics of motions using the Lagrangian approach from the analysis of dynamic systems to analyze profiles of groups of people. The derived features, which are observed by the long-term dependent motion dynamics, are described by two-dimensional Lagrangian fields. We extend the underlying Lagrangian framework by a novel measure to capture the density of motion and hence people in the context of crowd analysis. Further, we show how this novel density measure can be combined with the established arc length measure for the detection of bottlenecks in videos. Experimental evaluations show a 5% improvement over the state-of-the-art for spatiotemporal bottleneck detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Bottleneck situations can occur in overcrowded areas such as entrances or narrowed passages and are associated with a great danger to the life and health of involved people. The automated detection of such bottlenecks is the first crucial step to mitigate these dangers. In this work, we utilize the dynamics of motions using the Lagrangian approach from the analysis of dynamic systems to analyze profiles of groups of people. The derived features, which are observed by the long-term dependent motion dynamics, are described by two-dimensional Lagrangian fields. We extend the underlying Lagrangian framework by a novel measure to capture the density of motion and hence people in the context of crowd analysis. Further, we show how this novel density measure can be combined with the established arc length measure for the detection of bottlenecks in videos. Experimental evaluations show a 5% improvement over the state-of-the-art for spatiotemporal bottleneck detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Bottleneck situations can occur in overcrowded areas such as entrances or narrowed passages and are associated with a great danger to the life and health of involved people. The automated detection of such bottlenecks is the first crucial step to mitigate these dangers. In this work, we utilize the dynamics of motions using the Lagrangian approach from the analysis of dynamic systems to analyze profiles of groups of people. The derived features, which are observed by the long-term dependent motion dynamics, are described by two-dimensional Lagrangian fields. We extend the underlying Lagrangian framework by a novel measure to capture the density of motion and hence people in the context of crowd analysis. Further, we show how this novel density measure can be combined with the established arc length measure for the detection of bottlenecks in videos. Experimental evaluations show a 5% improvement over the state-of-the-art for spatiotemporal bottleneck detection.",
"fno": "09859348",
"keywords": [
"Density Measurement",
"Image Motion Analysis",
"Lagrangian Field Theory",
"Object Detection",
"Object Tracking",
"Spatiotemporal Phenomena",
"Video Signal Processing",
"Video Surveillance",
"Automated Detection",
"Lagrangian Approach",
"Dynamic Systems",
"Long Term Dependent Motion Dynamics",
"Two Dimensional Lagrangian Fields",
"Underlying Lagrangian Framework",
"Crowd Analysis",
"Novel Density Measure",
"Established Arc Length Measure",
"Spatiotemporal Bottleneck Detection",
"Crowded Video Scenes",
"Lagrangian Motion Analysis",
"Arc Length Measures",
"Bottleneck Situations",
"Overcrowded Areas",
"Entrances",
"Passages",
"Great Danger",
"Involved People",
"Density Measurement",
"Motion Segmentation",
"Dynamics",
"Length Measurement",
"Streaming Media",
"Optical Variables Measurement",
"Spatiotemporal Phenomena",
"Optical Flow",
"Motion Segmentation",
"Motion Analysis",
"Spatio Temporal Detection",
"Time Dependent Crowd Motion Dynamics"
],
"authors": [
{
"affiliation": "Technische Universitüt Berlin,Communication Systems Group",
"fullName": "Maik Simon",
"givenName": "Maik",
"surname": "Simon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technische Universitüt Berlin,Communication Systems Group",
"fullName": "Erik Bochinski",
"givenName": "Erik",
"surname": "Bochinski",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technische Universitüt Berlin,Communication Systems Group",
"fullName": "Markus Küchhold",
"givenName": "Markus",
"surname": "Küchhold",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technische Universitüt Berlin,Communication Systems Group",
"fullName": "Thomas Sikora",
"givenName": "Thomas",
"surname": "Sikora",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icmew",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-07-01T00:00:00",
"pubType": "proceedings",
"pages": "1-6",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-7218-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09859426",
"articleId": "1G4F4CwHspq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09859266",
"articleId": "1G4F4NAcJxe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/avss/2012/4797/0/4797a398",
"title": "Detecting People Carrying Objects Utilizing Lagrangian Dynamics",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2012/4797a398/12OmNB1eJzR",
"parentPublication": {
"id": "proceedings/avss/2012/4797/0",
"title": "2012 IEEE Ninth International Conference on Advanced Video and Signal-Based Surveillance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/e2emon/2005/9249/0/01564476",
"title": "Utilizing higher order statistics of packet interarrival times for bottleneck detection",
"doi": null,
"abstractUrl": "/proceedings-article/e2emon/2005/01564476/12OmNsdo6u9",
"parentPublication": {
"id": "proceedings/e2emon/2005/9249/0",
"title": "3rd IEEE/IFIP Workshop on End-to-End Monitoring Techniques and Services",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2014/2874/0/2874a033",
"title": "Scalable Lagrangian-Based Attribute Space Projection for Multivariate Unsteady Flow Data",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2014/2874a033/12OmNyL0THg",
"parentPublication": {
"id": "proceedings/pacificvis/2014/2874/0",
"title": "2014 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/infcom/2003/7752/3/01209229",
"title": "Measuring bottleneck bandwidth of targeted path segments",
"doi": null,
"abstractUrl": "/proceedings-article/infcom/2003/01209229/12OmNypIYFj",
"parentPublication": {
"id": "proceedings/infcom/2003/7752/3",
"title": "IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2008/02/mcg2008020024",
"title": "Informational Aesthetics Measures",
"doi": null,
"abstractUrl": "/magazine/cg/2008/02/mcg2008020024/13rRUygT7Aj",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/09/06529086",
"title": "Lagrangian Approaches to Storage of Spatio-Temporal Network Datasets",
"doi": null,
"abstractUrl": "/journal/tk/2014/09/06529086/13rRUynHujv",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2019/01/08536433",
"title": "A Data-Centric Approach for Social and Spatiotemporal Sensing in Smart Cities",
"doi": null,
"abstractUrl": "/magazine/ic/2019/01/08536433/17D45W2WyAy",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2022/6382/0/09959660",
"title": "Utilizing Crowd Collectiveness to Enhance Bottleneck Detection Based on the Lagrangian Framework",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2022/09959660/1Iz5iuzw9H2",
"parentPublication": {
"id": "proceedings/avss/2022/6382/0",
"title": "2022 18th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800a510",
"title": "Bottleneck-Aware Task Scheduling Based on Per-Stage and Multi-ML Profiling",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800a510/1dPok1E3pdK",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0",
"title": "2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2019/0990/0/08909861",
"title": "Video-based Bottleneck Detection utilizing Lagrangian Dynamics in Crowded Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2019/08909861/1febIsFnOP6",
"parentPublication": {
"id": "proceedings/avss/2019/0990/0",
"title": "2019 16th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwLOYSu",
"title": "2017 International Conference on Cyberworlds (CW)",
"acronym": "cw",
"groupId": "1000175",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCga1Qh",
"doi": "10.1109/CW.2017.13",
"title": "Scattered Data Points Fitting Using Ball B-Spline Curves Based on Particle Swarm Optimization",
"normalizedTitle": "Scattered Data Points Fitting Using Ball B-Spline Curves Based on Particle Swarm Optimization",
"abstract": "Scattered data fitting is always a challenging problem in the fields of geometric modeling and computer aided design. As the skeleton based three-dimensional solid model representation, the Ball B-Spline Curve is suitable to fit the tubular scattered data points. We study the problem of fitting the scattered data points with Ball B-spline curves (BBSCs) and propose the corresponding fitting algorithm based on the Particle Swarm Optimization (PSO) algorithm. In this process, we face three critical and difficult sub problems: (1) parameterization of the data points, (2) determination of the knot vector and (3) calculation of the control radii. All of them are multidimensional and nonlinear, especially the calculation of the parametric values. The parallelism of the PSO algorithm provides a high optimization, which is more suitable for solving nonlinear, nondifferentiable and multi-modal optimization problems. So we use it to solve the scattered data fitting problem. The PSO is applied in three steps to solve them. Firstly, we determine the parametric values of the data points with PSO. Then we compute the knot vector based on the parametric values of the data points. At last, we get the radius function. The experiments on the shell surface, the crescent surface and the real-world models verify the accuracy and flexibility of the method. The research can be widely used in the computer aided design, animation and model analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Scattered data fitting is always a challenging problem in the fields of geometric modeling and computer aided design. As the skeleton based three-dimensional solid model representation, the Ball B-Spline Curve is suitable to fit the tubular scattered data points. We study the problem of fitting the scattered data points with Ball B-spline curves (BBSCs) and propose the corresponding fitting algorithm based on the Particle Swarm Optimization (PSO) algorithm. In this process, we face three critical and difficult sub problems: (1) parameterization of the data points, (2) determination of the knot vector and (3) calculation of the control radii. All of them are multidimensional and nonlinear, especially the calculation of the parametric values. The parallelism of the PSO algorithm provides a high optimization, which is more suitable for solving nonlinear, nondifferentiable and multi-modal optimization problems. So we use it to solve the scattered data fitting problem. The PSO is applied in three steps to solve them. Firstly, we determine the parametric values of the data points with PSO. Then we compute the knot vector based on the parametric values of the data points. At last, we get the radius function. The experiments on the shell surface, the crescent surface and the real-world models verify the accuracy and flexibility of the method. The research can be widely used in the computer aided design, animation and model analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Scattered data fitting is always a challenging problem in the fields of geometric modeling and computer aided design. As the skeleton based three-dimensional solid model representation, the Ball B-Spline Curve is suitable to fit the tubular scattered data points. We study the problem of fitting the scattered data points with Ball B-spline curves (BBSCs) and propose the corresponding fitting algorithm based on the Particle Swarm Optimization (PSO) algorithm. In this process, we face three critical and difficult sub problems: (1) parameterization of the data points, (2) determination of the knot vector and (3) calculation of the control radii. All of them are multidimensional and nonlinear, especially the calculation of the parametric values. The parallelism of the PSO algorithm provides a high optimization, which is more suitable for solving nonlinear, nondifferentiable and multi-modal optimization problems. So we use it to solve the scattered data fitting problem. The PSO is applied in three steps to solve them. Firstly, we determine the parametric values of the data points with PSO. Then we compute the knot vector based on the parametric values of the data points. At last, we get the radius function. The experiments on the shell surface, the crescent surface and the real-world models verify the accuracy and flexibility of the method. The research can be widely used in the computer aided design, animation and model analysis.",
"fno": "2089a126",
"keywords": [
"CAD",
"Computational Geometry",
"Curve Fitting",
"Particle Swarm Optimisation",
"Solid Modelling",
"Splines Mathematics",
"Ball B Spline Curves",
"Geometric Modeling",
"Computer Aided Design",
"Three Dimensional Solid Model Representation",
"Tubular Scattered Data Points",
"Corresponding Fitting Algorithm",
"Critical Sub Problems",
"Parametric Values",
"PSO Algorithm",
"Multimodal Optimization Problems",
"Scattered Data Fitting Problem",
"Particle Swarm Optimization Algorithm",
"Splines Mathematics",
"Skeleton",
"Particle Swarm Optimization",
"Optimization",
"Mathematical Model",
"Computational Modeling",
"Surface Reconstruction",
"Scatter Point",
"Fitting",
"Tubular Shape",
"Ball B Spline Curve",
"Particle Swarm Optimization"
],
"authors": [
{
"affiliation": null,
"fullName": "Xingce Wang",
"givenName": "Xingce",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zhongke Wu",
"givenName": "Zhongke",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Junchen Shen",
"givenName": "Junchen",
"surname": "Shen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Qianqian Jiang",
"givenName": "Qianqian",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yuanshuai Zhu",
"givenName": "Yuanshuai",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mingquan Zhou",
"givenName": "Mingquan",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-09-01T00:00:00",
"pubType": "proceedings",
"pages": "126-133",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-2089-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "2089a118",
"articleId": "12OmNCmpcVe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "2089a134",
"articleId": "12OmNwHQBcH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/wkdd/2010/5397/0/05432585",
"title": "Scattered Points Denoising of TC-Bézier Surface Fitting",
"doi": null,
"abstractUrl": "/proceedings-article/wkdd/2010/05432585/12OmNAlNiMA",
"parentPublication": {
"id": "proceedings/wkdd/2010/5397/0",
"title": "2010 3rd International Conference on Knowledge Discovery and Data Mining (WKDD 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2016/4400/0/4400a272",
"title": "A Balanced Surface Parameterization Method and Its Application to Spline Fitting",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2016/4400a272/12OmNBC8Awf",
"parentPublication": {
"id": "proceedings/icdh/2016/4400/0",
"title": "2016 6th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2013/2246/0/2246a252",
"title": "An Extension Algorithm for Ball B-Spline Curves with G2 Continuity",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2013/2246a252/12OmNC8MsKH",
"parentPublication": {
"id": "proceedings/cw/2013/2246/0",
"title": "2013 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2000/0643/0/06430163",
"title": "Reconstruction of B-Spline Surfaces from Scattered Data Points",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2000/06430163/12OmNwnH4Ua",
"parentPublication": {
"id": "proceedings/cgi/2000/0643/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06814978",
"title": "Fitting Multiple Curves to Point Clouds with Complicated Topological Structures",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06814978/12OmNxwncAi",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06814976",
"title": "TV-L1 Optimization for B-Spline Surface Reconstruction with Sharp Features",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06814976/12OmNyrZLDi",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2011/0868/0/06004090",
"title": "G1 Continuity Conics for Curve Fitting Using Particle Swarm Optimization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2011/06004090/12OmNzC5SQ8",
"parentPublication": {
"id": "proceedings/iv/2011/0868/0",
"title": "2011 15th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815018",
"title": "G2-Continuity Blending of Ball B-Spline Curve Using Extension",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815018/12OmNzX6coq",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2000/06/i0642",
"title": "Ordering and Parameterizing Scattered 3D Data for B-Spline Surface Approximation",
"doi": null,
"abstractUrl": "/journal/tp/2000/06/i0642/13rRUxOdD99",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdh/2020/9234/0/923400a248",
"title": "Stepwise iteration and optimization scheme for data fitting based on non-uniform B-spline",
"doi": null,
"abstractUrl": "/proceedings-article/icdh/2020/923400a248/1uGXWmJk7yU",
"parentPublication": {
"id": "proceedings/icdh/2020/9234/0",
"title": "2020 8th International Conference on Digital Home (ICDH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqGA5i8",
"title": "Computer Graphics and Applications, Pacific Conference on",
"acronym": "pg",
"groupId": "1000130",
"volume": "0",
"displayVolume": "0",
"year": "1999",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy1SFCx",
"doi": "10.1109/PCCGA.1999.803361",
"title": "Eigenanalysis and Continuity of Non-Uniform Doo-Sabin Surfaces",
"normalizedTitle": "Eigenanalysis and Continuity of Non-Uniform Doo-Sabin Surfaces",
"abstract": "In computer graphics and computer-aided geometric design, more and more subdivision schemes are being extensively used for free-form surfaces of arbitrary topology. The convergence and continuity analyses of uniform subdivision surfaces have been performed very well, but it is very difficult to prove the convergence and the continuity properties of non-uniform recursive subdivision surfaces (NURSSes, for short) because the subdivision matrix varies at each iteration step. This restricts widespread use of NURSSes, although NURSSes have a lot of advantages over uniform subdivision surfaces. In this paper, the concept of equivalent knot spacing is presented. A new technique for eigenanalysis, convergence and continuity analyses of non-uniform Doo-Sabin surfaces is proposed. Also, an interesting and important fact is found that the subdivision process of non-uniform Doo-Sabin surfaces may diverge sometime.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In computer graphics and computer-aided geometric design, more and more subdivision schemes are being extensively used for free-form surfaces of arbitrary topology. The convergence and continuity analyses of uniform subdivision surfaces have been performed very well, but it is very difficult to prove the convergence and the continuity properties of non-uniform recursive subdivision surfaces (NURSSes, for short) because the subdivision matrix varies at each iteration step. This restricts widespread use of NURSSes, although NURSSes have a lot of advantages over uniform subdivision surfaces. In this paper, the concept of equivalent knot spacing is presented. A new technique for eigenanalysis, convergence and continuity analyses of non-uniform Doo-Sabin surfaces is proposed. Also, an interesting and important fact is found that the subdivision process of non-uniform Doo-Sabin surfaces may diverge sometime.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In computer graphics and computer-aided geometric design, more and more subdivision schemes are being extensively used for free-form surfaces of arbitrary topology. The convergence and continuity analyses of uniform subdivision surfaces have been performed very well, but it is very difficult to prove the convergence and the continuity properties of non-uniform recursive subdivision surfaces (NURSSes, for short) because the subdivision matrix varies at each iteration step. This restricts widespread use of NURSSes, although NURSSes have a lot of advantages over uniform subdivision surfaces. In this paper, the concept of equivalent knot spacing is presented. A new technique for eigenanalysis, convergence and continuity analyses of non-uniform Doo-Sabin surfaces is proposed. Also, an interesting and important fact is found that the subdivision process of non-uniform Doo-Sabin surfaces may diverge sometime.",
"fno": "02930179",
"keywords": [
"Non Uniform Subdivision",
"Doo Sabin Surfaces",
"NURSS",
"Convergence",
"Continuity"
],
"authors": [
{
"affiliation": "Tsinghua University",
"fullName": "Kaihuai Qin",
"givenName": "Kaihuai",
"surname": "Qin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tsinghua University",
"fullName": "Huawei Wang",
"givenName": "Huawei",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pg",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1999-10-01T00:00:00",
"pubType": "proceedings",
"pages": "179",
"year": "1999",
"issn": null,
"isbn": "0-7695-0293-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "02930168",
"articleId": "12OmNrJiCJV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "02930188",
"articleId": "12OmNvjyy1f",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqMPfS8",
"title": "Computer Graphics and Applications, Pacific Conference on",
"acronym": "pg",
"groupId": "1000130",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzQR1pg",
"doi": "10.1109/PCCGA.2002.1167900",
"title": "Selective Non-Uniform Subdivision",
"normalizedTitle": "Selective Non-Uniform Subdivision",
"abstract": "The control of polygons of b-spline subdivision curves are usually refined uniformly using a technique called knot-doubling. This uniform refinement approach would perform unnecessary subdivision steps on portions already close to the limit curve enough and, consequently, cause unnecessary (exponential) increase on the number of line segments in the refined polygons. This paper overcomes this problem by proposing a local refinement technique for the control polygons of B-spline subdivision curves. Local refinement is achieved by selectively inserting new knots at midpoints of knot intervals. Efficient adaptive subdivision can be easily realized based on the new technique.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The control of polygons of b-spline subdivision curves are usually refined uniformly using a technique called knot-doubling. This uniform refinement approach would perform unnecessary subdivision steps on portions already close to the limit curve enough and, consequently, cause unnecessary (exponential) increase on the number of line segments in the refined polygons. This paper overcomes this problem by proposing a local refinement technique for the control polygons of B-spline subdivision curves. Local refinement is achieved by selectively inserting new knots at midpoints of knot intervals. Efficient adaptive subdivision can be easily realized based on the new technique.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The control of polygons of b-spline subdivision curves are usually refined uniformly using a technique called knot-doubling. This uniform refinement approach would perform unnecessary subdivision steps on portions already close to the limit curve enough and, consequently, cause unnecessary (exponential) increase on the number of line segments in the refined polygons. This paper overcomes this problem by proposing a local refinement technique for the control polygons of B-spline subdivision curves. Local refinement is achieved by selectively inserting new knots at midpoints of knot intervals. Efficient adaptive subdivision can be easily realized based on the new technique.",
"fno": "17840457",
"keywords": [],
"authors": [
{
"affiliation": "Shizuoka University",
"fullName": "Kenjio T. Miura",
"givenName": "Kenjio T.",
"surname": "Miura",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Tokyo",
"fullName": "Hiroshi Masuda",
"givenName": "Hiroshi",
"surname": "Masuda",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pg",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-10-01T00:00:00",
"pubType": "proceedings",
"pages": "457",
"year": "2002",
"issn": null,
"isbn": "0-7695-1784-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "17840454",
"articleId": "12OmNC8dgo7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "17840460",
"articleId": "12OmNBU1jHT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sibgrapi/2011/4548/0/4548a056",
"title": "Geodesic Conic Subdivision Curves on Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2011/4548a056/12OmNBU1jVb",
"parentPublication": {
"id": "proceedings/sibgrapi/2011/4548/0",
"title": "2011 24th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2003/2028/0/20280102",
"title": "Skinning Catmull-Clark Subdivision Surfaces with Incompatible Cross-Sectional Curves",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2003/20280102/12OmNvCzFdj",
"parentPublication": {
"id": "proceedings/pg/2003/2028/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2001/0984/0/09840270",
"title": "Refining Triangle Meshes by Non-linear Subdivision",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2001/09840270/12OmNwvDQq7",
"parentPublication": {
"id": "proceedings/3dim/2001/0984/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dpvt/2004/2223/0/22230680",
"title": "Progressive Compression of Volumetric Subdivision Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/3dpvt/2004/22230680/12OmNxYtu2L",
"parentPublication": {
"id": "proceedings/3dpvt/2004/2223/0",
"title": "3D Data Processing Visualization and Transmission, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/1999/0293/0/02930179",
"title": "Eigenanalysis and Continuity of Non-Uniform Doo-Sabin Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/pg/1999/02930179/12OmNy1SFCx",
"parentPublication": {
"id": "proceedings/pg/1999/0293/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2002/1656/0/16560639",
"title": "Dyadic and \\sqrt 3 — subdivision for Uniform Powell — Sabin Splines",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2002/16560639/12OmNzVoByC",
"parentPublication": {
"id": "proceedings/iv/2002/1656/0",
"title": "Proceedings Sixth International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a215",
"title": "Constructing an Interpolatory Subdivision Scheme from Doo-Sabin Subdivision",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a215/12OmNzd7bUZ",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2001/0853/0/08530049",
"title": "Fairing Recursive Subdivision Surfaces with Curve Interpolation Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2001/08530049/12OmNzlUKH7",
"parentPublication": {
"id": "proceedings/smi/2001/0853/0",
"title": "Shape Modeling and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/02/ttg2009020295",
"title": "RGB Subdivision",
"doi": null,
"abstractUrl": "/journal/tg/2009/02/ttg2009020295/13rRUILtJm2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrNh0vw",
"title": "2014 22nd International Conference on Pattern Recognition (ICPR)",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzXWZG9",
"doi": "10.1109/ICPR.2014.318",
"title": "A Defect Recognition System for Automated Inspection of Non-rigid Surfaces",
"normalizedTitle": "A Defect Recognition System for Automated Inspection of Non-rigid Surfaces",
"abstract": "The goal of this work is the automated recognition of 3D surface defects for quality inspection in industrial production. For complexly shaped work pieces that are non-rigid and have non-uniform tolerance ranges, it is hard to distinguish acceptable surface deviations from defects. We propose a 3-stage defect recognition system based on 3D measurement of the defective part. First, a variable B-Spline surface model is used to adapt to acceptable tolerance ranges. The remaining model deviations are then used for segmentation of possible defects. Finally, a SVM-based classifier separates true defects from pseudo defects. On a real world data set of a series of measurements for a car front hood, the effectiveness of the approach is proven.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The goal of this work is the automated recognition of 3D surface defects for quality inspection in industrial production. For complexly shaped work pieces that are non-rigid and have non-uniform tolerance ranges, it is hard to distinguish acceptable surface deviations from defects. We propose a 3-stage defect recognition system based on 3D measurement of the defective part. First, a variable B-Spline surface model is used to adapt to acceptable tolerance ranges. The remaining model deviations are then used for segmentation of possible defects. Finally, a SVM-based classifier separates true defects from pseudo defects. On a real world data set of a series of measurements for a car front hood, the effectiveness of the approach is proven.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The goal of this work is the automated recognition of 3D surface defects for quality inspection in industrial production. For complexly shaped work pieces that are non-rigid and have non-uniform tolerance ranges, it is hard to distinguish acceptable surface deviations from defects. We propose a 3-stage defect recognition system based on 3D measurement of the defective part. First, a variable B-Spline surface model is used to adapt to acceptable tolerance ranges. The remaining model deviations are then used for segmentation of possible defects. Finally, a SVM-based classifier separates true defects from pseudo defects. On a real world data set of a series of measurements for a car front hood, the effectiveness of the approach is proven.",
"fno": "5209b812",
"keywords": [
"Image Classification",
"Image Segmentation",
"Splines Mathematics",
"Support Vector Machines",
"Automated Inspection",
"Automated Recognition",
"3 D Surface Defects",
"Industrial Production",
"3 Stage Defect Recognition System",
"3 D Measurement",
"Variable B Spline Surface Model",
"Image Segmentation",
"SVM Based Classifier",
"Car Front Hood",
"Three Dimensional Displays",
"Surface Treatment",
"Splines Mathematics",
"Inspection",
"Support Vector Machines",
"Surface Morphology",
"Optical Surface Waves"
],
"authors": [
{
"affiliation": "Inst. for Inf. Technol. & Commun. (IIKT), Otto-von-Guericke-Univ. Magdeburg, Magdeburg, Germany",
"fullName": "Sebastian von Enzberg",
"givenName": "Sebastian",
"surname": "von Enzberg",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Inst. for Inf. Technol. & Commun. (IIKT), Otto-von-Guericke-Univ. Magdeburg, Magdeburg, Germany",
"fullName": "Ayoub Al-Hamadi",
"givenName": "Ayoub",
"surname": "Al-Hamadi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-08-01T00:00:00",
"pubType": "proceedings",
"pages": "1812-1816",
"year": "2014",
"issn": "1051-4651",
"isbn": "978-1-4799-5209-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "5209b806",
"articleId": "12OmNyQGS0z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "5209b817",
"articleId": "12OmNqGA54z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1992/2910/0/00201578",
"title": "Automatic visual inspection of wood surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201578/12OmNx3Zjc2",
"parentPublication": {
"id": "proceedings/icpr/1992/2910/0",
"title": "1992 11th IAPR International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2014/4261/0/4261a028",
"title": "A Hybrid SVM-QPSO Model Based Ceramic Tube Surface Defect Detection Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2014/4261a028/12OmNyKrH2z",
"parentPublication": {
"id": "proceedings/isdea/2014/4261/0",
"title": "2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isot/2014/6752/0/07119419",
"title": "Total Angle Resolved Scattering Characterization for Ultra-fine Finished Surface Areal-Topography",
"doi": null,
"abstractUrl": "/proceedings-article/isot/2014/07119419/12OmNyQGSpG",
"parentPublication": {
"id": "proceedings/isot/2014/6752/0",
"title": "2014 International Symposium on Optomechatronic Technologies (ISOT 2014)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipsn/2017/4890/0/07944790",
"title": "SurfaceVibe: Vibration-Based Tap & Swipe Tracking on Ubiquitous Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/ipsn/2017/07944790/12OmNykTNom",
"parentPublication": {
"id": "proceedings/ipsn/2017/4890/0",
"title": "2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci-cc/2012/2795/0/06311195",
"title": "Alogirthms for Fast Locating & Identification on the Surface Defects of the Thermal-State Heavy Rail based on Machine Vision",
"doi": null,
"abstractUrl": "/proceedings-article/icci-cc/2012/06311195/12OmNzFMFoE",
"parentPublication": {
"id": "proceedings/icci-cc/2012/2795/0",
"title": "2012 11th IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/th/2016/02/07358132",
"title": "On Frictional Forces between the Finger and a Textured Surface during Active Touch",
"doi": null,
"abstractUrl": "/journal/th/2016/02/07358132/13rRUxZzAhO",
"parentPublication": {
"id": "trans/th",
"title": "IEEE Transactions on Haptics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2018/6481/0/648101a285",
"title": "Automotive Semi-specular Surface Defect Detection System",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2018/648101a285/17D45VUZMWY",
"parentPublication": {
"id": "proceedings/crv/2018/6481/0",
"title": "2018 15th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mcsi/2018/7500/0/750000a044",
"title": "A Configuration Approach for Convolutional Neural Networks Used for Defect Detection on Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/mcsi/2018/750000a044/1bXcTfqOTlu",
"parentPublication": {
"id": "proceedings/mcsi/2018/7500/0",
"title": "2018 5th International Conference on Mathematics and Computers in Sciences and Industry (MCSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mark/1979/3181/0/08817307",
"title": "Visual inspection of metal surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/mark/1979/08817307/1cTIRdmHBrW",
"parentPublication": {
"id": "proceedings/mark/1979/3181/0",
"title": "1979 International Workshop on Managing Requirements Knowledge",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700c523",
"title": "Defect-GAN: High-Fidelity Defect Synthesis for Automated Defect Inspection",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700c523/1uqGlLcAVgY",
"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": "12OmNrY3LnG",
"title": "2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"acronym": "dcabes",
"groupId": "1800130",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxiKs2o",
"doi": "10.1109/DCABES.2015.10",
"title": "The Lager Ship Fluid-Solid Coupling Parallel Algorithm Based on VOSS Mapping Theory",
"normalizedTitle": "The Lager Ship Fluid-Solid Coupling Parallel Algorithm Based on VOSS Mapping Theory",
"abstract": "The fluid-solid coupling hydrodynamics parallel model of large ship is built based on VOSS mapping theory. The VOSS algorithm of large ship's wave is given, and the control equation and initial boundary conditions are derived from fluid hydrodynamic theory and solid elastic theory. The numerical results show the VOSS transfer of ship fluid-solid coupling wave is not same as coming see wave.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The fluid-solid coupling hydrodynamics parallel model of large ship is built based on VOSS mapping theory. The VOSS algorithm of large ship's wave is given, and the control equation and initial boundary conditions are derived from fluid hydrodynamic theory and solid elastic theory. The numerical results show the VOSS transfer of ship fluid-solid coupling wave is not same as coming see wave.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The fluid-solid coupling hydrodynamics parallel model of large ship is built based on VOSS mapping theory. The VOSS algorithm of large ship's wave is given, and the control equation and initial boundary conditions are derived from fluid hydrodynamic theory and solid elastic theory. The numerical results show the VOSS transfer of ship fluid-solid coupling wave is not same as coming see wave.",
"fno": "6593a009",
"keywords": [
"Marine Vehicles",
"Couplings",
"Mathematical Model",
"Parallel Algorithms",
"Wind Speed",
"Hydrodynamics",
"Solids",
"VOSS Theory",
"Parallel Computer",
"Fluid Solid Coupling"
],
"authors": [
{
"affiliation": null,
"fullName": "Yuguang Li",
"givenName": "Yuguang",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xin Chen",
"givenName": "Xin",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shesheng Zhang",
"givenName": "Shesheng",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dcabes",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-08-01T00:00:00",
"pubType": "proceedings",
"pages": "9-12",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-6593-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "6593a005",
"articleId": "12OmNqGiu3U",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "6593a013",
"articleId": "12OmNyQYtfQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isdea/2013/4893/0/06455228",
"title": "Thermal Conductivity Measurement about Fluid and Solid",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2013/06455228/12OmNApcuwI",
"parentPublication": {
"id": "proceedings/isdea/2013/4893/0",
"title": "2013 Third International Conference on Intelligent System Design and Engineering Applications (ISDEA 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifcsta/2009/3930/3/3930c251",
"title": "Computer Simulation for Bone Scaffolds on Account of Fluid-Solid Coupling Model",
"doi": null,
"abstractUrl": "/proceedings-article/ifcsta/2009/3930c251/12OmNqJZgFE",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/navcomp/2014/1899/0/1899a034",
"title": "Analysis of Drag Forces Contribution for Oil Ship Behavior",
"doi": null,
"abstractUrl": "/proceedings-article/navcomp/2014/1899a034/12OmNwD1q0Z",
"parentPublication": {
"id": "proceedings/navcomp/2014/1899/0",
"title": "2014 Symposium on Automation and Computation for Naval, Offshore and Subsea (NAVCOMP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2015/6593/0/6593a407",
"title": "Large Ship Fluid-Structure Coupling Deformation Calculation Based on Large Deviation Theory",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2015/6593a407/12OmNzYeAMy",
"parentPublication": {
"id": "proceedings/dcabes/2015/6593/0",
"title": "2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/simultech/2014/060/0/07095079",
"title": "Advanced route optimization in ship navigation",
"doi": null,
"abstractUrl": "/proceedings-article/simultech/2014/07095079/12OmNzcPAKc",
"parentPublication": {
"id": "proceedings/simultech/2014/060/0",
"title": "2014 International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-graphics/2013/2576/0/06815003",
"title": "Synthesizing Solid-Induced Turbulence for Particle-Based Fluids",
"doi": null,
"abstractUrl": "/proceedings-article/cad-graphics/2013/06815003/12OmNzlD9EF",
"parentPublication": {
"id": "proceedings/cad-graphics/2013/2576/0",
"title": "2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2017/06/mcs2017060033",
"title": "A Scalable and Extensible Computational Fluid Dynamics Software Framework for Ship Hydrodynamics Applications: NavyFOAM",
"doi": null,
"abstractUrl": "/magazine/cs/2017/06/mcs2017060033/13rRUwInv07",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdiime/2022/9009/0/900900a048",
"title": "Solid-Fluid Interaction Simulation System Based on SPH Unified Particle Framework",
"doi": null,
"abstractUrl": "/proceedings-article/icdiime/2022/900900a048/1Iz56eSpj3y",
"parentPublication": {
"id": "proceedings/icdiime/2022/9009/0",
"title": "2022 International Conference on 3D Immersion, Interaction and Multi-sensory Experiences (ICDIIME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10113697",
"title": "MPMNet: A Data-Driven MPM Framework for Dynamic Fluid-Solid Interaction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10113697/1MNbKoLAFHy",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismii/2021/1290/0/129000a155",
"title": "Fatigue analysis of ship-borne modular skid-mounted equipment",
"doi": null,
"abstractUrl": "/proceedings-article/ismii/2021/129000a155/1sZ2KiIUUk8",
"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": "12OmNwpGgKt",
"title": "Engineering Computation, International Conference on",
"acronym": "icec",
"groupId": "1002803",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzzP5Jz",
"doi": "10.1109/ICEC.2009.8",
"title": "Fluid-Solid Coupling Seepage-Based Numerical Simulation of Mechanical Oil Expression from Peanut",
"normalizedTitle": "Fluid-Solid Coupling Seepage-Based Numerical Simulation of Mechanical Oil Expression from Peanut",
"abstract": "In view of effect of fluid-solid coupling on flow of oil fluids through media and effect of rheology on fluid–solid coupling, the numerical simulation models of mechanical oil expression from vegetable oil were developed. The models were solved by using of combining finite difference with finite element. The displacement experiments for extracted peanut were used to validate the models. The predicted values are in good agreement with the measured ones.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In view of effect of fluid-solid coupling on flow of oil fluids through media and effect of rheology on fluid–solid coupling, the numerical simulation models of mechanical oil expression from vegetable oil were developed. The models were solved by using of combining finite difference with finite element. The displacement experiments for extracted peanut were used to validate the models. The predicted values are in good agreement with the measured ones.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In view of effect of fluid-solid coupling on flow of oil fluids through media and effect of rheology on fluid–solid coupling, the numerical simulation models of mechanical oil expression from vegetable oil were developed. The models were solved by using of combining finite difference with finite element. The displacement experiments for extracted peanut were used to validate the models. The predicted values are in good agreement with the measured ones.",
"fno": "3655a067",
"keywords": [],
"authors": [
{
"affiliation": null,
"fullName": "Xiao Zheng",
"givenName": "Xiao",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yan You",
"givenName": "Yan",
"surname": "You",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Guoxiang Lin",
"givenName": "Guoxiang",
"surname": "Lin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Nong Wan",
"givenName": "Nong",
"surname": "Wan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yaxin Zhang",
"givenName": "Yaxin",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icec",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-05-01T00:00:00",
"pubType": "proceedings",
"pages": "67-70",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3655-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3655a063",
"articleId": "12OmNyTfg5o",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3655a135",
"articleId": "12OmNAndir4",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icic/2009/3634/4/3634d156",
"title": "Temperature Field Simulation and Analysis of Cylinder-Jacket Component of Diesel Engine Based on Fluid-Solid-Heat Coupling",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2009/3634d156/12OmNBfZSm9",
"parentPublication": {
"id": "proceedings/icic/2009/3634/4",
"title": "2009 Second International Conference on Information and Computing Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2013/5016/0/5016a855",
"title": "Numerical Simulation of Heat-Transfer in Fracture Rock Based on Fluid-Solid Coupling",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2013/5016a855/12OmNCcKQOn",
"parentPublication": {
"id": "proceedings/icdma/2013/5016/0",
"title": "2013 Fourth International Conference on Digital Manufacturing & Automation (ICDMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2009/3605/2/3605c645",
"title": "Numerical Simulation of Mechanical Oil Expression from Sesame Based on Fluid-Solid Coupling Flowing through Porous Media",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2009/3605c645/12OmNqAU6mD",
"parentPublication": {
"id": "proceedings/cso/2009/3605/2",
"title": "2009 International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cesce/2010/3972/2/3972b142",
"title": "Technology of Extracting Luteolin from Solid Waste of Peanut Hulls",
"doi": null,
"abstractUrl": "/proceedings-article/cesce/2010/3972b142/12OmNqHItxc",
"parentPublication": {
"id": "proceedings/cesce/2010/3972/1",
"title": "Challenges in Environmental Science and Computer Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifcsta/2009/3930/3/3930c251",
"title": "Computer Simulation for Bone Scaffolds on Account of Fluid-Solid Coupling Model",
"doi": null,
"abstractUrl": "/proceedings-article/ifcsta/2009/3930c251/12OmNqJZgFE",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2015/6593/0/6593a009",
"title": "The Lager Ship Fluid-Solid Coupling Parallel Algorithm Based on VOSS Mapping Theory",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2015/6593a009/12OmNxiKs2o",
"parentPublication": {
"id": "proceedings/dcabes/2015/6593/0",
"title": "2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ihmsc/2009/3752/2/3752b011",
"title": "Influence of the Oil Cavity Depth on Dynamic Pressure Effect of Hydrostatic Thrust Bearing",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2009/3752b011/12OmNz2TCGx",
"parentPublication": {
"id": "proceedings/ihmsc/2009/3752/1",
"title": "2009 International Conference on Intelligent Human-Machine Systems and Cybernetics. IHMSC 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/02/ttg2014020303",
"title": "Vortical Inviscid Flows with Two-Way Solid-Fluid Coupling",
"doi": null,
"abstractUrl": "/journal/tg/2014/02/ttg2014020303/13rRUxAATgx",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdiime/2022/9009/0/900900a048",
"title": "Solid-Fluid Interaction Simulation System Based on SPH Unified Particle Framework",
"doi": null,
"abstractUrl": "/proceedings-article/icdiime/2022/900900a048/1Iz56eSpj3y",
"parentPublication": {
"id": "proceedings/icdiime/2022/9009/0",
"title": "2022 International Conference on 3D Immersion, Interaction and Multi-sensory Experiences (ICDIIME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibe/2021/4261/0/09635284",
"title": "3D reconstruction and computational modeling of solid-fluid interaction in realistic heart model",
"doi": null,
"abstractUrl": "/proceedings-article/bibe/2021/09635284/1zmvpRunzhe",
"parentPublication": {
"id": "proceedings/bibe/2021/4261/0",
"title": "2021 IEEE 21st International Conference on Bioinformatics and Bioengineering (BIBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1t7mQaZpzb2",
"title": "2020 IEEE 22nd International Conference on High Performance Computing and Communications; IEEE 18th International Conference on Smart City; IEEE 6th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"acronym": "hpcc-dss-smartcity",
"groupId": "1002461",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1t7mVFawyYM",
"doi": "10.1109/HPCC-SmartCity-DSS50907.2020.00065",
"title": "Numerical Study of Fluid-Structure Interaction Dynamics under High-explosive Detonation on Massively Parallel Computers",
"normalizedTitle": "Numerical Study of Fluid-Structure Interaction Dynamics under High-explosive Detonation on Massively Parallel Computers",
"abstract": "Fluid-structure interaction dynamics under high-explosie detonation is widely used in engineering application, and its numerical simulation is also challenging due to the violent reaction of the blast. Based on the open source software and coupling library, we developed a solver to support the numerical simulation of fluid-structure interaction dynamics under high-explosie detonation, and carried out a case analysis. In the test case, the motion process of perpendicular elastic flap under high-explosive detonation is selected and the simulation time is 5ms. The transient results of the whole simulation process are given. We also tested the case in parallel, using two fluid meshes, that is, 972,000 cells (Mesh I) and 2,405,000 cells (Mesh II), and the scale of structure mesh is 2,000 cells. The results show that in the case of Mesh I, the maximum speedup ratio is 5.47 and the efficiency is 15.71% when the number of processes is 32. In the case of Mesh II, the maximum speedup ratio is 10.91 and the efficiency is 17.05% when the number of processes is 64.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Fluid-structure interaction dynamics under high-explosie detonation is widely used in engineering application, and its numerical simulation is also challenging due to the violent reaction of the blast. Based on the open source software and coupling library, we developed a solver to support the numerical simulation of fluid-structure interaction dynamics under high-explosie detonation, and carried out a case analysis. In the test case, the motion process of perpendicular elastic flap under high-explosive detonation is selected and the simulation time is 5ms. The transient results of the whole simulation process are given. We also tested the case in parallel, using two fluid meshes, that is, 972,000 cells (Mesh I) and 2,405,000 cells (Mesh II), and the scale of structure mesh is 2,000 cells. The results show that in the case of Mesh I, the maximum speedup ratio is 5.47 and the efficiency is 15.71% when the number of processes is 32. In the case of Mesh II, the maximum speedup ratio is 10.91 and the efficiency is 17.05% when the number of processes is 64.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Fluid-structure interaction dynamics under high-explosie detonation is widely used in engineering application, and its numerical simulation is also challenging due to the violent reaction of the blast. Based on the open source software and coupling library, we developed a solver to support the numerical simulation of fluid-structure interaction dynamics under high-explosie detonation, and carried out a case analysis. In the test case, the motion process of perpendicular elastic flap under high-explosive detonation is selected and the simulation time is 5ms. The transient results of the whole simulation process are given. We also tested the case in parallel, using two fluid meshes, that is, 972,000 cells (Mesh I) and 2,405,000 cells (Mesh II), and the scale of structure mesh is 2,000 cells. The results show that in the case of Mesh I, the maximum speedup ratio is 5.47 and the efficiency is 15.71% when the number of processes is 32. In the case of Mesh II, the maximum speedup ratio is 10.91 and the efficiency is 17.05% when the number of processes is 64.",
"fno": "764900a525",
"keywords": [
"Computational Fluid Dynamics",
"Detonation",
"Elasticity",
"Explosives",
"Mesh Generation",
"Numerical Analysis",
"High Explosie Detonation",
"High Explosive Detonation",
"Simulation Process",
"Fluid Meshes",
"Structure Mesh",
"Fluid Structure Interaction Dynamics",
"Numerical Simulation",
"Open Source Software",
"Coupling Library",
"Massively Parallel Computers",
"Elastic Flap",
"Time 5 0 Ms",
"I",
"Couplings",
"Fluid Dynamics",
"Scalability",
"Dynamics",
"Numerical Simulation",
"Libraries",
"Numerical Models",
"Numerical Simulation",
"FSI",
"Parallel Computing",
"High Explosive Detonation",
"Open FOAM"
],
"authors": [
{
"affiliation": "Institute for Quantum Information & State Key Laboratory of High Performance Computing, College of Computer National University of Defense Technology,Changsha,Hunan,P.R. China",
"fullName": "Sen Zhang",
"givenName": "Sen",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institute for Quantum Information & State Key Laboratory of High Performance Computing, College of Computer National University of Defense Technology,Changsha,Hunan,P.R. China",
"fullName": "Xiao-Wei Guo",
"givenName": "Xiao-Wei",
"surname": "Guo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institute for Quantum Information & State Key Laboratory of High Performance Computing, College of Computer National University of Defense Technology,Changsha,Hunan,P.R. China",
"fullName": "Chao Li",
"givenName": "Chao",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institute for Quantum Information & State Key Laboratory of High Performance Computing, College of Computer National University of Defense Technology,Changsha,Hunan,P.R. China",
"fullName": "Yi Liu",
"givenName": "Yi",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institute for Quantum Information & State Key Laboratory of High Performance Computing, College of Computer National University of Defense Technology,Changsha,Hunan,P.R. China",
"fullName": "Ran Zhao",
"givenName": "Ran",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institute for Quantum Information & State Key Laboratory of High Performance Computing, College of Computer National University of Defense Technology,Changsha,Hunan,P.R. China",
"fullName": "Canqun Yang",
"givenName": "Canqun",
"surname": "Yang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hpcc-dss-smartcity",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-12-01T00:00:00",
"pubType": "proceedings",
"pages": "525-531",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-7649-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "764900a519",
"articleId": "1t7mWhfBYVq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "764900a532",
"articleId": "1t7n9jAnfsk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hipcw/2015/8717/0/8717a012",
"title": "Development and Application of Interfacial Anti-Diffusion and Poor Mesh Numerics Treatments for Free Surface Flows",
"doi": null,
"abstractUrl": "/proceedings-article/hipcw/2015/8717a012/12OmNB9KHuZ",
"parentPublication": {
"id": "proceedings/hipcw/2015/8717/0",
"title": "2015 IEEE 22nd International Conference on High Performance Computing Workshops (HiPCW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/1989/341/0/05349035",
"title": "Computational fluid dynamic-current capabilities and directions for the future",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1989/05349035/12OmNBQ2VTm",
"parentPublication": {
"id": "proceedings/sc/1989/341/0",
"title": "Proceedings of the 1989 ACM/IEEE Conference on Supercomputing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2015/7644/0/7644a275",
"title": "CFD Numerical Analysis of the Interaction Between Wave and Pier",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2015/7644a275/12OmNrAdsx1",
"parentPublication": {
"id": "proceedings/icicta/2015/7644/0",
"title": "2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)",
"__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/icmtma/2009/3583/2/3583b267",
"title": "Numerical Simulation of Fluid Flow in Thin Slab Continuous Casting Mould",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583b267/12OmNvjgWVh",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/2",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/qest/2011/4491/0/4491a147",
"title": "GPA - A Tool for Fluid Scalability Analysis of Massively Parallel Systems",
"doi": null,
"abstractUrl": "/proceedings-article/qest/2011/4491a147/12OmNwkhTfY",
"parentPublication": {
"id": "proceedings/qest/2011/4491/0",
"title": "Quantitative Evaluation of Systems, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2011/4501/0/4501b140",
"title": "Effects of Mesh Density and Coupling Control Parameter in Numerical Simulation of Fluid-Structure Interaction",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2011/4501b140/12OmNxFJXCp",
"parentPublication": {
"id": "proceedings/iccis/2011/4501/0",
"title": "2011 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ncca/2011/4550/0/4550a073",
"title": "Massively Parallel Fluid Simulations on Amazon's HPC Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/ncca/2011/4550a073/12OmNxzMnSl",
"parentPublication": {
"id": "proceedings/ncca/2011/4550/0",
"title": "Network Cloud Computing and Applications, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2007/02/c2021",
"title": "Stochastic Computational Fluid Mechanics",
"doi": null,
"abstractUrl": "/magazine/cs/2007/02/c2021/13rRUwh80ME",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cscc/2020/6503/0/650300a165",
"title": "Pressure analysis of rectangular fluid filling",
"doi": null,
"abstractUrl": "/proceedings-article/cscc/2020/650300a165/1t2mRuVIpwI",
"parentPublication": {
"id": "proceedings/cscc/2020/6503/0",
"title": "2020 24th International Conference on Circuits, Systems, Communications and Computers (CSCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1jIxhEnA8IE",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"acronym": "vrw",
"groupId": "1836626",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1jIxu4DfZiU",
"doi": "10.1109/VRW50115.2020.00213",
"title": "Individual differences in teleporting through virtual environments: A latent profile analysis",
"normalizedTitle": "Individual differences in teleporting through virtual environments: A latent profile analysis",
"abstract": "Teleportation in virtual reality (VR) affords the ability to explore beyond the physical space. Previous work has demonstrated that this interface comes at a spatial cognitive cost – though, upon closer inspection, not everyone appears similarly affected. A latent profile analysis identified three groups that significantly differed on spatial updating performance and follow-up analyses showed significant differences in objective measures of spatial ability (e.g., mental rotation and perspective-taking). These results suggest that there are individual differences in domains of spatial cognition that are related to how well a user may keep track of his or her location while teleporting in VR.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Teleportation in virtual reality (VR) affords the ability to explore beyond the physical space. Previous work has demonstrated that this interface comes at a spatial cognitive cost – though, upon closer inspection, not everyone appears similarly affected. A latent profile analysis identified three groups that significantly differed on spatial updating performance and follow-up analyses showed significant differences in objective measures of spatial ability (e.g., mental rotation and perspective-taking). These results suggest that there are individual differences in domains of spatial cognition that are related to how well a user may keep track of his or her location while teleporting in VR.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Teleportation in virtual reality (VR) affords the ability to explore beyond the physical space. Previous work has demonstrated that this interface comes at a spatial cognitive cost – though, upon closer inspection, not everyone appears similarly affected. A latent profile analysis identified three groups that significantly differed on spatial updating performance and follow-up analyses showed significant differences in objective measures of spatial ability (e.g., mental rotation and perspective-taking). These results suggest that there are individual differences in domains of spatial cognition that are related to how well a user may keep track of his or her location while teleporting in VR.",
"fno": "09090652",
"keywords": [
"Teleportation",
"Cognition",
"Legged Locomotion",
"Virtual Reality",
"Navigation",
"Visualization",
"Atmospheric Measurements",
"Navigation",
"Spatial Cognition",
"Virtual Reality",
"Teleporting"
],
"authors": [
{
"affiliation": "Iowa State University",
"fullName": "Lucia A. Cherep",
"givenName": "Lucia A.",
"surname": "Cherep",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Iowa State University",
"fullName": "Alex F. Lim",
"givenName": "Alex F.",
"surname": "Lim",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Iowa State University",
"fullName": "Jonathan W. Kelly",
"givenName": "Jonathan W.",
"surname": "Kelly",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Iowa State University",
"fullName": "Anthony Miller",
"givenName": "Anthony",
"surname": "Miller",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Iowa State University",
"fullName": "Stephen B. Gilbert",
"givenName": "Stephen B.",
"surname": "Gilbert",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vrw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-03-01T00:00:00",
"pubType": "proceedings",
"pages": "724-725",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-6532-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09090469",
"articleId": "1jIxyutlklO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09090667",
"articleId": "1jIxmz3Z54c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2017/6647/0/07892303",
"title": "Object location memory error in virtual and real environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892303/12OmNx7ouWn",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2018/3365/0/08446130",
"title": "Rapid, Continuous Movement Between Nodes as an Accessible Virtual Reality Locomotion Technique",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08446130/13bd1f3HvEx",
"parentPublication": {
"id": "proceedings/vr/2018/3365/0",
"title": "2018 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/05/09714054",
"title": "Remote research on locomotion interfaces for virtual reality: Replication of a lab-based study on teleporting interfaces",
"doi": null,
"abstractUrl": "/journal/tg/2022/05/09714054/1B0XZAXWaIg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09894041",
"title": "Integrating Continuous and Teleporting VR Locomotion Into a Seamless ‘HyperJump’ Paradigm",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09894041/1GIqrCx8RCE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10113740",
"title": "SceneFusion: Room-Scale Environmental Fusion for Efficient Traveling Between Separate Virtual Environments",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10113740/1MNbKAm1pUQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798348",
"title": "Individual Differences in Embodied Distance Estimation in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798348/1cJ0H4fRjBS",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/08998297",
"title": "Teleporting through virtual environments: Effects of path scale and environment scale on spatial updating",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/08998297/1hrXhk9mu9W",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a608",
"title": "Walking and Teleportation in Wide-area Virtual Reality Experiences",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a608/1pysv8bIfrG",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a480",
"title": "Analysis of Positional Tracking Space Usage when using Teleportation",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a480/1tnXfrT4ere",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a321",
"title": "Simultaneous Real Walking and Asymmetric Input in Virtual Reality with a Smartphone-based Hybrid Interface",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a321/1yeQEyk3fbO",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1yfxDjRGMmc",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"acronym": "ismar-adjunct",
"groupId": "1810084",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1yeQEyk3fbO",
"doi": "10.1109/ISMAR-Adjunct54149.2021.00072",
"title": "Simultaneous Real Walking and Asymmetric Input in Virtual Reality with a Smartphone-based Hybrid Interface",
"normalizedTitle": "Simultaneous Real Walking and Asymmetric Input in Virtual Reality with a Smartphone-based Hybrid Interface",
"abstract": "Compared to virtual navigation methods like joystick-based teleportation in Virtual Reality (VR), real walking enables more natural and realistic physical behaviors and better overall user experience. This paper presents a smartphone-based hybrid interface that combines a smartphone and a handheld controller, which enables real walking by viewing the physical environment and asymmetric 2D-3D input at the same time. The phone is virtualized in VR and streams a view of the real world to a collocated virtual screen, enabling users to avoid or remove physical obstacles. The touchscreen and the controller provide an asymmetric input choice for users to improve interaction efficiency in VR. We implemented a prototype system and conducted a pilot study to evaluate its usability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Compared to virtual navigation methods like joystick-based teleportation in Virtual Reality (VR), real walking enables more natural and realistic physical behaviors and better overall user experience. This paper presents a smartphone-based hybrid interface that combines a smartphone and a handheld controller, which enables real walking by viewing the physical environment and asymmetric 2D-3D input at the same time. The phone is virtualized in VR and streams a view of the real world to a collocated virtual screen, enabling users to avoid or remove physical obstacles. The touchscreen and the controller provide an asymmetric input choice for users to improve interaction efficiency in VR. We implemented a prototype system and conducted a pilot study to evaluate its usability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Compared to virtual navigation methods like joystick-based teleportation in Virtual Reality (VR), real walking enables more natural and realistic physical behaviors and better overall user experience. This paper presents a smartphone-based hybrid interface that combines a smartphone and a handheld controller, which enables real walking by viewing the physical environment and asymmetric 2D-3D input at the same time. The phone is virtualized in VR and streams a view of the real world to a collocated virtual screen, enabling users to avoid or remove physical obstacles. The touchscreen and the controller provide an asymmetric input choice for users to improve interaction efficiency in VR. We implemented a prototype system and conducted a pilot study to evaluate its usability.",
"fno": "129800a321",
"keywords": [
"Interactive Devices",
"Smart Phones",
"Teleportation",
"Touch Sensitive Screens",
"Virtual Reality",
"Walking",
"Virtual Reality",
"Smartphone Based Hybrid Interface",
"Virtual Navigation Methods",
"Joystick Based Teleportation",
"VR",
"Natural Behaviors",
"Realistic Physical Behaviors",
"User Experience",
"Physical Environment",
"Collocated Virtual Screen",
"Physical Obstacles",
"Asymmetric Input Choice",
"Legged Locomotion",
"Privacy",
"Three Dimensional Displays",
"Navigation",
"Virtual Environments",
"Prototypes",
"Teleportation",
"Human Centered Computing",
"Virtual Reality",
"Human Centered Computing",
"Smartphones"
],
"authors": [
{
"affiliation": "Cyber-Physical Interaction Lab, Northwestern Polytechnical University",
"fullName": "Li Zhang",
"givenName": "Li",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Cyber-Physical Interaction Lab, Northwestern Polytechnical University",
"fullName": "Weiping He",
"givenName": "Weiping",
"surname": "He",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Cyber-Physical Interaction Lab, Northwestern Polytechnical University",
"fullName": "Zhiwei Cao",
"givenName": "Zhiwei",
"surname": "Cao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Cyber-Physical Interaction Lab, Northwestern Polytechnical University",
"fullName": "Shuxia Wang",
"givenName": "Shuxia",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Auckland Bioengineering Institute, The University of Auckland",
"fullName": "Huidong Bai",
"givenName": "Huidong",
"surname": "Bai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Auckland Bioengineering Institute, The University of Auckland",
"fullName": "Mark Billinghurst",
"givenName": "Mark",
"surname": "Billinghurst",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ismar-adjunct",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-10-01T00:00:00",
"pubType": "proceedings",
"pages": "321-323",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-1298-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1yeQDX05ePS",
"name": "pismar-adjunct202112980-09585811s1-mm_129800a321.zip",
"size": "116 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pismar-adjunct202112980-09585811s1-mm_129800a321.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "129800a316",
"articleId": "1yeQBsFYsla",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "129800a324",
"articleId": "1yeQJrGq6WI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2014/2871/0/06802053",
"title": "An enhanced steering algorithm for redirected walking in virtual environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2014/06802053/12OmNCbU2Wt",
"parentPublication": {
"id": "proceedings/vr/2014/2871/0",
"title": "2014 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dui/2014/3624/0/06798852",
"title": "Reorientation in virtual environments using interactive portals",
"doi": null,
"abstractUrl": "/proceedings-article/3dui/2014/06798852/12OmNqBbHVR",
"parentPublication": {
"id": "proceedings/3dui/2014/3624/0",
"title": "2014 IEEE Symposium on 3D User Interfaces (3DUI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892373",
"title": "Application of redirected walking in room-scale VR",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892373/12OmNxG1ySA",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2018/7459/0/745900a115",
"title": "Rethinking Redirected Walking: On the Use of Curvature Gains Beyond Perceptual Limitations and Revisiting Bending Gains",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2018/745900a115/17D45WK5AlG",
"parentPublication": {
"id": "proceedings/ismar/2018/7459/0",
"title": "2018 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/05/10049680",
"title": "Assisted walking-in-place: Introducing assisted motion to walking-by-cycling in embodied virtual reality",
"doi": null,
"abstractUrl": "/journal/tg/2023/05/10049680/1KYolEFtr6U",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798319",
"title": "Simulation and Evaluation of Three-User Redirected Walking Algorithm in Shared Physical Spaces",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798319/1cJ1aPwr8l2",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798345",
"title": "Investigation of Visual Self-Representation for a Walking-in-Place Navigation System in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798345/1cJ1hpkUgHS",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089543",
"title": "The Space Bender: Supporting Natural Walking via Overt Manipulation of the Virtual Environment",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089543/1jIxb9EbKJq",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a608",
"title": "Walking and Teleportation in Wide-area Virtual Reality Experiences",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a608/1pysv8bIfrG",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a209",
"title": "Finding a range of perceived natural visual walking speed for stationary travelling techniques in VR",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a209/1yeQYNSYkSY",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy5hRcj",
"title": "Asia International Conference on Modelling & Simulation",
"acronym": "ams",
"groupId": "1001723",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBSjJ7C",
"doi": "10.1109/AMS.2010.83",
"title": "Modeling the Rejection Performance of Hollow Fiber Nanofiltration Membranes Modified by Negatively Charged-Modifying Macromolecule",
"normalizedTitle": "Modeling the Rejection Performance of Hollow Fiber Nanofiltration Membranes Modified by Negatively Charged-Modifying Macromolecule",
"abstract": "Hollow fiber membranes using Polyethersulfone (PES) were fabricated in-house using phase inversion technique by modification with synthesized charged-surface modifying macromolecules (cSMM). The cSMM comprise with end-group component of Hydroxybenzene sulfonate or Hydroxybenzene carboxylate. The electrical properties of the membranes were modeled by utilizing the combination of irreversible thermodynamic model, Steric-Hindrance Pore (SHP) model and Teorell-Meyer-Sievers (TMS) model. The negatively-charged of the modified hollow fiber membranes was calculated based on sodium chloride rejection performance. The analysis of the modeling results revealed that sulfonate induce negative 1.61 electrical properties compared to carboxylate that is negative 1.49 for the modified PES membranes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Hollow fiber membranes using Polyethersulfone (PES) were fabricated in-house using phase inversion technique by modification with synthesized charged-surface modifying macromolecules (cSMM). The cSMM comprise with end-group component of Hydroxybenzene sulfonate or Hydroxybenzene carboxylate. The electrical properties of the membranes were modeled by utilizing the combination of irreversible thermodynamic model, Steric-Hindrance Pore (SHP) model and Teorell-Meyer-Sievers (TMS) model. The negatively-charged of the modified hollow fiber membranes was calculated based on sodium chloride rejection performance. The analysis of the modeling results revealed that sulfonate induce negative 1.61 electrical properties compared to carboxylate that is negative 1.49 for the modified PES membranes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Hollow fiber membranes using Polyethersulfone (PES) were fabricated in-house using phase inversion technique by modification with synthesized charged-surface modifying macromolecules (cSMM). The cSMM comprise with end-group component of Hydroxybenzene sulfonate or Hydroxybenzene carboxylate. The electrical properties of the membranes were modeled by utilizing the combination of irreversible thermodynamic model, Steric-Hindrance Pore (SHP) model and Teorell-Meyer-Sievers (TMS) model. The negatively-charged of the modified hollow fiber membranes was calculated based on sodium chloride rejection performance. The analysis of the modeling results revealed that sulfonate induce negative 1.61 electrical properties compared to carboxylate that is negative 1.49 for the modified PES membranes.",
"fno": "4062a384",
"keywords": [
"Mathematical Modeling",
"Negative Charge",
"Surface Modification",
"Hollow Fiber",
"Ionic Separations"
],
"authors": [
{
"affiliation": null,
"fullName": "Nurmin Bolong",
"givenName": "Nurmin",
"surname": "Bolong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ahmad Fauzi Ismail",
"givenName": "Ahmad Fauzi",
"surname": "Ismail",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mohd Razman Salim",
"givenName": "Mohd Razman",
"surname": "Salim",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Dipak Rana",
"givenName": "Dipak",
"surname": "Rana",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Takeshi Matsuura",
"givenName": "Takeshi",
"surname": "Matsuura",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ams",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-05-01T00:00:00",
"pubType": "proceedings",
"pages": "384-389",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4062-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4062a378",
"articleId": "12OmNzEVRZo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4062a390",
"articleId": "12OmNApu5qa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iceet/2009/3819/3/3819c065",
"title": "Experimental Study on the Separation of CO2 from Flue Gas Using Hollow Fiber Membrane Contactors with Aqueous Solution of Potassium Glycinate",
"doi": null,
"abstractUrl": "/proceedings-article/iceet/2009/3819c065/12OmNqBtj2x",
"parentPublication": {
"id": "proceedings/iceet/2009/3819/3",
"title": "Energy and Environment Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iceet/2009/3819/3/3819c302",
"title": "Effects of Module Configuration on Hollow Fiber Filtration Performance",
"doi": null,
"abstractUrl": "/proceedings-article/iceet/2009/3819c302/12OmNqJ8teP",
"parentPublication": {
"id": "proceedings/iceet/2009/3819/3",
"title": "Energy and Environment Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbeb/2012/4706/0/4706a242",
"title": "Enantioseparation of Enantiomers across Hollow Fiber Supported Liquid Membranes",
"doi": null,
"abstractUrl": "/proceedings-article/icbeb/2012/4706a242/12OmNwogh3p",
"parentPublication": {
"id": "proceedings/icbeb/2012/4706/0",
"title": "Biomedical Engineering and Biotechnology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbeb/2012/4706/0/4706a249",
"title": "Enantioseparation of Propranolol Enantiomers Using Hollow Fiber Membrane Contactor",
"doi": null,
"abstractUrl": "/proceedings-article/icbeb/2012/4706a249/12OmNyGbIb8",
"parentPublication": {
"id": "proceedings/icbeb/2012/4706/0",
"title": "Biomedical Engineering and Biotechnology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy6qfNS",
"title": "Information Processing, Asia-Pacific Conference on",
"acronym": "apcip",
"groupId": "1002833",
"volume": "2",
"displayVolume": "2",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvAiSrS",
"doi": "10.1109/APCIP.2009.204",
"title": "A Algorithm for the Nonlinear Complementarity Problem in Contact Mechanics Modeling",
"normalizedTitle": "A Algorithm for the Nonlinear Complementarity Problem in Contact Mechanics Modeling",
"abstract": "In this paper, we consider nonlinear complementarity problem in contact mechanics modeling (NCP). To solve the problem, we first establish a global error bound for NCP, and then propose a new type of solution method to solve the NCP based on the error bound estimation. The global convergence is also established, and the given numerical experiments shows the efficiency of the method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we consider nonlinear complementarity problem in contact mechanics modeling (NCP). To solve the problem, we first establish a global error bound for NCP, and then propose a new type of solution method to solve the NCP based on the error bound estimation. The global convergence is also established, and the given numerical experiments shows the efficiency of the method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we consider nonlinear complementarity problem in contact mechanics modeling (NCP). To solve the problem, we first establish a global error bound for NCP, and then propose a new type of solution method to solve the NCP based on the error bound estimation. The global convergence is also established, and the given numerical experiments shows the efficiency of the method.",
"fno": "3699b274",
"keywords": [
"Contact Mechanics Modeling",
"Nonlinear Complementarity Problem",
"Global Error Bound",
"Algorithm",
"Global Convergence"
],
"authors": [
{
"affiliation": null,
"fullName": "Hongchun Sun",
"givenName": "Hongchun",
"surname": "Sun",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "apcip",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-07-01T00:00:00",
"pubType": "proceedings",
"pages": "274-277",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3699-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3699b270",
"articleId": "12OmNzw8j9M",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3699b278",
"articleId": "12OmNy49sHa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cinc/2009/3645/2/3645b198",
"title": "Inexact Parallel Relaxed Multisplitting Algorithm for Linear Complementarity Problem",
"doi": null,
"abstractUrl": "/proceedings-article/cinc/2009/3645b198/12OmNBlFQZB",
"parentPublication": {
"id": "cinc/2009/3645/2",
"title": "Computational Intelligence and Natural Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2013/4777/0/4777a633",
"title": "A New Smoothing Inexact Newton Method for Generalized Nonlinear Complementarity Problem",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2013/4777a633/12OmNqJHFpE",
"parentPublication": {
"id": "proceedings/bife/2013/4777/0",
"title": "2013 Sixth International Conference on Business Intelligence and Financial Engineering (BIFE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2008/3304/7/3304g450",
"title": "A New Polynomial Interior-Point Algorithm for Monotone Mixed Linear Complementarity Problem",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2008/3304g450/12OmNqJq4pQ",
"parentPublication": {
"id": "proceedings/icnc/2008/3304/7",
"title": "2008 Fourth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2009/3557/2/3557c318",
"title": "A Parallel Relaxed Multisplitting Method for Affine Second-Order Cone Complementarity Problem",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557c318/12OmNrAv3LC",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icie/2009/3679/1/3679a505",
"title": "A Smoothing Quadratically Convergent Algorithm for the Generalized Complementarity Problem over a Polyhedral Cone",
"doi": null,
"abstractUrl": "/proceedings-article/icie/2009/3679a505/12OmNvk7K7i",
"parentPublication": {
"id": "proceedings/icie/2009/3679/1",
"title": "2009 WASE International Conference on Information Engineering (ICIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicic/2008/3161/0/31610218",
"title": "Solution of Nonlinear Complementarity Problems with Inexact Newton Methods",
"doi": null,
"abstractUrl": "/proceedings-article/icicic/2008/31610218/12OmNvsm6Au",
"parentPublication": {
"id": "proceedings/icicic/2008/3161/0",
"title": "Innovative Computing ,Information and Control, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lics/2012/4769/0/06280443",
"title": "Strong Complementarity and Non-locality in Categorical Quantum Mechanics",
"doi": null,
"abstractUrl": "/proceedings-article/lics/2012/06280443/12OmNxFsmoR",
"parentPublication": {
"id": "proceedings/lics/2012/4769/0",
"title": "Logic in Computer Science, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2008/3382/3/3382c067",
"title": "Inexact Newton Algorithm to Solve Nonlinear Complementarity Problems",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2008/3382c067/12OmNy2rRRE",
"parentPublication": {
"id": "proceedings/isda/2008/3382/3",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iuce/2009/3619/0/3619a230",
"title": "A Quadratically Convergent Algorithm for Generalized Linear Complementarity Problem on Supply Chain Equilibrium Model",
"doi": null,
"abstractUrl": "/proceedings-article/iuce/2009/3619a230/12OmNyqRnqC",
"parentPublication": {
"id": "proceedings/iuce/2009/3619/0",
"title": "2009 International Symposium on Intelligent Ubiquitous Computing and Education, IUCE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bife/2013/4777/0/4777a619",
"title": "A Filter-SSLE Algorithm for Solving Nonlinear Complementarity Problems",
"doi": null,
"abstractUrl": "/proceedings-article/bife/2013/4777a619/12OmNzd7ba1",
"parentPublication": {
"id": "proceedings/bife/2013/4777/0",
"title": "2013 Sixth International Conference on Business Intelligence and Financial Engineering (BIFE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzYwc36",
"title": "2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)",
"acronym": "ijcbs",
"groupId": "1002888",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy2agVX",
"doi": "10.1109/IJCBS.2009.84",
"title": "Global Stochastic Contact Modeling of Infectious Diseases",
"normalizedTitle": "Global Stochastic Contact Modeling of Infectious Diseases",
"abstract": "Computational modeling of infectious diseases enable intelligent Public Health decisions to reduce the impact from epidemic outbreaks, either natural or intentional. In this paper, we outline a modeling paradigm, referred to as the Global Stochastic Contact Model (GSCM), which is a hybrid approach combining agent-based modeling and stochastic simulation, utilizing information on regional demographics, geography, disease specific parameters, and social behavioral factors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Computational modeling of infectious diseases enable intelligent Public Health decisions to reduce the impact from epidemic outbreaks, either natural or intentional. In this paper, we outline a modeling paradigm, referred to as the Global Stochastic Contact Model (GSCM), which is a hybrid approach combining agent-based modeling and stochastic simulation, utilizing information on regional demographics, geography, disease specific parameters, and social behavioral factors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Computational modeling of infectious diseases enable intelligent Public Health decisions to reduce the impact from epidemic outbreaks, either natural or intentional. In this paper, we outline a modeling paradigm, referred to as the Global Stochastic Contact Model (GSCM), which is a hybrid approach combining agent-based modeling and stochastic simulation, utilizing information on regional demographics, geography, disease specific parameters, and social behavioral factors.",
"fno": "3739a327",
"keywords": [
"Computational Epidemiology",
"Public Health",
"Simulation"
],
"authors": [
{
"affiliation": null,
"fullName": "Armin R. Mikler",
"givenName": "Armin R.",
"surname": "Mikler",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Angel Bravo-Salgado",
"givenName": "Angel",
"surname": "Bravo-Salgado",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Courtney D. Corley",
"givenName": "Courtney D.",
"surname": "Corley",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ijcbs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-08-01T00:00:00",
"pubType": "proceedings",
"pages": "327-330",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3739-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3739a323",
"articleId": "12OmNqGRGm5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3739a331",
"articleId": "12OmNs5rkYo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ccgrid/2013/4996/0/4996a506",
"title": "Simfrastructure: A Flexible and Adaptable Middleware Platform for Modeling and Analysis of Socially Coupled Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ccgrid/2013/4996a506/12OmNBziBbw",
"parentPublication": {
"id": "proceedings/ccgrid/2013/4996/0",
"title": "Cluster Computing and the Grid, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2008/2835/0/05214892",
"title": "EpiSimdemics: An efficient algorithm for simulating the spread of infectious disease over large realistic social networks",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2008/05214892/12OmNwdL7gt",
"parentPublication": {
"id": "proceedings/sc/2008/2835/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ijcbs/2009/3739/0/3739a360",
"title": "A Computational Framework to Study Public Health Epidemiology",
"doi": null,
"abstractUrl": "/proceedings-article/ijcbs/2009/3739a360/12OmNwekjuw",
"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/ichi/2015/9548/0/9548a574",
"title": "Modeling Disease Spread at Global Mass Gatherings: Hajj as a Case Study",
"doi": null,
"abstractUrl": "/proceedings-article/ichi/2015/9548a574/12OmNyYDDB3",
"parentPublication": {
"id": "proceedings/ichi/2015/9548/0",
"title": "2015 International Conference on Healthcare Informatics (ICHI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isms/2013/4963/0/4963a152",
"title": "Infectious Disease Spread Analysis Using Stochastic Differential Equations for SIR Model",
"doi": null,
"abstractUrl": "/proceedings-article/isms/2013/4963a152/12OmNyrIasO",
"parentPublication": {
"id": "proceedings/isms/2013/4963/0",
"title": "Intelligent Systems, Modelling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2007/02/c2021",
"title": "Stochastic Computational Fluid Mechanics",
"doi": null,
"abstractUrl": "/magazine/cs/2007/02/c2021/13rRUwh80ME",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2013/06/mex2013060060",
"title": "Tracking Infectious Disease Spread for Global Pandemic Containment",
"doi": null,
"abstractUrl": "/magazine/ex/2013/06/mex2013060060/13rRUx0Pqx3",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2013/04/mex2013040018",
"title": "Heterogeneous and Stochastic Agent-Based Models for Analyzing Infectious Diseases' Super Spreaders",
"doi": null,
"abstractUrl": "/magazine/ex/2013/04/mex2013040018/13rRUyoPSTe",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2020/9724/0/972400a336",
"title": "Prevention and Control of Emerging Infectious Diseases in Human Populations",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2020/972400a336/1pq9YRuFAgo",
"parentPublication": {
"id": "proceedings/dcabes/2020/9724/0",
"title": "2020 19th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/clei/2020/1560/0/156000a348",
"title": "A discrete proposal for modelling the infectious diseases expansion",
"doi": null,
"abstractUrl": "/proceedings-article/clei/2020/156000a348/1uOu3DqfYFq",
"parentPublication": {
"id": "proceedings/clei/2020/1560/0",
"title": "2020 XLVI Latin American Computing Conference (CLEI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1ANLcd7nkNW",
"title": "2021 IEEE 8th International Conference on Space Mission Challenges for Information Technology (SMC-IT)",
"acronym": "smc-it",
"groupId": "1002093",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1ANLeIO4A3S",
"doi": "10.1109/SMC-IT51442.2021.00018",
"title": "Nanosatellite constellation control framework using evolutionary contact plan design",
"normalizedTitle": "Nanosatellite constellation control framework using evolutionary contact plan design",
"abstract": "Space agencies, educational institutions, and private companies have adopted CubeSat nanosatellites to do scientific research, training, technology demonstration, and space-based industries in the New Space era. The next step in this changing space sector corresponds to the assembly and operation of large satellite constellations consisting of hundreds or thousands of small- or nano-satellites. This context adds new requirements and challenges to the production and operation lines of these space projects. This work focuses on the agile operation of a large nanosatellite constellation with inter-satellite communications. We propose using the constellation contact topology to design contact plans using evolutionary algorithms and use the contact plan information to control the constellation operations. The contact plan is then used to create a Global Flight Plan table that summarizes all the operations required to execute a proposed task. Thus, satellites and ground station nodes only need a flight software capable of queuing, executing, and transferring Flight Plan commands. The evolutionary contact plan design approach shows promising scalability results opening the possibility of controlling satellite mega constellation of hundreds or thousands of nanosatellites.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Space agencies, educational institutions, and private companies have adopted CubeSat nanosatellites to do scientific research, training, technology demonstration, and space-based industries in the New Space era. The next step in this changing space sector corresponds to the assembly and operation of large satellite constellations consisting of hundreds or thousands of small- or nano-satellites. This context adds new requirements and challenges to the production and operation lines of these space projects. This work focuses on the agile operation of a large nanosatellite constellation with inter-satellite communications. We propose using the constellation contact topology to design contact plans using evolutionary algorithms and use the contact plan information to control the constellation operations. The contact plan is then used to create a Global Flight Plan table that summarizes all the operations required to execute a proposed task. Thus, satellites and ground station nodes only need a flight software capable of queuing, executing, and transferring Flight Plan commands. The evolutionary contact plan design approach shows promising scalability results opening the possibility of controlling satellite mega constellation of hundreds or thousands of nanosatellites.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Space agencies, educational institutions, and private companies have adopted CubeSat nanosatellites to do scientific research, training, technology demonstration, and space-based industries in the New Space era. The next step in this changing space sector corresponds to the assembly and operation of large satellite constellations consisting of hundreds or thousands of small- or nano-satellites. This context adds new requirements and challenges to the production and operation lines of these space projects. This work focuses on the agile operation of a large nanosatellite constellation with inter-satellite communications. We propose using the constellation contact topology to design contact plans using evolutionary algorithms and use the contact plan information to control the constellation operations. The contact plan is then used to create a Global Flight Plan table that summarizes all the operations required to execute a proposed task. Thus, satellites and ground station nodes only need a flight software capable of queuing, executing, and transferring Flight Plan commands. The evolutionary contact plan design approach shows promising scalability results opening the possibility of controlling satellite mega constellation of hundreds or thousands of nanosatellites.",
"fno": "856000a085",
"keywords": [
"Artificial Satellites",
"Evolutionary Computation",
"Satellite Communication",
"Telecommunication Network Topology",
"Nanosatellite Constellation Control Framework",
"Space Agencies",
"Educational Institutions",
"Private Companies",
"Cube Sat Nanosatellites",
"Scientific Research",
"Technology Demonstration",
"Space Based Industries",
"New Space Era",
"Changing Space Sector Corresponds",
"Satellite Constellations",
"Operation Lines",
"Space Projects",
"Agile Operation",
"Inter Satellite Communications",
"Constellation Contact Topology",
"Evolutionary Algorithms",
"Contact Plan Information",
"Constellation Operations",
"Global Flight Plan Table",
"Transferring Flight Plan Commands",
"Evolutionary Contact Plan Design Approach",
"Satellite Mega Constellation",
"Training",
"Satellite Constellations",
"Scalability",
"Space Missions",
"Evolutionary Computation",
"Software",
"Topology",
"Cube Sat",
"Constellation",
"Contact Plan Design",
"Evolutionary Algorithm"
],
"authors": [
{
"affiliation": "University of Chile,Electrical Engineering Department,Santiago,Chile",
"fullName": "Carlos E. Gonzalez",
"givenName": "Carlos E.",
"surname": "Gonzalez",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Chile,Department of Computer Science,Santiago,Chile",
"fullName": "Alexandre Bergel",
"givenName": "Alexandre",
"surname": "Bergel",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Chile,Electrical Engineering Department,Santiago,Chile",
"fullName": "Marcos A. Diaz",
"givenName": "Marcos A.",
"surname": "Diaz",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "smc-it",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-07-01T00:00:00",
"pubType": "proceedings",
"pages": "85-92",
"year": "2021",
"issn": null,
"isbn": "978-1-7281-8560-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "856000a077",
"articleId": "1ANLdGg25ag",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "856000a093",
"articleId": "1ANLeqOfpKg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/music/2012/1956/0/4727a240",
"title": "A Source-Based Share-Tree Like Multicast Routing in Satellite Constellation Networks",
"doi": null,
"abstractUrl": "/proceedings-article/music/2012/4727a240/12OmNrGsDl2",
"parentPublication": {
"id": "proceedings/music/2012/1956/0",
"title": "2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing (MUSIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2008/3357/1/3357a660",
"title": "Optimization of Regional Coverage Reconnaissance Satellite Constellation by Improved NSGA-II Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2008/3357a660/12OmNro0Iae",
"parentPublication": {
"id": "proceedings/icicta/2008/3357/1",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imccc/2016/1195/0/07774760",
"title": "Comparative Study of Basic Constellation Models for Regional Satellite Constellation Design",
"doi": null,
"abstractUrl": "/proceedings-article/imccc/2016/07774760/12OmNwbukgo",
"parentPublication": {
"id": "proceedings/imccc/2016/1195/0",
"title": "2016 Sixth International Conference on Instrumentation & Measurement, Computer, Communication and Control (IMCCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2009/3836/2/3836b369",
"title": "Single DSP Hardware Design in Real-Time Multi-constellation Satellite Navigation Receiver",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2009/3836b369/12OmNwswg7l",
"parentPublication": {
"id": "proceedings/cit/2009/3836/2",
"title": "Computer and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imis/2012/4684/0/4684a433",
"title": "A Distribute and Geographic Information Based Routing Algorithm for LEO Satellite Constellation Networks",
"doi": null,
"abstractUrl": "/proceedings-article/imis/2012/4684a433/12OmNzTYC1q",
"parentPublication": {
"id": "proceedings/imis/2012/4684/0",
"title": "Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icftic/2022/2195/0/10075168",
"title": "A kind of Integrated High-speed Data Interaction Network based on SRIO Used in Constellation Satellites System",
"doi": null,
"abstractUrl": "/proceedings-article/icftic/2022/10075168/1LRlnqP9Shy",
"parentPublication": {
"id": "proceedings/icftic/2022/2195/0",
"title": "2022 4th International Conference on Frontiers Technology of Information and Computer (ICFTIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smc-it/2019/1545/0/154500a055",
"title": "Interference-Free Contact Plan Design for Wireless Communication in Space-Terrestrial Networks",
"doi": null,
"abstractUrl": "/proceedings-article/smc-it/2019/154500a055/1e10rtmuCIM",
"parentPublication": {
"id": "proceedings/smc-it/2019/1545/0",
"title": "2019 IEEE International Conference on Space Mission Challenges for Information Technology (SMC-IT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/services/2020/8203/0/820300a275",
"title": "A Novel Edge Computing Server Selection Strategy of LEO Constellation Broadband Network",
"doi": null,
"abstractUrl": "/proceedings-article/services/2020/820300a275/1pK4M7lXmxi",
"parentPublication": {
"id": "proceedings/services/2020/8203/0",
"title": "2020 IEEE World Congress on Services (SERVICES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2021/3892/0/389200a539",
"title": "An Improved Multi-Satellite Cooperative Task Planning Method Based on Distributed Multi-agent System",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2021/389200a539/1t2natjYcSc",
"parentPublication": {
"id": "proceedings/icmtma/2021/3892/0",
"title": "2021 13th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0/148500b235",
"title": "Network Evaluation and Planning for Large-scale Low Earth Orbit Satellite Constellation Networks",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2020/148500b235/1ua4voUa9c4",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0",
"title": "2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAfgwyR",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"acronym": "icassp",
"groupId": "1000002",
"volume": "3",
"displayVolume": "0",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrkjVbh",
"doi": "10.1109/ICASSP.2001.941259",
"title": "Extracting personal characteristics from human movement",
"normalizedTitle": "Extracting personal characteristics from human movement",
"abstract": "We propose a new method for extracting personal characteristics from 3D body movement. We introduce the eigen action space to represent the personal characteristics. First, we estimate the average action from a set of 3D pose parameters from different people. Then we create the eigen action space from the covariance matrices of 3D pose parameters using the KL transform. Because the eigen action space consists of orthogonal base vectors, the 3D pose parameters of a person are represented as a point. A similarity measure is calculated from points in the action eigen space. Also, actions with new personal characteristics can be reconstructed by sampling new points in the eigen action space.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a new method for extracting personal characteristics from 3D body movement. We introduce the eigen action space to represent the personal characteristics. First, we estimate the average action from a set of 3D pose parameters from different people. Then we create the eigen action space from the covariance matrices of 3D pose parameters using the KL transform. Because the eigen action space consists of orthogonal base vectors, the 3D pose parameters of a person are represented as a point. A similarity measure is calculated from points in the action eigen space. Also, actions with new personal characteristics can be reconstructed by sampling new points in the eigen action space.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a new method for extracting personal characteristics from 3D body movement. We introduce the eigen action space to represent the personal characteristics. First, we estimate the average action from a set of 3D pose parameters from different people. Then we create the eigen action space from the covariance matrices of 3D pose parameters using the KL transform. Because the eigen action space consists of orthogonal base vectors, the 3D pose parameters of a person are represented as a point. A similarity measure is calculated from points in the action eigen space. Also, actions with new personal characteristics can be reconstructed by sampling new points in the eigen action space.",
"fno": "00941259",
"keywords": [],
"authors": [
{
"affiliation": "Univ. of Tsukuba, Japan",
"fullName": "J. Hoshino",
"givenName": "J.",
"surname": "Hoshino",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icassp",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-05-01T00:00:00",
"pubType": "proceedings",
"pages": "1673-1676",
"year": "2001",
"issn": null,
"isbn": "0-7803-7041-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00941258",
"articleId": "12OmNAlNiGq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00941260",
"articleId": "12OmNAoUT8m",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwt5sgJ",
"title": "CVPR 2011",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCdk2I2",
"doi": "10.1109/CVPR.2011.5995326",
"title": "Scene shape from texture of objects",
"normalizedTitle": "Scene shape from texture of objects",
"abstract": "Joint reasoning about objects and 3D scene layout has shown great promise in scene interpretation. One visual cue that has been overlooked is texture arising from a spatial repetition of objects in the scene (e.g., windows of a building). Such texture provides scene-specific constraints among objects, and thus facilitates scene interpretation. We present an approach to: (1) detecting distinct textures of objects in a scene, (2) reconstructing the 3D shape of detected texture surfaces, and (3) combining object detections and shape-from-texture toward a globally consistent scene interpretation. Inference is formulated within the reinforcement learning framework as a sequential interpretation of image regions, starting from confident regions to guide the interpretation of other regions. Our algorithm finds an optimal policy that maps states of detected objects and reconstructed surfaces to actions which ought to be taken in those states, including detecting new objects and identifying new textures, so as to minimize a long-term loss. Tests against ground truth obtained from stereo images demonstrate that we can coarsely reconstruct a 3D model of the scene from a single image, without learning the layout of common scene surfaces, as done in prior work. We also show that reasoning about texture of objects improves object detection.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Joint reasoning about objects and 3D scene layout has shown great promise in scene interpretation. One visual cue that has been overlooked is texture arising from a spatial repetition of objects in the scene (e.g., windows of a building). Such texture provides scene-specific constraints among objects, and thus facilitates scene interpretation. We present an approach to: (1) detecting distinct textures of objects in a scene, (2) reconstructing the 3D shape of detected texture surfaces, and (3) combining object detections and shape-from-texture toward a globally consistent scene interpretation. Inference is formulated within the reinforcement learning framework as a sequential interpretation of image regions, starting from confident regions to guide the interpretation of other regions. Our algorithm finds an optimal policy that maps states of detected objects and reconstructed surfaces to actions which ought to be taken in those states, including detecting new objects and identifying new textures, so as to minimize a long-term loss. Tests against ground truth obtained from stereo images demonstrate that we can coarsely reconstruct a 3D model of the scene from a single image, without learning the layout of common scene surfaces, as done in prior work. We also show that reasoning about texture of objects improves object detection.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Joint reasoning about objects and 3D scene layout has shown great promise in scene interpretation. One visual cue that has been overlooked is texture arising from a spatial repetition of objects in the scene (e.g., windows of a building). Such texture provides scene-specific constraints among objects, and thus facilitates scene interpretation. We present an approach to: (1) detecting distinct textures of objects in a scene, (2) reconstructing the 3D shape of detected texture surfaces, and (3) combining object detections and shape-from-texture toward a globally consistent scene interpretation. Inference is formulated within the reinforcement learning framework as a sequential interpretation of image regions, starting from confident regions to guide the interpretation of other regions. Our algorithm finds an optimal policy that maps states of detected objects and reconstructed surfaces to actions which ought to be taken in those states, including detecting new objects and identifying new textures, so as to minimize a long-term loss. Tests against ground truth obtained from stereo images demonstrate that we can coarsely reconstruct a 3D model of the scene from a single image, without learning the layout of common scene surfaces, as done in prior work. We also show that reasoning about texture of objects improves object detection.",
"fno": "05995326",
"keywords": [
"Stereo Images",
"Scene Shape",
"Object Texture",
"Joint Reasoning",
"3 D Scene Layout",
"Scene Interpretation",
"3 D Shape Reconstruction",
"Object Detection",
"Shape From Texture"
],
"authors": [
{
"affiliation": "Oregon State Univ., Corvallis, OR, USA",
"fullName": "N. Payet",
"givenName": "N.",
"surname": "Payet",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Oregon State Univ., Corvallis, OR, USA",
"fullName": "S. Todorovic",
"givenName": "S.",
"surname": "Todorovic",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-06-01T00:00:00",
"pubType": "proceedings",
"pages": "2017-2024",
"year": "2011",
"issn": null,
"isbn": "978-1-4577-0394-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05995325",
"articleId": "12OmNyo1nQB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05995327",
"articleId": "12OmNBIFmwn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2001/1143/2/114320447",
"title": "Shape from texture and integrability",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/114320447/12OmNBezSER",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micai/2007/3124/0/3124a131",
"title": "Color Texture Histograms for Natural Images Interpretation",
"doi": null,
"abstractUrl": "/proceedings-article/micai/2007/3124a131/12OmNqI04PG",
"parentPublication": {
"id": "proceedings/micai/2007/3124/0",
"title": "2007 Sixth Mexican International Conference on Artificial Intelligence, Special Session (MICAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420121",
"title": "Texture segmentation and shape in the same image",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420121/12OmNvkpl2J",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1993/3880/0/00340979",
"title": "A differential method for computing local shape-from-texture for planar and curved surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00340979/12OmNwAt1Hp",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1992/2855/0/00223261",
"title": "Shape from texture using Markov random field models and stereo-windows",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223261/12OmNyo1nVL",
"parentPublication": {
"id": "proceedings/cvpr/1992/2855/0",
"title": "Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2002/1537/0/15370219",
"title": "Equal Intensity Map Texture Modeling for Natural Scene Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2002/15370219/12OmNzRHORY",
"parentPublication": {
"id": "proceedings/ssiai/2002/1537/0",
"title": "Image Analysis and Interpretation, IEEE Southwest Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/04/v0351",
"title": "Extracting Objects from Range and Radiance Images",
"doi": null,
"abstractUrl": "/journal/tg/2001/04/v0351/13rRUwIF69a",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2002/04/i0536",
"title": "The Texture Gradient Equation for Recovering Shape from Texture",
"doi": null,
"abstractUrl": "/journal/tp/2002/04/i0536/13rRUxASuBp",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2006/03/i0446",
"title": "Relief Texture from Specularities",
"doi": null,
"abstractUrl": "/journal/tp/2006/03/i0446/13rRUy3xY97",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1995/04/i0333",
"title": "Shape from Texture Using Local Spectral Moments",
"doi": null,
"abstractUrl": "/journal/tp/1995/04/i0333/13rRUyfKIIT",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBC8AAP",
"title": "Workshop on Directions in Automated CAD-Based Vision",
"acronym": "cadvis",
"groupId": "1001910",
"volume": "0",
"displayVolume": "0",
"year": "1991",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwF0BN7",
"doi": "10.1109/CADVIS.1991.148775",
"title": "Context-constrained matching of hierarchical CAD-based models for outdoor scene interpretation",
"normalizedTitle": "Context-constrained matching of hierarchical CAD-based models for outdoor scene interpretation",
"abstract": "The authors propose a method for outdoor scene interpretation which recognizes many kinds of objects in the scene, and determines their geometric structures using context information of objects in the scene and flexible matching of hierarchical CAD-based models. The system can deal with outdoor scenes with artificial objects which may have various shapes and sizes, and natural objects for which there are no CAD-based models. The system uses the intermediate results of the scene interpretation as context information to prune the candidate object classes, their positions and orientations, and uses hierarchical CAD models so that higher models may be able to represent one object class such as a house, with several variations by allowing changes of dimensions. The input scene is segmented into a ground plane and objects on it using the multisensory information such as video and range images, and planar surface patches are extracted from the segmented regions. Flexible matching between the scene descriptions and the hierarchical CAD models is performed.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors propose a method for outdoor scene interpretation which recognizes many kinds of objects in the scene, and determines their geometric structures using context information of objects in the scene and flexible matching of hierarchical CAD-based models. The system can deal with outdoor scenes with artificial objects which may have various shapes and sizes, and natural objects for which there are no CAD-based models. The system uses the intermediate results of the scene interpretation as context information to prune the candidate object classes, their positions and orientations, and uses hierarchical CAD models so that higher models may be able to represent one object class such as a house, with several variations by allowing changes of dimensions. The input scene is segmented into a ground plane and objects on it using the multisensory information such as video and range images, and planar surface patches are extracted from the segmented regions. Flexible matching between the scene descriptions and the hierarchical CAD models is performed.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors propose a method for outdoor scene interpretation which recognizes many kinds of objects in the scene, and determines their geometric structures using context information of objects in the scene and flexible matching of hierarchical CAD-based models. The system can deal with outdoor scenes with artificial objects which may have various shapes and sizes, and natural objects for which there are no CAD-based models. The system uses the intermediate results of the scene interpretation as context information to prune the candidate object classes, their positions and orientations, and uses hierarchical CAD models so that higher models may be able to represent one object class such as a house, with several variations by allowing changes of dimensions. The input scene is segmented into a ground plane and objects on it using the multisensory information such as video and range images, and planar surface patches are extracted from the segmented regions. Flexible matching between the scene descriptions and the hierarchical CAD models is performed.",
"fno": "00148775",
"keywords": [
"CAD",
"Computational Geometry",
"Computer Vision",
"Computerised Pattern Recognition",
"Computerised Picture Processing",
"Digital Simulation",
"Solid Modelling",
"Computer Vision",
"Object Recognition",
"Outdoor Scene Interpretation",
"Geometric Structures",
"CAD Models",
"Matching",
"Context Modeling",
"Layout",
"Solid Modeling",
"Shape",
"Machine Vision",
"Roads",
"Image Segmentation",
"Object Recognition",
"Machinery",
"Text Recognition"
],
"authors": [
{
"affiliation": "Mech. Eng. for Comput. Controlled Machinery, Osaka Univ., Japan",
"fullName": "K. Kadono",
"givenName": "K.",
"surname": "Kadono",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Mech. Eng. for Comput. Controlled Machinery, Osaka Univ., Japan",
"fullName": "M. Asafa",
"givenName": "M.",
"surname": "Asafa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Mech. Eng. for Comput. Controlled Machinery, Osaka Univ., Japan",
"fullName": "Y. Shitai",
"givenName": "Y.",
"surname": "Shitai",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cadvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1991-01-01T00:00:00",
"pubType": "proceedings",
"pages": "186,187,188,189,190,191,192,193,194,195",
"year": "1991",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00148774",
"articleId": "12OmNBQTJgS",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1990/2062/1/00118094",
"title": "An image analysis, application for aerial imagery interpretation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00118094/12OmNBEGYJ2",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/1",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/1995/7190/0/71900151",
"title": "Using geometric hashing with information theoretic clustering for fast recognition from a large CAD modelbase",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/1995/71900151/12OmNBKmXty",
"parentPublication": {
"id": "proceedings/iscv/1995/7190/0",
"title": "Computer Vision, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadvis/1994/5310/0/00284500",
"title": "Generic object recognition using CAD-based multiple representations",
"doi": null,
"abstractUrl": "/proceedings-article/cadvis/1994/00284500/12OmNwErpJf",
"parentPublication": {
"id": "proceedings/cadvis/1994/5310/0",
"title": "Proceedings of 1994 IEEE 2nd CAD-Based Vision Workshop",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2018/9264/0/926400a234",
"title": "Hybrid Cloud Rendering System for Massive CAD Models",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2018/926400a234/17D45XDIXXh",
"parentPublication": {
"id": "proceedings/sibgrapi/2018/9264/0",
"title": "2018 31st SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09860006",
"title": "Pattern Matters: Hierarchical Correlated Strip Convolutional Network for Scene Text Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09860006/1G9DPBwzWU0",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600d155",
"title": "Automatically Annotating Indoor Images with CAD Models via RGB-D Scans",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600d155/1L8qmHc58K4",
"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/2019/3293/0/329300c609",
"title": "Scan2CAD: Learning CAD Model Alignment in RGB-D Scans",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300c609/1gyrGrOck5q",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300c551",
"title": "End-to-End CAD Model Retrieval and 9DoF Alignment in 3D Scans",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300c551/1hVlOXSOVYA",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800a927",
"title": "Scene Recomposition by Learning-Based ICP",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800a927/1m3ne124gRa",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09413251",
"title": "Exploring and Exploiting the Hierarchical Structure of a Scene for Scene Graph Generation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09413251/1tmiAWicGfS",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyQYtf2",
"title": "2017 International Conference on 3D Vision (3DV)",
"acronym": "3dv",
"groupId": "1800494",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxWLTH7",
"doi": "10.1109/3DV.2017.00082",
"title": "Joint 3D Reconstruction of a Static Scene and Moving Objects",
"normalizedTitle": "Joint 3D Reconstruction of a Static Scene and Moving Objects",
"abstract": "We present a technique for simultaneous 3D reconstruction of static regions and rigidly moving objects in a scene. An RGB-D frame is represented as a collection of features, which are points and planes. We classify the features into static and dynamic regions and grow separate maps, static and object maps, for each of them. To robustly classify the features in each frame, we fuse multiple RANSAC-based registration results obtained by registering different groups of the features to different maps, including (1) all the features to the static map, (2) all the features to each object map, and (3) subsets of the features, each forming a segment, to each object map. This multi-group registration approach is designed to overcome the following challenges: scenes can be dominated by static regions, making object tracking more difficult; and moving object might have larger pose variation between frames compared to the static regions. We show qualitative results from indoor scenes with objects in various shapes. The technique enables on-the-fly object model generation to be used for robotic manipulation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a technique for simultaneous 3D reconstruction of static regions and rigidly moving objects in a scene. An RGB-D frame is represented as a collection of features, which are points and planes. We classify the features into static and dynamic regions and grow separate maps, static and object maps, for each of them. To robustly classify the features in each frame, we fuse multiple RANSAC-based registration results obtained by registering different groups of the features to different maps, including (1) all the features to the static map, (2) all the features to each object map, and (3) subsets of the features, each forming a segment, to each object map. This multi-group registration approach is designed to overcome the following challenges: scenes can be dominated by static regions, making object tracking more difficult; and moving object might have larger pose variation between frames compared to the static regions. We show qualitative results from indoor scenes with objects in various shapes. The technique enables on-the-fly object model generation to be used for robotic manipulation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a technique for simultaneous 3D reconstruction of static regions and rigidly moving objects in a scene. An RGB-D frame is represented as a collection of features, which are points and planes. We classify the features into static and dynamic regions and grow separate maps, static and object maps, for each of them. To robustly classify the features in each frame, we fuse multiple RANSAC-based registration results obtained by registering different groups of the features to different maps, including (1) all the features to the static map, (2) all the features to each object map, and (3) subsets of the features, each forming a segment, to each object map. This multi-group registration approach is designed to overcome the following challenges: scenes can be dominated by static regions, making object tracking more difficult; and moving object might have larger pose variation between frames compared to the static regions. We show qualitative results from indoor scenes with objects in various shapes. The technique enables on-the-fly object model generation to be used for robotic manipulation.",
"fno": "261001a677",
"keywords": [
"Image Reconstruction",
"Image Registration",
"Image Representation",
"Object Detection",
"Object Tracking",
"Joint 3 D Reconstruction",
"Static Scene",
"Simultaneous 3 D Reconstruction",
"Static Regions",
"Dynamic Regions",
"Separate Maps",
"Static Object Maps",
"Multiple RANSAC Based Registration Results",
"Static Map",
"Object Map",
"Multigroup Registration Approach",
"Object Tracking",
"Moving Object",
"Indoor Scenes",
"On The Fly Object Model Generation",
"Moving Objects",
"Three Dimensional Displays",
"Feature Extraction",
"Simultaneous Localization And Mapping",
"Solid Modeling",
"Object Tracking",
"Object Detection",
"Motion Segmentation",
"3 D Reconstruction",
"SLAM",
"Object Modeling"
],
"authors": [
{
"affiliation": null,
"fullName": "Sergio Caccamo",
"givenName": "Sergio",
"surname": "Caccamo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Esra Ataer-Cansizoglu",
"givenName": "Esra",
"surname": "Ataer-Cansizoglu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yuichi Taguchi",
"givenName": "Yuichi",
"surname": "Taguchi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "3dv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "677-685",
"year": "2017",
"issn": "2475-7888",
"isbn": "978-1-5386-2610-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "261001a667",
"articleId": "12OmNywxlOg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "261001a686",
"articleId": "12OmNBLdKMa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ismar/2014/6184/0/06948420",
"title": "Semi-dense visual odometry for AR on a smartphone",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2014/06948420/12OmNAXPykk",
"parentPublication": {
"id": "proceedings/ismar/2014/6184/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2012/4797/0/4797a313",
"title": "Detection, Segmentation, and Tracking of Moving Objects in UAV Videos",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2012/4797a313/12OmNx57HQR",
"parentPublication": {
"id": "proceedings/avss/2012/4797/0",
"title": "2012 IEEE Ninth International Conference on Advanced Video and Signal-Based Surveillance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iros/1995/7108/1/71080329",
"title": "Grasping of static and moving objects using a vision-based control approach",
"doi": null,
"abstractUrl": "/proceedings-article/iros/1995/71080329/12OmNyXMQkI",
"parentPublication": {
"id": "proceedings/iros/1995/7108/1",
"title": "Intelligent Robots and Systems, IEEE/RSJ International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2014/4871/0/06918637",
"title": "Scene geometry from moving objects",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2014/06918637/12OmNzxPTMs",
"parentPublication": {
"id": "proceedings/avss/2014/4871/0",
"title": "2014 International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/candarw/2018/9184/0/918400a544",
"title": "Robust Mapping for the Autonomous Mobile Robot Considering Potential Occupied Spaces of Objects",
"doi": null,
"abstractUrl": "/proceedings-article/candarw/2018/918400a544/17D45XDIXXa",
"parentPublication": {
"id": "proceedings/candarw/2018/9184/0",
"title": "2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2018/7459/0/745900a010",
"title": "MaskFusion: Real-Time Recognition, Tracking and Reconstruction of Multiple Moving Objects",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2018/745900a010/17D45Xtvp9V",
"parentPublication": {
"id": "proceedings/ismar/2018/7459/0",
"title": "2018 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a509",
"title": "SCP-SLAM: Accelerating DynaSLAM With Static Confidence Propagation",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a509/1MNgqqS7YI0",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300f864",
"title": "EM-Fusion: Dynamic Object-Level SLAM With Probabilistic Data Association",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300f864/1hQqoQaNkBy",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2019/5023/0/502300d751",
"title": "Spatial Perception by Object-Aware Visual Scene Representation",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300d751/1i5mnHS3Q2c",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412341",
"title": "Learning to Segment Dynamic Objects using SLAM Outliers",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412341/1tmjm0W44yQ",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNz61dBD",
"title": "Proceedings. Workshop on Interpretation of 3D Scenes",
"acronym": "tdscen",
"groupId": "1001903",
"volume": "0",
"displayVolume": "0",
"year": "1989",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy50g7u",
"doi": "10.1109/TDSCEN.1989.68112",
"title": "Scene description using range data",
"normalizedTitle": "Scene description using range data",
"abstract": "A technique for describing scenes consisting of piles of simple but unknown objects using dense range images is discussed. The technique uses concepts such as symmetry, stability, viewpoint independence, and object solidity to hypothesize the unknown shapes and sizes of the objects. These hypotheses are analyzed using the known geometry of the range sensor to rule out the inconsistent configurations. The final result of the analysis is one or more descriptions of the 3D scene, each of which is consistent with the sensed data and with the constraints imposed by the physics of objects in contact.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A technique for describing scenes consisting of piles of simple but unknown objects using dense range images is discussed. The technique uses concepts such as symmetry, stability, viewpoint independence, and object solidity to hypothesize the unknown shapes and sizes of the objects. These hypotheses are analyzed using the known geometry of the range sensor to rule out the inconsistent configurations. The final result of the analysis is one or more descriptions of the 3D scene, each of which is consistent with the sensed data and with the constraints imposed by the physics of objects in contact.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A technique for describing scenes consisting of piles of simple but unknown objects using dense range images is discussed. The technique uses concepts such as symmetry, stability, viewpoint independence, and object solidity to hypothesize the unknown shapes and sizes of the objects. These hypotheses are analyzed using the known geometry of the range sensor to rule out the inconsistent configurations. The final result of the analysis is one or more descriptions of the 3D scene, each of which is consistent with the sensed data and with the constraints imposed by the physics of objects in contact.",
"fno": "00068112",
"keywords": [
"Computer Vision",
"Computerised Pattern Recognition",
"Image Sensors",
"3 D Scene Description",
"Hypothesizing Shapes Sizes",
"Unknown Objects",
"Dense Range Images",
"Symmetry",
"Stability",
"Viewpoint Independence",
"Object Solidity",
"Range Sensor",
"Layout",
"Geometry",
"Materials Handling",
"Shape Control",
"Solid Modeling",
"Belts",
"Cameras",
"Stability",
"Physics",
"Fires"
],
"authors": [
{
"affiliation": "SRI Int., Menlo Park, CA, USA",
"fullName": "P.G. Mulgaonkar",
"givenName": "P.G.",
"surname": "Mulgaonkar",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "SRI Int., Menlo Park, CA, USA",
"fullName": "C.K. Cowan",
"givenName": "C.K.",
"surname": "Cowan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "SRI Int., Menlo Park, CA, USA",
"fullName": "J. DeCurtins",
"givenName": "J.",
"surname": "DeCurtins",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "tdscen",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1989-01-01T00:00:00",
"pubType": "proceedings",
"pages": "138,139,140,141,142,143,144",
"year": "1989",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00068111",
"articleId": "12OmNwcCIWS",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00068113",
"articleId": "12OmNqAU6GY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1988/0862/0/00196338",
"title": "Localization of objects from range data",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1988/00196338/12OmNBqMDDv",
"parentPublication": {
"id": "proceedings/cvpr/1988/0862/0",
"title": "Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iai/1994/6250/0/00336669",
"title": "An algorithm for 3D scene description in an unknown environment",
"doi": null,
"abstractUrl": "/proceedings-article/iai/1994/00336669/12OmNwpoFDv",
"parentPublication": {
"id": "proceedings/iai/1994/6250/0",
"title": "Proceedings of the IEEE Southwest Symposium on Image Analysis and Interpretation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1988/0878/0/00028384",
"title": "Automatic recognition of 3-D objects via geographic encoding",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028384/12OmNx6g6lv",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1989/1938/0/00100013",
"title": "Scene description for object manipulation in unstructured environments",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1989/00100013/12OmNz5JC9N",
"parentPublication": {
"id": "proceedings/robot/1989/1938/0",
"title": "1989 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsa/2010/3999/0/3999a024",
"title": "Teaching Materials of Physics about Lorentz Contraction Generated by KETpic",
"doi": null,
"abstractUrl": "/proceedings-article/iccsa/2010/3999a024/12OmNzahc6B",
"parentPublication": {
"id": "proceedings/iccsa/2010/3999/0",
"title": "2010 International Conference on Computational Science and Its Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1994/6240/0/00323993",
"title": "A particle system using CSG for description and visualization",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1994/00323993/12OmNzcPAji",
"parentPublication": {
"id": "proceedings/ca/1994/6240/0",
"title": "Proceedings of Computer Animation '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvbvs/1999/0050/0/00500120",
"title": "LADAR Scene Description using Fuzzy Morphology and Rules",
"doi": null,
"abstractUrl": "/proceedings-article/cvbvs/1999/00500120/12OmNzmclMj",
"parentPublication": {
"id": "proceedings/cvbvs/1999/0050/0",
"title": "Computer Vision Beyond the Visible Spectrum, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1992/02/i0303",
"title": "Understanding Object Configurations using Range Images",
"doi": null,
"abstractUrl": "/journal/tp/1992/02/i0303/13rRUEgartF",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1992/06/i0616",
"title": "Perceptual Organization for Scene Segmentation and Description",
"doi": null,
"abstractUrl": "/journal/tp/1992/06/i0616/13rRUwbJD5N",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2021/0898/0/089800a896",
"title": "Terroristic Content Detection using a Multi-scene classification system",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2021/089800a896/1zw6i6sWfFC",
"parentPublication": {
"id": "proceedings/ictai/2021/0898/0",
"title": "2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwdbV00",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzwZ6h0",
"doi": "10.1109/CVPR.2012.6247996",
"title": "Automatic discovery of groups of objects for scene understanding",
"normalizedTitle": "Automatic discovery of groups of objects for scene understanding",
"abstract": "Objects in scenes interact with each other in complex ways. A key observation is that these interactions manifest themselves as predictable visual patterns in the image. Discovering and detecting these structured patterns is an important step towards deeper scene understanding. It goes beyond using either individual objects or the scene as a whole as the semantic unit. In this work, we promote \"groups of objects\". They are high-order composites of objects that demonstrate consistent spatial, scale, and viewpoint interactions with each other. These groups of objects are likely to correspond to a specific layout of the scene. They can thus provide cues for the scene category and can also prime the likely locations of other objects in the scene. It is not feasible to manually generate a list of all possible groupings of objects we find in our visual world. Hence, we propose an algorithm that automatically discovers groups of arbitrary numbers of participating objects from a collection of images labeled with object categories. Our approach builds a 4-dimensional transform space of location, scale and viewpoint, and efficiently identifies all recurring compositions of objects across images. We then model the discovered groups of objects using the deformable parts-based model. Our experiments on a variety of datasets show that using groups of objects can significantly boost the performance of object detection and scene categorization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Objects in scenes interact with each other in complex ways. A key observation is that these interactions manifest themselves as predictable visual patterns in the image. Discovering and detecting these structured patterns is an important step towards deeper scene understanding. It goes beyond using either individual objects or the scene as a whole as the semantic unit. In this work, we promote \"groups of objects\". They are high-order composites of objects that demonstrate consistent spatial, scale, and viewpoint interactions with each other. These groups of objects are likely to correspond to a specific layout of the scene. They can thus provide cues for the scene category and can also prime the likely locations of other objects in the scene. It is not feasible to manually generate a list of all possible groupings of objects we find in our visual world. Hence, we propose an algorithm that automatically discovers groups of arbitrary numbers of participating objects from a collection of images labeled with object categories. Our approach builds a 4-dimensional transform space of location, scale and viewpoint, and efficiently identifies all recurring compositions of objects across images. We then model the discovered groups of objects using the deformable parts-based model. Our experiments on a variety of datasets show that using groups of objects can significantly boost the performance of object detection and scene categorization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Objects in scenes interact with each other in complex ways. A key observation is that these interactions manifest themselves as predictable visual patterns in the image. Discovering and detecting these structured patterns is an important step towards deeper scene understanding. It goes beyond using either individual objects or the scene as a whole as the semantic unit. In this work, we promote \"groups of objects\". They are high-order composites of objects that demonstrate consistent spatial, scale, and viewpoint interactions with each other. These groups of objects are likely to correspond to a specific layout of the scene. They can thus provide cues for the scene category and can also prime the likely locations of other objects in the scene. It is not feasible to manually generate a list of all possible groupings of objects we find in our visual world. Hence, we propose an algorithm that automatically discovers groups of arbitrary numbers of participating objects from a collection of images labeled with object categories. Our approach builds a 4-dimensional transform space of location, scale and viewpoint, and efficiently identifies all recurring compositions of objects across images. We then model the discovered groups of objects using the deformable parts-based model. Our experiments on a variety of datasets show that using groups of objects can significantly boost the performance of object detection and scene categorization.",
"fno": "346P3A35",
"keywords": [
"Object Detection",
"Scene Categorization",
"Automatic Discovery",
"Scene Understanding",
"Predictable Visual Pattern",
"Structured Pattern Discovery",
"Structured Pattern Detection",
"Semantic Unit",
"Groups Of Objects",
"Scene Layout",
"Scene Category",
"Visual World",
"Image Collection",
"Object Category",
"4 Dimensional Transform Space",
"Object Composition",
"Deformable Parts Based Model",
"Object Detection",
"Transforms",
"Visualization",
"Deformable Models",
"Clustering Algorithms",
"Object Detection",
"Detectors",
"Training"
],
"authors": [
{
"affiliation": null,
"fullName": "Tsuhan Chen",
"givenName": null,
"surname": "Tsuhan Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Toyota Technol. Inst. (Chicago), Chicago, IL, USA",
"fullName": "D. Parikh",
"givenName": "D.",
"surname": "Parikh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Congcong Li",
"givenName": null,
"surname": "Congcong Li",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-06-01T00:00:00",
"pubType": "proceedings",
"pages": "2735-2742",
"year": "2012",
"issn": "1063-6919",
"isbn": "978-1-4673-1226-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "345P3A34",
"articleId": "12OmNwDACEg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "347P3A36",
"articleId": "12OmNAqCtOQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2012/1226/0/341P3A30",
"title": "Recognizing scene viewpoint using panoramic place representation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2012/341P3A30/12OmNBOll9c",
"parentPublication": {
"id": "proceedings/cvpr/2012/1226/0",
"title": "2012 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995326",
"title": "Scene shape from texture of objects",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995326/12OmNCdk2I2",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032b270",
"title": "Scene Graph Generation from Objects, Phrases and Region Captions",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032b270/12OmNrkjVqu",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2011/0394/0/05995547",
"title": "Monocular 3D scene understanding with explicit occlusion reasoning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995547/12OmNvAiSdk",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206828",
"title": "Understanding images of groups of people",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206828/12OmNvkYxaV",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2017/2610/0/261001a677",
"title": "Joint 3D Reconstruction of a Static Scene and Moving Objects",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a677/12OmNxWLTH7",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2013/2840/0/2840b873",
"title": "3DNN: Viewpoint Invariant 3D Geometry Matching for Scene Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2013/2840b873/12OmNyQYtjd",
"parentPublication": {
"id": "proceedings/iccv/2013/2840/0",
"title": "2013 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2014/4871/0/06918637",
"title": "Scene geometry from moving objects",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2014/06918637/12OmNzxPTMs",
"parentPublication": {
"id": "proceedings/avss/2014/4871/0",
"title": "2014 International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/04/ttp2013040882",
"title": "Monocular Visual Scene Understanding: Understanding Multi-Object Traffic Scenes",
"doi": null,
"abstractUrl": "/journal/tp/2013/04/ttp2013040882/13rRUwdrdLY",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412662",
"title": "FashionGraph: Understanding fashion data using scene graph generation",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412662/1tmjp7Qu9ji",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1BmEezmpGrm",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1BmFoAFYs7K",
"doi": "10.1109/ICCV48922.2021.00558",
"title": "Scene Synthesis via Uncertainty-Driven Attribute Synchronization",
"normalizedTitle": "Scene Synthesis via Uncertainty-Driven Attribute Synchronization",
"abstract": "Developing deep neural networks to generate 3D scenes is a fundamental problem in neural synthesis with immediate applications in architectural CAD, computer graphics, as well as in generating virtual robot training environments. This task is challenging because 3D scenes exhibit diverse patterns, ranging from continuous ones, such as object sizes and the relative poses between pairs of shapes, to discrete patterns, such as occurrence and co-occurrence of objects with symmetrical relationships. This paper introduces a novel neural scene synthesis approach that can capture diverse feature patterns of 3D scenes. Our method combines the strength of both neural network-based and conventional scene synthesis approaches. We use the parametric prior distributions learned from training data, which provide uncertainties of object attributes and relative attributes, to regularize the outputs of feed-forward neural models. Moreover, instead of merely predicting a scene layout, our approach predicts an over-complete set of attributes. This methodology allows us to utilize the underlying consistency constraints among the predicted attributes to prune infeasible predictions. Experimental results show that our approach outperforms existing methods considerably. The generated 3D scenes interpolate the training data faithfully while preserving both continuous and discrete feature patterns.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Developing deep neural networks to generate 3D scenes is a fundamental problem in neural synthesis with immediate applications in architectural CAD, computer graphics, as well as in generating virtual robot training environments. This task is challenging because 3D scenes exhibit diverse patterns, ranging from continuous ones, such as object sizes and the relative poses between pairs of shapes, to discrete patterns, such as occurrence and co-occurrence of objects with symmetrical relationships. This paper introduces a novel neural scene synthesis approach that can capture diverse feature patterns of 3D scenes. Our method combines the strength of both neural network-based and conventional scene synthesis approaches. We use the parametric prior distributions learned from training data, which provide uncertainties of object attributes and relative attributes, to regularize the outputs of feed-forward neural models. Moreover, instead of merely predicting a scene layout, our approach predicts an over-complete set of attributes. This methodology allows us to utilize the underlying consistency constraints among the predicted attributes to prune infeasible predictions. Experimental results show that our approach outperforms existing methods considerably. The generated 3D scenes interpolate the training data faithfully while preserving both continuous and discrete feature patterns.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Developing deep neural networks to generate 3D scenes is a fundamental problem in neural synthesis with immediate applications in architectural CAD, computer graphics, as well as in generating virtual robot training environments. This task is challenging because 3D scenes exhibit diverse patterns, ranging from continuous ones, such as object sizes and the relative poses between pairs of shapes, to discrete patterns, such as occurrence and co-occurrence of objects with symmetrical relationships. This paper introduces a novel neural scene synthesis approach that can capture diverse feature patterns of 3D scenes. Our method combines the strength of both neural network-based and conventional scene synthesis approaches. We use the parametric prior distributions learned from training data, which provide uncertainties of object attributes and relative attributes, to regularize the outputs of feed-forward neural models. Moreover, instead of merely predicting a scene layout, our approach predicts an over-complete set of attributes. This methodology allows us to utilize the underlying consistency constraints among the predicted attributes to prune infeasible predictions. Experimental results show that our approach outperforms existing methods considerably. The generated 3D scenes interpolate the training data faithfully while preserving both continuous and discrete feature patterns.",
"fno": "281200f610",
"keywords": [
"Training",
"Solid Modeling",
"Three Dimensional Displays",
"Uncertainty",
"Shape",
"Neural Networks",
"Layout",
"Neural Generative Models",
"3 D From A Single Image And Shape From X",
"Optimization And Learning Methods",
"Representation Learning",
"Scene Analysis And Understanding"
],
"authors": [
{
"affiliation": "The University of Texas at Austin",
"fullName": "Haitao Yang",
"givenName": "Haitao",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Texas at Austin",
"fullName": "Zaiwei Zhang",
"givenName": "Zaiwei",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Texas at Austin",
"fullName": "Siming Yan",
"givenName": "Siming",
"surname": "Yan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Kuaishou Technology",
"fullName": "Haibin Huang",
"givenName": "Haibin",
"surname": "Huang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Kuaishou Technology",
"fullName": "Chongyang Ma",
"givenName": "Chongyang",
"surname": "Ma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Kuaishou Technology",
"fullName": "Yi Zheng",
"givenName": "Yi",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Texas at Austin",
"fullName": "Chandrajit Bajaj",
"givenName": "Chandrajit",
"surname": "Bajaj",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Texas at Austin",
"fullName": "Qixing Huang",
"givenName": "Qixing",
"surname": "Huang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-10-01T00:00:00",
"pubType": "proceedings",
"pages": "5610-5620",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-2812-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "281200f600",
"articleId": "1BmG0cJclQA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "281200f621",
"articleId": "1BmFe562Y9O",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2014/5118/0/5118a684",
"title": "Single-View 3D Scene Parsing by Attributed Grammar",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118a684/12OmNCbCrQn",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2016/2303/0/2303a009",
"title": "A Rapid Modeling Method for 3D Architectural Scene",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2016/2303a009/12OmNwwd2PK",
"parentPublication": {
"id": "proceedings/cw/2016/2303/0",
"title": "2016 International Conference on Cyberworlds (CW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200p5183",
"title": "Indoor Scene Generation from a Collection of Semantic-Segmented Depth Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200p5183/1BmFbxElKX6",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10018465",
"title": "<sc>SceneHGN</sc>: Hierarchical Graph Networks for 3D Indoor Scene Generation with Fine-Grained Geometry",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10018465/1K0DC1ki5P2",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600a785",
"title": "Learning Graph Variational Autoencoders with Constraints and Structured Priors for Conditional Indoor 3D Scene Generation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600a785/1KxVq4DixWg",
"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/wacv/2023/9346/0/934600e329",
"title": "Control-NeRF: Editable Feature Volumes for Scene Rendering and Manipulation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600e329/1L8qzXVyRlS",
"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/tg/5555/01/10106472",
"title": "SceneDirector: Interactive Scene Synthesis by Simultaneously Editing Multiple Objects in Real-Time",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10106472/1MwApuOJ1MA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2019/3293/0/329300h695",
"title": "Neural Scene Decomposition for Multi-Person Motion Capture",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300h695/1gyrSCQUIzm",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900g494",
"title": "Neural Scene Flow Fields for Space-Time View Synthesis of Dynamic Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900g494/1yeJeL2a18s",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800a106",
"title": "SceneFormer: Indoor Scene Generation with Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800a106/1zWE85KaUSs",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1hQqfuoOyHu",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1hVleQiR3sQ",
"doi": "10.1109/ICCV.2019.00748",
"title": "SceneGraphNet: Neural Message Passing for 3D Indoor Scene Augmentation",
"normalizedTitle": "SceneGraphNet: Neural Message Passing for 3D Indoor Scene Augmentation",
"abstract": "In this paper we propose a neural message passing approach to augment an input 3D indoor scene with new objects matching their surroundings. Given an input, potentially incomplete, 3D scene and a query location, our method predicts a probability distribution over object types that fit well in that location. Our distribution is predicted though passing learned messages in a dense graph whose nodes represent objects in the input scene and edges represent spatial and structural relationships. By weighting messages through an attention mechanism, our method learns to focus on the most relevant surrounding scene context to predict new scene objects. We found that our method significantly outperforms state-of-the-art approaches in terms of correctly predicting objects missing in a scene based on our experiments in the SUNCG dataset. We also demonstrate other applications of our method, including context-based 3D object recognition and iterative scene generation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper we propose a neural message passing approach to augment an input 3D indoor scene with new objects matching their surroundings. Given an input, potentially incomplete, 3D scene and a query location, our method predicts a probability distribution over object types that fit well in that location. Our distribution is predicted though passing learned messages in a dense graph whose nodes represent objects in the input scene and edges represent spatial and structural relationships. By weighting messages through an attention mechanism, our method learns to focus on the most relevant surrounding scene context to predict new scene objects. We found that our method significantly outperforms state-of-the-art approaches in terms of correctly predicting objects missing in a scene based on our experiments in the SUNCG dataset. We also demonstrate other applications of our method, including context-based 3D object recognition and iterative scene generation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper we propose a neural message passing approach to augment an input 3D indoor scene with new objects matching their surroundings. Given an input, potentially incomplete, 3D scene and a query location, our method predicts a probability distribution over object types that fit well in that location. Our distribution is predicted though passing learned messages in a dense graph whose nodes represent objects in the input scene and edges represent spatial and structural relationships. By weighting messages through an attention mechanism, our method learns to focus on the most relevant surrounding scene context to predict new scene objects. We found that our method significantly outperforms state-of-the-art approaches in terms of correctly predicting objects missing in a scene based on our experiments in the SUNCG dataset. We also demonstrate other applications of our method, including context-based 3D object recognition and iterative scene generation.",
"fno": "480300h383",
"keywords": [
"Graph Theory",
"Image Representation",
"Learning Artificial Intelligence",
"Message Passing",
"Statistical Distributions",
"SUNCG Dataset",
"Neural Message Passing Approach",
"Scene Graph Net",
"Input 3 D Indoor Scene Augmentation",
"Message Learnning",
"Iterative Scene Generation",
"Context Based 3 D Object Recognition",
"Probability Distribution",
"Query Location",
"Three Dimensional Displays",
"Message Passing",
"Neural Networks",
"Shape",
"Solid Modeling",
"Probability Distribution",
"Task Analysis"
],
"authors": [
{
"affiliation": "UMass Amherst",
"fullName": "Yang Zhou",
"givenName": "Yang",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "UMass Amherst",
"fullName": "Zachary While",
"givenName": "Zachary",
"surname": "While",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "UMass",
"fullName": "Evangelos Kalogerakis",
"givenName": "Evangelos",
"surname": "Kalogerakis",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-10-01T00:00:00",
"pubType": "proceedings",
"pages": "7383-7391",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-4803-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "480300h373",
"articleId": "1hQqg6qModq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "480300h392",
"articleId": "1hQqswrH62k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2017/0457/0/0457d097",
"title": "Scene Graph Generation by Iterative Message Passing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457d097/12OmNBAqZH0",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2015/05/06926846",
"title": "A New Look at Reweighted Message Passing",
"doi": null,
"abstractUrl": "/journal/tp/2015/05/06926846/13rRUyp7tY0",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fpl/2018/8517/0/851700a335",
"title": "A FPGA Accelerator for Real-Time 3D Non-rigid Registration Using Tree Reweighted Message Passing and Dynamic Markov Random Field Generation",
"doi": null,
"abstractUrl": "/proceedings-article/fpl/2018/851700a335/17D45XvMcbi",
"parentPublication": {
"id": "proceedings/fpl/2018/8517/0",
"title": "2018 28th International Conference on Field Programmable Logic and Applications (FPL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200p5183",
"title": "Indoor Scene Generation from a Collection of Semantic-Segmented Depth Images",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200p5183/1BmFbxElKX6",
"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/281200p5964",
"title": "Exploiting Scene Graphs for Human-Object Interaction Detection",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200p5964/1BmGDVSgm4M",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g188",
"title": "StyleMesh: Style Transfer for Indoor 3D Scene Reconstructions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g188/1H0Njf7XQtO",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600t9454",
"title": "HL-Net: Heterophily Learning Network for Scene Graph Generation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600t9454/1H1lCef5GSY",
"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/934600e380",
"title": "Grounding Scene Graphs on Natural Images via Visio-Lingual Message Passing",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600e380/1KxUEJZWihW",
"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/716800d960",
"title": "Learning 3D Semantic Scene Graphs From 3D Indoor Reconstructions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800d960/1m3nHniwEg0",
"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/716800l1492",
"title": "LiDAR-Based Online 3D Video Object Detection With Graph-Based Message Passing and Spatiotemporal Transformer Attention",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800l1492/1m3ofEWfoE8",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzn395d",
"title": "2017 IEEE 67th Electronic Components and Technology Conference (ECTC)",
"acronym": "ectc",
"groupId": "1000248",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxRF75d",
"doi": "10.1109/ECTC.2017.44",
"title": "A New Method for 3D Microstructure Fabrication via Ionic Wind",
"normalizedTitle": "A New Method for 3D Microstructure Fabrication via Ionic Wind",
"abstract": "In this paper, a novel method of fabricating 3D microstructures of polymer film is proposed based on ionic wind. For the first time, it is observed experimentally that liquid polymer on conductive substrates with non-conductive patterns spontaneously converges from non-conductive areas to conductive areas under the action of ion wind. Taking advantage of such a flow phenomenon, polymer 3D micropatterns including bump arrays, well arrays, words and numbers are realized and the scale of these microstructures is from millimeter to micrometer.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, a novel method of fabricating 3D microstructures of polymer film is proposed based on ionic wind. For the first time, it is observed experimentally that liquid polymer on conductive substrates with non-conductive patterns spontaneously converges from non-conductive areas to conductive areas under the action of ion wind. Taking advantage of such a flow phenomenon, polymer 3D micropatterns including bump arrays, well arrays, words and numbers are realized and the scale of these microstructures is from millimeter to micrometer.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, a novel method of fabricating 3D microstructures of polymer film is proposed based on ionic wind. For the first time, it is observed experimentally that liquid polymer on conductive substrates with non-conductive patterns spontaneously converges from non-conductive areas to conductive areas under the action of ion wind. Taking advantage of such a flow phenomenon, polymer 3D micropatterns including bump arrays, well arrays, words and numbers are realized and the scale of these microstructures is from millimeter to micrometer.",
"fno": "07999929",
"keywords": [
"Microfabrication",
"Polymer Films",
"3 D Microstructure Fabrication",
"Ionic Wind",
"Polymer Film",
"Liquid Polymer",
"Conductive Substrates",
"Nonconductive Patterns",
"Flow Phenomenon",
"Polymer 3 D Micropatterns",
"Bump Arrays",
"Well Arrays",
"Electronic Components",
"Conferences",
"Three Dimensional Displays",
"Microstructure",
"Polymer",
"Ionic Wind",
"Bump Array",
"Well Array",
"3 D Microstructure"
],
"authors": [
{
"affiliation": null,
"fullName": "Shangru Zhou",
"givenName": "Shangru",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Guoliang Li",
"givenName": "Guoliang",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Huai Zheng",
"givenName": "Huai",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sheng Liu",
"givenName": "Sheng",
"surname": "Liu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ectc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-05-01T00:00:00",
"pubType": "proceedings",
"pages": "1823-1828",
"year": "2017",
"issn": "2377-5726",
"isbn": "978-1-5090-6315-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07999928",
"articleId": "12OmNxFsmCC",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07999930",
"articleId": "12OmNAJVcEP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icmtma/2009/3583/2/3583b093",
"title": "Microstructure Evolution of Stainless Steel during Laser Metal Deposition Shaping",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2009/3583b093/12OmNBO3KdD",
"parentPublication": {
"id": "proceedings/icmtma/2009/3583/2",
"title": "2009 International Conference on Measuring Technology and Mechatronics Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vts/2016/8454/0/07477270",
"title": "Active polymers for bio medical microdevices and microfluidic systems",
"doi": null,
"abstractUrl": "/proceedings-article/vts/2016/07477270/12OmNrGKesS",
"parentPublication": {
"id": "proceedings/vts/2016/8454/0",
"title": "2016 IEEE 34th VLSI Test Symposium (VTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paw/2016/5214/0/07836381",
"title": "Multi-scale CAFE Framework for Simulating Fracture in Heterogeneous Materials Implemented in Fortran Co-arrays and MPI",
"doi": null,
"abstractUrl": "/proceedings-article/paw/2016/07836381/12OmNwx3Qa1",
"parentPublication": {
"id": "proceedings/paw/2016/5214/0",
"title": "2016 PGAS Applications Workshop (PAW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2013/2792/0/06843548",
"title": "Three-Dimensional Gesture Tracking Algorithm Based on Microstructure of Hand Motion",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2013/06843548/12OmNxFsmBt",
"parentPublication": {
"id": "proceedings/isdea/2013/2792/0",
"title": "2013 Fourth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ecodesign/2005/0081/0/01619374",
"title": "Relationship between Microstructure and Ionic Conductivity in Ytterbium Doped Ceria",
"doi": null,
"abstractUrl": "/proceedings-article/ecodesign/2005/01619374/12OmNz61dAk",
"parentPublication": {
"id": "proceedings/ecodesign/2005/0081/0",
"title": "Environmentally Conscious Design and Inverse Manufacturing, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a215",
"title": "Wind comfort and emotion can be changed by the cross-modal presentation of audio-visual stimuli of indoor and outdoor environments",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a215/1MNgpToB1Cg",
"parentPublication": {
"id": "proceedings/vr/2023/4815/0",
"title": "2023 IEEE Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10105512",
"title": "Topology Optimization Via Spatially-Varying TPMS",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10105512/1MtgsfKZTgI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicas/2019/6106/0/610600a865",
"title": "Lightning Discharge Characteristics of Carbon Fiber Reinforced Polymer (CFRP) Wind Turbine Blade",
"doi": null,
"abstractUrl": "/proceedings-article/icicas/2019/610600a865/1iHV0dp3UfC",
"parentPublication": {
"id": "proceedings/icicas/2019/6106/0",
"title": "2019 International Conference on Intelligent Computing, Automation and Systems (ICICAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a045",
"title": "Perception of Multisensory Wind Representation in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a045/1pysxBReola",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdidm/2021/2699/0/269900a150",
"title": "Wind Turbine Performance Analysis of An Offshore Wind Farm in China",
"doi": null,
"abstractUrl": "/proceedings-article/bdidm/2021/269900a150/1xFvjtVOErS",
"parentPublication": {
"id": "proceedings/bdidm/2021/2699/0",
"title": "2021 International Conference on Big Data and Intelligent Decision Making (BDIDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1FY1bDsyg6Y",
"title": "2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)",
"acronym": "cacml",
"groupId": "1847344",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1FY1sSQSOwE",
"doi": "10.1109/CACML55074.2022.00117",
"title": "Research on lightweight of rear longitudinal tool arm based on OptiStruct topology optimization algorithm",
"normalizedTitle": "Research on lightweight of rear longitudinal tool arm based on OptiStruct topology optimization algorithm",
"abstract": "The traditional automobile rear longitudinal knife arm has problems such as heavy weight, insufficient strength and hardness, and unreasonable structure. In this study, based on the Inspire OptiStruct topology optimization algorithm, in the form of cloud images, the lightweight effect is achieved from the perspective of the structure, and the most reasonable mass distribution and the best force transmission path for the structure are found. At the same time, combined with the production method of metal 3D printing additive manufacturing, the finite element method is used to better reflect the rationality of the design and the feasibility of the research. This research uses UG to establish a simplified CAD model of the rear longitudinal knife arm, completes the topology optimization design through the Inspire OptiStruct module topology optimization algorithm, uses the finite element method to check the strength of the final model, and simulates the process of metal 3D printing based on the Print3D module. The results show that the mass of the rear longitudinal knife arm is reduced by 35.88%, the Mises equivalent stress, displacement and safety factor all meet the design requirements and meet the actual needs, and the topology optimization structure design is reasonable.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The traditional automobile rear longitudinal knife arm has problems such as heavy weight, insufficient strength and hardness, and unreasonable structure. In this study, based on the Inspire OptiStruct topology optimization algorithm, in the form of cloud images, the lightweight effect is achieved from the perspective of the structure, and the most reasonable mass distribution and the best force transmission path for the structure are found. At the same time, combined with the production method of metal 3D printing additive manufacturing, the finite element method is used to better reflect the rationality of the design and the feasibility of the research. This research uses UG to establish a simplified CAD model of the rear longitudinal knife arm, completes the topology optimization design through the Inspire OptiStruct module topology optimization algorithm, uses the finite element method to check the strength of the final model, and simulates the process of metal 3D printing based on the Print3D module. The results show that the mass of the rear longitudinal knife arm is reduced by 35.88%, the Mises equivalent stress, displacement and safety factor all meet the design requirements and meet the actual needs, and the topology optimization structure design is reasonable.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The traditional automobile rear longitudinal knife arm has problems such as heavy weight, insufficient strength and hardness, and unreasonable structure. In this study, based on the Inspire OptiStruct topology optimization algorithm, in the form of cloud images, the lightweight effect is achieved from the perspective of the structure, and the most reasonable mass distribution and the best force transmission path for the structure are found. At the same time, combined with the production method of metal 3D printing additive manufacturing, the finite element method is used to better reflect the rationality of the design and the feasibility of the research. This research uses UG to establish a simplified CAD model of the rear longitudinal knife arm, completes the topology optimization design through the Inspire OptiStruct module topology optimization algorithm, uses the finite element method to check the strength of the final model, and simulates the process of metal 3D printing based on the Print3D module. The results show that the mass of the rear longitudinal knife arm is reduced by 35.88%, the Mises equivalent stress, displacement and safety factor all meet the design requirements and meet the actual needs, and the topology optimization structure design is reasonable.",
"fno": "829000a671",
"keywords": [
"Automobiles",
"CAD",
"Design Engineering",
"Finite Element Analysis",
"Optimisation",
"Structural Engineering",
"Three Dimensional Printing",
"Topology",
"Production Method",
"Metal 3 D Printing Additive Manufacturing",
"Finite Element Method",
"Topology Optimization Design",
"Inspire Opti Struct Module Topology Optimization Algorithm",
"Print 3 D Module",
"Topology Optimization Structure Design",
"Rear Longitudinal Tool Arm",
"Traditional Automobile Rear Longitudinal Knife Arm",
"Insufficient Strength",
"Unreasonable Structure",
"Inspire Opti Struct Topology Optimization Algorithm",
"Lightweight Effect",
"Reasonable Mass Distribution",
"Force Transmission Path",
"Solid Modeling",
"Machine Learning Algorithms",
"Three Dimensional Displays",
"Metals",
"Three Dimensional Printing",
"Topology",
"Finite Element Analysis",
"Opti Struct Topology Optimization Algorithm",
"Trailing Arm",
"Lightweight",
"Metal 3 D Printing",
"Finite Element Method"
],
"authors": [
{
"affiliation": "College of Mechanical and Transportation, Southwest Forestry University,Kunming,China",
"fullName": "Peng Gao",
"givenName": "Peng",
"surname": "Gao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Mechanical and Transportation, Southwest Forestry University,Kunming,China",
"fullName": "Hao Li",
"givenName": "Hao",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Mechanical and Transportation, Southwest Forestry University,Kunming,China",
"fullName": "Wengang Chen",
"givenName": "Wengang",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Mechanical and Transportation, Southwest Forestry University,Kunming,China",
"fullName": "Guodong Xu",
"givenName": "Guodong",
"surname": "Xu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Mechanical and Transportation, Southwest Forestry University,Kunming,China",
"fullName": "Zhipeng Jin",
"givenName": "Zhipeng",
"surname": "Jin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Mechanical and Transportation, Southwest Forestry University,Kunming,China",
"fullName": "Shaobing Tian",
"givenName": "Shaobing",
"surname": "Tian",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "College of Mechanical and Transportation, Southwest Forestry University,Kunming,China",
"fullName": "Chengyu Yao",
"givenName": "Chengyu",
"surname": "Yao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cacml",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-03-01T00:00:00",
"pubType": "proceedings",
"pages": "671-680",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8290-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "829000a665",
"articleId": "1FY1dl332YU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "829000a681",
"articleId": "1FY1pvIukNy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2015/1727/0/07223326",
"title": "Touch sensing on non-parametric rear-projection surfaces: A physical-virtual head for hands-on healthcare training",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2015/07223326/12OmNvT2oVf",
"parentPublication": {
"id": "proceedings/vr/2015/1727/0",
"title": "2015 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icess/2016/3727/0/3727a125",
"title": "A New Slicing Method for AMF Model with Topology Structure",
"doi": null,
"abstractUrl": "/proceedings-article/icess/2016/3727a125/12OmNxbmSAq",
"parentPublication": {
"id": "proceedings/icess/2016/3727/0",
"title": "2016 13th International Conference on Embedded Software and Systems (ICESS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2012/4772/0/4772a144",
"title": "A Study on Rear Seat Occupant Injuries in Side Impact",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2012/4772a144/12OmNxecS0k",
"parentPublication": {
"id": "proceedings/icdma/2012/4772/0",
"title": "2012 Third International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2012/4772/0/4772a707",
"title": "Research on the Effect of Rear Seat Structure on Child Occupant Safety",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2012/4772a707/12OmNy7yEiK",
"parentPublication": {
"id": "proceedings/icdma/2012/4772/0",
"title": "2012 Third International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2016/2312/0/2312a240",
"title": "Dynamic Response and Injury of Neck Tissues in Low-Speed Rear-Ending",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2016/2312a240/12OmNyuy9We",
"parentPublication": {
"id": "proceedings/icmtma/2016/2312/0",
"title": "2016 Eighth International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccmso/2022/3288/0/328800a084",
"title": "Practicing Topology Optimization Workflow for Structural Simulation and Customized Splint Fabrication",
"doi": null,
"abstractUrl": "/proceedings-article/iccmso/2022/328800a084/1Mq13usweHu",
"parentPublication": {
"id": "proceedings/iccmso/2022/3288/0",
"title": "2022 International Conference on Computational Modelling, Simulation and Optimization (ICCMSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10105512",
"title": "Topology Optimization Via Spatially-Varying TPMS",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10105512/1MtgsfKZTgI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiotcs/2022/3410/0/341000a216",
"title": "Design and Implementation of Gamma Knife Head Bracket Based on 3D Printing Technology",
"doi": null,
"abstractUrl": "/proceedings-article/aiotcs/2022/341000a216/1MuZM84ExJm",
"parentPublication": {
"id": "proceedings/aiotcs/2022/3410/0",
"title": "2022 International Conference on Artificial Intelligence of Things and Crowdsensing (AIoTCs)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvrv/2017/2636/0/263600a091",
"title": "Topology and Shape Preserved Lightweight of Shell Models Utilizing Heat Diffusion",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a091/1ap5yizM9La",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wcmeim/2020/4109/0/410900a650",
"title": "Effects of Rear Window Angle on Car Aerodynamic Characteristics",
"doi": null,
"abstractUrl": "/proceedings-article/wcmeim/2020/410900a650/1t2mFf081fW",
"parentPublication": {
"id": "proceedings/wcmeim/2020/4109/0",
"title": "2020 3rd World Conference on Mechanical Engineering and Intelligent Manufacturing (WCMEIM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1Mq0USOm6hq",
"title": "2022 International Conference on Computational Modelling, Simulation and Optimization (ICCMSO)",
"acronym": "iccmso",
"groupId": "10097038",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1Mq13usweHu",
"doi": "10.1109/ICCMSO58359.2022.00029",
"title": "Practicing Topology Optimization Workflow for Structural Simulation and Customized Splint Fabrication",
"normalizedTitle": "Practicing Topology Optimization Workflow for Structural Simulation and Customized Splint Fabrication",
"abstract": "Topology optimization tolls are becoming effectively more useful across a variety of designing and manufacturing sectors, due to their capability to produce performance oriented lightweight configurations. Especially when the target is to deal with the complex user specific diaphanous products, the integrity of additive manufacturing with such design optimization techniques introduces the practicality in the application. This paper focuses on how the structural simulation in the early design phases can make a splint more comfortable for the user, without compromising its strengthening properties. A custom finger-splint has been designed using 3D scans, processed under structural simulation followed by topology optimization and validation and then fabricated from additive manufacturing using PLA (Polylactic acid). The optimization results show a considerable weight reduction (3.524 gm for 60% retained mass) of 30.52 % from the un-optimized one (5.072 gm for 100% retained mass). Also, removing access material can assure the ventilation ease to the limb and provide the user with sweat-free comfort.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Topology optimization tolls are becoming effectively more useful across a variety of designing and manufacturing sectors, due to their capability to produce performance oriented lightweight configurations. Especially when the target is to deal with the complex user specific diaphanous products, the integrity of additive manufacturing with such design optimization techniques introduces the practicality in the application. This paper focuses on how the structural simulation in the early design phases can make a splint more comfortable for the user, without compromising its strengthening properties. A custom finger-splint has been designed using 3D scans, processed under structural simulation followed by topology optimization and validation and then fabricated from additive manufacturing using PLA (Polylactic acid). The optimization results show a considerable weight reduction (3.524 gm for 60% retained mass) of 30.52 % from the un-optimized one (5.072 gm for 100% retained mass). Also, removing access material can assure the ventilation ease to the limb and provide the user with sweat-free comfort.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Topology optimization tolls are becoming effectively more useful across a variety of designing and manufacturing sectors, due to their capability to produce performance oriented lightweight configurations. Especially when the target is to deal with the complex user specific diaphanous products, the integrity of additive manufacturing with such design optimization techniques introduces the practicality in the application. This paper focuses on how the structural simulation in the early design phases can make a splint more comfortable for the user, without compromising its strengthening properties. A custom finger-splint has been designed using 3D scans, processed under structural simulation followed by topology optimization and validation and then fabricated from additive manufacturing using PLA (Polylactic acid). The optimization results show a considerable weight reduction (3.524 gm for 60% retained mass) of 30.52 % from the un-optimized one (5.072 gm for 100% retained mass). Also, removing access material can assure the ventilation ease to the limb and provide the user with sweat-free comfort.",
"fno": "328800a084",
"keywords": [
"Design Engineering",
"Optimisation",
"Rapid Prototyping Industrial",
"Three Dimensional Printing",
"100 Retained Mass",
"60 Retained Mass",
"Additive Manufacturing",
"Complex User Specific Diaphanous Products",
"Custom Finger Splint",
"Customized Splint Fabrication",
"Design Optimization Techniques",
"Designing Manufacturing Sectors",
"Early Design Phases",
"Mass 3 524 G",
"Mass 5 072 G",
"Performance Oriented Lightweight Configurations",
"Structural Simulation",
"Topology Optimization Tolls",
"Topology Optimization Workflow",
"Solid Modeling",
"Three Dimensional Displays",
"Computational Modeling",
"Programmable Logic Arrays",
"Three Dimensional Printing",
"Ventilation",
"Topology",
"Topology Optimization",
"Additive Manufacturing",
"Splint Fabrication",
"PLA",
"ANSYS"
],
"authors": [
{
"affiliation": "Maharshi Dayanand University,UIET,Department of Mechanical Engineering,Rohtak,India,124001",
"fullName": "Ashwani Kumar",
"givenName": "Ashwani",
"surname": "Kumar",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Maharshi Dayanand University,UIET,Department of Mechanical Engineering,Rohtak,India,124001",
"fullName": "Deepak Chhabra",
"givenName": "Deepak",
"surname": "Chhabra",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccmso",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-12-01T00:00:00",
"pubType": "proceedings",
"pages": "84-88",
"year": "2022",
"issn": null,
"isbn": "979-8-3503-3288-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "328800a079",
"articleId": "1Mq10zBtZqU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "328800a089",
"articleId": "1Mq0X07fKLK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "mags/co/2012/12/mco2012120076",
"title": "Digital Fabrication",
"doi": null,
"abstractUrl": "/magazine/co/2012/12/mco2012120076/13rRUxC0Sre",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2017/03/mcg2017030032",
"title": "Computational Design and Fabrication",
"doi": null,
"abstractUrl": "/magazine/cg/2017/03/mcg2017030032/13rRUyoPSRC",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciev-&-icivpr/2018/5163/0/08641073",
"title": "Mechanical Property Prediction Method Based on Multi-material 3D Printer",
"doi": null,
"abstractUrl": "/proceedings-article/iciev-&-icivpr/2018/08641073/17PYEiVyc2y",
"parentPublication": {
"id": "proceedings/iciev-&-icivpr/2018/5163/0",
"title": "2018 Joint 7th International Conference on Informatics, Electronics & Vision (ICIEV) and 2018 2nd International Conference on Imaging, Vision & Pattern Recognition (icIVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cacml/2022/8290/0/829000a671",
"title": "Research on lightweight of rear longitudinal tool arm based on OptiStruct topology optimization algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/cacml/2022/829000a671/1FY1sSQSOwE",
"parentPublication": {
"id": "proceedings/cacml/2022/8290/0",
"title": "2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccmso/2022/3288/0/328800a089",
"title": "Enhancing dimensional accuracy of small parts through modelling and parametric optimization of the FDM 3D printing process using GA-ANN",
"doi": null,
"abstractUrl": "/proceedings-article/iccmso/2022/328800a089/1Mq0X07fKLK",
"parentPublication": {
"id": "proceedings/iccmso/2022/3288/0",
"title": "2022 International Conference on Computational Modelling, Simulation and Optimization (ICCMSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccmso/2022/3288/0/328800a320",
"title": "Topological Simulation to Recognize the Steady State Thermal Behavior of Customized Finger Splint",
"doi": null,
"abstractUrl": "/proceedings-article/iccmso/2022/328800a320/1Mq14ldVeN2",
"parentPublication": {
"id": "proceedings/iccmso/2022/3288/0",
"title": "2022 International Conference on Computational Modelling, Simulation and Optimization (ICCMSO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10105512",
"title": "Topology Optimization Via Spatially-Varying TPMS",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10105512/1MtgsfKZTgI",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2020/7624/0/762400b491",
"title": "Generative Truss Optimization for Support-Free Fused Filament Fabrication",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2020/762400b491/1uGZ7m91hIc",
"parentPublication": {
"id": "proceedings/csci/2020/7624/0",
"title": "2020 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciddt/2020/0367/0/036700a544",
"title": "Modeling design of BH1500UU based on additive manufacturing and digital technology",
"doi": null,
"abstractUrl": "/proceedings-article/iciddt/2020/036700a544/1wutLO9xWU0",
"parentPublication": {
"id": "proceedings/iciddt/2020/0367/0",
"title": "2020 International Conference on Innovation Design and Digital Technology (ICIDDT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdsba/2020/8164/0/816400a268",
"title": "New Method of Polar Coordinates Optimization of CAD Model Slice Profile for Additive Manufacturing",
"doi": null,
"abstractUrl": "/proceedings-article/icdsba/2020/816400a268/1xeWpLPXpZu",
"parentPublication": {
"id": "proceedings/icdsba/2020/8164/0",
"title": "2020 4th Annual International Conference on Data Science and Business Analytics (ICDSBA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAR1b0Y",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"acronym": "ictai",
"groupId": "1000763",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC2xhA2",
"doi": "10.1109/ICTAI.2016.0134",
"title": "Biterm Pseudo Document Topic Model for Short Text",
"normalizedTitle": "Biterm Pseudo Document Topic Model for Short Text",
"abstract": "In the past few years, we have witnessed a rapid development of online social media, from which we can access various short texts. Understanding the topic patterns of these short text is significant. Traditional topic models, like LDA, are not suitable when applied to short text topic analysis due to data sparsity. A lot of efforts have been made to solve this problem. However, there is still significant space to improve the effectiveness of these short text specific methods. In this paper, we proposed a novel word co-occurrence network based method, referred to as biterm pseudo document topic model (BPDTM), which extended the previous biterm topic model(BTM) for short text. We utilized the word co-occurrence network to construct biterm pseudo documents. The proposed model is promising since it represents words with their semantic adjacent biterms and is able to model the corpus-level semantic relation between two words. Besides, BPDTM naturally lengthens the documents, which alleviate the influence for performance exerted by data sparsity. Experiments demonstrated that our model outperformed two baselines, i.e. LDA and BTM, which proved its effectiveness on short text topic modeling task.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the past few years, we have witnessed a rapid development of online social media, from which we can access various short texts. Understanding the topic patterns of these short text is significant. Traditional topic models, like LDA, are not suitable when applied to short text topic analysis due to data sparsity. A lot of efforts have been made to solve this problem. However, there is still significant space to improve the effectiveness of these short text specific methods. In this paper, we proposed a novel word co-occurrence network based method, referred to as biterm pseudo document topic model (BPDTM), which extended the previous biterm topic model(BTM) for short text. We utilized the word co-occurrence network to construct biterm pseudo documents. The proposed model is promising since it represents words with their semantic adjacent biterms and is able to model the corpus-level semantic relation between two words. Besides, BPDTM naturally lengthens the documents, which alleviate the influence for performance exerted by data sparsity. Experiments demonstrated that our model outperformed two baselines, i.e. LDA and BTM, which proved its effectiveness on short text topic modeling task.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the past few years, we have witnessed a rapid development of online social media, from which we can access various short texts. Understanding the topic patterns of these short text is significant. Traditional topic models, like LDA, are not suitable when applied to short text topic analysis due to data sparsity. A lot of efforts have been made to solve this problem. However, there is still significant space to improve the effectiveness of these short text specific methods. In this paper, we proposed a novel word co-occurrence network based method, referred to as biterm pseudo document topic model (BPDTM), which extended the previous biterm topic model(BTM) for short text. We utilized the word co-occurrence network to construct biterm pseudo documents. The proposed model is promising since it represents words with their semantic adjacent biterms and is able to model the corpus-level semantic relation between two words. Besides, BPDTM naturally lengthens the documents, which alleviate the influence for performance exerted by data sparsity. Experiments demonstrated that our model outperformed two baselines, i.e. LDA and BTM, which proved its effectiveness on short text topic modeling task.",
"fno": "4459a865",
"keywords": [
"Semantics",
"Vocabulary",
"Matrix Decomposition",
"Standards",
"Social Network Services",
"Data Models",
"Image Edge Detection"
],
"authors": [
{
"affiliation": null,
"fullName": "Lan Jiang",
"givenName": "Lan",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hengyang Lu",
"givenName": "Hengyang",
"surname": "Lu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ming Xu",
"givenName": "Ming",
"surname": "Xu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Chongjun Wang",
"givenName": "Chongjun",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ictai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-11-01T00:00:00",
"pubType": "proceedings",
"pages": "865-872",
"year": "2016",
"issn": "2375-0197",
"isbn": "978-1-5090-4459-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4459a857",
"articleId": "12OmNyq0zKV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4459a873",
"articleId": "12OmNweBUEV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0/07363164",
"title": "An Intention-Topic Model Based on Verbs Clustering and Short Texts Topic Mining",
"doi": null,
"abstractUrl": "/proceedings-article/cit-iucc-dasc-picom/2015/07363164/12OmNzWOB9n",
"parentPublication": {
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0",
"title": "2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a848",
"title": "Research on Improve Topic Representation over Short Text",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a848/12OmNzmclNR",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2014/12/06778764",
"title": "BTM: Topic Modeling over Short Texts",
"doi": null,
"abstractUrl": "/journal/tk/2014/12/06778764/13rRUy2YLYY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2018/7449/0/744900a975",
"title": "Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2018/744900a975/17D45VUZMUh",
"parentPublication": {
"id": "proceedings/ictai/2018/7449/0",
"title": "2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2022/7480/0/748000a160",
"title": "Topic Modeling for Short Texts Via Dual View Collaborate optimization",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2022/748000a160/1H44nThBZGo",
"parentPublication": {
"id": "proceedings/dsc/2022/7480/0",
"title": "2022 7th IEEE International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800c751",
"title": "Seeded-BTM: Enabling Biterm Topic Model with Seeds for Product Aspect Mining",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800c751/1dPokbm6C6A",
"parentPublication": {
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0",
"title": "2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/03/09086136",
"title": "Short Text Topic Modeling Techniques, Applications, and Performance: A Survey",
"doi": null,
"abstractUrl": "/journal/tk/2022/03/09086136/1jyxq5xfIKQ",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2020/9558/0/09172425",
"title": "GPU-BTM: A Topic Model for Short Text using Auxiliary Information",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2020/09172425/1mtwiEyeDpC",
"parentPublication": {
"id": "proceedings/dsc/2020/9558/0",
"title": "2020 IEEE Fifth International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2023/01/09404875",
"title": "Topic Modeling of Short Texts: A Pseudo-Document View With Word Embedding Enhancement",
"doi": null,
"abstractUrl": "/journal/tk/2023/01/09404875/1sNm3Kthmi4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0/148500b050",
"title": "SP-BTM: A Specific Part-of-speech BTM for Service Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2020/148500b050/1ua4tUEwSe4",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2020/1485/0",
"title": "2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNs0kyrw",
"title": "2014 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"acronym": "icsme",
"groupId": "1000694",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCulYlg",
"doi": "10.1109/ICSME.2014.103",
"title": "LDA Analyzer: A Tool for Exploring Topic Models",
"normalizedTitle": "LDA Analyzer: A Tool for Exploring Topic Models",
"abstract": "Online technical forums are valuable sources for mining useful software engineering information. LDA (Latent Dirichlet Allocation) is an unsupervised machine learning method which can be used for extracting underlying topics out of such large forums. However, the main output of LDA forum learning are usually huge matrices that contain millions of numbers, which is impossible for researchers to directly scrutinize the numerical distribution and semantically evaluate the relationship between the extracted topics and large collection of unorganized documents. In this paper, we present LDAAnalyzer, an LDA visualization tool that makes the hidden topic-document structures rise to the surface. From the functionality point of view, LDA Analyzer consists of (1) LDA modeling (2) LDA output analysis and (3) new corpus training. With the help of LDAAnalyzer, our semantic topic-modeling evaluation based on large technical forums becomes feasible.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Online technical forums are valuable sources for mining useful software engineering information. LDA (Latent Dirichlet Allocation) is an unsupervised machine learning method which can be used for extracting underlying topics out of such large forums. However, the main output of LDA forum learning are usually huge matrices that contain millions of numbers, which is impossible for researchers to directly scrutinize the numerical distribution and semantically evaluate the relationship between the extracted topics and large collection of unorganized documents. In this paper, we present LDAAnalyzer, an LDA visualization tool that makes the hidden topic-document structures rise to the surface. From the functionality point of view, LDA Analyzer consists of (1) LDA modeling (2) LDA output analysis and (3) new corpus training. With the help of LDAAnalyzer, our semantic topic-modeling evaluation based on large technical forums becomes feasible.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Online technical forums are valuable sources for mining useful software engineering information. LDA (Latent Dirichlet Allocation) is an unsupervised machine learning method which can be used for extracting underlying topics out of such large forums. However, the main output of LDA forum learning are usually huge matrices that contain millions of numbers, which is impossible for researchers to directly scrutinize the numerical distribution and semantically evaluate the relationship between the extracted topics and large collection of unorganized documents. In this paper, we present LDAAnalyzer, an LDA visualization tool that makes the hidden topic-document structures rise to the surface. From the functionality point of view, LDA Analyzer consists of (1) LDA modeling (2) LDA output analysis and (3) new corpus training. With the help of LDAAnalyzer, our semantic topic-modeling evaluation based on large technical forums becomes feasible.",
"fno": "6146a593",
"keywords": [
"Data Visualization",
"Semantics",
"Visualization",
"Training",
"Load Modeling",
"Mathematical Model",
"Standards",
"Forum",
"LDA",
"Topic Modeling",
"Visualization"
],
"authors": [
{
"affiliation": null,
"fullName": "Chunyao Zou",
"givenName": "Chunyao",
"surname": "Zou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Daqing Hou",
"givenName": "Daqing",
"surname": "Hou",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icsme",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-09-01T00:00:00",
"pubType": "proceedings",
"pages": "593-596",
"year": "2014",
"issn": "1063-6773",
"isbn": "978-1-4799-6146-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "6146a589",
"articleId": "12OmNCy2L3d",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "6146a597",
"articleId": "12OmNCcKQgW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/snpd/2016/2239/0/07515878",
"title": "Hierarchical Latent Semantic Mapping for automated topic generation",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2016/07515878/12OmNCesr8i",
"parentPublication": {
"id": "proceedings/snpd/2016/2239/0",
"title": "2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2014/7981/0/7981b939",
"title": "Emerging Topic Detection Model Based on LDA and Its Application in Stem Cell Field",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2014/7981b939/12OmNrNh0y8",
"parentPublication": {
"id": "proceedings/cse/2014/7981/0",
"title": "2014 IEEE 17th International Conference on Computational Science and Engineering (CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2015/9795/0/9795a083",
"title": "BL-LDA: Bringing Bigram to Supervised Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2015/9795a083/12OmNvjyxGR",
"parentPublication": {
"id": "proceedings/csci/2015/9795/0",
"title": "2015 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2017/6543/0/6543a411",
"title": "Source-LDA: Enhancing Probabilistic Topic Models Using Prior Knowledge Sources",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2017/6543a411/12OmNx4gUui",
"parentPublication": {
"id": "proceedings/icde/2017/6543/0",
"title": "2017 IEEE 33rd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a881",
"title": "Expert Identification Based on Dynamic LDA Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a881/12OmNxA3Z04",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsecw/2017/2649/0/2649a071",
"title": "Topic Detection from Microblogs Using T-LDA and Perplexity",
"doi": null,
"abstractUrl": "/proceedings-article/apsecw/2017/2649a071/12OmNyRPgWB",
"parentPublication": {
"id": "proceedings/apsecw/2017/2649/0",
"title": "2017 24th Asia-Pacific Software Engineering Conference Workshops (APSECW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2016/2179/0/2179a025",
"title": "TopicPie: An Interactive Visualization for LDA-Based Topic Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2016/2179a025/12OmNzdGntp",
"parentPublication": {
"id": "proceedings/bigmm/2016/2179/0",
"title": "2016 IEEE Second International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2017/3120/0/3120a254",
"title": "Incorporating Entity Correlation Knowledge into Topic Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2017/3120a254/12OmNzdoMCc",
"parentPublication": {
"id": "proceedings/icbk/2017/3120/0",
"title": "2017 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020259",
"title": "A Data-driven Latent Semantic Analysis for Automatic Text Summarization using LDA Topic Modelling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020259/1KfRTUeiflu",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10102323",
"title": "TopicRefiner: Coherence-Guided Steerable LDA for Visual Topic Enhancement",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10102323/1Mjj0nUbTKU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCcKQA7",
"title": "2015 International Conference on Computational Science and Computational Intelligence (CSCI)",
"acronym": "csci",
"groupId": "1803739",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvjyxGR",
"doi": "10.1109/CSCI.2015.146",
"title": "BL-LDA: Bringing Bigram to Supervised Topic Model",
"normalizedTitle": "BL-LDA: Bringing Bigram to Supervised Topic Model",
"abstract": "With the increasing amount of data being published on the Web, it is difficult to analyze their content within a short time. Topic modeling techniques can summarize textual data that contains several topics. Both the label (such as category or tag) and word co-occurrence play a significant role in understanding textual data. However, many conventional topic modeling techniques are limited to the bag-of-words assumption. In this paper, we develop a probabilistic model called Bigram Labeled Latent Dirichlet Allocation (BL-LDA), to address the limitation of the bag-of-words assumption. The proposed BL-LDA incorporates the bigram into the Labeled LDA (L-LDA) technique. Extensive experiments on Yelp data show that the proposed scheme is better than the L-LDA in terms of accuracy.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the increasing amount of data being published on the Web, it is difficult to analyze their content within a short time. Topic modeling techniques can summarize textual data that contains several topics. Both the label (such as category or tag) and word co-occurrence play a significant role in understanding textual data. However, many conventional topic modeling techniques are limited to the bag-of-words assumption. In this paper, we develop a probabilistic model called Bigram Labeled Latent Dirichlet Allocation (BL-LDA), to address the limitation of the bag-of-words assumption. The proposed BL-LDA incorporates the bigram into the Labeled LDA (L-LDA) technique. Extensive experiments on Yelp data show that the proposed scheme is better than the L-LDA in terms of accuracy.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the increasing amount of data being published on the Web, it is difficult to analyze their content within a short time. Topic modeling techniques can summarize textual data that contains several topics. Both the label (such as category or tag) and word co-occurrence play a significant role in understanding textual data. However, many conventional topic modeling techniques are limited to the bag-of-words assumption. In this paper, we develop a probabilistic model called Bigram Labeled Latent Dirichlet Allocation (BL-LDA), to address the limitation of the bag-of-words assumption. The proposed BL-LDA incorporates the bigram into the Labeled LDA (L-LDA) technique. Extensive experiments on Yelp data show that the proposed scheme is better than the L-LDA in terms of accuracy.",
"fno": "9795a083",
"keywords": [
"Data Models",
"Mathematical Model",
"Training Data",
"Computational Modeling",
"Analytical Models",
"Probabilistic Logic",
"Data Mining",
"Text Classification",
"Topic Modeling",
"Data Mining",
"Data Analysis"
],
"authors": [
{
"affiliation": null,
"fullName": "Youngsun Park",
"givenName": "Youngsun",
"surname": "Park",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Md. Hijbul Alam",
"givenName": "Md. Hijbul",
"surname": "Alam",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Woo-Jong Ryu",
"givenName": "Woo-Jong",
"surname": "Ryu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sangkeun Lee",
"givenName": "Sangkeun",
"surname": "Lee",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "csci",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-12-01T00:00:00",
"pubType": "proceedings",
"pages": "83-88",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-9795-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "9795a077",
"articleId": "12OmNx8Ouy6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "9795a089",
"articleId": "12OmNxymobR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bigmm/2016/2179/0/2179a420",
"title": "Contextual-LDA: A Context Coherent Latent Topic Model for Mining Large Corpora",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2016/2179a420/12OmNBqdr85",
"parentPublication": {
"id": "proceedings/bigmm/2016/2179/0",
"title": "2016 IEEE Second International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apscc/2014/7064/0/7064a088",
"title": "Topic Detection from Microblog Based on Text Clustering and Topic Model Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/apscc/2014/7064a088/12OmNC2xhAt",
"parentPublication": {
"id": "proceedings/apscc/2014/7064/0",
"title": "2014 Asia-Pacific Services Computing Conference (APSCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2014/6146/0/6146a593",
"title": "LDA Analyzer: A Tool for Exploring Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2014/6146a593/12OmNCulYlg",
"parentPublication": {
"id": "proceedings/icsme/2014/6146/0",
"title": "2014 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a881",
"title": "Expert Identification Based on Dynamic LDA Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a881/12OmNxA3Z04",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/skg/2013/3012/0/3012a210",
"title": "Location-Driven Geographical Topic Discovery",
"doi": null,
"abstractUrl": "/proceedings-article/skg/2013/3012a210/12OmNxzuMOd",
"parentPublication": {
"id": "proceedings/skg/2013/3012/0",
"title": "2013 Ninth International Conference on Semantics, Knowledge and Grids (SKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdata-congress/2015/7278/0/07207246",
"title": "Effects of Word Assignment in LDA for News Topic Discovery",
"doi": null,
"abstractUrl": "/proceedings-article/bigdata-congress/2015/07207246/12OmNyQ7FFo",
"parentPublication": {
"id": "proceedings/bigdata-congress/2015/7278/0",
"title": "2015 IEEE International Congress on Big Data (BigData Congress)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsecw/2017/2649/0/2649a071",
"title": "Topic Detection from Microblogs Using T-LDA and Perplexity",
"doi": null,
"abstractUrl": "/proceedings-article/apsecw/2017/2649a071/12OmNyRPgWB",
"parentPublication": {
"id": "proceedings/apsecw/2017/2649/0",
"title": "2017 24th Asia-Pacific Software Engineering Conference Workshops (APSECW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a413",
"title": "Dependency-Topic-Affects-Sentiment-LDA Model for Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a413/12OmNyqRn5J",
"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/2014/4302/0/4302a773",
"title": "A Joint Model for Topic-Sentiment Evolution over Time",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2014/4302a773/12OmNzGlRFv",
"parentPublication": {
"id": "proceedings/icdm/2014/4302/0",
"title": "2014 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/06/06985726",
"title": "Probabilistic Word Selection via Topic Modeling",
"doi": null,
"abstractUrl": "/journal/tk/2015/06/06985726/13rRUxly8XY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNC3FG3S",
"title": "2013 Third International Conference on Intelligent System Design and Engineering Applications (ISDEA 2013)",
"acronym": "isdea",
"groupId": "1800333",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvrdI7x",
"doi": "10.1109/ISDEA.2012.34",
"title": "A Method of SNS Topic Models Extraction Based on Self-Adaptively LDA Modeling",
"normalizedTitle": "A Method of SNS Topic Models Extraction Based on Self-Adaptively LDA Modeling",
"abstract": "While SNS(Social Network Services) playing an increasingly important role in today's online world, SNA(Social Network Analysis) and text mining based on such communication are becoming more and more useful for a wide variety of applications. However, topic models, which have been widely used in information classification and retrieval, are not proper for some SNS such as microblogging. Moreover, It is also quite important but difficult to select topic number for a specific target. In this paper, first we present a new evaluation metric for topic models extraction from SNS dataset. Then, by combining LDA modeling with this metric, a self-adaptively LDA modeling method is proposed. Experiments were successfully performed, and the results show that the proposed LDA modeling method can self-adaptively reach the appropriate number of social topics without losing performance for microblogging-like dataset.",
"abstracts": [
{
"abstractType": "Regular",
"content": "While SNS(Social Network Services) playing an increasingly important role in today's online world, SNA(Social Network Analysis) and text mining based on such communication are becoming more and more useful for a wide variety of applications. However, topic models, which have been widely used in information classification and retrieval, are not proper for some SNS such as microblogging. Moreover, It is also quite important but difficult to select topic number for a specific target. In this paper, first we present a new evaluation metric for topic models extraction from SNS dataset. Then, by combining LDA modeling with this metric, a self-adaptively LDA modeling method is proposed. Experiments were successfully performed, and the results show that the proposed LDA modeling method can self-adaptively reach the appropriate number of social topics without losing performance for microblogging-like dataset.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "While SNS(Social Network Services) playing an increasingly important role in today's online world, SNA(Social Network Analysis) and text mining based on such communication are becoming more and more useful for a wide variety of applications. However, topic models, which have been widely used in information classification and retrieval, are not proper for some SNS such as microblogging. Moreover, It is also quite important but difficult to select topic number for a specific target. In this paper, first we present a new evaluation metric for topic models extraction from SNS dataset. Then, by combining LDA modeling with this metric, a self-adaptively LDA modeling method is proposed. Experiments were successfully performed, and the results show that the proposed LDA modeling method can self-adaptively reach the appropriate number of social topics without losing performance for microblogging-like dataset.",
"fno": "06454769",
"keywords": [
"Data Mining",
"Social Networking Online",
"Text Analysis",
"SNS Topic Model",
"Social Network Service",
"Self Adaptively LDA Modeling",
"SNA",
"Social Network Analysis",
"Text Mining",
"Microblogging",
"Information Classification",
"Information Retrieval",
"Social Topic",
"SNS Dataset",
"Latent Dirichlet Allocation",
"Topic Model Extraction",
"Measurement",
"Communities",
"Adaptation Models",
"Security",
"Social Network Services",
"Semantics",
"Probabilistic Logic",
"SNS",
"Latent Dirichlet Allocation",
"Topic Models",
"Microblogging",
"Density"
],
"authors": [
{
"affiliation": null,
"fullName": "Fei Lu",
"givenName": "Fei",
"surname": "Lu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Beijun Shen",
"givenName": "Beijun",
"surname": "Shen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jiuchuan Lin",
"givenName": "Jiuchuan",
"surname": "Lin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hanlong Zhang",
"givenName": "Hanlong",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "isdea",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-01-01T00:00:00",
"pubType": "proceedings",
"pages": "112-115",
"year": "2013",
"issn": null,
"isbn": "978-1-4673-4893-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06454771",
"articleId": "12OmNzuZUmv",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06454767",
"articleId": "12OmNx5piTm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bigmm/2016/2179/0/2179a420",
"title": "Contextual-LDA: A Context Coherent Latent Topic Model for Mining Large Corpora",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2016/2179a420/12OmNBqdr85",
"parentPublication": {
"id": "proceedings/bigmm/2016/2179/0",
"title": "2016 IEEE Second International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2014/6146/0/6146a593",
"title": "LDA Analyzer: A Tool for Exploring Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2014/6146a593/12OmNCulYlg",
"parentPublication": {
"id": "proceedings/icsme/2014/6146/0",
"title": "2014 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisa/2013/0602/0/06579490",
"title": "SNS Information Extraction for Social Search",
"doi": null,
"abstractUrl": "/proceedings-article/icisa/2013/06579490/12OmNqBtiQR",
"parentPublication": {
"id": "proceedings/icisa/2013/0602/0",
"title": "2013 International Conference on Information Science and Applications (ICISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2015/9795/0/9795a083",
"title": "BL-LDA: Bringing Bigram to Supervised Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2015/9795a083/12OmNvjyxGR",
"parentPublication": {
"id": "proceedings/csci/2015/9795/0",
"title": "2015 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsc/2018/4210/0/421001a881",
"title": "Expert Identification Based on Dynamic LDA Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a881/12OmNxA3Z04",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2017/0752/0/0752a009",
"title": "WE-LDA: A Word Embeddings Augmented LDA Model for Web Services Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2017/0752a009/12OmNxSNvrO",
"parentPublication": {
"id": "proceedings/icws/2017/0752/0",
"title": "2017 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icbk/2017/3120/0/3120a315",
"title": "Modeling Topic Evolution in Social Media Short Texts",
"doi": null,
"abstractUrl": "/proceedings-article/icbk/2017/3120a315/12OmNy2rS0U",
"parentPublication": {
"id": "proceedings/icbk/2017/3120/0",
"title": "2017 IEEE International Conference on Big Knowledge (ICBK)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258417",
"title": "Automatic topic discovery of online hospital reviews using an improved LDA with Variational Gibbs Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258417/17D45WODasG",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdata-congress/2018/7232/0/723201a017",
"title": "Incorporating Word Embedding into Cross-Lingual Topic Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/bigdata-congress/2018/723201a017/17D45XERmlm",
"parentPublication": {
"id": "proceedings/bigdata-congress/2018/7232/0",
"title": "2018 IEEE International Congress on Big Data (BigData Congress)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10102323",
"title": "TopicRefiner: Coherence-Guided Steerable LDA for Visual Topic Enhancement",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10102323/1Mjj0nUbTKU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvlPkDI",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"acronym": "dsc",
"groupId": "1815424",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxA3Z04",
"doi": "10.1109/DSC.2018.00141",
"title": "Expert Identification Based on Dynamic LDA Topic Model",
"normalizedTitle": "Expert Identification Based on Dynamic LDA Topic Model",
"abstract": "In recent years, human society is transferring from information society to knowledge society. Experts mastering professional knowledge are becoming more and more valuable resources in the society, therefore Expert Identification, also known as Expert Finding, became an important research field. Existed Expert Identification work is mainly based on traditional information retrieval, or standard topic models. Experts finding still faces a lot of problems, such as the missing of semantic information or the inaccuracy without changes over time taken into consideration. This paper presents a domain Expert Identification method with the improved dynamic LDA algorithm which solves these shortcomings of existed methods. Based on the standard LDA model, this method divides the corpus with large time span according to time to apply the dynamic LDA model and combines profile modelling and file modelling for expert modelling. In addition, this method considers both the semantic information of the domain and expert authority. Experiments show its feasibility and effectiveness, and its advantage over the traditional static topic model. It has opened up new application fields of dynamic topic model.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In recent years, human society is transferring from information society to knowledge society. Experts mastering professional knowledge are becoming more and more valuable resources in the society, therefore Expert Identification, also known as Expert Finding, became an important research field. Existed Expert Identification work is mainly based on traditional information retrieval, or standard topic models. Experts finding still faces a lot of problems, such as the missing of semantic information or the inaccuracy without changes over time taken into consideration. This paper presents a domain Expert Identification method with the improved dynamic LDA algorithm which solves these shortcomings of existed methods. Based on the standard LDA model, this method divides the corpus with large time span according to time to apply the dynamic LDA model and combines profile modelling and file modelling for expert modelling. In addition, this method considers both the semantic information of the domain and expert authority. Experiments show its feasibility and effectiveness, and its advantage over the traditional static topic model. It has opened up new application fields of dynamic topic model.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In recent years, human society is transferring from information society to knowledge society. Experts mastering professional knowledge are becoming more and more valuable resources in the society, therefore Expert Identification, also known as Expert Finding, became an important research field. Existed Expert Identification work is mainly based on traditional information retrieval, or standard topic models. Experts finding still faces a lot of problems, such as the missing of semantic information or the inaccuracy without changes over time taken into consideration. This paper presents a domain Expert Identification method with the improved dynamic LDA algorithm which solves these shortcomings of existed methods. Based on the standard LDA model, this method divides the corpus with large time span according to time to apply the dynamic LDA model and combines profile modelling and file modelling for expert modelling. In addition, this method considers both the semantic information of the domain and expert authority. Experiments show its feasibility and effectiveness, and its advantage over the traditional static topic model. It has opened up new application fields of dynamic topic model.",
"fno": "421001a881",
"keywords": [
"Identification",
"Information Retrieval",
"Text Analysis",
"Human Society",
"Information Society",
"Knowledge Society",
"Semantic Information",
"File Modelling",
"Expert Authority",
"Expert Modelling",
"Expert Finding",
"Information Retrieval",
"Topic Models",
"Expert Identification Method",
"Dynamic LDA Algorithm",
"Profile Modelling",
"Semantics",
"Analytical Models",
"Data Models",
"Standards",
"Predictive Models",
"Heuristic Algorithms",
"Probabilistic Logic",
"Expert Identification",
"LDA",
"Dynamic Topic Model",
"Expert Modelling"
],
"authors": [
{
"affiliation": null,
"fullName": "Renjun Chi",
"givenName": "Renjun",
"surname": "Chi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Bin Wu",
"givenName": "Bin",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lin Wang",
"givenName": "Lin",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dsc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-06-01T00:00:00",
"pubType": "proceedings",
"pages": "881-888",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-4210-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "421001a873",
"articleId": "12OmNwCaCzq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "421001a889",
"articleId": "12OmNqBKTZt",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bigmm/2016/2179/0/2179a420",
"title": "Contextual-LDA: A Context Coherent Latent Topic Model for Mining Large Corpora",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2016/2179a420/12OmNBqdr85",
"parentPublication": {
"id": "proceedings/bigmm/2016/2179/0",
"title": "2016 IEEE Second International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsme/2014/6146/0/6146a593",
"title": "LDA Analyzer: A Tool for Exploring Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2014/6146a593/12OmNCulYlg",
"parentPublication": {
"id": "proceedings/icsme/2014/6146/0",
"title": "2014 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2014/7981/0/7981b939",
"title": "Emerging Topic Detection Model Based on LDA and Its Application in Stem Cell Field",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2014/7981b939/12OmNrNh0y8",
"parentPublication": {
"id": "proceedings/cse/2014/7981/0",
"title": "2014 IEEE 17th International Conference on Computational Science and Engineering (CSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2015/9795/0/9795a083",
"title": "BL-LDA: Bringing Bigram to Supervised Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2015/9795a083/12OmNvjyxGR",
"parentPublication": {
"id": "proceedings/csci/2015/9795/0",
"title": "2015 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2013/4893/0/06454769",
"title": "A Method of SNS Topic Models Extraction Based on Self-Adaptively LDA Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2013/06454769/12OmNvrdI7x",
"parentPublication": {
"id": "proceedings/isdea/2013/4893/0",
"title": "2013 Third International Conference on Intelligent System Design and Engineering Applications (ISDEA 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a413",
"title": "Dependency-Topic-Affects-Sentiment-LDA Model for Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a413/12OmNyqRn5J",
"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/big-data/2016/9005/0/07841019",
"title": "An efficient parallel topic-sensitive expert finding algorithm using spark",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2016/07841019/12OmNzmtWDK",
"parentPublication": {
"id": "proceedings/big-data/2016/9005/0",
"title": "2016 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258417",
"title": "Automatic topic discovery of online hospital reviews using an improved LDA with Variational Gibbs Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258417/17D45WODasG",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020259",
"title": "A Data-driven Latent Semantic Analysis for Automatic Text Summarization using LDA Topic Modelling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020259/1KfRTUeiflu",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msr/2019/3412/0/341200a084",
"title": "Predicting Good Configurations for GitHub and Stack Overflow Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/msr/2019/341200a084/1dx9BD0aalO",
"parentPublication": {
"id": "proceedings/msr/2019/3412/0",
"title": "2019 IEEE/ACM 16th International Conference on Mining Software Repositories (MSR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrJiCDG",
"title": "2015 IEEE International Congress on Big Data (BigData Congress)",
"acronym": "bigdata-congress",
"groupId": "1801789",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyQ7FFo",
"doi": "10.1109/BigDataCongress.2015.62",
"title": "Effects of Word Assignment in LDA for News Topic Discovery",
"normalizedTitle": "Effects of Word Assignment in LDA for News Topic Discovery",
"abstract": "In traditional LDA, latent variables are inferred from the \"bag-of-words\" assumption, in which word order is ignored. This bag-of-words assumption has gained recognition in terms of computational efficiency, whereas it is regarded impractical in many language model applications where word order is essential. In this study, we proposed word concatenation based on morphological rules as compounds and built the connection between compounds and topics. We used three categories including politics, economics, and life of Yahoo! Taiwan news from May/23/2013 to June/20/2013 and also extracted 1/3 of the news pool at random from each category as the mixed dataset. We compared unigrams and compounds in terms of topic coherence and performance, the result shows that the proposed model has a higher value of perplexity, while it illustrates more accurate meaning and computational efficiency than traditional LDA.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In traditional LDA, latent variables are inferred from the \"bag-of-words\" assumption, in which word order is ignored. This bag-of-words assumption has gained recognition in terms of computational efficiency, whereas it is regarded impractical in many language model applications where word order is essential. In this study, we proposed word concatenation based on morphological rules as compounds and built the connection between compounds and topics. We used three categories including politics, economics, and life of Yahoo! Taiwan news from May/23/2013 to June/20/2013 and also extracted 1/3 of the news pool at random from each category as the mixed dataset. We compared unigrams and compounds in terms of topic coherence and performance, the result shows that the proposed model has a higher value of perplexity, while it illustrates more accurate meaning and computational efficiency than traditional LDA.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In traditional LDA, latent variables are inferred from the \"bag-of-words\" assumption, in which word order is ignored. This bag-of-words assumption has gained recognition in terms of computational efficiency, whereas it is regarded impractical in many language model applications where word order is essential. In this study, we proposed word concatenation based on morphological rules as compounds and built the connection between compounds and topics. We used three categories including politics, economics, and life of Yahoo! Taiwan news from May/23/2013 to June/20/2013 and also extracted 1/3 of the news pool at random from each category as the mixed dataset. We compared unigrams and compounds in terms of topic coherence and performance, the result shows that the proposed model has a higher value of perplexity, while it illustrates more accurate meaning and computational efficiency than traditional LDA.",
"fno": "07207246",
"keywords": [
"Compounds",
"Computational Modeling",
"Coherence",
"Analytical Models",
"Context",
"Data Models",
"Computational Efficiency",
"Unigram",
"LDA",
"Compounds Based",
"Topic Discovery"
],
"authors": [
{
"affiliation": null,
"fullName": "Chuen-Min Huang",
"givenName": "Chuen-Min",
"surname": "Huang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Cheng-Yi Wu",
"givenName": "Cheng-Yi",
"surname": "Wu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bigdata-congress",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-06-01T00:00:00",
"pubType": "proceedings",
"pages": "374-380",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-7278-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07207245",
"articleId": "12OmNzYwc5B",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07207247",
"articleId": "12OmNxwWozd",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bigmm/2016/2179/0/2179a420",
"title": "Contextual-LDA: A Context Coherent Latent Topic Model for Mining Large Corpora",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2016/2179a420/12OmNBqdr85",
"parentPublication": {
"id": "proceedings/bigmm/2016/2179/0",
"title": "2016 IEEE Second International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2015/9795/0/9795a083",
"title": "BL-LDA: Bringing Bigram to Supervised Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2015/9795a083/12OmNvjyxGR",
"parentPublication": {
"id": "proceedings/csci/2015/9795/0",
"title": "2015 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icws/2017/0752/0/0752a009",
"title": "WE-LDA: A Word Embeddings Augmented LDA Model for Web Services Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icws/2017/0752a009/12OmNxSNvrO",
"parentPublication": {
"id": "proceedings/icws/2017/0752/0",
"title": "2017 IEEE International Conference on Web Services (ICWS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/skg/2014/6715/0/6715a049",
"title": "Double LDA: A Sentiment Analysis Model Based on Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/skg/2014/6715a049/12OmNxWcHl2",
"parentPublication": {
"id": "proceedings/skg/2014/6715/0",
"title": "2014 Tenth International Conference on Semantics, Knowledge and Grids (SKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a413",
"title": "Dependency-Topic-Affects-Sentiment-LDA Model for Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a413/12OmNyqRn5J",
"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/wisa/2010/4193/0/4193a090",
"title": "LDA Based Related Word Detection in Advertising",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2010/4193a090/12OmNzX6csX",
"parentPublication": {
"id": "proceedings/wisa/2010/4193/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2016/4459/0/4459a852",
"title": "Robust Word-Network Topic Model for Short Texts",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2016/4459a852/12OmNzd7bXT",
"parentPublication": {
"id": "proceedings/ictai/2016/4459/0",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2015/06/06985726",
"title": "Probabilistic Word Selection via Topic Modeling",
"doi": null,
"abstractUrl": "/journal/tk/2015/06/06985726/13rRUxly8XY",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10102323",
"title": "TopicRefiner: Coherence-Guided Steerable LDA for Visual Topic Enhancement",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10102323/1Mjj0nUbTKU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlbdbi/2019/5094/0/509400a237",
"title": "News Title Classification Based on Sentence-LDA Model and Word Embedding",
"doi": null,
"abstractUrl": "/proceedings-article/mlbdbi/2019/509400a237/1gjRK0zgCfm",
"parentPublication": {
"id": "proceedings/mlbdbi/2019/5094/0",
"title": "2019 International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrAMEOb",
"title": "2016 IEEE Second International Conference on Multimedia Big Data (BigMM)",
"acronym": "bigmm",
"groupId": "1808144",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzdGntp",
"doi": "10.1109/BigMM.2016.25",
"title": "TopicPie: An Interactive Visualization for LDA-Based Topic Analysis",
"normalizedTitle": "TopicPie: An Interactive Visualization for LDA-Based Topic Analysis",
"abstract": "LDA-based topic analysis is widely used in text mining field. Considering the large scale of web documents, document clusters are usually analyzed instead of single ones. However, the existing visualizations of LDA-based clustering do not intuitively present contents of hot topics while maintaining the relationships between the topics and the document clusters. In this paper, we propose an integrated interactive visualization method that provides intuitive and effective views for topic popularity, topic contents, document clusters, and relationships between topics and document clusters. In this way, users can quickly identify the topic-based patterns. We show an experimental evaluation by comparing the tabular representation and our visualization. The results show that our method can significantly facilitate the topic analysis, particularly in the field of Chinese culture study.",
"abstracts": [
{
"abstractType": "Regular",
"content": "LDA-based topic analysis is widely used in text mining field. Considering the large scale of web documents, document clusters are usually analyzed instead of single ones. However, the existing visualizations of LDA-based clustering do not intuitively present contents of hot topics while maintaining the relationships between the topics and the document clusters. In this paper, we propose an integrated interactive visualization method that provides intuitive and effective views for topic popularity, topic contents, document clusters, and relationships between topics and document clusters. In this way, users can quickly identify the topic-based patterns. We show an experimental evaluation by comparing the tabular representation and our visualization. The results show that our method can significantly facilitate the topic analysis, particularly in the field of Chinese culture study.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "LDA-based topic analysis is widely used in text mining field. Considering the large scale of web documents, document clusters are usually analyzed instead of single ones. However, the existing visualizations of LDA-based clustering do not intuitively present contents of hot topics while maintaining the relationships between the topics and the document clusters. In this paper, we propose an integrated interactive visualization method that provides intuitive and effective views for topic popularity, topic contents, document clusters, and relationships between topics and document clusters. In this way, users can quickly identify the topic-based patterns. We show an experimental evaluation by comparing the tabular representation and our visualization. The results show that our method can significantly facilitate the topic analysis, particularly in the field of Chinese culture study.",
"fno": "2179a025",
"keywords": [
"Conferences",
"Multimedia Communication",
"Big Data",
"Visual Analytics",
"Latent Dirichlet Allocation",
"LDA",
"Topic Model",
"Text Mining",
"Clustering",
"Visualization"
],
"authors": [
{
"affiliation": null,
"fullName": "Yi Yang",
"givenName": "Yi",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jian Wang",
"givenName": "Jian",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Weixing Huang",
"givenName": "Weixing",
"surname": "Huang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Guigang Zhang",
"givenName": "Guigang",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bigmm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-04-01T00:00:00",
"pubType": "proceedings",
"pages": "25-32",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-2179-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "2179a017",
"articleId": "12OmNzmLxJ5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "2179a033",
"articleId": "12OmNzb7ZsC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icsme/2014/6146/0/6146a593",
"title": "LDA Analyzer: A Tool for Exploring Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/icsme/2014/6146a593/12OmNCulYlg",
"parentPublication": {
"id": "proceedings/icsme/2014/6146/0",
"title": "2014 IEEE International Conference on Software Maintenance and Evolution (ICSME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2015/9795/0/9795a083",
"title": "BL-LDA: Bringing Bigram to Supervised Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2015/9795a083/12OmNvjyxGR",
"parentPublication": {
"id": "proceedings/csci/2015/9795/0",
"title": "2015 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2016/5910/0/07836717",
"title": "Interactive Independent Topic Analysis for Service",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836717/12OmNvoWV3C",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc-scalcom-cbdcom-iop-smartworld/2016/2771/0/07816979",
"title": "Topic Modeling and Visualization for Big Data in Social Sciences",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom-cbdcom-iop-smartworld/2016/07816979/12OmNwLfMAX",
"parentPublication": {
"id": "proceedings/uic-atc-scalcom-cbdcom-iop-smartworld/2016/2771/0",
"title": "2016 Intl IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2011/4335/0/4335a852",
"title": "Document Topic Extraction Based on Wikipedia Category",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2011/4335a852/12OmNxRF6YM",
"parentPublication": {
"id": "proceedings/cso/2011/4335/0",
"title": "2011 Fourth International Joint Conference on Computational Sciences and Optimization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsecw/2017/2649/0/2649a071",
"title": "Topic Detection from Microblogs Using T-LDA and Perplexity",
"doi": null,
"abstractUrl": "/proceedings-article/apsecw/2017/2649a071/12OmNyRPgWB",
"parentPublication": {
"id": "proceedings/apsecw/2017/2649/0",
"title": "2017 24th Asia-Pacific Software Engineering Conference Workshops (APSECW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a413",
"title": "Dependency-Topic-Affects-Sentiment-LDA Model for Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a413/12OmNyqRn5J",
"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/big-data/2022/8045/0/10020259",
"title": "A Data-driven Latent Semantic Analysis for Automatic Text Summarization using LDA Topic Modelling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020259/1KfRTUeiflu",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10102323",
"title": "TopicRefiner: Coherence-Guided Steerable LDA for Visual Topic Enhancement",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10102323/1Mjj0nUbTKU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis4dh/2021/1370/0/137000a012",
"title": "Uncertainty-aware Topic Modeling Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/vis4dh/2021/137000a012/1yNiG9yU9JS",
"parentPublication": {
"id": "proceedings/vis4dh/2021/1370/0",
"title": "2021 IEEE 6th Workshop on Visualization for the Digital Humanities (VIS4DH)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKipN",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45WODasG",
"doi": "10.1109/BigData.2017.8258417",
"title": "Automatic topic discovery of online hospital reviews using an improved LDA with Variational Gibbs Sampling",
"normalizedTitle": "Automatic topic discovery of online hospital reviews using an improved LDA with Variational Gibbs Sampling",
"abstract": "E-commerce websites such as Yelp.com, allow users to write online reviews of products and services, so new customers can have quick access to user experiences, covering everything from auto-repair to hospitals. However, a typical user may find it difficult to identify a topic of interest due to the overwhelming amount of review information. To deal with this issue, the Latent Dirichlet Allocation (LDA) model can be used to associate meaningful terms with text-based reviews, permitting keyword retrieval of individual documents. LDA is a powerful unsupervised learning approach, which has been widely used for topic modeling as well as in other related fields. A conventional implementation of LDA is through the Markov-Chain Monte-Carlo methodology, called Collapsed Gibbs Sampling (CGS). However, due to the usage of random numbers in the CGS approach, results from multiple trials on the same data are usually inconsistent. To avoid this tendency, we revise the conventional LDA approach using Variational Gibbs Sampling (VGS). VGS eliminates random numbers, and thus leads to consistent results as well as better performance. Our case study shows that our improved LDA can be used to automatically identify keywords and topics in online hospital reviews. Due to the usage of VGS, the accuracy of topic identification has been consistently improved.",
"abstracts": [
{
"abstractType": "Regular",
"content": "E-commerce websites such as Yelp.com, allow users to write online reviews of products and services, so new customers can have quick access to user experiences, covering everything from auto-repair to hospitals. However, a typical user may find it difficult to identify a topic of interest due to the overwhelming amount of review information. To deal with this issue, the Latent Dirichlet Allocation (LDA) model can be used to associate meaningful terms with text-based reviews, permitting keyword retrieval of individual documents. LDA is a powerful unsupervised learning approach, which has been widely used for topic modeling as well as in other related fields. A conventional implementation of LDA is through the Markov-Chain Monte-Carlo methodology, called Collapsed Gibbs Sampling (CGS). However, due to the usage of random numbers in the CGS approach, results from multiple trials on the same data are usually inconsistent. To avoid this tendency, we revise the conventional LDA approach using Variational Gibbs Sampling (VGS). VGS eliminates random numbers, and thus leads to consistent results as well as better performance. Our case study shows that our improved LDA can be used to automatically identify keywords and topics in online hospital reviews. Due to the usage of VGS, the accuracy of topic identification has been consistently improved.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "E-commerce websites such as Yelp.com, allow users to write online reviews of products and services, so new customers can have quick access to user experiences, covering everything from auto-repair to hospitals. However, a typical user may find it difficult to identify a topic of interest due to the overwhelming amount of review information. To deal with this issue, the Latent Dirichlet Allocation (LDA) model can be used to associate meaningful terms with text-based reviews, permitting keyword retrieval of individual documents. LDA is a powerful unsupervised learning approach, which has been widely used for topic modeling as well as in other related fields. A conventional implementation of LDA is through the Markov-Chain Monte-Carlo methodology, called Collapsed Gibbs Sampling (CGS). However, due to the usage of random numbers in the CGS approach, results from multiple trials on the same data are usually inconsistent. To avoid this tendency, we revise the conventional LDA approach using Variational Gibbs Sampling (VGS). VGS eliminates random numbers, and thus leads to consistent results as well as better performance. Our case study shows that our improved LDA can be used to automatically identify keywords and topics in online hospital reviews. Due to the usage of VGS, the accuracy of topic identification has been consistently improved.",
"fno": "08258417",
"keywords": [
"Hospitals",
"Probabilistic Logic",
"Unsupervised Learning",
"Data Models",
"Semantics",
"Resource Management",
"Supervised Learning",
"Hospital Reviews",
"Text Mining",
"Gibbs Sampling",
"Latent Dirichlet Allocation",
"Topic Modeling",
"Big Data"
],
"authors": [
{
"affiliation": "Computer and Information Science Department, University of Massachusetts Dartmouth, Dartmouth, MA 02747, USA",
"fullName": "Richard de Groof",
"givenName": "Richard",
"surname": "de Groof",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Computer and Information Science Department, University of Massachusetts Dartmouth, Dartmouth, MA 02747, USA",
"fullName": "Haiping Xu",
"givenName": "Haiping",
"surname": "Xu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-12-01T00:00:00",
"pubType": "proceedings",
"pages": "4022-4029",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-2715-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08258416",
"articleId": "17D45WrVggP",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08258418",
"articleId": "17D45XoXP4X",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2017/3835/0/3835a907",
"title": "Sub-Gibbs Sampling: A New Strategy for Inferring LDA",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2017/3835a907/12OmNBiygxE",
"parentPublication": {
"id": "proceedings/icdm/2017/3835/0",
"title": "2017 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2016/2179/0/2179a420",
"title": "Contextual-LDA: A Context Coherent Latent Topic Model for Mining Large Corpora",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2016/2179a420/12OmNBqdr85",
"parentPublication": {
"id": "proceedings/bigmm/2016/2179/0",
"title": "2016 IEEE Second International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2009/3816/3/3816c091",
"title": "Topic Discovery Based on LDA Model with Fast Gibbs Sampling",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2009/3816c091/12OmNrF2DNi",
"parentPublication": {
"id": "proceedings/aici/2009/3816/3",
"title": "2009 International Conference on Artificial Intelligence and Computational Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wisa/2010/4193/0/4193a085",
"title": "Mining Hot Topics from Free-Text Customer Reviews—An LDA-Based Approach",
"doi": null,
"abstractUrl": "/proceedings-article/wisa/2010/4193a085/12OmNrJAed0",
"parentPublication": {
"id": "proceedings/wisa/2010/4193/0",
"title": "Web Information Systems and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2015/9795/0/9795a083",
"title": "BL-LDA: Bringing Bigram to Supervised Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2015/9795a083/12OmNvjyxGR",
"parentPublication": {
"id": "proceedings/csci/2015/9795/0",
"title": "2015 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2013/4893/0/06454769",
"title": "A Method of SNS Topic Models Extraction Based on Self-Adaptively LDA Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2013/06454769/12OmNvrdI7x",
"parentPublication": {
"id": "proceedings/isdea/2013/4893/0",
"title": "2013 Third International Conference on Intelligent System Design and Engineering Applications (ISDEA 2013)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/skg/2014/6715/0/6715a049",
"title": "Double LDA: A Sentiment Analysis Model Based on Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/skg/2014/6715a049/12OmNxWcHl2",
"parentPublication": {
"id": "proceedings/skg/2014/6715/0",
"title": "2014 Tenth International Conference on Semantics, Knowledge and Grids (SKG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2014/6572/0/6572a413",
"title": "Dependency-Topic-Affects-Sentiment-LDA Model for Sentiment Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2014/6572a413/12OmNyqRn5J",
"parentPublication": {
"id": "proceedings/ictai/2014/6572/0",
"title": "2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2022/04/09110764",
"title": "Deterministic Inference of Topic Models via Maximal Latent State Replication",
"doi": null,
"abstractUrl": "/journal/tk/2022/04/09110764/1kuDg24PMm4",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccst/2020/8138/0/813800a457",
"title": "Sentiment Analysis of Consumer-Generated Online Reviews of Physical Bookstores Using Hybrid LSTM-CNN and LDA Topic Model",
"doi": null,
"abstractUrl": "/proceedings-article/iccst/2020/813800a457/1p1gtTYg1qg",
"parentPublication": {
"id": "proceedings/iccst/2020/8138/0",
"title": "2020 International Conference on Culture-oriented Science & Technology (ICCST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1LSP7qPzqTK",
"title": "2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"acronym": "hpcc-dss-smartcity-dependsys",
"groupId": "10074610",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1LSPm5OgHOU",
"doi": "10.1109/HPCC-DSS-SmartCity-DependSys57074.2022.00332",
"title": "An Enhanced BERTopic Framework and Algorithm for Improving Topic Coherence and Diversity",
"normalizedTitle": "An Enhanced BERTopic Framework and Algorithm for Improving Topic Coherence and Diversity",
"abstract": "In this paper, we enhance and customize the existing BERTopic framework to develop and implement an automated pipeline that delivers a more coherent and diverse set of topics with an even moderate dataset. More specifically, the contributions of this work are threefold: (1) integrate a dynamic and advanced optimizer into the existing BERTopic framework to learn the optimal number of dimensions of different document embeddings, (2) develop a k-means-based algorithm in the optimizer to support the dimension-embedding learning, and (3) conduct an extensive experimental study on three distinct types of datasets, including DBPedia, AG News, and Reuters, to evaluate the performance of our approach in terms of the topic quality (TQ) score computed by the topic coherence and the topic diversity. From the results, we can conclude that our enhanced, automated BERTopic framework with its dimension-embedding learning algorithm on documents outperforms the TQ score of the existing framework by 4.49% (before removing the stop words) and 16.52% (after removing the stop words) among all the four representable document-embedding approaches, including the BERTopic's Default Sentence Transformer, Google's Universal Sentence Encoder, OpenAI GPT-2, and our investigators' developed Context-aware Embedding Model, on all the three datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we enhance and customize the existing BERTopic framework to develop and implement an automated pipeline that delivers a more coherent and diverse set of topics with an even moderate dataset. More specifically, the contributions of this work are threefold: (1) integrate a dynamic and advanced optimizer into the existing BERTopic framework to learn the optimal number of dimensions of different document embeddings, (2) develop a k-means-based algorithm in the optimizer to support the dimension-embedding learning, and (3) conduct an extensive experimental study on three distinct types of datasets, including DBPedia, AG News, and Reuters, to evaluate the performance of our approach in terms of the topic quality (TQ) score computed by the topic coherence and the topic diversity. From the results, we can conclude that our enhanced, automated BERTopic framework with its dimension-embedding learning algorithm on documents outperforms the TQ score of the existing framework by 4.49% (before removing the stop words) and 16.52% (after removing the stop words) among all the four representable document-embedding approaches, including the BERTopic's Default Sentence Transformer, Google's Universal Sentence Encoder, OpenAI GPT-2, and our investigators' developed Context-aware Embedding Model, on all the three datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we enhance and customize the existing BERTopic framework to develop and implement an automated pipeline that delivers a more coherent and diverse set of topics with an even moderate dataset. More specifically, the contributions of this work are threefold: (1) integrate a dynamic and advanced optimizer into the existing BERTopic framework to learn the optimal number of dimensions of different document embeddings, (2) develop a k-means-based algorithm in the optimizer to support the dimension-embedding learning, and (3) conduct an extensive experimental study on three distinct types of datasets, including DBPedia, AG News, and Reuters, to evaluate the performance of our approach in terms of the topic quality (TQ) score computed by the topic coherence and the topic diversity. From the results, we can conclude that our enhanced, automated BERTopic framework with its dimension-embedding learning algorithm on documents outperforms the TQ score of the existing framework by 4.49% (before removing the stop words) and 16.52% (after removing the stop words) among all the four representable document-embedding approaches, including the BERTopic's Default Sentence Transformer, Google's Universal Sentence Encoder, OpenAI GPT-2, and our investigators' developed Context-aware Embedding Model, on all the three datasets.",
"fno": "199300c251",
"keywords": [
"Customer Services",
"Learning Artificial Intelligence",
"Natural Language Processing",
"Pattern Classification",
"Text Analysis",
"Advanced Optimizer",
"Automated BER Topic Framework",
"Automated Pipeline",
"BER Topics Default Sentence Transformer",
"Different Document Embeddings",
"Dimension Embedding Learning Algorithm",
"Dynamic Optimizer",
"Enhanced BER Topic Framework",
"Existing BER Topic Framework",
"Existing Framework",
"Extensive Experimental Study",
"Improving Topic Coherence",
"Investigators",
"Moderate Dataset",
"Representable Document Embedding Approaches",
"Stop Words",
"Topic Diversity",
"Topic Quality Score",
"Heuristic Algorithms",
"Pipelines",
"Coherence",
"Transformers",
"Internet",
"Context Modeling",
"BER Topic Framework",
"K Means Based Algorithms",
"Dimension Reduction",
"Topic Modeling"
],
"authors": [
{
"affiliation": "Data Science Program, Worcester Polytechnic Institute,Worcester,MA,USA",
"fullName": "Sahil Sawant",
"givenName": "Sahil",
"surname": "Sawant",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Data Science Program, Worcester Polytechnic Institute,Worcester,MA,USA",
"fullName": "Jinhong Yu",
"givenName": "Jinhong",
"surname": "Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Big Data & Consumer Analytics Vodafone GmbH,Duesseldorf, NRW,Germany",
"fullName": "Kirtikumar Pandya",
"givenName": "Kirtikumar",
"surname": "Pandya",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Data Science Program, Worcester Polytechnic Institute,Worcester,MA,USA",
"fullName": "Chun-Kit Ngan",
"givenName": "Chun-Kit",
"surname": "Ngan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Big Data & Consumer Analytics Vodafone GmbH,Duesseldorf, NRW,Germany",
"fullName": "Rolf Bardeli",
"givenName": "Rolf",
"surname": "Bardeli",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hpcc-dss-smartcity-dependsys",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-12-01T00:00:00",
"pubType": "proceedings",
"pages": "2251-2257",
"year": "2022",
"issn": null,
"isbn": "979-8-3503-1993-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "199300c243",
"articleId": "1LSPjU22Xfy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "199300c258",
"articleId": "1LSPhHxxMo8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dsc/2018/4210/0/421001a848",
"title": "Research on Improve Topic Representation over Short Text",
"doi": null,
"abstractUrl": "/proceedings-article/dsc/2018/421001a848/12OmNzmclNR",
"parentPublication": {
"id": "proceedings/dsc/2018/4210/0",
"title": "2018 IEEE Third International Conference on Data Science in Cyberspace (DSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2013/5108/0/5108a985",
"title": "Discriminatively Enhanced Topic Models",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2013/5108a985/12OmNzvQHOD",
"parentPublication": {
"id": "proceedings/icdm/2013/5108/0",
"title": "2013 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2017/2626/0/262600a203",
"title": "Topic Modeling Using Contextual Cues",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2017/262600a203/17D45WwsQ72",
"parentPublication": {
"id": "proceedings/synasc/2017/2626/0",
"title": "2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671598",
"title": "Analyzing Scientific Publications using Domain-Specific Word Embedding and Topic Modelling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671598/1A8hpYaHQzK",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2022/0883/0/088300d254",
"title": "Intent Mining: A Social and Semantic Enhanced Topic Model for Operation-Friendly Digital Marketing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2022/088300d254/1FwFsUylxao",
"parentPublication": {
"id": "proceedings/icde/2022/0883/0",
"title": "2022 IEEE 38th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020678",
"title": "Analysing Longitudinal Social Science Questionnaires: Topic modelling with BERT-based Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020678/1KfS2ktnAKQ",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2023/8263/0/826300a009",
"title": "Coherence based Document Clustering",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2023/826300a009/1LFKRAxwxry",
"parentPublication": {
"id": "proceedings/icsc/2023/8263/0",
"title": "2023 IEEE 17th International Conference on Semantic Computing (ICSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10102323",
"title": "TopicRefiner: Coherence-Guided Steerable LDA for Visual Topic Enhancement",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10102323/1Mjj0nUbTKU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/2020/12/08734758",
"title": "Combine Topic Modeling with Semantic Embedding: Embedding Enhanced Topic Model",
"doi": null,
"abstractUrl": "/journal/tk/2020/12/08734758/1aM8UdFL8mk",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2019/2607/1/260701a948",
"title": "Topic Shift Detection in Online Discussions using Structural Context",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2019/260701a948/1cYiyTIRyjC",
"parentPublication": {
"id": "proceedings/compsac/2019/2607/1",
"title": "2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1asgav190Yg",
"title": "2018 International Conference on Information Technology (ICIT)",
"acronym": "icit",
"groupId": "1828024",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "1asgbRiAEtW",
"doi": "10.1109/ICIT.2018.00040",
"title": "Detection of Topic from Unstructured Text With Mixed Languages",
"normalizedTitle": "Detection of Topic from Unstructured Text With Mixed Languages",
"abstract": "This paper proposes a design of a Topic Detector machine which combines the power of LDA and Word2Vec to detect topic from mixed text. The experiment is carried on a mixed text of English and Hindi to detect topics. The technique tokenizes the mixed text of Hindi and English and models them into feature vector trough a process of Word2Vec. These vectors are clustered and the cluster centers are identified as the topic of the cluster of tokens.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper proposes a design of a Topic Detector machine which combines the power of LDA and Word2Vec to detect topic from mixed text. The experiment is carried on a mixed text of English and Hindi to detect topics. The technique tokenizes the mixed text of Hindi and English and models them into feature vector trough a process of Word2Vec. These vectors are clustered and the cluster centers are identified as the topic of the cluster of tokens.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper proposes a design of a Topic Detector machine which combines the power of LDA and Word2Vec to detect topic from mixed text. The experiment is carried on a mixed text of English and Hindi to detect topics. The technique tokenizes the mixed text of Hindi and English and models them into feature vector trough a process of Word2Vec. These vectors are clustered and the cluster centers are identified as the topic of the cluster of tokens.",
"fno": "025900a151",
"keywords": [
"Data Mining",
"Feature Extraction",
"Natural Language Processing",
"Pattern Clustering",
"Text Analysis",
"Unstructured Text",
"Mixed Languages",
"Mixed Text",
"Word 2 Vec",
"Topic Detector Machine",
"LDA",
"Hindi Language",
"English Language",
"Cluster Centers",
"Detectors",
"Information Services",
"Electronic Publishing",
"Internet",
"Semantics",
"Data Models",
"Matrix Decomposition",
"Topic Detection Natural Language Processing Unsupervised Training Text Processing Model Generation Word 2 Vec K Mean Clustering Hierarchical Clustering"
],
"authors": [
{
"affiliation": null,
"fullName": "Suraj Sharma",
"givenName": "Suraj",
"surname": "Sharma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sabitra Sankalp Panigrahi",
"givenName": "Sabitra Sankalp",
"surname": "Panigrahi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Biswajit Paul",
"givenName": "Biswajit",
"surname": "Paul",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Narayan Panigrahi",
"givenName": "Narayan",
"surname": "Panigrahi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icit",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-12-01T00:00:00",
"pubType": "proceedings",
"pages": "151-154",
"year": "2018",
"issn": null,
"isbn": "978-1-7281-0259-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "025900a145",
"articleId": "1asgebxWjGE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "025900a178",
"articleId": "1asgcO0qZpe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2016/1611/0/07822606",
"title": "Topic modeling of biomedical text",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2016/07822606/12OmNA0MZ3s",
"parentPublication": {
"id": "proceedings/bibm/2016/1611/0",
"title": "2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2016/5473/0/07837989",
"title": "Topic Discovery for Short Texts Using Word Embeddings",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2016/07837989/12OmNAWpywe",
"parentPublication": {
"id": "proceedings/icdm/2016/5473/0",
"title": "2016 IEEE 16th International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2016/4459/0/4459a865",
"title": "Biterm Pseudo Document Topic Model for Short Text",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2016/4459a865/12OmNC2xhA2",
"parentPublication": {
"id": "proceedings/ictai/2016/4459/0",
"title": "2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icebe/2014/6563/0/6563a089",
"title": "Collaborative Topic Modeling for Text Tensors",
"doi": null,
"abstractUrl": "/proceedings-article/icebe/2014/6563a089/12OmNCh0Pb3",
"parentPublication": {
"id": "proceedings/icebe/2014/6563/0",
"title": "2014 IEEE 11th International Conference on e-Business Engineering (ICEBE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2016/5910/0/07836717",
"title": "Interactive Independent Topic Analysis for Service",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2016/07836717/12OmNvoWV3C",
"parentPublication": {
"id": "proceedings/icdmw/2016/5910/0",
"title": "2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdataservice/2015/8128/0/8128a378",
"title": "Modeling Both Coarse-Grained and Fine-Grained Topics in Massive Text Data",
"doi": null,
"abstractUrl": "/proceedings-article/bigdataservice/2015/8128a378/12OmNwDACwV",
"parentPublication": {
"id": "proceedings/bigdataservice/2015/8128/0",
"title": "2015 IEEE First International Conference on Big Data Computing Service and Applications (BigDataService)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0/07363382",
"title": "An Efficient Method for Document Categorization Based on Word2vec and Latent Semantic Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cit-iucc-dasc-picom/2015/07363382/12OmNxwncIQ",
"parentPublication": {
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0",
"title": "2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460118",
"title": "Cross-modal topic correlations for multimedia retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460118/12OmNzgeLGN",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci*cc/2021/2119/0/09811292",
"title": "Language Identification of Hindi-English tweets using code-mixed BERT",
"doi": null,
"abstractUrl": "/proceedings-article/icci*cc/2021/09811292/1EJGICF1Ydy",
"parentPublication": {
"id": "proceedings/icci*cc/2021/2119/0",
"title": "2021 IEEE 20th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aect/2020/4452/0/09194177",
"title": "Supervised Topic Modeling Using Word Embedding with Machine Learning Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/aect/2020/09194177/1n0Ihp5T7pu",
"parentPublication": {
"id": "proceedings/aect/2020/4452/0",
"title": "2019 International Conference on Advances in the Emerging Computing Technologies (AECT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBbaH9T",
"title": "2018 International Conference on Computing, Networking and Communications (ICNC)",
"acronym": "icnc",
"groupId": "1800963",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBW0vDf",
"doi": "10.1109/ICCNC.2018.8390291",
"title": "A Case Study of Security and Privacy Threats from Augmented Reality (AR)",
"normalizedTitle": "A Case Study of Security and Privacy Threats from Augmented Reality (AR)",
"abstract": "In this paper, we present a case study of potential security and privacy threats from virtual reality (VR) and augmented reality (AR) devices, which have been gaining popularity. We introduce a computer vision-based attack using an AR system based on the Samsung Gear VR and ZED stereo camera against authentication approaches on touch-enabled devices. A ZED stereo camera is attached to a Gear VR headset and works as the video feed for the Gear VR. While pretending to be playing, an attacker can capture videos of a victim inputting a password on touch screen. We use depth and distance information provided by the stereo camera to reconstruct the attack scene and recover the victim’s password. We use numerical passwords as an example and perform experiments to demonstrate the performance of our attack. The attack’s success rate is 90% when the distance from the victim is 1.5 meters and a reasonably good success rate is achieved within 2.5 meters. The goal of the paper is to raise awareness of potential security and privacy breaches from seemingly innocuous VR and AR technologies.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a case study of potential security and privacy threats from virtual reality (VR) and augmented reality (AR) devices, which have been gaining popularity. We introduce a computer vision-based attack using an AR system based on the Samsung Gear VR and ZED stereo camera against authentication approaches on touch-enabled devices. A ZED stereo camera is attached to a Gear VR headset and works as the video feed for the Gear VR. While pretending to be playing, an attacker can capture videos of a victim inputting a password on touch screen. We use depth and distance information provided by the stereo camera to reconstruct the attack scene and recover the victim’s password. We use numerical passwords as an example and perform experiments to demonstrate the performance of our attack. The attack’s success rate is 90% when the distance from the victim is 1.5 meters and a reasonably good success rate is achieved within 2.5 meters. The goal of the paper is to raise awareness of potential security and privacy breaches from seemingly innocuous VR and AR technologies.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a case study of potential security and privacy threats from virtual reality (VR) and augmented reality (AR) devices, which have been gaining popularity. We introduce a computer vision-based attack using an AR system based on the Samsung Gear VR and ZED stereo camera against authentication approaches on touch-enabled devices. A ZED stereo camera is attached to a Gear VR headset and works as the video feed for the Gear VR. While pretending to be playing, an attacker can capture videos of a victim inputting a password on touch screen. We use depth and distance information provided by the stereo camera to reconstruct the attack scene and recover the victim’s password. We use numerical passwords as an example and perform experiments to demonstrate the performance of our attack. The attack’s success rate is 90% when the distance from the victim is 1.5 meters and a reasonably good success rate is achieved within 2.5 meters. The goal of the paper is to raise awareness of potential security and privacy breaches from seemingly innocuous VR and AR technologies.",
"fno": "08390291",
"keywords": [
"Cameras",
"Gears",
"Streaming Media",
"Password",
"Three Dimensional Displays",
"Headphones",
"Google"
],
"authors": [
{
"affiliation": "Binghamton University, NY, USA",
"fullName": "Song Chen",
"givenName": "Song",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, University of Massachusetts Lowell, MA, USA",
"fullName": "Zupei Li",
"givenName": "Zupei",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, University of Massachusetts Lowell, MA, USA",
"fullName": "Fabrizio Dangelo",
"givenName": "Fabrizio",
"surname": "Dangelo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, University of Massachusetts Lowell, MA, USA",
"fullName": "Chao Gao",
"givenName": "Chao",
"surname": "Gao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, University of Central Florida, FL, USA",
"fullName": "Xinwen Fu",
"givenName": "Xinwen",
"surname": "Fu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icnc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-03-01T00:00:00",
"pubType": "proceedings",
"pages": "442-446",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-3652-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08390390",
"articleId": "12OmNyrIauF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08390345",
"articleId": "12OmNxecS1W",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "trans/tq/2019/03/08276563",
"title": "GaitLock: Protect Virtual and Augmented Reality Headsets Using Gait",
"doi": null,
"abstractUrl": "/journal/tq/2019/03/08276563/13rRUwI5TSF",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/02/07833028",
"title": "Augmented Reality versus Virtual Reality for 3D Object Manipulation",
"doi": null,
"abstractUrl": "/journal/tg/2018/02/07833028/13rRUwInvsX",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2017/11/08007246",
"title": "AR Feels “Softer” than VR: Haptic Perception of Stiffness in Augmented versus Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2017/11/08007246/13rRUwh80Hj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09766081",
"title": "How Augmented Reality (AR) Can Help and Hinder Collaborative Learning: A Study of AR in Electromagnetism Education",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09766081/1D34HQ1zUNa",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2021/5841/0/584100b291",
"title": "A High-Performance 5G/6G Infrastructure for Augmented, Virtual, and Extended Reality",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2021/584100b291/1EpLpRFjlzq",
"parentPublication": {
"id": "proceedings/csci/2021/5841/0",
"title": "2021 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10098484",
"title": "An Overview of Enhancing Distance Learning Through Emerging Augmented and Virtual Reality Technologies",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10098484/1Mg6lQpqIjS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08797975",
"title": "Do Head-Mounted Display Stereo Deficiencies Affect 3D Pointing Tasks in AR and VR?",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08797975/1cJ0L4GQvSM",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a090",
"title": "First Steps Towards Augmented Reality Interactive Electronic Music Production",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a090/1tnWYWjfAFa",
"parentPublication": {
"id": "proceedings/vrw/2021/4057/0",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a340",
"title": "Device-Agnostic Augmented Reality Rendering Pipeline for AR in Medicine",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a340/1yeQMJ5IoX6",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2021/1298/0/129800a298",
"title": "Compelling AR Earthquake Simulation with AR Screen Shaking",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2021/129800a298/1yfxMdTwo1i",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2021/1298/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1EpKP8wkIOk",
"title": "2021 International Conference on Computational Science and Computational Intelligence (CSCI)",
"acronym": "csci",
"groupId": "1803739",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1EpLpRFjlzq",
"doi": "10.1109/CSCI54926.2021.00264",
"title": "A High-Performance 5G/6G Infrastructure for Augmented, Virtual, and Extended Reality",
"normalizedTitle": "A High-Performance 5G/6G Infrastructure for Augmented, Virtual, and Extended Reality",
"abstract": "Fully developed 5G application delivery services at the mobile edge with reliable \"round trip\" low latency such as the \"motion to photon\" measurements in augmented, virtual, and extended reality (AR/VR/XR) systems are not commercially available yet. In fact, these features may well be a part of 6G infrastructures since viable business models, applications, and supporting technology such as military tactical headsets capable of AR/VR/XR in day/night operations are just coming to market and becoming available. Additionally, the first generations of AR/VR devices and 5G infrastructure have provided lessons-learned for technology developers eager to field useful systems with customer appeal. This paper describes the infrastructure for one of the Department of Defense 5G programs focused on AR/VR for military training.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Fully developed 5G application delivery services at the mobile edge with reliable \"round trip\" low latency such as the \"motion to photon\" measurements in augmented, virtual, and extended reality (AR/VR/XR) systems are not commercially available yet. In fact, these features may well be a part of 6G infrastructures since viable business models, applications, and supporting technology such as military tactical headsets capable of AR/VR/XR in day/night operations are just coming to market and becoming available. Additionally, the first generations of AR/VR devices and 5G infrastructure have provided lessons-learned for technology developers eager to field useful systems with customer appeal. This paper describes the infrastructure for one of the Department of Defense 5G programs focused on AR/VR for military training.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Fully developed 5G application delivery services at the mobile edge with reliable \"round trip\" low latency such as the \"motion to photon\" measurements in augmented, virtual, and extended reality (AR/VR/XR) systems are not commercially available yet. In fact, these features may well be a part of 6G infrastructures since viable business models, applications, and supporting technology such as military tactical headsets capable of AR/VR/XR in day/night operations are just coming to market and becoming available. Additionally, the first generations of AR/VR devices and 5G infrastructure have provided lessons-learned for technology developers eager to field useful systems with customer appeal. This paper describes the infrastructure for one of the Department of Defense 5G programs focused on AR/VR for military training.",
"fno": "584100b291",
"keywords": [
"5 G Mobile Communication",
"Military Computing",
"Mobile Computing",
"Virtual Reality",
"Military Tactical Headsets",
"Technology Developers",
"Useful Systems",
"Defense 5 G Programs",
"Augmented",
"Extended Reality",
"5 G Application Delivery Services",
"Mobile Edge",
"Reliable Round Trip",
"Photon Measurements",
"Viable Business Models",
"Training",
"Headphones",
"5 G Mobile Communication",
"Extended Reality",
"Scientific Computing",
"Military Computing",
"Reliability",
"Augmented Reality",
"Virtual Reality",
"Extended Reality",
"5 G Infrastructure",
"6 G Prototypes",
"Low Latency Application Services",
"Mobile Edge Computing"
],
"authors": [
{
"affiliation": "LLC,Rocket Technology Systems,Washington,DC",
"fullName": "Jeffrey Wallace",
"givenName": "Jeffrey",
"surname": "Wallace",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "LLC,Rocket Technology Systems,Washington,DC",
"fullName": "Angelica Valdivia",
"givenName": "Angelica",
"surname": "Valdivia",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "csci",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1291-1296",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-5841-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "584100b289",
"articleId": "1EpLloLTyLu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "584100b297",
"articleId": "1EpLlhdfP0Y",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "mags/mu/2019/01/08552403",
"title": "Edge Caching and Computing in 5G for Mobile AR/VR and Tactile Internet",
"doi": null,
"abstractUrl": "/magazine/mu/2019/01/08552403/17D45VVho1X",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sec/2021/8390/0/839000a465",
"title": "Poster: Enabling Flexible Edge-assisted XR",
"doi": null,
"abstractUrl": "/proceedings-article/sec/2021/839000a465/1B2HcrybLCE",
"parentPublication": {
"id": "proceedings/sec/2021/8390/0",
"title": "2021 IEEE/ACM Symposium on Edge Computing (SEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iucc-cit-dsci-smartcns/2021/6667/0/666700a572",
"title": "Design of Virtual Reality Education Platform based on 5G MEC",
"doi": null,
"abstractUrl": "/proceedings-article/iucc-cit-dsci-smartcns/2021/666700a572/1BrAEDKxW0w",
"parentPublication": {
"id": "proceedings/iucc-cit-dsci-smartcns/2021/6667/0",
"title": "2021 20th International Conference on Ubiquitous Computing and Communications (IUCC/CIT/DSCI/SmartCNS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a734",
"title": "Exploring How, for Whom and in Which Contexts Extended Reality Training 'Works' in Upskilling Healthcare Workers: A Realist Review",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a734/1CJdEkUzZHW",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a652",
"title": "Role of Dynamic Affordance and Cognitive Load in the Design of Extended Reality based Simulation Environments for Surgical Contexts",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a652/1CJdQCrNADm",
"parentPublication": {
"id": "proceedings/vrw/2022/8402/0",
"title": "2022 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a897",
"title": "Demo: End-to-end open-source location-based augmented reality in 5G",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a897/1J7Wcw58WoU",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2022/5365/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/05/10049665",
"title": "Text Input for Non-Stationary XR Workspaces: Investigating Tap and Word-Gesture Keyboards in Virtual and Augmented Reality",
"doi": null,
"abstractUrl": "/journal/tg/2023/05/10049665/1KYooqYQbF6",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eecs/2019/6109/0/610900a128",
"title": "A conceptual model of agumented virtual and reality in cadet training",
"doi": null,
"abstractUrl": "/proceedings-article/eecs/2019/610900a128/1oUCS9cBfs4",
"parentPublication": {
"id": "proceedings/eecs/2019/6109/0",
"title": "2019 3rd European Conference on Electrical Engineering and Computer Science (EECS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2022/04/09300168",
"title": "Edge AR X5: An Edge-Assisted Multi-User Collaborative Framework for Mobile Web Augmented Reality in 5G and Beyond",
"doi": null,
"abstractUrl": "/journal/cc/2022/04/09300168/1pK0wCURQti",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icwcsg/2021/2598/0/259800a321",
"title": "A comprehensive study of 5G and 6G networks",
"doi": null,
"abstractUrl": "/proceedings-article/icwcsg/2021/259800a321/1yQBdR9HWYU",
"parentPublication": {
"id": "proceedings/icwcsg/2021/2598/0",
"title": "2021 International Conference on Wireless Communications and Smart Grid (ICWCSG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1FJ5klENAQ0",
"title": "2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC)",
"acronym": "compsac",
"groupId": "1000143",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1FJ613h8X5K",
"doi": "10.1109/COMPSAC54236.2022.00192",
"title": "CSDLEEG: Identifying Confused Students Based on EEG Using Multi-View Deep Learning",
"normalizedTitle": "CSDLEEG: Identifying Confused Students Based on EEG Using Multi-View Deep Learning",
"abstract": "Distance learning has dramatically increased in recent years because of advanced technology. In addition, numerous universities had to offer courses in online mode in 2020 and 2021 because of the COVID-19 pandemic. However, there are more challenges in distance learning than in the traditional learning method (e.g., feedback and interaction). Recently, researchers started using simple EEG headsets to identify confused students during online courses based on machine learning approaches. However, they faced unpleasant accuracy using traditional machine learning algorithms or nondeep neural networks. In this paper, we present a data-driven approach based on a multi-view deep learning technique called CSDLEEG to identify confused students. We employ the students' demographic information and EEG signals to feed our novel neural networks. The results show that our proposed approach is superior to state-of-the-art methods for 98% accuracy and 98% F1-score.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Distance learning has dramatically increased in recent years because of advanced technology. In addition, numerous universities had to offer courses in online mode in 2020 and 2021 because of the COVID-19 pandemic. However, there are more challenges in distance learning than in the traditional learning method (e.g., feedback and interaction). Recently, researchers started using simple EEG headsets to identify confused students during online courses based on machine learning approaches. However, they faced unpleasant accuracy using traditional machine learning algorithms or nondeep neural networks. In this paper, we present a data-driven approach based on a multi-view deep learning technique called CSDLEEG to identify confused students. We employ the students' demographic information and EEG signals to feed our novel neural networks. The results show that our proposed approach is superior to state-of-the-art methods for 98% accuracy and 98% F1-score.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Distance learning has dramatically increased in recent years because of advanced technology. In addition, numerous universities had to offer courses in online mode in 2020 and 2021 because of the COVID-19 pandemic. However, there are more challenges in distance learning than in the traditional learning method (e.g., feedback and interaction). Recently, researchers started using simple EEG headsets to identify confused students during online courses based on machine learning approaches. However, they faced unpleasant accuracy using traditional machine learning algorithms or nondeep neural networks. In this paper, we present a data-driven approach based on a multi-view deep learning technique called CSDLEEG to identify confused students. We employ the students' demographic information and EEG signals to feed our novel neural networks. The results show that our proposed approach is superior to state-of-the-art methods for 98% accuracy and 98% F1-score.",
"fno": "881000b217",
"keywords": [
"Computer Aided Instruction",
"Distance Learning",
"Electroencephalography",
"Learning Artificial Intelligence",
"Neural Nets",
"CSDLEEG",
"Identifying Confused Students",
"EEG Using Multiview Deep Learning",
"Distance Learning",
"Numerous Universities",
"Online Mode",
"COVID 19 Pandemic",
"Traditional Learning Method",
"Feedback",
"Simple EEG Headsets",
"Online Courses",
"Machine Learning Approaches",
"Nondeep Neural Networks",
"Data Driven Approach",
"Deep Learning Technique",
"Deep Learning",
"Learning Systems",
"Headphones",
"Computer Aided Instruction",
"Machine Learning Algorithms",
"Pandemics",
"Neural Networks",
"Distance Learning",
"Massive Open Online Courses MOOC",
"Deep Learning",
"Multi View",
"Confused Stu Dents"
],
"authors": [
{
"affiliation": "Texas Tech University,Department of Computer Science",
"fullName": "Hashim Abu-gellban",
"givenName": "Hashim",
"surname": "Abu-gellban",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Texas Tech University,Department of Computer Science",
"fullName": "Yu Zhuang",
"givenName": "Yu",
"surname": "Zhuang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Meharry Medical College,Computer Science and Data Science",
"fullName": "Long Nguyen",
"givenName": "Long",
"surname": "Nguyen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Clemson University,Computer Science Division",
"fullName": "Zhenkai Zhang",
"givenName": "Zhenkai",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "New Mexico State University,Department of Computer Science",
"fullName": "Essa Imhmed",
"givenName": "Essa",
"surname": "Imhmed",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "compsac",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1217-1222",
"year": "2022",
"issn": "0730-3157",
"isbn": "978-1-6654-8810-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "881000b211",
"articleId": "1FJ5JsUtXOw",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "881000b223",
"articleId": "1FJ5JQi7p60",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/latice/2014/3592/0/3592a289",
"title": "Students' Social Presence in Online Learning System",
"doi": null,
"abstractUrl": "/proceedings-article/latice/2014/3592a289/12OmNqOffAy",
"parentPublication": {
"id": "proceedings/latice/2014/3592/0",
"title": "2014 International Conference on Teaching and Learning in Computing and Engineering (LaTiCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2015/9957/0/07373936",
"title": "Assessing the Attention Levels of Students by Using a Novel Attention Aware System Based on Brainwave Signals",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2015/07373936/12OmNwc3wsa",
"parentPublication": {
"id": "proceedings/iiai-aai/2015/9957/0",
"title": "2015 IIAI 4th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/laclo/2021/2358/0/235800a158",
"title": "Distance learning as an emergency strategy: Students’ opinions about its implementation during the COVID-19 pandemic",
"doi": null,
"abstractUrl": "/proceedings-article/laclo/2021/235800a158/1BzW410ebPa",
"parentPublication": {
"id": "proceedings/laclo/2021/2358/0",
"title": "2021 XVI Latin American Conference on Learning Technologies (LACLO)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2021/5841/0/584100b061",
"title": "Evaluation of distance learning and students’ achievement in Saudi Higher Education Institutions (HEIs)",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2021/584100b061/1EpLGVWrQas",
"parentPublication": {
"id": "proceedings/csci/2021/5841/0",
"title": "2021 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaice/2021/2186/0/218600a826",
"title": "EEG-based Confusion Recognition Using Different Machine Learning Methods",
"doi": null,
"abstractUrl": "/proceedings-article/icaice/2021/218600a826/1Et4wA0DzOg",
"parentPublication": {
"id": "proceedings/icaice/2021/2186/0",
"title": "2021 2nd International Conference on Artificial Intelligence and Computer Engineering (ICAICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2022/6244/0/09962642",
"title": "Virtual Learning Accessibility Barriers Experienced by Engineering Students with Disabilities in the Wake of the COVID-19 Pandemic",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2022/09962642/1IHosBMD0wo",
"parentPublication": {
"id": "proceedings/fie/2022/6244/0",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2022/4609/0/460900a264",
"title": "Students Temporal Profiling and e-Learning Resources Recommendation Based on NLP's Terms Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2022/460900a264/1KBqQiuuM6s",
"parentPublication": {
"id": "proceedings/icdmw/2022/4609/0",
"title": "2022 IEEE International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10098484",
"title": "An Overview of Enhancing Distance Learning Through Emerging Augmented and Virtual Reality Technologies",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10098484/1Mg6lQpqIjS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aivr/2020/7463/0/746300a351",
"title": "A Review of Deep Learning Approaches to EEG-Based Classification of Cybersickness in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/aivr/2020/746300a351/1qpzzTXUIgw",
"parentPublication": {
"id": "proceedings/aivr/2020/7463/0",
"title": "2020 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wi-iat/2020/1924/0/192400a718",
"title": "A Hybrid Data Mining Method for EEG Analysis in Online Education Enhanced by Background Music",
"doi": null,
"abstractUrl": "/proceedings-article/wi-iat/2020/192400a718/1uHhlH0FfYA",
"parentPublication": {
"id": "proceedings/wi-iat/2020/1924/0",
"title": "2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": [
{
"id": "1Iud74JRzmU",
"videoExt": "mp4",
"videoType": {
"featured": false,
"recommended": false,
"sponsored": false,
"__typename": "VideoTypesType"
},
"article": {
"id": "1FJ613h8X5K",
"fno": "881000b217",
"issueNum": null,
"pubType": "proceedings",
"volume": "0",
"year": "2022",
"idPrefix": "compsac",
"doi": "10.1109/COMPSAC54236.2022.00192",
"title": "CSDLEEG: Identifying Confused Students Based on EEG Using Multi-View Deep Learning",
"__typename": "ArticleType"
},
"channel": {
"id": "1IbVCjwOanS",
"title": "COMPSAC 2022",
"status": "1",
"featured": false,
"defaultVideoId": "1Iu2sgyLMeQ",
"category": {
"id": "1xvX5lT1WiQ",
"title": "Proceeding",
"type": "proceeding",
"__typename": "VideoCategoryType"
},
"__typename": "VideoChannelType"
},
"year": "2022",
"title": "CSDLEEG: Identifying Confused Students Based on EEG using Multi-View Deep Learning",
"description": "Distance learning has dramatically increased in recent years because of advanced technology. In addition, numerous universities had to offer courses in online mode in 2020 and 2021 because of the COVID-19 pandemic. However, there are more challenges in distance learning than in the traditional learning method (e.g., feedback and interaction). Recently, researchers started using simple EEG headsets to identify confused students during online courses based on machine learning approaches. However, they faced unpleasant accuracy using traditional machine learning algorithms or non-deep neural networks. In this paper, we present a data-driven approach based on a multi-view deep learning technique called CSDLEEG to identify confused students. We employ the students' demographic information and EEG signals to feed our novel neural networks. The results show that our proposed approach is superior to state-of-the-art methods for 98% accuracy and 98% F1-score.",
"keywords": [],
"speakers": [
{
"firstName": "Hashim",
"lastName": "Abu-gellban",
"affiliation": "Texas Tech University",
"__typename": "SpeakerType"
},
{
"firstName": "Yu",
"lastName": "Zhuang",
"affiliation": "Texas Tech University",
"__typename": "SpeakerType"
},
{
"firstName": "Long",
"lastName": "Nguyen",
"affiliation": "Meharry Medical College",
"__typename": "SpeakerType"
},
{
"firstName": "Zhenkai",
"lastName": "Zhang",
"affiliation": "Clemson University",
"__typename": "SpeakerType"
},
{
"firstName": "Essa",
"lastName": "Imhmed",
"affiliation": "New Mexico State University",
"__typename": "SpeakerType"
}
],
"created": "2022-11-21T00:00:00",
"updated": "2022-11-21T00:00:00",
"imageThumbnailUrl": "thumbnails/1Iud74JRzmU.jpeg",
"runningTime": "00:15:37",
"aspectRatio": "",
"metrics": {
"views": "0",
"likes": "0",
"__typename": "VideoMetricsType"
},
"notShowInVideoLib": false,
"__typename": "VideoType"
}
]
}
|
{
"proceeding": {
"id": "1H5KlMT4sBa",
"title": "2022 13th International Conference on Information, Intelligence, Systems & Applications (IISA)",
"acronym": "iisa",
"groupId": "1802852",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1H5KwMCJIm4",
"doi": "10.1109/IISA56318.2022.9904341",
"title": "A Distance Learning VR Technology Tool for Science Labs",
"normalizedTitle": "A Distance Learning VR Technology Tool for Science Labs",
"abstract": "Distance learning technology and online learning are here to stay. The pandemic crisis made that very clear but the increasing number of the students who are grown up as “digital natives” and want to communicate and learn mostly through technology, make institutions to rethink their instructional approaches in ways that are innovative and technologically modern. It now seems quite feasible to use digital technology in order to organize a virtual classroom and teach a topic that is traditionally taught through lectures in a physical classroom. But, what about the distance teaching of a laboratory course where physical presence in the lab was, until recently, necessary and sometimes mandatory? In this work we propose a solution to this new demand. We present an educational interactive activity that uses desktop immersive virtual reality (VR) technology to familiarize students with the use of laboratory instruments, specifically of a photonic microscope. To that end we also record and analyze students’ actions in an Analytics Platform. The presented VR activity is an example of how instructors in Natural and Physical Sciences can expand their options of engaging their students in the laboratory courses. This approach can also be adopted in a flipped or blended classroom, in pandemic or normal situation, to prepare students for their experiments in a stimulating, safe, low-budget and time-flexible way. Additionally, the instructors may have immediate access to valuable information on their students’ engagement with the subject matter, as the learning analytics back-end offers them a clear view of the most difficult steps of an experiment, thus allowing them to improve their instructional approaches in their on-site labs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Distance learning technology and online learning are here to stay. The pandemic crisis made that very clear but the increasing number of the students who are grown up as “digital natives” and want to communicate and learn mostly through technology, make institutions to rethink their instructional approaches in ways that are innovative and technologically modern. It now seems quite feasible to use digital technology in order to organize a virtual classroom and teach a topic that is traditionally taught through lectures in a physical classroom. But, what about the distance teaching of a laboratory course where physical presence in the lab was, until recently, necessary and sometimes mandatory? In this work we propose a solution to this new demand. We present an educational interactive activity that uses desktop immersive virtual reality (VR) technology to familiarize students with the use of laboratory instruments, specifically of a photonic microscope. To that end we also record and analyze students’ actions in an Analytics Platform. The presented VR activity is an example of how instructors in Natural and Physical Sciences can expand their options of engaging their students in the laboratory courses. This approach can also be adopted in a flipped or blended classroom, in pandemic or normal situation, to prepare students for their experiments in a stimulating, safe, low-budget and time-flexible way. Additionally, the instructors may have immediate access to valuable information on their students’ engagement with the subject matter, as the learning analytics back-end offers them a clear view of the most difficult steps of an experiment, thus allowing them to improve their instructional approaches in their on-site labs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Distance learning technology and online learning are here to stay. The pandemic crisis made that very clear but the increasing number of the students who are grown up as “digital natives” and want to communicate and learn mostly through technology, make institutions to rethink their instructional approaches in ways that are innovative and technologically modern. It now seems quite feasible to use digital technology in order to organize a virtual classroom and teach a topic that is traditionally taught through lectures in a physical classroom. But, what about the distance teaching of a laboratory course where physical presence in the lab was, until recently, necessary and sometimes mandatory? In this work we propose a solution to this new demand. We present an educational interactive activity that uses desktop immersive virtual reality (VR) technology to familiarize students with the use of laboratory instruments, specifically of a photonic microscope. To that end we also record and analyze students’ actions in an Analytics Platform. The presented VR activity is an example of how instructors in Natural and Physical Sciences can expand their options of engaging their students in the laboratory courses. This approach can also be adopted in a flipped or blended classroom, in pandemic or normal situation, to prepare students for their experiments in a stimulating, safe, low-budget and time-flexible way. Additionally, the instructors may have immediate access to valuable information on their students’ engagement with the subject matter, as the learning analytics back-end offers them a clear view of the most difficult steps of an experiment, thus allowing them to improve their instructional approaches in their on-site labs.",
"fno": "09904341",
"keywords": [
"Computer Aided Instruction",
"Distance Learning",
"Educational Courses",
"Student Experiments",
"Teaching",
"Virtual Reality",
"Distance Learning VR Technology Tool",
"Science Labs",
"Online Learning",
"Pandemic Crisis",
"Digital Natives",
"Instructional Approaches",
"Digital Technology",
"Virtual Classroom",
"Physical Classroom",
"Distance Teaching",
"Laboratory Course",
"Physical Presence",
"Educational Interactive Activity",
"Desktop Immersive Virtual Reality",
"Laboratory Instruments",
"Students",
"VR Activity",
"Flipped Classroom",
"Blended Classroom",
"Pandemic Situation",
"Normal Situation",
"Learning Analytics Back End",
"On Site Labs",
"Computer Aided Instruction",
"Pandemics",
"Microscopy",
"Virtual Reality",
"Photonics",
"Distance Learning Education",
"Desktop Virtual Reality",
"Analytics Platform",
"Microscope",
"Onlabs"
],
"authors": [
{
"affiliation": "Hellenic Open University,School of Science & Technology,Patras,Greece",
"fullName": "Evgenia Paxinou",
"givenName": "Evgenia",
"surname": "Paxinou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Hellenic Open University,School of Science & Technology,Patras,Greece",
"fullName": "Konstantinos Mitropoulos",
"givenName": "Konstantinos",
"surname": "Mitropoulos",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Thessaly,Department of Electrical & Computer Engeering,Volos,Greece",
"fullName": "Hariklia Tsalapatas",
"givenName": "Hariklia",
"surname": "Tsalapatas",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Hellenic Open University,School of Science & Technology,Patras,Greece",
"fullName": "Dimitrios Kalles",
"givenName": "Dimitrios",
"surname": "Kalles",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iisa",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-07-01T00:00:00",
"pubType": "proceedings",
"pages": "1-5",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6390-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09904338",
"articleId": "1H5KqRYo2ti",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09904343",
"articleId": "1H5KwwTpZqo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fie/2005/9077/0/01612032",
"title": "Distance learning: teaching a course from a remote site to an on-campus classroom",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2005/01612032/12OmNyprnwJ",
"parentPublication": {
"id": "proceedings/fie/2005/9077/0",
"title": "35th Annual Frontiers in Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seeng/2022/9336/0/933600a005",
"title": "On Using Distance Labs for Engineering Education",
"doi": null,
"abstractUrl": "/proceedings-article/seeng/2022/933600a005/1EOEr5YSAdq",
"parentPublication": {
"id": "proceedings/seeng/2022/9336/0",
"title": "2022 IEEE/ACM 4th International Workshop on Software Engineering Education for the Next Generation (SEENG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ficloud/2022/9350/0/935000a100",
"title": "CV and IoT-based Remote Triggered Labs: Use Case of Conservation of Mechanical Energy",
"doi": null,
"abstractUrl": "/proceedings-article/ficloud/2022/935000a100/1HmkzHduiqI",
"parentPublication": {
"id": "proceedings/ficloud/2022/9350/0",
"title": "2022 9th International Conference on Future Internet of Things and Cloud (FiCloud)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2022/6244/0/09962616",
"title": "An Analysis of Application the Kahoot! Tool in a Gamified Approach to Face-to-face and Emergency Remote Teaching and Learning of Software Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2022/09962616/1IHnEs32i6A",
"parentPublication": {
"id": "proceedings/fie/2022/6244/0",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2022/6244/0/09962443",
"title": "An Effective Systematic Approach to Migrate a Bachelor of Science in Computer Engineering Degree Program to Online Modality",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2022/09962443/1IHopf63dxC",
"parentPublication": {
"id": "proceedings/fie/2022/6244/0",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdmw/2020/9012/0/901200a400",
"title": "Learning Student Interest Trajectory for MOOC Thread Recommendation",
"doi": null,
"abstractUrl": "/proceedings-article/icdmw/2020/901200a400/1rgGhWcWpUs",
"parentPublication": {
"id": "proceedings/icdmw/2020/9012/0",
"title": "2020 International Conference on Data Mining Workshops (ICDMW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2020/7624/0/762400b004",
"title": "ZOOM Sandwich: An Adaptable Model for Distance Learning",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2020/762400b004/1uGYEiwYIec",
"parentPublication": {
"id": "proceedings/csci/2020/7624/0",
"title": "2020 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2021/4106/0/410600a428",
"title": "Transitioning to Online Learning for Indonesian High School Students: Challenges and Possible Solutions",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2021/410600a428/1vK06MzK5b2",
"parentPublication": {
"id": "proceedings/icalt/2021/4106/0",
"title": "2021 International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637139",
"title": "Facilitating Interpersonal Exchange on Digital Transformations by Anchoring a MOOC in a Distance-Learning University Course",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637139/1zuvUEaDyve",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637436",
"title": "Is Remote Learning Becoming the New Norm? A Survey-based Study on the Causes Behind the Poor in-person Classroom Attendances During the Pandemic",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637436/1zuw3i9hw88",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1tnWwqMuCzu",
"title": "2021 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"acronym": "vrw",
"groupId": "1836626",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1tnWYWjfAFa",
"doi": "10.1109/VRW52623.2021.00024",
"title": "First Steps Towards Augmented Reality Interactive Electronic Music Production",
"normalizedTitle": "First Steps Towards Augmented Reality Interactive Electronic Music Production",
"abstract": "Immersive music production starts to integrate Virtual Reality (VR) and Augmented Reality (AR) technologies. VR creates virtual spaces separated from real-life, often based on the performer-audience relationship. AR goes further by expanding the usual user listening experience over headphones but remains unexplored. The paper presents a work in progress of an AR compositional platform which allows to create interactive music experiences, through the use case of an electronic music creation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Immersive music production starts to integrate Virtual Reality (VR) and Augmented Reality (AR) technologies. VR creates virtual spaces separated from real-life, often based on the performer-audience relationship. AR goes further by expanding the usual user listening experience over headphones but remains unexplored. The paper presents a work in progress of an AR compositional platform which allows to create interactive music experiences, through the use case of an electronic music creation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Immersive music production starts to integrate Virtual Reality (VR) and Augmented Reality (AR) technologies. VR creates virtual spaces separated from real-life, often based on the performer-audience relationship. AR goes further by expanding the usual user listening experience over headphones but remains unexplored. The paper presents a work in progress of an AR compositional platform which allows to create interactive music experiences, through the use case of an electronic music creation.",
"fno": "405700a090",
"keywords": [
"Augmented Reality",
"Electronic Music",
"Music",
"Virtual Reality",
"VR",
"Virtual Spaces",
"Performer Audience Relationship",
"Usual User Listening Experience",
"Interactive Music Experiences",
"Electronic Music Creation",
"Steps Towards Augmented Reality Interactive Electronic Music Production",
"Immersive Music Production",
"Headphones",
"Three Dimensional Displays",
"Conferences",
"Production",
"User Interfaces",
"Electronic Music",
"Augmented Reality",
"Spatialized Music Production",
"Augmented Reality",
"New Interface For Musical Expression",
"Applied Computing X 2014 Arts And Humanities X 2014 Media Arts",
"Human Centered Computing X 2014 Human Computer Interaction HCI X 2014 Interaction Paradigms X 2014 Mixed Augmented Reality"
],
"authors": [
{
"affiliation": "Université Paris-Saclay CNRS, LISN",
"fullName": "Valentin Bauer",
"givenName": "Valentin",
"surname": "Bauer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Université Paris-Saclay CNRS, LISN",
"fullName": "Tifanie Bouchara",
"givenName": "Tifanie",
"surname": "Bouchara",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vrw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-03-01T00:00:00",
"pubType": "proceedings",
"pages": "90-93",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-4057-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1tnWWQqDbCU",
"name": "pvrw202140570-09419126s1-mm_405700a090.zip",
"size": "401 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pvrw202140570-09419126s1-mm_405700a090.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "405700a086",
"articleId": "1tnXsy5GxSE",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "405700a094",
"articleId": "1tnWFLPlaNi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iv/1999/0210/0/02100032",
"title": "Virtual Reality and Augmented Reality as a Training Tool for Assembly Tasks",
"doi": null,
"abstractUrl": "/proceedings-article/iv/1999/02100032/12OmNAObbyR",
"parentPublication": {
"id": "proceedings/iv/1999/0210/0",
"title": "1999 IEEE International Conference on Information Visualization (Cat. No. PR00210)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iswc/2003/2034/0/20340127",
"title": "First Steps Towards Handheld Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/iswc/2003/20340127/12OmNAlvHNr",
"parentPublication": {
"id": "proceedings/iswc/2003/2034/0",
"title": "Seventh IEEE International Symposium on Wearable Computers, 2003. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2008/1971/0/04480747",
"title": "An Empirical Study of Hear-Through Augmented Reality: Using Bone Conduction to Deliver Spatialized Audio",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2008/04480747/12OmNB8kHRs",
"parentPublication": {
"id": "proceedings/vr/2008/1971/0",
"title": "IEEE Virtual Reality 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2016/0836/0/07504792",
"title": "What do we care 4? A virtual reality music video",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2016/07504792/12OmNqAU6zU",
"parentPublication": {
"id": "proceedings/vr/2016/0836/0",
"title": "2016 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vs-games/2016/2722/0/07590352",
"title": "Immersive Orchestras: Audio Processing for Orchestral Music VR Content",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2016/07590352/12OmNxYtu8a",
"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/tg/2017/11/08007246",
"title": "AR Feels “Softer” than VR: Haptic Perception of Stiffness in Augmented versus Virtual Reality",
"doi": null,
"abstractUrl": "/journal/tg/2017/11/08007246/13rRUwh80Hj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2022/1316/0/131600b552",
"title": "SoK: Authentication in Augmented and Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2022/131600b552/1FlQIjcP4FW",
"parentPublication": {
"id": "proceedings/sp/2022/1316/0/",
"title": "2022 IEEE Symposium on Security and Privacy (SP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imet/2022/7016/0/09929500",
"title": "Interactive Historical Documentary in Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/imet/2022/09929500/1HYuTheBVYY",
"parentPublication": {
"id": "proceedings/imet/2022/7016/0",
"title": "2022 International Conference on Interactive Media, Smart Systems and Emerging Technologies (IMET)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2019/1377/0/08798080",
"title": "Characterizing Asymmetric Collaborative Interactions in Virtual and Augmented Realities",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2019/08798080/1cJ0Ph3yn7O",
"parentPublication": {
"id": "proceedings/vr/2019/1377/0",
"title": "2019 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2020/7675/0/767500a076",
"title": "MiXR: A Hybrid AR Sheet Music Interface for Live Performance",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2020/767500a076/1pBMiNAfDpK",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2020/7675/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"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": "1H0KAEvXEdy",
"doi": "10.1109/CVPR52688.2022.01872",
"title": "DiGS : Divergence guided shape implicit neural representation for unoriented point clouds",
"normalizedTitle": "DiGS : Divergence guided shape implicit neural representation for unoriented point clouds",
"abstract": "Shape implicit neural representations (INRs) have recently shown to be effective in shape analysis and reconstruction tasks. Existing INRs require point coordinates to learn the implicit level sets of the shape. When a normal vector is available for each point, a higher fidelity representation can be learned, however normal vectors are often not provided as raw data. Furthermore, the method's initialization has been shown to play a crucial role for surface reconstruction. In this paper, we propose a divergence guided shape representation learning approach that does not require normal vectors as input. We show that incorporating a soft constraint on the divergence of the distance function favours smooth solutions that reliably orients gradients to match the unknown normal at each point, in some cases even better than approaches that use ground truth normal vectors directly. Additionally, we introduce a novel geometric initialization method for sinusoidal INRs that further improves convergence to the desired solution. We evaluate the effectiveness of our approach on the task of surface reconstruction and shape space learning and show SOTA performance compared to other unoriented methods. Code and model parameters available at our project page https://chumbyte.github.io/DiGS-Site/",
"abstracts": [
{
"abstractType": "Regular",
"content": "Shape implicit neural representations (INRs) have recently shown to be effective in shape analysis and reconstruction tasks. Existing INRs require point coordinates to learn the implicit level sets of the shape. When a normal vector is available for each point, a higher fidelity representation can be learned, however normal vectors are often not provided as raw data. Furthermore, the method's initialization has been shown to play a crucial role for surface reconstruction. In this paper, we propose a divergence guided shape representation learning approach that does not require normal vectors as input. We show that incorporating a soft constraint on the divergence of the distance function favours smooth solutions that reliably orients gradients to match the unknown normal at each point, in some cases even better than approaches that use ground truth normal vectors directly. Additionally, we introduce a novel geometric initialization method for sinusoidal INRs that further improves convergence to the desired solution. We evaluate the effectiveness of our approach on the task of surface reconstruction and shape space learning and show SOTA performance compared to other unoriented methods. Code and model parameters available at our project page https://chumbyte.github.io/DiGS-Site/",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Shape implicit neural representations (INRs) have recently shown to be effective in shape analysis and reconstruction tasks. Existing INRs require point coordinates to learn the implicit level sets of the shape. When a normal vector is available for each point, a higher fidelity representation can be learned, however normal vectors are often not provided as raw data. Furthermore, the method's initialization has been shown to play a crucial role for surface reconstruction. In this paper, we propose a divergence guided shape representation learning approach that does not require normal vectors as input. We show that incorporating a soft constraint on the divergence of the distance function favours smooth solutions that reliably orients gradients to match the unknown normal at each point, in some cases even better than approaches that use ground truth normal vectors directly. Additionally, we introduce a novel geometric initialization method for sinusoidal INRs that further improves convergence to the desired solution. We evaluate the effectiveness of our approach on the task of surface reconstruction and shape space learning and show SOTA performance compared to other unoriented methods. Code and model parameters available at our project page https://chumbyte.github.io/DiGS-Site/",
"fno": "694600t9301",
"keywords": [
"Computer Graphics",
"Computer Vision",
"Image Matching",
"Image Reconstruction",
"Image Representation",
"Learning Artificial Intelligence",
"Medical Image Processing",
"Neural Nets",
"Shape Recognition",
"Solid Modelling",
"Unoriented Methods",
"Divergence Guided Shape Implicit Neural Representation",
"Unoriented Point Clouds",
"Shape Implicit Neural Representations",
"Shape Analysis",
"Reconstruction Tasks",
"Existing IN Rs",
"Point Coordinates",
"Implicit Level Sets",
"Normal Vector",
"Higher Fidelity Representation",
"Surface Reconstruction",
"Divergence Guided Shape Representation",
"Use Ground Truth Normal Vectors",
"Novel Geometric Initialization Method",
"Sinusoidal IN Rs",
"Shape Space Learning",
"Point Cloud Compression",
"Representation Learning",
"Surface Reconstruction",
"Solid Modeling",
"Three Dimensional Displays",
"Design Automation",
"Smoothing Methods"
],
"authors": [
{
"affiliation": "Technion Israel Institute of Technology",
"fullName": "Yizhak Ben-Shabat",
"givenName": "Yizhak",
"surname": "Ben-Shabat",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Australian National University",
"fullName": "Chamin Hewa Koneputugodage",
"givenName": "Chamin Hewa",
"surname": "Koneputugodage",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Australian National University",
"fullName": "Stephen Gould",
"givenName": "Stephen",
"surname": "Gould",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "19301-19310",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1H0KAAE6Bj2",
"name": "pcvpr202269460-09879212s1-mm_694600t9301.zip",
"size": "5.99 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202269460-09879212s1-mm_694600t9301.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "694600t9291",
"articleId": "1H1mPsA11XW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600t9311",
"articleId": "1H1iHl2iyEo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2010/6984/0/05539979",
"title": "Total Bregman divergence and its applications to shape retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2010/05539979/12OmNAlvHOC",
"parentPublication": {
"id": "proceedings/cvpr/2010/6984/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09693131",
"title": "Refine-Net: Normal Refinement Neural Network for Noisy Point Clouds",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09693131/1As6TjLcxmU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200m2426",
"title": "3DIAS: 3D Shape Reconstruction with Implicit Algebraic Surfaces",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2426/1BmI9u6tRSw",
"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/281200n3067",
"title": "Multiresolution Deep Implicit Functions for 3D Shape Representation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200n3067/1BmL39Zkm9G",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2714",
"title": "Neural Shape Mating: Self-Supervised Object Assembly with Adversarial Shape Priors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2714/1H0KKRpu8mc",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10093999",
"title": "ANISE: Assembly-based Neural Implicit Surface rEconstruction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10093999/1M80HueHnJS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800e856",
"title": "Local Deep Implicit Functions for 3D Shape",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800e856/1m3ngGoPx5u",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800b259",
"title": "Neighborhood-based Neural Implicit Reconstruction from Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800b259/1zWEcdiPXxK",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800a859",
"title": "Residual Geometric Feature Transform Network for 3D Surface Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800a859/1zWEeQ2Ft72",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800a940",
"title": "NeeDrop: Self-supervised Shape Representation from Sparse Point Clouds using Needle Dropping",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800a940/1zWEezCujxC",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__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": "1H0KKRpu8mc",
"doi": "10.1109/CVPR52688.2022.01239",
"title": "Neural Shape Mating: Self-Supervised Object Assembly with Adversarial Shape Priors",
"normalizedTitle": "Neural Shape Mating: Self-Supervised Object Assembly with Adversarial Shape Priors",
"abstract": "Learning to autonomously assemble shapes is a crucial skill for many robotic applications. While the majority of existing part assembly methods focus on correctly posing semantic parts to recreate a whole object, we interpret assembly more literally: as mating geometric parts together to achieve a snug fit. By focusing on shape alignment rather than semantic cues, we can achieve across category generalization and scaling. In this paper, we introduce a novel task, pairwise 3D geometric shape mating, and propose Neural Shape Mating (NSM) to tackle this problem. Given point clouds of two object parts of an unknown category, NSM learns to reason about the fit of the two parts and predict a pair of 3D poses that tightly mate them together. In addition, we couple the training of NSM with an implicit shape reconstruction task, making NSM more robust to imperfect point cloud observations. To train NSM, we present a self-supervised data collection pipeline that generates pairwise shape mating data with ground truth by randomly cutting an object mesh into two parts, resulting in a dataset that consists of 200K shape mating pairs with numerous object meshes and diverse cut types. We train NSM on the collected dataset and compare it with several point cloud registration methods and one part assembly baseline approach. Extensive experimental results and ablation studies under various settings demonstrate the effectiveness of the proposed algorithm. Additional material is available at: neural-shape-mating.github.io.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Learning to autonomously assemble shapes is a crucial skill for many robotic applications. While the majority of existing part assembly methods focus on correctly posing semantic parts to recreate a whole object, we interpret assembly more literally: as mating geometric parts together to achieve a snug fit. By focusing on shape alignment rather than semantic cues, we can achieve across category generalization and scaling. In this paper, we introduce a novel task, pairwise 3D geometric shape mating, and propose Neural Shape Mating (NSM) to tackle this problem. Given point clouds of two object parts of an unknown category, NSM learns to reason about the fit of the two parts and predict a pair of 3D poses that tightly mate them together. In addition, we couple the training of NSM with an implicit shape reconstruction task, making NSM more robust to imperfect point cloud observations. To train NSM, we present a self-supervised data collection pipeline that generates pairwise shape mating data with ground truth by randomly cutting an object mesh into two parts, resulting in a dataset that consists of 200K shape mating pairs with numerous object meshes and diverse cut types. We train NSM on the collected dataset and compare it with several point cloud registration methods and one part assembly baseline approach. Extensive experimental results and ablation studies under various settings demonstrate the effectiveness of the proposed algorithm. Additional material is available at: neural-shape-mating.github.io.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Learning to autonomously assemble shapes is a crucial skill for many robotic applications. While the majority of existing part assembly methods focus on correctly posing semantic parts to recreate a whole object, we interpret assembly more literally: as mating geometric parts together to achieve a snug fit. By focusing on shape alignment rather than semantic cues, we can achieve across category generalization and scaling. In this paper, we introduce a novel task, pairwise 3D geometric shape mating, and propose Neural Shape Mating (NSM) to tackle this problem. Given point clouds of two object parts of an unknown category, NSM learns to reason about the fit of the two parts and predict a pair of 3D poses that tightly mate them together. In addition, we couple the training of NSM with an implicit shape reconstruction task, making NSM more robust to imperfect point cloud observations. To train NSM, we present a self-supervised data collection pipeline that generates pairwise shape mating data with ground truth by randomly cutting an object mesh into two parts, resulting in a dataset that consists of 200K shape mating pairs with numerous object meshes and diverse cut types. We train NSM on the collected dataset and compare it with several point cloud registration methods and one part assembly baseline approach. Extensive experimental results and ablation studies under various settings demonstrate the effectiveness of the proposed algorithm. Additional material is available at: neural-shape-mating.github.io.",
"fno": "694600m2714",
"keywords": [
"Geometry",
"Image Reconstruction",
"Image Registration",
"Image Segmentation",
"Learning Artificial Intelligence",
"Neural Nets",
"Object Detection",
"Pose Estimation",
"Shape Recognition",
"Stereo Image Processing",
"Self Supervised Object Assembly",
"Autonomously Assemble Shapes",
"Part Assembly",
"Semantic Parts",
"Geometric Parts",
"Shape Alignment",
"Category Generalization",
"NSM",
"Point Clouds",
"Shape Reconstruction",
"Self Supervised Data Collection",
"Point Cloud Registration",
"Neural Shape Mating",
"Adversarial Shape Priors",
"3 D Geometric Shape Mating",
"Point Cloud Compression",
"Training",
"Surface Reconstruction",
"Three Dimensional Displays",
"Shape",
"Semantics",
"Pipelines"
],
"authors": [
{
"affiliation": "University of Toronto",
"fullName": "Yun-Chun Chen",
"givenName": "Yun-Chun",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Toronto",
"fullName": "Haoda Li",
"givenName": "Haoda",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Toronto",
"fullName": "Dylan Turpin",
"givenName": "Dylan",
"surname": "Turpin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Toronto",
"fullName": "Alec Jacobson",
"givenName": "Alec",
"surname": "Jacobson",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Toronto",
"fullName": "Animesh Garg",
"givenName": "Animesh",
"surname": "Garg",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "12714-12723",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "694600m2703",
"articleId": "1H1l4vBZwac",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600m2724",
"articleId": "1H1mm9tpSjC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/robot/1992/2720/0/00220172",
"title": "A shape metric for design-for-assembly",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220172/12OmNrJ11Am",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1989/1938/0/00099992",
"title": "Precedence knowledge in feature mating operation assembly planning",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1989/00099992/12OmNrMZpmC",
"parentPublication": {
"id": "proceedings/robot/1989/1938/0",
"title": "1989 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00220109",
"title": "Mating constraint languages for assembly sequence planning",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220109/12OmNvF83pz",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iros/1995/7108/2/71082298",
"title": "Dynamic simulation of assembly processes",
"doi": null,
"abstractUrl": "/proceedings-article/iros/1995/71082298/12OmNvrdI2H",
"parentPublication": {
"id": "proceedings/iros/1995/7108/2",
"title": "Intelligent Robots and Systems, IEEE/RSJ International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isatp/1995/6995/0/69950381",
"title": "A neural network-based assembly algorithm for chamferless parts mating",
"doi": null,
"abstractUrl": "/proceedings-article/isatp/1995/69950381/12OmNwMXnpp",
"parentPublication": {
"id": "proceedings/isatp/1995/6995/0",
"title": "Assembly and Task Planning, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118a652",
"title": "Class Specific 3D Object Shape Priors Using Surface Normals",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118a652/12OmNyKrH53",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1991/2163/0/00131913",
"title": "Motion planning for assembly mating operations",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1991/00131913/12OmNzX6csp",
"parentPublication": {
"id": "proceedings/robot/1991/2163/0",
"title": "Proceedings. 1991 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200i362",
"title": "Shape Self-Correction for Unsupervised Point Cloud Understanding",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200i362/1BmHIjinjWw",
"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/10093999",
"title": "ANISE: Assembly-based Neural Implicit Surface rEconstruction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10093999/1M80HueHnJS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2020/8128/0/812800a061",
"title": "COALESCE: Component Assembly by Learning to Synthesize Connections",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2020/812800a061/1qyxpkByam4",
"parentPublication": {
"id": "proceedings/3dv/2020/8128/0",
"title": "2020 International Conference on 3D Vision (3DV)",
"__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": "1H0LoryuKRy",
"doi": "10.1109/CVPR52688.2022.00617",
"title": "Critical Regularizations for Neural Surface Reconstruction in the Wild",
"normalizedTitle": "Critical Regularizations for Neural Surface Reconstruction in the Wild",
"abstract": "Neural implicit functions have recently shown promising results on surface reconstructions from multiple views. However, current methods still suffer from excessive time complexity and poor robustness when reconstructing unbounded or complex scenes. In this paper, we present RegSDF, which shows that proper point cloud supervisions and geometry regularizations are sufficient to produce high-quality and robust reconstruction results. Specifically, RegSDF takes an additional oriented point cloud as input, and optimizes a signed distance field and a surface light field within a differentiable rendering framework. We also introduce the two critical regularizations for this optimization. The first one is the Hessian regularization that smoothly diffuses the signed distance values to the entire distance field given noisy and incomplete input. And the second one is the minimal surface regularization that compactly interpolates and extrapolates the missing geometry. Extensive experiments are conducted on DTU, Blended-MVS, and Tanks and Temples datasets. Compared with recent neural surface reconstruction approaches, RegSDF is able to reconstruct surfaces with fine details even for open scenes with complex topologies and unstructured camera trajectories.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Neural implicit functions have recently shown promising results on surface reconstructions from multiple views. However, current methods still suffer from excessive time complexity and poor robustness when reconstructing unbounded or complex scenes. In this paper, we present RegSDF, which shows that proper point cloud supervisions and geometry regularizations are sufficient to produce high-quality and robust reconstruction results. Specifically, RegSDF takes an additional oriented point cloud as input, and optimizes a signed distance field and a surface light field within a differentiable rendering framework. We also introduce the two critical regularizations for this optimization. The first one is the Hessian regularization that smoothly diffuses the signed distance values to the entire distance field given noisy and incomplete input. And the second one is the minimal surface regularization that compactly interpolates and extrapolates the missing geometry. Extensive experiments are conducted on DTU, Blended-MVS, and Tanks and Temples datasets. Compared with recent neural surface reconstruction approaches, RegSDF is able to reconstruct surfaces with fine details even for open scenes with complex topologies and unstructured camera trajectories.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Neural implicit functions have recently shown promising results on surface reconstructions from multiple views. However, current methods still suffer from excessive time complexity and poor robustness when reconstructing unbounded or complex scenes. In this paper, we present RegSDF, which shows that proper point cloud supervisions and geometry regularizations are sufficient to produce high-quality and robust reconstruction results. Specifically, RegSDF takes an additional oriented point cloud as input, and optimizes a signed distance field and a surface light field within a differentiable rendering framework. We also introduce the two critical regularizations for this optimization. The first one is the Hessian regularization that smoothly diffuses the signed distance values to the entire distance field given noisy and incomplete input. And the second one is the minimal surface regularization that compactly interpolates and extrapolates the missing geometry. Extensive experiments are conducted on DTU, Blended-MVS, and Tanks and Temples datasets. Compared with recent neural surface reconstruction approaches, RegSDF is able to reconstruct surfaces with fine details even for open scenes with complex topologies and unstructured camera trajectories.",
"fno": "694600g260",
"keywords": [
"Cameras",
"Computational Geometry",
"Geometry",
"Image Reconstruction",
"Interpolation",
"Rendering Computer Graphics",
"Solid Modelling",
"Surface Reconstruction",
"Critical Regularizations",
"Neural Implicit Functions",
"Surface Reconstructions",
"Excessive Time Complexity",
"Reconstructing Unbounded Scenes",
"Complex Scenes",
"Reg SDF",
"Proper Point Cloud Supervisions",
"Geometry Regularizations",
"Robust Reconstruction Results",
"Additional Oriented Point Cloud",
"Signed Distance Field",
"Surface Light Field",
"Differentiable Rendering Framework",
"Hessian Regularization",
"Signed Distance Values",
"Entire Distance Field",
"Noisy Input",
"Incomplete Input",
"Minimal Surface Regularization",
"Missing Geometry",
"Recent Neural Surface Reconstruction Approaches",
"Complex Topologies",
"Point Cloud Compression",
"Geometry",
"Surface Reconstruction",
"Three Dimensional Displays",
"Surface Fitting",
"Robustness",
"Trajectory"
],
"authors": [
{
"affiliation": "The Hong Kong University of Science and Technology",
"fullName": "Jingyang Zhang",
"givenName": "Jingyang",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Apple",
"fullName": "Yao Yao",
"givenName": "Yao",
"surname": "Yao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Apple",
"fullName": "Shiwei Li",
"givenName": "Shiwei",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Apple",
"fullName": "Tian Fang",
"givenName": "Tian",
"surname": "Fang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Apple",
"fullName": "David McKinnon",
"givenName": "David",
"surname": "McKinnon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Apple",
"fullName": "Yanghai Tsin",
"givenName": "Yanghai",
"surname": "Tsin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Apple",
"fullName": "Long Quan",
"givenName": "Long",
"surname": "Quan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "6260-6269",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1H0LonT83FS",
"name": "pcvpr202269460-09878598s1-mm_694600g260.zip",
"size": "7.69 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202269460-09878598s1-mm_694600g260.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "694600g250",
"articleId": "1H0N3OBaGCA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600g270",
"articleId": "1H0MXW1GTN6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2003/2030/0/20300013",
"title": "Piecewise C1 Continuous Surface Reconstruction of Noisy Point Clouds via Local Implicit Quadric Regression",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300013/12OmNApcukc",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1989/1952/0/00037854",
"title": "Discontinuity preserving surface reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1989/00037854/12OmNyPQ4Q6",
"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/2007/05/v0878",
"title": "Design and Analysis of Optimization Methods for Subdivision Surface Fitting",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0878/13rRUxcKzVf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200g505",
"title": "Learning Signed Distance Field for Multi-view Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g505/1BmFLjuiAKs",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200k0438",
"title": "Temporally-Coherent Surface Reconstruction via Metric-Consistent Atlases",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200k0438/1BmGZjgvrDW",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g316",
"title": "Surface Reconstruction from Point Clouds by Learning Predictive Context Priors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g316/1H1i9njU6l2",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g305",
"title": "Reconstructing Surfaces for Sparse Point Clouds with On-Surface Priors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g305/1H1jpDpUMPS",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/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/2019/3293/0/329300k0122",
"title": "Deep Geometric Prior for Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2019/329300k0122/1gyrJvG8Kt2",
"parentPublication": {
"id": "proceedings/cvpr/2019/3293/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmcce/2019/4689/0/468900a405",
"title": "Comparative Study of BP Neural Network and RBF Neural Network in Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/icmcce/2019/468900a405/1h0FblspsVG",
"parentPublication": {
"id": "proceedings/icmcce/2019/4689/0",
"title": "2019 4th International Conference on Mechanical, Control and Computer Engineering (ICMCCE)",
"__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": "1H0MXW1GTN6",
"doi": "10.1109/CVPR52688.2022.00618",
"title": "Gradient-SDF: A Semi-Implicit Surface Representation for 3D Reconstruction",
"normalizedTitle": "Gradient-SDF: A Semi-Implicit Surface Representation for 3D Reconstruction",
"abstract": "We present Gradient-SDF, a novel representation for 3D geometry that combines the advantages of implict and explicit representations. By storing at every voxel both the signed distance field as well as its gradient vector field, we enhance the capability of implicit representations with approaches originally formulated for explicit surfaces. As concrete examples, we show that (1) the Gradient-SDF allows us to perform direct SDF tracking from depth images, using efficient storage schemes like hash maps, and that (2) the Gradient-SDF representation enables us to perform photometric bundle adjustment directly in a voxel representation (without transforming into a point cloud or mesh), naturally a fully implicit optimization of geometry and camera poses and easy geometry upsampling. Experimental results confirm that this leads to significantly sharper reconstructions. Since the overall SDF voxel structure is still respected, the proposed Gradient-SDF is equally suited for (GPU) parallelization as related approaches.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present Gradient-SDF, a novel representation for 3D geometry that combines the advantages of implict and explicit representations. By storing at every voxel both the signed distance field as well as its gradient vector field, we enhance the capability of implicit representations with approaches originally formulated for explicit surfaces. As concrete examples, we show that (1) the Gradient-SDF allows us to perform direct SDF tracking from depth images, using efficient storage schemes like hash maps, and that (2) the Gradient-SDF representation enables us to perform photometric bundle adjustment directly in a voxel representation (without transforming into a point cloud or mesh), naturally a fully implicit optimization of geometry and camera poses and easy geometry upsampling. Experimental results confirm that this leads to significantly sharper reconstructions. Since the overall SDF voxel structure is still respected, the proposed Gradient-SDF is equally suited for (GPU) parallelization as related approaches.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present Gradient-SDF, a novel representation for 3D geometry that combines the advantages of implict and explicit representations. By storing at every voxel both the signed distance field as well as its gradient vector field, we enhance the capability of implicit representations with approaches originally formulated for explicit surfaces. As concrete examples, we show that (1) the Gradient-SDF allows us to perform direct SDF tracking from depth images, using efficient storage schemes like hash maps, and that (2) the Gradient-SDF representation enables us to perform photometric bundle adjustment directly in a voxel representation (without transforming into a point cloud or mesh), naturally a fully implicit optimization of geometry and camera poses and easy geometry upsampling. Experimental results confirm that this leads to significantly sharper reconstructions. Since the overall SDF voxel structure is still respected, the proposed Gradient-SDF is equally suited for (GPU) parallelization as related approaches.",
"fno": "694600g270",
"keywords": [
"Computational Geometry",
"Gradient Methods",
"Image Reconstruction",
"Image Representation",
"Medical Image Processing",
"Solid Modelling",
"Vectors",
"Semiimplicit Surface Representation",
"Explicit Representations",
"Signed Distance Field",
"Gradient Vector Field",
"Implicit Representations",
"Explicit Surfaces",
"Direct SDF",
"Gradient SDF Representation",
"Voxel Representation",
"SDF Voxel Structure",
"Geometry",
"Bundle Adjustment",
"Point Cloud Compression",
"Surface Reconstruction",
"Pose Estimation",
"Sensors",
"Pattern Recognition"
],
"authors": [
{
"affiliation": "Technical University of Munich,Computer Vision Group",
"fullName": "Christiane Sommer",
"givenName": "Christiane",
"surname": "Sommer",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technical University of Munich,Computer Vision Group",
"fullName": "Lu Sang",
"givenName": "Lu",
"surname": "Sang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technical University of Munich,Computer Vision Group",
"fullName": "David Schubert",
"givenName": "David",
"surname": "Schubert",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technical University of Munich,Computer Vision Group",
"fullName": "Daniel Cremers",
"givenName": "Daniel",
"surname": "Cremers",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "6270-6279",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1H0MXRZCicg",
"name": "pcvpr202269460-09879252s1-mm_694600g270.zip",
"size": "10.4 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202269460-09879252s1-mm_694600g270.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "694600g260",
"articleId": "1H0LoryuKRy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600g280",
"articleId": "1H0O2AVymha",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/3dim/2003/1991/0/19910410",
"title": "Taking Consensus of Signed Distance Field for Complementing Unobservable Surface",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2003/19910410/12OmNwIHoCr",
"parentPublication": {
"id": "proceedings/3dim/2003/1991/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09736452",
"title": "WSDesc: Weakly Supervised 3D Local Descriptor Learning for Point Cloud Registration",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09736452/1BN1Ujkoysg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200m2981",
"title": "A-SDF: Learning Disentangled Signed Distance Functions for Articulated Shape Representation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2981/1BmL8RNtcbu",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600s8644",
"title": "DeepCurrents: Learning Implicit Representations of Shapes with Boundaries",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600s8644/1H1hvx4136E",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09969571",
"title": "Vox-Surf: Voxel-Based Implicit Surface Representation",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09969571/1IMidH7hZhC",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2022/5670/0/567000a433",
"title": "GO-Surf: Neural Feature Grid Optimization for Fast, High-Fidelity RGB-D Surface Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2022/567000a433/1KYso11QHx6",
"parentPublication": {
"id": "proceedings/3dv/2022/5670/0",
"title": "2022 International Conference on 3D Vision (3DV)",
"__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/wacv/2023/9346/0/934600d105",
"title": "High-Quality RGB-D Reconstruction via Multi-View Uncalibrated Photometric Stereo and Gradient-SDF",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600d105/1KxVaVLkeLS",
"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/tg/5555/01/10093999",
"title": "ANISE: Assembly-based Neural Implicit Surface rEconstruction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10093999/1M80HueHnJS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100c110",
"title": "3D Shapes Local Geometry Codes Learning with SDF",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100c110/1yNi23FEXja",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1hQqfuoOyHu",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1hVlBZYxMe4",
"doi": "10.1109/ICCV.2019.00484",
"title": "Implicit Surface Representations As Layers in Neural Networks",
"normalizedTitle": "Implicit Surface Representations As Layers in Neural Networks",
"abstract": "Implicit shape representations, such as Level Sets, provide a very elegant formulation for performing computations involving curves and surfaces. However, including implicit representations into canonical Neural Network formulations is far from straightforward. This has consequently restricted existing approaches to shape inference, to significantly less effective representations, perhaps most commonly voxels occupancy maps or sparse point clouds. To overcome this limitation we propose a novel formulation that permits the use of implicit representations of curves and surfaces, of arbitrary topology, as individual layers in Neural Network architectures with end-to-end trainability. Specifically, we propose to represent the output as an oriented level set of a continuous and discretised embedding function. We investigate the benefits of our approach on the task of 3D shape prediction from a single image; and demonstrate its ability to produce a more accurate reconstruction compared to voxel-based representations. We further show that our model is flexible and can be applied to a variety of shape inference problems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Implicit shape representations, such as Level Sets, provide a very elegant formulation for performing computations involving curves and surfaces. However, including implicit representations into canonical Neural Network formulations is far from straightforward. This has consequently restricted existing approaches to shape inference, to significantly less effective representations, perhaps most commonly voxels occupancy maps or sparse point clouds. To overcome this limitation we propose a novel formulation that permits the use of implicit representations of curves and surfaces, of arbitrary topology, as individual layers in Neural Network architectures with end-to-end trainability. Specifically, we propose to represent the output as an oriented level set of a continuous and discretised embedding function. We investigate the benefits of our approach on the task of 3D shape prediction from a single image; and demonstrate its ability to produce a more accurate reconstruction compared to voxel-based representations. We further show that our model is flexible and can be applied to a variety of shape inference problems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Implicit shape representations, such as Level Sets, provide a very elegant formulation for performing computations involving curves and surfaces. However, including implicit representations into canonical Neural Network formulations is far from straightforward. This has consequently restricted existing approaches to shape inference, to significantly less effective representations, perhaps most commonly voxels occupancy maps or sparse point clouds. To overcome this limitation we propose a novel formulation that permits the use of implicit representations of curves and surfaces, of arbitrary topology, as individual layers in Neural Network architectures with end-to-end trainability. Specifically, we propose to represent the output as an oriented level set of a continuous and discretised embedding function. We investigate the benefits of our approach on the task of 3D shape prediction from a single image; and demonstrate its ability to produce a more accurate reconstruction compared to voxel-based representations. We further show that our model is flexible and can be applied to a variety of shape inference problems.",
"fno": "480300e742",
"keywords": [
"Image Reconstruction",
"Image Representation",
"Neural Net Architecture",
"Implicit Surface Representations",
"Implicit Shape Representations",
"Sparse Point Clouds",
"Neural Network Architectures",
"Oriented Level Set",
"3 D Shape Prediction",
"Shape Inference Problems",
"Canonical Neural Network Formulations",
"Voxel Occupancy Maps",
"Three Dimensional Displays",
"Shape",
"Level Set",
"Image Reconstruction",
"Neural Networks",
"Computer Architecture",
"Geometry"
],
"authors": [
{
"affiliation": "Queensland University of Technology",
"fullName": "Mateusz Michalkiewicz",
"givenName": "Mateusz",
"surname": "Michalkiewicz",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Queensland University of Technology",
"fullName": "Jhony Kaesemodel Pontes",
"givenName": "Jhony Kaesemodel",
"surname": "Pontes",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Queensland University of Technology",
"fullName": "Dominic Jack",
"givenName": "Dominic",
"surname": "Jack",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Queensland",
"fullName": "Mahsa Baktashmotlagh",
"givenName": "Mahsa",
"surname": "Baktashmotlagh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Queensland",
"fullName": "Anders Eriksson",
"givenName": "Anders",
"surname": "Eriksson",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-10-01T00:00:00",
"pubType": "proceedings",
"pages": "4742-4751",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-4803-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "480300e732",
"articleId": "1hVlCCRAB44",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "480300e752",
"articleId": "1hQqwulZIvC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/smi/2010/7259/0/05521459",
"title": "Ridge Extraction from Isosurfaces of Volumetric Data Using Implicit B-Splines",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2010/05521459/12OmNxE2n2x",
"parentPublication": {
"id": "proceedings/smi/2010/7259/0",
"title": "Shape Modeling International (SMI 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1993/01/mcg1993010079",
"title": "Implicit Curves and Surfaces in CAGD",
"doi": null,
"abstractUrl": "/magazine/cg/1993/01/mcg1993010079/13rRUxBrGk3",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600s8644",
"title": "DeepCurrents: Learning Implicit Representations of Shapes with Boundaries",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600s8644/1H1hvx4136E",
"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": "trans/tg/5555/01/10093999",
"title": "ANISE: Assembly-based Neural Implicit Surface rEconstruction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10093999/1M80HueHnJS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/1/01699024",
"title": "Geodesic Curves for Analysis of Continuous Implicit Shapes",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/01699024/1b66l9Meuwo",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800g000",
"title": "Local Implicit Grid Representations for 3D Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800g000/1m3nLq7oRiw",
"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/2021/4509/0/450900k0251",
"title": "Sign-Agnostic Implicit Learning of Surface Self-Similarities for Shape Modeling and Reconstruction from Raw Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0251/1yeKyfpjmFy",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2021/2354/0/235400a017",
"title": "Neural Networks for Implicit Representations of 3D Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2021/235400a017/1zurtEgv09a",
"parentPublication": {
"id": "proceedings/sibgrapi/2021/2354/0",
"title": "2021 34th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1zWE36wtuCY",
"title": "2021 International Conference on 3D Vision (3DV)",
"acronym": "3dv",
"groupId": "1800494",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1zWEcdiPXxK",
"doi": "10.1109/3DV53792.2021.00133",
"title": "Neighborhood-based Neural Implicit Reconstruction from Point Clouds",
"normalizedTitle": "Neighborhood-based Neural Implicit Reconstruction from Point Clouds",
"abstract": "Neural implicit reconstruction is emerging as a promising approach to constructing 3D geometry from point clouds due to its ability to model geometry with complicated topology and unrestricted resolution. Current methods in this category usually deliver smooth and good quality results, but suffer from defective details and generalization issues. The major reason is that these methods use either a global code or interpolated feature on 3D grids of limited resolution to estimate implicit surface, therefore may cause distortion in feature discretization. This paper presents a neighborhood-aware neural implicit reconstruction framework that consists of an encoder network, a feature aggregation module, and a decoder network to learn implicit surface. The method can easily incorporate an off-the-shelf 3D point-based or volume-based neural network as an encoder. At the heart of our framework is the aggregation module that fuses the learnt contextual features on neighbor inputs so that the method can directly exploit local features of neighboring inputs for geometry detail recovery as well as cross-domain generalization. Experimental results demonstrate that our method significantly outperforms the state-of-the-art methods (about 4.0 points IoU improvements in ShapeNet dataset and 9.0 points IoU improvements in DFAUST dataset). Furthermore, our method preserves finer shape details and can be successfully transferred to a novel category without fine-tuning.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Neural implicit reconstruction is emerging as a promising approach to constructing 3D geometry from point clouds due to its ability to model geometry with complicated topology and unrestricted resolution. Current methods in this category usually deliver smooth and good quality results, but suffer from defective details and generalization issues. The major reason is that these methods use either a global code or interpolated feature on 3D grids of limited resolution to estimate implicit surface, therefore may cause distortion in feature discretization. This paper presents a neighborhood-aware neural implicit reconstruction framework that consists of an encoder network, a feature aggregation module, and a decoder network to learn implicit surface. The method can easily incorporate an off-the-shelf 3D point-based or volume-based neural network as an encoder. At the heart of our framework is the aggregation module that fuses the learnt contextual features on neighbor inputs so that the method can directly exploit local features of neighboring inputs for geometry detail recovery as well as cross-domain generalization. Experimental results demonstrate that our method significantly outperforms the state-of-the-art methods (about 4.0 points IoU improvements in ShapeNet dataset and 9.0 points IoU improvements in DFAUST dataset). Furthermore, our method preserves finer shape details and can be successfully transferred to a novel category without fine-tuning.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Neural implicit reconstruction is emerging as a promising approach to constructing 3D geometry from point clouds due to its ability to model geometry with complicated topology and unrestricted resolution. Current methods in this category usually deliver smooth and good quality results, but suffer from defective details and generalization issues. The major reason is that these methods use either a global code or interpolated feature on 3D grids of limited resolution to estimate implicit surface, therefore may cause distortion in feature discretization. This paper presents a neighborhood-aware neural implicit reconstruction framework that consists of an encoder network, a feature aggregation module, and a decoder network to learn implicit surface. The method can easily incorporate an off-the-shelf 3D point-based or volume-based neural network as an encoder. At the heart of our framework is the aggregation module that fuses the learnt contextual features on neighbor inputs so that the method can directly exploit local features of neighboring inputs for geometry detail recovery as well as cross-domain generalization. Experimental results demonstrate that our method significantly outperforms the state-of-the-art methods (about 4.0 points IoU improvements in ShapeNet dataset and 9.0 points IoU improvements in DFAUST dataset). Furthermore, our method preserves finer shape details and can be successfully transferred to a novel category without fine-tuning.",
"fno": "268800b259",
"keywords": [
"Feature Extraction",
"Geometry",
"Image Reconstruction",
"Interpolation",
"Neural Nets",
"Interpolated Feature",
"Implicit Surface",
"Feature Discretization",
"Encoder Network",
"Feature Aggregation",
"Cross Domain Generalization",
"Neighborhood Based Neural Implicit Reconstruction",
"Point Clouds",
"Neighborhood Aware Neural Implicit Reconstruction",
"Off The Shelf 3 D Point Based Neural Network",
"Volume Based Neural Network",
"Geometry",
"Point Cloud Compression",
"Surface Reconstruction",
"Solid Modeling",
"Three Dimensional Displays",
"Shape",
"Semantics",
"Implicit Surface",
"Point Cloud",
"3 D Reconstruction"
],
"authors": [
{
"affiliation": "University of Chinese Academy of Science",
"fullName": "Haiyong Jiang",
"givenName": "Haiyong",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Monash University",
"fullName": "Jianfei Cai",
"givenName": "Jianfei",
"surname": "Cai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nanyang Technological University",
"fullName": "Jianmin Zheng",
"givenName": "Jianmin",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Chinese Academy of Science",
"fullName": "Jun Xiao",
"givenName": "Jun",
"surname": "Xiao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "3dv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1259-1268",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-2688-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "268800b249",
"articleId": "1zWEkPrnaSI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "268800b269",
"articleId": "1zWEc53kN9u",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2021/2812/0/281200m2548",
"title": "RetrievalFuse: Neural 3D Scene Reconstruction with a Database",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2548/1BmJI0Lqlxe",
"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/281200n3067",
"title": "Multiresolution Deep Implicit Functions for 3D Shape Representation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200n3067/1BmL39Zkm9G",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g270",
"title": "Gradient-SDF: A Semi-Implicit Surface Representation for 3D Reconstruction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g270/1H0MXW1GTN6",
"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/09956356",
"title": "VASAD: a Volume and Semantic dataset for Building Reconstruction from Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956356/1IHqk8VxXY4",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar-adjunct/2022/5365/0/536500a216",
"title": "Automated Reconstruction of 3D Open Surfaces from Sparse Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/ismar-adjunct/2022/536500a216/1J7WhkwWdAA",
"parentPublication": {
"id": "proceedings/ismar-adjunct/2022/5365/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/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/wacv/2023/9346/0/934600f776",
"title": "PointNeuron: 3D Neuron Reconstruction via Geometry and Topology Learning of Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600f776/1KxUsxFsCfS",
"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/tg/5555/01/10093999",
"title": "ANISE: Assembly-based Neural Implicit Surface rEconstruction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10093999/1M80HueHnJS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900i928",
"title": "DI-Fusion: Online Implicit 3D Reconstruction with Deep Priors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900i928/1yeLpskgFXi",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800b054",
"title": "AIR-Nets: An Attention-Based Framework for Locally Conditioned Implicit Representations",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800b054/1zWEkt7SgUg",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1EmsKLtPkk0",
"title": "2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)",
"acronym": "formalise",
"groupId": "1802773",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1EmsMELzewM",
"doi": "10.1145/3524482.3527649",
"title": "Automatic Loop Invariant Generation for Data Dependence Analysis",
"normalizedTitle": "Automatic Loop Invariant Generation for Data Dependence Analysis",
"abstract": "Parallelization of programs relies on sound and precise analysis of data dependences in the code, specifically, when dealing with loops. State-of-art tools are based on dynamic profiling and static analysis. They tend to over- and, occasionally, to under-approximate dependences. The former misses parallelization opportunities, the latter can change the behavior of the parallelized program. In this paper we present a sound and highly precise approach to generate data dependences based on deductive verification. The central technique is to infer a specific form of loop invariant tailored to express dependences. To achieve full automation, we adapt predicate abstraction in a suitable manner. To retain as much precision as possible, we generalized logic-based symbolic execution to compute abstract dependence predicates. We implemented our approach for Java on top of a deductive verification tool. The evaluation shows that our approach can generate highly precise data dependences for representative code taken from HPC applications.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Parallelization of programs relies on sound and precise analysis of data dependences in the code, specifically, when dealing with loops. State-of-art tools are based on dynamic profiling and static analysis. They tend to over- and, occasionally, to under-approximate dependences. The former misses parallelization opportunities, the latter can change the behavior of the parallelized program. In this paper we present a sound and highly precise approach to generate data dependences based on deductive verification. The central technique is to infer a specific form of loop invariant tailored to express dependences. To achieve full automation, we adapt predicate abstraction in a suitable manner. To retain as much precision as possible, we generalized logic-based symbolic execution to compute abstract dependence predicates. We implemented our approach for Java on top of a deductive verification tool. The evaluation shows that our approach can generate highly precise data dependences for representative code taken from HPC applications.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Parallelization of programs relies on sound and precise analysis of data dependences in the code, specifically, when dealing with loops. State-of-art tools are based on dynamic profiling and static analysis. They tend to over- and, occasionally, to under-approximate dependences. The former misses parallelization opportunities, the latter can change the behavior of the parallelized program. In this paper we present a sound and highly precise approach to generate data dependences based on deductive verification. The central technique is to infer a specific form of loop invariant tailored to express dependences. To achieve full automation, we adapt predicate abstraction in a suitable manner. To retain as much precision as possible, we generalized logic-based symbolic execution to compute abstract dependence predicates. We implemented our approach for Java on top of a deductive verification tool. The evaluation shows that our approach can generate highly precise data dependences for representative code taken from HPC applications.",
"fno": "928700a034",
"keywords": [
"Java",
"Parallel Programming",
"Program Control Structures",
"Program Diagnostics",
"Program Verification",
"Automatic Loop Invariant Generation",
"Data Dependence Analysis",
"Dynamic Profiling",
"Static Analysis",
"Under Approximate Dependences",
"Parallelized Program",
"Logic Based Symbolic Execution",
"Abstract Dependence Predicates",
"Deductive Verification Tool",
"HPC Applications",
"Java",
"Codes",
"Automation",
"Static Analysis",
"Software",
"Behavioral Sciences",
"Parallel Algorithms",
"X 2022 Computing Methodologies X 2192 Massively Parallel Algorithms",
"X 2022 Software And Its Engineering X 2192 Software Verification Formal Software Verification",
"X 2022 Theory Of Computation X 2192 Programming Logic Abstraction Invariants"
],
"authors": [
{
"affiliation": "Technische Universität Darmstadt,Darmstadt,Germany",
"fullName": "Asmae Heydari Tabar",
"givenName": "Asmae Heydari",
"surname": "Tabar",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technische Universität Darmstadt,Darmstadt,Germany",
"fullName": "Richard Bubel",
"givenName": "Richard",
"surname": "Bubel",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Technische Universität Darmstadt,Darmstadt,Germany",
"fullName": "Reiner Hähnle",
"givenName": "Reiner",
"surname": "Hähnle",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "formalise",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-05-01T00:00:00",
"pubType": "proceedings",
"pages": "34-45",
"year": "2022",
"issn": null,
"isbn": "978-1-4503-9287-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "928700a023",
"articleId": "1EmsMorlEGI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "928700a046",
"articleId": "1EmsNerUQjC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isca/2014/4396/0/06853215",
"title": "HELIX-RC: An architecture-compiler co-design for automatic parallelization of irregular programs",
"doi": null,
"abstractUrl": "/proceedings-article/isca/2014/06853215/12OmNxWcH3z",
"parentPublication": {
"id": "proceedings/isca/2014/4396/0",
"title": "2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2018/2666/1/266601a304",
"title": "Loop Invariant Generation for Non-monotone Loop Structures",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2018/266601a304/144U9bx2KPs",
"parentPublication": {
"id": "proceedings/compsac/2018/2666/2",
"title": "2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse-seip/2022/9590/0/959000a221",
"title": "Record and Replay of Online Traffic for Microservices with Automatic Mocking Point Identification",
"doi": null,
"abstractUrl": "/proceedings-article/icse-seip/2022/959000a221/1EhseajOFDa",
"parentPublication": {
"id": "proceedings/icse-seip/2022/9590/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2022/9221/0/922100c031",
"title": "Static Stack-Preserving Intra-Procedural Slicing of WebAssembly Binaries",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2022/922100c031/1Emsnfw3HeE",
"parentPublication": {
"id": "proceedings/icse/2022/9221/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2022/9221/0/922100a774",
"title": "DrAsync: Identifying and Visualizing Anti-Patterns in Asynchronous JavaScript",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2022/922100a774/1EmsoTkF0Vq",
"parentPublication": {
"id": "proceedings/icse/2022/9221/0",
"title": "2022 IEEE/ACM 44th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sp/2022/1316/0/131600b101",
"title": "Wobfuscator: Obfuscating JavaScript Malware via Opportunistic Translation to WebAssembly",
"doi": null,
"abstractUrl": "/proceedings-article/sp/2022/131600b101/1FlQyPmYGIg",
"parentPublication": {
"id": "proceedings/sp/2022/1316/0/",
"title": "2022 IEEE Symposium on Security and Privacy (SP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/seaa/2022/6152/0/615200a116",
"title": "KennyRiMr: An Eclipse Plug-in to Improve Correctness of Rename Method Refactoring in Java",
"doi": null,
"abstractUrl": "/proceedings-article/seaa/2022/615200a116/1JZ5cj3yJW0",
"parentPublication": {
"id": "proceedings/seaa/2022/6152/0",
"title": "2022 48th Euromicro Conference on Software Engineering and Advanced Applications (SEAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/2023/04/09999050",
"title": "From Inheritance to Mockito: An Automatic Refactoring Approach",
"doi": null,
"abstractUrl": "/journal/ts/2023/04/09999050/1JqD8euc07e",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ts/5555/01/10035436",
"title": "Static Analysis of JNI Programs Via Binary Decompilation",
"doi": null,
"abstractUrl": "/journal/ts/5555/01/10035436/1Krcd1lxUvS",
"parentPublication": {
"id": "trans/ts",
"title": "IEEE Transactions on Software Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10097564",
"title": "A Visual Analytics Conceptual Framework for Explorable and Steerable Partial Dependence Analysis",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10097564/1M9lJyvWuoo",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1JF83RHXG9O",
"title": "2022 25th Euromicro Conference on Digital System Design (DSD)",
"acronym": "dsd",
"groupId": "9996588",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1JF8f4QsPDy",
"doi": "10.1109/DSD57027.2022.00064",
"title": "Partial Evaluation in Junction Trees",
"normalizedTitle": "Partial Evaluation in Junction Trees",
"abstract": "One prominent method to perform inference on probabilistic graphical models is the probability propagation in trees of clusters (PPTC) algorithm. In this paper, we demonstrate the use of partial evaluation, an established technique from the compiler domain, to improve the performance of online Bayesian inference using the PPTC algorithm in the context of observed evidence. We present a metaprogramming-based method to transform a base program into an optimized version by precomputing the static input at compile time while guaranteeing behavioral equivalence. We achieve an inference time reduction of 21% on average for the Promedas benchmark.",
"abstracts": [
{
"abstractType": "Regular",
"content": "One prominent method to perform inference on probabilistic graphical models is the probability propagation in trees of clusters (PPTC) algorithm. In this paper, we demonstrate the use of partial evaluation, an established technique from the compiler domain, to improve the performance of online Bayesian inference using the PPTC algorithm in the context of observed evidence. We present a metaprogramming-based method to transform a base program into an optimized version by precomputing the static input at compile time while guaranteeing behavioral equivalence. We achieve an inference time reduction of 21% on average for the Promedas benchmark.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "One prominent method to perform inference on probabilistic graphical models is the probability propagation in trees of clusters (PPTC) algorithm. In this paper, we demonstrate the use of partial evaluation, an established technique from the compiler domain, to improve the performance of online Bayesian inference using the PPTC algorithm in the context of observed evidence. We present a metaprogramming-based method to transform a base program into an optimized version by precomputing the static input at compile time while guaranteeing behavioral equivalence. We achieve an inference time reduction of 21% on average for the Promedas benchmark.",
"fno": "740400a429",
"keywords": [
"Bayes Methods",
"Belief Networks",
"Inference Mechanisms",
"Program Compilers",
"Trees Mathematics",
"Base Program",
"Cluster Algorithm",
"Compile Time",
"Compiler Domain",
"Inference Time Reduction",
"Junction Trees",
"Metaprogramming Based Method",
"Observed Evidence",
"Online Bayesian Inference",
"Partial Evaluation",
"PPTC Algorithm",
"Probabilistic Graphical Models",
"Probability Propagation",
"Promedas Benchmark",
"Clustering Algorithms",
"Transforms",
"Benchmark Testing",
"Performance Gain",
"Probabilistic Logic",
"Inference Algorithms",
"Behavioral Sciences",
"Junction Trees",
"Partial Evaluation",
"Bayesian Inference",
"Probabilistic Graphical Models",
"Message Passing"
],
"authors": [
{
"affiliation": "Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands",
"fullName": "Martin Roa Villescas",
"givenName": "Martin Roa",
"surname": "Villescas",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands",
"fullName": "Patrick W.A. Wijnings",
"givenName": "Patrick W.A.",
"surname": "Wijnings",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands",
"fullName": "Sander Stuijk",
"givenName": "Sander",
"surname": "Stuijk",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Eindhoven University of Technology,Department of Electrical Engineering,Eindhoven,The Netherlands",
"fullName": "Henk Corporaal",
"givenName": "Henk",
"surname": "Corporaal",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dsd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-08-01T00:00:00",
"pubType": "proceedings",
"pages": "429-437",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-7404-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "740400a423",
"articleId": "1JF89K0pxbq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "740400a438",
"articleId": "1JF8eXwRPMs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2001/1143/1/00937589",
"title": "Human tracking with mixtures of trees",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/00937589/12OmNvEyR9q",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/1",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2007/2909/3/290930706",
"title": "Hierarchical Junction Trees as the Secondary Structure for Inference in Bayesian Networks",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2007/290930706/12OmNy2ah1r",
"parentPublication": {
"id": "proceedings/snpd/2007/2909/3",
"title": "Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2010/4216/0/4216a143",
"title": "Distributed Evidence Propagation in Junction Trees",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2010/4216a143/12OmNy3RRyM",
"parentPublication": {
"id": "proceedings/sbac-pad/2010/4216/0",
"title": "Computer Architecture and High Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2009/3920/0/3920a581",
"title": "Heuristic Assignment of CPDs for Probabilistic Inference in Junction Trees",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2009/3920a581/12OmNy87QzR",
"parentPublication": {
"id": "proceedings/ictai/2009/3920/0",
"title": "2009 21st IEEE International Conference on Tools with Artificial Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccl/1988/0874/0/00013083",
"title": "Type inference by program transformation and partial evaluation",
"doi": null,
"abstractUrl": "/proceedings-article/iccl/1988/00013083/12OmNzzP5J1",
"parentPublication": {
"id": "proceedings/iccl/1988/0874/0",
"title": "Proceedings 1988 International Conference on Computer Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/nt/2005/05/01528503",
"title": "Algorithms for precomputing constrained widest paths and multicast trees",
"doi": null,
"abstractUrl": "/journal/nt/2005/05/01528503/13rRUxBa58y",
"parentPublication": {
"id": "trans/nt",
"title": "IEEE/ACM Transactions on Networking",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2012/07/ttd2012071169",
"title": "Distributed Evidence Propagation in Junction Trees on Clusters",
"doi": null,
"abstractUrl": "/journal/td/2012/07/ttd2012071169/13rRUxcbnGM",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2012/03/06143918",
"title": "Faster Mass Spectrometry-Based Protein Inference: Junction Trees Are More Efficient than Sampling and Marginalization by Enumeration",
"doi": null,
"abstractUrl": "/journal/tb/2012/03/06143918/13rRUy2YLRv",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2022/6497/0/649700a355",
"title": "CNNBooster: Accelerating CNN Inference with Latency-aware Channel Pruning for GPU",
"doi": null,
"abstractUrl": "/proceedings-article/ispa-bdcloud-socialcom-sustaincom/2022/649700a355/1LKwpZwIc2k",
"parentPublication": {
"id": "proceedings/ispa-bdcloud-socialcom-sustaincom/2022/6497/0",
"title": "2022 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2021/0898/0/089800a632",
"title": "Inferring Clauses and Formulas in Max-SAT",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2021/089800a632/1zw5XyHZf44",
"parentPublication": {
"id": "proceedings/ictai/2021/0898/0",
"title": "2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1tmhi3ly74c",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1tmjbQQPihO",
"doi": "10.1109/ICPR48806.2021.9412404",
"title": "Partial Monotone Dependence",
"normalizedTitle": "Partial Monotone Dependence",
"abstract": "We present a new measure of dependence suitable for time series forecasting: Partial Monotone Correlation (PMC) that generalizes Monotone Correlation. Unlike the Monotone Correlation, the new measure of dependence uses piecewise strictly monotone transformations that increase the value of the correlation coefficient. We explore its properties, its relationship with Monotone and Maximal Correlation, and present an algorithm that calculates it based on the Simultaneous Perturbation Stochastic Approximation method. We also demonstrate how to apply Partial Monotone Correlation for time series analysis and forecasting introducing Partial Monotone Autoregressive model (PMAR) of order 1. Its performance is then evaluated against the baseline of linear and nonlinear autoregressive models (AR, LSTAR) on 150 time series produced from 3 datasets: Yellow Taxi pickups, Citi Bike pickups, and Cellular Network hits. Overall, PMAR model outperforms the baseline with the average sMAPE of about 1.7-4% lower.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new measure of dependence suitable for time series forecasting: Partial Monotone Correlation (PMC) that generalizes Monotone Correlation. Unlike the Monotone Correlation, the new measure of dependence uses piecewise strictly monotone transformations that increase the value of the correlation coefficient. We explore its properties, its relationship with Monotone and Maximal Correlation, and present an algorithm that calculates it based on the Simultaneous Perturbation Stochastic Approximation method. We also demonstrate how to apply Partial Monotone Correlation for time series analysis and forecasting introducing Partial Monotone Autoregressive model (PMAR) of order 1. Its performance is then evaluated against the baseline of linear and nonlinear autoregressive models (AR, LSTAR) on 150 time series produced from 3 datasets: Yellow Taxi pickups, Citi Bike pickups, and Cellular Network hits. Overall, PMAR model outperforms the baseline with the average sMAPE of about 1.7-4% lower.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new measure of dependence suitable for time series forecasting: Partial Monotone Correlation (PMC) that generalizes Monotone Correlation. Unlike the Monotone Correlation, the new measure of dependence uses piecewise strictly monotone transformations that increase the value of the correlation coefficient. We explore its properties, its relationship with Monotone and Maximal Correlation, and present an algorithm that calculates it based on the Simultaneous Perturbation Stochastic Approximation method. We also demonstrate how to apply Partial Monotone Correlation for time series analysis and forecasting introducing Partial Monotone Autoregressive model (PMAR) of order 1. Its performance is then evaluated against the baseline of linear and nonlinear autoregressive models (AR, LSTAR) on 150 time series produced from 3 datasets: Yellow Taxi pickups, Citi Bike pickups, and Cellular Network hits. Overall, PMAR model outperforms the baseline with the average sMAPE of about 1.7-4% lower.",
"fno": "09412404",
"keywords": [
"Autoregressive Processes",
"Correlation Theory",
"Data Analysis",
"Forecasting Theory",
"Time Series",
"Time Series Forecasting",
"Correlation Coefficient",
"Maximal Correlation",
"Time Series Analysis",
"Partial Monotone Autoregressive Model",
"Partial Monotone Correlation",
"Partial Monotone Dependence",
"Piecewise Strictly Monotone Transformations",
"Simultaneous Perturbation Stochastic Approximation Method",
"PMAR",
"Nonlinear Autoregressive Models",
"Yellow Taxi Pickups",
"Citi Bike Pickups",
"Cellular Network Hits",
"Correlation Coefficient",
"Cellular Networks",
"Correlation",
"Time Series Analysis",
"Stochastic Processes",
"Predictive Models",
"Time Measurement"
],
"authors": [
{
"affiliation": "The Graduate Center, City University of New York,New York,NY,10016",
"fullName": "Denis A. Khryashchev",
"givenName": "Denis A.",
"surname": "Khryashchev",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The City College of New York, City University of New York,New York,NY,10031",
"fullName": "Huy T. Vo",
"givenName": "Huy T.",
"surname": "Vo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The Graduate Center, City University of New York,New York,NY,10016",
"fullName": "Robert M. Haralick",
"givenName": "Robert M.",
"surname": "Haralick",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-01-01T00:00:00",
"pubType": "proceedings",
"pages": "6375-6382",
"year": "2021",
"issn": "1051-4651",
"isbn": "978-1-7281-8808-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09412134",
"articleId": "1tmi4rkl4fm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09412533",
"articleId": "1tmhRpXKLi8",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ihmsc/2010/4151/1/4151a321",
"title": "A Revised Approach to Detect Time Series Correlation",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2010/4151a321/12OmNBKW9vs",
"parentPublication": {
"id": "proceedings/ihmsc/2010/4151/1",
"title": "Intelligent Human-Machine Systems and Cybernetics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/1999/0071/0/00710106",
"title": "Efficient Mining of Partial Periodic Patterns in Time Series Database",
"doi": null,
"abstractUrl": "/proceedings-article/icde/1999/00710106/12OmNBOllnA",
"parentPublication": {
"id": "proceedings/icde/1999/0071/0",
"title": "Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisis/2012/4687/0/4687a567",
"title": "Exploration of Cellular Relationships from Characteristically Expressed Genes by Partial Canonical Correlation Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/cisis/2012/4687a567/12OmNrK9q5r",
"parentPublication": {
"id": "proceedings/cisis/2012/4687/0",
"title": "2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2013/1309/0/06732482",
"title": "Reconstructing biological networks using low order partial correlation",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2013/06732482/12OmNs59K3T",
"parentPublication": {
"id": "proceedings/bibm/2013/1309/0",
"title": "2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2013/5004/0/5004a076",
"title": "Using Seasonal Time Series Analysis to Predict China's Demand of Electricity",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2013/5004a076/12OmNynJMIW",
"parentPublication": {
"id": "proceedings/iccis/2013/5004/0",
"title": "2013 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isdea/2010/4212/1/4212a980",
"title": "Network Traffic Prediction and Result Analysis Based on Seasonal ARIMA and Correlation Coefficient",
"doi": null,
"abstractUrl": "/proceedings-article/isdea/2010/4212a980/12OmNz2TCBc",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2015/9504/0/9504a111",
"title": "Exceptionally Monotone Models -- The Rank Correlation Model Class for Exceptional Model Mining",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2015/9504a111/12OmNzyp5Xr",
"parentPublication": {
"id": "proceedings/icdm/2015/9504/0",
"title": "2015 IEEE International Conference on Data Mining (ICDM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2018/5520/0/552000b320",
"title": "A Novel Framework for Constructing Partially Monotone Rule Ensembles",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2018/552000b320/14Fq0VFPGaB",
"parentPublication": {
"id": "proceedings/icde/2018/5520/0",
"title": "2018 IEEE 34th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2021/5841/0/584100a026",
"title": "ConvGRU-TSNet: A Novel Deep Learning Approach for Multivariate Time Series Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2021/584100a026/1EpLxmbRI9q",
"parentPublication": {
"id": "proceedings/csci/2021/5841/0",
"title": "2021 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccst/2021/4254/0/425400a299",
"title": "A Dynamic Classification Method of Time-Series Data Based on Multidimensional Shapelets",
"doi": null,
"abstractUrl": "/proceedings-article/iccst/2021/425400a299/1ziPo8Jcb3G",
"parentPublication": {
"id": "proceedings/iccst/2021/4254/0",
"title": "2021 International Conference on Culture-oriented Science & Technology (ICCST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1ANLPXZs74s",
"title": "2022 International Seminar on Computer Science and Engineering Technology (SCSET)",
"acronym": "scset",
"groupId": "1845604",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1ANLYaE40qk",
"doi": "10.1109/SCSET55041.2022.00030",
"title": "Noise removal algorithm based on point cloud classification",
"normalizedTitle": "Noise removal algorithm based on point cloud classification",
"abstract": "The point cloud data obtained by 3D scanning equipment inevitably has noise. To remove the noise, we propose a point cloud denoising method. In this experiment, according to the characteristics of noise, noise is divided into two types: large-scale and small-scale. Then to remove large scale noise, we use statistical and radius filtering. For smallscale noise dividing point cloud into patches and each patch is fitted into a surface, thus converted into similarity cloud learning and the removal of surface noise is formulated as a convex optimization problem. Experimental results show that the proposed method is superior to the competing method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The point cloud data obtained by 3D scanning equipment inevitably has noise. To remove the noise, we propose a point cloud denoising method. In this experiment, according to the characteristics of noise, noise is divided into two types: large-scale and small-scale. Then to remove large scale noise, we use statistical and radius filtering. For smallscale noise dividing point cloud into patches and each patch is fitted into a surface, thus converted into similarity cloud learning and the removal of surface noise is formulated as a convex optimization problem. Experimental results show that the proposed method is superior to the competing method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The point cloud data obtained by 3D scanning equipment inevitably has noise. To remove the noise, we propose a point cloud denoising method. In this experiment, according to the characteristics of noise, noise is divided into two types: large-scale and small-scale. Then to remove large scale noise, we use statistical and radius filtering. For smallscale noise dividing point cloud into patches and each patch is fitted into a surface, thus converted into similarity cloud learning and the removal of surface noise is formulated as a convex optimization problem. Experimental results show that the proposed method is superior to the competing method.",
"fno": "787600a093",
"keywords": [
"Computer Graphics",
"Convex Programming",
"Image Classification",
"Image Denoising",
"Learning Artificial Intelligence",
"Statistical Analysis",
"Noise Removal Algorithm",
"Point Cloud Classification",
"Point Cloud Data",
"3 D Scanning Equipment",
"Point Cloud Denoising Method",
"Statistical Filtering",
"Radius Filtering",
"Similarity Cloud Learning",
"Small Scale Noise Dividing Point Cloud",
"Convex Optimization Problem",
"Surface Noise Removal",
"Point Cloud Compression",
"Seminars",
"Computer Science",
"Solid Modeling",
"Three Dimensional Displays",
"Filtering",
"Computational Modeling",
"Point Cloud Denoising",
"Noise Classification",
"Small Scale",
"Large Scale",
"Feature Graph Learning"
],
"authors": [
{
"affiliation": "Yangzhou University,School of Information Engineering,Yangzhou,China",
"fullName": "Hengyan Zhang",
"givenName": "Hengyan",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Yangzhou University,School of Information Engineering,Yangzhou,China",
"fullName": "Liucun Zhu",
"givenName": "Liucun",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Yangzhou University,School of Information Engineering,Yangzhou,China",
"fullName": "Xuhang Cai",
"givenName": "Xuhang",
"surname": "Cai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Yangzhou University,School of Information Engineering,Yangzhou,China",
"fullName": "Lutong Dong",
"givenName": "Lutong",
"surname": "Dong",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "scset",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-01-01T00:00:00",
"pubType": "proceedings",
"pages": "93-96",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-7876-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "787600a089",
"articleId": "1ANLXVHQSZO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "787600a097",
"articleId": "1ANLRURrW7K",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/citce/2021/2184/0/218400a001",
"title": "Improved Iterative Closest Point (ICP) Point Cloud Registration Algorithm based on Matching Point Pair Quadratic Filtering",
"doi": null,
"abstractUrl": "/proceedings-article/citce/2021/218400a001/1BtfTK26ZHO",
"parentPublication": {
"id": "proceedings/citce/2021/2184/0",
"title": "2021 International Conference on Computer, Internet of Things and Control Engineering (CITCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cniot/2022/6910/0/691000a034",
"title": "A point cloud registration algorithm for the fusion of virtual and real maintainability test prototypes",
"doi": null,
"abstractUrl": "/proceedings-article/cniot/2022/691000a034/1EOEfc4lasU",
"parentPublication": {
"id": "proceedings/cniot/2022/6910/0",
"title": "2022 3rd International Conference on Computing, Networks and Internet of Things (CNIOT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mipr/2022/9548/0/954800a031",
"title": "SimpleView++: Neighborhood Views for Point Cloud Classification",
"doi": null,
"abstractUrl": "/proceedings-article/mipr/2022/954800a031/1GvdhsJfsJi",
"parentPublication": {
"id": "proceedings/mipr/2022/9548/0",
"title": "2022 IEEE 5th International Conference on Multimedia Information Processing and Retrieval (MIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09998112",
"title": "From Noise Addition to Denoising: A Self-Variation Capture Network for Point Cloud Optimization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09998112/1JlF32mS2SQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600e570",
"title": "Explainability-Aware One Point Attack for Point Cloud Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600e570/1KxUIibys0M",
"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/tg/5555/01/10091230",
"title": "Contrastive Learning for Joint Normal Estimation and Point Cloud Filtering",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10091230/1M2IJGotwEU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/10097640",
"title": "Sparse-to-Dense Matching Network for Large-scale LiDAR Point Cloud Registration",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/10097640/1M9lILSRgL6",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bdicn/2023/2136/0/213600a317",
"title": "3D reconstruction of PCB based on ICP point cloud optimization",
"doi": null,
"abstractUrl": "/proceedings-article/bdicn/2023/213600a317/1MIhrt8WBBC",
"parentPublication": {
"id": "proceedings/bdicn/2023/2136/0",
"title": "2023 2nd International Conference on Big Data, Information and Computer Network (BDICN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cibda/2020/9837/0/983700a075",
"title": "Removal of Scattered Noise Based on Data of the Cranial Point Cloud of the Zokor Head",
"doi": null,
"abstractUrl": "/proceedings-article/cibda/2020/983700a075/1lO1LPSQxoc",
"parentPublication": {
"id": "proceedings/cibda/2020/9837/0",
"title": "2020 International Conference on Computer Information and Big Data Applications (CIBDA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccst/2020/8138/0/813800a123",
"title": "Point Cloud Denoising Algorithm Based on Noise Classification",
"doi": null,
"abstractUrl": "/proceedings-article/iccst/2020/813800a123/1p1gtJQEUPC",
"parentPublication": {
"id": "proceedings/iccst/2020/8138/0",
"title": "2020 International Conference on Culture-oriented Science & Technology (ICCST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1BmEezmpGrm",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1BmF4R3uGWI",
"doi": "10.1109/ICCV48922.2021.00606",
"title": "AdaFit: Rethinking Learning-based Normal Estimation on Point Clouds",
"normalizedTitle": "AdaFit: Rethinking Learning-based Normal Estimation on Point Clouds",
"abstract": "This paper presents a neural network for robust normal estimation on point clouds, named AdaFit, that can deal with point clouds with noise and density variations. Existing works use a network to learn point-wise weights for weighted least squares surface fitting to estimate the normals, which has difficulty in finding accurate normals in complex regions or containing noisy points. By analyzing the step of weighted least squares surface fitting, we find that it is hard to determine the polynomial order of the fitting surface and the fitting surface is sensitive to outliers. To address these problems, we propose a simple yet effective solution that adds an additional offset prediction to improve the quality of normal estimation. Furthermore, in order to take advantage of points from different neighborhood sizes, a novel Cascaded Scale Aggregation layer is proposed to help the network predict more accurate point-wise offsets and weights. Extensive experiments demonstrate that AdaFit achieves state-of-the-art performance on both the synthetic PCPNet dataset and the real-word SceneNN dataset. The code is publicly available at https://github.com/Runsong123/AdaFit.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper presents a neural network for robust normal estimation on point clouds, named AdaFit, that can deal with point clouds with noise and density variations. Existing works use a network to learn point-wise weights for weighted least squares surface fitting to estimate the normals, which has difficulty in finding accurate normals in complex regions or containing noisy points. By analyzing the step of weighted least squares surface fitting, we find that it is hard to determine the polynomial order of the fitting surface and the fitting surface is sensitive to outliers. To address these problems, we propose a simple yet effective solution that adds an additional offset prediction to improve the quality of normal estimation. Furthermore, in order to take advantage of points from different neighborhood sizes, a novel Cascaded Scale Aggregation layer is proposed to help the network predict more accurate point-wise offsets and weights. Extensive experiments demonstrate that AdaFit achieves state-of-the-art performance on both the synthetic PCPNet dataset and the real-word SceneNN dataset. The code is publicly available at https://github.com/Runsong123/AdaFit.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper presents a neural network for robust normal estimation on point clouds, named AdaFit, that can deal with point clouds with noise and density variations. Existing works use a network to learn point-wise weights for weighted least squares surface fitting to estimate the normals, which has difficulty in finding accurate normals in complex regions or containing noisy points. By analyzing the step of weighted least squares surface fitting, we find that it is hard to determine the polynomial order of the fitting surface and the fitting surface is sensitive to outliers. To address these problems, we propose a simple yet effective solution that adds an additional offset prediction to improve the quality of normal estimation. Furthermore, in order to take advantage of points from different neighborhood sizes, a novel Cascaded Scale Aggregation layer is proposed to help the network predict more accurate point-wise offsets and weights. Extensive experiments demonstrate that AdaFit achieves state-of-the-art performance on both the synthetic PCPNet dataset and the real-word SceneNN dataset. The code is publicly available at https://github.com/Runsong123/AdaFit.",
"fno": "281200g098",
"keywords": [
"Point Cloud Compression",
"Computer Vision",
"Codes",
"Fitting",
"Neural Networks",
"Estimation",
"Feature Extraction",
"Stereo",
"3 D From Multiview And Other Sensors",
"Vision Applications And Systems"
],
"authors": [
{
"affiliation": "Wuhan University",
"fullName": "Runsong Zhu",
"givenName": "Runsong",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Hong Kong",
"fullName": "Yuan Liu",
"givenName": "Yuan",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wuhan University",
"fullName": "Zhen Dong",
"givenName": "Zhen",
"surname": "Dong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wuhan University",
"fullName": "Yuan Wang",
"givenName": "Yuan",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wuhan University",
"fullName": "Tengping Jiang",
"givenName": "Tengping",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of Hong Kong",
"fullName": "Wenping Wang",
"givenName": "Wenping",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wuhan University",
"fullName": "Bisheng Yang",
"givenName": "Bisheng",
"surname": "Yang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-10-01T00:00:00",
"pubType": "proceedings",
"pages": "6098-6107",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-2812-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "281200g088",
"articleId": "1BmErLEyuSA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "281200g108",
"articleId": "1BmGp36SSvm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/pbg/2005/20/0/01500316",
"title": "Normal estimation for point clouds: a comparison study for a Voronoi based method",
"doi": null,
"abstractUrl": "/proceedings-article/pbg/2005/01500316/12OmNBlofQS",
"parentPublication": {
"id": "proceedings/pbg/2005/20/0",
"title": "Point-Based Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2004/04/mcg2004040053",
"title": "Normal Improvement for Point Rendering",
"doi": null,
"abstractUrl": "/magazine/cg/2004/04/mcg2004040053/13rRUwwsluX",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2023/01/09693131",
"title": "Refine-Net: Normal Refinement Neural Network for Noisy Point Clouds",
"doi": null,
"abstractUrl": "/journal/tp/2023/01/09693131/1As6TjLcxmU",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2021/1658/0/165800b265",
"title": "An axis extract method for rotational parts based on point cloud normal lines",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2021/165800b265/1BBz9AW1P1u",
"parentPublication": {
"id": "proceedings/trustcom/2021/1658/0",
"title": "2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200h437",
"title": "CPFN: Cascaded Primitive Fitting Networks for High-Resolution Point Clouds",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200h437/1BmGd2vDvIA",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2022/7218/0/09859360",
"title": "Deep Point Cloud Normal Estimation via Triplet Learning (Demonstration)",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2022/09859360/1G4F1NSQSEo",
"parentPublication": {
"id": "proceedings/icmew/2022/7218/0",
"title": "2022 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859844",
"title": "Deep Point Cloud Normal Estimation Via Triplet Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859844/1G9EiyfHOKY",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g316",
"title": "Surface Reconstruction from Point Clouds by Learning Predictive Context Priors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g316/1H1i9njU6l2",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600g305",
"title": "Reconstructing Surfaces for Sparse Point Clouds with On-Surface Priors",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600g305/1H1jpDpUMPS",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10091230",
"title": "Contrastive Learning for Joint Normal Estimation and Point Cloud Filtering",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10091230/1M2IJGotwEU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwt5shs",
"title": "Proceedings 18th International Conference on Data Engineering",
"acronym": "icde",
"groupId": "1000178",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxj23hf",
"doi": "10.1109/ICDE.2002.994788",
"title": "Decoupled Query Optimization for Federated Database Systems",
"normalizedTitle": "Decoupled Query Optimization for Federated Database Systems",
"abstract": "We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization process, often making it imperative for the optimizer to consult underlying data sources while doing cost-based optimization. This not only increases the cost of optimization, but also changes the trade-offs involved in the optimization process significantly. The dominant cost in the decoupled optimization process is the \"cost of costing\" that traditionally has been considered insignificant. The optimizer can only afford a few rounds of messages to the underlying data sources and hence the optimization techniques in this environment must be geared toward gathering all the required cost information with minimal communication.In this paper, we explore the design space for a query optimizer in this environment and demonstrate the need for decoupling various aspects of the optimization process. We present minimum-communication decoupled variants of various query optimization techniques, and discuss trade-offs in their performance in this scenario. We have implemented these techniques in the Cohera federated database system and our experimental results, somewhat surprisingly, indicate that a simple two-phase optimization scheme performs fairly well as long as the physical database design is known to the optimizer, though more aggressive algorithms are required otherwise.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization process, often making it imperative for the optimizer to consult underlying data sources while doing cost-based optimization. This not only increases the cost of optimization, but also changes the trade-offs involved in the optimization process significantly. The dominant cost in the decoupled optimization process is the \"cost of costing\" that traditionally has been considered insignificant. The optimizer can only afford a few rounds of messages to the underlying data sources and hence the optimization techniques in this environment must be geared toward gathering all the required cost information with minimal communication.In this paper, we explore the design space for a query optimizer in this environment and demonstrate the need for decoupling various aspects of the optimization process. We present minimum-communication decoupled variants of various query optimization techniques, and discuss trade-offs in their performance in this scenario. We have implemented these techniques in the Cohera federated database system and our experimental results, somewhat surprisingly, indicate that a simple two-phase optimization scheme performs fairly well as long as the physical database design is known to the optimizer, though more aggressive algorithms are required otherwise.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization process, often making it imperative for the optimizer to consult underlying data sources while doing cost-based optimization. This not only increases the cost of optimization, but also changes the trade-offs involved in the optimization process significantly. The dominant cost in the decoupled optimization process is the \"cost of costing\" that traditionally has been considered insignificant. The optimizer can only afford a few rounds of messages to the underlying data sources and hence the optimization techniques in this environment must be geared toward gathering all the required cost information with minimal communication.In this paper, we explore the design space for a query optimizer in this environment and demonstrate the need for decoupling various aspects of the optimization process. We present minimum-communication decoupled variants of various query optimization techniques, and discuss trade-offs in their performance in this scenario. We have implemented these techniques in the Cohera federated database system and our experimental results, somewhat surprisingly, indicate that a simple two-phase optimization scheme performs fairly well as long as the physical database design is known to the optimizer, though more aggressive algorithms are required otherwise.",
"fno": "15310716",
"keywords": [
"Federated Databases",
"Query Optimization"
],
"authors": [
{
"affiliation": "University of California, Berkeley",
"fullName": "Amol Deshpande",
"givenName": "Amol",
"surname": "Deshpande",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California, Berkeley",
"fullName": "Joesph M. Hellerstein",
"givenName": "Joesph M.",
"surname": "Hellerstein",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icde",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-02-01T00:00:00",
"pubType": "proceedings",
"pages": "0716",
"year": "2002",
"issn": null,
"isbn": "0-7695-1531-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "15310706",
"articleId": "12OmNzWx00X",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "picde2002003287",
"articleId": "12OmNyugyLu",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBQ2VPY",
"title": "Proceedings Technology of Object-Oriented Languages and Systems. TOOLS 31",
"acronym": "tools",
"groupId": "1000744",
"volume": "0",
"displayVolume": "0",
"year": "1999",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyUWQVN",
"doi": "10.1109/TOOLS.1999.796511",
"title": "Federated Query Service Based on CORBA",
"normalizedTitle": "Federated Query Service Based on CORBA",
"abstract": "The current information technology trends toward the distribution of data among numbers of autonomous and heterogeneous repositories. Object Query Service is specified by OMG to provide uniform interfaces for users to retrieve information based on predicate-based query despite of data heterogeneity. In this paper, we propose a sophisticated architecture for querying federated information for CORBA paradigm based on Object Query Service framework. The dissimilarity between our system and other implementation of Query Service, which focus on the query processing and system performance is that we concentrate on the requirements, behaviors, scalability as well as the extensibility of the federated query system from different participants point of view. We design a prototype called Octopus to demonstrate the feasibility of our architecture. We also share the experiences learned while designing the federated query service.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The current information technology trends toward the distribution of data among numbers of autonomous and heterogeneous repositories. Object Query Service is specified by OMG to provide uniform interfaces for users to retrieve information based on predicate-based query despite of data heterogeneity. In this paper, we propose a sophisticated architecture for querying federated information for CORBA paradigm based on Object Query Service framework. The dissimilarity between our system and other implementation of Query Service, which focus on the query processing and system performance is that we concentrate on the requirements, behaviors, scalability as well as the extensibility of the federated query system from different participants point of view. We design a prototype called Octopus to demonstrate the feasibility of our architecture. We also share the experiences learned while designing the federated query service.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The current information technology trends toward the distribution of data among numbers of autonomous and heterogeneous repositories. Object Query Service is specified by OMG to provide uniform interfaces for users to retrieve information based on predicate-based query despite of data heterogeneity. In this paper, we propose a sophisticated architecture for querying federated information for CORBA paradigm based on Object Query Service framework. The dissimilarity between our system and other implementation of Query Service, which focus on the query processing and system performance is that we concentrate on the requirements, behaviors, scalability as well as the extensibility of the federated query system from different participants point of view. We design a prototype called Octopus to demonstrate the feasibility of our architecture. We also share the experiences learned while designing the federated query service.",
"fno": "03930392",
"keywords": [
"Query Service",
"CORBA",
"Nested Query",
"Query Framework",
"Federated Query Service"
],
"authors": [
{
"affiliation": "National Chiao Tung University",
"fullName": "Ruey-Kai Sheu",
"givenName": "Ruey-Kai",
"surname": "Sheu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Chiao Tung University",
"fullName": "Shyan-Ming Yuan",
"givenName": "Shyan-Ming",
"surname": "Yuan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "tools",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1999-09-01T00:00:00",
"pubType": "proceedings",
"pages": "392",
"year": "1999",
"issn": "1530-2067",
"isbn": "0-7695-0462-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "03930386",
"articleId": "12OmNxecRUA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "03930400",
"articleId": "12OmNxvwoYY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1IFJxbFw9Vu",
"title": "2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)",
"acronym": "icdcsw",
"groupId": "9951324",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1IFJE5P95cY",
"doi": "10.1109/ICDCSW56584.2022.00033",
"title": "ROFL: RObust privacy preserving Federated Learning",
"normalizedTitle": "ROFL: RObust privacy preserving Federated Learning",
"abstract": "In the modern world of connectivity, most data is generated in a de centralised way, across a multitude of platforms like mobile devices and other loT applications. This crowd sourced data, if well analyzed, can prove to be rich in insights, for different tasks. However, the issue in utilizing it lies with the consolidation of the data, which is unacceptable to most involved parties. While every participant stands to benefit from the collective use of the massive data repositories, the lack of trust between them prevents that endeavour. In this paper, we propose ROFL, which is an end-to-end robust mechanism of learning, that has been developed keeping all the trust issues in mind and addressing the necessity of privacy. We make note of the threat models that might make the participants apprehensive and design a bi-directional two-dimensional privacy preserving framework, that builds upon the state-of-the-art in differentially private federated learning. Specifically, we propose a weighted federated averaging technique for aggregation of the differentially private models generated by the participants. We are able to provide privacy guarantees without compromising on the accuracy of the machine learning task. ROFL has been tested for multiple neural architectures (VGG-16 [1] and ResNet [2]) on multiple datasets (MNIST [3], CIFAR-I0 and CIFAR-I00 [4]). On the machine learning tasks, it is able to achieve accuracies within the range of 1 % -2 % of what a model trained on the collected data would have generated, in the average case scenario. We have verified the robustness of ROFL against attacks involving sabotaging or malicious client providing erroneous models. The study on model convergence reveals how to improve the efficiency of ROFL. We also provide evidence on how ROFL is easily scalable in nature.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the modern world of connectivity, most data is generated in a de centralised way, across a multitude of platforms like mobile devices and other loT applications. This crowd sourced data, if well analyzed, can prove to be rich in insights, for different tasks. However, the issue in utilizing it lies with the consolidation of the data, which is unacceptable to most involved parties. While every participant stands to benefit from the collective use of the massive data repositories, the lack of trust between them prevents that endeavour. In this paper, we propose ROFL, which is an end-to-end robust mechanism of learning, that has been developed keeping all the trust issues in mind and addressing the necessity of privacy. We make note of the threat models that might make the participants apprehensive and design a bi-directional two-dimensional privacy preserving framework, that builds upon the state-of-the-art in differentially private federated learning. Specifically, we propose a weighted federated averaging technique for aggregation of the differentially private models generated by the participants. We are able to provide privacy guarantees without compromising on the accuracy of the machine learning task. ROFL has been tested for multiple neural architectures (VGG-16 [1] and ResNet [2]) on multiple datasets (MNIST [3], CIFAR-I0 and CIFAR-I00 [4]). On the machine learning tasks, it is able to achieve accuracies within the range of 1 % -2 % of what a model trained on the collected data would have generated, in the average case scenario. We have verified the robustness of ROFL against attacks involving sabotaging or malicious client providing erroneous models. The study on model convergence reveals how to improve the efficiency of ROFL. We also provide evidence on how ROFL is easily scalable in nature.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the modern world of connectivity, most data is generated in a de centralised way, across a multitude of platforms like mobile devices and other loT applications. This crowd sourced data, if well analyzed, can prove to be rich in insights, for different tasks. However, the issue in utilizing it lies with the consolidation of the data, which is unacceptable to most involved parties. While every participant stands to benefit from the collective use of the massive data repositories, the lack of trust between them prevents that endeavour. In this paper, we propose ROFL, which is an end-to-end robust mechanism of learning, that has been developed keeping all the trust issues in mind and addressing the necessity of privacy. We make note of the threat models that might make the participants apprehensive and design a bi-directional two-dimensional privacy preserving framework, that builds upon the state-of-the-art in differentially private federated learning. Specifically, we propose a weighted federated averaging technique for aggregation of the differentially private models generated by the participants. We are able to provide privacy guarantees without compromising on the accuracy of the machine learning task. ROFL has been tested for multiple neural architectures (VGG-16 [1] and ResNet [2]) on multiple datasets (MNIST [3], CIFAR-I0 and CIFAR-I00 [4]). On the machine learning tasks, it is able to achieve accuracies within the range of 1 % -2 % of what a model trained on the collected data would have generated, in the average case scenario. We have verified the robustness of ROFL against attacks involving sabotaging or malicious client providing erroneous models. The study on model convergence reveals how to improve the efficiency of ROFL. We also provide evidence on how ROFL is easily scalable in nature.",
"fno": "887900a125",
"keywords": [
"Data Privacy",
"Learning Artificial Intelligence",
"Mobile Computing",
"Bi Directional Two Dimensional Privacy Preserving Framework",
"CIFAR I 00",
"Erroneous Models",
"Lo T Application",
"Machine Learning Task",
"Massive Data Repositories",
"Mobile Devices",
"Privacy Guarantees",
"Private Federated Learning",
"Robust Privacy",
"ROFL",
"Threat Models",
"Weighted Federated Averaging Technique",
"Threat Modeling",
"Privacy",
"Federated Learning",
"Computational Modeling",
"Robustness",
"Mobile Handsets",
"Data Models",
"Deep Learning",
"Federated Learning",
"Differential Privacy",
"Robustness",
"Internet Of Things"
],
"authors": [
{
"affiliation": "Nanyang Technological University,Singapore",
"fullName": "Nandish Chattopadhyay",
"givenName": "Nandish",
"surname": "Chattopadhyay",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Indian Institute of Technology,Kanpur,India",
"fullName": "Arpit Singh",
"givenName": "Arpit",
"surname": "Singh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nanyang Technological University,Singapore",
"fullName": "Anupam Chattopadhyay",
"givenName": "Anupam",
"surname": "Chattopadhyay",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icdcsw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-07-01T00:00:00",
"pubType": "proceedings",
"pages": "125-132",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8879-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "887900a119",
"articleId": "1IFJFqHagEM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "887900a133",
"articleId": "1IFJGRfa3oA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdcs/2022/7177/0/717700a842",
"title": "Distributionally Robust Federated Learning for Differentially Private Data",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2022/717700a842/1HriUvYG1H2",
"parentPublication": {
"id": "proceedings/icdcs/2022/7177/0",
"title": "2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2022/6297/0/09927969",
"title": "SecureAstraea: A Self-balancing Privacy-preserving Federated Learning Framework",
"doi": null,
"abstractUrl": "/proceedings-article/dasc-picom-cbdcom-cyberscitech/2022/09927969/1J4CoU4WjOE",
"parentPublication": {
"id": "proceedings/dasc-picom-cbdcom-cyberscitech/2022/6297/0",
"title": "2022 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2023/6268/0/10049004",
"title": "Robust Federated Learning with Local Mixed Co-teaching",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2023/10049004/1KYsNDmBOzC",
"parentPublication": {
"id": "proceedings/icoin/2023/6268/0",
"title": "2023 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2022/9425/0/942500a598",
"title": "Privacy-Preserving Robust Federated Learning with Distributed Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2022/942500a598/1LFLWEmoEUM",
"parentPublication": {
"id": "proceedings/trustcom/2022/9425/0",
"title": "2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2022/9425/0/942500a631",
"title": "LLDP: A Layer-wise Local Differential Privacy in Federated Learning",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2022/942500a631/1LFMbm7orN6",
"parentPublication": {
"id": "proceedings/trustcom/2022/9425/0",
"title": "2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0/199300b188",
"title": "A Privacy-Enhanced Federated Learning Scheme with Identity Protection",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2022/199300b188/1LSPG6ZBJXq",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0",
"title": "2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/5555/01/10056968",
"title": "Privacy-Preserving and Reliable Decentralized Federated Learning",
"doi": null,
"abstractUrl": "/journal/sc/5555/01/10056968/1La0vfztryM",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2022/4627/0/462700a122",
"title": "A differential privacy federated learning framework for accelerating convergence",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2022/462700a122/1M9q4SMctfa",
"parentPublication": {
"id": "proceedings/cis/2022/4627/0",
"title": "2022 18th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2022/9744/0/974400a020",
"title": "Privacy-preserving Cost-sensitive Federated Learning from Imbalanced Data",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2022/974400a020/1MrFOLH2Oek",
"parentPublication": {
"id": "proceedings/ictai/2022/9744/0",
"title": "2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09005992",
"title": "Privacy-preserving Heterogeneous Federated Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09005992/1hJrNyyOxyM",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1J4CiR0iIBa",
"title": "2022 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)",
"acronym": "dasc-picom-cbdcom-cyberscitech",
"groupId": "9927523",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1J4CoU4WjOE",
"doi": "10.1109/DASC/PiCom/CBDCom/Cy55231.2022.9927969",
"title": "SecureAstraea: A Self-balancing Privacy-preserving Federated Learning Framework",
"normalizedTitle": "SecureAstraea: A Self-balancing Privacy-preserving Federated Learning Framework",
"abstract": "Federated learning is an emerging fundamental AI technology originally used to solve the problem of updating models locally by Android cell phone end-users. As a distributed approach, its design goal is to carry out efficient and secure machine learning among multiple participants or multiple computing nodes. Specifically, federated learning can somewhat protect information security during data exchange, protect endpoint data and personal data privacy, and ensure legal compliance, which is also applicable to edge computing systems. However, unlike the common training dataset, the data distribution of the edge computing system is imbalanced which will introduce biases in the model training and cause a decrease in accuracy of federated learning applications. In this work, we analyze the privacy leakage problem of existing solutions. To address this problem, we construct a self-balancing federated learning framework by designing multiple protocols in the semi-honest and server collusion scenarios, respectively. The proposed framework enables privacy protection by transmitting data as ciphertext as well as computing to protect the privacy of the participants. Compared with FedAvg, the state-of-the-art FL algorithm, our scheme has a substantial improvement in accuracy on imbalanced MNIST dataset; and compared with the prior solutions, our scheme is able to avoid the privacy leakage of participants.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Federated learning is an emerging fundamental AI technology originally used to solve the problem of updating models locally by Android cell phone end-users. As a distributed approach, its design goal is to carry out efficient and secure machine learning among multiple participants or multiple computing nodes. Specifically, federated learning can somewhat protect information security during data exchange, protect endpoint data and personal data privacy, and ensure legal compliance, which is also applicable to edge computing systems. However, unlike the common training dataset, the data distribution of the edge computing system is imbalanced which will introduce biases in the model training and cause a decrease in accuracy of federated learning applications. In this work, we analyze the privacy leakage problem of existing solutions. To address this problem, we construct a self-balancing federated learning framework by designing multiple protocols in the semi-honest and server collusion scenarios, respectively. The proposed framework enables privacy protection by transmitting data as ciphertext as well as computing to protect the privacy of the participants. Compared with FedAvg, the state-of-the-art FL algorithm, our scheme has a substantial improvement in accuracy on imbalanced MNIST dataset; and compared with the prior solutions, our scheme is able to avoid the privacy leakage of participants.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Federated learning is an emerging fundamental AI technology originally used to solve the problem of updating models locally by Android cell phone end-users. As a distributed approach, its design goal is to carry out efficient and secure machine learning among multiple participants or multiple computing nodes. Specifically, federated learning can somewhat protect information security during data exchange, protect endpoint data and personal data privacy, and ensure legal compliance, which is also applicable to edge computing systems. However, unlike the common training dataset, the data distribution of the edge computing system is imbalanced which will introduce biases in the model training and cause a decrease in accuracy of federated learning applications. In this work, we analyze the privacy leakage problem of existing solutions. To address this problem, we construct a self-balancing federated learning framework by designing multiple protocols in the semi-honest and server collusion scenarios, respectively. The proposed framework enables privacy protection by transmitting data as ciphertext as well as computing to protect the privacy of the participants. Compared with FedAvg, the state-of-the-art FL algorithm, our scheme has a substantial improvement in accuracy on imbalanced MNIST dataset; and compared with the prior solutions, our scheme is able to avoid the privacy leakage of participants.",
"fno": "09927969",
"keywords": [
"Data Privacy",
"Learning Artificial Intelligence",
"Mobile Computing",
"Protocols",
"Android Cell Phone End Users",
"Common Training Dataset",
"Data Distribution",
"Data Exchange",
"Distributed Approach",
"Edge Computing System",
"Efficient Machine Learning",
"Emerging Fundamental AI Technology",
"Endpoint Data",
"Federated Learning Applications",
"Information Security",
"Model Training",
"Multiple Computing Nodes",
"Multiple Participants",
"Multiple Protocols",
"Personal Data Privacy",
"Privacy Leakage Problem",
"Privacy Protection",
"Secure Machine Learning",
"Self Balancing Federated Learning",
"Self Balancing Privacy Preserving Federated Learning Framework",
"Training",
"Data Privacy",
"Privacy",
"Protocols",
"Federated Learning",
"Computational Modeling",
"Training Data",
"Federated Learning",
"Privacy Protection",
"Class Imbalance",
"Homomorphic Encryption"
],
"authors": [
{
"affiliation": "Jinan University,College of Information Science and Technology,Guangzhou,China",
"fullName": "Dehua Zhou",
"givenName": "Dehua",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Jinan University,College of Information Science and Technology,Guangzhou,China",
"fullName": "Yingwei Yu",
"givenName": "Yingwei",
"surname": "Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Jilin University,College of Electronic Science and Engineering,Changchun,China",
"fullName": "Di Wu",
"givenName": "Di",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Guangdong University of Foreign Studies,Department of Cyber Security,Guangzhou,China",
"fullName": "Qingqing Gan",
"givenName": "Qingqing",
"surname": "Gan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Jinan University,College of Information Science and Technology,Guangzhou,China",
"fullName": "Zexiao Chen",
"givenName": "Zexiao",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "South China University of Technology,Department of Electronic Commerce,Guangzhou,China",
"fullName": "Botong Xu",
"givenName": "Botong",
"surname": "Xu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dasc-picom-cbdcom-cyberscitech",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-09-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6297-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09927892",
"articleId": "1J4Ctr9ehfq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09927812",
"articleId": "1J4CwtPEAWk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sec/2021/8390/0/839000a055",
"title": "SecureFL: Privacy Preserving Federated Learning with SGX and TrustZone",
"doi": null,
"abstractUrl": "/proceedings-article/sec/2021/839000a055/1B2HcI1uvCM",
"parentPublication": {
"id": "proceedings/sec/2021/8390/0",
"title": "2021 IEEE/ACM Symposium on Edge Computing (SEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/5555/01/09830997",
"title": "Privacy-Preserving Aggregation in Federated Learning: A Survey",
"doi": null,
"abstractUrl": "/journal/bd/5555/01/09830997/1F1R8h1TODe",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2022/5417/0/541700a533",
"title": "High Precision Method of Federated Learning Based on Cosine Similarity and Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata-cybermatics/2022/541700a533/1Hcn3IgYlwc",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata-cybermatics/2022/5417/0",
"title": "2022 IEEE International Conferences on Internet of Things (iThings) and IEEE Green Computing & Communications (GreenCom) and IEEE Cyber, Physical & Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcsw/2022/8879/0/887900a125",
"title": "ROFL: RObust privacy preserving Federated Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icdcsw/2022/887900a125/1IFJE5P95cY",
"parentPublication": {
"id": "proceedings/icdcsw/2022/8879/0",
"title": "2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/09969897",
"title": "VOSA: Verifiable and Oblivious Secure Aggregation for Privacy-Preserving Federated Learning",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/09969897/1IRjojCoz72",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/5555/01/09994045",
"title": "PrivAim: A Dual-Privacy Preserving and Quality-Aware Incentive Mechanism for Federated Learning",
"doi": null,
"abstractUrl": "/journal/tc/5555/01/09994045/1JgwdTaYsqA",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2022/5132/0/513200a193",
"title": "Federated Learning for Tabular Data: Exploring Potential Risk to Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2022/513200a193/1JhTJ8ei27S",
"parentPublication": {
"id": "proceedings/issre/2022/5132/0",
"title": "2022 IEEE 33rd International Symposium on Software Reliability Engineering (ISSRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/5555/01/10050157",
"title": "VFLR: An Efficient and Privacy-Preserving Vertical Federated Framework for Logistic Regression",
"doi": null,
"abstractUrl": "/journal/cc/5555/01/10050157/1KYoehD1eco",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2022/9425/0/942500a598",
"title": "Privacy-Preserving Robust Federated Learning with Distributed Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2022/942500a598/1LFLWEmoEUM",
"parentPublication": {
"id": "proceedings/trustcom/2022/9425/0",
"title": "2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0/199300b188",
"title": "A Privacy-Enhanced Federated Learning Scheme with Identity Protection",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-dss-smartcity-dependsys/2022/199300b188/1LSPG6ZBJXq",
"parentPublication": {
"id": "proceedings/hpcc-dss-smartcity-dependsys/2022/1993/0",
"title": "2022 IEEE 24th Int Conf on High Performance Computing & Communications; 8th Int Conf on Data Science & Systems; 20th Int Conf on Smart City; 8th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1MrFLC1Kdb2",
"title": "2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)",
"acronym": "ictai",
"groupId": "10097829",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1MrFOLH2Oek",
"doi": "10.1109/ICTAI56018.2022.00012",
"title": "Privacy-preserving Cost-sensitive Federated Learning from Imbalanced Data",
"normalizedTitle": "Privacy-preserving Cost-sensitive Federated Learning from Imbalanced Data",
"abstract": "Federated learning allows multiple clients to collab-oratively train a global deep learning model without revealing their local data to a centralized server. However, the existence of clients whose datasets have imbalanced class distribution has a significant impact on model accuracy. Imbalance makes it challenging for a model to distinguish between the majority and minority classes without accessing clients' local data. In this paper, we aim to tackle this problem by privacy-preserving cost-sensitive federated learning. We design the joint cost-sensitive and differentially private model parameter optimization mechanism which maintains the model accuracy while satisfying differential privacy constraints. Moreover, this mechanism does not alter the original data distribution. Experimental results demonstrate the superior performance of our proposed scheme in terms of model accuracy and privacy preservation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Federated learning allows multiple clients to collab-oratively train a global deep learning model without revealing their local data to a centralized server. However, the existence of clients whose datasets have imbalanced class distribution has a significant impact on model accuracy. Imbalance makes it challenging for a model to distinguish between the majority and minority classes without accessing clients' local data. In this paper, we aim to tackle this problem by privacy-preserving cost-sensitive federated learning. We design the joint cost-sensitive and differentially private model parameter optimization mechanism which maintains the model accuracy while satisfying differential privacy constraints. Moreover, this mechanism does not alter the original data distribution. Experimental results demonstrate the superior performance of our proposed scheme in terms of model accuracy and privacy preservation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Federated learning allows multiple clients to collab-oratively train a global deep learning model without revealing their local data to a centralized server. However, the existence of clients whose datasets have imbalanced class distribution has a significant impact on model accuracy. Imbalance makes it challenging for a model to distinguish between the majority and minority classes without accessing clients' local data. In this paper, we aim to tackle this problem by privacy-preserving cost-sensitive federated learning. We design the joint cost-sensitive and differentially private model parameter optimization mechanism which maintains the model accuracy while satisfying differential privacy constraints. Moreover, this mechanism does not alter the original data distribution. Experimental results demonstrate the superior performance of our proposed scheme in terms of model accuracy and privacy preservation.",
"fno": "974400a020",
"keywords": [
"Data Privacy",
"Deep Learning Artificial Intelligence",
"Learning Artificial Intelligence",
"Clients Whose Datasets",
"Global Deep Learning Model",
"Imbalanced Data",
"Joint Cost Sensitive",
"Model Accuracy",
"Multiple Clients",
"Original Data Distribution",
"Privacy Preservation",
"Privacy Preserving Cost Sensitive Federated Learning",
"Satisfying Differential Privacy Constraints",
"Deep Learning",
"Degradation",
"Privacy",
"Differential Privacy",
"Federated Learning",
"Learning Artificial Intelligence",
"Data Models",
"Federated Learning",
"Privacy Preservation",
"Differential Privacy",
"Cost Sensitive Learning"
],
"authors": [
{
"affiliation": "School of Information Science and Technology, University of Science and Technology of China,Hefei,China,230027",
"fullName": "Xiaowei Liu",
"givenName": "Xiaowei",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Information Science and Technology, University of Science and Technology of China,Hefei,China,230027",
"fullName": "Yuanzhi Yao",
"givenName": "Yuanzhi",
"surname": "Yao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Information Science and Technology, University of Science and Technology of China,Hefei,China,230027",
"fullName": "Yuting Ma",
"givenName": "Yuting",
"surname": "Ma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Information Science and Technology, University of Science and Technology of China,Hefei,China,230027",
"fullName": "Nenghai Yu",
"givenName": "Nenghai",
"surname": "Yu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ictai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-10-01T00:00:00",
"pubType": "proceedings",
"pages": "20-27",
"year": "2022",
"issn": null,
"isbn": "979-8-3503-9744-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "974400a014",
"articleId": "1MrFVmug6qY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "974400a028",
"articleId": "1MrFTyJYPCg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2022/6946/0/694600k0112",
"title": "Differentially Private Federated Learning with Local Regularization and Sparsification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600k0112/1H0OsUy8O9G",
"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/mlise/2022/9246/0/924600a389",
"title": "APPFed: A Hybrid Privacy-Preserving Framework for Federated Learning over Sensitive Data",
"doi": null,
"abstractUrl": "/proceedings-article/mlise/2022/924600a389/1Ik8SDE0Ehy",
"parentPublication": {
"id": "proceedings/mlise/2022/9246/0",
"title": "2022 International Conference on Machine Learning and Intelligent Systems Engineering (MLISE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/5555/01/09994045",
"title": "PrivAim: A Dual-Privacy Preserving and Quality-Aware Incentive Mechanism for Federated Learning",
"doi": null,
"abstractUrl": "/journal/tc/5555/01/09994045/1JgwdTaYsqA",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tq/5555/01/10032626",
"title": "Heterogeneous Differential-Private Federated Learning: Trading Privacy for Utility Truthfully",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/10032626/1KnSwkPR5bW",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigcom/2022/7384/0/738400a079",
"title": "Federated Learning With Personalized Differential Privacy Combining Client Selection",
"doi": null,
"abstractUrl": "/proceedings-article/bigcom/2022/738400a079/1LFKEGr82ME",
"parentPublication": {
"id": "proceedings/bigcom/2022/7384/0",
"title": "2022 8th International Conference on Big Data Computing and Communications (BigCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2022/9425/0/942500a680",
"title": "Utility-Aware Privacy-Preserving Federated Learning through Information Bottleneck",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2022/942500a680/1LFLSLUrTuo",
"parentPublication": {
"id": "proceedings/trustcom/2022/9425/0",
"title": "2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2022/9425/0/942500a598",
"title": "Privacy-Preserving Robust Federated Learning with Distributed Differential Privacy",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2022/942500a598/1LFLWEmoEUM",
"parentPublication": {
"id": "proceedings/trustcom/2022/9425/0",
"title": "2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2023/5719/0/10074494",
"title": "Byzantine-Resilient Federated Learning With Differential Privacy Using Online Mirror Descent",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2023/10074494/1LKwLjtuVMY",
"parentPublication": {
"id": "proceedings/icnc/2023/5719/0",
"title": "2023 International Conference on Computing, Networking and Communications (ICNC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/sc/5555/01/10056968",
"title": "Privacy-Preserving and Reliable Decentralized Federated Learning",
"doi": null,
"abstractUrl": "/journal/sc/5555/01/10056968/1La0vfztryM",
"parentPublication": {
"id": "trans/sc",
"title": "IEEE Transactions on Services Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cis/2022/4627/0/462700a122",
"title": "A differential privacy federated learning framework for accelerating convergence",
"doi": null,
"abstractUrl": "/proceedings-article/cis/2022/462700a122/1M9q4SMctfa",
"parentPublication": {
"id": "proceedings/cis/2022/4627/0",
"title": "2022 18th International Conference on Computational Intelligence and Security (CIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyxXltg",
"title": "2011 Data Compression Conference (DCC)",
"acronym": "dcc",
"groupId": "1000177",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxiKsd1",
"doi": "10.1109/DCC.2011.42",
"title": "Tree Structure Compression with RePair",
"normalizedTitle": "Tree Structure Compression with RePair",
"abstract": "Larsson and Moffat's RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which are smaller than those produced by previous grammar-based compressors such as BPLEX. Experiments show that a Huffman-based coding of the resulting grammars gives compression ratios comparable to the best known XML file compressors. Moreover, SLT grammars can be used as efficient memory representation of trees. Our investigations show that tree traversals over TreeRePair grammars are 14 times slower than over pointer structures and 5 times slower than over succinct trees, while memory consumption is only 1/43 and 1/6, respectively.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Larsson and Moffat's RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which are smaller than those produced by previous grammar-based compressors such as BPLEX. Experiments show that a Huffman-based coding of the resulting grammars gives compression ratios comparable to the best known XML file compressors. Moreover, SLT grammars can be used as efficient memory representation of trees. Our investigations show that tree traversals over TreeRePair grammars are 14 times slower than over pointer structures and 5 times slower than over succinct trees, while memory consumption is only 1/43 and 1/6, respectively.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Larsson and Moffat's RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which are smaller than those produced by previous grammar-based compressors such as BPLEX. Experiments show that a Huffman-based coding of the resulting grammars gives compression ratios comparable to the best known XML file compressors. Moreover, SLT grammars can be used as efficient memory representation of trees. Our investigations show that tree traversals over TreeRePair grammars are 14 times slower than over pointer structures and 5 times slower than over succinct trees, while memory consumption is only 1/43 and 1/6, respectively.",
"fno": "05749493",
"keywords": [
"Context Free Grammars",
"Data Compression",
"Huffman Codes",
"Tree Data Structures",
"Tree Structure Compression",
"Moffat Re Pair Algorithm",
"Larsson Re Pair Algorithm",
"Tree Re Pair Algorithm",
"Grammar Based Compressors",
"Straight Line Linear Context Free Tree Grammars",
"Huffman Based Coding",
"XML File Compressors",
"Grammar",
"Production",
"XML",
"Compressors",
"Maintenance Engineering",
"Vegetation",
"Encoding",
"Tree Compression",
"XML Compression",
"Grammar Based Compression"
],
"authors": [
{
"affiliation": null,
"fullName": "Markus Lohrey",
"givenName": "Markus",
"surname": "Lohrey",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sebastian Maneth",
"givenName": "Sebastian",
"surname": "Maneth",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Roy Mennicke",
"givenName": "Roy",
"surname": "Mennicke",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dcc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-03-01T00:00:00",
"pubType": "proceedings",
"pages": "353-362",
"year": "2011",
"issn": "1068-0314",
"isbn": "978-1-61284-279-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05749492",
"articleId": "12OmNxGAKQj",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05749494",
"articleId": "12OmNvAiSKR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icde/2016/2020/0/07498310",
"title": "Incremental updates on compressed XML",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2016/07498310/12OmNBkxsq4",
"parentPublication": {
"id": "proceedings/icde/2016/2020/0",
"title": "2016 IEEE 32nd International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lics/2013/5020/0/5020a153",
"title": "Model-Checking Parse Trees",
"doi": null,
"abstractUrl": "/proceedings-article/lics/2013/5020a153/12OmNvkYxbc",
"parentPublication": {
"id": "proceedings/lics/2013/5020/0",
"title": "Logic in Computer Science, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2012/5026/0/06481024",
"title": "Automating Abstract Syntax Tree Construction for Context Free Grammars",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2012/06481024/12OmNwCJOVW",
"parentPublication": {
"id": "proceedings/synasc/2012/5026/0",
"title": "2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2008/3299/0/3299a243",
"title": "XML Tree Structure Compression",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2008/3299a243/12OmNybx223",
"parentPublication": {
"id": "proceedings/dexa/2008/3299/0",
"title": "2008 19th International Workshop on Database and Expert Systems Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lics/2012/4769/0/06280426",
"title": "The Semantics of Parsing with Semantic Actions",
"doi": null,
"abstractUrl": "/proceedings-article/lics/2012/06280426/12OmNyr8Ynm",
"parentPublication": {
"id": "proceedings/lics/2012/4769/0",
"title": "Logic in Computer Science, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpc/2008/3176/0/3176a005",
"title": "The Reuse of Grammars with Embedded Semantic Actions",
"doi": null,
"abstractUrl": "/proceedings-article/icpc/2008/3176a005/12OmNzXFoE2",
"parentPublication": {
"id": "proceedings/icpc/2008/3176/0",
"title": "International Conference on Program Comprehension",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2018/08/08263391",
"title": "Advanced Compressor Tree Synthesis for FPGAs",
"doi": null,
"abstractUrl": "/journal/tc/2018/08/08263391/13rRUB7a10x",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/1995/02/00386228",
"title": "Improving multiplier design by using improved column compression tree and optimized final adder in CMOS technology",
"doi": null,
"abstractUrl": "/journal/si/1995/02/00386228/13rRUypp55c",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2018/8319/0/831900a179",
"title": "An Efficient Transformation Scheme for Lossy Data Compression with Point-Wise Relative Error Bound",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a179/17D45W2Wyz4",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2020/6876/0/09139812",
"title": "FRaZ: A Generic High-Fidelity Fixed-Ratio Lossy Compression Framework for Scientific Floating-point Data",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2020/09139812/1lss8nVQuis",
"parentPublication": {
"id": "proceedings/ipdps/2020/6876/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNx6g6nT",
"title": "2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"acronym": "bibm",
"groupId": "1001586",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzsJ7xC",
"doi": "10.1109/BIBM.2017.8217727",
"title": "A bucket index correction based method for compression of genomic sequencing data",
"normalizedTitle": "A bucket index correction based method for compression of genomic sequencing data",
"abstract": "As high-throughput sequencing technologies are generating vast amounts of data, there is urgent need to develop efficient algorithms for sequencing data compression. Existing methods usually dispatch the similar sequences into the same bucket based on their same minimizer, that is the lexicographical smallest k-mer within the sequence, for data compression. However, when the sequencing error existed in the minimizer area, it could cause sequences to be distributed into the improper buckets, which could result in a negative effect in the following compression process. In this paper, we propose a novel method BIC, a bucket index correction method for sequencing data compression. BIC is the first method to correct sequencing errors in minimizer area, which dispatches more similar sequences into the same buckets, that could effectively compress sequencing data. Compared with three state-of-the-art methods on five different data sets, BIC could reach more compression rate. The codes of BIC are available at https://github.com/rongjiewang/BIC.",
"abstracts": [
{
"abstractType": "Regular",
"content": "As high-throughput sequencing technologies are generating vast amounts of data, there is urgent need to develop efficient algorithms for sequencing data compression. Existing methods usually dispatch the similar sequences into the same bucket based on their same minimizer, that is the lexicographical smallest k-mer within the sequence, for data compression. However, when the sequencing error existed in the minimizer area, it could cause sequences to be distributed into the improper buckets, which could result in a negative effect in the following compression process. In this paper, we propose a novel method BIC, a bucket index correction method for sequencing data compression. BIC is the first method to correct sequencing errors in minimizer area, which dispatches more similar sequences into the same buckets, that could effectively compress sequencing data. Compared with three state-of-the-art methods on five different data sets, BIC could reach more compression rate. The codes of BIC are available at https://github.com/rongjiewang/BIC.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "As high-throughput sequencing technologies are generating vast amounts of data, there is urgent need to develop efficient algorithms for sequencing data compression. Existing methods usually dispatch the similar sequences into the same bucket based on their same minimizer, that is the lexicographical smallest k-mer within the sequence, for data compression. However, when the sequencing error existed in the minimizer area, it could cause sequences to be distributed into the improper buckets, which could result in a negative effect in the following compression process. In this paper, we propose a novel method BIC, a bucket index correction method for sequencing data compression. BIC is the first method to correct sequencing errors in minimizer area, which dispatches more similar sequences into the same buckets, that could effectively compress sequencing data. Compared with three state-of-the-art methods on five different data sets, BIC could reach more compression rate. The codes of BIC are available at https://github.com/rongjiewang/BIC.",
"fno": "08217727",
"keywords": [
"Sequential Analysis",
"Solids",
"Indexes",
"Data Compression",
"Bioinformatics",
"Decoding",
"Encoding"
],
"authors": [
{
"affiliation": "School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China",
"fullName": "Rongjie Wang",
"givenName": "Rongjie",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China",
"fullName": "Yang Bai",
"givenName": "Yang",
"surname": "Bai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China",
"fullName": "Qianlong Cheng",
"givenName": "Qianlong",
"surname": "Cheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China",
"fullName": "Tianyi Zang",
"givenName": "Tianyi",
"surname": "Zang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China",
"fullName": "Yadong Wang",
"givenName": "Yadong",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bibm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-11-01T00:00:00",
"pubType": "proceedings",
"pages": "634-637",
"year": "2017",
"issn": null,
"isbn": "978-1-5090-3050-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08217726",
"articleId": "12OmNwIHoBs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08217728",
"articleId": "12OmNzcxZd0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dcabes/2014/4169/0/4169a029",
"title": "PLDSRC: A Multi-threaded Compressor/Decompressor for Massive DNA Sequencing Data",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2014/4169a029/12OmNA0dMOz",
"parentPublication": {
"id": "proceedings/dcabes/2014/4169/0",
"title": "2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiswc/2017/1233/0/08167744",
"title": "Characterization and acceleration for genomic sequencing and analysis",
"doi": null,
"abstractUrl": "/proceedings-article/iiswc/2017/08167744/12OmNAZfxO9",
"parentPublication": {
"id": "proceedings/iiswc/2017/1233/0",
"title": "2017 IEEE International Symposium on Workload Characterization (IISWC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2016/1853/0/07786166",
"title": "An Evaluation Framework for Lossy Compression of Genome Sequencing Quality Values",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2016/07786166/12OmNsbGvIH",
"parentPublication": {
"id": "proceedings/dcc/2016/1853/0",
"title": "2016 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2016/1611/0/07822807",
"title": "A lossless FASTQ Quality Scores file compression algorithm based on linear combination prediction",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2016/07822807/12OmNviZluU",
"parentPublication": {
"id": "proceedings/bibm/2016/1611/0",
"title": "2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2014/5669/0/06999132",
"title": "Efficient algorithms for the compression of FASTQ files",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2014/06999132/12OmNxTmHL2",
"parentPublication": {
"id": "proceedings/bibm/2014/5669/0",
"title": "2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2015/8488/0/8488a446",
"title": "Parallel Read Error Correction for Big Genomic Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2015/8488a446/12OmNyQphcE",
"parentPublication": {
"id": "proceedings/hipc/2015/8488/0",
"title": "2015 IEEE 22nd International Conference on High Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom-bigdatase-i-spa/2015/7952/3/07345648",
"title": "A Parallel Algorithm for Compression of Big Next-Generation Sequencing Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom-bigdatase-i-spa/2015/07345648/12OmNzUPpEK",
"parentPublication": {
"id": "trustcom-bigdatase-i-spa/2015/7952/3",
"title": "2015 IEEE Trustcom/BigDataSE/ISPA",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2016/1853/0/07786168",
"title": "Predictive Coding of Aligned Next-Generation Sequencing Data",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2016/07786168/12OmNzxyiAU",
"parentPublication": {
"id": "proceedings/dcc/2016/1853/0",
"title": "2016 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2013/05/ttb2013051275",
"title": "FRESCO: Referential Compression of Highly Similar Sequences",
"doi": null,
"abstractUrl": "/journal/tb/2013/05/ttb2013051275/13rRUwI5U19",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/05/08936480",
"title": "Lossy Compression of Quality Values in Sequencing Data",
"doi": null,
"abstractUrl": "/journal/tb/2021/05/08936480/1fRyZVsDrZC",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1A8gmCnipkA",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "1802964",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1A8gzQrzAeQ",
"doi": "10.1109/BigData52589.2021.9671954",
"title": "Improving Lossy Compression for SZ by Exploring the Best-Fit Lossless Compression Techniques",
"normalizedTitle": "Improving Lossy Compression for SZ by Exploring the Best-Fit Lossless Compression Techniques",
"abstract": "In the past decades, various lossy compressors have been studied broadly due to the ever-increasing volume of data being produced by today’s scientific applications. SZ has been one of the best error-bounded lossy compressors ever raised, and it has a flexible framework that includes four adjustable steps: prediction, quantization, variable-length encoding, and lossless compression. In this paper, we improve the lossy compression performances of the SZ compression model by exploring different existing lossless compression techniques using the Squash data compression benchmark. Specifically, we first characterize the bytes outputted by the first three steps in SZ, then we investigate the best lossless compressor with different datasets and different error bounds. We perform our exploration by testing 8 widely used lossless compressors under different configurations together with SZ over five well-known scientific simulation datasets. Our experiments show that adopting the best-fit lossless compressor selected based on our analysis can improve the overall compression speed by up to 40% compared to the previous lossless compression technique used in SZ with the comparable quality of reconstructed data.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the past decades, various lossy compressors have been studied broadly due to the ever-increasing volume of data being produced by today’s scientific applications. SZ has been one of the best error-bounded lossy compressors ever raised, and it has a flexible framework that includes four adjustable steps: prediction, quantization, variable-length encoding, and lossless compression. In this paper, we improve the lossy compression performances of the SZ compression model by exploring different existing lossless compression techniques using the Squash data compression benchmark. Specifically, we first characterize the bytes outputted by the first three steps in SZ, then we investigate the best lossless compressor with different datasets and different error bounds. We perform our exploration by testing 8 widely used lossless compressors under different configurations together with SZ over five well-known scientific simulation datasets. Our experiments show that adopting the best-fit lossless compressor selected based on our analysis can improve the overall compression speed by up to 40% compared to the previous lossless compression technique used in SZ with the comparable quality of reconstructed data.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the past decades, various lossy compressors have been studied broadly due to the ever-increasing volume of data being produced by today’s scientific applications. SZ has been one of the best error-bounded lossy compressors ever raised, and it has a flexible framework that includes four adjustable steps: prediction, quantization, variable-length encoding, and lossless compression. In this paper, we improve the lossy compression performances of the SZ compression model by exploring different existing lossless compression techniques using the Squash data compression benchmark. Specifically, we first characterize the bytes outputted by the first three steps in SZ, then we investigate the best lossless compressor with different datasets and different error bounds. We perform our exploration by testing 8 widely used lossless compressors under different configurations together with SZ over five well-known scientific simulation datasets. Our experiments show that adopting the best-fit lossless compressor selected based on our analysis can improve the overall compression speed by up to 40% compared to the previous lossless compression technique used in SZ with the comparable quality of reconstructed data.",
"fno": "09671954",
"keywords": [
"Compressors",
"Data Compression",
"Encoding",
"Image Coding",
"Variable Length Encoding",
"Lossy Compression Performances",
"SZ Compression Model",
"Squash Data Compression Benchmark",
"Lossless Compressor",
"Scientific Simulation Datasets",
"Compression Speed",
"Best Fit Lossless Compression Techniques",
"Scientific Applications",
"Error Bounded Lossy Compressors",
"Quantization Signal",
"Conferences",
"Data Compression",
"Big Data",
"Benchmark Testing",
"Compressors",
"Encoding"
],
"authors": [
{
"affiliation": "University of California,Riverside,CA,USA",
"fullName": "Jinyang Liu",
"givenName": "Jinyang",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California,Riverside,CA,USA",
"fullName": "Sihuan Li",
"givenName": "Sihuan",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Argonne National Laboratory,IL,USA",
"fullName": "Sheng Di",
"givenName": "Sheng",
"surname": "Di",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Missouri University of Science and Technology,Rolla,MO,USA",
"fullName": "Xin Liang",
"givenName": "Xin",
"surname": "Liang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California,Riverside,CA,USA",
"fullName": "Kai Zhao",
"givenName": "Kai",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Washington State University,Pullman,WA,USA",
"fullName": "Dingwen Tao",
"givenName": "Dingwen",
"surname": "Tao",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of California,Riverside,CA,USA",
"fullName": "Zizhong Chen",
"givenName": "Zizhong",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Argonne National Laboratory,IL,USA",
"fullName": "Franck Cappello",
"givenName": "Franck",
"surname": "Cappello",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-12-01T00:00:00",
"pubType": "proceedings",
"pages": "2986-2991",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-3902-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09671354",
"articleId": "1A8h5jm3noI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09671356",
"articleId": "1A8hptR27ew",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cluster/2018/8319/0/831900a179",
"title": "An Efficient Transformation Scheme for Lossy Data Compression with Point-Wise Relative Error Bound",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a179/17D45W2Wyz4",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2018/8319/0/831900a314",
"title": "Fixed-PSNR Lossy Compression for Scientific Data",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a314/17D45WYQJ7B",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2019/08/08621017",
"title": "Optimizing Lossy Compression Rate-Distortion from Automatic Online Selection between SZ and ZFP",
"doi": null,
"abstractUrl": "/journal/td/2019/08/08621017/17D45WrVgaA",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2022/8045/0/10020345",
"title": "Towards Guaranteeing Error Bound in DCT-based Lossy Compression",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2022/10020345/1KfSYuOtYaI",
"parentPublication": {
"id": "proceedings/big-data/2022/8045/0",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/msst/2019/3920/0/392000a065",
"title": "Accelerating Relative-error Bounded Lossy Compression for HPC datasets with Precomputation-Based Mechanisms",
"doi": null,
"abstractUrl": "/proceedings-article/msst/2019/392000a065/1eEUKLdkoV2",
"parentPublication": {
"id": "proceedings/msst/2019/3920/0",
"title": "2019 35th Symposium on Mass Storage Systems and Technologies (MSST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2020/07/08821342",
"title": "Compression Ratio Modeling and Estimation across Error Bounds for Lossy Compression",
"doi": null,
"abstractUrl": "/journal/td/2020/07/08821342/1eTOP5vYDhm",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2020/07/08989806",
"title": "Performance Optimization for Relative-Error-Bounded Lossy Compression on Scientific Data",
"doi": null,
"abstractUrl": "/journal/td/2020/07/08989806/1hlpwaAlRGE",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2020/6876/0/09139812",
"title": "FRaZ: A Generic High-Fidelity Fixed-Ratio Lossy Compression Framework for Scientific Floating-point Data",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2020/09139812/1lss8nVQuis",
"parentPublication": {
"id": "proceedings/ipdps/2020/6876/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2023/01/09380370",
"title": "High-Ratio Lossy Compression: Exploring the Autoencoder to Compress Scientific Data",
"doi": null,
"abstractUrl": "/journal/bd/2023/01/09380370/1s2FYtnQsZq",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/drbsd-7/2021/8672/0/867200a026",
"title": "Unbalanced Parallel I/O: An Often-Neglected Side Effect of Lossy Scientific Data Compression",
"doi": null,
"abstractUrl": "/proceedings-article/drbsd-7/2021/867200a026/1zHIzAJXHBC",
"parentPublication": {
"id": "proceedings/drbsd-7/2021/8672/0",
"title": "2021 7th International Workshop on Data Analysis and Reduction for Big Scientific Data (DRBSD-7)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1KfQshha0dW",
"title": "2022 IEEE International Conference on Big Data (Big Data)",
"acronym": "big-data",
"groupId": "10020192",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1KfSYuOtYaI",
"doi": "10.1109/BigData55660.2022.10020345",
"title": "Towards Guaranteeing Error Bound in DCT-based Lossy Compression",
"normalizedTitle": "Towards Guaranteeing Error Bound in DCT-based Lossy Compression",
"abstract": "High-performance computing (HPC) systems that run scientific simulations of significance produce a large amount of data during runtime. Transferring or storing such big datasets causes a severe I/O bottleneck and a considerable storage burden. Applying compression techniques, particularly lossy compressors, can reduce the size of the data and mitigate such overheads. Unlike lossless compression algorithms, error-controlled lossy compressors could significantly reduce the data size while respecting the user-defined error bound. DCTZ is one of the transform-based lossy compressors with a highly efficient encoding and purpose-built error control mechanism that accomplishes high compression ratios with high data fidelity. However, since DCTZ quantizes the DCT coefficients in the frequency domain, it may only partially control the relative error bound defined by the user. In this paper, we aim to improve the compression quality of DCTZ. Specifically, we propose a preconditioning method based on level offsetting and scaling to control the magnitude of input of the DCTZ framework, thereby enforcing stricter error bounds. We evaluate the performance of our method in terms of compression ratio and rate distortion with real-world HPC datasets. Our experimental result shows that our method can achieve a higher compression ratio than other state-of-the-art lossy compressors with a tighter error bound while precisely guaranteeing the user-defined error bound.",
"abstracts": [
{
"abstractType": "Regular",
"content": "High-performance computing (HPC) systems that run scientific simulations of significance produce a large amount of data during runtime. Transferring or storing such big datasets causes a severe I/O bottleneck and a considerable storage burden. Applying compression techniques, particularly lossy compressors, can reduce the size of the data and mitigate such overheads. Unlike lossless compression algorithms, error-controlled lossy compressors could significantly reduce the data size while respecting the user-defined error bound. DCTZ is one of the transform-based lossy compressors with a highly efficient encoding and purpose-built error control mechanism that accomplishes high compression ratios with high data fidelity. However, since DCTZ quantizes the DCT coefficients in the frequency domain, it may only partially control the relative error bound defined by the user. In this paper, we aim to improve the compression quality of DCTZ. Specifically, we propose a preconditioning method based on level offsetting and scaling to control the magnitude of input of the DCTZ framework, thereby enforcing stricter error bounds. We evaluate the performance of our method in terms of compression ratio and rate distortion with real-world HPC datasets. Our experimental result shows that our method can achieve a higher compression ratio than other state-of-the-art lossy compressors with a tighter error bound while precisely guaranteeing the user-defined error bound.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "High-performance computing (HPC) systems that run scientific simulations of significance produce a large amount of data during runtime. Transferring or storing such big datasets causes a severe I/O bottleneck and a considerable storage burden. Applying compression techniques, particularly lossy compressors, can reduce the size of the data and mitigate such overheads. Unlike lossless compression algorithms, error-controlled lossy compressors could significantly reduce the data size while respecting the user-defined error bound. DCTZ is one of the transform-based lossy compressors with a highly efficient encoding and purpose-built error control mechanism that accomplishes high compression ratios with high data fidelity. However, since DCTZ quantizes the DCT coefficients in the frequency domain, it may only partially control the relative error bound defined by the user. In this paper, we aim to improve the compression quality of DCTZ. Specifically, we propose a preconditioning method based on level offsetting and scaling to control the magnitude of input of the DCTZ framework, thereby enforcing stricter error bounds. We evaluate the performance of our method in terms of compression ratio and rate distortion with real-world HPC datasets. Our experimental result shows that our method can achieve a higher compression ratio than other state-of-the-art lossy compressors with a tighter error bound while precisely guaranteeing the user-defined error bound.",
"fno": "10020345",
"keywords": [
"Data Compression",
"Discrete Cosine Transforms",
"Image Coding",
"Big Datasets",
"Compression Quality",
"Compression Ratio",
"DCT Coefficients",
"DCT Based Lossy Compression",
"DCTZ Framework",
"Error Bound",
"Error Controlled Lossy Compressors",
"High Data Fidelity",
"High Performance Computing Systems",
"Highly Efficient Encoding",
"Lossless Compression Algorithms",
"Lossy Compressors",
"Purpose Built Error Control Mechanism",
"Real World HPC Datasets",
"Storage Burden",
"User Defined Error",
"Runtime",
"High Performance Computing",
"Frequency Domain Analysis",
"Rate Distortion",
"Big Data",
"Compressors",
"Encoding",
"Lossy Compression",
"DCT",
"Precondition",
"Rate Distortion"
],
"authors": [
{
"affiliation": "University of Massachusetts Lowell,Lowell,MA",
"fullName": "Jiaxi Chen",
"givenName": "Jiaxi",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "ETRI,Daegu,Korea",
"fullName": "Aekyeung Moon",
"givenName": "Aekyeung",
"surname": "Moon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Massachusetts Lowell,Lowell,MA",
"fullName": "Seung Woo Son",
"givenName": "Seung Woo",
"surname": "Son",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "big-data",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-12-01T00:00:00",
"pubType": "proceedings",
"pages": "3139-3145",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8045-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "10021070",
"articleId": "1KfRAGyfOGA",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10020267",
"articleId": "1KfT2ODAoiQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cluster/2018/8319/0/831900a179",
"title": "An Efficient Transformation Scheme for Lossy Data Compression with Point-Wise Relative Error Bound",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a179/17D45W2Wyz4",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2018/8319/0/831900a314",
"title": "Fixed-PSNR Lossy Compression for Scientific Data",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2018/831900a314/17D45WYQJ7B",
"parentPublication": {
"id": "proceedings/cluster/2018/8319/0",
"title": "2018 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671954",
"title": "Improving Lossy Compression for SZ by Exploring the Best-Fit Lossless Compression Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671954/1A8gzQrzAeQ",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2021/1016/0/101600a394",
"title": "Optimizing Multi-Range based Error-Bounded Lossy Compression for Scientific Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2021/101600a394/1Aqy7mGesdW",
"parentPublication": {
"id": "proceedings/hipc/2021/1016/0",
"title": "2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2022/12/09730115",
"title": "OptZConfig: Efficient Parallel Optimization of Lossy Compression Configuration",
"doi": null,
"abstractUrl": "/journal/td/2022/12/09730115/1BzQj9sGq2c",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/drbsd/2022/6337/0/633700a044",
"title": "Understanding Impact of Lossy Compression on Derivative-related Metrics in Scientific Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/drbsd/2022/633700a044/1KhjGps56H6",
"parentPublication": {
"id": "proceedings/drbsd/2022/6337/0",
"title": "2022 IEEE/ACM 8th International Workshop on Data Analysis and Reduction for Big Scientific Data (DRBSD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2022/5444/0/544400a892",
"title": "Dynamic Quality Metric Oriented Error Bounded Lossy Compression for Scientific Datasets",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2022/544400a892/1L07rfxr1e0",
"parentPublication": {
"id": "proceedings/sc/2022/5444/0/",
"title": "SC22: International Conference for High Performance Computing, Networking, Storage and Analysis",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2020/07/08821342",
"title": "Compression Ratio Modeling and Estimation across Error Bounds for Lossy Compression",
"doi": null,
"abstractUrl": "/journal/td/2020/07/08821342/1eTOP5vYDhm",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2020/6876/0/09139812",
"title": "FRaZ: A Generic High-Fidelity Fixed-Ratio Lossy Compression Framework for Scientific Floating-point Data",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2020/09139812/1lss8nVQuis",
"parentPublication": {
"id": "proceedings/ipdps/2020/6876/0",
"title": "2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2020/6677/0/667700a326",
"title": "Towards End-to-end SDC Detection for HPC Applications Equipped with Lossy Compression",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2020/667700a326/1oqKDefjW36",
"parentPublication": {
"id": "proceedings/cluster/2020/6677/0",
"title": "2020 IEEE International Conference on Cluster Computing (CLUSTER)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1hHLm2dSyn6",
"title": "2019 2nd World Conference on Mechanical Engineering and Intelligent Manufacturing (WCMEIM)",
"acronym": "wcmeim",
"groupId": "1835484",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1hHLqx7CE9i",
"doi": "10.1109/WCMEIM48965.2019.00107",
"title": "Image Compression Algorithms Based on Dual Tree-Complex Wavelet Transform",
"normalizedTitle": "Image Compression Algorithms Based on Dual Tree-Complex Wavelet Transform",
"abstract": "Aiming to improve the efficiency of image compression on the premise of controlling the compression time, an image compression oriented algorithm is proposed based on Dual Tree-Complex Wavelet and arithmetic coding algorithm. Methods : decompose the read-in image by Dt-cwt, then using Wellner (an adaptive binarization method) to calculate the image's threshold. Scan the image by EZW algorithm, and compared the threshold with wavelet coefficients, then output the important coefficients and compress these data by arithmetic coding. Finally, the compressed image was output by encoding inverse transform. Results :Four-level decomposition of Dual Tree-Complex Wavelet and seven-times scanning of the image have better compression result and shorter running time. Conclusion :The hardware configuration of this method is simple, and this algorithm can compress the image with high quality in a short time.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Aiming to improve the efficiency of image compression on the premise of controlling the compression time, an image compression oriented algorithm is proposed based on Dual Tree-Complex Wavelet and arithmetic coding algorithm. Methods : decompose the read-in image by Dt-cwt, then using Wellner (an adaptive binarization method) to calculate the image's threshold. Scan the image by EZW algorithm, and compared the threshold with wavelet coefficients, then output the important coefficients and compress these data by arithmetic coding. Finally, the compressed image was output by encoding inverse transform. Results :Four-level decomposition of Dual Tree-Complex Wavelet and seven-times scanning of the image have better compression result and shorter running time. Conclusion :The hardware configuration of this method is simple, and this algorithm can compress the image with high quality in a short time.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Aiming to improve the efficiency of image compression on the premise of controlling the compression time, an image compression oriented algorithm is proposed based on Dual Tree-Complex Wavelet and arithmetic coding algorithm. Methods : decompose the read-in image by Dt-cwt, then using Wellner (an adaptive binarization method) to calculate the image's threshold. Scan the image by EZW algorithm, and compared the threshold with wavelet coefficients, then output the important coefficients and compress these data by arithmetic coding. Finally, the compressed image was output by encoding inverse transform. Results :Four-level decomposition of Dual Tree-Complex Wavelet and seven-times scanning of the image have better compression result and shorter running time. Conclusion :The hardware configuration of this method is simple, and this algorithm can compress the image with high quality in a short time.",
"fno": "504500a508",
"keywords": [
"Arithmetic Codes",
"Data Compression",
"Image Coding",
"Trees Mathematics",
"Wavelet Transforms",
"Image Compression Oriented Algorithm",
"Arithmetic Coding Algorithm",
"Adaptive Binarization Method",
"EZW Algorithm",
"Wavelet Coefficients",
"Dual Tree Complex Wavelet Transform",
"Image Threshold",
"Inverse Transform",
"Image Coding",
"Encoding",
"Mechanical Engineering",
"Manufacturing",
"Binary Codes",
"Laplace Equations",
"Dual Tree Complex Wavelet",
"EZW Algorithm",
"Arithmetic Coding",
"Threshold",
"Compress"
],
"authors": [
{
"affiliation": "University of Shanghai for Science and Technology, China",
"fullName": "Jing Wang",
"givenName": "Jing",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Shanghai for Science and Technology, China",
"fullName": "Wenju Wang",
"givenName": "Wenju",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Shanghai for Science and Technology, China",
"fullName": "Xiaohong Wang",
"givenName": "Xiaohong",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "wcmeim",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-11-01T00:00:00",
"pubType": "proceedings",
"pages": "508-511",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-5045-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "504500a504",
"articleId": "1hHLslD1kyI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "504500a512",
"articleId": "1hHLrh9Lj20",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isme/2010/4132/1/4132a559",
"title": "Images Compression Using Dual Tree Complex Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/isme/2010/4132a559/12OmNBA9oBL",
"parentPublication": {
"id": "isme/2010/4132/1",
"title": "Information Science and Management Engineering, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmlc/2010/6006/0/05460747",
"title": "Video Coding Technique Using Swarm Intelligence in 3-D Dual Tree Complex Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2010/05460747/12OmNBlXs4E",
"parentPublication": {
"id": "proceedings/icmlc/2010/6006/0",
"title": "2nd International Conference on Machine Learning and Computing (ICMLC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2016/0811/0/0811a273",
"title": "Theoretical Improvement of the Image Compression Method Based on Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2016/0811a273/12OmNBlofP0",
"parentPublication": {
"id": "proceedings/cgiv/2016/0811/0",
"title": "2016 13th International Conference on Computer Graphics, Imaging and Visualization (CGiV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icccnt/2013/3926/0/06726772",
"title": "2D-discrete walsh wavelet transform for image compression with arithmetic coding",
"doi": null,
"abstractUrl": "/proceedings-article/icccnt/2013/06726772/12OmNBp52CT",
"parentPublication": {
"id": "proceedings/icccnt/2013/3926/0",
"title": "2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/1/81831065",
"title": "Waveform and image compression using the Burrows Wheeler transform and the wavelet transform",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81831065/12OmNBr4eqK",
"parentPublication": {
"id": "proceedings/icip/1997/8183/1",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisim/2007/2894/0/28940305",
"title": "Using Wavelet Transform, DPCM and Adaptive Run-length Coding to Compress Images",
"doi": null,
"abstractUrl": "/proceedings-article/cisim/2007/28940305/12OmNvT2oJC",
"parentPublication": {
"id": "proceedings/cisim/2007/2894/0",
"title": "2007 6th International Conference on Computer Information Systems and Industrial Management Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2016/4320/0/07945738",
"title": "Toward an optimal B-spline wavelet transform for image compression",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2016/07945738/12OmNwAKCKX",
"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/imsccs/2006/2581/1/25810298",
"title": "Research on Compression Method Based on Integer Wavelet Transform and SPIHT for Historical Data in Process Industry",
"doi": null,
"abstractUrl": "/proceedings-article/imsccs/2006/25810298/12OmNwDACwH",
"parentPublication": {
"id": "proceedings/imsccs/2006/2581/1",
"title": "Computer and Computational Sciences, International Multi-Symposiums on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cso/2009/3605/1/3605a811",
"title": "An Image Coding Approach Using Wavelet-Based Adaptive Contourlet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/cso/2009/3605a811/12OmNyUnEH5",
"parentPublication": {
"id": "cso/2009/3605/1",
"title": "2009 International Joint Conference on Computational Sciences and Optimization",
"__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"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1zdPxmBIJ1u",
"title": "2021 IEEE 11th Symposium on Large Data Analysis and Visualization (LDAV)",
"acronym": "ldav",
"groupId": "1800568",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1zdPAE86Zhu",
"doi": "10.1109/LDAV53230.2021.00011",
"title": "High-Quality and Low-Memory-Footprint Progressive Decoding of Large-Scale Particle Data",
"normalizedTitle": "High-Quality and Low-Memory-Footprint Progressive Decoding of Large-Scale Particle Data",
"abstract": "Particle representations are used often in large-scale simulations and observations, frequently creating datasets containing several millions of particles or more. Due to their sheer size, such datasets are difficult to store, transfer, and analyze efficiently. Data compression is a promising solution; however, effective approaches to compress particle data are lacking and no community-standard and accepted techniques exist. Current techniques are designed either to compress small data very well but require high computational resources when applied to large data, or to work with large data but without a focus on compression, resulting in low reconstruction quality per bit stored. In this paper, we present innovations targeting tree-based particle compression approaches that improve the tradeoff between high quality and low memory-footprint for compression and decompression of large particle datasets. Inspired by the lazy wavelet transform, we introduce a new way of partitioning space, which allows a low-cost depth-first traversal of a particle hierarchy to cover the space broadly. We also devise novel data-adaptive traversal orders that significantly reduce reconstruction error compared to traditional data-agnostic orders such as breadth-first and depth-first traversals. The new partitioning and traversal schemes are used to build novel particle hierarchies that can be traversed with asymptotically constant memory footprint while incurring low reconstruction error. Our solution to encoding and (lossy) decoding of large particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error heuristics can be supplied by the user. Finally, through extensive experimentation, we demonstrate the efficacy and the flexibility of the proposed techniques when combined as well as when used independently with existing approaches on a wide range of scientific particle datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Particle representations are used often in large-scale simulations and observations, frequently creating datasets containing several millions of particles or more. Due to their sheer size, such datasets are difficult to store, transfer, and analyze efficiently. Data compression is a promising solution; however, effective approaches to compress particle data are lacking and no community-standard and accepted techniques exist. Current techniques are designed either to compress small data very well but require high computational resources when applied to large data, or to work with large data but without a focus on compression, resulting in low reconstruction quality per bit stored. In this paper, we present innovations targeting tree-based particle compression approaches that improve the tradeoff between high quality and low memory-footprint for compression and decompression of large particle datasets. Inspired by the lazy wavelet transform, we introduce a new way of partitioning space, which allows a low-cost depth-first traversal of a particle hierarchy to cover the space broadly. We also devise novel data-adaptive traversal orders that significantly reduce reconstruction error compared to traditional data-agnostic orders such as breadth-first and depth-first traversals. The new partitioning and traversal schemes are used to build novel particle hierarchies that can be traversed with asymptotically constant memory footprint while incurring low reconstruction error. Our solution to encoding and (lossy) decoding of large particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error heuristics can be supplied by the user. Finally, through extensive experimentation, we demonstrate the efficacy and the flexibility of the proposed techniques when combined as well as when used independently with existing approaches on a wide range of scientific particle datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Particle representations are used often in large-scale simulations and observations, frequently creating datasets containing several millions of particles or more. Due to their sheer size, such datasets are difficult to store, transfer, and analyze efficiently. Data compression is a promising solution; however, effective approaches to compress particle data are lacking and no community-standard and accepted techniques exist. Current techniques are designed either to compress small data very well but require high computational resources when applied to large data, or to work with large data but without a focus on compression, resulting in low reconstruction quality per bit stored. In this paper, we present innovations targeting tree-based particle compression approaches that improve the tradeoff between high quality and low memory-footprint for compression and decompression of large particle datasets. Inspired by the lazy wavelet transform, we introduce a new way of partitioning space, which allows a low-cost depth-first traversal of a particle hierarchy to cover the space broadly. We also devise novel data-adaptive traversal orders that significantly reduce reconstruction error compared to traditional data-agnostic orders such as breadth-first and depth-first traversals. The new partitioning and traversal schemes are used to build novel particle hierarchies that can be traversed with asymptotically constant memory footprint while incurring low reconstruction error. Our solution to encoding and (lossy) decoding of large particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error heuristics can be supplied by the user. Finally, through extensive experimentation, we demonstrate the efficacy and the flexibility of the proposed techniques when combined as well as when used independently with existing approaches on a wide range of scientific particle datasets.",
"fno": "328300a032",
"keywords": [
"Computational Complexity",
"Data Compression",
"Decoding",
"Image Coding",
"Image Reconstruction",
"Image Representation",
"Trees Mathematics",
"Wavelet Transforms",
"Traditional Data Agnostic Orders",
"Novel Particle Hierarchies",
"Asymptotically Constant Memory Footprint",
"Low Reconstruction Error",
"Scientific Particle Datasets",
"Low Memory Footprint Progressive Decoding",
"Large Scale Particle Data",
"Particle Representations",
"Large Scale Simulations",
"Data Compression",
"High Computational Resources",
"Low Reconstruction Quality",
"Tree Based Particle Compression Approaches",
"Low Memory Footprint",
"Low Cost Depth First Traversal",
"Particle Hierarchy",
"Data Adaptive Traversal Orders",
"Wavelet Transforms",
"Technological Innovation",
"Data Analysis",
"Data Visualization",
"Data Compression",
"Encoding",
"Decoding",
"Particle Datasets",
"Data Compression",
"Coarse Approximation",
"Progressive Decompression",
"Tree Traversal",
"Multiresolution"
],
"authors": [
{
"affiliation": "University of Utah,SCI Institute",
"fullName": "Duong Hoang",
"givenName": "Duong",
"surname": "Hoang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CASC,Lawrence Livermore National Laboratory",
"fullName": "Harsh Bhatia",
"givenName": "Harsh",
"surname": "Bhatia",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "CASC,Lawrence Livermore National Laboratory",
"fullName": "Peter Lindstrom",
"givenName": "Peter",
"surname": "Lindstrom",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Utah,SCI Institute",
"fullName": "Valerio Pascucci",
"givenName": "Valerio",
"surname": "Pascucci",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ldav",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-10-01T00:00:00",
"pubType": "proceedings",
"pages": "32-42",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-3283-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "328300a022",
"articleId": "1zdPy2M0kZG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "328300a043",
"articleId": "1zdPDTXc4hy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccd/1992/3110/0/00276242",
"title": "MARVLE: a VLSI chip for variable length encoding and decoding",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/1992/00276242/12OmNAoDhVU",
"parentPublication": {
"id": "proceedings/iccd/1992/3110/0",
"title": "Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bmei/2008/3118/2/3118b320",
"title": "A High Efficient Quality Control Strategy for Wavelet-Based ECG Data Compression System",
"doi": null,
"abstractUrl": "/proceedings-article/bmei/2008/3118b320/12OmNAoUTyJ",
"parentPublication": {
"id": "proceedings/bmei/2008/3118/2",
"title": "BioMedical Engineering and Informatics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/1/81831283",
"title": "High quality image compression using the wavelet transform",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81831283/12OmNqAU6ux",
"parentPublication": {
"id": "proceedings/icip/1997/8183/1",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2010/6425/0/05453485",
"title": "gFPC: A Self-Tuning Compression Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2010/05453485/12OmNviZlmF",
"parentPublication": {
"id": "proceedings/dcc/2010/6425/0",
"title": "2010 Data Compression Conference (DCC 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/1991/9202/0/00213345",
"title": "Multibit decoding/encoding of binary codes using memory based architectures",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/1991/00213345/12OmNwl8GEi",
"parentPublication": {
"id": "proceedings/dcc/1991/9202/0",
"title": "1991 Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2012/4656/0/4656a398",
"title": "Efficient Progressive Compression of 3D Points by Maximizing Tangent-Plane Continuity",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2012/4656a398/12OmNxymo98",
"parentPublication": {
"id": "proceedings/dcc/2012/4656/0",
"title": "Data Compression Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346332",
"title": "Progressive transmission of scientific data using biorthogonal wavelet transform",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346332/12OmNzVXNQ0",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10085988",
"title": "Progressive Tree-Based Compression of Large-Scale Particle Data",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10085988/1LSKDIqNAti",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006146",
"title": "Adaptive Deep Learning based Time-Varying Volume Compression",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006146/1hJseUsYKNa",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2020/02/09052432",
"title": "Wavelet-Based Quality-Constrained ECG Data Compression System Without Decoding Process",
"doi": null,
"abstractUrl": "/magazine/mu/2020/02/09052432/1iFLIiR4tcQ",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1G55WEFExd6",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"acronym": "cvprw",
"groupId": "1001809",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1G56zb8vJGU",
"doi": "10.1109/CVPRW56347.2022.00427",
"title": "Towards Exemplar-Free Continual Learning in Vision Transformers: an Account of Attention, Functional and Weight Regularization",
"normalizedTitle": "Towards Exemplar-Free Continual Learning in Vision Transformers: an Account of Attention, Functional and Weight Regularization",
"abstract": "In this paper, we investigate the continual learning of Vision Transformers (ViT) for the challenging exemplar-free scenario, with special focus on how to efficiently distill the knowledge of its crucial self-attention mechanism (SAM). Our work takes an initial step towards a surgical investigation of SAM for designing coherent continual learning methods in ViTs. We first carry out an evaluation of established continual learning regularization techniques. We then examine the effect of regularization when applied to two key enablers of SAM: (a) the contextualized embedding layers, for their ability to capture well-scaled representations with respect to the values, and (b) the prescaled attention maps, for carrying value-independent global contextual information. We depict the perks of each distilling strategy on two image recognition benchmarks (CIFAR100 and ImageNet-32) – while (a) leads to a better overall accuracy, (b) helps enhance the rigidity by maintaining competitive performances. Furthermore, we identify the limitation imposed by the symmetric nature of regularization losses. To alleviate this, we propose an asymmetric variant and apply it to the pooled output distillation (POD) loss adapted for ViTs. Our experiments confirm that introducing asymmetry to POD boosts its plasticity while retaining stability across (a) and (b). Moreover, we acknowledge low forgetting measures for all the compared methods, indicating that ViTs might be naturally inclined continual learners.<sup>1</sup>",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we investigate the continual learning of Vision Transformers (ViT) for the challenging exemplar-free scenario, with special focus on how to efficiently distill the knowledge of its crucial self-attention mechanism (SAM). Our work takes an initial step towards a surgical investigation of SAM for designing coherent continual learning methods in ViTs. We first carry out an evaluation of established continual learning regularization techniques. We then examine the effect of regularization when applied to two key enablers of SAM: (a) the contextualized embedding layers, for their ability to capture well-scaled representations with respect to the values, and (b) the prescaled attention maps, for carrying value-independent global contextual information. We depict the perks of each distilling strategy on two image recognition benchmarks (CIFAR100 and ImageNet-32) – while (a) leads to a better overall accuracy, (b) helps enhance the rigidity by maintaining competitive performances. Furthermore, we identify the limitation imposed by the symmetric nature of regularization losses. To alleviate this, we propose an asymmetric variant and apply it to the pooled output distillation (POD) loss adapted for ViTs. Our experiments confirm that introducing asymmetry to POD boosts its plasticity while retaining stability across (a) and (b). Moreover, we acknowledge low forgetting measures for all the compared methods, indicating that ViTs might be naturally inclined continual learners.<sup>1</sup>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we investigate the continual learning of Vision Transformers (ViT) for the challenging exemplar-free scenario, with special focus on how to efficiently distill the knowledge of its crucial self-attention mechanism (SAM). Our work takes an initial step towards a surgical investigation of SAM for designing coherent continual learning methods in ViTs. We first carry out an evaluation of established continual learning regularization techniques. We then examine the effect of regularization when applied to two key enablers of SAM: (a) the contextualized embedding layers, for their ability to capture well-scaled representations with respect to the values, and (b) the prescaled attention maps, for carrying value-independent global contextual information. We depict the perks of each distilling strategy on two image recognition benchmarks (CIFAR100 and ImageNet-32) – while (a) leads to a better overall accuracy, (b) helps enhance the rigidity by maintaining competitive performances. Furthermore, we identify the limitation imposed by the symmetric nature of regularization losses. To alleviate this, we propose an asymmetric variant and apply it to the pooled output distillation (POD) loss adapted for ViTs. Our experiments confirm that introducing asymmetry to POD boosts its plasticity while retaining stability across (a) and (b). Moreover, we acknowledge low forgetting measures for all the compared methods, indicating that ViTs might be naturally inclined continual learners.1",
"fno": "873900d819",
"keywords": [
"Image Recognition",
"Image Representation",
"Learning Artificial Intelligence",
"Towards Exemplar Free Continual Learning",
"Vision Transformers",
"Vi T",
"Exemplar Free Scenario",
"Crucial Self Attention Mechanism",
"SAM",
"Surgical Investigation",
"Coherent Continual Learning Methods",
"Established Continual Learning Regularization Techniques",
"Contextualized Embedding Layers",
"Prescaled Attention Maps",
"Value Independent Global Contextual Information",
"Distilling Strategy",
"Image Recognition Benchmarks",
"Regularization Losses",
"Pooled Output Distillation Loss",
"Continual Learners",
"Learning Systems",
"Weight Measurement",
"Image Recognition",
"Surgery",
"Benchmark Testing",
"Transformers",
"Stability Analysis"
],
"authors": [
{
"affiliation": "Ca’ Foscari University,Venice,Italy",
"fullName": "Francesco Pelosin",
"givenName": "Francesco",
"surname": "Pelosin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of New South Wales,Sydney,Australia",
"fullName": "Saurav Jha",
"givenName": "Saurav",
"surname": "Jha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Ca’ Foscari University,Venice,Italy",
"fullName": "Andrea Torsello",
"givenName": "Andrea",
"surname": "Torsello",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Computer Vision Center,Barcelona,Spain",
"fullName": "Bogdan Raducanu",
"givenName": "Bogdan",
"surname": "Raducanu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Computer Vision Center,Barcelona,Spain",
"fullName": "Joost van de Weijer",
"givenName": "Joost",
"surname": "van de Weijer",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvprw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "3819-3828",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-8739-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1G56z7EMAPS",
"name": "pcvprw202287390-09857026s1-mm_873900d819.zip",
"size": "1.52 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvprw202287390-09857026s1-mm_873900d819.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "873900d809",
"articleId": "1G572cUrySY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "873900d829",
"articleId": "1G56ofomHmg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2022/8739/0/873900d710",
"title": "Continual Hippocampus Segmentation with Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900d710/1G57dwyiIco",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2125",
"title": "TransMix: Attend to Mix for Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2125/1H0LG1Xqxbi",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600k0011",
"title": "GradViT: Gradient Inversion of Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600k0011/1H0OCJfdEJi",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a150",
"title": "Meta-attention for ViT-backed Continual Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a150/1H1hvknszFS",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a171",
"title": "Continual Learning with Lifelong Vision Transformer",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a171/1H1jShcswrS",
"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/bibm/2022/6819/0/09995580",
"title": "Replay-Oriented Gradient Projection Memory for Continual Learning in Medical Scenarios",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995580/1JC22L55YWY",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpca/2023/7652/0/10071047",
"title": "HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2023/10071047/1LMbGetPrxu",
"parentPublication": {
"id": "proceedings/hpca/2023/7652/0",
"title": "2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412744",
"title": "Energy Minimum Regularization in Continual Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412744/1tmjmUChyvu",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900a184",
"title": "Training Networks in Null Space of Feature Covariance for Continual Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900a184/1yeI4a3FDjy",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/4.509E44",
"title": "PLOP: Learning without Forgetting for Continual Semantic Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/4.509E44/1yeLV6eQyGc",
"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": "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": "1H0LFD5xsCQ",
"doi": "10.1109/CVPR52688.2022.01199",
"title": "AdaViT: Adaptive Vision Transformers for Efficient Image Recognition",
"normalizedTitle": "AdaViT: Adaptive Vision Transformers for Efficient Image Recognition",
"abstract": "Built on top of self-attention mechanisms, vision transformers have demonstrated remarkable performance on a variety of tasks recently. While achieving excellent performance, they still require relatively intensive computational cost that scales up drastically as the numbers of patches, self-attention heads and transformer blocks increase. In this paper, we argue that due to the large variations among images, their need for modeling long-range dependencies between patches differ. To this end, we introduce AdaViT, an adaptive computation framework that learns to derive usage policies on which patches, self-attention heads and transformer blocks to use throughout the backbone on a per-input basis, aiming to improve inference efficiency of vision transformers with a minimal drop of accuracy for image recognition. Optimized jointly with a transformer backbone in an end-to-end manner, a light-weight decision network is attached to the backbone to produce decisions on-the-fly. Extensive experiments on ImageNet demonstrate that our method obtains more than 2 × improvement on efficiency compared to state-of-the-art vision transformers with only 0.8% drop of accuracy, achieving good efficiency/accuracy trade-offs conditioned on different computational budgets. We further conduct quantitative and qualitative analysis on learned usage polices and provide more insights on the redundancy in vision transformers. Code is available at ht tps: / / gi thub. com/MengLcool/AdaVi T.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Built on top of self-attention mechanisms, vision transformers have demonstrated remarkable performance on a variety of tasks recently. While achieving excellent performance, they still require relatively intensive computational cost that scales up drastically as the numbers of patches, self-attention heads and transformer blocks increase. In this paper, we argue that due to the large variations among images, their need for modeling long-range dependencies between patches differ. To this end, we introduce AdaViT, an adaptive computation framework that learns to derive usage policies on which patches, self-attention heads and transformer blocks to use throughout the backbone on a per-input basis, aiming to improve inference efficiency of vision transformers with a minimal drop of accuracy for image recognition. Optimized jointly with a transformer backbone in an end-to-end manner, a light-weight decision network is attached to the backbone to produce decisions on-the-fly. Extensive experiments on ImageNet demonstrate that our method obtains more than 2 × improvement on efficiency compared to state-of-the-art vision transformers with only 0.8% drop of accuracy, achieving good efficiency/accuracy trade-offs conditioned on different computational budgets. We further conduct quantitative and qualitative analysis on learned usage polices and provide more insights on the redundancy in vision transformers. Code is available at ht tps: / / gi thub. com/MengLcool/AdaVi T.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Built on top of self-attention mechanisms, vision transformers have demonstrated remarkable performance on a variety of tasks recently. While achieving excellent performance, they still require relatively intensive computational cost that scales up drastically as the numbers of patches, self-attention heads and transformer blocks increase. In this paper, we argue that due to the large variations among images, their need for modeling long-range dependencies between patches differ. To this end, we introduce AdaViT, an adaptive computation framework that learns to derive usage policies on which patches, self-attention heads and transformer blocks to use throughout the backbone on a per-input basis, aiming to improve inference efficiency of vision transformers with a minimal drop of accuracy for image recognition. Optimized jointly with a transformer backbone in an end-to-end manner, a light-weight decision network is attached to the backbone to produce decisions on-the-fly. Extensive experiments on ImageNet demonstrate that our method obtains more than 2 × improvement on efficiency compared to state-of-the-art vision transformers with only 0.8% drop of accuracy, achieving good efficiency/accuracy trade-offs conditioned on different computational budgets. We further conduct quantitative and qualitative analysis on learned usage polices and provide more insights on the redundancy in vision transformers. Code is available at ht tps: / / gi thub. com/MengLcool/AdaVi T.",
"fno": "694600m2299",
"keywords": [
"Computer Vision",
"Feature Extraction",
"Image Recognition",
"Inference Mechanisms",
"Iterative Methods",
"Learning Artificial Intelligence",
"Minimisation",
"Optimisation",
"Pose Estimation",
"Efficient Image Recognition",
"Self Attention Mechanisms",
"Relatively Intensive Computational Cost",
"Self Attention Heads",
"Transformer Blocks Increase",
"Ada Vi T",
"Adaptive Computation Framework",
"Inference Efficiency",
"Transformer Backbone",
"State Of The Art Vision Transformers",
"Different Computational Budgets",
"Adaptive Vision Transformers",
"Computer Vision",
"Image Recognition",
"Head",
"Law Enforcement",
"Computational Modeling",
"Redundancy",
"Transformers",
"Efficient Learning And Inferences Recognition Detection",
"Categorization",
"Retrieval"
],
"authors": [
{
"affiliation": "School of Computer Science, Fudan University,Shanghai Key Lab of Intelligent Info. Processing",
"fullName": "Lingchen Meng",
"givenName": "Lingchen",
"surname": "Meng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Maryland",
"fullName": "Hengduo Li",
"givenName": "Hengduo",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Meta AI",
"fullName": "Bor-Chun Chen",
"givenName": "Bor-Chun",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Maryland",
"fullName": "Shiyi Lan",
"givenName": "Shiyi",
"surname": "Lan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Science, Fudan University,Shanghai Key Lab of Intelligent Info. Processing",
"fullName": "Zuxuan Wu",
"givenName": "Zuxuan",
"surname": "Wu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Computer Science, Fudan University,Shanghai Key Lab of Intelligent Info. Processing",
"fullName": "Yu-Gang Jiang",
"givenName": "Yu-Gang",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Meta AI",
"fullName": "Ser-Nam Lim",
"givenName": "Ser-Nam",
"surname": "Lim",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "12299-12308",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1H0LFzORRKM",
"name": "pcvpr202269460-09879366s1-mm_694600m2299.zip",
"size": "1.61 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202269460-09879366s1-mm_694600m2299.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "694600m2289",
"articleId": "1H1lRrC5GUM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600m2309",
"articleId": "1H1lrFlWdSo",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2021/2812/0/281200a022",
"title": "CvT: Introducing Convolutions to Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200a022/1BmEM0WJfTW",
"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/281200m2159",
"title": "Vision Transformers for Dense Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200m2159/1BmFYYZZpjq",
"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/281200g804",
"title": "Multiscale Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200g804/1BmK1wRYeJO",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859907",
"title": "SimViT: Exploring a Simple Vision Transformer with Sliding Windows",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859907/1G9Ez7LV5wA",
"parentPublication": {
"id": "proceedings/icme/2022/8563/0",
"title": "2022 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2155",
"title": "Patch Slimming for Efficient Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2155/1H1hzytbcXe",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600k0820",
"title": "Reversible Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600k0820/1H1kbeSIuDm",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600h277",
"title": "MPViT: Multi-Path Vision Transformer for Dense Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600h277/1H1mFJYKhwc",
"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/934600c777",
"title": "Multi-level Contrastive Learning for Self-Supervised Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600c777/1KxUTlCRbZS",
"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/hpca/2023/7652/0/10071047",
"title": "HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2023/10071047/1LMbGetPrxu",
"parentPublication": {
"id": "proceedings/hpca/2023/7652/0",
"title": "2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/10081322",
"title": "How Does Attention Work in Vision Transformers? A Visual Analytics Attempt",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/10081322/1LRbRtJhrG0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__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": "1H1hvknszFS",
"doi": "10.1109/CVPR52688.2022.00025",
"title": "Meta-attention for ViT-backed Continual Learning",
"normalizedTitle": "Meta-attention for ViT-backed Continual Learning",
"abstract": "Continual learning is a longstanding research topic due to its crucial role in tackling continually arriving tasks. Up to now, the study of continual learning in computer vision is mainly restricted to convolutional neural networks (CNNs). However, recently there is a tendency that the newly emerging vision transformers (ViTs) are gradually dominating the field of computer vision, which leaves CNN-based continual learning lagging behind as they can suffer from severe performance degradation if straightforwardly applied to ViTs. In this paper, we study ViT-backed continual learning to strive for higher performance riding on recent advances of ViTs. Inspired by mask-based continual learning methods in CNNs, where a mask is learned per task to adapt the pre-trained ViT to the new task, we propose MEta-ATtention (MEAT), i.e., attention to self-attention, to adapt a pre-trained ViT to new tasks without sacrificing performance on already learned tasks. Unlike prior mask-based methods like Piggyback, where all parameters are associated with corresponding masks, MEAT leverages the characteristics of ViTs and only masks a portion of its parameters. It renders MEAT more efficient and effective with less overhead and higher accuracy. Extensive experiments demonstrate that MEAT exhibits significant superiority to its state-of-the-art CNN counterparts, with 4.0 ∼ 6.0% absolute boosts in accuracy. Our code has been released at https://github.com/zju-vipa/MEAT-TIL.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Continual learning is a longstanding research topic due to its crucial role in tackling continually arriving tasks. Up to now, the study of continual learning in computer vision is mainly restricted to convolutional neural networks (CNNs). However, recently there is a tendency that the newly emerging vision transformers (ViTs) are gradually dominating the field of computer vision, which leaves CNN-based continual learning lagging behind as they can suffer from severe performance degradation if straightforwardly applied to ViTs. In this paper, we study ViT-backed continual learning to strive for higher performance riding on recent advances of ViTs. Inspired by mask-based continual learning methods in CNNs, where a mask is learned per task to adapt the pre-trained ViT to the new task, we propose MEta-ATtention (MEAT), i.e., attention to self-attention, to adapt a pre-trained ViT to new tasks without sacrificing performance on already learned tasks. Unlike prior mask-based methods like Piggyback, where all parameters are associated with corresponding masks, MEAT leverages the characteristics of ViTs and only masks a portion of its parameters. It renders MEAT more efficient and effective with less overhead and higher accuracy. Extensive experiments demonstrate that MEAT exhibits significant superiority to its state-of-the-art CNN counterparts, with 4.0 ∼ 6.0% absolute boosts in accuracy. Our code has been released at https://github.com/zju-vipa/MEAT-TIL.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Continual learning is a longstanding research topic due to its crucial role in tackling continually arriving tasks. Up to now, the study of continual learning in computer vision is mainly restricted to convolutional neural networks (CNNs). However, recently there is a tendency that the newly emerging vision transformers (ViTs) are gradually dominating the field of computer vision, which leaves CNN-based continual learning lagging behind as they can suffer from severe performance degradation if straightforwardly applied to ViTs. In this paper, we study ViT-backed continual learning to strive for higher performance riding on recent advances of ViTs. Inspired by mask-based continual learning methods in CNNs, where a mask is learned per task to adapt the pre-trained ViT to the new task, we propose MEta-ATtention (MEAT), i.e., attention to self-attention, to adapt a pre-trained ViT to new tasks without sacrificing performance on already learned tasks. Unlike prior mask-based methods like Piggyback, where all parameters are associated with corresponding masks, MEAT leverages the characteristics of ViTs and only masks a portion of its parameters. It renders MEAT more efficient and effective with less overhead and higher accuracy. Extensive experiments demonstrate that MEAT exhibits significant superiority to its state-of-the-art CNN counterparts, with 4.0 ∼ 6.0% absolute boosts in accuracy. Our code has been released at https://github.com/zju-vipa/MEAT-TIL.",
"fno": "694600a150",
"keywords": [
"Computer Vision",
"Image Representation",
"Learning Artificial Intelligence",
"Neural Nets",
"Vi Ts",
"MEAT",
"Meta Attention",
"Longstanding Research Topic",
"Computer Vision",
"Convolutional Neural Networks",
"CN Ns",
"Newly Emerging Vision Transformers",
"CNN Based Continual Learning",
"Severe Performance Degradation",
"Study Vi T Backed Continual Learning",
"Mask Based Continual Learning Methods",
"Pre Trained Vi T",
"Learned Tasks",
"Learning Systems",
"Degradation",
"Computer Vision",
"Codes",
"Transformers",
"Pattern Recognition",
"Convolutional Neural Networks"
],
"authors": [
{
"affiliation": "Zhejiang University",
"fullName": "Mengqi Xue",
"givenName": "Mengqi",
"surname": "Xue",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhejiang University",
"fullName": "Haofei Zhang",
"givenName": "Haofei",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhejiang University",
"fullName": "Jie Song",
"givenName": "Jie",
"surname": "Song",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhejiang University",
"fullName": "Mingli Song",
"givenName": "Mingli",
"surname": "Song",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "150-159",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1H1hvg63D3y",
"name": "pcvpr202269460-09879538s1-mm_694600a150.zip",
"size": "13.4 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202269460-09879538s1-mm_694600a150.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "694600a139",
"articleId": "1H1hEyrIrFm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600a160",
"articleId": "1H0MQh36jfO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2022/8739/0/873900d819",
"title": "Towards Exemplar-Free Continual Learning in Vision Transformers: an Account of Attention, Functional and Weight Regularization",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900d819/1G56zb8vJGU",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900d710",
"title": "Continual Hippocampus Segmentation with Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900d710/1G57dwyiIco",
"parentPublication": {
"id": "proceedings/cvprw/2022/8739/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600k0884",
"title": "Training-free Transformer Architecture Search",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600k0884/1H0NcVeJAvm",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600l1953",
"title": "Scaling Up Your Kernels to 31×31: Revisiting Large Kernel Design in CNNs",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600l1953/1H0NqFFhALC",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a139",
"title": "Learning to Prompt for Continual Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a139/1H1hEyrIrFm",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2010",
"title": "The Principle of Diversity: Training Stronger Vision Transformers Calls for Reducing All Levels of Redundancy",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2010/1H1hz5qpXLW",
"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/igsc/2022/6550/0/09969361",
"title": "ViT-LR: Pushing the Envelope for Transformer-Based on-Device Embedded Continual Learning",
"doi": null,
"abstractUrl": "/proceedings-article/igsc/2022/09969361/1J2Yvizn9Zu",
"parentPublication": {
"id": "proceedings/igsc/2022/6550/0",
"title": "2022 IEEE 13th International Green and Sustainable Computing Conference (IGSC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fpl/2022/7390/0/739000a109",
"title": "Auto-ViT-Acc: An FPGA-Aware Automatic Acceleration Framework for Vision Transformer with Mixed-Scheme Quantization",
"doi": null,
"abstractUrl": "/proceedings-article/fpl/2022/739000a109/1KJwJYcibN6",
"parentPublication": {
"id": "proceedings/fpl/2022/7390/0",
"title": "2022 32nd International Conference on Field-Programmable Logic and Applications (FPL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpca/2023/7652/0/10071081",
"title": "ViTALiTy: Unifying Low-rank and Sparse Approximation for Vision Transformer Acceleration with a Linear Taylor Attention",
"doi": null,
"abstractUrl": "/proceedings-article/hpca/2023/10071081/1LMbHgjS7h6",
"parentPublication": {
"id": "proceedings/hpca/2023/7652/0",
"title": "2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icftic/2022/2195/0/10075196",
"title": "Research on Black-Box Adversarial Attack Based on Transformer",
"doi": null,
"abstractUrl": "/proceedings-article/icftic/2022/10075196/1LRllL0NrSE",
"parentPublication": {
"id": "proceedings/icftic/2022/2195/0",
"title": "2022 4th International Conference on Frontiers Technology of Information and Computer (ICFTIC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1KxUhhFgzlK",
"title": "2023 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"acronym": "wacv",
"groupId": "1000040",
"volume": "0",
"displayVolume": "0",
"year": "2023",
"__typename": "ProceedingType"
},
"article": {
"id": "1KxUTlCRbZS",
"doi": "10.1109/WACV56688.2023.00280",
"title": "Multi-level Contrastive Learning for Self-Supervised Vision Transformers",
"normalizedTitle": "Multi-level Contrastive Learning for Self-Supervised Vision Transformers",
"abstract": "Recent studies aim to establish contrastive self-supervised learning (CSL) algorithms specialized for the family of Vision Transformers (ViTs) to make them function normally as ordinary convolutional-based backbones in the training progress. Despite obtaining promising performance on related downstream tasks, one compelling property of the ViTs is ignored in those approaches. As previous studies have demonstrated, vision transformers benefit from the early stage global attention mechanics, obtaining feature representations that contain information from distant patches, even in their shallow layers. Motivated by this, we present a simple yet effective framework to facilitate the self-supervised feature learning of transformer based vision architectures, namely, Multi-level Contrastive learning for Vision Transformers (MCVT). Specifically, we equip the vision transformers with individual-based (InfoNCE) and prototypical-based (ProtoNCE) contrastive loss in different stages of the architecture to capture low-level invariance and high-level invariance between views of samples, respectively. We conduct extensive experiments to demonstrate the effectiveness of the proposed method, using two well-known vision transformer backbones, on several vision downstream tasks, including linear classification, detection, and semantic segmentation.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recent studies aim to establish contrastive self-supervised learning (CSL) algorithms specialized for the family of Vision Transformers (ViTs) to make them function normally as ordinary convolutional-based backbones in the training progress. Despite obtaining promising performance on related downstream tasks, one compelling property of the ViTs is ignored in those approaches. As previous studies have demonstrated, vision transformers benefit from the early stage global attention mechanics, obtaining feature representations that contain information from distant patches, even in their shallow layers. Motivated by this, we present a simple yet effective framework to facilitate the self-supervised feature learning of transformer based vision architectures, namely, Multi-level Contrastive learning for Vision Transformers (MCVT). Specifically, we equip the vision transformers with individual-based (InfoNCE) and prototypical-based (ProtoNCE) contrastive loss in different stages of the architecture to capture low-level invariance and high-level invariance between views of samples, respectively. We conduct extensive experiments to demonstrate the effectiveness of the proposed method, using two well-known vision transformer backbones, on several vision downstream tasks, including linear classification, detection, and semantic segmentation.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recent studies aim to establish contrastive self-supervised learning (CSL) algorithms specialized for the family of Vision Transformers (ViTs) to make them function normally as ordinary convolutional-based backbones in the training progress. Despite obtaining promising performance on related downstream tasks, one compelling property of the ViTs is ignored in those approaches. As previous studies have demonstrated, vision transformers benefit from the early stage global attention mechanics, obtaining feature representations that contain information from distant patches, even in their shallow layers. Motivated by this, we present a simple yet effective framework to facilitate the self-supervised feature learning of transformer based vision architectures, namely, Multi-level Contrastive learning for Vision Transformers (MCVT). Specifically, we equip the vision transformers with individual-based (InfoNCE) and prototypical-based (ProtoNCE) contrastive loss in different stages of the architecture to capture low-level invariance and high-level invariance between views of samples, respectively. We conduct extensive experiments to demonstrate the effectiveness of the proposed method, using two well-known vision transformer backbones, on several vision downstream tasks, including linear classification, detection, and semantic segmentation.",
"fno": "934600c777",
"keywords": [
"Computer Vision",
"Deep Learning Artificial Intelligence",
"Feature Extraction",
"Image Classification",
"Image Representation",
"Image Segmentation",
"Learning Artificial Intelligence",
"Supervised Learning",
"Unsupervised Learning",
"Early Stage Global Attention Mechanics",
"Feature Learning",
"High Level Invariance",
"Low Level Invariance",
"Multilevel Contrastive Learning",
"Self Supervised Learning Algorithms",
"Self Supervised Vision Transformers",
"Transformer Based Vision Architectures",
"Vision Downstream Tasks",
"Vision Transformer Backbones",
"Vi Ts",
"Training",
"Representation Learning",
"Computer Vision",
"Head",
"Semantic Segmentation",
"Self Supervised Learning",
"Computer Architecture",
"Algorithms Machine Learning Architectures",
"Formulations",
"And Algorithms Including Transfer",
"Image Recognition And Understanding Object Detection",
"Categorization",
"Segmentation",
"Scene Modeling",
"Visual Reasoning"
],
"authors": [
{
"affiliation": "Carnegie Mellon University",
"fullName": "Shentong Mo",
"givenName": "Shentong",
"surname": "Mo",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tohoku University",
"fullName": "Zhun Sun",
"givenName": "Zhun",
"surname": "Sun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "RIKEN,Center for Advanced Intelligence Project (AIP)",
"fullName": "Chao Li",
"givenName": "Chao",
"surname": "Li",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "wacv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2023-01-01T00:00:00",
"pubType": "proceedings",
"pages": "2777-2786",
"year": "2023",
"issn": null,
"isbn": "978-1-6654-9346-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "934600c769",
"articleId": "1KxVtQOW3qo",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "934600c787",
"articleId": "1KxVGk4xacU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2021/2812/0/281200j630",
"title": "Emerging Properties in Self-Supervised Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200j630/1BmEzn6zXgc",
"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/281200k0022",
"title": "Weakly Supervised Contrastive Learning",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200k0022/1BmKqySVuUw",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09903081",
"title": "Token Selection is a Simple Booster for Vision Transformers",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09903081/1GZog5DAM6s",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600i934",
"title": "Bootstrapping ViTs: Towards Liberating Vision Transformers from Pre-training",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600i934/1H0L34lk1mU",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600i344",
"title": "Patch-level Representation Learning for Self-supervised Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600i344/1H0Lf8H2RGw",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600q6123",
"title": "Scaling Vision Transformers to Gigapixel Images via Hierarchical Self-Supervised Learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600q6123/1H0MZWtF2yQ",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2010",
"title": "The Principle of Diversity: Training Stronger Vision Transformers Calls for Reducing All Levels of Redundancy",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2010/1H1hz5qpXLW",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2084",
"title": "Multi-Scale High-Resolution Vision Transformer for Semantic Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2084/1H1kl3M05NK",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600h267",
"title": "Delving Deep into the Generalization of Vision Transformers under Distribution Shifts",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600h267/1H1mDP9UKJO",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/06/10081322",
"title": "How Does Attention Work in Vision Transformers? A Visual Analytics Attempt",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/10081322/1LRbRtJhrG0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1LMbvP5o2iI",
"title": "2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)",
"acronym": "hpca",
"groupId": "10070856",
"volume": "0",
"displayVolume": "0",
"year": "2023",
"__typename": "ProceedingType"
},
"article": {
"id": "1LMbGetPrxu",
"doi": "10.1109/HPCA56546.2023.10071047",
"title": "HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformers",
"normalizedTitle": "HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformers",
"abstract": "While vision transformers (ViTs) have continuously achieved new milestones in the field of computer vision, their sophisticated network architectures with high computation and memory costs have impeded their deployment on resource-limited edge devices. In this paper, we propose a hardware-efficient image-adaptive token pruning framework called HeatViT for efficient yet accurate ViT acceleration on embedded FPGAs. Based on the inherent computational patterns in ViTs, we first adopt an effective, hardware-efficient, and learnable head-evaluation token selector, which can be progressively inserted before transformer blocks to dynamically identify and consolidate the non-informative tokens from input images. Moreover, we implement the token selector on hardware by adding miniature control logic to heavily reuse existing hardware components built for the backbone ViT. To improve the hardware efficiency, we further employ 8-bit fixed-point quantization and propose polynomial approximations with regularization effect on quantization error for the frequently used nonlinear functions in ViTs. Compared to existing ViT pruning studies, under the similar computation cost, HeatViT can achieve 0.7% ~ 8.9% higher accuracy; while under the similar model accuracy, HeatViT can achieve more than 28.4% ~ 65.3% computation reduction, for various widely used ViTs, including DeiT-T, DeiT-S, DeiT-B, LV-ViT-S, and LV-ViT-M, on the ImageNet dataset. Compared to the baseline hardware accelerator, our implementations of HeatViT on the Xilinx ZCU102 FPGA achieve 3.46×~4.89× speedup with a trivial resource utilization overhead of 8%~11% more DSPs and 5%~8% more LUTs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "While vision transformers (ViTs) have continuously achieved new milestones in the field of computer vision, their sophisticated network architectures with high computation and memory costs have impeded their deployment on resource-limited edge devices. In this paper, we propose a hardware-efficient image-adaptive token pruning framework called HeatViT for efficient yet accurate ViT acceleration on embedded FPGAs. Based on the inherent computational patterns in ViTs, we first adopt an effective, hardware-efficient, and learnable head-evaluation token selector, which can be progressively inserted before transformer blocks to dynamically identify and consolidate the non-informative tokens from input images. Moreover, we implement the token selector on hardware by adding miniature control logic to heavily reuse existing hardware components built for the backbone ViT. To improve the hardware efficiency, we further employ 8-bit fixed-point quantization and propose polynomial approximations with regularization effect on quantization error for the frequently used nonlinear functions in ViTs. Compared to existing ViT pruning studies, under the similar computation cost, HeatViT can achieve 0.7% ~ 8.9% higher accuracy; while under the similar model accuracy, HeatViT can achieve more than 28.4% ~ 65.3% computation reduction, for various widely used ViTs, including DeiT-T, DeiT-S, DeiT-B, LV-ViT-S, and LV-ViT-M, on the ImageNet dataset. Compared to the baseline hardware accelerator, our implementations of HeatViT on the Xilinx ZCU102 FPGA achieve 3.46×~4.89× speedup with a trivial resource utilization overhead of 8%~11% more DSPs and 5%~8% more LUTs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "While vision transformers (ViTs) have continuously achieved new milestones in the field of computer vision, their sophisticated network architectures with high computation and memory costs have impeded their deployment on resource-limited edge devices. In this paper, we propose a hardware-efficient image-adaptive token pruning framework called HeatViT for efficient yet accurate ViT acceleration on embedded FPGAs. Based on the inherent computational patterns in ViTs, we first adopt an effective, hardware-efficient, and learnable head-evaluation token selector, which can be progressively inserted before transformer blocks to dynamically identify and consolidate the non-informative tokens from input images. Moreover, we implement the token selector on hardware by adding miniature control logic to heavily reuse existing hardware components built for the backbone ViT. To improve the hardware efficiency, we further employ 8-bit fixed-point quantization and propose polynomial approximations with regularization effect on quantization error for the frequently used nonlinear functions in ViTs. Compared to existing ViT pruning studies, under the similar computation cost, HeatViT can achieve 0.7% ~ 8.9% higher accuracy; while under the similar model accuracy, HeatViT can achieve more than 28.4% ~ 65.3% computation reduction, for various widely used ViTs, including DeiT-T, DeiT-S, DeiT-B, LV-ViT-S, and LV-ViT-M, on the ImageNet dataset. Compared to the baseline hardware accelerator, our implementations of HeatViT on the Xilinx ZCU102 FPGA achieve 3.46×~4.89× speedup with a trivial resource utilization overhead of 8%~11% more DSPs and 5%~8% more LUTs.",
"fno": "10071047",
"keywords": [
"Computer Vision",
"Convolutional Neural Nets",
"Deep Learning Artificial Intelligence",
"Field Programmable Gate Arrays",
"Hardware Accelerators",
"Polynomial Approximation",
"Quantisation Signal",
"Backbone Vi T",
"Baseline Hardware Accelerator",
"Computation Cost",
"Computation Reduction",
"Computational Patterns",
"Computer Vision",
"Hardware Components",
"Hardware Efficiency",
"Hardware Efficient Adaptive Token Pruning",
"Hardware Efficient Image Adaptive Token Pruning Framework",
"Heat Vi T",
"Image Net Dataset",
"Input Images",
"Learnable Head Evaluation Token Selector",
"LV Vi T M",
"Memory Costs",
"Noninformative Tokens",
"Resource Limited Edge Devices",
"Sophisticated Network Architectures",
"Transformer Blocks",
"Vision Transformers",
"Vi T Acceleration",
"Vi T Pruning Studies",
"Xilinx ZCU 102 FPGA",
"Heating Systems",
"Training",
"Quantization Signal",
"Costs",
"Image Edge Detection",
"Transformers",
"Software",
"Vision Transformer",
"FPGA Accelerator",
"Hardware And Software Co Design",
"Data Level Sparsity"
],
"authors": [
{
"affiliation": "Northeastern University",
"fullName": "Peiyan Dong",
"givenName": "Peiyan",
"surname": "Dong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Northeastern University",
"fullName": "Mengshu Sun",
"givenName": "Mengshu",
"surname": "Sun",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University",
"fullName": "Alec Lu",
"givenName": "Alec",
"surname": "Lu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Northeastern University",
"fullName": "Yanyue Xie",
"givenName": "Yanyue",
"surname": "Xie",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University",
"fullName": "Kenneth Liu",
"givenName": "Kenneth",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Northeastern University",
"fullName": "Zhenglun Kong",
"givenName": "Zhenglun",
"surname": "Kong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Northeastern University",
"fullName": "Xin Meng",
"givenName": "Xin",
"surname": "Meng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Northeastern University",
"fullName": "Zhengang Li",
"givenName": "Zhengang",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Northeastern University",
"fullName": "Xue Lin",
"givenName": "Xue",
"surname": "Lin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Simon Fraser University",
"fullName": "Zhenman Fang",
"givenName": "Zhenman",
"surname": "Fang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Northeastern University",
"fullName": "Yanzhi Wang",
"givenName": "Yanzhi",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hpca",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2023-02-01T00:00:00",
"pubType": "proceedings",
"pages": "442-455",
"year": "2023",
"issn": null,
"isbn": "978-1-6654-7652-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "10070997",
"articleId": "1LMbCvc9Cwg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "10071054",
"articleId": "1LMbwfLoFeE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2021/2812/0/281200j630",
"title": "Emerging Properties in Self-Supervised Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200j630/1BmEzn6zXgc",
"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/281200a538",
"title": "Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNet",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200a538/1BmL74kvsiI",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09903081",
"title": "Token Selection is a Simple Booster for Vision Transformers",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09903081/1GZog5DAM6s",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600i934",
"title": "Bootstrapping ViTs: Towards Liberating Vision Transformers from Pre-training",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600i934/1H0L34lk1mU",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2476",
"title": "Automated Progressive Learning for Efficient Training of Vision Transformers",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2476/1H0Ob0Stnmo",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2010",
"title": "The Principle of Diversity: Training Stronger Vision Transformers Calls for Reducing All Levels of Redundancy",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2010/1H1hz5qpXLW",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600k0799",
"title": "A-ViT: Adaptive Tokens for Efficient Vision Transformer",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600k0799/1H1mBHL3ww8",
"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/fpl/2022/7390/0/739000a109",
"title": "Auto-ViT-Acc: An FPGA-Aware Automatic Acceleration Framework for Vision Transformer with Mixed-Scheme Quantization",
"doi": null,
"abstractUrl": "/proceedings-article/fpl/2022/739000a109/1KJwJYcibN6",
"parentPublication": {
"id": "proceedings/fpl/2022/7390/0",
"title": "2022 32nd International Conference on Field-Programmable Logic and Applications (FPL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600a012",
"title": "Token Pooling in Vision Transformers for Image Classification",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600a012/1L8qD3W3XtC",
"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/tg/2023/06/10081322",
"title": "How Does Attention Work in Vision Transformers? A Visual Analytics Attempt",
"doi": null,
"abstractUrl": "/journal/tg/2023/06/10081322/1LRbRtJhrG0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1xPsim7PuRq",
"title": "2021 IEEE 4th International Conference on Multimedia Information Processing and Retrieval (MIPR)",
"acronym": "mipr",
"groupId": "1825825",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1xPsmkH0m40",
"doi": "10.1109/MIPR51284.2021.00050",
"title": "Multimodal Machine Translation Enhancement by Fusing Multimodal-attention and Fine-grained Image Features",
"normalizedTitle": "Multimodal Machine Translation Enhancement by Fusing Multimodal-attention and Fine-grained Image Features",
"abstract": "With recent development of the multimodal machine translation (MMT) network architectures, recurrent models have effectively been replaced by attention mechanism and the translation results have been enhanced with the assistance of fine-grained image information. Although attention is a powerful and ubiquitous mechanism, different number of attention heads and granularity image features aligned by attention have an impact on the quality of multimodal machine translation. In order to address above problems, this paper proposes a multimodal machine translation enhancement by fusing multimodal-attention and fine-grained image features method which builds some submodels by introducing different granularity of image features to the multimodal-attention mechanism with different number of heads. Moreover, these sub-models are randomly fused and fusion models are obtained. The experimental results on the Multi30k dataset that the pruned attention heads lead to the improvement of translation results. Finally, our fusion model obtained the best results according to the automatic evaluation metrics BLEU compared with sub-models and some baselines.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With recent development of the multimodal machine translation (MMT) network architectures, recurrent models have effectively been replaced by attention mechanism and the translation results have been enhanced with the assistance of fine-grained image information. Although attention is a powerful and ubiquitous mechanism, different number of attention heads and granularity image features aligned by attention have an impact on the quality of multimodal machine translation. In order to address above problems, this paper proposes a multimodal machine translation enhancement by fusing multimodal-attention and fine-grained image features method which builds some submodels by introducing different granularity of image features to the multimodal-attention mechanism with different number of heads. Moreover, these sub-models are randomly fused and fusion models are obtained. The experimental results on the Multi30k dataset that the pruned attention heads lead to the improvement of translation results. Finally, our fusion model obtained the best results according to the automatic evaluation metrics BLEU compared with sub-models and some baselines.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With recent development of the multimodal machine translation (MMT) network architectures, recurrent models have effectively been replaced by attention mechanism and the translation results have been enhanced with the assistance of fine-grained image information. Although attention is a powerful and ubiquitous mechanism, different number of attention heads and granularity image features aligned by attention have an impact on the quality of multimodal machine translation. In order to address above problems, this paper proposes a multimodal machine translation enhancement by fusing multimodal-attention and fine-grained image features method which builds some submodels by introducing different granularity of image features to the multimodal-attention mechanism with different number of heads. Moreover, these sub-models are randomly fused and fusion models are obtained. The experimental results on the Multi30k dataset that the pruned attention heads lead to the improvement of translation results. Finally, our fusion model obtained the best results according to the automatic evaluation metrics BLEU compared with sub-models and some baselines.",
"fno": "186500a267",
"keywords": [
"Language Translation",
"Pose Estimation",
"Text Analysis",
"Multimodal Machine Translation Enhancement",
"Multimodal Machine Translation Network Architectures",
"Translation Results",
"Fine Grained Image Information",
"Powerful Mechanism",
"Ubiquitous Mechanism",
"Granularity Image Features",
"Fine Grained Image Features Method",
"Multimodal Attention Mechanism",
"Fusion Model",
"Pruned Attention Heads",
"Measurement",
"Head",
"Conferences",
"Information Processing",
"Network Architecture",
"Transformers",
"Magnetic Heads",
"Multimodal Machine Translation",
"Transformer",
"Multimodal Attention",
"Fine Granularity"
],
"authors": [
{
"affiliation": "Wuhan University of Technology,School of Computer and Artificial Intelligence,Wuhan,China",
"fullName": "Lin Li",
"givenName": "Lin",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wuhan University of Technology,School of Computer and Artificial Intelligence,Wuhan,China",
"fullName": "Turghun Tayir",
"givenName": "Turghun",
"surname": "Tayir",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "mipr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-09-01T00:00:00",
"pubType": "proceedings",
"pages": "267-272",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-1865-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "186500a260",
"articleId": "1xPsquajJ6g",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "186500a273",
"articleId": "1xPsq3fPyx2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2016/1437/0/1437a600",
"title": "Multi-Atlas Based Pseudo-CT Synthesis Using Multimodal Image Registration and Local Atlas Fusion Strategies",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437a600/12OmNrK9q5k",
"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/ssiai/2016/9919/0/07459160",
"title": "Multimodal fusion of brain structural and functional imaging with a deep neural machine translation approach",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2016/07459160/12OmNz6iOKY",
"parentPublication": {
"id": "proceedings/ssiai/2016/9919/0",
"title": "2016 IEEE Southwest Symposium on Image Analysis and Interpretation (SSIAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2016/08/07313015",
"title": "SALSA: A Novel Dataset for Multimodal Group Behavior Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2016/08/07313015/13rRUxASuBF",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2021/0126/0/09669277",
"title": "Modality-shared MRI Image Translation Based on Conditional GAN",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2021/09669277/1A9W5MpDwZy",
"parentPublication": {
"id": "proceedings/bibm/2021/0126/0",
"title": "2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09903081",
"title": "Token Selection is a Simple Booster for Vision Transformers",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09903081/1GZog5DAM6s",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2022/6819/0/09995044",
"title": "UniMed: Multimodal Multitask Learning for Medical Predictions",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2022/09995044/1JC1Pmt6Bu8",
"parentPublication": {
"id": "proceedings/bibm/2022/6819/0",
"title": "2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/5555/01/09999490",
"title": "High-Performance Transformer Tracking",
"doi": null,
"abstractUrl": "/journal/tp/5555/01/09999490/1JrMzARUrw4",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600c194",
"title": "Multimodal Multi-Head Convolutional Attention with Various Kernel Sizes for Medical Image Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600c194/1L8qqokUGT6",
"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/ta/2023/01/09226486",
"title": "Regional Attention Network (RAN) for Head Pose and Fine-Grained Gesture Recognition",
"doi": null,
"abstractUrl": "/journal/ta/2023/01/09226486/1nYoz5XBxjW",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2020/9325/0/09232493",
"title": "An Empirical Study on Ensemble Learning of Multimodal Machine Translation",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2020/09232493/1o56zSDi7sY",
"parentPublication": {
"id": "proceedings/bigmm/2020/9325/0",
"title": "2020 IEEE Sixth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNA0MYZb",
"title": "2008 IEEE Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvRU0s8",
"doi": "10.1109/CVPR.2008.4587789",
"title": "SMRFI: Shape matching via registration of vector-valued feature images",
"normalizedTitle": "SMRFI: Shape matching via registration of vector-valued feature images",
"abstract": "We perform shape matching by transforming the problem of establishing shape correspondences into an image registration problem. At each vertex on the shape, we calculate a shape feature and encode this feature as image intensity at appropriate positions in the image domain. Calculating multiple features at each vertex and encoding them into the image domain results in a vector-valued feature image. Establishing point correspondence between two shapes is thereafter treated as a registration problem of two vector valued feature images. With this shape representation, various existing image registration strategies can now be easily applied. These include the use of a scale-space approach to diffuse the shape features, a coarse-to-fine registration scheme, and various deformable registration algorithms. As our validation shows, by representing shapes as vector valued images, the overall method is robust against noise and occlusions. To this end, we have successfully established 2D point correspondences of shapes of corpora callosa, vertebrae, and brain ventricles.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We perform shape matching by transforming the problem of establishing shape correspondences into an image registration problem. At each vertex on the shape, we calculate a shape feature and encode this feature as image intensity at appropriate positions in the image domain. Calculating multiple features at each vertex and encoding them into the image domain results in a vector-valued feature image. Establishing point correspondence between two shapes is thereafter treated as a registration problem of two vector valued feature images. With this shape representation, various existing image registration strategies can now be easily applied. These include the use of a scale-space approach to diffuse the shape features, a coarse-to-fine registration scheme, and various deformable registration algorithms. As our validation shows, by representing shapes as vector valued images, the overall method is robust against noise and occlusions. To this end, we have successfully established 2D point correspondences of shapes of corpora callosa, vertebrae, and brain ventricles.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We perform shape matching by transforming the problem of establishing shape correspondences into an image registration problem. At each vertex on the shape, we calculate a shape feature and encode this feature as image intensity at appropriate positions in the image domain. Calculating multiple features at each vertex and encoding them into the image domain results in a vector-valued feature image. Establishing point correspondence between two shapes is thereafter treated as a registration problem of two vector valued feature images. With this shape representation, various existing image registration strategies can now be easily applied. These include the use of a scale-space approach to diffuse the shape features, a coarse-to-fine registration scheme, and various deformable registration algorithms. As our validation shows, by representing shapes as vector valued images, the overall method is robust against noise and occlusions. To this end, we have successfully established 2D point correspondences of shapes of corpora callosa, vertebrae, and brain ventricles.",
"fno": "04587789",
"keywords": [],
"authors": [
{
"affiliation": "Medical Image Analysis Lab, Computing Science, Simon Fraser University, Canada",
"fullName": "Lisa Tang",
"givenName": "Lisa",
"surname": "Tang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Medical Image Analysis Lab, Computing Science, Simon Fraser University, Canada",
"fullName": "Ghassan Hamarneh",
"givenName": "Ghassan",
"surname": "Hamarneh",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2008",
"issn": null,
"isbn": "978-1-4244-2242-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04587788",
"articleId": "12OmNy314cl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04587790",
"articleId": "12OmNzYwbXa",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/3dv/2017/2610/0/261001a686",
"title": "Fuzzy Correspondences for Robust Shape Registration",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2017/261001a686/12OmNBLdKMa",
"parentPublication": {
"id": "proceedings/3dv/2017/2610/0",
"title": "2017 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2006/2521/4/252140057",
"title": "Global-to-Local Non-Rigid Shape Registration",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252140057/12OmNwIHovH",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/4",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2009/3992/0/05206854",
"title": "Shape evolution for rigid and nonrigid shape registration and recovery",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206854/12OmNwx3Qag",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2007/1179/0/04270357",
"title": "An MRF and Gaussian Curvature Based Shape Representation for Shape Matching",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2007/04270357/12OmNx5Yvrn",
"parentPublication": {
"id": "proceedings/cvpr/2007/1179/0",
"title": "2007 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2007/1179/0/04270214",
"title": "Shape Representation and Registration using Vector Distance Functions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2007/04270214/12OmNy49sS4",
"parentPublication": {
"id": "proceedings/cvpr/2007/1179/0",
"title": "2007 IEEE Conference on Computer Vision and Pattern Recognition",
"__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/cvpr/2009/3992/0/05206598",
"title": "Shape comparison using perturbing shape registration",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2009/05206598/12OmNzaQodu",
"parentPublication": {
"id": "proceedings/cvpr/2009/3992/0",
"title": "2009 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09729524",
"title": "Unsupervised Category-Specific Partial Point Set Registration via Joint Shape Completion and Registration",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09729524/1Bya8dlokw0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600u0813",
"title": "Topology-Preserving Shape Reconstruction and Registration via Neural Diffeomorphic Flow",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600u0813/1H1hR5pweWc",
"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/09956072",
"title": "Measuring Focus Quality in Vector Valued Images for Shape from Focus",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956072/1IHq2SYiKys",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAolGQG",
"title": "Proceedings of the European Conference on Design Automation.",
"acronym": "edac",
"groupId": "1000197",
"volume": "0",
"displayVolume": "0",
"year": "1991",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwpXRVW",
"doi": "10.1109/EDAC.1991.206425",
"title": "Goal orientated slicing enumeration through shape function clipping",
"normalizedTitle": "Goal orientated slicing enumeration through shape function clipping",
"abstract": "Two new methods for efficient enumeration of slicing structures useful for macro cell and sea-of-gates final placement are presented. Contrary to existing approaches a further preorder traversal of the slicing tree is added, which allows elimination of unnecessary shapes in an early design phase. Applying this look ahead strategy, memory and computation time requirements have been reduced drastically. Better placements have been achieved by using the saved resources to enlarge the search space for enumeration.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "Two new methods for efficient enumeration of slicing structures useful for macro cell and sea-of-gates final placement are presented. Contrary to existing approaches a further preorder traversal of the slicing tree is added, which allows elimination of unnecessary shapes in an early design phase. Applying this look ahead strategy, memory and computation time requirements have been reduced drastically. Better placements have been achieved by using the saved resources to enlarge the search space for enumeration.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Two new methods for efficient enumeration of slicing structures useful for macro cell and sea-of-gates final placement are presented. Contrary to existing approaches a further preorder traversal of the slicing tree is added, which allows elimination of unnecessary shapes in an early design phase. Applying this look ahead strategy, memory and computation time requirements have been reduced drastically. Better placements have been achieved by using the saved resources to enlarge the search space for enumeration.",
"fno": "00206425",
"keywords": [
"Circuit Layout CAD",
"Optimisation",
"Trees Mathematics",
"Goal Oriented Slicing Enumeration",
"Shape Function Clipping",
"Slicing Structures",
"Macro Cell",
"Sea Of Gates",
"Final Placement",
"Look Ahead Strategy",
"Shape",
"Polynomials",
"Upper Bound",
"Optimization Methods",
"Design Automation",
"Printed Circuits",
"Design Optimization",
"Delay",
"Wiring",
"Algorithm Design And Analysis"
],
"authors": [
{
"affiliation": "Dept. of Electr. Eng., Tech. Unvi. of Munich, Germany",
"fullName": "G. Sigl",
"givenName": "G.",
"surname": "Sigl",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electr. Eng., Tech. Unvi. of Munich, Germany",
"fullName": "U. Schlitchtmann",
"givenName": "U.",
"surname": "Schlitchtmann",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "edac",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1991-01-01T00:00:00",
"pubType": "proceedings",
"pages": "361,362,363,364,365",
"year": "1991",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00206424",
"articleId": "12OmNAKM03H",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00206427",
"articleId": "12OmNvAiSvj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dac/2000/2428/0/24280464",
"title": "Block Placement with Symmetry Constraints Based on the O-Tree Non-Slicing Representation",
"doi": null,
"abstractUrl": "/proceedings-article/dac/2000/24280464/12OmNAtK4fp",
"parentPublication": {
"id": "proceedings/dac/2000/2428/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccad/1988/0869/0/00122559",
"title": "GORDIAN: a new global optimization/rectangle dissection method for cell placement",
"doi": null,
"abstractUrl": "/proceedings-article/iccad/1988/00122559/12OmNCfSqTr",
"parentPublication": {
"id": "proceedings/iccad/1988/0869/0",
"title": "1988 IEEE International Conference on Computer-Aided Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dac/2000/2428/0/24280458",
"title": "B*-Trees: A New Representation for Non-Slicing Floorplans",
"doi": null,
"abstractUrl": "/proceedings-article/dac/2000/24280458/12OmNqIhFWM",
"parentPublication": {
"id": "proceedings/dac/2000/2428/0",
"title": "Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csit/2017/2830/0/08312143",
"title": "Critical problems for a slicing floorplan",
"doi": null,
"abstractUrl": "/proceedings-article/csit/2017/08312143/12OmNrMZpoD",
"parentPublication": {
"id": "proceedings/csit/2017/2830/0",
"title": "2017 Computer Science and Information Technologies (CSIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aspdac/2001/6633/0/00913358",
"title": "Slicing floorplan with clustering constraints",
"doi": null,
"abstractUrl": "/proceedings-article/aspdac/2001/00913358/12OmNs5rkOg",
"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": "proceedings/date/2008/3/0/04484778",
"title": "Novel Pin Assignment Algorithms for Components with Very High Pin Counts",
"doi": null,
"abstractUrl": "/proceedings-article/date/2008/04484778/12OmNweBUOP",
"parentPublication": {
"id": "proceedings/date/2008/3/0",
"title": "Design, Automation & Test in Europe. DATE'08",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eurdac/1992/2780/0/00246267",
"title": "Parallel algorithms for slicing based final placement",
"doi": null,
"abstractUrl": "/proceedings-article/eurdac/1992/00246267/12OmNxX3uJN",
"parentPublication": {
"id": "proceedings/eurdac/1992/2780/0",
"title": "Proceedings EURO-DAC '92: European Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euromicro/1997/8129/0/81290265",
"title": "Slicing and non-slicing, unified and rotation independent, algebraic representation of floorplans",
"doi": null,
"abstractUrl": "/proceedings-article/euromicro/1997/81290265/12OmNzmclx6",
"parentPublication": {
"id": "proceedings/euromicro/1997/8129/0",
"title": "EUROMICRO Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/si/2000/06/00902262",
"title": "Rent exponent prediction methods",
"doi": null,
"abstractUrl": "/journal/si/2000/06/00902262/13rRUy0HYOD",
"parentPublication": {
"id": "trans/si",
"title": "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1987/06/01676967",
"title": "Minimum-Area Wiring for Slicing Structures",
"doi": null,
"abstractUrl": "/journal/tc/1987/06/01676967/13rRUyuvRwe",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNA0MYZb",
"title": "2008 IEEE Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzV70OM",
"doi": "10.1109/CVPR.2008.4587775",
"title": "Efficient object shape recovery via slicing planes",
"normalizedTitle": "Efficient object shape recovery via slicing planes",
"abstract": "Recovering the three-dimensional (3D) object shape remains an unresolved area of research on the cross-section of computer vision, photogrammetry and bioinformatics. Although various techniques have been developed, the computational complexity and the constraints introduced to overcome the problems have limited their applicability in the real world scenarios. In this paper, we propose a method that is based on the projective geometry between the object space and the silhouette-images taken from multiple view-points. The approach eliminates the problems related to dense feature point matching and camera calibration that are generally adopted by many state of the art shape reconstruction methods. The object shape is reconstructed by establishing a set of hypothetical planes slicing the object volume and estimating the projective geometric relations between the images of these planes. The experimental results show that the 3D object shape can be recovered by applying minimal constraints.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Recovering the three-dimensional (3D) object shape remains an unresolved area of research on the cross-section of computer vision, photogrammetry and bioinformatics. Although various techniques have been developed, the computational complexity and the constraints introduced to overcome the problems have limited their applicability in the real world scenarios. In this paper, we propose a method that is based on the projective geometry between the object space and the silhouette-images taken from multiple view-points. The approach eliminates the problems related to dense feature point matching and camera calibration that are generally adopted by many state of the art shape reconstruction methods. The object shape is reconstructed by establishing a set of hypothetical planes slicing the object volume and estimating the projective geometric relations between the images of these planes. The experimental results show that the 3D object shape can be recovered by applying minimal constraints.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Recovering the three-dimensional (3D) object shape remains an unresolved area of research on the cross-section of computer vision, photogrammetry and bioinformatics. Although various techniques have been developed, the computational complexity and the constraints introduced to overcome the problems have limited their applicability in the real world scenarios. In this paper, we propose a method that is based on the projective geometry between the object space and the silhouette-images taken from multiple view-points. The approach eliminates the problems related to dense feature point matching and camera calibration that are generally adopted by many state of the art shape reconstruction methods. The object shape is reconstructed by establishing a set of hypothetical planes slicing the object volume and estimating the projective geometric relations between the images of these planes. The experimental results show that the 3D object shape can be recovered by applying minimal constraints.",
"fno": "04587775",
"keywords": [],
"authors": [
{
"affiliation": "Photogrammetric Computer Vision Lab, Ohio State University, 233 Bolz Hall, 2036 Neil Ave., Columbus, 43210, USA",
"fullName": "Po-Lun Lai",
"givenName": null,
"surname": "Po-Lun Lai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Photogrammetric Computer Vision Lab, Ohio State University, 233 Bolz Hall, 2036 Neil Ave., Columbus, 43210, USA",
"fullName": "Alper Yilmaz",
"givenName": "Alper",
"surname": "Yilmaz",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1-6",
"year": "2008",
"issn": null,
"isbn": "978-1-4244-2242-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04587774",
"articleId": "12OmNyUWQTe",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04587776",
"articleId": "12OmNArKSio",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2016/7258/0/07552928",
"title": "Shape-optimizing hybrid warping for image stitching",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2016/07552928/12OmNwErpuh",
"parentPublication": {
"id": "proceedings/icme/2016/7258/0",
"title": "2016 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/4/212840060",
"title": "Geometric Approach for Simultaneous Projective Reconstruction of Points, Lines, Planes, Quadrics, Plane Conics and Degenerate Quadrics",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212840060/12OmNy2agUd",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2002/1695/2/169520737",
"title": "Projective Factorization of Planes and Cameras in Multiple Views",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2002/169520737/12OmNy68EO5",
"parentPublication": {
"id": "proceedings/icpr/2002/1695/2",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/smi/2008/2260/0/04547986",
"title": "SHREC'08 entry: 3D shape searching using object partitioning",
"doi": null,
"abstractUrl": "/proceedings-article/smi/2008/04547986/12OmNyLiuvn",
"parentPublication": {
"id": "proceedings/smi/2008/2260/0",
"title": "IEEE International Conference on Shape Modeling and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2007/2929/0/29291004",
"title": "Image-Based Model Reconstruction Using Textured Planes",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2007/29291004/12OmNyeECs4",
"parentPublication": {
"id": "proceedings/icig/2007/2929/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/07/06658748",
"title": "Shape Deformation via Interior RBF",
"doi": null,
"abstractUrl": "/journal/tg/2014/07/06658748/13rRUB7a112",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1995/03/i0266",
"title": "Accurate Recovery of Three-Dimensional Shape from Image Focus",
"doi": null,
"abstractUrl": "/journal/tp/1995/03/i0266/13rRUILtJrX",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/05/06626302",
"title": "2D Affine and Projective Shape Analysis",
"doi": null,
"abstractUrl": "/journal/tp/2014/05/06626302/13rRUxDqS9C",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2011/04/ttp2011040780",
"title": "Linearized Motion Estimation for Articulated Planes",
"doi": null,
"abstractUrl": "/journal/tp/2011/04/ttp2011040780/13rRUynHukn",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10081386",
"title": "Image Collage on Arbitrary Shape via Shape-Aware Slicing and Optimization",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10081386/1LRbSaS1ClW",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCbCrVG",
"title": "Mathematical Methods in Biomedical Image Analysis, IEEE Workshop on",
"acronym": "mmbia",
"groupId": "1000434",
"volume": "0",
"displayVolume": "0",
"year": "1996",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzdoMv3",
"doi": "10.1109/MMBIA.1996.534075",
"title": "A Computationally Efficient Shape Analysis via Level Sets",
"normalizedTitle": "A Computationally Efficient Shape Analysis via Level Sets",
"abstract": "Abstract: In recent years, curve evolution has been applied to smoothing of shapes and shape analysis with considerable success, especially in biomedical image analysis. The multiscale analysis provides information regarding parts of shapes, their axes or centers and shape skeletons. Here, the authors show that the level sets of an edge-strength function provide essentially the same shape analysis as provided curve evolution. The new method has several advantages over the method of curve evolution. Since the governing equation is linear, the implementation is simpler and faster. The same equation applies to problems of higher dimension. An important advantage is that unlike the method of curve evolution, the new method is applicable to shapes which may have junctions such as triple points. The edge-strength may be calculated from raw images without first extracting the shape outline. Thus the method can be applied to raw images. The method provides a way to approach the segmentation problem and shape analysis within a common integrated framework.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract: In recent years, curve evolution has been applied to smoothing of shapes and shape analysis with considerable success, especially in biomedical image analysis. The multiscale analysis provides information regarding parts of shapes, their axes or centers and shape skeletons. Here, the authors show that the level sets of an edge-strength function provide essentially the same shape analysis as provided curve evolution. The new method has several advantages over the method of curve evolution. Since the governing equation is linear, the implementation is simpler and faster. The same equation applies to problems of higher dimension. An important advantage is that unlike the method of curve evolution, the new method is applicable to shapes which may have junctions such as triple points. The edge-strength may be calculated from raw images without first extracting the shape outline. Thus the method can be applied to raw images. The method provides a way to approach the segmentation problem and shape analysis within a common integrated framework.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract: In recent years, curve evolution has been applied to smoothing of shapes and shape analysis with considerable success, especially in biomedical image analysis. The multiscale analysis provides information regarding parts of shapes, their axes or centers and shape skeletons. Here, the authors show that the level sets of an edge-strength function provide essentially the same shape analysis as provided curve evolution. The new method has several advantages over the method of curve evolution. Since the governing equation is linear, the implementation is simpler and faster. The same equation applies to problems of higher dimension. An important advantage is that unlike the method of curve evolution, the new method is applicable to shapes which may have junctions such as triple points. The edge-strength may be calculated from raw images without first extracting the shape outline. Thus the method can be applied to raw images. The method provides a way to approach the segmentation problem and shape analysis within a common integrated framework.",
"fno": "73670234",
"keywords": [
"Medical Image Processing Edge Detection Computationally Efficient Shape Analysis Level Sets Shapes Smoothing Shape Outline Extraction Edge Strength Function Multiscale Analysis Triple Points Segmentation Problem Linear Governing Equation Medical Diagnostic Imaging"
],
"authors": [
{
"affiliation": "Mech. & Ind. Eng. Dept., Northeastern Univ., Boston, MA, USA",
"fullName": "Z.S.G. Tari",
"givenName": "Z.S.G.",
"surname": "Tari",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Mech. & Ind. Eng. Dept., Northeastern Univ., Boston, MA, USA",
"fullName": "J. Shah",
"givenName": "J.",
"surname": "Shah",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Mech. & Ind. Eng. Dept., Northeastern Univ., Boston, MA, USA",
"fullName": "H. Pien",
"givenName": "H.",
"surname": "Pien",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "mmbia",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1996-06-01T00:00:00",
"pubType": "proceedings",
"pages": "0234",
"year": "1996",
"issn": null,
"isbn": "0-8186-7367-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "73670222",
"articleId": "12OmNxFaLD0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "73670244",
"articleId": "12OmNzhELlP",
"__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.