data
dict |
|---|
{
"proceeding": {
"id": "12OmNrIJqqr",
"title": "Proceedings Spring Conference on Computer Graphics",
"acronym": "sccg",
"groupId": "1002217",
"volume": "0",
"displayVolume": "0",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwD1q5q",
"doi": "10.1109/SCCG.2001.945347",
"title": "An Octree Isosurface Codification Based on Discrete Planes",
"normalizedTitle": "An Octree Isosurface Codification Based on Discrete Planes",
"abstract": "Abstract: The purpose of this work is to describe a method to code a decimated model of an isosurface on an octree representation while maintaining volume data if it is needed. The proposed technique is based on grouping the Marching Cubes (MC) patterns in five configurations according the topology and the number of planes of the surface contained into the cell. Moreover, a discrete number of planes, where the surface lain on, is fixed. Starting from a complete volume octree with the isosurface codified at terminal nodes according to the new configurations, a bottom-up strategy is taken in merging cells. Such strategy allows to implicitly represent coplanar faces in upper octree levels without introducing error. At the end of this merging process, when is required, a reconstruction strategy is applied to generate the surface contained in the octree intersected leaves. Some examples with medical data demonstrate that reduction up to 50 percent on the number of polygons could be achieved.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract: The purpose of this work is to describe a method to code a decimated model of an isosurface on an octree representation while maintaining volume data if it is needed. The proposed technique is based on grouping the Marching Cubes (MC) patterns in five configurations according the topology and the number of planes of the surface contained into the cell. Moreover, a discrete number of planes, where the surface lain on, is fixed. Starting from a complete volume octree with the isosurface codified at terminal nodes according to the new configurations, a bottom-up strategy is taken in merging cells. Such strategy allows to implicitly represent coplanar faces in upper octree levels without introducing error. At the end of this merging process, when is required, a reconstruction strategy is applied to generate the surface contained in the octree intersected leaves. Some examples with medical data demonstrate that reduction up to 50 percent on the number of polygons could be achieved.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract: The purpose of this work is to describe a method to code a decimated model of an isosurface on an octree representation while maintaining volume data if it is needed. The proposed technique is based on grouping the Marching Cubes (MC) patterns in five configurations according the topology and the number of planes of the surface contained into the cell. Moreover, a discrete number of planes, where the surface lain on, is fixed. Starting from a complete volume octree with the isosurface codified at terminal nodes according to the new configurations, a bottom-up strategy is taken in merging cells. Such strategy allows to implicitly represent coplanar faces in upper octree levels without introducing error. At the end of this merging process, when is required, a reconstruction strategy is applied to generate the surface contained in the octree intersected leaves. Some examples with medical data demonstrate that reduction up to 50 percent on the number of polygons could be achieved.",
"fno": "12150130",
"keywords": [],
"authors": [
{
"affiliation": "Universitat de Girona",
"fullName": "Imma Boada",
"givenName": "Imma",
"surname": "Boada",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Universitat Politècnica de Catalunya",
"fullName": "Isabel Navazo",
"givenName": "Isabel",
"surname": "Navazo",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sccg",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-04-01T00:00:00",
"pubType": "proceedings",
"pages": "0130",
"year": "2001",
"issn": null,
"isbn": "0-7695-1215-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "12150118",
"articleId": "12OmNrFTrag",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "12150139",
"articleId": "12OmNx8wTrE",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNApcua3",
"title": "Symposium on Interactive Ray Tracing",
"acronym": "rt",
"groupId": "1001330",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyGbIbV",
"doi": "10.1109/RT.2008.4634645",
"title": "Ray traversal of octree point clouds on the GPU",
"normalizedTitle": "Ray traversal of octree point clouds on the GPU",
"abstract": "We propose an efficient iterative algorithm for ray traversal of an octree on current GPU hardware. From an initial mesh or volume dataset, we construct a balanced octree where each vertex is assigned a leaf node at the lowest possible depth. Interior nodes are averaged from these values, defining levels of detail. We transfer this compact octree to the GPU, and employ our traversal algorithm to render these particles. This yields interactive performance for moderately large (multi-million point) datasets, and renders coarser levels of detail at significantly faster rates. This algorithm is note-worthy in its simple GPU implementation and relative scalability.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose an efficient iterative algorithm for ray traversal of an octree on current GPU hardware. From an initial mesh or volume dataset, we construct a balanced octree where each vertex is assigned a leaf node at the lowest possible depth. Interior nodes are averaged from these values, defining levels of detail. We transfer this compact octree to the GPU, and employ our traversal algorithm to render these particles. This yields interactive performance for moderately large (multi-million point) datasets, and renders coarser levels of detail at significantly faster rates. This algorithm is note-worthy in its simple GPU implementation and relative scalability.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose an efficient iterative algorithm for ray traversal of an octree on current GPU hardware. From an initial mesh or volume dataset, we construct a balanced octree where each vertex is assigned a leaf node at the lowest possible depth. Interior nodes are averaged from these values, defining levels of detail. We transfer this compact octree to the GPU, and employ our traversal algorithm to render these particles. This yields interactive performance for moderately large (multi-million point) datasets, and renders coarser levels of detail at significantly faster rates. This algorithm is note-worthy in its simple GPU implementation and relative scalability.",
"fno": "04634645",
"keywords": [
"Computational Geometry",
"Computer Graphic Equipment",
"Interactive Systems",
"Iterative Methods",
"Mesh Generation",
"Octrees",
"Ray Tracing",
"Balanced Octree Point Cloud",
"Ray Traversal",
"GPU Hardware",
"Iterative Algorithm",
"Initial Mesh",
"Volume Dataset",
"Interactive System Perfomance",
"Ray Tracing",
"Pediatrics",
"Surface Reconstruction",
"Geometry",
"Image Resolution",
"Algorithm Design And Analysis",
"Construction Industry"
],
"authors": [
{
"affiliation": "SCI Institute, University of Utah, USA",
"fullName": "Aaron Knoll",
"givenName": "Aaron",
"surname": "Knoll",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "rt",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-08-01T00:00:00",
"pubType": "proceedings",
"pages": "",
"year": "2008",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04634644",
"articleId": "12OmNqJ8ttG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04634646",
"articleId": "12OmNvmG829",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/rt/2007/1629/0/04342598",
"title": "Realtime Ray Tracing on GPU with BVH-based Packet Traversal",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2007/04342598/12OmNqJZgLN",
"parentPublication": {
"id": "proceedings/rt/2007/1629/0",
"title": "IEEE/ EG Symposium on Interactive Ray Tracing 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbac-pad/2009/3857/0/3857a041",
"title": "kD-Tree Traversal Implementations for Ray Tracing on Massive Multiprocessors: A Comparative Study",
"doi": null,
"abstractUrl": "/proceedings-article/sbac-pad/2009/3857a041/12OmNvJXeAz",
"parentPublication": {
"id": "proceedings/sbac-pad/2009/3857/0",
"title": "Computer Architecture and High Performance Computing, Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2011/4648/0/4648a011",
"title": "GPU-Based Data Structure for a Parallel Ray Tracing Illumination Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2011/4648a011/12OmNvwC5ve",
"parentPublication": {
"id": "proceedings/sbgames/2011/4648/0",
"title": "2011 Brazilian Symposium on Games and Digital Entertainment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2006/0693/0/04061553",
"title": "Interactive Isosurface Ray Tracing of Large Octree Volumes",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2006/04061553/12OmNwlqhK9",
"parentPublication": {
"id": "proceedings/rt/2006/0693/0",
"title": "IEEE Symposium on Interactive Ray Tracing 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634620",
"title": "Getting rid of packets - Efficient SIMD single-ray traversal using multi-branching BVHs -",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634620/12OmNwp74Bo",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2006/0693/0/04061546",
"title": "Omnidirectional Ray Tracing Traversal Algorithm for kd-trees",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2006/04061546/12OmNxEBzeX",
"parentPublication": {
"id": "proceedings/rt/2006/0693/0",
"title": "IEEE Symposium on Interactive Ray Tracing 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a087",
"title": "SIMD Friendly Ray Tracing on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a087/12OmNxFaLiE",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/10/ttg2013101732",
"title": "Octree Rasterization: Accelerating High-Quality Out-of-Core GPU Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2013/10/ttg2013101732/13rRUwvBy8T",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1995/04/v0343",
"title": "Octree-R: An Adaptive Octree for Efficient Ray Tracing",
"doi": null,
"abstractUrl": "/journal/tg/1995/04/v0343/13rRUxcbnH0",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cecit/2021/3757/0/375700b168",
"title": "Stackless KD-Tree Traversal For Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/cecit/2021/375700b168/1CdEOBZgTVC",
"parentPublication": {
"id": "proceedings/cecit/2021/3757/0",
"title": "2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyugz5f",
"title": "1991Tenth Annual International Phoenix Conference on Computers and Communications",
"acronym": "pccc",
"groupId": "1000155",
"volume": "0",
"displayVolume": "0",
"year": "1991",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyQGShv",
"doi": "10.1109/PCCC.1991.113888",
"title": "A new linear octree construction by filling algorithms",
"normalizedTitle": "A new linear octree construction by filling algorithms",
"abstract": "A novel linear octree construction based on filling the closed voxel-based border is proposed. The algorithm is based on a sweeping strategy. First it is proved that if an octant contains no border voxel then its attribute can be determined by examining the attributes of all its processed neighbors. Then a data structure called active front is used to keep track of the attributes of the corresponding neighbors as the sweeping process is carried out octant by octant. Compared with the existing algorithm, the main advantage of this approach is that it does not require prior blocking information of the boundary voxels. The time complexity of the algorithm is proportional to the ratio of boundary voxels. It is optimal in the sense that all boundary voxels are traversed only once and all octants of the octree are also examined once.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A novel linear octree construction based on filling the closed voxel-based border is proposed. The algorithm is based on a sweeping strategy. First it is proved that if an octant contains no border voxel then its attribute can be determined by examining the attributes of all its processed neighbors. Then a data structure called active front is used to keep track of the attributes of the corresponding neighbors as the sweeping process is carried out octant by octant. Compared with the existing algorithm, the main advantage of this approach is that it does not require prior blocking information of the boundary voxels. The time complexity of the algorithm is proportional to the ratio of boundary voxels. It is optimal in the sense that all boundary voxels are traversed only once and all octants of the octree are also examined once.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A novel linear octree construction based on filling the closed voxel-based border is proposed. The algorithm is based on a sweeping strategy. First it is proved that if an octant contains no border voxel then its attribute can be determined by examining the attributes of all its processed neighbors. Then a data structure called active front is used to keep track of the attributes of the corresponding neighbors as the sweeping process is carried out octant by octant. Compared with the existing algorithm, the main advantage of this approach is that it does not require prior blocking information of the boundary voxels. The time complexity of the algorithm is proportional to the ratio of boundary voxels. It is optimal in the sense that all boundary voxels are traversed only once and all octants of the octree are also examined once.",
"fno": "00113888",
"keywords": [
"Computer Graphics",
"Data Structures",
"Linear Octree Construction",
"Filling Algorithms",
"Closed Voxel Based Border",
"Sweeping Strategy",
"Data Structure",
"Active Front",
"Time Complexity",
"Filling",
"Solid Modeling",
"Data Structures",
"Computational Geometry",
"Tree Data Structures",
"Computer Displays",
"Computed Tomography",
"Magnetic Resonance Imaging",
"Computer Science",
"Information Geometry"
],
"authors": [
{
"affiliation": "Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan",
"fullName": "Shi-Nine Yang",
"givenName": null,
"surname": "Shi-Nine Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan",
"fullName": "Tsong-Wuu Lin",
"givenName": null,
"surname": "Tsong-Wuu Lin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pccc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1991-01-01T00:00:00",
"pubType": "proceedings",
"pages": "740,741,742,743,744,745,746",
"year": "1991",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00113887",
"articleId": "12OmNzlD9sn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00113889",
"articleId": "12OmNB8kI1k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2006/2521/1/252110127",
"title": "New Efficient Octree Construction from Multiple Object Silhouettes with Construction Quality Control",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2006/252110127/12OmNvSKNUJ",
"parentPublication": {
"id": "proceedings/icpr/2006/2521/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1988/9999/1/00753956",
"title": "3-D Crack Reconstruction In Radiographic Images Using Projections Obtained From A Linear Sample Shift",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1988/00753956/12OmNvjgWWO",
"parentPublication": {
"id": "proceedings/acssc/1988/9999/1",
"title": "Twenty-Second Asilomar Conference on Signals, Systems and Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1990/2083/0/00146364",
"title": "Displaying voxel-based objects according to their qualitative shape synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1990/00146364/12OmNwdtwcf",
"parentPublication": {
"id": "proceedings/visual/1990/2083/0",
"title": "1990 First IEEE Conference on Visualization",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdps/2012/4675/0/4675a426",
"title": "Low-Cost Parallel Algorithms for 2:1 Octree Balance",
"doi": null,
"abstractUrl": "/proceedings-article/ipdps/2012/4675a426/12OmNx6g6mD",
"parentPublication": {
"id": "proceedings/ipdps/2012/4675/0",
"title": "Parallel and Distributed Processing Symposium, International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpsac/1990/2054/0/00139382",
"title": "A new 3D-border algorithm by neighbor finding",
"doi": null,
"abstractUrl": "/proceedings-article/cmpsac/1990/00139382/12OmNxETa9o",
"parentPublication": {
"id": "proceedings/cmpsac/1990/2054/0",
"title": "Proceedings Fourteenth Annual International Computer Software and Applications Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2013/5050/0/5050a701",
"title": "Filling Free-Form n-Sided Holes toward Blending and Decoration",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2013/5050a701/12OmNz5apJL",
"parentPublication": {
"id": "proceedings/icig/2013/5050/0",
"title": "2013 Seventh International Conference on Image and Graphics (ICIG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761602",
"title": "A performance controllable octree construction method",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761602/12OmNzcxZ4I",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/01/ttg2013010081",
"title": "Uncluttered Single-Image Visualization of Vascular Structures Using GPU and Integer Programming",
"doi": null,
"abstractUrl": "/journal/tg/2013/01/ttg2013010081/13rRUyv53Fp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mipr/2022/9548/0/954800a096",
"title": "Learning to Predict on Octree for Scalable Point Cloud Geometry Coding",
"doi": null,
"abstractUrl": "/proceedings-article/mipr/2022/954800a096/1Gvddm9kzTO",
"parentPublication": {
"id": "proceedings/mipr/2022/9548/0",
"title": "2022 IEEE 5th International Conference on Multimedia Information Processing and Retrieval (MIPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqG0SXH",
"title": "Computer Graphics and Applications, Pacific Conference on",
"acronym": "pg",
"groupId": "1000130",
"volume": "0",
"displayVolume": "0",
"year": "2000",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzYeAUP",
"doi": "10.1109/PCCGA.2000.883938",
"title": "Modeling an Isosurface with a Neural Network",
"normalizedTitle": "Modeling an Isosurface with a Neural Network",
"abstract": "In this paper, we present a novel method for modeling an isosurface that is defined by an unstructured set of control points. The principle is to model the scalar field underlying the isosurface with a neural network: the inputs of the neural network are the three coordinates of a point in space and its output is the value of the scalar field at this point. The isosurface is requested to satisfy some constraints related to the control points: it must pass through these points and its normal and curvature may be imposed over these points. Consequently, the neural network is trained to comply with these constraints. The type of network considered so far is a multilayer feedforward neural network with two internal layers. The learning techniques (for finding relevant values of the connection weights) on which we are currently working are an expanded version of the backpropagation algorithm and a genetic algorithm. The aim of this paper is to lay the bases of the neural network modeling approach. Some directions for further development are also indicated.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a novel method for modeling an isosurface that is defined by an unstructured set of control points. The principle is to model the scalar field underlying the isosurface with a neural network: the inputs of the neural network are the three coordinates of a point in space and its output is the value of the scalar field at this point. The isosurface is requested to satisfy some constraints related to the control points: it must pass through these points and its normal and curvature may be imposed over these points. Consequently, the neural network is trained to comply with these constraints. The type of network considered so far is a multilayer feedforward neural network with two internal layers. The learning techniques (for finding relevant values of the connection weights) on which we are currently working are an expanded version of the backpropagation algorithm and a genetic algorithm. The aim of this paper is to lay the bases of the neural network modeling approach. Some directions for further development are also indicated.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a novel method for modeling an isosurface that is defined by an unstructured set of control points. The principle is to model the scalar field underlying the isosurface with a neural network: the inputs of the neural network are the three coordinates of a point in space and its output is the value of the scalar field at this point. The isosurface is requested to satisfy some constraints related to the control points: it must pass through these points and its normal and curvature may be imposed over these points. Consequently, the neural network is trained to comply with these constraints. The type of network considered so far is a multilayer feedforward neural network with two internal layers. The learning techniques (for finding relevant values of the connection weights) on which we are currently working are an expanded version of the backpropagation algorithm and a genetic algorithm. The aim of this paper is to lay the bases of the neural network modeling approach. Some directions for further development are also indicated.",
"fno": "08680165",
"keywords": [
"Curves Surfaces",
"Genetic Algorithms",
"Geometric Modeling",
"Isosurfaces",
"Neural Nets",
"Ray Tracing",
"Rendering"
],
"authors": [
{
"affiliation": "Eastern Mediterranean University",
"fullName": "Manuel Carcenac",
"givenName": "Manuel",
"surname": "Carcenac",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Eastern Mediterranean University",
"fullName": "Adnan Acan",
"givenName": "Adnan",
"surname": "Acan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pg",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2000-10-01T00:00:00",
"pubType": "proceedings",
"pages": "165",
"year": "2000",
"issn": null,
"isbn": "0-7695-0868-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08680154",
"articleId": "12OmNCu4nac",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08680175",
"articleId": "12OmNwGZNMr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzw8jh1",
"title": "19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2011)",
"acronym": "pdp",
"groupId": "1000543",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvCi44c",
"doi": "10.1109/PDP.2011.13",
"title": "Balancing Workloads of Servers Maintaining Scalable Distributed Data Structures",
"normalizedTitle": "Balancing Workloads of Servers Maintaining Scalable Distributed Data Structures",
"abstract": "A new architecture of Scalable Distributed Data Structures (SDDS) is presented and evaluated. It applies for SDDS files with overactive servers. Every bucket of the file is supplemented with a reference counter. The number of references to a bucket is counted up. It reflects activity of the bucket and is used for selecting the most active and most often used buckets (overactive servers). Workloads of the servers are then balanced with the help of so called scalability of throughput. It is proven that this gives very good results for read-mostly databases, where extensive pattern matching takes place.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A new architecture of Scalable Distributed Data Structures (SDDS) is presented and evaluated. It applies for SDDS files with overactive servers. Every bucket of the file is supplemented with a reference counter. The number of references to a bucket is counted up. It reflects activity of the bucket and is used for selecting the most active and most often used buckets (overactive servers). Workloads of the servers are then balanced with the help of so called scalability of throughput. It is proven that this gives very good results for read-mostly databases, where extensive pattern matching takes place.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A new architecture of Scalable Distributed Data Structures (SDDS) is presented and evaluated. It applies for SDDS files with overactive servers. Every bucket of the file is supplemented with a reference counter. The number of references to a bucket is counted up. It reflects activity of the bucket and is used for selecting the most active and most often used buckets (overactive servers). Workloads of the servers are then balanced with the help of so called scalability of throughput. It is proven that this gives very good results for read-mostly databases, where extensive pattern matching takes place.",
"fno": "05738974",
"keywords": [
"Data Structures",
"Distributed Processing",
"File Servers",
"Server Workload Balancing",
"Scalable Distributed Data Structure",
"SDDS File",
"Pattern Matching",
"Scalability",
"Throughput",
"Servers",
"Data Structures",
"Merging",
"Data Processing",
"Multicomputers",
"SDDS",
"Workload Balancing",
"Databases"
],
"authors": [
{
"affiliation": "Department of Computer ScienceKielce University of TechnologyKielce, Poland",
"fullName": "Grzegorz Łukawski",
"givenName": "Grzegorz",
"surname": "Łukawski",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., Kielce Univ. of Technol., Kielce, Poland",
"fullName": "Krzysztof Sapiecha",
"givenName": "Krzysztof",
"surname": "Sapiecha",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pdp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-02-01T00:00:00",
"pubType": "proceedings",
"pages": "80-84",
"year": "2011",
"issn": "1066-6192",
"isbn": "978-1-4244-9682-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05738973",
"articleId": "12OmNyqRnlL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05738989",
"articleId": "12OmNzmclkI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/uic-atc-scalcom-cbdcom-iop-smartworld/2016/2771/0/07816981",
"title": "Dynamic Range Partitioning with Asynchronous Data Balancing",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom-cbdcom-iop-smartworld/2016/07816981/12OmNAS9zGP",
"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/bigdata-congress/2014/5057/0/06906776",
"title": "AuDy: Automatic Dynamic Least-Weight Balancing for Stream Workloads Scalability",
"doi": null,
"abstractUrl": "/proceedings-article/bigdata-congress/2014/06906776/12OmNvUaNsm",
"parentPublication": {
"id": "proceedings/bigdata-congress/2014/5057/0",
"title": "2014 IEEE International Congress on Big Data (BigData Congress)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nas/2016/3315/0/07549423",
"title": "SUORA: A Scalable and Uniform Data Distribution Algorithm for Heterogeneous Storage Systems",
"doi": null,
"abstractUrl": "/proceedings-article/nas/2016/07549423/12OmNwHQBfe",
"parentPublication": {
"id": "proceedings/nas/2016/3315/0",
"title": "2016 IEEE International Conference on Networking, Architecture and Storage (NAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2013/5022/0/5022a958",
"title": "Bicriteria Load Balancing for Online Placement in Heterogeneous Servers with Pareto Upper Bounds",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2013/5022a958/12OmNwbukj5",
"parentPublication": {
"id": "proceedings/trustcom/2013/5022/0",
"title": "2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/1997/8105/0/81050217",
"title": "EH* - Extendible Hashing in a Distributed Environment",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/1997/81050217/12OmNxymo5b",
"parentPublication": {
"id": "proceedings/compsac/1997/8105/0",
"title": "Proceedings Twenty-First Annual International Computer Software and Applications Conference (COMPSAC'97)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2007/0802/0/04221678",
"title": "SD-Rtree: A Scalable Distributed Rtree",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2007/04221678/12OmNyen1s9",
"parentPublication": {
"id": "proceedings/icde/2007/0802/0",
"title": "2007 IEEE 23rd International Conference on Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2021/3902/0/09671318",
"title": "LDI: Learned Distribution Index for Column Stores",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2021/09671318/1A8ji0zLU9W",
"parentPublication": {
"id": "proceedings/big-data/2021/3902/0",
"title": "2021 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tk/5555/01/10008090",
"title": "The Design and Implementation of UniKV for Mixed Key-Value Storage Workloads",
"doi": null,
"abstractUrl": "/journal/tk/5555/01/10008090/1JInDO3voTm",
"parentPublication": {
"id": "trans/tk",
"title": "IEEE Transactions on Knowledge & Data Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101876",
"title": "UniKV: Toward High-Performance and Scalable KV Storage in Mixed Workloads via Unified Indexing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101876/1kaMIas12TK",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccd/2021/3219/0/321900a174",
"title": "Consistent RDMA-Friendly Hashing on Remote Persistent Memory",
"doi": null,
"abstractUrl": "/proceedings-article/iccd/2021/321900a174/1zuv1w9OMDe",
"parentPublication": {
"id": "proceedings/iccd/2021/3219/0",
"title": "2021 IEEE 39th International Conference on Computer Design (ICCD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwtn3tk",
"title": "Proceedings of 3rd IEEE International Symposium on High Performance Distributed Computing",
"acronym": "hpdc",
"groupId": "1000324",
"volume": "0",
"displayVolume": "0",
"year": "1994",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwM6A0L",
"doi": "10.1109/HPDC.1994.340258",
"title": "Providing high performance distributed computing through scalable computation servers",
"normalizedTitle": "Providing high performance distributed computing through scalable computation servers",
"abstract": "Distributed applications spanning multiple nodes should he capable of providing fast response. Computation servers equipped with powerful processors and large memories can improve performance by better utilising system resources such as offloading overloaded nodes. A computation service may comprise all the nodes of the system (in case all are equipped with the required resources) or a small subset such as provided by a pool of computation servers (as in Amoeba). In both cases there can be a large number of service providers (compute servers). A server selection service is required to choose the most suitable server to provide the service. This paper is concerned with the design of adaptive computation server selection with scale recognised as a primary design and implementation factor. Adaptive system partitioning into domains is advocated as a key design principle for scalability. The model is demonstrated with compute-server selection using adaptive partitioning compared to the same service using random selection and probing.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "Distributed applications spanning multiple nodes should he capable of providing fast response. Computation servers equipped with powerful processors and large memories can improve performance by better utilising system resources such as offloading overloaded nodes. A computation service may comprise all the nodes of the system (in case all are equipped with the required resources) or a small subset such as provided by a pool of computation servers (as in Amoeba). In both cases there can be a large number of service providers (compute servers). A server selection service is required to choose the most suitable server to provide the service. This paper is concerned with the design of adaptive computation server selection with scale recognised as a primary design and implementation factor. Adaptive system partitioning into domains is advocated as a key design principle for scalability. The model is demonstrated with compute-server selection using adaptive partitioning compared to the same service using random selection and probing.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Distributed applications spanning multiple nodes should he capable of providing fast response. Computation servers equipped with powerful processors and large memories can improve performance by better utilising system resources such as offloading overloaded nodes. A computation service may comprise all the nodes of the system (in case all are equipped with the required resources) or a small subset such as provided by a pool of computation servers (as in Amoeba). In both cases there can be a large number of service providers (compute servers). A server selection service is required to choose the most suitable server to provide the service. This paper is concerned with the design of adaptive computation server selection with scale recognised as a primary design and implementation factor. Adaptive system partitioning into domains is advocated as a key design principle for scalability. The model is demonstrated with compute-server selection using adaptive partitioning compared to the same service using random selection and probing.",
"fno": "00340258",
"keywords": [
"Network Operating Systems",
"Telecommunication Network Management",
"Computer Networks",
"Network Servers",
"Resource Allocation",
"Performance Evaluation",
"High Performance Distributed Computing",
"Scalable Computation Servers",
"Fast Response",
"Computation Service",
"Amoeba",
"Computation Servers",
"Server Selection Service",
"Scale",
"System Partitioning",
"Communication Network",
"Multiple Distributed Applications",
"Resource Sharing",
"Interconnected Computers",
"Distributed Computing",
"High Performance Computing",
"Scalability",
"Delay",
"Topology",
"Adaptive Systems",
"Computer Networks",
"Communication Networks",
"Application Software",
"Availability"
],
"authors": [
{
"affiliation": "Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel",
"fullName": "O. Kremien",
"givenName": "O.",
"surname": "Kremien",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "J. Kramer",
"givenName": "J.",
"surname": "Kramer",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hpdc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1994-01-01T00:00:00",
"pubType": "proceedings",
"pages": "70,71,72,73,74,75,76,77",
"year": "1994",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00340257",
"articleId": "12OmNBQTJdq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00340259",
"articleId": "12OmNxWLTx5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/edcc/2017/0602/0/0602a034",
"title": "Scalable Byzantine Fault Tolerance on Heterogeneous Servers",
"doi": null,
"abstractUrl": "/proceedings-article/edcc/2017/0602a034/12OmNAWYKIY",
"parentPublication": {
"id": "proceedings/edcc/2017/0602/0",
"title": "2017 13th European Dependable Computing Conference (EDCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euromicro/2005/2431/0/01517766",
"title": "RSerPool - providing highly available services using unreliable servers",
"doi": null,
"abstractUrl": "/proceedings-article/euromicro/2005/01517766/12OmNBRbklI",
"parentPublication": {
"id": "proceedings/euromicro/2005/2431/0",
"title": "EUROMICRO Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2016/1858/0/1858a400",
"title": "Energy-Aware Clusters of Servers for Storage and Computation Applications",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2016/1858a400/12OmNCxbXKE",
"parentPublication": {
"id": "proceedings/aina/2016/1858/0",
"title": "2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eurmic/2005/2431/0/01517766",
"title": "RSerPool - providing highly available services using unreliable servers",
"doi": null,
"abstractUrl": "/proceedings-article/eurmic/2005/01517766/12OmNqOffuA",
"parentPublication": {
"id": "proceedings/eurmic/2005/2431/0",
"title": "Proceedings. 31st Euromicro Conference on Software Engineering and Advanced Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euromicro/2005/2431/0/24310396",
"title": "RSerPool - Providing Highly Available Services using Unreliable Servers",
"doi": null,
"abstractUrl": "/proceedings-article/euromicro/2005/24310396/12OmNrEL2Bl",
"parentPublication": {
"id": "proceedings/euromicro/2005/2431/0",
"title": "EUROMICRO Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2013/2510/0/2510a149",
"title": "Dynamic Clusters of Servers for Reducing Electric Power in P2P Overlay Networks",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2013/2510a149/12OmNvy25bz",
"parentPublication": {
"id": "proceedings/nbis/2013/2510/0",
"title": "2013 16th International Conference on Network-Based Information Systems (NBiS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/islped/2009/8684/0/86840267",
"title": "Ranking servers based on energy savings for computation offloading",
"doi": null,
"abstractUrl": "/proceedings-article/islped/2009/86840267/12OmNx2zjvS",
"parentPublication": {
"id": "proceedings/islped/2009/8684/0",
"title": "Low Power Electronics and Design, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aina/2017/6029/0/6029a085",
"title": "Energy-Aware Virtual Machine Migration Models in a Scalable Cluster of Servers",
"doi": null,
"abstractUrl": "/proceedings-article/aina/2017/6029a085/12OmNzGDsIU",
"parentPublication": {
"id": "proceedings/aina/2017/6029/0",
"title": "2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rtas/2000/0713/0/07130228",
"title": "Dynamic Class-Based Queue Management for Scalable Media Servers",
"doi": null,
"abstractUrl": "/proceedings-article/rtas/2000/07130228/12OmNzxPTLz",
"parentPublication": {
"id": "proceedings/rtas/2000/0713/0",
"title": "Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2020/7002/0/700200b134",
"title": "CROSS: A Crowdsourcing based Sub-Servers Selection Framework in D2D Enhanced MEC Architecture",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2020/700200b134/1rsiH3SCQvu",
"parentPublication": {
"id": "proceedings/icdcs/2020/7002/0",
"title": "2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCmpcNk",
"title": "Visualization Conference, IEEE",
"acronym": "ieee-vis",
"groupId": "1000796",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBrV1U2",
"doi": "10.1109/VIS.2005.134",
"title": "VolumeExplorer: Roaming Large Volumes to Couple Visualization and Data Processing for Oil and Gas Exploration",
"normalizedTitle": "VolumeExplorer: Roaming Large Volumes to Couple Visualization and Data Processing for Oil and Gas Exploration",
"abstract": "In this paper, we present a volume roaming system dedicated to oil and gas exploration. Our system combines probebased volume rendering with data processing and computing. The daily oil production and the estimation of the world proven-reserves directly affect the barrel price and have a strong impact on the economy. Among others, production and correct estimation are linked to the accuracy of the subsurface model used for predicting oil reservoirs shape and size. Geoscientists build this model from the interpretation of seismic data, i.e. 3D images of the subsurface obtained from geophysical surveys. Our system couples visualization and data processing for the interpretation of seismic data. It is based on volume roaming along with efficient volume paging to manipulate the multi-gigabyte data sets commonly acquired during seismic surveys. Our volume rendering lenses implement high quality pre-integrated volume rendering with accurate lighting. They use a generic multimodal volume rendering system that blends several volumes in the spirit of the \"stencil\" paradigm used in 2D painting programs. In addition, our system can interactively display non-polygonal isosurfaces painted with an attribute. Beside the visualization algorithms, automatic extraction of local features of the subsurface model also take full advantage of the volume paging.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we present a volume roaming system dedicated to oil and gas exploration. Our system combines probebased volume rendering with data processing and computing. The daily oil production and the estimation of the world proven-reserves directly affect the barrel price and have a strong impact on the economy. Among others, production and correct estimation are linked to the accuracy of the subsurface model used for predicting oil reservoirs shape and size. Geoscientists build this model from the interpretation of seismic data, i.e. 3D images of the subsurface obtained from geophysical surveys. Our system couples visualization and data processing for the interpretation of seismic data. It is based on volume roaming along with efficient volume paging to manipulate the multi-gigabyte data sets commonly acquired during seismic surveys. Our volume rendering lenses implement high quality pre-integrated volume rendering with accurate lighting. They use a generic multimodal volume rendering system that blends several volumes in the spirit of the \"stencil\" paradigm used in 2D painting programs. In addition, our system can interactively display non-polygonal isosurfaces painted with an attribute. Beside the visualization algorithms, automatic extraction of local features of the subsurface model also take full advantage of the volume paging.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we present a volume roaming system dedicated to oil and gas exploration. Our system combines probebased volume rendering with data processing and computing. The daily oil production and the estimation of the world proven-reserves directly affect the barrel price and have a strong impact on the economy. Among others, production and correct estimation are linked to the accuracy of the subsurface model used for predicting oil reservoirs shape and size. Geoscientists build this model from the interpretation of seismic data, i.e. 3D images of the subsurface obtained from geophysical surveys. Our system couples visualization and data processing for the interpretation of seismic data. It is based on volume roaming along with efficient volume paging to manipulate the multi-gigabyte data sets commonly acquired during seismic surveys. Our volume rendering lenses implement high quality pre-integrated volume rendering with accurate lighting. They use a generic multimodal volume rendering system that blends several volumes in the spirit of the \"stencil\" paradigm used in 2D painting programs. In addition, our system can interactively display non-polygonal isosurfaces painted with an attribute. Beside the visualization algorithms, automatic extraction of local features of the subsurface model also take full advantage of the volume paging.",
"fno": "27660032",
"keywords": [],
"authors": [
{
"affiliation": "Earth Decision Sciences, Gocad Research Group",
"fullName": "Laurent Castanie",
"givenName": "Laurent",
"surname": "Castanie",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "INRIA Lorraine, Project ALICE",
"fullName": "Bruno Levy",
"givenName": "Bruno",
"surname": "Levy",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Earth Decision Sciences",
"fullName": "Fabien Bosquet",
"givenName": "Fabien",
"surname": "Bosquet",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ieee-vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-10-01T00:00:00",
"pubType": "proceedings",
"pages": "32",
"year": "2005",
"issn": null,
"isbn": "0-7803-9462-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01532817",
"articleId": "12OmNwp74uV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01532818",
"articleId": "12OmNyuyade",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/01532802",
"title": "VolumeExplorer: roaming large volumes to couple visualization and data processing for oil and gas exploration",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532802/12OmNBrV1OM",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ldav/2013/1659/0/06675167",
"title": "Interactive rendering and efficient querying for large multivariate seismic volumes on consumer level PCs",
"doi": null,
"abstractUrl": "/proceedings-article/ldav/2013/06675167/12OmNC3Xhwm",
"parentPublication": {
"id": "proceedings/ldav/2013/1659/0",
"title": "2013 IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2915/0/00201818",
"title": "A pattern recognition approach to detect oil/gas reservoirs in sand/shale sediments",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201818/12OmNqGitY5",
"parentPublication": {
"id": "proceedings/icpr/1992/2915/0",
"title": "11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/kam/2009/3888/3/3888c020",
"title": "Model-Driven Data Mining in the Oil & Gas Exploration and Production",
"doi": null,
"abstractUrl": "/proceedings-article/kam/2009/3888c020/12OmNrIrPrX",
"parentPublication": {
"id": "proceedings/kam/2009/3888/1",
"title": "Knowledge Acquisition and Modeling, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacificvis/2011/935/0/05742373",
"title": "Interactive seismic interpretation with piecewise global energy minimization",
"doi": null,
"abstractUrl": "/proceedings-article/pacificvis/2011/05742373/12OmNrNh0AL",
"parentPublication": {
"id": "proceedings/pacificvis/2011/935/0",
"title": "2011 IEEE Pacific Visualization Symposium (PacificVis)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2012/4789/0/4789a526",
"title": "Oil and Gas Exploration Information Integration Management Plan Based on GIS Technology",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2012/4789a526/12OmNxGja6w",
"parentPublication": {
"id": "proceedings/iccis/2012/4789/0",
"title": "2012 Fourth International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2010/4270/0/4270b319",
"title": "Application of Neural Network in Predicting Volume Ratio of Gas and Oil",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2010/4270b319/12OmNyuya7q",
"parentPublication": {
"id": "proceedings/iccis/2010/4270/0",
"title": "2010 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2007/1834/0/04458023",
"title": "The Oil-Gas Prediction of Seismic Reservoir Based on Rough Set and PSO Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2007/04458023/12OmNzEVRXs",
"parentPublication": {
"id": "proceedings/isspit/2007/1834/0",
"title": "2007 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2009/4672/0/05202244",
"title": "Synchronous ultra-wide band wireless sensors networks for oil and gas exploration",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2009/05202244/12OmNzwpUaj",
"parentPublication": {
"id": "proceedings/iscc/2009/4672/0",
"title": "2009 IEEE Symposium on Computers and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1299",
"title": "Distributed Shared Memory for Roaming Large Volumes",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1299/13rRUxOdD2x",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvmowTg",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"acronym": "vv",
"groupId": "1000808",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzvhvCC",
"doi": "10.1109/SWG.2002.1226509",
"title": "OpenGL Volumizer: A Toolkit for High Quality Volume Rendering of Large Data Sets",
"normalizedTitle": "OpenGL Volumizer: A Toolkit for High Quality Volume Rendering of Large Data Sets",
"abstract": "We present the OpenGL Volumizer API for interactive, high-quality, scalable visualization of large volumetric data sets. Volumizer provides a high-level interface to OpenGL hardware to allow application writers and researchers to visualize multiple gigabytes of volumetric data. Use of multiple graphics pipes scales rendering performance and system resources including pixel-fill rate and texture memory size. Volume roaming and multi-resolution volume rendering provide alternatives for interactive visualization of volume data. We combine the concepts of roaming and multi-resolution to introduce 3D Clip-Textures, an efficient technique to visualize arbitrarily large volume data by judiciously organizing and paging them to local graphics resources from storage peripherals. Volumetric shaders provide an interface for high quality volume rendering along with implementing new visualization techniques. This paper gives an overview of the API along with a discussion of large data visualization techniques used by Volumizer.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present the OpenGL Volumizer API for interactive, high-quality, scalable visualization of large volumetric data sets. Volumizer provides a high-level interface to OpenGL hardware to allow application writers and researchers to visualize multiple gigabytes of volumetric data. Use of multiple graphics pipes scales rendering performance and system resources including pixel-fill rate and texture memory size. Volume roaming and multi-resolution volume rendering provide alternatives for interactive visualization of volume data. We combine the concepts of roaming and multi-resolution to introduce 3D Clip-Textures, an efficient technique to visualize arbitrarily large volume data by judiciously organizing and paging them to local graphics resources from storage peripherals. Volumetric shaders provide an interface for high quality volume rendering along with implementing new visualization techniques. This paper gives an overview of the API along with a discussion of large data visualization techniques used by Volumizer.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present the OpenGL Volumizer API for interactive, high-quality, scalable visualization of large volumetric data sets. Volumizer provides a high-level interface to OpenGL hardware to allow application writers and researchers to visualize multiple gigabytes of volumetric data. Use of multiple graphics pipes scales rendering performance and system resources including pixel-fill rate and texture memory size. Volume roaming and multi-resolution volume rendering provide alternatives for interactive visualization of volume data. We combine the concepts of roaming and multi-resolution to introduce 3D Clip-Textures, an efficient technique to visualize arbitrarily large volume data by judiciously organizing and paging them to local graphics resources from storage peripherals. Volumetric shaders provide an interface for high quality volume rendering along with implementing new visualization techniques. This paper gives an overview of the API along with a discussion of large data visualization techniques used by Volumizer.",
"fno": "76410045",
"keywords": [
"Volume Visualization",
"Large Data",
"Texture Mapping",
"Clip Textures"
],
"authors": [
{
"affiliation": "SGI",
"fullName": "Praveen Bhaniramka",
"givenName": "Praveen",
"surname": "Bhaniramka",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "SGI",
"fullName": "Yves Demange",
"givenName": "Yves",
"surname": "Demange",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-10-01T00:00:00",
"pubType": "proceedings",
"pages": "45-54",
"year": "2002",
"issn": null,
"isbn": "0-7803-7641-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "76410037",
"articleId": "12OmNx8Outc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "76410055",
"articleId": "12OmNyqRn5T",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2002/7498/0/7498kniss",
"title": "Interactive Translucent Volume Rendering and Procedural Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498kniss/12OmNB0X8rO",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1996/3673/0/36730073",
"title": "Deformable Volume Rendering by 3D Texture Mapping and Octree Encoding",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1996/36730073/12OmNwsNRcc",
"parentPublication": {
"id": "proceedings/ieee-vis/1996/3673/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200dong",
"title": "Volume Rendering of Fine Details Within Medical Data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200dong/12OmNx6xHlc",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b575",
"title": "Rapid Texture-based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b575/12OmNx7G5VW",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660038",
"title": "Scale-Invariant Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660038/12OmNxb5hu0",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1999/5897/0/58970032",
"title": "Enabling Classification and Shading for 3D Texture Mapping Based Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1999/58970032/12OmNyvGyh8",
"parentPublication": {
"id": "proceedings/ieee-vis/1999/5897/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/alpit/2007/2930/0/2930a282",
"title": "Self-Adaptive Slices of 3D Texture Real-Time Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/alpit/2007/2930a282/12OmNzd7c2j",
"parentPublication": {
"id": "proceedings/alpit/2007/2930/0",
"title": "Advanced Language Processing and Web Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2003/2030/0/20300032",
"title": "Chameleon: An Interactive Texture-based Rendering Framework for Visualizing Three-dimensional Vector Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2003/20300032/12OmNzh5z0U",
"parentPublication": {
"id": "proceedings/ieee-vis/2003/2030/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/03/v0341",
"title": "Interactive Volume Rendering of Large Sparse Data Sets Using Adaptive Mesh Refinement Hierarchies",
"doi": null,
"abstractUrl": "/journal/tg/2003/03/v0341/13rRUxASuho",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2001/03/v0242",
"title": "Two-Level Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2001/03/v0242/13rRUxC0SOO",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAYXWAF",
"title": "2016 IEEE Virtual Reality (VR)",
"acronym": "vr",
"groupId": "1000791",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNApcuq5",
"doi": "10.1109/VR.2016.7504773",
"title": "Progressive feedback point cloud rendering for virtual reality display",
"normalizedTitle": "Progressive feedback point cloud rendering for virtual reality display",
"abstract": "Previous approaches to rendering large point clouds on immersive displays have generally created a trade-off between interactivity and quality. While these approaches have been quite successful for desktop environments when interaction is limited, virtual reality systems are continuously interactive, which forces users to suffer through either low frame rates or low image quality. This paper presents a novel approach to this problem through a progressive feedback-driven rendering algorithm. This algorithm uses reprojections of past views to accelerate the reconstruction of the current view. The presented method is tested against previous methods, showing improvements in both rendering quality and interactivity.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Previous approaches to rendering large point clouds on immersive displays have generally created a trade-off between interactivity and quality. While these approaches have been quite successful for desktop environments when interaction is limited, virtual reality systems are continuously interactive, which forces users to suffer through either low frame rates or low image quality. This paper presents a novel approach to this problem through a progressive feedback-driven rendering algorithm. This algorithm uses reprojections of past views to accelerate the reconstruction of the current view. The presented method is tested against previous methods, showing improvements in both rendering quality and interactivity.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Previous approaches to rendering large point clouds on immersive displays have generally created a trade-off between interactivity and quality. While these approaches have been quite successful for desktop environments when interaction is limited, virtual reality systems are continuously interactive, which forces users to suffer through either low frame rates or low image quality. This paper presents a novel approach to this problem through a progressive feedback-driven rendering algorithm. This algorithm uses reprojections of past views to accelerate the reconstruction of the current view. The presented method is tested against previous methods, showing improvements in both rendering quality and interactivity.",
"fno": "07504773",
"keywords": [
"Rendering Computer Graphics",
"Three Dimensional Displays",
"Graphics Processing Units",
"Measurement",
"Virtual Reality",
"Feedback Loop",
"Geometry",
"3 D Scanning",
"Point Based Graphics",
"Virtual Reality"
],
"authors": [
{
"affiliation": "Wisconsin Institute for Discovery - University of Wisconsin-Madison",
"fullName": "Ross Tredinnick",
"givenName": "Ross",
"surname": "Tredinnick",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wisconsin Institute for Discovery - University of Wisconsin-Madison",
"fullName": "Markus Broecker",
"givenName": "Markus",
"surname": "Broecker",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wisconsin Institute for Discovery - University of Wisconsin-Madison",
"fullName": "Kevin Ponto",
"givenName": "Kevin",
"surname": "Ponto",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-03-01T00:00:00",
"pubType": "proceedings",
"pages": "301-302",
"year": "2016",
"issn": "2375-5334",
"isbn": "978-1-5090-0836-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07504772",
"articleId": "12OmNCf1Dnb",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07504774",
"articleId": "12OmNz61cUl",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cw/2004/2140/0/21400293",
"title": "Interactive Point-Based Painterly Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2004/21400293/12OmNApcus6",
"parentPublication": {
"id": "proceedings/cw/2004/2140/0",
"title": "2004 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloudcom/2012/4511/0/06427506",
"title": "A framework for OpenGL client-server rendering",
"doi": null,
"abstractUrl": "/proceedings-article/cloudcom/2012/06427506/12OmNqC2v2u",
"parentPublication": {
"id": "proceedings/cloudcom/2012/4511/0",
"title": "4th IEEE International Conference on Cloud Computing Technology and Science Proceedings",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pbg/2005/20/0/01500314",
"title": "Progressive splatting",
"doi": null,
"abstractUrl": "/proceedings-article/pbg/2005/01500314/12OmNqNos8r",
"parentPublication": {
"id": "proceedings/pbg/2005/20/0",
"title": "Point-Based Graphics 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2010/8420/0/05720359",
"title": "Texture-Based Wireframe Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2010/05720359/12OmNwCaCvX",
"parentPublication": {
"id": "proceedings/sibgrapi/2010/8420/0",
"title": "2010 23rd SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870011",
"title": "Interactive Maximum Projection Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870011/12OmNzZmZv2",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1307",
"title": "Progressive Volume Rendering of Large Unstructured Grids",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1307/13rRUwfZC05",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/09/08052161",
"title": "Real-Time Lens Based Rendering Algorithm for Super-Multiview Integral Photography without Image Resampling",
"doi": null,
"abstractUrl": "/journal/tg/2018/09/08052161/13rRUxZRbo2",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000e625",
"title": "InverseFaceNet: Deep Monocular Inverse Face Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000e625/17D45XdBRQT",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600m2703",
"title": "PhyIR: Physics-based Inverse Rendering for Panoramic Indoor Images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600m2703/1H1l4vBZwac",
"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/2020/7168/0/716800h827",
"title": "Neural Point Cloud Rendering via Multi-Plane Projection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800h827/1m3nmJqUK8o",
"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": "12OmNvmowTg",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"acronym": "vv",
"groupId": "1000808",
"volume": "0",
"displayVolume": "0",
"year": "2002",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqHItvv",
"doi": "10.1109/SWG.2002.1226506",
"title": "A Two-Step Approach for Interactive Pre-Integrated Volume Rendering of Unstructured Grids",
"normalizedTitle": "A Two-Step Approach for Interactive Pre-Integrated Volume Rendering of Unstructured Grids",
"abstract": "In the area of volume visualization the cell projection technique is used widely to display unstructured tetrahedral grids. In this field, the pre-integration of the ray integral has proven to be a powerful method for the display of tetrahedral grids with high quality and at interactive frame rates. Besides the actual performance of the projected tetrahedra algorithm of Shirley and Tuchman, the degree of interactivity is also limited by the update rate of the pre-integrated ray integral and the performance of the graphics card at high screen resolutions. In order to widen those two bottlenecks, we propose a hardware-accelerated pre-integration approach and a rendering method which applies standard 2D texture mapping instead of the previously used 3D texturing. As a result, the update rate of the transfer function is increased by almost a factor of hundred and the rasterization of the tetrahedra is sped up by up to a factor of three without degrading accuracy. As a side effect, pre-integrated unstructured volume rendering can be utilized on a broader range of graphics platforms, since the support of 2D texture mapping is much more common. In summary, our two-step approach greatly increases the interactivity of unstructured pre-integrated volume rendering allowing for a much wider area of application.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In the area of volume visualization the cell projection technique is used widely to display unstructured tetrahedral grids. In this field, the pre-integration of the ray integral has proven to be a powerful method for the display of tetrahedral grids with high quality and at interactive frame rates. Besides the actual performance of the projected tetrahedra algorithm of Shirley and Tuchman, the degree of interactivity is also limited by the update rate of the pre-integrated ray integral and the performance of the graphics card at high screen resolutions. In order to widen those two bottlenecks, we propose a hardware-accelerated pre-integration approach and a rendering method which applies standard 2D texture mapping instead of the previously used 3D texturing. As a result, the update rate of the transfer function is increased by almost a factor of hundred and the rasterization of the tetrahedra is sped up by up to a factor of three without degrading accuracy. As a side effect, pre-integrated unstructured volume rendering can be utilized on a broader range of graphics platforms, since the support of 2D texture mapping is much more common. In summary, our two-step approach greatly increases the interactivity of unstructured pre-integrated volume rendering allowing for a much wider area of application.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In the area of volume visualization the cell projection technique is used widely to display unstructured tetrahedral grids. In this field, the pre-integration of the ray integral has proven to be a powerful method for the display of tetrahedral grids with high quality and at interactive frame rates. Besides the actual performance of the projected tetrahedra algorithm of Shirley and Tuchman, the degree of interactivity is also limited by the update rate of the pre-integrated ray integral and the performance of the graphics card at high screen resolutions. In order to widen those two bottlenecks, we propose a hardware-accelerated pre-integration approach and a rendering method which applies standard 2D texture mapping instead of the previously used 3D texturing. As a result, the update rate of the transfer function is increased by almost a factor of hundred and the rasterization of the tetrahedra is sped up by up to a factor of three without degrading accuracy. As a side effect, pre-integrated unstructured volume rendering can be utilized on a broader range of graphics platforms, since the support of 2D texture mapping is much more common. In summary, our two-step approach greatly increases the interactivity of unstructured pre-integrated volume rendering allowing for a much wider area of application.",
"fno": "76410023",
"keywords": [],
"authors": [
{
"affiliation": "University of Stuttgart",
"fullName": "Stefan Roettger",
"givenName": "Stefan",
"surname": "Roettger",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Stuttgart",
"fullName": "Thomas Ertl",
"givenName": "Thomas",
"surname": "Ertl",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2002-10-01T00:00:00",
"pubType": "proceedings",
"pages": "23-28",
"year": "2002",
"issn": null,
"isbn": "0-7803-7641-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "76410013",
"articleId": "12OmNxVlTID",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "76410029",
"articleId": "12OmNwFRp8z",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2005/2766/0/27660043",
"title": "Volume rendering of smoke propagation CFD data",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660043/12OmNB8TU59",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880027",
"title": "Projecting Tetrahedra without Rendering Artifacts",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880027/12OmNBbsidz",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780016",
"title": "Hardware-Accelerated Volume and Isosurface Rendering Based on Cell-Projection",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780016/12OmNBuL1lz",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2011/4548/0/4548a093",
"title": "Accurate Volume Rendering of Unstructured Hexahedral Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2011/4548a093/12OmNCcbE5T",
"parentPublication": {
"id": "proceedings/sibgrapi/2011/4548/0",
"title": "2011 24th SIBGRAPI Conference on Graphics, Patterns and Images",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660026",
"title": "Interactive Rendering of Large Unstructured Grids Using Dynamic Level-of-Detail",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660026/12OmNrIaear",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2000/6478/0/64780015",
"title": "On-the-Fly Rendering of Losslessly Compressed Irregular Volume Grids",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2000/64780015/12OmNxFJXEw",
"parentPublication": {
"id": "proceedings/ieee-vis/2000/6478/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/01532796",
"title": "Interactive rendering of large unstructured grids using dynamic level-of-detail",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/01532796/12OmNyvY9ut",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/haptics/2002/1489/0/14890193",
"title": "Haptic Rendering of Data on Unstructured Tetrahedral Grids",
"doi": null,
"abstractUrl": "/proceedings-article/haptics/2002/14890193/12OmNz5s0PQ",
"parentPublication": {
"id": "proceedings/haptics/2002/1489/0",
"title": "Haptic Interfaces for Virtual Environment and Teleoperator Systems, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2004/8788/0/87880433",
"title": "TetSplat Real-Time Rendering and Volume Clipping of Large Unstructured Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2004/87880433/12OmNzRHOOj",
"parentPublication": {
"id": "proceedings/ieee-vis/2004/8788/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1307",
"title": "Progressive Volume Rendering of Large Unstructured Grids",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1307/13rRUwfZC05",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzgNXZt",
"title": "Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics",
"acronym": "spwhos",
"groupId": "1000332",
"volume": "0",
"displayVolume": "0",
"year": "1997",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwp74Nc",
"doi": "10.1109/HOST.1997.613566",
"title": "Playing with long range dependence and HOS",
"normalizedTitle": "Playing with long range dependence and HOS",
"abstract": "Abstract: In this paper, we consider some independent problems concerning HOS and nonGaussian long range dependent processes. We exhibit HOS for non integer FARIMA processes, showing that singularities may occur in multispectrum. A class of nonGaussian processes constructed by a multiplicative process on the dyadic tree is then considered. Finally, long range dependence problems in the Fourier transform are examined.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Abstract: In this paper, we consider some independent problems concerning HOS and nonGaussian long range dependent processes. We exhibit HOS for non integer FARIMA processes, showing that singularities may occur in multispectrum. A class of nonGaussian processes constructed by a multiplicative process on the dyadic tree is then considered. Finally, long range dependence problems in the Fourier transform are examined.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Abstract: In this paper, we consider some independent problems concerning HOS and nonGaussian long range dependent processes. We exhibit HOS for non integer FARIMA processes, showing that singularities may occur in multispectrum. A class of nonGaussian processes constructed by a multiplicative process on the dyadic tree is then considered. Finally, long range dependence problems in the Fourier transform are examined.",
"fno": "80050453",
"keywords": [
"Higher Order Statistics Long Range Dependence HOS Non Gaussian Long Range Dependent Process Noninteger FARIMA Processes Singularities Multispectrum Multiplicative Process Dyadic Tree Fourier Transform"
],
"authors": [
{
"affiliation": "ENSIEG, Saint Martin d'Heres, France",
"fullName": "P.O. Amblard",
"givenName": "P.O.",
"surname": "Amblard",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "ENSIEG, Saint Martin d'Heres, France",
"fullName": "J.M. Brossier",
"givenName": "J.M.",
"surname": "Brossier",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "ENSIEG, Saint Martin d'Heres, France",
"fullName": "J.L. Lacoume",
"givenName": "J.L.",
"surname": "Lacoume",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "spwhos",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1997-07-01T00:00:00",
"pubType": "proceedings",
"pages": "0453",
"year": "1997",
"issn": null,
"isbn": "0-8186-8005-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "80050448",
"articleId": "12OmNrYlmQl",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "80050458",
"articleId": "12OmNxwncFr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxFJXD9",
"title": "Parallel and Distributed Processing Symposium, International",
"acronym": "ipdps",
"groupId": "1000530",
"volume": "0",
"displayVolume": "0",
"year": "2013",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCmpcHn",
"doi": "10.1109/IPDPS.2013.112",
"title": "Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions",
"normalizedTitle": "Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions",
"abstract": "Cyclops (cyclic-operations) Tensor Framework(CTF) is a distributed library for tensor contractions. CTF aims to scale high-dimensional tensor contractions such as those required in the Coupled Cluster (CC) electronic structure method to massively-parallel supercomputers. The framework preserves tensor structure by subdividing tensors cyclically, producing a regular parallel decomposition. An internal virtualization layer provides completely general mapping support while maintaining ideal load balance. The mapping framework decides on the best mapping for each tensor contraction at run-time via explicit calculations of memory usage and communication volume. CTF employs a general redistribution kernel, which transposes tensors of any dimension between arbitrary distributed layouts, yet touches each piece of data only once. Sequential symmetric contractions are reduced to matrix multiplication calls via tensor index transpositions and partial unpacking. The user-level interface elegantly expresses arbitrary-dimensional generalized tensor contractions in the form of a domain specific language. We demonstrate performance of CC with single and double excitations on 8192 nodes of Blue Gene/Q and show that CTF outperforms NWChem on Cray XE6 supercomputers for benchmarked systems.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Cyclops (cyclic-operations) Tensor Framework(CTF) is a distributed library for tensor contractions. CTF aims to scale high-dimensional tensor contractions such as those required in the Coupled Cluster (CC) electronic structure method to massively-parallel supercomputers. The framework preserves tensor structure by subdividing tensors cyclically, producing a regular parallel decomposition. An internal virtualization layer provides completely general mapping support while maintaining ideal load balance. The mapping framework decides on the best mapping for each tensor contraction at run-time via explicit calculations of memory usage and communication volume. CTF employs a general redistribution kernel, which transposes tensors of any dimension between arbitrary distributed layouts, yet touches each piece of data only once. Sequential symmetric contractions are reduced to matrix multiplication calls via tensor index transpositions and partial unpacking. The user-level interface elegantly expresses arbitrary-dimensional generalized tensor contractions in the form of a domain specific language. We demonstrate performance of CC with single and double excitations on 8192 nodes of Blue Gene/Q and show that CTF outperforms NWChem on Cray XE6 supercomputers for benchmarked systems.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Cyclops (cyclic-operations) Tensor Framework(CTF) is a distributed library for tensor contractions. CTF aims to scale high-dimensional tensor contractions such as those required in the Coupled Cluster (CC) electronic structure method to massively-parallel supercomputers. The framework preserves tensor structure by subdividing tensors cyclically, producing a regular parallel decomposition. An internal virtualization layer provides completely general mapping support while maintaining ideal load balance. The mapping framework decides on the best mapping for each tensor contraction at run-time via explicit calculations of memory usage and communication volume. CTF employs a general redistribution kernel, which transposes tensors of any dimension between arbitrary distributed layouts, yet touches each piece of data only once. Sequential symmetric contractions are reduced to matrix multiplication calls via tensor index transpositions and partial unpacking. The user-level interface elegantly expresses arbitrary-dimensional generalized tensor contractions in the form of a domain specific language. We demonstrate performance of CC with single and double excitations on 8192 nodes of Blue Gene/Q and show that CTF outperforms NWChem on Cray XE6 supercomputers for benchmarked systems.",
"fno": "4971a813",
"keywords": [
"Tensile Stress",
"Indexes",
"Equations",
"Program Processors",
"Chemistry",
"Clustering Algorithms",
"Manganese",
"Communication Avoiding Algorithms",
"Tensor Contractions",
"Coupled Cluster",
"Cyclops"
],
"authors": [
{
"affiliation": null,
"fullName": "Edgar Solomonik",
"givenName": "Edgar",
"surname": "Solomonik",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Devin Matthews",
"givenName": "Devin",
"surname": "Matthews",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jeff Hammond",
"givenName": "Jeff",
"surname": "Hammond",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "James Demmel",
"givenName": "James",
"surname": "Demmel",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ipdps",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2013-05-01T00:00:00",
"pubType": "proceedings",
"pages": "813-824",
"year": "2013",
"issn": "1530-2075",
"isbn": "978-1-4673-6066-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4971a803",
"articleId": "12OmNAsk4yV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4971a825",
"articleId": "12OmNrF2DKH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdm/2011/4408/0/4408a447",
"title": "Boolean Tensor Factorizations",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2011/4408a447/12OmNAWH9IW",
"parentPublication": {
"id": "proceedings/icdm/2011/4408/0",
"title": "2011 IEEE 11th International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hipc/2016/5411/0/07839684",
"title": "Tensor Contractions with Extended BLAS Kernels on CPU and GPU",
"doi": null,
"abstractUrl": "/proceedings-article/hipc/2016/07839684/12OmNBSSVqQ",
"parentPublication": {
"id": "proceedings/hipc/2016/5411/0",
"title": "2016 IEEE 23rd International Conference on High-Performance Computing (HiPC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdm/2008/3502/0/3502a363",
"title": "Scalable Tensor Decompositions for Multi-aspect Data Mining",
"doi": null,
"abstractUrl": "/proceedings-article/icdm/2008/3502a363/12OmNCfAPCM",
"parentPublication": {
"id": "proceedings/icdm/2008/3502/0",
"title": "2008 Eighth IEEE International Conference on Data Mining",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660004",
"title": "HOT- Lines: Tracking Lines in Higher Order Tensor Fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660004/12OmNwMXnqd",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cluster/2010/4220/0/4220a207",
"title": "Acceleration of Streamed Tensor Contraction Expressions on GPGPU-Based Clusters",
"doi": null,
"abstractUrl": "/proceedings-article/cluster/2010/4220a207/12OmNwwd2Zl",
"parentPublication": {
"id": "proceedings/cluster/2010/4220/0",
"title": "2010 IEEE International Conference on Cluster Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2006/9753/0/04042296",
"title": "Bilateral Filtering of Diffusion Tensor MR Images",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2006/04042296/12OmNxwncfI",
"parentPublication": {
"id": "proceedings/isspit/2006/9753/0",
"title": "2006 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498sigfrids",
"title": "Tensor Field Visualisation using Adaptive Filtering of Noise Fields combined with Glyph Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498sigfrids/12OmNyfdOXA",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1997/8262/0/82620059",
"title": "Singularities in nonuniform tensor fields",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1997/82620059/12OmNzFMFiX",
"parentPublication": {
"id": "proceedings/ieee-vis/1997/8262/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/2014/5618/0/5618a261",
"title": "CAST: Contraction Algorithm for Symmetric Tensors",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/2014/5618a261/12OmNzzP5Be",
"parentPublication": {
"id": "proceedings/icpp/2014/5618/0",
"title": "2014 43nd International Conference on Parallel Processing (ICPP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sc/2020/9998/0/999800a319",
"title": "Distributed-Memory DMRG via Sparse and Dense Parallel Tensor Contractions",
"doi": null,
"abstractUrl": "/proceedings-article/sc/2020/999800a319/1oeOSaJ1kzK",
"parentPublication": {
"id": "proceedings/sc/2020/9998/0/",
"title": "2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzn395c",
"title": "International Quantum Electronics Conference, 2005.",
"acronym": "iqec",
"groupId": "1000605",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCvLXXE",
"doi": "10.1109/IQEC.2005.1560974",
"title": "Two beam coupling gain enhancement in porphyrin:Zn-doped nematic liquid crystals with an applied DC field and moving grating technique",
"normalizedTitle": "Two beam coupling gain enhancement in porphyrin:Zn-doped nematic liquid crystals with an applied DC field and moving grating technique",
"abstract": null,
"abstracts": [],
"normalizedAbstract": null,
"fno": "01560974",
"keywords": [
"Liquid Crystals",
"Optical Coupling",
"Gratings",
"Gain Measurement",
"Space Charge",
"Equations",
"Photorefractive Materials",
"Wavelength Measurement",
"Laser Beams",
"Torque"
],
"authors": [
{
"affiliation": null,
"fullName": "Eun Ju Kim",
"givenName": null,
"surname": "Eun Ju Kim",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sang Jo Lee",
"givenName": null,
"surname": "Sang Jo Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Gun Yeup Kim",
"givenName": null,
"surname": "Gun Yeup Kim",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hye Ri Yang",
"givenName": null,
"surname": "Hye Ri Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Chong Hoon Kwak",
"givenName": null,
"surname": "Chong Hoon Kwak",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iqec",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-01-01T00:00:00",
"pubType": "proceedings",
"pages": "720,721",
"year": "2005",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01560973",
"articleId": "12OmNBr4evN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01560975",
"articleId": "12OmNyLiuC5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdl/2002/7350/0/01022774",
"title": "Electrorheology in liquids and liquid crystals studied by ultrasonic wave",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022774/12OmNAZOJZj",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdl/2002/7350/0/01022778",
"title": "Electrical and optical properties of discotic liquid crystals with various core structures",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022778/12OmNCmpcT5",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iqec/2005/9240/0/01560997",
"title": "Single-beam light-induced phenomena in dye-doped liquids and liquid crystals",
"doi": null,
"abstractUrl": "/proceedings-article/iqec/2005/01560997/12OmNwDj0XO",
"parentPublication": {
"id": "proceedings/iqec/2005/9240/0",
"title": "International Quantum Electronics Conference, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmpeur/1989/1940/0/00093363",
"title": "Electro-optical effects, liquid crystals and their application in displays",
"doi": null,
"abstractUrl": "/proceedings-article/cmpeur/1989/00093363/12OmNwnYFYu",
"parentPublication": {
"id": "proceedings/cmpeur/1989/1940/0",
"title": "COMPEURO 89 Proceedings VLSI and Computer Peripherals.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eqec/2005/8973/0/01567222",
"title": "Dynamic instability of interacting counterpropagating solitons in photorefractive crystals",
"doi": null,
"abstractUrl": "/proceedings-article/eqec/2005/01567222/12OmNx2QUL9",
"parentPublication": {
"id": "proceedings/eqec/2005/8973/0",
"title": "2005 European Quantum Electronics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iqec/2005/9240/0/01560983",
"title": "Z-scan analysis of porphyrin:Zn doped nematic liquid crystal",
"doi": null,
"abstractUrl": "/proceedings-article/iqec/2005/01560983/12OmNzYNNgl",
"parentPublication": {
"id": "proceedings/iqec/2005/9240/0",
"title": "International Quantum Electronics Conference, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdl/2002/7350/0/01022777",
"title": "Optical property of photonic crystals infiltrated with various liquids and liquid crystals",
"doi": null,
"abstractUrl": "/proceedings-article/icdl/2002/01022777/12OmNzlUKrK",
"parentPublication": {
"id": "proceedings/icdl/2002/7350/0",
"title": "Proceedings of 14th International Conference on Dielectric Liquids",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cerma/2011/4563/0/4563a333",
"title": "Gain Equalization for Erbium-Doped Fiber Amplifiers by the Synthesis of a Long-Period Fiber Grating",
"doi": null,
"abstractUrl": "/proceedings-article/cerma/2011/4563a333/12OmNznkJY3",
"parentPublication": {
"id": "proceedings/cerma/2011/4563/0",
"title": "Electronics, Robotics and Automotive Mechanics Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1045",
"title": "Detection and Visualization of Defects in 3D Unstructured Models of Nematic Liquid Crystals",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1045/13rRUEgarnF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/05/v1323",
"title": "Techniques for the Visualization of Topological Defect Behavior in Nematic Liquid Crystals",
"doi": null,
"abstractUrl": "/journal/tg/2006/05/v1323/13rRUxAAT7v",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCmpcMN",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"acronym": "fskd",
"groupId": "1001615",
"volume": "5",
"displayVolume": "5",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBscCUk",
"doi": "10.1109/FSKD.2009.591",
"title": "The Study of Interpolation Algorithm Based on Cubic Spline in Marching Cubes Method",
"normalizedTitle": "The Study of Interpolation Algorithm Based on Cubic Spline in Marching Cubes Method",
"abstract": "In Marching Cubes (MC) Method the construction of isosurface usually uses the tri-linear interpolation algorithm. It is easy to understand and calculated simply. But at the same time its smoothness is bad, and has no high-order convergence, so error is also relatively large. With developing of computer software and hardware, other interpolation algorithm which is relatively complex and its convergence is better has been easy to achieve by using computer. This paper proposes one new method which introduces cubic spline interpolation to the MC method. After analyzing the cost of its time and space complexity, we give several sets of experimental data, and verify the theoretical correctness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In Marching Cubes (MC) Method the construction of isosurface usually uses the tri-linear interpolation algorithm. It is easy to understand and calculated simply. But at the same time its smoothness is bad, and has no high-order convergence, so error is also relatively large. With developing of computer software and hardware, other interpolation algorithm which is relatively complex and its convergence is better has been easy to achieve by using computer. This paper proposes one new method which introduces cubic spline interpolation to the MC method. After analyzing the cost of its time and space complexity, we give several sets of experimental data, and verify the theoretical correctness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In Marching Cubes (MC) Method the construction of isosurface usually uses the tri-linear interpolation algorithm. It is easy to understand and calculated simply. But at the same time its smoothness is bad, and has no high-order convergence, so error is also relatively large. With developing of computer software and hardware, other interpolation algorithm which is relatively complex and its convergence is better has been easy to achieve by using computer. This paper proposes one new method which introduces cubic spline interpolation to the MC method. After analyzing the cost of its time and space complexity, we give several sets of experimental data, and verify the theoretical correctness.",
"fno": "3735e080",
"keywords": [
"Cubic Spline",
"MC",
"Interpolation"
],
"authors": [
{
"affiliation": null,
"fullName": "Huiyan Jiang",
"givenName": "Huiyan",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yudong Zhao",
"givenName": "Yudong",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "fskd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-08-01T00:00:00",
"pubType": "proceedings",
"pages": "80-83",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3735-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3735e075",
"articleId": "12OmNqN6R9x",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3735e087",
"articleId": "12OmNy3RRGv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iih-msp/2008/3278/0/3278a109",
"title": "An Animation Engine with the Cubic Spline Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a109/12OmNBJw9TQ",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccae/2009/3569/0/3569a186",
"title": "PID Controller Evaluation with Missing Samples in a Networked Control System Using Spline Interpolation Method",
"doi": null,
"abstractUrl": "/proceedings-article/iccae/2009/3569a186/12OmNBtl1qN",
"parentPublication": {
"id": "proceedings/iccae/2009/3569/0",
"title": "2009 International Conference on Computer and Automation Engineering. ICCAE 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdma/2010/4286/1/4286a096",
"title": "A Rational Cubic Spline Interpolation and Its Application",
"doi": null,
"abstractUrl": "/proceedings-article/icdma/2010/4286a096/12OmNC3XhqM",
"parentPublication": {
"id": "proceedings/icdma/2010/4286/1",
"title": "2010 International Conference on Digital Manufacturing & Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2011/4501/0/4501b212",
"title": "Cubic C-Bézier Spiral for Two Point Fair Interpolation with Zero Curvature at One End",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2011/4501b212/12OmNCwUmC2",
"parentPublication": {
"id": "proceedings/iccis/2011/4501/0",
"title": "2011 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2006/2746/0/274600011",
"title": "DCT-Based Image Codec Embedded Cubic Spline Interpolation with Optimal Quantization",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2006/274600011/12OmNs0kyBp",
"parentPublication": {
"id": "proceedings/ism/2006/2746/0",
"title": "Eighth IEEE International Symposium on Multimedia (ISM'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2010/4047/3/4047c103",
"title": "On Interpolation by bivariate cubic splines on a rectangular unit with C^2-continuity",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2010/4047c103/12OmNx3q6Ww",
"parentPublication": {
"id": "proceedings/icic/2010/4047/3",
"title": "2010 Third International Conference on Information and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aici/2010/4225/1/4225a103",
"title": "A New Fuzzy Vault Method Using Cubic Spline Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2010/4225a103/12OmNy1SFI4",
"parentPublication": {
"id": "proceedings/aici/2010/4225/1",
"title": "Artificial Intelligence and Computational Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciii/2011/4523/3/4523c087",
"title": "Application Research on Cubic Spline Interpolation Based on Particle Swarm Optimization in Mine Pressure Missing Data",
"doi": null,
"abstractUrl": "/proceedings-article/iciii/2011/4523c087/12OmNyFCw1n",
"parentPublication": {
"id": "proceedings/iciii/2011/4523/3",
"title": "International Conference on Information Management, Innovation Management and Industrial Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2008/3263/0/3263a530",
"title": "A New Kind of Super-Resolution Reconstruction Algorithm Based on the ICM and the Constrained Cubic Spline Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2008/3263a530/12OmNyaoDxB",
"parentPublication": {
"id": "proceedings/snpd/2008/3263/0",
"title": "2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/1999/0185/0/01850188",
"title": "Monotonic Cubic Spline Interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/1999/01850188/12OmNynsbvs",
"parentPublication": {
"id": "proceedings/cgi/1999/0185/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzw8jh3",
"title": "Proceedings. 1988 IEEE International Conference on Robotics and Automation",
"acronym": "robot",
"groupId": "1000639",
"volume": "0",
"displayVolume": "0",
"year": "1988",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNybx22k",
"doi": "10.1109/ROBOT.1988.12024",
"title": "On-line Cartesian path trajectory planning for robot manipulators",
"normalizedTitle": "On-line Cartesian path trajectory planning for robot manipulators",
"abstract": "The authors derive online algorithms that will generate approximate joint paths for any curve in Cartesian space, providing proper knot points are selected. The errors between the desired and approximate paths are required to be within some prescribed tolerance. Two online interpolation schemes, namely simple quartic spline interpolation (SQSI) and modified quartic spline interpolation (MQSI), with quartic spline functions for least-squared error fit, are developed. It is shown that if any curve in Cartesian space is given, the corresponding approximate joint trajectories could be determined in real time. It turns out that MQSI is the better one for tracking the desired path. However, the SQSI algorithm is easier to implement than MQSI. The design of local minimum time trajectories subject to physical constraints is investigated. For the purpose of planning the trajectory in real time, the physical constraints considered are the limits of velocity, acceleration, and jerk of each joint.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "The authors derive online algorithms that will generate approximate joint paths for any curve in Cartesian space, providing proper knot points are selected. The errors between the desired and approximate paths are required to be within some prescribed tolerance. Two online interpolation schemes, namely simple quartic spline interpolation (SQSI) and modified quartic spline interpolation (MQSI), with quartic spline functions for least-squared error fit, are developed. It is shown that if any curve in Cartesian space is given, the corresponding approximate joint trajectories could be determined in real time. It turns out that MQSI is the better one for tracking the desired path. However, the SQSI algorithm is easier to implement than MQSI. The design of local minimum time trajectories subject to physical constraints is investigated. For the purpose of planning the trajectory in real time, the physical constraints considered are the limits of velocity, acceleration, and jerk of each joint.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The authors derive online algorithms that will generate approximate joint paths for any curve in Cartesian space, providing proper knot points are selected. The errors between the desired and approximate paths are required to be within some prescribed tolerance. Two online interpolation schemes, namely simple quartic spline interpolation (SQSI) and modified quartic spline interpolation (MQSI), with quartic spline functions for least-squared error fit, are developed. It is shown that if any curve in Cartesian space is given, the corresponding approximate joint trajectories could be determined in real time. It turns out that MQSI is the better one for tracking the desired path. However, the SQSI algorithm is easier to implement than MQSI. The design of local minimum time trajectories subject to physical constraints is investigated. For the purpose of planning the trajectory in real time, the physical constraints considered are the limits of velocity, acceleration, and jerk of each joint.",
"fno": "00012024",
"keywords": [
"Interpolation",
"Position Control",
"Robots",
"Splines Mathematics",
"Online Cartesian Path Trajectory Planning",
"Robot",
"Manipulators",
"Cartesian Space",
"Online Interpolation",
"Simple Quartic Spline Interpolation",
"Modified Quartic Spline Interpolation",
"Least Squared Error Fit",
"Joint Trajectories",
"Local Minimum Time Trajectories",
"Velocity",
"Acceleration",
"Trajectory",
"Path Planning",
"Manipulators",
"Interpolation",
"Spline",
"Acceleration",
"Robot Kinematics",
"Service Robots",
"Actuators",
"Robot Motion"
],
"authors": [
{
"affiliation": "Chung-Cheng Inst. Tech., Tao-Yung, Taiwan",
"fullName": "Y. Chang",
"givenName": "Y.",
"surname": "Chang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "T. Lee",
"givenName": "T.",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "C. Lui",
"givenName": "C.",
"surname": "Lui",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "robot",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1988-01-01T00:00:00",
"pubType": "proceedings",
"pages": "62,63,64,65,66,67",
"year": "1988",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00012023",
"articleId": "12OmNvT2p6z",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00012025",
"articleId": "12OmNvqW6Uq",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/robot/1988/0852/0/00012307",
"title": "Euler parameters in robot Cartesian control",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1988/00012307/12OmNCcKQKE",
"parentPublication": {
"id": "proceedings/robot/1988/0852/0",
"title": "Proceedings. 1988 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1988/0852/0/00012023",
"title": "Bounded deviation trajectory interpolation for robot manipulators",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1988/00012023/12OmNvT2p6z",
"parentPublication": {
"id": "proceedings/robot/1988/0852/0",
"title": "Proceedings. 1988 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1988/0852/0/00012025",
"title": "Cartesian trajectory planning for 3-DOF spherical wrists",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1988/00012025/12OmNvqW6Uq",
"parentPublication": {
"id": "proceedings/robot/1988/0852/0",
"title": "Proceedings. 1988 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crc/2017/0677/0/0677a012",
"title": "Kinematic Analysis and Trajectory Planning for Serial Robot in Hazardous Biochemical Treatment",
"doi": null,
"abstractUrl": "/proceedings-article/crc/2017/0677a012/12OmNxGAL6D",
"parentPublication": {
"id": "proceedings/crc/2017/0677/0",
"title": "2017 2nd International Conference on Cybernetics, Robotics and Control (CRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssst/1988/0847/0/00017094",
"title": "Minimum-fuel path planning of a 5-link biped robot",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1988/00017094/12OmNy50giG",
"parentPublication": {
"id": "proceedings/ssst/1988/0847/0",
"title": "The Twentieth Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1988/0852/0/00012165",
"title": "Analysis of kinematic singularities for robot manipulators in Cartesian coordinate parameters",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1988/00012165/12OmNz3bdQ9",
"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/00100147",
"title": "Simulation study of PD robot Cartesian control",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1989/00100147/12OmNz6iOjA",
"parentPublication": {
"id": "proceedings/robot/1989/1938/0",
"title": "1989 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icisce/2015/6850/0/6850a824",
"title": "MOPSO Based Multi-objective Trajectory Planning for Robot Manipulators",
"doi": null,
"abstractUrl": "/proceedings-article/icisce/2015/6850a824/12OmNzIUfU0",
"parentPublication": {
"id": "proceedings/icisce/2015/6850/0",
"title": "2015 2nd International Conference on Information Science and Control Engineering (ICISCE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2009/3804/3/3804c411",
"title": "Gait Planning and Simulation of ROBONOVA-1 Robot",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804c411/12OmNzmclkT",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdsba/2020/8164/0/816400a072",
"title": "Kinematics Analysis and Trajectory Planning Simulation of Manipulator Based on AUBO-I5",
"doi": null,
"abstractUrl": "/proceedings-article/icdsba/2020/816400a072/1xeWtLGBXC8",
"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": "12OmNBtl1zJ",
"title": "Proceedings 35th Annual Symposium on Foundations of Computer Science",
"acronym": "focs",
"groupId": "1000292",
"volume": "0",
"displayVolume": "0",
"year": "1994",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqGA52R",
"doi": "10.1109/SFCS.1994.365687",
"title": "Randomness-efficient oblivious sampling",
"normalizedTitle": "Randomness-efficient oblivious sampling",
"abstract": "We introduce a natural notion of obliviousness of a sampling procedure, and construct a randomness-efficient oblivious sampler. Our sampler uses O(l+log /spl delta//sup -1//spl middot/log l) coins to output m=poly(/spl epsiv//sup -1/, log /spl delta//sup -1/, log l) sample points x/sub 1/, ..., x/sub m/, /spl isin/ {0, 1}/sup 1/ such that Pr[|1/m/spl Sigma//sub i=1//sup m/f(x/sub i/)-E[f]|</spl epsiv/]/spl ges/1-/spl delta/ for any function f: {0, 1}/sup 1//spl rarr/[0, 1]. We apply this sampling procedure to reduce the randomness required to halve the number of rounds of interaction in an Arthur Merlin proof system. Given a 2g(n) round AM proof for L in which Arthur sends l(n) coins per round and Merlin responds with a q(n) bit string, we construct a g(n) round AM proof for L in which Arthur sends O(l+(q+log g)/spl middot/log l) coins per round and Merlin responds with a poly(n) bit string.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce a natural notion of obliviousness of a sampling procedure, and construct a randomness-efficient oblivious sampler. Our sampler uses O(l+log /spl delta//sup -1//spl middot/log l) coins to output m=poly(/spl epsiv//sup -1/, log /spl delta//sup -1/, log l) sample points x/sub 1/, ..., x/sub m/, /spl isin/ {0, 1}/sup 1/ such that Pr[|1/m/spl Sigma//sub i=1//sup m/f(x/sub i/)-E[f]|</spl epsiv/]/spl ges/1-/spl delta/ for any function f: {0, 1}/sup 1//spl rarr/[0, 1]. We apply this sampling procedure to reduce the randomness required to halve the number of rounds of interaction in an Arthur Merlin proof system. Given a 2g(n) round AM proof for L in which Arthur sends l(n) coins per round and Merlin responds with a q(n) bit string, we construct a g(n) round AM proof for L in which Arthur sends O(l+(q+log g)/spl middot/log l) coins per round and Merlin responds with a poly(n) bit string.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce a natural notion of obliviousness of a sampling procedure, and construct a randomness-efficient oblivious sampler. Our sampler uses O(l+log /spl delta//sup -1//spl middot/log l) coins to output m=poly(/spl epsiv//sup -1/, log /spl delta//sup -1/, log l) sample points x/sub 1/, ..., x/sub m/, /spl isin/ {0, 1}/sup 1/ such that Pr[|1/m/spl Sigma//sub i=1//sup m/f(x/sub i/)-E[f]|</spl epsiv/]/spl ges/1-/spl delta/ for any function f: {0, 1}/sup 1//spl rarr/[0, 1]. We apply this sampling procedure to reduce the randomness required to halve the number of rounds of interaction in an Arthur Merlin proof system. Given a 2g(n) round AM proof for L in which Arthur sends l(n) coins per round and Merlin responds with a q(n) bit string, we construct a g(n) round AM proof for L in which Arthur sends O(l+(q+log g)/spl middot/log l) coins per round and Merlin responds with a poly(n) bit string.",
"fno": "0365687",
"keywords": [
"Computational Complexity",
"Randomness Efficient Oblivious Sampling",
"Sampling Procedure",
"Randomness Efficient Oblivious Sampler",
"Arthur Merlin Proof System"
],
"authors": [
{
"affiliation": "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",
"fullName": "M. Bellare",
"givenName": "M.",
"surname": "Bellare",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "J. Rompel",
"givenName": "J.",
"surname": "Rompel",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "focs",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1994-11-01T00:00:00",
"pubType": "proceedings",
"pages": "276-287",
"year": "1994",
"issn": null,
"isbn": "0-8186-6580-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "0365686",
"articleId": "12OmNvlPkvI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "0365688",
"articleId": "12OmNyRxFI5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/focs/2000/0850/0/08500399",
"title": "Cache-oblivious B-trees",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2000/08500399/12OmNrkT7PD",
"parentPublication": {
"id": "proceedings/focs/2000/0850/0",
"title": "Proceedings 41st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2000/0850/0/08500259",
"title": "Testing that distributions are close",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2000/08500259/12OmNvT2p82",
"parentPublication": {
"id": "proceedings/focs/2000/0850/0",
"title": "Proceedings 41st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1994/6580/0/0365684",
"title": "Efficient oblivious branching programs for threshold functions",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1994/0365684/12OmNvjQ8Cl",
"parentPublication": {
"id": "proceedings/focs/1994/6580/0",
"title": "Proceedings 35th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hase/2012/4912/0/4912a173",
"title": "Communication Efficient Oblivious Transfer Using Elliptic Curves",
"doi": null,
"abstractUrl": "/proceedings-article/hase/2012/4912a173/12OmNvk7JOW",
"parentPublication": {
"id": "proceedings/hase/2012/4912/0",
"title": "2012 IEEE 14th International Symposium on High-Assurance Systems Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1993/4370/0/0366815",
"title": "The hardness of approximate optima in lattices, codes, and systems of linear equations",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1993/0366815/12OmNx0A7Ji",
"parentPublication": {
"id": "proceedings/focs/1993/4370/0",
"title": "Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1997/8197/0/81970144",
"title": "Pattern matching with swaps",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1997/81970144/12OmNy7h34P",
"parentPublication": {
"id": "proceedings/focs/1997/8197/0",
"title": "Proceedings 38th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1994/6580/0/0365688",
"title": "Computing with very weak random sources",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1994/0365688/12OmNyRxFI5",
"parentPublication": {
"id": "proceedings/focs/1994/6580/0",
"title": "Proceedings 35th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2000/0850/0/08500189",
"title": "Stable distributions, pseudorandom generators, embeddings and data stream computation",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2000/08500189/12OmNzlUKPl",
"parentPublication": {
"id": "proceedings/focs/2000/0850/0",
"title": "Proceedings 41st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1990/2082/0/089577",
"title": "Randomness in interactive proofs",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1990/089577/12OmNzmtWH3",
"parentPublication": {
"id": "proceedings/focs/1990/2082/0",
"title": "Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/spdp/1995/7195/0/71950673",
"title": "An efficient algorithm for k-pairwise node disjoint path problem in hypercubes",
"doi": null,
"abstractUrl": "/proceedings-article/spdp/1995/71950673/12OmNzzfTjE",
"parentPublication": {
"id": "proceedings/spdp/1995/7195/0",
"title": "Parallel and Distributed Processing, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNArbG4h",
"title": "2008 International Conference on Computational Sciences and Its Applications",
"acronym": "iccsa",
"groupId": "1001290",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqzu6We",
"doi": "10.1109/ICCSA.2008.71",
"title": "Functional Decomposition of Symbolic Polynomials",
"normalizedTitle": "Functional Decomposition of Symbolic Polynomials",
"abstract": "Earlier work has presented algorithms to factor and compute GCDs of symbolic Laurent polynomials, that is multivariate polynomials whose exponents are themselves integer-valued polynomials. This article extends the notion of univariate polynomial decomposition to symbolic polynomials and presents an algorithm to compute these decompositions.??For example, the symbolic polynomial Z_$f(X) = 2X^{n^2+n}-4X^{n^2}+2X^{n^2-n}+1$_Z can be decomposed as Z_$f = g \\circ h$_Z where Z_$g(X) = 2X^2+1$_Z and Z_$h(X) =X^{n^2/2 + n/2} - X^{n^2/2 - n/2}$_Z.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Earlier work has presented algorithms to factor and compute GCDs of symbolic Laurent polynomials, that is multivariate polynomials whose exponents are themselves integer-valued polynomials. This article extends the notion of univariate polynomial decomposition to symbolic polynomials and presents an algorithm to compute these decompositions.??For example, the symbolic polynomial $f(X) = 2X^{n^2+n}-4X^{n^2}+2X^{n^2-n}+1$ can be decomposed as $f = g \\circ h$ where $g(X) = 2X^2+1$ and $h(X) =X^{n^2/2 + n/2} - X^{n^2/2 - n/2}$.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Earlier work has presented algorithms to factor and compute GCDs of symbolic Laurent polynomials, that is multivariate polynomials whose exponents are themselves integer-valued polynomials. This article extends the notion of univariate polynomial decomposition to symbolic polynomials and presents an algorithm to compute these decompositions.??For example, the symbolic polynomial - can be decomposed as - where - and -.",
"fno": "3243a353",
"keywords": [
"Symbolic Polynomials",
"Laurent Polynomials",
"Functional Decomposition",
"Polynomial Decomposition"
],
"authors": [
{
"affiliation": null,
"fullName": "Stephen M. Watt",
"givenName": "Stephen M.",
"surname": "Watt",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccsa",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-06-01T00:00:00",
"pubType": "proceedings",
"pages": "353-362",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3243-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3243a342",
"articleId": "12OmNAtst9h",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04561241",
"articleId": "12OmNz5apxn",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ccc/2011/4411/0/4411a086",
"title": "Noisy Interpolation of Sparse Polynomials, and Applications",
"doi": null,
"abstractUrl": "/proceedings-article/ccc/2011/4411a086/12OmNqG0SPR",
"parentPublication": {
"id": "proceedings/ccc/2011/4411/0",
"title": "2011 IEEE 26th Annual Conference on Computational Complexity",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1991/2445/0/0185433",
"title": "An approximation algorithm for the number of zeros or arbitrary polynomials over GF(q)",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1991/0185433/12OmNvDqsOG",
"parentPublication": {
"id": "proceedings/focs/1991/2445/0",
"title": "[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1998/9172/0/91720186",
"title": "Bivariate Polynomial Multiplication",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1998/91720186/12OmNvUaNmp",
"parentPublication": {
"id": "proceedings/focs/1998/9172/0",
"title": "Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1997/8197/0/81970046",
"title": "Deciding properties of polynomials without factoring",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1997/81970046/12OmNwErpuQ",
"parentPublication": {
"id": "proceedings/focs/1997/8197/0",
"title": "Proceedings 38th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icseng/2008/3331/0/3331a356",
"title": "A Graph-Based Approach to Symbolic Functional Decomposition of Finite State Machines",
"doi": null,
"abstractUrl": "/proceedings-article/icseng/2008/3331a356/12OmNyLiuCV",
"parentPublication": {
"id": "proceedings/icseng/2008/3331/0",
"title": "Systems Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mwscas/1998/8914/0/89140114",
"title": "Network Properties of a Pair of Generalized Polynomials",
"doi": null,
"abstractUrl": "/proceedings-article/mwscas/1998/89140114/12OmNyRPgzZ",
"parentPublication": {
"id": "proceedings/mwscas/1998/8914/0",
"title": "Circuits and Systems, Midwest Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1996/7594/0/75940592",
"title": "Approximate checking of polynomials and functional equations",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1996/75940592/12OmNzkuKy8",
"parentPublication": {
"id": "proceedings/focs/1996/7594/0",
"title": "Proceedings of 37th Conference on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2000/05/t0503",
"title": "Mastrovito Multiplier for General Irreducible Polynomials",
"doi": null,
"abstractUrl": "/journal/tc/2000/05/t0503/13rRUNvyajF",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1992/10/t1331",
"title": "Decomposition of Complex Multipliers Using Polynomial Encoding",
"doi": null,
"abstractUrl": "/journal/tc/1992/10/t1331/13rRUxlgy2F",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2022/5519/0/551900a956",
"title": "Polynomial-Time Power-Sum Decomposition of Polynomials",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2022/551900a956/1JtvShI0Nri",
"parentPublication": {
"id": "proceedings/focs/2022/5519/0",
"title": "2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBkfRgB",
"title": "Parallel Processing Symposium, International",
"acronym": "ipps",
"groupId": "1000538",
"volume": "0",
"displayVolume": "0",
"year": "1997",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNroijiP",
"doi": "10.1109/IPPS.1997.580935",
"title": "Parallel Solutions of Indexed Recurrence Equations",
"normalizedTitle": "Parallel Solutions of Indexed Recurrence Equations",
"abstract": "A new type of recurrence equations called \"indexed recurrences\" (IR) is defined, in which the common notion of X[i] = op(X[i],X[i-1]) i=1..n is generalized to X[g(i)] = op(X[f(i)],X[h(i)]) f,g,h:{1..n} -> {1..m}. This enables us to model sequential loops of the form for i = 1 to n do begin X[g(i)] := op(X[f(i)],X[h(i)]); as IR equations.Thus, a parallel algorithm that solves a set of IR equations is in fact a way to transform sequential loops into parallel ones. Note that the circuit evaluation problem (CVP) can also be expressed as a set of IR equations. Therefore an efficient parallel solution to the general IR problem is not likely to be found, as such solution would also solve the CVP, showing that P is a subset of, or equal NC.In this paper we introduce parallel algorithms for two variants of the IR equations problem: 1. An O(log n) greedy algorithm for solving IR equations where g(i) is distinct and h(i) = g(i) using O(n) processors.2. An O(log^2 n) algorithm with no restriction on f,g or h, using up to O(n^2) processors.However, we show that for general IR, 'op' must be commutative so that a parallel computation can be used.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A new type of recurrence equations called \"indexed recurrences\" (IR) is defined, in which the common notion of X[i] = op(X[i],X[i-1]) i=1..n is generalized to X[g(i)] = op(X[f(i)],X[h(i)]) f,g,h:{1..n} -> {1..m}. This enables us to model sequential loops of the form for i = 1 to n do begin X[g(i)] := op(X[f(i)],X[h(i)]); as IR equations.Thus, a parallel algorithm that solves a set of IR equations is in fact a way to transform sequential loops into parallel ones. Note that the circuit evaluation problem (CVP) can also be expressed as a set of IR equations. Therefore an efficient parallel solution to the general IR problem is not likely to be found, as such solution would also solve the CVP, showing that P is a subset of, or equal NC.In this paper we introduce parallel algorithms for two variants of the IR equations problem: 1. An O(log n) greedy algorithm for solving IR equations where g(i) is distinct and h(i) = g(i) using O(n) processors.2. An O(log^2 n) algorithm with no restriction on f,g or h, using up to O(n^2) processors.However, we show that for general IR, 'op' must be commutative so that a parallel computation can be used.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A new type of recurrence equations called \"indexed recurrences\" (IR) is defined, in which the common notion of X[i] = op(X[i],X[i-1]) i=1..n is generalized to X[g(i)] = op(X[f(i)],X[h(i)]) f,g,h:{1..n} -> {1..m}. This enables us to model sequential loops of the form for i = 1 to n do begin X[g(i)] := op(X[f(i)],X[h(i)]); as IR equations.Thus, a parallel algorithm that solves a set of IR equations is in fact a way to transform sequential loops into parallel ones. Note that the circuit evaluation problem (CVP) can also be expressed as a set of IR equations. Therefore an efficient parallel solution to the general IR problem is not likely to be found, as such solution would also solve the CVP, showing that P is a subset of, or equal NC.In this paper we introduce parallel algorithms for two variants of the IR equations problem: 1. An O(log n) greedy algorithm for solving IR equations where g(i) is distinct and h(i) = g(i) using O(n) processors.2. An O(log^2 n) algorithm with no restriction on f,g or h, using up to O(n^2) processors.However, we show that for general IR, 'op' must be commutative so that a parallel computation can be used.",
"fno": "77920413",
"keywords": [],
"authors": [
{
"affiliation": null,
"fullName": "Gadi Haber",
"givenName": "Gadi",
"surname": "Haber",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yosi Ben-Asher",
"givenName": "Yosi",
"surname": "Ben-Asher",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ipps",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1997-04-01T00:00:00",
"pubType": "proceedings",
"pages": "413",
"year": "1997",
"issn": "1063-7133",
"isbn": "0-8186-7792-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "77920407",
"articleId": "12OmNzV70M2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "77920418",
"articleId": "12OmNAoUTof",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAg7k0a",
"title": "2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)",
"acronym": "hotweb",
"groupId": "1002002",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy4r3Nz",
"doi": "10.1109/HotWeb.2015.8",
"title": "Multi-objective Weighted Sampling",
"normalizedTitle": "Multi-objective Weighted Sampling",
"abstract": "Key value data sets of the form {(x, wx)} where wx > 0 are prevalent. Common queries over such data are segment f-statistics Q(f, H) = Sx?H f(wx), specified for a segment H of the keys and a function f. Different choices of f correspond to count, sum, moments, capping, and threshold statistics. When the data set is large, we can compute a smaller sample from which we can quickly estimate statistics. A weighted sample of keys taken with respect to f(wx) provides estimates with statistically guaranteed quality for f-statistics. Such a sample S(f) can be used to estimate g-statistics for g𢘏, but quality degrades with the disparity between g and f. In this paper we address applications that require quality estimates for a set F of different functions. A naive solution is to compute and work with a different sample S(f) for each f?F. Instead, this can be achieved more effectively and seamlessly using a single multi-objective sample S(F) of a much smaller size. We review multi-objective sampling schemes and place them in our context of estimating f-statistics. We show that a multi-objective sample for F provides quality estimates for any f that is a positive linear combination of functions from F. We then establish a surprising and powerful result when the target set M is all monotone non-decreasing functions, noting that M includes most natural statistics. We provide efficient multi-objective sampling algorithms for M and show that a sample size of k ln n (where n is the number of active keys) provides the same estimation quality, for any f?M, as a dedicated weighted sample of size k for f.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Key value data sets of the form {(x, wx)} where wx > 0 are prevalent. Common queries over such data are segment f-statistics Q(f, H) = Sx?H f(wx), specified for a segment H of the keys and a function f. Different choices of f correspond to count, sum, moments, capping, and threshold statistics. When the data set is large, we can compute a smaller sample from which we can quickly estimate statistics. A weighted sample of keys taken with respect to f(wx) provides estimates with statistically guaranteed quality for f-statistics. Such a sample S(f) can be used to estimate g-statistics for g𢘏, but quality degrades with the disparity between g and f. In this paper we address applications that require quality estimates for a set F of different functions. A naive solution is to compute and work with a different sample S(f) for each f?F. Instead, this can be achieved more effectively and seamlessly using a single multi-objective sample S(F) of a much smaller size. We review multi-objective sampling schemes and place them in our context of estimating f-statistics. We show that a multi-objective sample for F provides quality estimates for any f that is a positive linear combination of functions from F. We then establish a surprising and powerful result when the target set M is all monotone non-decreasing functions, noting that M includes most natural statistics. We provide efficient multi-objective sampling algorithms for M and show that a sample size of k ln n (where n is the number of active keys) provides the same estimation quality, for any f?M, as a dedicated weighted sample of size k for f.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Key value data sets of the form {(x, wx)} where wx > 0 are prevalent. Common queries over such data are segment f-statistics Q(f, H) = Sx?H f(wx), specified for a segment H of the keys and a function f. Different choices of f correspond to count, sum, moments, capping, and threshold statistics. When the data set is large, we can compute a smaller sample from which we can quickly estimate statistics. A weighted sample of keys taken with respect to f(wx) provides estimates with statistically guaranteed quality for f-statistics. Such a sample S(f) can be used to estimate g-statistics for g𢘏, but quality degrades with the disparity between g and f. In this paper we address applications that require quality estimates for a set F of different functions. A naive solution is to compute and work with a different sample S(f) for each f?F. Instead, this can be achieved more effectively and seamlessly using a single multi-objective sample S(F) of a much smaller size. We review multi-objective sampling schemes and place them in our context of estimating f-statistics. We show that a multi-objective sample for F provides quality estimates for any f that is a positive linear combination of functions from F. We then establish a surprising and powerful result when the target set M is all monotone non-decreasing functions, noting that M includes most natural statistics. We provide efficient multi-objective sampling algorithms for M and show that a sample size of k ln n (where n is the number of active keys) provides the same estimation quality, for any f?M, as a dedicated weighted sample of size k for f.",
"fno": "9688a013",
"keywords": [
"Estimation",
"Probability",
"Standards",
"Context",
"Distributed Databases",
"Upper Bound",
"Conferences",
"Universal Capping Sample",
"Weighted Sampling",
"Universal Monotone Sample"
],
"authors": [
{
"affiliation": null,
"fullName": "Edith Cohen",
"givenName": "Edith",
"surname": "Cohen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "hotweb",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-11-01T00:00:00",
"pubType": "proceedings",
"pages": "13-18",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-9688-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "9688a007",
"articleId": "12OmNBcj5DB",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "9688a019",
"articleId": "12OmNqBKTNM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sct/1992/2955/0/00215402",
"title": "Non-deterministic communication complexity with few witnesses",
"doi": null,
"abstractUrl": "/proceedings-article/sct/1992/00215402/12OmNBv2CiC",
"parentPublication": {
"id": "proceedings/sct/1992/2955/0",
"title": "1992 Seventh Annual Structure in Complexity Theory Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1994/6580/0/0365687",
"title": "Randomness-efficient oblivious sampling",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1994/0365687/12OmNqGA52R",
"parentPublication": {
"id": "proceedings/focs/1994/6580/0",
"title": "Proceedings 35th Annual Symposium on Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismvl/2017/5496/0/07964997",
"title": "Centralizing Monoids and the Arity of Witnesses",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/2017/07964997/12OmNy68EDr",
"parentPublication": {
"id": "proceedings/ismvl/2017/5496/0",
"title": "2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2014/5666/0/07004208",
"title": "Scaling up M-estimation via sampling designs: The Horvitz-Thompson stochastic gradient descent",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2014/07004208/12OmNyKa632",
"parentPublication": {
"id": "proceedings/big-data/2014/5666/0",
"title": "2014 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1995/7183/0/71830432",
"title": "Linearity testing in characteristic two",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1995/71830432/12OmNyaGeHa",
"parentPublication": {
"id": "proceedings/focs/1995/7183/0",
"title": "Proceedings of IEEE 36th Annual Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2017/3464/0/3464a633",
"title": "Optimality of the Johnson-Lindenstrauss Lemma",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2017/3464a633/12OmNzE54JS",
"parentPublication": {
"id": "proceedings/focs/2017/3464/0",
"title": "2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/2013/12/ttd2013122418",
"title": "Multicast Scaling Law in Multichannel Multiradio Wireless Networks",
"doi": null,
"abstractUrl": "/journal/td/2013/12/ttd2013122418/13rRUyfKIHp",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2018/3788/0/08546186",
"title": "Effects of sampling skewness of the importance-weighted risk estimator on model selection",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2018/08546186/17D45XcttmZ",
"parentPublication": {
"id": "proceedings/icpr/2018/3788/0",
"title": "2018 24th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2022/2055/0/205500a759",
"title": "Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2022/205500a759/1BtfyuOxTjO",
"parentPublication": {
"id": "proceedings/focs/2022/2055/0",
"title": "2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/2020/9621/0/962100a240",
"title": "A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract",
"doi": null,
"abstractUrl": "/proceedings-article/focs/2020/962100a240/1qyxwY9ijba",
"parentPublication": {
"id": "proceedings/focs/2020/9621/0",
"title": "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxuXcCO",
"title": "Advanced Research in VLSI, Conference on",
"acronym": "arvlsid",
"groupId": "1000015",
"volume": "0",
"displayVolume": "0",
"year": "1995",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyuya6z",
"doi": "10.1109/ARVLSI.1995.515632",
"title": "Quasi-algebraic decompositions of switching functions",
"normalizedTitle": "Quasi-algebraic decompositions of switching functions",
"abstract": "Brayton (1982-90) and others have developed a rich theory of decomposition of switching functions based on algebraic manipulations of monomials. In this theory, a product g(X/sub g/)/spl middot/h(X/sub h/) is algebraic if X/sub g//spl cap/X/sub h/=O. There are efficient methods for determining if a function has an algebraic product. If a function does not have an algebraic product, then there are good methods for obtaining a decomposition of the form f=g/spl middot/h+r where g/spl middot/h is an algebraic product. Algebraic decompositions have the desirable properties that they are canonical and preserve testability. In this paper we generalize the concept of an algebraic product to decompositions of the form f(X)=g(X/sub g/)??h(X/sub h/) where ?? is any binary Boolean operation and |X/sub g//spl cap/X/sub h/|=k for some k/spl ges/0. We call these decompositions quasi-algebraic decompositions. We begin by showing that we may restrict ourselves to the case where ?? is +(sum),/spl middot/(product) or /spl oplus/ (enclusive-or). We then give necessary and sufficient conditions for a function to have a quasi-algebraic decomposition for a given X/sub g/ and X/sub h/. If a function has such a decomposition we show how to determine the functions g and h in a canonical manner. We also show that these decompositions are fully SSL testable. Finally, using standard benchmark circuits, we show that quasi algebraic decompositions occur often and are useful in reducing circuit size.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Brayton (1982-90) and others have developed a rich theory of decomposition of switching functions based on algebraic manipulations of monomials. In this theory, a product g(X/sub g/)/spl middot/h(X/sub h/) is algebraic if X/sub g//spl cap/X/sub h/=O. There are efficient methods for determining if a function has an algebraic product. If a function does not have an algebraic product, then there are good methods for obtaining a decomposition of the form f=g/spl middot/h+r where g/spl middot/h is an algebraic product. Algebraic decompositions have the desirable properties that they are canonical and preserve testability. In this paper we generalize the concept of an algebraic product to decompositions of the form f(X)=g(X/sub g/)??h(X/sub h/) where ?? is any binary Boolean operation and |X/sub g//spl cap/X/sub h/|=k for some k/spl ges/0. We call these decompositions quasi-algebraic decompositions. We begin by showing that we may restrict ourselves to the case where ?? is +(sum),/spl middot/(product) or /spl oplus/ (enclusive-or). We then give necessary and sufficient conditions for a function to have a quasi-algebraic decomposition for a given X/sub g/ and X/sub h/. If a function has such a decomposition we show how to determine the functions g and h in a canonical manner. We also show that these decompositions are fully SSL testable. Finally, using standard benchmark circuits, we show that quasi algebraic decompositions occur often and are useful in reducing circuit size.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Brayton (1982-90) and others have developed a rich theory of decomposition of switching functions based on algebraic manipulations of monomials. In this theory, a product g(X/sub g/)/spl middot/h(X/sub h/) is algebraic if X/sub g//spl cap/X/sub h/=O. There are efficient methods for determining if a function has an algebraic product. If a function does not have an algebraic product, then there are good methods for obtaining a decomposition of the form f=g/spl middot/h+r where g/spl middot/h is an algebraic product. Algebraic decompositions have the desirable properties that they are canonical and preserve testability. In this paper we generalize the concept of an algebraic product to decompositions of the form f(X)=g(X/sub g/)??h(X/sub h/) where ?? is any binary Boolean operation and |X/sub g//spl cap/X/sub h/|=k for some k/spl ges/0. We call these decompositions quasi-algebraic decompositions. We begin by showing that we may restrict ourselves to the case where ?? is +(sum),/spl middot/(product) or /spl oplus/ (enclusive-or). We then give necessary and sufficient conditions for a function to have a quasi-algebraic decomposition for a given X/sub g/ and X/sub h/. If a function has such a decomposition we show how to determine the functions g and h in a canonical manner. We also show that these decompositions are fully SSL testable. Finally, using standard benchmark circuits, we show that quasi algebraic decompositions occur often and are useful in reducing circuit size.",
"fno": "70470358",
"keywords": [
"Switching Functions Logic Testing State Assignment Minimisation Of Switching Nets Quasi Algebraic Decompositions Switching Functions Algebraic Product Testability Binary Boolean Operation Canonical Manner SSL Testable Circuit Size Benchmark Circuits"
],
"authors": [
{
"affiliation": "Dept. of Electr. Eng., Washington Univ., USA",
"fullName": "T. Stanion",
"givenName": "T.",
"surname": "Stanion",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electr. Eng., Washington Univ., USA",
"fullName": "C. Sechen",
"givenName": "C.",
"surname": "Sechen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "arvlsid",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1995-03-01T00:00:00",
"pubType": "proceedings",
"pages": "358",
"year": "1995",
"issn": null,
"isbn": "0-8186-7047-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "70470342",
"articleId": "12OmNwwuDZK",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "70470368",
"articleId": "12OmNqGA5fT",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzX6cem",
"title": "2018 10th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"acronym": "icmtma",
"groupId": "1002837",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzA6GKY",
"doi": "10.1109/ICMTMA.2018.00094",
"title": "Point Sets and Periodic Shadowing Property of Topological G-Conjugacy on Metric G-Space",
"normalizedTitle": "Point Sets and Periodic Shadowing Property of Topological G-Conjugacy on Metric G-Space",
"abstract": "The topological G -conjugacy map has an important significance in terms of theory and application. In this paper, we study recurrent point, non-wandering point and periodic shadowing property of topological G -conjugacy on metric G -space. By means of properties of topological G -conjugacy map and by inference, we will give the following conclusions that if Let f: X → X and t: Y → Y be two continuous map of metric G-space X and Y. Suppose the map h: X → Y is a topogical G -conjugacy from f to t and x2 X, then(1)The point x is a G - recurrent point of f if and only if the point h(x) is a G -recurrent point of t. (2)The point x is a G -nonwandering point of f if and only if the point h(x) is a G -nonwandering point of t. (3) The map f has the G -periodic shadowing property if and only if the map t has the G -periodic shadowing property. These results will enrich the theory of the recurrent point, non-wandering point and periodic shadowing property of topological G -conjugacy on metric G-space.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The topological G -conjugacy map has an important significance in terms of theory and application. In this paper, we study recurrent point, non-wandering point and periodic shadowing property of topological G -conjugacy on metric G -space. By means of properties of topological G -conjugacy map and by inference, we will give the following conclusions that if Let f: X → X and t: Y → Y be two continuous map of metric G-space X and Y. Suppose the map h: X → Y is a topogical G -conjugacy from f to t and x2 X, then(1)The point x is a G - recurrent point of f if and only if the point h(x) is a G -recurrent point of t. (2)The point x is a G -nonwandering point of f if and only if the point h(x) is a G -nonwandering point of t. (3) The map f has the G -periodic shadowing property if and only if the map t has the G -periodic shadowing property. These results will enrich the theory of the recurrent point, non-wandering point and periodic shadowing property of topological G -conjugacy on metric G-space.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The topological G -conjugacy map has an important significance in terms of theory and application. In this paper, we study recurrent point, non-wandering point and periodic shadowing property of topological G -conjugacy on metric G -space. By means of properties of topological G -conjugacy map and by inference, we will give the following conclusions that if Let f: X → X and t: Y → Y be two continuous map of metric G-space X and Y. Suppose the map h: X → Y is a topogical G -conjugacy from f to t and x2 X, then(1)The point x is a G - recurrent point of f if and only if the point h(x) is a G -recurrent point of t. (2)The point x is a G -nonwandering point of f if and only if the point h(x) is a G -nonwandering point of t. (3) The map f has the G -periodic shadowing property if and only if the map t has the G -periodic shadowing property. These results will enrich the theory of the recurrent point, non-wandering point and periodic shadowing property of topological G -conjugacy on metric G-space.",
"fno": "511401a362",
"keywords": [
"Set Theory",
"Topology",
"Metric G Space",
"Point Sets",
"Topological G Conjugacy",
"G Periodic Shadowing Property",
"G Conjugacy Map",
"G Nonwandering Point",
"G Recurrent Point",
"Shadow Mapping",
"Extraterrestrial Measurements",
"Orbits",
"Mechatronics",
"Automation",
"Complex Systems",
"Topological G Conjugacy",
"G Periodic Shadowing Property",
"G Space",
"G Recurrent Point",
"G Nonwandering Point"
],
"authors": [
{
"affiliation": null,
"fullName": "Zhan-Jiang Ji",
"givenName": "Zhan-Jiang",
"surname": "Ji",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Cong Zhai",
"givenName": "Cong",
"surname": "Zhai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Chun-ru Zhao",
"givenName": "Chun-ru",
"surname": "Zhao",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icmtma",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-02-01T00:00:00",
"pubType": "proceedings",
"pages": "362-365",
"year": "2018",
"issn": "2157-1481",
"isbn": "978-1-5386-5114-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "511401a358",
"articleId": "12OmNx9nGDR",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "511401a366",
"articleId": "12OmNvSKNTs",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icmtma/2018/5114/0/511401a092",
"title": "Various Shadowing Property of Product Map",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2018/511401a092/12OmNzdoMNu",
"parentPublication": {
"id": "proceedings/icmtma/2018/5114/0",
"title": "2018 10th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsgea/2018/6953/0/695301a237",
"title": "The Research of G- expansive Map and Devaney’s G-Chaos Condition on Metric G-Space",
"doi": null,
"abstractUrl": "/proceedings-article/icsgea/2018/695301a237/17D45WK5AoM",
"parentPublication": {
"id": "proceedings/icsgea/2018/6953/0",
"title": "2018 International Conference on Smart Grid and Electrical Automation (ICSGEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvris/2019/5050/0/505000a282",
"title": "G-Strong Chain Recurrent Point and G-Chain Equivalent Point of Topological G-Conjugacy on Metric G-Space",
"doi": null,
"abstractUrl": "/proceedings-article/icvris/2019/505000a282/1fHkbt7xm4E",
"parentPublication": {
"id": "proceedings/icvris/2019/5050/0",
"title": "2019 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2021/04/08936545",
"title": "Spatio-Temporal Correlation of Interference in MANET Under Spatially Correlated Shadowing Environment",
"doi": null,
"abstractUrl": "/journal/tm/2021/04/08936545/1fRz3n0Ff6U",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mascots/2019/4950/0/495000a221",
"title": "Effect of Shadowing on Energy Efficiency in Small Cellular Networks",
"doi": null,
"abstractUrl": "/proceedings-article/mascots/2019/495000a221/1gFJterN2bC",
"parentPublication": {
"id": "proceedings/mascots/2019/4950/0",
"title": "2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2020/7081/0/708100a971",
"title": "The Research of G-Mixing and G-Equicontinuity on the Hyperspace of Topological Group Action",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2020/708100a971/1iEREfH5s1G",
"parentPublication": {
"id": "proceedings/icmtma/2020/7081/0",
"title": "2020 12th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2020/7081/0/708100a672",
"title": "The Research of G-Chain Transitive and G-Chain Mixing on the Hyperspace of Topological Group Action",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2020/708100a672/1iERGEzYLZK",
"parentPublication": {
"id": "proceedings/icmtma/2020/7081/0",
"title": "2020 12th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2020/7081/0/708100b165",
"title": "The Research of the Expansion Property and Chain Mixing Property of Topological Group",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2020/708100b165/1iERNiSUoXS",
"parentPublication": {
"id": "proceedings/icmtma/2020/7081/0",
"title": "2020 12th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2021/3892/0/389200a881",
"title": "The dynamical properties of regularly recurrent point set",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2021/389200a881/1t2nd5D7qdq",
"parentPublication": {
"id": "proceedings/icmtma/2021/3892/0",
"title": "2021 13th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2023/04/09552579",
"title": "Interference Analysis in Non-Poisson Networks Under Spatially Correlated Shadowing",
"doi": null,
"abstractUrl": "/journal/tm/2023/04/09552579/1xibVqvObJe",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKiqp",
"title": "2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)",
"acronym": "synasc",
"groupId": "1001577",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45WK5Aqk",
"doi": "10.1109/SYNASC.2017.00019",
"title": "Simple Relation between the Lowest-Order Element of Ideal 〈G,H〉 and the Last Element of Polynomial Remainder Sequence",
"normalizedTitle": "Simple Relation between the Lowest-Order Element of Ideal 〈G,H〉 and the Last Element of Polynomial Remainder Sequence",
"abstract": "Let G and H be relatively prime polynomials in K[x,u], where K is a number field and (u) = (u1, . . . , uℓ), with ℓ ≥ 2. Let GB(G,H) be the reduced Gröbner basis of ideal hG,Hi, w.r.t. the elimination order for x. Let r̂ be the lowest-order element of GB(G,H), and Ã, B ∈ K[x,u] be the cofactors of r̂: ÃG+ e BH = r̂. Let PRS(G,H) be the polynomial remainder sequence w.r.t. x, with initial polynomials G and H. Let Pk ∈ K[u] be the last element of PRS(G,H), and Ak,Bk ∈ K[x,u] be cofactors of Pk: AkG + BkH = Pk. Ak and Bk satisfy degree conditions: degx(Ak) <; degx(H) and degx(Bk) <; degx(G), while e à and B in general do not. Computing  and B by reducing the degrees w.r.t. x, of à and B, respectively, and by normalizing Pk suitably, we show that (Pk,Ak,Bk) = c ( r̂, Â, B), where (P,A,B) denotes a tuple and c ∈ K. We then present a new method for solving the multivariate Diophantine equation φ G + ψH = F for given F ∈ K[x,u] and unknowns φ , ψ ∈ K(u)[x]. Furthermore, we show a new method for solving the ideal-membership problem for 〈G,H〉, without computing any Gröbner basis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Let G and H be relatively prime polynomials in K[x,u], where K is a number field and (u) = (u1, . . . , uℓ), with ℓ ≥ 2. Let GB(G,H) be the reduced Gröbner basis of ideal hG,Hi, w.r.t. the elimination order for x. Let r̂ be the lowest-order element of GB(G,H), and Ã, B ∈ K[x,u] be the cofactors of r̂: ÃG+ e BH = r̂. Let PRS(G,H) be the polynomial remainder sequence w.r.t. x, with initial polynomials G and H. Let Pk ∈ K[u] be the last element of PRS(G,H), and Ak,Bk ∈ K[x,u] be cofactors of Pk: AkG + BkH = Pk. Ak and Bk satisfy degree conditions: degx(Ak) <; degx(H) and degx(Bk) <; degx(G), while e à and B in general do not. Computing  and B by reducing the degrees w.r.t. x, of à and B, respectively, and by normalizing Pk suitably, we show that (Pk,Ak,Bk) = c ( r̂, Â, B), where (P,A,B) denotes a tuple and c ∈ K. We then present a new method for solving the multivariate Diophantine equation φ G + ψH = F for given F ∈ K[x,u] and unknowns φ , ψ ∈ K(u)[x]. Furthermore, we show a new method for solving the ideal-membership problem for 〈G,H〉, without computing any Gröbner basis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Let G and H be relatively prime polynomials in K[x,u], where K is a number field and (u) = (u1, . . . , uℓ), with ℓ ≥ 2. Let GB(G,H) be the reduced Gröbner basis of ideal hG,Hi, w.r.t. the elimination order for x. Let r̂ be the lowest-order element of GB(G,H), and Ã, B ∈ K[x,u] be the cofactors of r̂: ÃG+ e BH = r̂. Let PRS(G,H) be the polynomial remainder sequence w.r.t. x, with initial polynomials G and H. Let Pk ∈ K[u] be the last element of PRS(G,H), and Ak,Bk ∈ K[x,u] be cofactors of Pk: AkG + BkH = Pk. Ak and Bk satisfy degree conditions: degx(Ak) <; degx(H) and degx(Bk) <; degx(G), while e à and B in general do not. Computing  and B by reducing the degrees w.r.t. x, of à and B, respectively, and by normalizing Pk suitably, we show that (Pk,Ak,Bk) = c ( r̂, Â, B), where (P,A,B) denotes a tuple and c ∈ K. We then present a new method for solving the multivariate Diophantine equation φ G + ψH = F for given F ∈ K[x,u] and unknowns φ , ψ ∈ K(u)[x]. Furthermore, we show a new method for solving the ideal-membership problem for 〈G,H〉, without computing any Gröbner basis.",
"fno": "262600a055",
"keywords": [
"Polynomials",
"Set Theory",
"Lowest Order Element",
"Polynomial Remainder Sequence",
"Reduced Grobner Basis",
"Elimination Order",
"Ideal Membership Problem",
"Prime Polynomials",
"Multivariate Diophantine Equation",
"Scientific Computing",
"Algebra",
"Mathematical Model",
"Complexity Theory",
"Computational Modeling",
"Analytical Models",
"Elimination Ideal Of Ideal 〈G H〉",
"Cofactors Of A Polynomial In 〈G H〉",
"Lowest Order Element Of Groebner Basis",
"Last Element Of Polynomial Remainder Sequence",
"Multivariate Sparse Polynomial"
],
"authors": [
{
"affiliation": null,
"fullName": "Tateaki Sasaki",
"givenName": "Tateaki",
"surname": "Sasaki",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Daiju Inaba",
"givenName": "Daiju",
"surname": "Inaba",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "synasc",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-09-01T00:00:00",
"pubType": "proceedings",
"pages": "55-62",
"year": "2017",
"issn": null,
"isbn": "978-1-5386-2626-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "262600a049",
"articleId": "17D45WHONhJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "262600a063",
"articleId": "17D45Xcttkv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"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/2012/4708/0/4708a085",
"title": "Testing List H-homomorphisms",
"doi": null,
"abstractUrl": "/proceedings-article/ccc/2012/4708a085/12OmNwKoZke",
"parentPublication": {
"id": "proceedings/ccc/2012/4708/0",
"title": "2012 IEEE 27th Conference on Computational Complexity",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ccc/2002/1468/0/14680029",
"title": "Resolution Lower Bounds for Perfect Matching Principles",
"doi": null,
"abstractUrl": "/proceedings-article/ccc/2002/14680029/12OmNwsNR8K",
"parentPublication": {
"id": "proceedings/ccc/2002/1468/0",
"title": "Proceedings 17th IEEE Annual Conference on Computational Complexity",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eidwt/2013/2141/0/5044a145",
"title": "Superconvergence of Discontinuous Finite Element Method for Delay-Differential Equations",
"doi": null,
"abstractUrl": "/proceedings-article/eidwt/2013/5044a145/12OmNyYm2pj",
"parentPublication": {
"id": "proceedings/eidwt/2013/2141/0",
"title": "2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1995/7183/0/71830432",
"title": "Linearity testing in characteristic two",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1995/71830432/12OmNyaGeHa",
"parentPublication": {
"id": "proceedings/focs/1995/7183/0",
"title": "Proceedings of IEEE 36th Annual Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/lics/2015/8875/0/8875a689",
"title": "Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth",
"doi": null,
"abstractUrl": "/proceedings-article/lics/2015/8875a689/12OmNyeWdNc",
"parentPublication": {
"id": "proceedings/lics/2015/8875/0",
"title": "2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/2016/02/07100870",
"title": "A Chinese Remainder Theorem Approach to Bit-Parallel Z_$GF(2^{n})$_Z Polynomial Basis Multipliers for Irreducible Trinomials",
"doi": null,
"abstractUrl": "/journal/tc/2016/02/07100870/13rRUy2YLXI",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsgea/2018/6953/0/695301a237",
"title": "The Research of G- expansive Map and Devaney’s G-Chaos Condition on Metric G-Space",
"doi": null,
"abstractUrl": "/proceedings-article/icsgea/2018/695301a237/17D45WK5AoM",
"parentPublication": {
"id": "proceedings/icsgea/2018/6953/0",
"title": "2018 International Conference on Smart Grid and Electrical Automation (ICSGEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cyberc/2018/0974/0/097400a393",
"title": "The Rainbow Restrained Domination in Torus Network",
"doi": null,
"abstractUrl": "/proceedings-article/cyberc/2018/097400a393/17QjJfqxwoX",
"parentPublication": {
"id": "proceedings/cyberc/2018/0974/0",
"title": "2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2018/0625/0/062500a037",
"title": "Computing the Lowest-Order Element of a Multivariate Elimination Ideal by Using Remainder Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2018/062500a037/1bhJwtO0l2M",
"parentPublication": {
"id": "proceedings/synasc/2018/0625/0",
"title": "2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1cI6k6ngNoY",
"title": "2019 International Conference on Robots & Intelligent System (ICRIS)",
"acronym": "icris",
"groupId": "1816104",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1cI6nqyip6o",
"doi": "10.1109/ICRIS.2019.00108",
"title": "Devaney Chaos And Expansive Map On The Hyperspace Of Topological Group Action",
"normalizedTitle": "Devaney Chaos And Expansive Map On The Hyperspace Of Topological Group Action",
"abstract": "Devaney chaos and expansive map have an important significance in terms of theory and application. According to the definition of Devaney chaos and expansive map , we give the concept of G-Devaney Chaos and G-expansive map in this paper. By inference, some conclusions of the hyperspace were extended to the hyperspace of topological group action. We have the following result: 1) Let (K, H, f̅, G) be the hyperspace of (X, d, G, f̅,) . If f̅ is a G-expansive map, then f is a G- expansive map; 2) Let (K, H, f̅, G) be the hyperspace of (X, d, G, f) and f : X → X be a equivariant map. All closed set are invariable for G. Then the following conditions are equivalent under the topology of W. (1) f̅ satisfies G Devaney chaos the first condition and the second condition; (2) f̅ is an GHY map; (3) f is an G-HY map. These results enriched the theory of the G-Devaney chaos and G-expansive map on the hyperspace of topological group action.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Devaney chaos and expansive map have an important significance in terms of theory and application. According to the definition of Devaney chaos and expansive map , we give the concept of G-Devaney Chaos and G-expansive map in this paper. By inference, some conclusions of the hyperspace were extended to the hyperspace of topological group action. We have the following result: 1) Let (K, H, f̅, G) be the hyperspace of (X, d, G, f̅,) . If f̅ is a G-expansive map, then f is a G- expansive map; 2) Let (K, H, f̅, G) be the hyperspace of (X, d, G, f) and f : X → X be a equivariant map. All closed set are invariable for G. Then the following conditions are equivalent under the topology of W. (1) f̅ satisfies G Devaney chaos the first condition and the second condition; (2) f̅ is an GHY map; (3) f is an G-HY map. These results enriched the theory of the G-Devaney chaos and G-expansive map on the hyperspace of topological group action.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Devaney chaos and expansive map have an important significance in terms of theory and application. According to the definition of Devaney chaos and expansive map , we give the concept of G-Devaney Chaos and G-expansive map in this paper. By inference, some conclusions of the hyperspace were extended to the hyperspace of topological group action. We have the following result: 1) Let (K, H, f̅, G) be the hyperspace of (X, d, G, f̅,) . If f̅ is a G-expansive map, then f is a G- expansive map; 2) Let (K, H, f̅, G) be the hyperspace of (X, d, G, f) and f : X → X be a equivariant map. All closed set are invariable for G. Then the following conditions are equivalent under the topology of W. (1) f̅ satisfies G Devaney chaos the first condition and the second condition; (2) f̅ is an GHY map; (3) f is an G-HY map. These results enriched the theory of the G-Devaney chaos and G-expansive map on the hyperspace of topological group action.",
"fno": "263200a409",
"keywords": [
"Chaos",
"Group Theory",
"Set Theory",
"Topology",
"Hyperspace",
"Topological Group Action",
"G Expansive Map",
"Equivariant Map",
"GHY Map",
"G HY Map",
"G Devaney Chaos",
"Robots",
"Intelligent Systems",
"G Expansive Map",
"G Devaney Chaos",
"Hyperspace",
"Topological Group"
],
"authors": [
{
"affiliation": "Wuzhou University",
"fullName": "Ji Zhan-jiang",
"givenName": "Ji",
"surname": "Zhan-jiang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icris",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-06-01T00:00:00",
"pubType": "proceedings",
"pages": "409-412",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-2632-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "263200a405",
"articleId": "1cI6pNRxIkg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "263200a413",
"articleId": "1cI6kYHKBYA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ssst/1990/2038/0/00138190",
"title": "The concept of hyperspace in dynamical system theory",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1990/00138190/12OmNCga1SY",
"parentPublication": {
"id": "proceedings/ssst/1990/2038/0",
"title": "Proceedings The Twenty-Second Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2009/3804/4/3804e542",
"title": "Iterative Scheme for Non-Expansive Semigroups in Hilbert Space",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804e542/12OmNyY4ri1",
"parentPublication": {
"id": "proceedings/icicta/2009/3804/4",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2018/5114/0/511401a092",
"title": "Various Shadowing Property of Product Map",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2018/511401a092/12OmNzdoMNu",
"parentPublication": {
"id": "proceedings/icmtma/2018/5114/0",
"title": "2018 10th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsgea/2018/6953/0/695301a237",
"title": "The Research of G- expansive Map and Devaney’s G-Chaos Condition on Metric G-Space",
"doi": null,
"abstractUrl": "/proceedings-article/icsgea/2018/695301a237/17D45WK5AoM",
"parentPublication": {
"id": "proceedings/icsgea/2018/6953/0",
"title": "2018 International Conference on Smart Grid and Electrical Automation (ICSGEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icscse/2018/1366/0/08705567",
"title": "Retracted: Chain Recurrent Point and Devaney Chaos of Topological Groups",
"doi": null,
"abstractUrl": "/proceedings-article/icscse/2018/08705567/19RSehsV4vm",
"parentPublication": {
"id": "proceedings/icscse/2018/1366/0",
"title": "2018 3rd International Conference on Smart City and Systems Engineering (ICSCSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvris/2019/5050/0/505000a282",
"title": "G-Strong Chain Recurrent Point and G-Chain Equivalent Point of Topological G-Conjugacy on Metric G-Space",
"doi": null,
"abstractUrl": "/proceedings-article/icvris/2019/505000a282/1fHkbt7xm4E",
"parentPublication": {
"id": "proceedings/icvris/2019/5050/0",
"title": "2019 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2020/7081/0/708100a971",
"title": "The Research of G-Mixing and G-Equicontinuity on the Hyperspace of Topological Group Action",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2020/708100a971/1iEREfH5s1G",
"parentPublication": {
"id": "proceedings/icmtma/2020/7081/0",
"title": "2020 12th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2020/7081/0/708100a672",
"title": "The Research of G-Chain Transitive and G-Chain Mixing on the Hyperspace of Topological Group Action",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2020/708100a672/1iERGEzYLZK",
"parentPublication": {
"id": "proceedings/icmtma/2020/7081/0",
"title": "2020 12th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2020/7081/0/708100b165",
"title": "The Research of the Expansion Property and Chain Mixing Property of Topological Group",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2020/708100b165/1iERNiSUoXS",
"parentPublication": {
"id": "proceedings/icmtma/2020/7081/0",
"title": "2020 12th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvris/2020/9636/0/963600b152",
"title": "The Research of the Accessibility and Transitivity of Topological Group",
"doi": null,
"abstractUrl": "/proceedings-article/icvris/2020/963600b152/1x4ZcZFyV7a",
"parentPublication": {
"id": "proceedings/icvris/2020/9636/0",
"title": "2020 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1fHk5ECoXSw",
"title": "2019 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)",
"acronym": "icvris",
"groupId": "1828444",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1fHkbt7xm4E",
"doi": "10.1109/ICVRIS.2019.00075",
"title": "G-Strong Chain Recurrent Point and G-Chain Equivalent Point of Topological G-Conjugacy on Metric G-Space",
"normalizedTitle": "G-Strong Chain Recurrent Point and G-Chain Equivalent Point of Topological G-Conjugacy on Metric G-Space",
"abstract": "In this paper,we study the dynamical properties of Cstrong chain recurrent point, C-chain point set and C-chain equivalent point of topological C-conjugacy on metric Cspace. By inference, we give the following conclusions that if let f<sub>1</sub> : X → X and f<sub>2</sub> : Y → X be two continous map of metric C-space X and Y . Suppose the map h : X→ Y is a topogical C-conjugacy from f<sub>1</sub> to f<sub>2</sub> , then(1) h(SCR<sub>G</sub> (f<sub>1</sub> ))=SCR<sub>G</sub> (f<sub>2</sub>) ; (2) h(S<sub>G</sub> (x, f<sub>1</sub> )) = S<sub>G</sub>(h(x),f<sub>2</sub>;(3)h(CE<sub>G</sub>(x,f<sub>1</sub>=CE<sub>G</sub>(h(x),f<sub>2</sub>). These results will enrich the theory of C-strong chain recurrent point, C-chain point and C-chain equivalent point of topological C-conjugacy on metric C-space.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper,we study the dynamical properties of Cstrong chain recurrent point, C-chain point set and C-chain equivalent point of topological C-conjugacy on metric Cspace. By inference, we give the following conclusions that if let f<sub>1</sub> : X → X and f<sub>2</sub> : Y → X be two continous map of metric C-space X and Y . Suppose the map h : X→ Y is a topogical C-conjugacy from f<sub>1</sub> to f<sub>2</sub> , then(1) h(SCR<sub>G</sub> (f<sub>1</sub> ))=SCR<sub>G</sub> (f<sub>2</sub>) ; (2) h(S<sub>G</sub> (x, f<sub>1</sub> )) = S<sub>G</sub>(h(x),f<sub>2</sub>;(3)h(CE<sub>G</sub>(x,f<sub>1</sub>=CE<sub>G</sub>(h(x),f<sub>2</sub>). These results will enrich the theory of C-strong chain recurrent point, C-chain point and C-chain equivalent point of topological C-conjugacy on metric C-space.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper,we study the dynamical properties of Cstrong chain recurrent point, C-chain point set and C-chain equivalent point of topological C-conjugacy on metric Cspace. By inference, we give the following conclusions that if let f1 : X → X and f2 : Y → X be two continous map of metric C-space X and Y . Suppose the map h : X→ Y is a topogical C-conjugacy from f1 to f2 , then(1) h(SCRG (f1 ))=SCRG (f2) ; (2) h(SG (x, f1 )) = SG(h(x),f2;(3)h(CEG(x,f1=CEG(h(x),f2). These results will enrich the theory of C-strong chain recurrent point, C-chain point and C-chain equivalent point of topological C-conjugacy on metric C-space.",
"fno": "505000a282",
"keywords": [
"Set Theory",
"Topology",
"Continous Map",
"C Chain Point Set",
"G Strong Chain Recurrent Point",
"Metric Space",
"C Strong Chain Recurrent Point",
"Metric C Space",
"Topological C Conjugacy",
"C Chain Equivalent Point",
"Topological G Conjugacy",
"Virtual Reality",
"Intelligent Systems",
"Metric G Space",
"Topological G Conjugacy",
"G Strong Chain Recurrent Point",
"G Chain Point",
"G Chain Equivalent Point"
],
"authors": [
{
"affiliation": "Wuzhou University",
"fullName": "Zhan-Jiang Ji",
"givenName": "Zhan-Jiang",
"surname": "Ji",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wuzhou University",
"fullName": "Jing-Xian Tu",
"givenName": "Jing-Xian",
"surname": "Tu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icvris",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-09-01T00:00:00",
"pubType": "proceedings",
"pages": "282-285",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-5050-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "505000a276",
"articleId": "1fHk6wUkohy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "505000a286",
"articleId": "1fHkaCfTb7G",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cdc/2000/6638/1/00912854",
"title": "Limiting discounted-cost control of partially observable stochastic systems",
"doi": null,
"abstractUrl": "/proceedings-article/cdc/2000/00912854/12OmNAtaS0L",
"parentPublication": {
"id": "proceedings/cdc/2000/6638/1",
"title": "Proceedings of the 39th IEEE Conference on Decision and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aspdac/1998/4425/0/00669399",
"title": "New methods to find optimal non-disjoint bi-decompositions",
"doi": null,
"abstractUrl": "/proceedings-article/aspdac/1998/00669399/12OmNBOCWln",
"parentPublication": {
"id": "proceedings/aspdac/1998/4425/0",
"title": "Proceedings of 1998 Asia and South Pacific Design Automation Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icic/2009/3634/3/3634c329",
"title": "Well Posedness of Generalized Mutually Minimization Problem",
"doi": null,
"abstractUrl": "/proceedings-article/icic/2009/3634c329/12OmNrkT7xk",
"parentPublication": {
"id": "proceedings/icic/2009/3634/2",
"title": "2009 Second International Conference on Information and Computing Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmtma/2018/5114/0/511401a362",
"title": "Point Sets and Periodic Shadowing Property of Topological G-Conjugacy on Metric G-Space",
"doi": null,
"abstractUrl": "/proceedings-article/icmtma/2018/511401a362/12OmNzA6GKY",
"parentPublication": {
"id": "proceedings/icmtma/2018/5114/0",
"title": "2018 10th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sct/1994/5670/0/00315823",
"title": "Polynomial-time membership comparable sets",
"doi": null,
"abstractUrl": "/proceedings-article/sct/1994/00315823/12OmNzZWbDm",
"parentPublication": {
"id": "proceedings/sct/1994/5670/0",
"title": "Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1992/04/t0489",
"title": "Basis Sets for Synthesis of Switching Functions",
"doi": null,
"abstractUrl": "/journal/tc/1992/04/t0489/13rRUyogGze",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsgea/2018/6953/0/695301a237",
"title": "The Research of G- expansive Map and Devaney’s G-Chaos Condition on Metric G-Space",
"doi": null,
"abstractUrl": "/proceedings-article/icsgea/2018/695301a237/17D45WK5AoM",
"parentPublication": {
"id": "proceedings/icsgea/2018/6953/0",
"title": "2018 International Conference on Smart Grid and Electrical Automation (ICSGEA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/synasc/2017/2626/0/262600a055",
"title": "Simple Relation between the Lowest-Order Element of Ideal 〈G,H〉 and the Last Element of Polynomial Remainder Sequence",
"doi": null,
"abstractUrl": "/proceedings-article/synasc/2017/262600a055/17D45WK5Aqk",
"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/icris/2019/2632/0/263200a409",
"title": "Devaney Chaos And Expansive Map On The Hyperspace Of Topological Group Action",
"doi": null,
"abstractUrl": "/proceedings-article/icris/2019/263200a409/1cI6nqyip6o",
"parentPublication": {
"id": "proceedings/icris/2019/2632/0",
"title": "2019 International Conference on Robots & Intelligent System (ICRIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icvris/2020/9636/0/963600b152",
"title": "The Research of the Accessibility and Transitivity of Topological Group",
"doi": null,
"abstractUrl": "/proceedings-article/icvris/2020/963600b152/1x4ZcZFyV7a",
"parentPublication": {
"id": "proceedings/icvris/2020/9636/0",
"title": "2020 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxwnczo",
"title": "2010 Third International Conference on Information and Computing",
"acronym": "icic",
"groupId": "1002818",
"volume": "3",
"displayVolume": "3",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAXPybe",
"doi": "10.1109/ICIC.2010.239",
"title": "Modeling Study of Hydroacoustic Channel Based on Ray Model",
"normalizedTitle": "Modeling Study of Hydroacoustic Channel Based on Ray Model",
"abstract": "This paper introduced the theoretical basis of acoustic signal propagation model, and for the model gives a mathematical derivation of the formula, as well as gives a detailed theoretical derivation and mathematical analysis process, it gives the analysis of the solving of propagation loss based on ray-tracing model, and in accordance with the given mathematical model, implemented simulation under the ray model in matlab.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper introduced the theoretical basis of acoustic signal propagation model, and for the model gives a mathematical derivation of the formula, as well as gives a detailed theoretical derivation and mathematical analysis process, it gives the analysis of the solving of propagation loss based on ray-tracing model, and in accordance with the given mathematical model, implemented simulation under the ray model in matlab.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper introduced the theoretical basis of acoustic signal propagation model, and for the model gives a mathematical derivation of the formula, as well as gives a detailed theoretical derivation and mathematical analysis process, it gives the analysis of the solving of propagation loss based on ray-tracing model, and in accordance with the given mathematical model, implemented simulation under the ray model in matlab.",
"fno": "4047c217",
"keywords": [
"Underwater Communication",
"Propagation Attenuation",
"Ray Model",
"Channel Simulation"
],
"authors": [
{
"affiliation": null,
"fullName": "Xu Zhi-Bin",
"givenName": "Xu",
"surname": "Zhi-Bin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lin Xue-Yuan",
"givenName": "Lin",
"surname": "Xue-Yuan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icic",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-06-01T00:00:00",
"pubType": "proceedings",
"pages": "217-220",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4047-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4047c214",
"articleId": "12OmNBaBuTh",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4047c221",
"articleId": "12OmNyrqznI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/rt/2007/1629/0/04342586",
"title": "Ray-Strips: A Compact Mesh Representation for Interactive Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2007/04342586/12OmNASILFQ",
"parentPublication": {
"id": "proceedings/rt/2007/1629/0",
"title": "IEEE/ EG Symposium on Interactive Ray Tracing 2007",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itnac/2017/6796/0/08215417",
"title": "Optimisation of relay-assisted wireless systems in quasi-static environments using ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/itnac/2017/08215417/12OmNBE7Mq2",
"parentPublication": {
"id": "proceedings/itnac/2017/6796/0",
"title": "2017 27th International Telecommunication Networks and Applications Conference (ITNAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/chinacom/2014/5970/0/07054264",
"title": "Characteristics of the 60 GHz indoor wireless propagation based on ray tracing with human body movement",
"doi": null,
"abstractUrl": "/proceedings-article/chinacom/2014/07054264/12OmNBrlPvo",
"parentPublication": {
"id": "proceedings/chinacom/2014/5970/0",
"title": "2014 9th International Conference on Communications and Networking in China (CHINACOM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2011/2135/0/06121045",
"title": "Automated Inspection Using X-Ray Imaging",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2011/06121045/12OmNwDSdFg",
"parentPublication": {
"id": "proceedings/trustcom/2011/2135/0",
"title": "2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2010/7846/0/05571280",
"title": "Real-Time Ray Tracing of Complex Molecular Scenes",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2010/05571280/12OmNy314eg",
"parentPublication": {
"id": "proceedings/iv/2010/7846/0",
"title": "2010 14th International Conference Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2012/4779/0/4779a556",
"title": "An Algorithm to Estimate Propagation Parameters Based on 2-Ray Model",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2012/4779a556/12OmNz2C1wB",
"parentPublication": {
"id": "proceedings/nbis/2012/4779/0",
"title": "2012 15th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/12/ttg2013122673",
"title": "Fast Generation of Virtual X-ray Images for Reconstruction of 3D Anatomy",
"doi": null,
"abstractUrl": "/journal/tg/2013/12/ttg2013122673/13rRUEgarBu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2010/02/ttg2010020261",
"title": "Real-Time Ray Tracing of Implicit Surfaces on the GPU",
"doi": null,
"abstractUrl": "/journal/tg/2010/02/ttg2010020261/13rRUwI5TQT",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2014/10/06784142",
"title": "Statistical Inverse Ray Tracing for Image-Based 3D Modeling",
"doi": null,
"abstractUrl": "/journal/tp/2014/10/06784142/13rRUzp02ps",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/02/09240062",
"title": "Interactive Visual Study of Multiple Attributes Learning Model of X-Ray Scattering Images",
"doi": null,
"abstractUrl": "/journal/tg/2021/02/09240062/1oeZWI26XM4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvStcUv",
"title": "2014 9th International Conference on Communications and Networking in China (CHINACOM)",
"acronym": "chinacom",
"groupId": "1001650",
"volume": "0",
"displayVolume": "0",
"year": "2014",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBrlPvo",
"doi": "10.1109/CHINACOM.2014.7054264",
"title": "Characteristics of the 60 GHz indoor wireless propagation based on ray tracing with human body movement",
"normalizedTitle": "Characteristics of the 60 GHz indoor wireless propagation based on ray tracing with human body movement",
"abstract": "In this paper, an extended two-dimensional (2D) ray tracing algorithm is proposed to investigate the characteristics of indoor wireless propagation. A random variable, which serves as the extension to the classic 2D ray tracing algorithm, is introduced to study the human body movement effects to the propagation. Based on the proposed ray tracing algorithm, the path gains and delays are simulated under a variety of different settings. Simulation results and analysis show that the movement of human body degrades the transmission qualities.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, an extended two-dimensional (2D) ray tracing algorithm is proposed to investigate the characteristics of indoor wireless propagation. A random variable, which serves as the extension to the classic 2D ray tracing algorithm, is introduced to study the human body movement effects to the propagation. Based on the proposed ray tracing algorithm, the path gains and delays are simulated under a variety of different settings. Simulation results and analysis show that the movement of human body degrades the transmission qualities.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, an extended two-dimensional (2D) ray tracing algorithm is proposed to investigate the characteristics of indoor wireless propagation. A random variable, which serves as the extension to the classic 2D ray tracing algorithm, is introduced to study the human body movement effects to the propagation. Based on the proposed ray tracing algorithm, the path gains and delays are simulated under a variety of different settings. Simulation results and analysis show that the movement of human body degrades the transmission qualities.",
"fno": "07054264",
"keywords": [
"Ray Tracing",
"Receivers",
"Wireless Communication",
"Computational Modeling",
"Delays",
"Propagation Delay",
"Indoor Propagation",
"60 G Hz",
"2 D Ray Tracing",
"Human Body Movement"
],
"authors": [
{
"affiliation": "School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China",
"fullName": "Zhao Junhui",
"givenName": "Zhao",
"surname": "Junhui",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China",
"fullName": "Liu Xu",
"givenName": "Liu",
"surname": "Xu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "chinacom",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2014-08-01T00:00:00",
"pubType": "proceedings",
"pages": "85-89",
"year": "2014",
"issn": null,
"isbn": "978-1-4799-5970-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07054263",
"articleId": "12OmNBOCWdI",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07054265",
"articleId": "12OmNBLdKC9",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/itnac/2017/6796/0/08215417",
"title": "Optimisation of relay-assisted wireless systems in quasi-static environments using ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/itnac/2017/08215417/12OmNBE7Mq2",
"parentPublication": {
"id": "proceedings/itnac/2017/6796/0",
"title": "2017 27th International Telecommunication Networks and Applications Conference (ITNAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634613",
"title": "Ray-specialized acceleration structures for ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634613/12OmNBt3qlA",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2011/4648/0/4648a011",
"title": "GPU-Based Data Structure for a Parallel Ray Tracing Illumination Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2011/4648a011/12OmNvwC5ve",
"parentPublication": {
"id": "proceedings/sbgames/2011/4648/0",
"title": "2011 Brazilian Symposium on Games and Digital Entertainment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a087",
"title": "SIMD Friendly Ray Tracing on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a087/12OmNxFaLiE",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870027",
"title": "A Hardware Acceleration Method for Volumetric Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870027/12OmNxHJ9p1",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2016/2239/0/07515893",
"title": "Position orientating path reverse ray tracing algorithm based on cluster analysis",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2016/07515893/12OmNyYDDEF",
"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/cgi/2005/9330/0/01500343",
"title": "Ray tracing on the desktop: when and how?",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2005/01500343/12OmNyjccyJ",
"parentPublication": {
"id": "proceedings/cgi/2005/9330/0",
"title": "Computer Graphics International 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icycs/2008/3398/0/3398a907",
"title": "Reconstruction of the Visual Hull with Modified Ray-tracing and Fast Slice-based Surface Extraction",
"doi": null,
"abstractUrl": "/proceedings-article/icycs/2008/3398a907/12OmNyprnyV",
"parentPublication": {
"id": "proceedings/icycs/2008/3398/0",
"title": "2008 9th International Conference for Young Computer Scientists",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uic-atc-scalcom/2015/7211/0/07518518",
"title": "A Ray-Tracing Based Fingerprinting for Indoor Positioning",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc-scalcom/2015/07518518/12OmNzzP5zg",
"parentPublication": {
"id": "proceedings/uic-atc-scalcom/2015/7211/0",
"title": "2015 IEEE 12th Intl Conf on Ubiquitous Intelligence and Computing and 2015 IEEE 12th Intl Conf on Autonomic and Trusted Computing and 2015 IEEE 15th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2001/02/mcg2001020022",
"title": "A Benchmark for Animated Ray Tracing",
"doi": null,
"abstractUrl": "/magazine/cg/2001/02/mcg2001020022/13rRUyp7u1i",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqIhFOw",
"title": "2011 10th International Symposium on Distributed Computing and Applications to Business, Engineering and Science",
"acronym": "dcabes",
"groupId": "1800130",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxFaLpg",
"doi": "10.1109/DCABES.2011.65",
"title": "Parallel Domain Decomposition Methods for Ray-Tracing on Multi-cores and Multi-processors",
"normalizedTitle": "Parallel Domain Decomposition Methods for Ray-Tracing on Multi-cores and Multi-processors",
"abstract": "In this paper, an original parallel domain decomposition method for ray-tracing is proposed to solve numerical acoustic problems on multi-cores and multi-processors computers. A hybrid method between the ray-tracing and the beam tracing method is first introduced. Then, a new parallel method based on domain decomposition principles is proposed. This method allows to handle large scale open domains for parallel computing purpose, better than other existing methods. Parallel numerical experiments, carried out on a real world problem -- namely the acoustic pollution analysis within a large city -- illustrate the performance of this new domain decomposition method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, an original parallel domain decomposition method for ray-tracing is proposed to solve numerical acoustic problems on multi-cores and multi-processors computers. A hybrid method between the ray-tracing and the beam tracing method is first introduced. Then, a new parallel method based on domain decomposition principles is proposed. This method allows to handle large scale open domains for parallel computing purpose, better than other existing methods. Parallel numerical experiments, carried out on a real world problem -- namely the acoustic pollution analysis within a large city -- illustrate the performance of this new domain decomposition method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, an original parallel domain decomposition method for ray-tracing is proposed to solve numerical acoustic problems on multi-cores and multi-processors computers. A hybrid method between the ray-tracing and the beam tracing method is first introduced. Then, a new parallel method based on domain decomposition principles is proposed. This method allows to handle large scale open domains for parallel computing purpose, better than other existing methods. Parallel numerical experiments, carried out on a real world problem -- namely the acoustic pollution analysis within a large city -- illustrate the performance of this new domain decomposition method.",
"fno": "4415a001",
"keywords": [
"Domain Decomposition Methods",
"Parallel And Distributed Computing",
"Acoustics",
"Ray Tracing Methods",
"Beam Tracing Methods"
],
"authors": [
{
"affiliation": null,
"fullName": "Cédric Venet",
"givenName": "Cédric",
"surname": "Venet",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Frédéric Magoulès",
"givenName": "Frédéric",
"surname": "Magoulès",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "dcabes",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-5",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4415-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4415z018",
"articleId": "12OmNx5GU8q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4415a006",
"articleId": "12OmNB7cjjx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cgi/2003/1946/0/19460202",
"title": "Ray Tracing Height Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2003/19460202/12OmNvrdI3r",
"parentPublication": {
"id": "proceedings/cgi/2003/1946/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2011/4648/0/4648a011",
"title": "GPU-Based Data Structure for a Parallel Ray Tracing Illumination Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2011/4648a011/12OmNvwC5ve",
"parentPublication": {
"id": "proceedings/sbgames/2011/4648/0",
"title": "2011 Brazilian Symposium on Games and Digital Entertainment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpp/1996/7623/2/76232108",
"title": "(R) Ray Tracing: Parallelization via Image Decomposition and Performance Impact",
"doi": null,
"abstractUrl": "/proceedings-article/icpp/1996/76232108/12OmNwtn3x2",
"parentPublication": {
"id": "proceedings/icpp/1996/7623/2",
"title": "Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sccc/2010/4400/0/4400a011",
"title": "Improving the Performance of a Ray Tracing Algorithm Using a GPU",
"doi": null,
"abstractUrl": "/proceedings-article/sccc/2010/4400a011/12OmNx0RJ0z",
"parentPublication": {
"id": "proceedings/sccc/2010/4400/0",
"title": "2010 XXIX International Conference of the Chilean Computer Science Society",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a087",
"title": "SIMD Friendly Ray Tracing on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a087/12OmNxFaLiE",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870027",
"title": "A Hardware Acceleration Method for Volumetric Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870027/12OmNxHJ9p1",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcabes/2014/4169/0/4169a162",
"title": "Beam-Tracing Domain Decomposition Method for Urban Acoustic Pollution",
"doi": null,
"abstractUrl": "/proceedings-article/dcabes/2014/4169a162/12OmNyL0Tp0",
"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/cgi/2005/9330/0/01500343",
"title": "Ray tracing on the desktop: when and how?",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2005/01500343/12OmNyjccyJ",
"parentPublication": {
"id": "proceedings/cgi/2005/9330/0",
"title": "Computer Graphics International 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1997/01/mcg1997010042",
"title": "Faster Ray Tracing Using Adaptive Grids",
"doi": null,
"abstractUrl": "/magazine/cg/1997/01/mcg1997010042/13rRUEgs2vy",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/09/06081859",
"title": "Combining Single and Packet-Ray Tracing for Arbitrary Ray Distributions on the Intel MIC Architecture",
"doi": null,
"abstractUrl": "/journal/tg/2012/09/06081859/13rRUwInvJe",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy314bq",
"title": "2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"acronym": "snpd",
"groupId": "1001811",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyYDDEF",
"doi": "10.1109/SNPD.2016.7515893",
"title": "Position orientating path reverse ray tracing algorithm based on cluster analysis",
"normalizedTitle": "Position orientating path reverse ray tracing algorithm based on cluster analysis",
"abstract": "In allusion to ray tracing problems in the localization field, a position orientating path reverse ray tracing algorithm based on cluster analysis is proposed in this paper. Firstly, a two-dimensional propagation environment model with building surface as the quasi-mirror is established in order to simulate the actual propagation environment; secondly, according to the estimated values of TOA and AOA of the multipath signal, the branch tracing and searching algorithm is adopted for the proposed algorithm to find the feasible paths, and the cluster analysis is adopted to identify and trace position orientating path. Finally, the result of simulation experiment verified the effectiveness of the algorithm.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In allusion to ray tracing problems in the localization field, a position orientating path reverse ray tracing algorithm based on cluster analysis is proposed in this paper. Firstly, a two-dimensional propagation environment model with building surface as the quasi-mirror is established in order to simulate the actual propagation environment; secondly, according to the estimated values of TOA and AOA of the multipath signal, the branch tracing and searching algorithm is adopted for the proposed algorithm to find the feasible paths, and the cluster analysis is adopted to identify and trace position orientating path. Finally, the result of simulation experiment verified the effectiveness of the algorithm.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In allusion to ray tracing problems in the localization field, a position orientating path reverse ray tracing algorithm based on cluster analysis is proposed in this paper. Firstly, a two-dimensional propagation environment model with building surface as the quasi-mirror is established in order to simulate the actual propagation environment; secondly, according to the estimated values of TOA and AOA of the multipath signal, the branch tracing and searching algorithm is adopted for the proposed algorithm to find the feasible paths, and the cluster analysis is adopted to identify and trace position orientating path. Finally, the result of simulation experiment verified the effectiveness of the algorithm.",
"fno": "07515893",
"keywords": [
"Reflection",
"Buildings",
"Ray Tracing",
"Surface Morphology",
"Surface Treatment",
"Clustering Algorithms",
"Algorithm Design And Analysis",
"Localization",
"Ray Trace",
"Quasi Mirror",
"Geographic Information System GIS"
],
"authors": [
{
"affiliation": "Zhengzhou Institute of Information Science and Technology, China",
"fullName": "Fanzeng Kong",
"givenName": "Fanzeng",
"surname": "Kong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhengzhou Institute of Information Science and Technology, China",
"fullName": "Nae Zheng",
"givenName": "Nae",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhengzhou Institute of Information Science and Technology, China",
"fullName": "Guanyi Liu",
"givenName": "Guanyi",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Zhengzhou Institute of Information Science and Technology, China",
"fullName": "Xiukun Ren",
"givenName": "Xiukun",
"surname": "Ren",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "snpd",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-05-01T00:00:00",
"pubType": "proceedings",
"pages": "147-153",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-2239-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07515892",
"articleId": "12OmNwCsdIr",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07515894",
"articleId": "12OmNx3Zja2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/rt/2006/0693/0/04061539",
"title": "Ray Tracing for the Movie `Cars'",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2006/04061539/12OmNBBzoiL",
"parentPublication": {
"id": "proceedings/rt/2006/0693/0",
"title": "IEEE Symposium on Interactive Ray Tracing 2006",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2011/4648/0/4648a011",
"title": "GPU-Based Data Structure for a Parallel Ray Tracing Illumination Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2011/4648a011/12OmNvwC5ve",
"parentPublication": {
"id": "proceedings/sbgames/2011/4648/0",
"title": "2011 Brazilian Symposium on Games and Digital Entertainment",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634619",
"title": "Large ray packets for real-time Whitted ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634619/12OmNwcCITG",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a087",
"title": "SIMD Friendly Ray Tracing on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a087/12OmNxFaLiE",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/1995/7187/0/71870027",
"title": "A Hardware Acceleration Method for Volumetric Ray Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/1995/71870027/12OmNxHJ9p1",
"parentPublication": {
"id": "proceedings/ieee-vis/1995/7187/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2005/9330/0/01500343",
"title": "Ray tracing on the desktop: when and how?",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2005/01500343/12OmNyjccyJ",
"parentPublication": {
"id": "proceedings/cgi/2005/9330/0",
"title": "Computer Graphics International 2005",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2012/4725/0/4725a131",
"title": "Real Time Ray Tracing for Augmented Reality",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2012/4725a131/12OmNzcPAGy",
"parentPublication": {
"id": "proceedings/svr/2012/4725/0",
"title": "2012 14th Symposium on Virtual and Augmented Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634652",
"title": "A proposal for terminology related to ray tracing",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634652/12OmNzxgHHn",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1988/02/mcg1988020060",
"title": "Spacetime Ray Tracing for Animation",
"doi": null,
"abstractUrl": "/magazine/cg/1988/02/mcg1988020060/13rRUwInvD5",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111797",
"title": "Guided Multiview Ray Tracing for Fast Auralization",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111797/13rRUxAAST4",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyaXPP6",
"title": "Communications and Intelligence Information Security, International Conference on",
"acronym": "icciis",
"groupId": "1800177",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBUS73l",
"doi": "10.1109/ICCIIS.2010.34",
"title": "Improved BP Neural Network Algorithm for GPS Height Conversion",
"normalizedTitle": "Improved BP Neural Network Algorithm for GPS Height Conversion",
"abstract": "GPS height conversion is the key problem in survey engineering. To resolve it, researchers supposed some mathematical function to fit the surface of normal height such as plain surface, quadratic surface fitting and so on,however, which have model error. It should reduce the accuracy of the fitting result. In order to eliminate and reduce the model errors, this paper adopted BP neural network to convert the different height in the paper. Designed and programmed Matlab code were used to implement the supposed and compared results with other fitting methods, then it was convinced that BP neural would be accuracy, dependability and stabilization.",
"abstracts": [
{
"abstractType": "Regular",
"content": "GPS height conversion is the key problem in survey engineering. To resolve it, researchers supposed some mathematical function to fit the surface of normal height such as plain surface, quadratic surface fitting and so on,however, which have model error. It should reduce the accuracy of the fitting result. In order to eliminate and reduce the model errors, this paper adopted BP neural network to convert the different height in the paper. Designed and programmed Matlab code were used to implement the supposed and compared results with other fitting methods, then it was convinced that BP neural would be accuracy, dependability and stabilization.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "GPS height conversion is the key problem in survey engineering. To resolve it, researchers supposed some mathematical function to fit the surface of normal height such as plain surface, quadratic surface fitting and so on,however, which have model error. It should reduce the accuracy of the fitting result. In order to eliminate and reduce the model errors, this paper adopted BP neural network to convert the different height in the paper. Designed and programmed Matlab code were used to implement the supposed and compared results with other fitting methods, then it was convinced that BP neural would be accuracy, dependability and stabilization.",
"fno": "4260a005",
"keywords": [
"GPS",
"BP Neural Network",
"Height Conversion",
"Normal Height"
],
"authors": [
{
"affiliation": null,
"fullName": "Chuan Hu",
"givenName": "Chuan",
"surname": "Hu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icciis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-10-01T00:00:00",
"pubType": "proceedings",
"pages": "5-8",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4260-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4260a001",
"articleId": "12OmNyqzM4x",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4260a009",
"articleId": "12OmNxFaLfR",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icicta/2009/3804/1/3804a079",
"title": "Model of Online Grain Moisture Test System Based on Improved BP Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2009/3804a079/12OmNAq3hFh",
"parentPublication": {
"id": "proceedings/icicta/2009/3804/1",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2012/4789/0/4789a255",
"title": "The Application of Genetic Neural Network in the GPS Height Transformation",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2012/4789a255/12OmNCcbEbC",
"parentPublication": {
"id": "proceedings/iccis/2012/4789/0",
"title": "2012 Fourth International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2003/1946/0/19460202",
"title": "Ray Tracing Height Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2003/19460202/12OmNvrdI3r",
"parentPublication": {
"id": "proceedings/cgi/2003/1946/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isise/2010/4360/0/4360a426",
"title": "An Improved PSO-BP Network Model",
"doi": null,
"abstractUrl": "/proceedings-article/isise/2010/4360a426/12OmNvwkuk6",
"parentPublication": {
"id": "proceedings/isise/2010/4360/0",
"title": "2010 Third International Symposium on Information Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/grc/2012/2310/0/06468678",
"title": "Determination of ICESat sea surface height and comparing with TP data",
"doi": null,
"abstractUrl": "/proceedings-article/grc/2012/06468678/12OmNwMXno7",
"parentPublication": {
"id": "proceedings/grc/2012/2310/0",
"title": "2012 IEEE International Conference on Granular Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2010/4077/3/4077e698",
"title": "The Application of BP Neural Network in GPS Elevation Fitting",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2010/4077e698/12OmNwdbUYb",
"parentPublication": {
"id": "proceedings/icicta/2010/4077/3",
"title": "Intelligent Computation Technology and Automation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccis/2010/4270/0/4270a503",
"title": "GPS Height Conversion Based on Genetic Neural Network",
"doi": null,
"abstractUrl": "/proceedings-article/iccis/2010/4270a503/12OmNwekjus",
"parentPublication": {
"id": "proceedings/iccis/2010/4270/0",
"title": "2010 International Conference on Computational and Information Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cesce/2010/3972/1/3972a382",
"title": "Conversion and Information System Management of GPS Heights Based on MapObjects",
"doi": null,
"abstractUrl": "/proceedings-article/cesce/2010/3972a382/12OmNxGj9UE",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cmc/2009/3501/3/3501c295",
"title": "GPS Height Aiding Computation Using Multi-resolution Digital Terrain Models",
"doi": null,
"abstractUrl": "/proceedings-article/cmc/2009/3501c295/12OmNyoSbbW",
"parentPublication": {
"id": "proceedings/cmc/2009/3501/3",
"title": "2009 WRI International Conference on Communications and Mobile Computing. CMC 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/esiat/2009/3682/2/3682b639",
"title": "Combining Model for Regional GPS Height Conversion Based on Least Squares Support Vector Machines",
"doi": null,
"abstractUrl": "/proceedings-article/esiat/2009/3682b639/12OmNzFMFjn",
"parentPublication": {
"id": "esiat/2009/3682/2",
"title": "Environmental Science and Information Application Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzSh1bn",
"title": "2009 Sixth International Conference on Computer Graphics, Imaging and Visualization",
"acronym": "cgiv",
"groupId": "1001775",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBPc8yl",
"doi": "10.1109/CGIV.2009.14",
"title": "BRDF Valid Sampling Based on Gradient Magnitude Synthetic Analysis",
"normalizedTitle": "BRDF Valid Sampling Based on Gradient Magnitude Synthetic Analysis",
"abstract": "In general, there are some minor flaws on the surface of homogeneous material, such as stains, nicks, will produce unfavorable effects on isotropic BRDF measurement, especially for highlight material. In this paper, we present a numerical technique, which can efficient solve this problem by gradient magnitude synthetic analyse. We measure BRDF by fixing camera and rotating light source. We found that nicks or stains will exhibit different properties from their surrounding material in some special light orientations. A novel algorithm is defeloped to detect tiny nicks or stains based on this principle. We merge gradient magnitude info of possible edge points by common edge detection algorithms at all light source orientations and classify edge points as several ranks, and then check invalidity of edge points and rational distribute them by comprehensive analyze the rank of each point.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In general, there are some minor flaws on the surface of homogeneous material, such as stains, nicks, will produce unfavorable effects on isotropic BRDF measurement, especially for highlight material. In this paper, we present a numerical technique, which can efficient solve this problem by gradient magnitude synthetic analyse. We measure BRDF by fixing camera and rotating light source. We found that nicks or stains will exhibit different properties from their surrounding material in some special light orientations. A novel algorithm is defeloped to detect tiny nicks or stains based on this principle. We merge gradient magnitude info of possible edge points by common edge detection algorithms at all light source orientations and classify edge points as several ranks, and then check invalidity of edge points and rational distribute them by comprehensive analyze the rank of each point.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In general, there are some minor flaws on the surface of homogeneous material, such as stains, nicks, will produce unfavorable effects on isotropic BRDF measurement, especially for highlight material. In this paper, we present a numerical technique, which can efficient solve this problem by gradient magnitude synthetic analyse. We measure BRDF by fixing camera and rotating light source. We found that nicks or stains will exhibit different properties from their surrounding material in some special light orientations. A novel algorithm is defeloped to detect tiny nicks or stains based on this principle. We merge gradient magnitude info of possible edge points by common edge detection algorithms at all light source orientations and classify edge points as several ranks, and then check invalidity of edge points and rational distribute them by comprehensive analyze the rank of each point.",
"fno": "3789a011",
"keywords": [
"BRDF Sampling",
"Gradient Magnitude"
],
"authors": [
{
"affiliation": null,
"fullName": "Zhou Zeng",
"givenName": "Zhou",
"surname": "Zeng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lizhuang Ma",
"givenName": "Lizhuang",
"surname": "Ma",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zuoyong Zheng",
"givenName": "Zuoyong",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cgiv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-08-01T00:00:00",
"pubType": "proceedings",
"pages": "11-17",
"year": "2009",
"issn": null,
"isbn": "978-0-7695-3789-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05298385",
"articleId": "12OmNyQ7G37",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3789a106",
"articleId": "12OmNs4S8Gg",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2011/0394/0/05995603",
"title": "A theory of differential photometric stereo for unknown isotropic BRDFs",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2011/05995603/12OmNCzb9vc",
"parentPublication": {
"id": "proceedings/cvpr/2011/0394/0",
"title": "CVPR 2011",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2002/1784/0/17840030",
"title": "A Simple Layered RGB BRDF Model",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840030/12OmNrnJ6Qa",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2005/2392/0/23920310",
"title": "BRDF Recovering and Scene Re-Lighting Using an Environment Map",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2005/23920310/12OmNs5rl2u",
"parentPublication": {
"id": "proceedings/cgiv/2005/2392/0",
"title": "International Conference on Computer Graphics, Imaging and Visualization (CGIV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2010/3984/0/3984a404",
"title": "Edge Detection with Self-Adaptive MAS Using Multi-distance Gradient",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2010/3984a404/12OmNvo67Bf",
"parentPublication": {
"id": "proceedings/itng/2010/3984/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacific-graphics/2010/4205/0/4205a054",
"title": "Thread-Based BRDF Rendering on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/pacific-graphics/2010/4205a054/12OmNweBUCO",
"parentPublication": {
"id": "proceedings/pacific-graphics/2010/4205/0",
"title": "Pacific Conference on Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nswctc/2010/4011/1/4011a332",
"title": "The Analysis of Global Illumination Rendering Based on BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/nswctc/2010/4011a332/12OmNyvGynS",
"parentPublication": {
"id": "proceedings/nswctc/2010/4011/1",
"title": "Networks Security, Wireless Communications and Trusted Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733b726",
"title": "Full BRDF Reconstruction Using CNNs from Partial Photometric Stereo-Light Field Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733b726/12OmNzGlRzw",
"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/iccv/2015/8391/0/8391d559",
"title": "A Gaussian Process Latent Variable Model for BRDF Inference",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d559/12OmNzVoBvI",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111824",
"title": "Rational BRDF",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111824/13rRUwjGoFZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/01/mcg2006010030",
"title": "BRDF-Shop: Creating Physically Correct Bidirectional Reflectance Distribution Functions",
"doi": null,
"abstractUrl": "/magazine/cg/2006/01/mcg2006010030/13rRUyhaIj5",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzl3WWY",
"title": "2007 11th IEEE International Conference on Computer Vision",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNCd2rQs",
"doi": "10.1109/ICCV.2007.4408935",
"title": "BRDF Acquisition with Basis Illumination",
"normalizedTitle": "BRDF Acquisition with Basis Illumination",
"abstract": "Realistic descriptions of surface reflectance have long been a topic of interest in both computer vision and computer graphics research. In this paper, we describe a novel and fast approach for the acquisition of bidirectional reflectance distribution functions (BRDFs). We develop a novel theory for directly measuring BRDFs in a basis representation by projecting incident light as a sequence of basis functions from a spherical zone of directions. We derive an orthonormal basis over spherical zones that is ideally suited for this task. BRDF values outside the zonal directions are extrapolated by re-projecting the zonal measurements into a spherical harmonics basis, or by fitting analytical reflection models to the data. We verify this approach with a compact optical setup that requires no moving parts and only a small number of image measurements. Using this approach, a BRDF can be measured in just a few minutes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Realistic descriptions of surface reflectance have long been a topic of interest in both computer vision and computer graphics research. In this paper, we describe a novel and fast approach for the acquisition of bidirectional reflectance distribution functions (BRDFs). We develop a novel theory for directly measuring BRDFs in a basis representation by projecting incident light as a sequence of basis functions from a spherical zone of directions. We derive an orthonormal basis over spherical zones that is ideally suited for this task. BRDF values outside the zonal directions are extrapolated by re-projecting the zonal measurements into a spherical harmonics basis, or by fitting analytical reflection models to the data. We verify this approach with a compact optical setup that requires no moving parts and only a small number of image measurements. Using this approach, a BRDF can be measured in just a few minutes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Realistic descriptions of surface reflectance have long been a topic of interest in both computer vision and computer graphics research. In this paper, we describe a novel and fast approach for the acquisition of bidirectional reflectance distribution functions (BRDFs). We develop a novel theory for directly measuring BRDFs in a basis representation by projecting incident light as a sequence of basis functions from a spherical zone of directions. We derive an orthonormal basis over spherical zones that is ideally suited for this task. BRDF values outside the zonal directions are extrapolated by re-projecting the zonal measurements into a spherical harmonics basis, or by fitting analytical reflection models to the data. We verify this approach with a compact optical setup that requires no moving parts and only a small number of image measurements. Using this approach, a BRDF can be measured in just a few minutes.",
"fno": "04408935",
"keywords": [],
"authors": [
{
"affiliation": "The University of British Columbia. email: ghosh@cs.ubc.ca",
"fullName": "Abhijeet Ghosh",
"givenName": "Abhijeet",
"surname": "Ghosh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of British Columbia",
"fullName": "Shruthi Achutha",
"givenName": "Shruthi",
"surname": "Achutha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of British Columbia. email: heidrich@cs.ubc.ca",
"fullName": "Wolfgang Heidrich",
"givenName": "Wolfgang",
"surname": "Heidrich",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "The University of British Columbia",
"fullName": "Matthew O'Toole",
"givenName": "Matthew",
"surname": "O'Toole",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2007",
"issn": null,
"isbn": "978-1-4244-1630-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04408934",
"articleId": "12OmNzGlRz7",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04408936",
"articleId": "12OmNxwWozk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2009/4420/0/05459255",
"title": "Directional statistics BRDF model",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459255/12OmNAR1b26",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c179",
"title": "What Camera Motion Reveals about Shape with Unknown BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c179/12OmNBqMDzR",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034a153",
"title": "Efficient BRDF Sampling Using Projected Deviation Vector Parameterization",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a153/12OmNBtUdGa",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2008/2242/0/04587766",
"title": "An LED-only BRDF measurement device",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2008/04587766/12OmNvrMUhC",
"parentPublication": {
"id": "proceedings/cvpr/2008/2242/0",
"title": "2008 IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2015/8391/0/8391d559",
"title": "A Gaussian Process Latent Variable Model for BRDF Inference",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d559/12OmNzVoBvI",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2013/4989/0/4989b468",
"title": "BRDF Slices: Accurate Adaptive Anisotropic Appearance Acquisition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2013/4989b468/12OmNzlD9Fw",
"parentPublication": {
"id": "proceedings/cvpr/2013/4989/0",
"title": "2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111824",
"title": "Rational BRDF",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111824/13rRUwjGoFZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/05/v0550",
"title": "Radiance Caching for Efficient Global Illumination Computation",
"doi": null,
"abstractUrl": "/journal/tg/2005/05/v0550/13rRUxYrbUs",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/01/mcg2006010030",
"title": "BRDF-Shop: Creating Physically Correct Bidirectional Reflectance Distribution Functions",
"doi": null,
"abstractUrl": "/magazine/cg/2006/01/mcg2006010030/13rRUyhaIj5",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/03/08477180",
"title": "BRDF Analysis with Directional Statistics and its Applications",
"doi": null,
"abstractUrl": "/journal/tg/2020/03/08477180/14gwrpzK86c",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwekjuE",
"title": "International Conference on Computer Graphics, Imaging and Visualization (CGIV'05)",
"acronym": "cgiv",
"groupId": "1001775",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNs5rl2u",
"doi": "10.1109/CGIV.2005.25",
"title": "BRDF Recovering and Scene Re-Lighting Using an Environment Map",
"normalizedTitle": "BRDF Recovering and Scene Re-Lighting Using an Environment Map",
"abstract": "A rendering algorithm based on physical phenomenon and well-defined model data are needed to generate a synthetic image realistically. In this paper, inverse rendering based on an environment map is proposed to obtain BRDF of objects. Many researchers try to find BRDF by analyzing many pictures taken with well-controlled camera and light position. But this method is available at a laboratory environment. Limits of previous works can be conquered by using Inverse rendering based on an environment map and it is possible to get BRDF of objects at a general environment. Inputs are an image, an environment map and 3D geometry data of models. Objects of an input image are divided into three parts — diffuse reflection, glossy reflection and diffuse texture — and BRDF of objects are recovered. Using BRDF of objects, it is possible to add virtual objects and to remove real objects from an input image.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A rendering algorithm based on physical phenomenon and well-defined model data are needed to generate a synthetic image realistically. In this paper, inverse rendering based on an environment map is proposed to obtain BRDF of objects. Many researchers try to find BRDF by analyzing many pictures taken with well-controlled camera and light position. But this method is available at a laboratory environment. Limits of previous works can be conquered by using Inverse rendering based on an environment map and it is possible to get BRDF of objects at a general environment. Inputs are an image, an environment map and 3D geometry data of models. Objects of an input image are divided into three parts — diffuse reflection, glossy reflection and diffuse texture — and BRDF of objects are recovered. Using BRDF of objects, it is possible to add virtual objects and to remove real objects from an input image.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A rendering algorithm based on physical phenomenon and well-defined model data are needed to generate a synthetic image realistically. In this paper, inverse rendering based on an environment map is proposed to obtain BRDF of objects. Many researchers try to find BRDF by analyzing many pictures taken with well-controlled camera and light position. But this method is available at a laboratory environment. Limits of previous works can be conquered by using Inverse rendering based on an environment map and it is possible to get BRDF of objects at a general environment. Inputs are an image, an environment map and 3D geometry data of models. Objects of an input image are divided into three parts — diffuse reflection, glossy reflection and diffuse texture — and BRDF of objects are recovered. Using BRDF of objects, it is possible to add virtual objects and to remove real objects from an input image.",
"fno": "23920310",
"keywords": [
"Image Based Lighting",
"BRDF",
"Environment Map"
],
"authors": [
{
"affiliation": "Chung-Ang University",
"fullName": "Youngsup Park",
"givenName": "Youngsup",
"surname": "Park",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cgiv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-07-01T00:00:00",
"pubType": "proceedings",
"pages": "310-314",
"year": "2005",
"issn": null,
"isbn": "0-7695-2392-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "23920307",
"articleId": "12OmNykCccp",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "23920317",
"articleId": "12OmNzTppDM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/wmsvm/2010/7077/0/05558360",
"title": "Modeling and Editing Isotropic BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/wmsvm/2010/05558360/12OmNARiM3T",
"parentPublication": {
"id": "proceedings/wmsvm/2010/7077/0",
"title": "2010 Second International Conference on Modeling, Simulation and Visualization Methods (WMSVM 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2006/2606/0/26060522",
"title": "Environment Lighting for Point Sampled Geometry",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2006/26060522/12OmNqIQSkQ",
"parentPublication": {
"id": "proceedings/cgiv/2006/2606/0",
"title": "International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pg/2002/1784/0/17840030",
"title": "A Simple Layered RGB BRDF Model",
"doi": null,
"abstractUrl": "/proceedings-article/pg/2002/17840030/12OmNrnJ6Qa",
"parentPublication": {
"id": "proceedings/pg/2002/1784/0",
"title": "Computer Graphics and Applications, Pacific Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgiv/2006/2606/0/26060353",
"title": "Environment Lighting for Point Sampled Geometry",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2006/26060353/12OmNvDqsJ0",
"parentPublication": {
"id": "proceedings/cgiv/2006/2606/0",
"title": "International Conference on Computer Graphics, Imaging and Visualisation (CGIV'06)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pacific-graphics/2010/4205/0/4205a054",
"title": "Thread-Based BRDF Rendering on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/pacific-graphics/2010/4205a054/12OmNweBUCO",
"parentPublication": {
"id": "proceedings/pacific-graphics/2010/4205/0",
"title": "Pacific Conference on Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nswctc/2010/4011/1/4011a332",
"title": "The Analysis of Global Illumination Rendering Based on BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/nswctc/2010/4011a332/12OmNyvGynS",
"parentPublication": {
"id": "proceedings/nswctc/2010/4011/1",
"title": "Networks Security, Wireless Communications and Trusted Computing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2010/6237/0/05444836",
"title": "Photorealistic rendering for Augmented Reality: A global illumination and BRDF solution",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2010/05444836/12OmNz6iOaA",
"parentPublication": {
"id": "proceedings/vr/2010/6237/0",
"title": "2010 IEEE Virtual Reality Conference (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111824",
"title": "Rational BRDF",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111824/13rRUwjGoFZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2006/01/mcg2006010030",
"title": "BRDF-Shop: Creating Physically Correct Bidirectional Reflectance Distribution Functions",
"doi": null,
"abstractUrl": "/magazine/cg/2006/01/mcg2006010030/13rRUyhaIj5",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2021/2688/0/268800b075",
"title": "Recovering Real-World Reflectance Properties and Shading From HDR Imagery",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2021/268800b075/1zWEfggzOaA",
"parentPublication": {
"id": "proceedings/3dv/2021/2688/0",
"title": "2021 International Conference on 3D Vision (3DV)",
"__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": "12OmNvrMUhC",
"doi": "10.1109/CVPR.2008.4587766",
"title": "An LED-only BRDF measurement device",
"normalizedTitle": "An LED-only BRDF measurement device",
"abstract": "Light Emitting Diodes (LEDs) can be used as light detectors and as light emitters. In this paper, we present a novel BRDF measurement device consisting exclusively of LEDs. Our design can acquire BRDFs over a full hemisphere, or even a full sphere (for the bidirectional transmittance distribution function BTDF), and can also measure a (partial) multi-spectral BRDF. Because we use no cameras, projectors, or even mirrors, our design does not suffer from occlusion problems. It is fast, significantly simpler, and more compact than existing BRDF measurement designs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Light Emitting Diodes (LEDs) can be used as light detectors and as light emitters. In this paper, we present a novel BRDF measurement device consisting exclusively of LEDs. Our design can acquire BRDFs over a full hemisphere, or even a full sphere (for the bidirectional transmittance distribution function BTDF), and can also measure a (partial) multi-spectral BRDF. Because we use no cameras, projectors, or even mirrors, our design does not suffer from occlusion problems. It is fast, significantly simpler, and more compact than existing BRDF measurement designs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Light Emitting Diodes (LEDs) can be used as light detectors and as light emitters. In this paper, we present a novel BRDF measurement device consisting exclusively of LEDs. Our design can acquire BRDFs over a full hemisphere, or even a full sphere (for the bidirectional transmittance distribution function BTDF), and can also measure a (partial) multi-spectral BRDF. Because we use no cameras, projectors, or even mirrors, our design does not suffer from occlusion problems. It is fast, significantly simpler, and more compact than existing BRDF measurement designs.",
"fno": "04587766",
"keywords": [],
"authors": [
{
"affiliation": "Microsoft Research Asia, China",
"fullName": "Moshe Ben-Ezra",
"givenName": "Moshe",
"surname": "Ben-Ezra",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Microsoft Research Asia, China",
"fullName": "Jiaping Wang",
"givenName": "Jiaping",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Microsoft Research Asia, China",
"fullName": "Bennett Wilburn",
"givenName": "Bennett",
"surname": "Wilburn",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tsinghua University, China",
"fullName": "Xiaoyang Li",
"givenName": null,
"surname": "Xiaoyang Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Tsinghua University, China",
"fullName": "Le Ma",
"givenName": null,
"surname": "Le Ma",
"__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": "04587765",
"articleId": "12OmNz2C1m1",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04587767",
"articleId": "12OmNvT2pgC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2009/4420/0/05459255",
"title": "Directional statistics BRDF model",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459255/12OmNAR1b26",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2005/2334/1/23340436",
"title": "BRDF Invariant Stereo Using Light Transport Constancy",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2005/23340436/12OmNAWYKHh",
"parentPublication": {
"id": "proceedings/iccv/2005/2334/2",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034a143",
"title": "A Variational Study on BRDF Reconstruction in a Structured Light Scanner",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a143/12OmNBfqG3s",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2014/5118/0/5118c179",
"title": "What Camera Motion Reveals about Shape with Unknown BRDF",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2014/5118c179/12OmNBqMDzR",
"parentPublication": {
"id": "proceedings/cvpr/2014/5118/0",
"title": "2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2007/1630/0/04408935",
"title": "BRDF Acquisition with Basis Illumination",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2007/04408935/12OmNCd2rQs",
"parentPublication": {
"id": "proceedings/iccv/2007/1630/0",
"title": "2007 11th IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2017/0457/0/0457a578",
"title": "Robust Energy Minimization for BRDF-Invariant Shape from Light Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2017/0457a578/12OmNxdDFFd",
"parentPublication": {
"id": "proceedings/cvpr/2017/0457/0",
"title": "2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2001/1143/2/114320460",
"title": "BRDF/BTF Measurement Device",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2001/114320460/12OmNyUFfJQ",
"parentPublication": {
"id": "proceedings/iccv/2001/1143/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2017/0733/0/0733b726",
"title": "Full BRDF Reconstruction Using CNNs from Partial Photometric Stereo-Light Field Data",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733b726/12OmNzGlRzw",
"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/iccv/2015/8391/0/8391d559",
"title": "A Gaussian Process Latent Variable Model for BRDF Inference",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2015/8391d559/12OmNzVoBvI",
"parentPublication": {
"id": "proceedings/iccv/2015/8391/0",
"title": "2015 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111824",
"title": "Rational BRDF",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111824/13rRUwjGoFZ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvStcTI",
"title": "Computer Vision, IEEE International Conference on",
"acronym": "iccv",
"groupId": "1000149",
"volume": "2",
"displayVolume": "2",
"year": "2001",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBezSER",
"doi": "10.1109/ICCV.2001.937659",
"title": "Shape from texture and integrability",
"normalizedTitle": "Shape from texture and integrability",
"abstract": "We describe a shape from texture method that constructs a maximum a posteriori estimate of surface coefficients using both the deformation of individual texture elements - as in local methods - and the overall distribution of elements - as in global methods. The method described applies to a much larger family of textures than any previous method, local or global. We demonstrate an analogy with shape from shading, and use this to produce a numerical method. Examples of reconstructions for synthetic images of surfaces are provided, and compared with ground truth. The method is defined for orthographic views, but can be generalised to perspective views simply.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a shape from texture method that constructs a maximum a posteriori estimate of surface coefficients using both the deformation of individual texture elements - as in local methods - and the overall distribution of elements - as in global methods. The method described applies to a much larger family of textures than any previous method, local or global. We demonstrate an analogy with shape from shading, and use this to produce a numerical method. Examples of reconstructions for synthetic images of surfaces are provided, and compared with ground truth. The method is defined for orthographic views, but can be generalised to perspective views simply.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a shape from texture method that constructs a maximum a posteriori estimate of surface coefficients using both the deformation of individual texture elements - as in local methods - and the overall distribution of elements - as in global methods. The method described applies to a much larger family of textures than any previous method, local or global. We demonstrate an analogy with shape from shading, and use this to produce a numerical method. Examples of reconstructions for synthetic images of surfaces are provided, and compared with ground truth. The method is defined for orthographic views, but can be generalised to perspective views simply.",
"fno": "114320447",
"keywords": [
"Shape From Texture",
"Texture",
"Computer Vision",
"Surface Fitting"
],
"authors": [
{
"affiliation": "U.C. Berkeley",
"fullName": "D. A. Forsyth",
"givenName": "D. A.",
"surname": "Forsyth",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2001-07-01T00:00:00",
"pubType": "proceedings",
"pages": "447",
"year": "2001",
"issn": null,
"isbn": "0-7695-1143-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "114320439",
"articleId": "12OmNvUsonD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "114320454",
"articleId": "12OmNwDAC8K",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"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/cvpr/1992/2855/0/00223260",
"title": "Shape-from-texture by wavelet-based measurement of local spectral moments",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223260/12OmNs0C9RR",
"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/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/iscid/2010/4198/1/4198a007",
"title": "Haptic Texture Rendering Using Single Texture Image",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2010/4198a007/12OmNxbmSBq",
"parentPublication": {
"id": "proceedings/iscid/2010/4198/1",
"title": "Computational Intelligence and Design, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2003/04/v0512",
"title": "Texture Synthesis for 3D Shape Representation",
"doi": null,
"abstractUrl": "/journal/tg/2003/04/v0512/13rRUEgarsB",
"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/1995/07/i0713",
"title": "Adaptive Scale Filtering: A General Method for Obtaining Shape From Texture",
"doi": null,
"abstractUrl": "/journal/tp/1995/07/i0713/13rRUxNW1UG",
"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"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800a419",
"title": "Toward a Universal Model for Shape From Texture",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800a419/1m3nOZmiKWc",
"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": "12OmNzQhP77",
"title": "Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "1996",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvjgWBc",
"doi": "10.1109/CVPR.1996.517106",
"title": "Illumination and geometry invariant recognition of texture in color images",
"normalizedTitle": "Illumination and geometry invariant recognition of texture in color images",
"abstract": "We develop a method for recognizing color texture independent of rotation, scale, and illumination. Color texture is modeled using spatial correlation functions defined within and between sensor bands. Using a linear model for surface spectral reflectance with the same number of parameters as the number of sensor classes, we show that illumination and geometry changes in the scene correspond to a linear transformation of the correlation functions and a linear transformation of their coordinates. A several step algorithm which includes scale estimation and correlation moment computation is used to achieve the invariance. The key to the method is the new result that illumination and geometry changes in the scene correspond to a specific transformation of correlation function Zernike moment matrices. These matrices can be estimated from a color image. This relationship is used to derive an efficient algorithm for recognition. The algorithm is substantiated using classification results on over 200 images of color textures obtained under various illumination conditions and geometric configurations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We develop a method for recognizing color texture independent of rotation, scale, and illumination. Color texture is modeled using spatial correlation functions defined within and between sensor bands. Using a linear model for surface spectral reflectance with the same number of parameters as the number of sensor classes, we show that illumination and geometry changes in the scene correspond to a linear transformation of the correlation functions and a linear transformation of their coordinates. A several step algorithm which includes scale estimation and correlation moment computation is used to achieve the invariance. The key to the method is the new result that illumination and geometry changes in the scene correspond to a specific transformation of correlation function Zernike moment matrices. These matrices can be estimated from a color image. This relationship is used to derive an efficient algorithm for recognition. The algorithm is substantiated using classification results on over 200 images of color textures obtained under various illumination conditions and geometric configurations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We develop a method for recognizing color texture independent of rotation, scale, and illumination. Color texture is modeled using spatial correlation functions defined within and between sensor bands. Using a linear model for surface spectral reflectance with the same number of parameters as the number of sensor classes, we show that illumination and geometry changes in the scene correspond to a linear transformation of the correlation functions and a linear transformation of their coordinates. A several step algorithm which includes scale estimation and correlation moment computation is used to achieve the invariance. The key to the method is the new result that illumination and geometry changes in the scene correspond to a specific transformation of correlation function Zernike moment matrices. These matrices can be estimated from a color image. This relationship is used to derive an efficient algorithm for recognition. The algorithm is substantiated using classification results on over 200 images of color textures obtained under various illumination conditions and geometric configurations.",
"fno": "72580419",
"keywords": [
"Image Texture Image Recognition Color Images Recognition Of Texture Geometry Invariant Color Texture Spatial Correlation Functions Scale Estimation Correlation Moment Color Textures Illumination Conditions Correlation Moment Computation Invariance"
],
"authors": [
{
"affiliation": "Comput. Vision Lab., California Univ., Irvine, CA, USA",
"fullName": "L. Wang",
"givenName": "L.",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Comput. Vision Lab., California Univ., Irvine, CA, USA",
"fullName": "G. Healey",
"givenName": "G.",
"surname": "Healey",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1996-06-01T00:00:00",
"pubType": "proceedings",
"pages": "419",
"year": "1996",
"issn": "1063-6919",
"isbn": "0-8186-7258-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "72580411",
"articleId": "12OmNwlqhQd",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "72580425",
"articleId": "12OmNqIQScm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyKJiaV",
"title": "Pattern Recognition, International Conference on",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxzuML9",
"doi": "10.1109/ICPR.2010.216",
"title": "Natural Material Recognition with Illumination Invariant Textural Features",
"normalizedTitle": "Natural Material Recognition with Illumination Invariant Textural Features",
"abstract": "A visual appearance of natural materials fundamentally depends on illumination conditions, which significantly complicates a real scene analysis. We propose textural features based on fast Markovian statistics, which are simultaneously invariant to illumination colour and robust to illumination direction. No knowledge of illumination conditions is required and a recognition is possible from a single training image per material. Material recognition is tested on the currently most realistic visual representation - Bidirectional Texture Function (BTF), using the Amsterdam Library of Textures (ALOT), which contains 250 natural materials acquired in different illumination conditions. Our proposed features significantly outperform several leading alternatives including Local Binary Patterns (LBP, LBP-HF) and Gabor features.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A visual appearance of natural materials fundamentally depends on illumination conditions, which significantly complicates a real scene analysis. We propose textural features based on fast Markovian statistics, which are simultaneously invariant to illumination colour and robust to illumination direction. No knowledge of illumination conditions is required and a recognition is possible from a single training image per material. Material recognition is tested on the currently most realistic visual representation - Bidirectional Texture Function (BTF), using the Amsterdam Library of Textures (ALOT), which contains 250 natural materials acquired in different illumination conditions. Our proposed features significantly outperform several leading alternatives including Local Binary Patterns (LBP, LBP-HF) and Gabor features.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A visual appearance of natural materials fundamentally depends on illumination conditions, which significantly complicates a real scene analysis. We propose textural features based on fast Markovian statistics, which are simultaneously invariant to illumination colour and robust to illumination direction. No knowledge of illumination conditions is required and a recognition is possible from a single training image per material. Material recognition is tested on the currently most realistic visual representation - Bidirectional Texture Function (BTF), using the Amsterdam Library of Textures (ALOT), which contains 250 natural materials acquired in different illumination conditions. Our proposed features significantly outperform several leading alternatives including Local Binary Patterns (LBP, LBP-HF) and Gabor features.",
"fno": "4109a858",
"keywords": [
"Texture",
"Colour",
"Markov Random Field",
"Illumination Invariance"
],
"authors": [
{
"affiliation": null,
"fullName": "Pavel Vácha",
"givenName": "Pavel",
"surname": "Vácha",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Michal Haindl",
"givenName": "Michal",
"surname": "Haindl",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-08-01T00:00:00",
"pubType": "proceedings",
"pages": "858-861",
"year": "2010",
"issn": "1051-4651",
"isbn": "978-0-7695-4109-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4109a854",
"articleId": "12OmNyxFKiL",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4109a862",
"articleId": "12OmNBr4epW",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/2005/2372/2/237220010",
"title": "Illumination-Invariant Tracking via Graph Cuts",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2005/237220010/12OmNA0MZ00",
"parentPublication": {
"id": "proceedings/cvpr/2005/2372/2",
"title": "2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2009/3893/0/3893a109",
"title": "Mutual Illumination Correction for Compositing and Material Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2009/3893a109/12OmNAPSMmu",
"parentPublication": {
"id": "proceedings/cvmp/2009/3893/0",
"title": "2009 Conference for Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2017/4822/0/07926617",
"title": "Material Classification under Natural Illumination Using Reflectance Maps",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2017/07926617/12OmNBLvlK9",
"parentPublication": {
"id": "proceedings/wacv/2017/4822/0",
"title": "2017 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1996/7258/0/72580419",
"title": "Illumination and geometry invariant recognition of texture in color images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1996/72580419/12OmNvjgWBc",
"parentPublication": {
"id": "proceedings/cvpr/1996/7258/0",
"title": "Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761375",
"title": "Illumination invariants based on Markov random fields",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761375/12OmNvkplcd",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1995/7310/3/73103620",
"title": "Illumination invariant object recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1995/73103620/12OmNwtEEJl",
"parentPublication": {
"id": "proceedings/icip/1995/7310/3",
"title": "Image Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1999/0164/2/01640861",
"title": "Spectral Gradient: A Material Descriptor Invariant to Geometry and Incident Illumination",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1999/01640861/12OmNy4r42f",
"parentPublication": {
"id": "proceedings/iccv/1999/0164/2",
"title": "Proceedings of the Seventh IEEE International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420128",
"title": "The illumination-invariant recognition of color texture",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420128/12OmNz61cYg",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460569",
"title": "Predicting environment illumination effects on material appearance",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460569/12OmNzdoMQp",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2018/8425/0/842500a022",
"title": "Joint Material and Illumination Estimation from Photo Sets in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2018/842500a022/17D45XuDNHq",
"parentPublication": {
"id": "proceedings/3dv/2018/8425/0",
"title": "2018 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyKJiaV",
"title": "Pattern Recognition, International Conference on",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy49sQQ",
"doi": "10.1109/ICPR.2010.219",
"title": "Illumination Estimation of 3D Surface Texture Based on Active Basis",
"normalizedTitle": "Illumination Estimation of 3D Surface Texture Based on Active Basis",
"abstract": "This paper describes an approach to estimate illumination directions of 3D surface texture based on Active Basis. Instead of applying Gabor wavelet transform to extract texture features, we represent our texture features with a simple Haar feature to improve efficiency. The Active Basis model can be learned from training image patches by the shared pursuit algorithm. The base histogram can then be obtained based on each model. We measure the illumination directions by minimizing the Euclidean distance and the entropy difference of base histograms between the test image and the training sets. Experimental results demonstrate the effectiveness and accuracy of the proposed approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper describes an approach to estimate illumination directions of 3D surface texture based on Active Basis. Instead of applying Gabor wavelet transform to extract texture features, we represent our texture features with a simple Haar feature to improve efficiency. The Active Basis model can be learned from training image patches by the shared pursuit algorithm. The base histogram can then be obtained based on each model. We measure the illumination directions by minimizing the Euclidean distance and the entropy difference of base histograms between the test image and the training sets. Experimental results demonstrate the effectiveness and accuracy of the proposed approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper describes an approach to estimate illumination directions of 3D surface texture based on Active Basis. Instead of applying Gabor wavelet transform to extract texture features, we represent our texture features with a simple Haar feature to improve efficiency. The Active Basis model can be learned from training image patches by the shared pursuit algorithm. The base histogram can then be obtained based on each model. We measure the illumination directions by minimizing the Euclidean distance and the entropy difference of base histograms between the test image and the training sets. Experimental results demonstrate the effectiveness and accuracy of the proposed approach.",
"fno": "4109a870",
"keywords": [
"3 D Surface Texture",
"Illumination Estimation",
"Active Basis",
"Feature Extraction"
],
"authors": [
{
"affiliation": null,
"fullName": "Junyu Dong",
"givenName": "Junyu",
"surname": "Dong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Liyuan Su",
"givenName": "Liyuan",
"surname": "Su",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Yuanxu Duan",
"givenName": "Yuanxu",
"surname": "Duan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-08-01T00:00:00",
"pubType": "proceedings",
"pages": "870-873",
"year": "2010",
"issn": "1051-4651",
"isbn": "978-0-7695-4109-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4109a866",
"articleId": "12OmNzcxZox",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4109a874",
"articleId": "12OmNB7cjlN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cisp/2008/3119/2/3119b145",
"title": "Super Resolution of 3D Surface Texture Based on Eigen Images",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119b145/12OmNBC8AAT",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/3",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscsct/2008/3498/2/3498b230",
"title": "3D Surface Texture Synthesis Based on Wavelet Transform",
"doi": null,
"abstractUrl": "/proceedings-article/iscsct/2008/3498b230/12OmNBRsVxV",
"parentPublication": {
"id": "proceedings/iscsct/2008/3498/1",
"title": "2008 International Symposium on Computer Science and Computational Technology (ISCSCT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761389",
"title": "Directionality measurement and illumination estimation of 3D surface textures by using mojette transform",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761389/12OmNCbU3c0",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1996/7258/0/72580419",
"title": "Illumination and geometry invariant recognition of texture in color images",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1996/72580419/12OmNvjgWBc",
"parentPublication": {
"id": "proceedings/cvpr/1996/7258/0",
"title": "Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1994/6265/1/00576247",
"title": "Microscopic shape from focus using active illumination",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1994/00576247/12OmNxE2n2r",
"parentPublication": {
"id": "proceedings/icpr/1994/6265/1",
"title": "Proceedings of 12th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109a858",
"title": "Natural Material Recognition with Illumination Invariant Textural Features",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a858/12OmNxzuML9",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284896",
"title": "Hole Filling on Three-Dimensional Surface Texture",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284896/12OmNy4IF6j",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1995/7042/0/70420128",
"title": "The illumination-invariant recognition of color texture",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1995/70420128/12OmNz61cYg",
"parentPublication": {
"id": "proceedings/iccv/1995/7042/0",
"title": "Computer Vision, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/11/ttp2009111921",
"title": "Bidirectional Texture Function Modeling: A State of the Art Survey",
"doi": null,
"abstractUrl": "/journal/tp/2009/11/ttp2009111921/13rRUwdIOTj",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111836",
"title": "Statistical Invariance for Texture Synthesis",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111836/13rRUygT7ya",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzYeB3H",
"title": "11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "1992",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzFMFjP",
"doi": "10.1109/ICPR.1992.201924",
"title": "Moment based texture segmentation",
"normalizedTitle": "Moment based texture segmentation",
"abstract": "Texture segmentation is one of the early steps towards identifying surfaces and objects in an image. In the paper a moment based texture segmentation algorithm is presented. The moments in small windows of the image are used as texture features which are then used to segment the textures. The algorithm has successfully segmented binary images containing textures with identical second-order statistics as well as a number of natural gray level texture images.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "Texture segmentation is one of the early steps towards identifying surfaces and objects in an image. In the paper a moment based texture segmentation algorithm is presented. The moments in small windows of the image are used as texture features which are then used to segment the textures. The algorithm has successfully segmented binary images containing textures with identical second-order statistics as well as a number of natural gray level texture images.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Texture segmentation is one of the early steps towards identifying surfaces and objects in an image. In the paper a moment based texture segmentation algorithm is presented. The moments in small windows of the image are used as texture features which are then used to segment the textures. The algorithm has successfully segmented binary images containing textures with identical second-order statistics as well as a number of natural gray level texture images.",
"fno": "00201924",
"keywords": [
"Image Segmentation",
"Image Texture",
"Image Segmentation",
"Moment Based Texture Segmentation",
"Texture Features",
"Binary Images",
"Second Order Statistics",
"Natural Gray Level Texture Images",
"Image Segmentation",
"Signal Processing Algorithms",
"Surface Texture",
"Image Texture Analysis",
"Pixel",
"Clustering Algorithms",
"Flowcharts",
"Computer Science",
"Machine Vision",
"Focusing"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA",
"fullName": "M. Tuceryan",
"givenName": "M.",
"surname": "Tuceryan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1992-01-01T00:00:00",
"pubType": "proceedings",
"pages": "45-48",
"year": "1992",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00201923",
"articleId": "12OmNvT2pdG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00201925",
"articleId": "12OmNxAlA2k",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icnc/2008/3304/5/3304e433",
"title": "An Segmentation Algorithm of Texture Image Based on DWT",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2008/3304e433/12OmNBRbksN",
"parentPublication": {
"id": "proceedings/icnc/2008/3304/5",
"title": "2008 Fourth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iai/1994/6250/0/00336692",
"title": "Analysis of texture images using robust fractal description",
"doi": null,
"abstractUrl": "/proceedings-article/iai/1994/00336692/12OmNBqMDfq",
"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/compsac/2001/1372/0/13720569",
"title": "An Unsupervised Segmentation Framework For Texture Image Queries",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2001/13720569/12OmNqBKUex",
"parentPublication": {
"id": "proceedings/compsac/2001/1372/0",
"title": "25th Annual International Computer Software and Applications Conference. COMPSAC 2001",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284985",
"title": "Color Distribution Evenness and its Application to Color-Texture Segmentation",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284985/12OmNvjgWoV",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csie/2009/3507/4/3507d199",
"title": "Image Retrieval Based on Texture Subspace Orthogonal Projection with Wavelet Frames",
"doi": null,
"abstractUrl": "/proceedings-article/csie/2009/3507d199/12OmNxA3YS9",
"parentPublication": {
"id": "proceedings/csie/2009/3507/4",
"title": "Computer Science and Information Engineering, World Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1990/2062/2/00119439",
"title": "Texture segmentation on two high-performance computers",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1990/00119439/12OmNy6HQTj",
"parentPublication": {
"id": "proceedings/icpr/1990/2062/2",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1988/0862/0/00196220",
"title": "Texture segmentation using Voronoi polygons",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1988/00196220/12OmNyOq4Th",
"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/ic4e/2010/5680/0/05432381",
"title": "Using FCM for Color Texture Segmentation Based Multirscale Image Fusion",
"doi": null,
"abstractUrl": "/proceedings-article/ic4e/2010/05432381/12OmNzBOhxz",
"parentPublication": {
"id": "proceedings/ic4e/2010/5680/0",
"title": "2010 International Conference on e-Education, e-Business, e-Management, and e-Learning, (IC4E)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/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/tp/1994/01/i0080",
"title": "N-folded Symmetries by Complex Moments in Gabor Space and their Application to Unsupervised Texture Segmentation",
"doi": null,
"abstractUrl": "/journal/tp/1994/01/i0080/13rRUwIF6ai",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxE2mWi",
"title": "2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "2",
"displayVolume": "3",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBp52wc",
"doi": "10.1109/CVPR.2003.1211536",
"title": "Simultaneous Structure and Texture Image Inpainting",
"normalizedTitle": "Simultaneous Structure and Texture Image Inpainting",
"abstract": "An algorithm for the simultaneous filling-in of texture and structure in regions of missing image information is presented in this paper. The basic idea is to first decompose the image into the sum of two functions with different basic characteristics, and then reconstruct each one of these functions separately with structure and texture filling-in algorithms. The first function used in the decomposition is of bounded variation, representing the underlying image structure, while the second function captures the texture and possible noise. The region of missing information in the bounded variation image is reconstructed using image in-painting algorithms, while the same region in the texture image is filled-in with texture synthesis techniques. The original image is then reconstructed adding back these two sub-images. The novel contribution of this paper is then in the combination of these three previously developed components, image decomposition with inpainting and texture synthesis, which permits the simultaneous use of filling-in algorithms that are suited for different image characteristics. Examples on real images show the advantages of this proposed approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An algorithm for the simultaneous filling-in of texture and structure in regions of missing image information is presented in this paper. The basic idea is to first decompose the image into the sum of two functions with different basic characteristics, and then reconstruct each one of these functions separately with structure and texture filling-in algorithms. The first function used in the decomposition is of bounded variation, representing the underlying image structure, while the second function captures the texture and possible noise. The region of missing information in the bounded variation image is reconstructed using image in-painting algorithms, while the same region in the texture image is filled-in with texture synthesis techniques. The original image is then reconstructed adding back these two sub-images. The novel contribution of this paper is then in the combination of these three previously developed components, image decomposition with inpainting and texture synthesis, which permits the simultaneous use of filling-in algorithms that are suited for different image characteristics. Examples on real images show the advantages of this proposed approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An algorithm for the simultaneous filling-in of texture and structure in regions of missing image information is presented in this paper. The basic idea is to first decompose the image into the sum of two functions with different basic characteristics, and then reconstruct each one of these functions separately with structure and texture filling-in algorithms. The first function used in the decomposition is of bounded variation, representing the underlying image structure, while the second function captures the texture and possible noise. The region of missing information in the bounded variation image is reconstructed using image in-painting algorithms, while the same region in the texture image is filled-in with texture synthesis techniques. The original image is then reconstructed adding back these two sub-images. The novel contribution of this paper is then in the combination of these three previously developed components, image decomposition with inpainting and texture synthesis, which permits the simultaneous use of filling-in algorithms that are suited for different image characteristics. Examples on real images show the advantages of this proposed approach.",
"fno": "190020707",
"keywords": [
"Inpainting",
"Filling In",
"Structure",
"Texture",
"Texture Synthesis",
"Bounded Variation",
"Image Decomposition"
],
"authors": [
{
"affiliation": "University Pompeu Fabra, University of Minnesota, UCLA",
"fullName": "M. Bertalmio",
"givenName": "M.",
"surname": "Bertalmio",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University Pompeu Fabra, University of Minnesota, UCLA",
"fullName": "L. Vese",
"givenName": "L.",
"surname": "Vese",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University Pompeu Fabra, University of Minnesota, UCLA",
"fullName": "G. Sapiro",
"givenName": "G.",
"surname": "Sapiro",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University Pompeu Fabra, University of Minnesota, UCLA",
"fullName": "S. Osher",
"givenName": "S.",
"surname": "Osher",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-06-01T00:00:00",
"pubType": "proceedings",
"pages": "707",
"year": "2003",
"issn": "1063-6919",
"isbn": "0-7695-1900-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "190020699",
"articleId": "12OmNrHB1Yk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "190020713",
"articleId": "12OmNvAAtrP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icig/2011/4541/0/4541a199",
"title": "Structure-Aware Image Completion with Texture Propagation",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2011/4541a199/12OmNBTJIAX",
"parentPublication": {
"id": "proceedings/icig/2011/4541/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ifita/2009/3600/3/3600c079",
"title": "A New Oriented-Diffusion Image Inpainting Framework for Striped Texture Images",
"doi": null,
"abstractUrl": "/proceedings-article/ifita/2009/3600c079/12OmNBgQFL9",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2000/0909/0/09090147",
"title": "Texture image segmentation method based on multilayer CNN",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2000/09090147/12OmNqFrGu0",
"parentPublication": {
"id": "proceedings/ictai/2000/0909/0",
"title": "Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2007/2794/0/04118740",
"title": "Interactive Image Repair with Assisted Structure and Texture Completion",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2007/04118740/12OmNvjgWvC",
"parentPublication": {
"id": "proceedings/wacv/2007/2794/0",
"title": "Applications of Computer Vision, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgi/2003/1946/0/19460120",
"title": "Image Restoration using Multiresolution Texture Synthesis and Image Inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2003/19460120/12OmNxA3Z5z",
"parentPublication": {
"id": "proceedings/cgi/2003/1946/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iwcse/2009/3881/2/3881b026",
"title": "A Novel Non-local Image Inpainting Algorithm: Fractal-Based Image Inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/iwcse/2009/3881b026/12OmNxvNZYh",
"parentPublication": {
"id": "proceedings/iwcse/2009/3881/2",
"title": "Computer Science and Engineering, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mmit/2008/3556/0/3556a272",
"title": "TV-Based Texture Image Inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/mmit/2008/3556a272/12OmNy3RRMP",
"parentPublication": {
"id": "proceedings/mmit/2008/3556/0",
"title": "MultiMedia and Information Technology, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2007/1016/0/04284896",
"title": "Hole Filling on Three-Dimensional Surface Texture",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2007/04284896/12OmNy4IF6j",
"parentPublication": {
"id": "proceedings/icme/2007/1016/0",
"title": "2007 International Conference on Multimedia & Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2010/04/ttp2010040733",
"title": "Texture Synthesis with Grouplets",
"doi": null,
"abstractUrl": "/journal/tp/2010/04/ttp2010040733/13rRUx0xQ0D",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200o4114",
"title": "Image Inpainting via Conditional Texture and Structure Dual Generation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200o4114/1BmI66FDsHe",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNz4BdvV",
"title": "2012 IEEE International Conference on Multimedia & Expo Workshops (ICMEW 2012)",
"acronym": "icmew",
"groupId": "1801805",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAle6Go",
"doi": "10.1109/ICMEW.2012.41",
"title": "OVIE: Object Oriented and Vector based Image Editing",
"normalizedTitle": "OVIE: Object Oriented and Vector based Image Editing",
"abstract": "A powerful image editing system called OVIE is described, which provides fast and accurate creation, composition, rendering and other manipulation of image contents. Flexibility and convenience of the system are achieved by including two modules: image decomposition and image vectorization to understand and represent an image respectively. To understand an image comprehensively, we propose to integrate image segmentation, shape completion and image completion techniques to ensure a seamless image editing. An array of pixels is replaced by vector data with geometric edit ability for image representation since the geometrically-based editing has physical meanings and thus it is more natural or intuitive for users to edit. Compared to the existing works, our system is more convenient and can generate effects with higher quality.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A powerful image editing system called OVIE is described, which provides fast and accurate creation, composition, rendering and other manipulation of image contents. Flexibility and convenience of the system are achieved by including two modules: image decomposition and image vectorization to understand and represent an image respectively. To understand an image comprehensively, we propose to integrate image segmentation, shape completion and image completion techniques to ensure a seamless image editing. An array of pixels is replaced by vector data with geometric edit ability for image representation since the geometrically-based editing has physical meanings and thus it is more natural or intuitive for users to edit. Compared to the existing works, our system is more convenient and can generate effects with higher quality.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A powerful image editing system called OVIE is described, which provides fast and accurate creation, composition, rendering and other manipulation of image contents. Flexibility and convenience of the system are achieved by including two modules: image decomposition and image vectorization to understand and represent an image respectively. To understand an image comprehensively, we propose to integrate image segmentation, shape completion and image completion techniques to ensure a seamless image editing. An array of pixels is replaced by vector data with geometric edit ability for image representation since the geometrically-based editing has physical meanings and thus it is more natural or intuitive for users to edit. Compared to the existing works, our system is more convenient and can generate effects with higher quality.",
"fno": "06266255",
"keywords": [
"Geometry",
"Image Representation",
"Image Segmentation",
"Object Oriented Methods",
"Rendering Computer Graphics",
"OVIE",
"Object Oriented And Vector Based Image Editing",
"Image Content Creation",
"Image Content Composition",
"Image Content Rendering",
"Image Content Manipulation",
"Image Decomposition",
"Image Vectorization",
"Image Representation",
"Image Segmentation",
"Shape Completion",
"Image Completion Techniques",
"Vector Data",
"Geometrically Based Editing",
"Vectors",
"Shape",
"Image Segmentation",
"Image Color Analysis",
"Image Representation",
"Educational Institutions",
"Image Editing",
"Image Segmentation",
"Image Completion",
"Shape Completion",
"Image Vectorization"
],
"authors": [
{
"affiliation": null,
"fullName": "Hailing Zhou",
"givenName": "Hailing",
"surname": "Zhou",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jianmin Zheng",
"givenName": "Jianmin",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lei Wei",
"givenName": "Lei",
"surname": "Wei",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icmew",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-07-01T00:00:00",
"pubType": "proceedings",
"pages": "199-204",
"year": "2012",
"issn": null,
"isbn": "978-1-4673-2027-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "06266254",
"articleId": "12OmNwp74zW",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "06266256",
"articleId": "12OmNzBOhuV",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "mags/mu/2012/01/mmu2012010029",
"title": "Profiling Online Auction Sellers Using Image-Editing Styles",
"doi": null,
"abstractUrl": "/magazine/mu/2012/01/mmu2012010029/13rRUEgary3",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2001/03/i0291",
"title": "Image Editing in the Contour Domain",
"doi": null,
"abstractUrl": "/journal/tp/2001/03/i0291/13rRUwbs1Tw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111858",
"title": "A Subdivision-Based Representation for Vector Image Editing",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111858/13rRUxcbnCp",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000i721",
"title": "Language-Based Image Editing with Recurrent Attentive Models",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000i721/17D45XDIXS3",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200c095",
"title": "Language-Guided Global Image Editing via Cross-Modal Cyclic Mechanism",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200c095/1BmHyuLeqVa",
"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/694600t9698",
"title": "SpaceEdit: Learning a Unified Editing Space for Open-Domain Image Color Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600t9698/1H0NEEhuv7O",
"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/694600l1244",
"title": "SemanticStyleGAN: Learning Compositional Generative Priors for Controllable Image Synthesis and Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600l1244/1H1iqwloCOY",
"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/cvprw/2019/2506/0/250600a790",
"title": "Changing the Image Memorability: From Basic Photo Editing to GANs",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600a790/1iTvvnRpWKc",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150772",
"title": "Semantic Pixel Distances for Image Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150772/1lPH56i20AU",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/mu/2021/04/09392312",
"title": "LFI-Augmenter: Intelligent Light Field Image Editing With Interleaved Spatial-Angular Convolution",
"doi": null,
"abstractUrl": "/magazine/mu/2021/04/09392312/1sq7wcFIASI",
"parentPublication": {
"id": "mags/mu",
"title": "IEEE MultiMedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBSBk5H",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"acronym": "cadgraphics",
"groupId": "1001488",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvFpEx5",
"doi": "10.1109/CAD/Graphics.2011.77",
"title": "A Tangent Vector Based Nonlinear Subdivision Scheme without Self-Intersection for Curve Design",
"normalizedTitle": "A Tangent Vector Based Nonlinear Subdivision Scheme without Self-Intersection for Curve Design",
"abstract": "In this paper, we proposed a nonlinear subdivision scheme based on tangent vector, with the purpose of offsetting the deficiencies of Dyn's 4-point method and other classical linear subdivision schemes in the control of shape of subdivision curves. This method has a clear geometric meaning and the property of convexity preserving. Theoretical analysis show that the limit curve of this method is G1 continuous without self-intersection. Several examples are given to show the effectiveness of the scheme.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we proposed a nonlinear subdivision scheme based on tangent vector, with the purpose of offsetting the deficiencies of Dyn's 4-point method and other classical linear subdivision schemes in the control of shape of subdivision curves. This method has a clear geometric meaning and the property of convexity preserving. Theoretical analysis show that the limit curve of this method is G1 continuous without self-intersection. Several examples are given to show the effectiveness of the scheme.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we proposed a nonlinear subdivision scheme based on tangent vector, with the purpose of offsetting the deficiencies of Dyn's 4-point method and other classical linear subdivision schemes in the control of shape of subdivision curves. This method has a clear geometric meaning and the property of convexity preserving. Theoretical analysis show that the limit curve of this method is G1 continuous without self-intersection. Several examples are given to show the effectiveness of the scheme.",
"fno": "4497a268",
"keywords": [
"Subdivision Curve",
"Nonlinear Subdivision Scheme",
"Tangent Vector",
"G 1 Continuous"
],
"authors": [
{
"affiliation": null,
"fullName": "Dekong Liu",
"givenName": "Dekong",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hongchan Zheng",
"givenName": "Hongchan",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cadgraphics",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-09-01T00:00:00",
"pubType": "proceedings",
"pages": "268-271",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4497-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4497a262",
"articleId": "12OmNwMFMkz",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4497a275",
"articleId": "12OmNzC5SEo",
"__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/gmp/2004/2078/0/20780379",
"title": "Interpolatory Convexity Preserving Subdivision Schemes for Curves",
"doi": null,
"abstractUrl": "/proceedings-article/gmp/2004/20780379/12OmNBtl1wK",
"parentPublication": {
"id": "proceedings/gmp/2004/2078/0",
"title": "Geometric Modeling and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200ying",
"title": "Nonmanifold Subdivision",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200ying/12OmNBuL14k",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmai/2008/3270/0/3270a003",
"title": "Chapter 1: Three Point Stationary and Non-stationary Subdivision Schemes",
"doi": null,
"abstractUrl": "/proceedings-article/gmai/2008/3270a003/12OmNwDACtp",
"parentPublication": {
"id": "proceedings/gmai/2008/3270/0",
"title": "Geometric Modeling and Imaging--New Trends",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cad-cg/2005/2473/0/24730119",
"title": "Adaptive Refinement Scheme for Subdivision Surfaces based on Triangular Meshes",
"doi": null,
"abstractUrl": "/proceedings-article/cad-cg/2005/24730119/12OmNwwd2I6",
"parentPublication": {
"id": "proceedings/cad-cg/2005/2473/0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicse/2012/4705/0/4705a090",
"title": "Smooth Ternary Subdivision Surfaces with Bounded Curvature",
"doi": null,
"abstractUrl": "/proceedings-article/icicse/2012/4705a090/12OmNyY4rmx",
"parentPublication": {
"id": "proceedings/icicse/2012/4705/0",
"title": "2012 Sixth International Conference on Internet Computing for Science and Engineering",
"__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/2011/04/ttg2011040500",
"title": "Approximation of Loop Subdivision Surfaces for Fast Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2011/04/ttg2011040500/13rRUILtJzt",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/05/v0914",
"title": "√3-Subdivision-Based Biorthogonal Wavelets",
"doi": null,
"abstractUrl": "/journal/tg/2007/05/v0914/13rRUxZ0o1n",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzYeB3H",
"title": "11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,",
"acronym": "icpr",
"groupId": "1000545",
"volume": "0",
"displayVolume": "0",
"year": "1992",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNy4r3Zn",
"doi": "10.1109/ICPR.1992.202021",
"title": "Image representation using vector wavelets",
"normalizedTitle": "Image representation using vector wavelets",
"abstract": "A new layered representation of images is proposed using, what one may call, vector wavelets defined by generalized Hermite polynomials. This representation has some special properties: it is distinct from and superior to the other wavelet schemes of the literature; it is stable; it transforms the image into matrices of coefficients in the same manner as the standard transforms (Fourier, Hadamard and others), but at the specified 'scales'; the zero-crossings of the signal at various scales can be directly obtained from the coefficients; and the size of the resolution cell in the 'phase-space' is variable even at a specified scale, depending on the image being analysed. This representation has been successfully applied to different types of images, both synthetic and natural.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A new layered representation of images is proposed using, what one may call, vector wavelets defined by generalized Hermite polynomials. This representation has some special properties: it is distinct from and superior to the other wavelet schemes of the literature; it is stable; it transforms the image into matrices of coefficients in the same manner as the standard transforms (Fourier, Hadamard and others), but at the specified 'scales'; the zero-crossings of the signal at various scales can be directly obtained from the coefficients; and the size of the resolution cell in the 'phase-space' is variable even at a specified scale, depending on the image being analysed. This representation has been successfully applied to different types of images, both synthetic and natural.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A new layered representation of images is proposed using, what one may call, vector wavelets defined by generalized Hermite polynomials. This representation has some special properties: it is distinct from and superior to the other wavelet schemes of the literature; it is stable; it transforms the image into matrices of coefficients in the same manner as the standard transforms (Fourier, Hadamard and others), but at the specified 'scales'; the zero-crossings of the signal at various scales can be directly obtained from the coefficients; and the size of the resolution cell in the 'phase-space' is variable even at a specified scale, depending on the image being analysed. This representation has been successfully applied to different types of images, both synthetic and natural.",
"fno": "00202021",
"keywords": [
"Image Processing",
"Polynomials",
"Wavelet Transforms",
"Image Representation",
"Image Transformation",
"Signal Zero Crossings",
"Resolution Cell Size",
"Synthetic Images",
"Natural Images",
"Vector Wavelets",
"Layered Representation",
"Generalized Hermite Polynomials",
"Matrices",
"Image Representation",
"Fourier Transforms",
"Wavelet Transforms",
"Polynomials",
"Wavelet Analysis",
"Error Correction",
"Error Correction Codes",
"Image Resolution",
"Signal Resolution",
"Image Analysis"
],
"authors": [
{
"affiliation": "Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India",
"fullName": "Y.V. Venkatesh",
"givenName": "Y.V.",
"surname": "Venkatesh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India",
"fullName": "K. Ramani",
"givenName": "K.",
"surname": "Ramani",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India",
"fullName": "R. Nandini",
"givenName": "R.",
"surname": "Nandini",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1992-01-01T00:00:00",
"pubType": "proceedings",
"pages": "447-450",
"year": "1992",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00202020",
"articleId": "12OmNyaGeJ8",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00202022",
"articleId": "12OmNznCl2c",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvpr/1993/3880/0/00341049",
"title": "Texture discrimination using wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1993/00341049/12OmNvpNIo3",
"parentPublication": {
"id": "proceedings/cvpr/1993/3880/0",
"title": "Proceedings of IEEE Conference on Computer Vision and Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/3/01326514",
"title": "Hidden Markov tree image denoising with redundant lapped transforms",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326514/12OmNx5piPt",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/3",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dcc/2011/279/0/05749504",
"title": "Multi-resolution Analysis Using Symmetrized Odd and Even DCT Transforms",
"doi": null,
"abstractUrl": "/proceedings-article/dcc/2011/05749504/12OmNxzuMAY",
"parentPublication": {
"id": "proceedings/dcc/2011/279/0",
"title": "2011 Data Compression Conference (DCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1994/6952/2/00413687",
"title": "Multiresolution tomographic reconstruction using wavelets",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1994/00413687/12OmNyRxFIT",
"parentPublication": {
"id": "proceedings/icip/1994/6952/2",
"title": "Proceedings of 1st International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acssc/1992/3160/0/00269105",
"title": "Wavelets and image compression",
"doi": null,
"abstractUrl": "/proceedings-article/acssc/1992/00269105/12OmNyaoDwd",
"parentPublication": {
"id": "proceedings/acssc/1992/3160/0",
"title": "Conference Record of the Twenty-Sixth Asilomar Conference on Signals, Systems & Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmlc/2003/7865/5/01260054",
"title": "Multifocus image fusion in wavelet domain",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2003/01260054/12OmNyo1nSH",
"parentPublication": {
"id": "proceedings/icmlc/2003/7865/1",
"title": "Proceedings of the 2003 International Conference on Machine Learning and Cybernetics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/2/01326417",
"title": "Non-redundant, linear-phase, semi-orthogonal, directional complex wavelets [image/video processing applications]",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326417/12OmNzYwcbv",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/2",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1990/2057/0/00139587",
"title": "Compact image representation from multiscale edges",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1990/00139587/12OmNzcPAjp",
"parentPublication": {
"id": "proceedings/iccv/1990/2057/0",
"title": "Proceedings Third International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isspit/2008/3554/0/04775695",
"title": "Interscale statistical models for wavelet-based image retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2008/04775695/12OmNzcxZdd",
"parentPublication": {
"id": "proceedings/isspit/2008/3554/0",
"title": "2008 8th IEEE International Symposium on Signal Processing and Information Technology. ISSPIT 2008",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1996/02/v0130",
"title": "Efficient triangular surface approximations using wavelets and quadtree data structures",
"doi": null,
"abstractUrl": "/journal/tg/1996/02/v0130/13rRUxASuv5",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNCmpcMP",
"title": "IEEE International Conference on Computational Photography (ICCP)",
"acronym": "iccp",
"groupId": "1800125",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzcPAil",
"doi": "10.1109/ICCPHOT.2011.5753125",
"title": "Display-aware image editing",
"normalizedTitle": "Display-aware image editing",
"abstract": "We describe a set of image editing and viewing tools that explicitly take into account the resolution of the display on which the image is viewed. Our approach is twofold. First, we design editing tools that process only the visible data, which is useful for images larger than the display. This encompasses cases such as multi-image panoramas and high-resolution medical data. Second, we propose an adaptive way to set viewing parameters such brightness and contrast. Because we deal with very large images, different locations and scales often require different viewing parameters. We let users set these parameters at a few places and interpolate satisfying values everywhere else. We demonstrate the efficiency of our approach on different display and image sizes. Since the computational complexity to render a view depends on the display resolution and not the actual input image resolution, we achieve interactive image editing even on a 16 gigapixel image.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe a set of image editing and viewing tools that explicitly take into account the resolution of the display on which the image is viewed. Our approach is twofold. First, we design editing tools that process only the visible data, which is useful for images larger than the display. This encompasses cases such as multi-image panoramas and high-resolution medical data. Second, we propose an adaptive way to set viewing parameters such brightness and contrast. Because we deal with very large images, different locations and scales often require different viewing parameters. We let users set these parameters at a few places and interpolate satisfying values everywhere else. We demonstrate the efficiency of our approach on different display and image sizes. Since the computational complexity to render a view depends on the display resolution and not the actual input image resolution, we achieve interactive image editing even on a 16 gigapixel image.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe a set of image editing and viewing tools that explicitly take into account the resolution of the display on which the image is viewed. Our approach is twofold. First, we design editing tools that process only the visible data, which is useful for images larger than the display. This encompasses cases such as multi-image panoramas and high-resolution medical data. Second, we propose an adaptive way to set viewing parameters such brightness and contrast. Because we deal with very large images, different locations and scales often require different viewing parameters. We let users set these parameters at a few places and interpolate satisfying values everywhere else. We demonstrate the efficiency of our approach on different display and image sizes. Since the computational complexity to render a view depends on the display resolution and not the actual input image resolution, we achieve interactive image editing even on a 16 gigapixel image.",
"fno": "05753125",
"keywords": [
"Data Visualisation",
"Image Resolution",
"Rendering Computer Graphics",
"Display Aware Image Editing",
"Image Viewing Tools",
"Display Resolution",
"Viewing Parameters",
"Display Sizes",
"Image Sizes",
"Computational Complexity",
"Image Render",
"Image Resolution",
"Pixel",
"Histograms",
"Brightness",
"Tiles",
"Cloning",
"Interpolation"
],
"authors": [
{
"affiliation": "Harvard University, USA",
"fullName": "Won-Ki Jeong",
"givenName": "Won-Ki",
"surname": "Jeong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Massachusetts Institute of Technology, USA",
"fullName": "Micah K. Johnson",
"givenName": "Micah K.",
"surname": "Johnson",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University College London, USA",
"fullName": "Insu Yu",
"givenName": null,
"surname": "Insu Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University College London, USA",
"fullName": "Jan Kautz",
"givenName": "Jan",
"surname": "Kautz",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Harvard University, USA",
"fullName": "Hanspeter Pfister",
"givenName": "Hanspeter",
"surname": "Pfister",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Adobe Systems, Inc., USA",
"fullName": "Sylvain Paris",
"givenName": "Sylvain",
"surname": "Paris",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-04-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2011",
"issn": null,
"isbn": "978-1-61284-707-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05753124",
"articleId": "12OmNxFsmGD",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05753126",
"articleId": "12OmNwpGgHw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/e-science/2013/5083/0/06683916",
"title": "Magic View: An Optimized Ultra-Large Scientific Image Viewer for SAGE Tiled-Display Environment",
"doi": null,
"abstractUrl": "/proceedings-article/e-science/2013/06683916/12OmNASraXD",
"parentPublication": {
"id": "proceedings/e-science/2013/5083/0",
"title": "2013 IEEE 9th International Conference on eScience (eScience)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2010/7023/0/05585099",
"title": "Search-and-replace editing for personal photo collections",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2010/05585099/12OmNBqv2e7",
"parentPublication": {
"id": "proceedings/iccp/2010/7023/0",
"title": "2010 IEEE International Conference on Computational Photography (ICCP 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2006/0224/0/01667679",
"title": "Long Visualization Depth Autostereoscopic Display using Light Field Rendering based Integral Videography",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2006/01667679/12OmNvDZEZe",
"parentPublication": {
"id": "proceedings/vr/2006/0224/0",
"title": "IEEE Virtual Reality Conference (VR 2006)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1993/3230/1/00270754",
"title": "A Parallel Image Processing And Display System (PIPADS): hardware architecture and control software",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1993/00270754/12OmNwlHT1h",
"parentPublication": {
"id": "proceedings/hicss/1993/3230/1",
"title": "1993 The Twenty-sixth Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2009/4442/0/05457520",
"title": "Single image focus editing",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2009/05457520/12OmNxwWozJ",
"parentPublication": {
"id": "proceedings/iccvw/2009/4442/0",
"title": "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2008/3278/0/3278a397",
"title": "Image Editing without Color Inconsistency Using Modified Poisson Equation",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a397/12OmNyoiYXH",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dim/2003/1991/0/19910020",
"title": "Image-Based Object Editing",
"doi": null,
"abstractUrl": "/proceedings-article/3dim/2003/19910020/12OmNyqRnhS",
"parentPublication": {
"id": "proceedings/3dim/2003/1991/0",
"title": "3D Digital Imaging and Modeling, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2925/0/00202170",
"title": "An object oriented image display system",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00202170/12OmNz2kqkK",
"parentPublication": {
"id": "proceedings/icpr/1992/2925/0",
"title": "11th IAPR International Conference on Pattern Recognition. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition,",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tm/2018/11/08307275",
"title": "CrowdDBS: A Crowdsourced Brightness Scaling Optimization for Display Energy Reduction in Mobile Video",
"doi": null,
"abstractUrl": "/journal/tm/2018/11/08307275/143fh0f8qSk",
"parentPublication": {
"id": "trans/tm",
"title": "IEEE Transactions on Mobile Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900n3585",
"title": "Learning by Planning: Language-Guided Global Image Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900n3585/1yeKlG1DmIE",
"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": "12OmNyfdOIQ",
"title": "Multimedia Information Networking and Security, International Conference on",
"acronym": "mines",
"groupId": "1003021",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzyYib7",
"doi": "10.1109/MINES.2010.192",
"title": "Secure Image Delivery Scheme Using Poisson Editing",
"normalizedTitle": "Secure Image Delivery Scheme Using Poisson Editing",
"abstract": "We propose a secure image delivery scheme which can protect privacy of the secret region in sending image. In the scheme, the bits of the chosen secret region are first reversibly embedded into non-protection region. The secret region is then concealed or substituted with other meaningful content by our modified Poisson editing method, in which twice Laplacian operator is used to achieve better seamless effect. The protected image after editing can be delivered in channels securely. The attacker can’t obtain the real content of the image without the keys. Experiments are carried out to show effectiveness and security of the scheme.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a secure image delivery scheme which can protect privacy of the secret region in sending image. In the scheme, the bits of the chosen secret region are first reversibly embedded into non-protection region. The secret region is then concealed or substituted with other meaningful content by our modified Poisson editing method, in which twice Laplacian operator is used to achieve better seamless effect. The protected image after editing can be delivered in channels securely. The attacker can’t obtain the real content of the image without the keys. Experiments are carried out to show effectiveness and security of the scheme.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a secure image delivery scheme which can protect privacy of the secret region in sending image. In the scheme, the bits of the chosen secret region are first reversibly embedded into non-protection region. The secret region is then concealed or substituted with other meaningful content by our modified Poisson editing method, in which twice Laplacian operator is used to achieve better seamless effect. The protected image after editing can be delivered in channels securely. The attacker can’t obtain the real content of the image without the keys. Experiments are carried out to show effectiveness and security of the scheme.",
"fno": "4258a902",
"keywords": [
"Image Delivery",
"Region Concealment",
"Poisson Editing",
"Data Hiding"
],
"authors": [
{
"affiliation": null,
"fullName": "Chuan Qin",
"givenName": "Chuan",
"surname": "Qin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jia-Hong Li",
"givenName": "Jia-Hong",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Wei-Bin Lee",
"givenName": "Wei-Bin",
"surname": "Lee",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xinpeng Zhang",
"givenName": "Xinpeng",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "mines",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-11-01T00:00:00",
"pubType": "proceedings",
"pages": "902-906",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4258-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4258a898",
"articleId": "12OmNBCHMKN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4258a907",
"articleId": "12OmNBQ2VPv",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/wise/2000/0577/1/05771414",
"title": "Optional and Responsive Locking in Distributed Collaborative Object Graphics Editing Systems",
"doi": null,
"abstractUrl": "/proceedings-article/wise/2000/05771414/12OmNBRbkst",
"parentPublication": {
"id": "proceedings/wise/2000/0577/1",
"title": "Web Information Systems Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mines/2009/3843/1/3843a583",
"title": "Image Error Concealment and Quality Access Control Based on Data Hiding and Cryptography",
"doi": null,
"abstractUrl": "/proceedings-article/mines/2009/3843a583/12OmNviZliN",
"parentPublication": {
"id": "proceedings/mines/2009/3843/1",
"title": "Multimedia Information Networking and Security, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2009/3762/0/3762a369",
"title": "A Novel Secure Data Hiding Scheme Using a Secret Reference Matrix",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2009/3762a369/12OmNyGbI6d",
"parentPublication": {
"id": "proceedings/iih-msp/2009/3762/0",
"title": "Intelligent Information Hiding and Multimedia Signal Processing, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2008/3278/0/3278a397",
"title": "Image Editing without Color Inconsistency Using Modified Poisson Equation",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a397/12OmNyoiYXH",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460844",
"title": "Local color editing using color classification and boundary inpainting",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460844/12OmNyugz3e",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2001/03/i0291",
"title": "Image Editing in the Contour Domain",
"doi": null,
"abstractUrl": "/journal/tp/2001/03/i0291/13rRUwbs1Tw",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2007/02/mcg2007020023",
"title": "Editing Soft Shadows in a Digital Photograph",
"doi": null,
"abstractUrl": "/magazine/cg/2007/02/mcg2007020023/13rRUwciPfb",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0034",
"title": "Robust Feature Classification and Editing",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0034/13rRUxBa5nj",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2008/06/mcg2008060076",
"title": "Orthogonal-Blendshape-Based Editing System for Facial Motion Capture Data",
"doi": null,
"abstractUrl": "/magazine/cg/2008/06/mcg2008060076/13rRUyuegji",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpcc-smartcity-dss/2019/2058/0/205800a345",
"title": "A Face Privacy Protection Scheme Using CNN Based ROI Editing",
"doi": null,
"abstractUrl": "/proceedings-article/hpcc-smartcity-dss/2019/205800a345/1dPojYnnOlG",
"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"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1Eb2qWexX8c",
"title": "2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"acronym": "iiai-aai",
"groupId": "1801921",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1Eb2IH5emha",
"doi": "10.1109/IIAI-AAI53430.2021.00159",
"title": "Extraction of editing processes for modifying a program to another purpose based on representation learning",
"normalizedTitle": "Extraction of editing processes for modifying a program to another purpose based on representation learning",
"abstract": "The purpose of this paper is to clarify the editing process in creating computer programs. We do not record those processes of many people, but propose a way to find the process of editing a program from a set of submitted programs for a wide range of program tasks. In this way, we would like to clarify how to edit and modify a simple program to another more complex program. In the proposed method, we find the programmers' editing process by training a representation learning model that converts the tree structure into a vector representation, and clustering with the distance between programs that are embedded in a vector space. As a result, we show a transition diagram of the editing process we extract from various submitted programs.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The purpose of this paper is to clarify the editing process in creating computer programs. We do not record those processes of many people, but propose a way to find the process of editing a program from a set of submitted programs for a wide range of program tasks. In this way, we would like to clarify how to edit and modify a simple program to another more complex program. In the proposed method, we find the programmers' editing process by training a representation learning model that converts the tree structure into a vector representation, and clustering with the distance between programs that are embedded in a vector space. As a result, we show a transition diagram of the editing process we extract from various submitted programs.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The purpose of this paper is to clarify the editing process in creating computer programs. We do not record those processes of many people, but propose a way to find the process of editing a program from a set of submitted programs for a wide range of program tasks. In this way, we would like to clarify how to edit and modify a simple program to another more complex program. In the proposed method, we find the programmers' editing process by training a representation learning model that converts the tree structure into a vector representation, and clustering with the distance between programs that are embedded in a vector space. As a result, we show a transition diagram of the editing process we extract from various submitted programs.",
"fno": "242000a911",
"keywords": [
"Feature Extraction",
"Learning Artificial Intelligence",
"Software Engineering",
"Tree Data Structures",
"Tree Structure",
"Vector Space",
"Vector Representation",
"Representation Learning Model",
"Complex Program",
"Simple Program",
"Program Tasks",
"Submitted Programs",
"Computer Programs",
"Editing Process",
"Representation Learning",
"Training",
"Programming",
"Prediction Algorithms",
"Task Analysis",
"Informatics",
"Programming Knowledge Mining",
"Graph Embedding",
"Representation Learning"
],
"authors": [
{
"affiliation": "Osaka Electro-Communication University,Faculty of Information and Communication Engineering,Osaka,Japan",
"fullName": "Wakana Hashimoto",
"givenName": "Wakana",
"surname": "Hashimoto",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Graduate school of engineering, Osaka Electro-Communication University,Osaka,Japan",
"fullName": "Yo Amano",
"givenName": "Yo",
"surname": "Amano",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Graduate school of engineering, Osaka Electro-Communication University,Osaka,Japan",
"fullName": "Yutaka Takesue",
"givenName": "Yutaka",
"surname": "Takesue",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Osaka Electro-Communication University,Faculty of Information and Communication Engineering,Osaka,Japan",
"fullName": "Kazuhiro Takeuchi",
"givenName": "Kazuhiro",
"surname": "Takeuchi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iiai-aai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-07-01T00:00:00",
"pubType": "proceedings",
"pages": "911-912",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-2420-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "242000a909",
"articleId": "1Eb2J1T3Dkk",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "242000a913",
"articleId": "1Eb2DWK3gLm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/latice/2016/2504/0/2504a047",
"title": "Frame-Based Editing: Combining the Best of Blocks and Text Programming",
"doi": null,
"abstractUrl": "/proceedings-article/latice/2016/2504a047/12OmNBsLPbT",
"parentPublication": {
"id": "proceedings/latice/2016/2504/0",
"title": "2016 International Conference on Learning and Teaching in Computing and Engineering (LaTICE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/micro/2005/2440/0/24400343",
"title": "Stream Programming on General-Purpose Processors",
"doi": null,
"abstractUrl": "/proceedings-article/micro/2005/24400343/12OmNrMZpv2",
"parentPublication": {
"id": "proceedings/micro/2005/2440/0",
"title": "38th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvmp/2009/3893/0/3893a127",
"title": "An Evolutionary Approach to Automatic Video Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvmp/2009/3893a127/12OmNwNwzMo",
"parentPublication": {
"id": "proceedings/cvmp/2009/3893/0",
"title": "2009 Conference for Visual Media Production",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vl/1993/3970/0/00269600",
"title": "Constructing multi-view editing environments using MViews",
"doi": null,
"abstractUrl": "/proceedings-article/vl/1993/00269600/12OmNx7G5Qp",
"parentPublication": {
"id": "proceedings/vl/1993/3970/0",
"title": "Proceedings 1993 IEEE Symposium on Visual Languages",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsm/1991/2325/0/00160335",
"title": "Visual editing of data structures",
"doi": null,
"abstractUrl": "/proceedings-article/icsm/1991/00160335/12OmNym2bRx",
"parentPublication": {
"id": "proceedings/icsm/1991/2325/0",
"title": "1991 Conference on Software Maintenance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsm/1988/0879/0/00010150",
"title": "Grammar-based program transformation",
"doi": null,
"abstractUrl": "/proceedings-article/icsm/1988/00010150/12OmNzTYBRE",
"parentPublication": {
"id": "proceedings/icsm/1988/0879/0",
"title": "1988 Conference on Software Maintenance",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acit-csi/2015/9642/0/9642a028",
"title": "Do Learners to Create an Artifact with Good Quality Make a Number of Trials and Errors during the Editing Process?",
"doi": null,
"abstractUrl": "/proceedings-article/acit-csi/2015/9642a028/12OmNzlD9gK",
"parentPublication": {
"id": "proceedings/acit-csi/2015/9642/0",
"title": "2015 3rd International Conference on Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence (ACIT-CSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icse/2018/5638/0/563801a654",
"title": "Deuce: A Lightweight User Interface for Structured Editing",
"doi": null,
"abstractUrl": "/proceedings-article/icse/2018/563801a654/13l5NWNrH6L",
"parentPublication": {
"id": "proceedings/icse/2018/5638/0",
"title": "2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/td/1991/03/l0329",
"title": "Interactive Parallel Programming using the ParaScope Editor",
"doi": null,
"abstractUrl": "/journal/td/1991/03/l0329/13rRUxcKzUO",
"parentPublication": {
"id": "trans/td",
"title": "IEEE Transactions on Parallel & Distributed Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/b&b/2019/4849/0/08941210",
"title": "Position: Meeting the Promise of Blocks-as-AST-Nodes Editing with “Typeblocking”",
"doi": null,
"abstractUrl": "/proceedings-article/b&b/2019/08941210/1gjRmhxFp3W",
"parentPublication": {
"id": "proceedings/b&b/2019/4849/0",
"title": "2019 IEEE Blocks and Beyond Workshop (B&B)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1GvdjcimXN6",
"title": "2022 IEEE International Conference on Smart Internet of Things (SmartIoT)",
"acronym": "smartiot",
"groupId": "1827484",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1Gvdk3nDSZa",
"doi": "10.1109/SmartIoT55134.2022.00038",
"title": "Unsupervised Generated Image Editing Method Based on Multi-Scale Hierarchical Disentanglement",
"normalizedTitle": "Unsupervised Generated Image Editing Method Based on Multi-Scale Hierarchical Disentanglement",
"abstract": "In order to solve the problem of semantic entanglement in generated image latent space of the StyleGAN2 network, we propose an unsupervised generated image editing method based on a multi-scale hierarchical disentanglement network structure. In our method, we first combine the mapping layer with the style mapping layer of each resolution branch in the StyleGAN2 network, and utilize the weight matrix eigen decomposition method at each scale independently to achieve the first-level disentanglement of image attributes and obtain the semantic direction vector of the scale. Then, we use Schmidt orthogonal decomposition based on the adjacent scale eigen vector to achieve the second-level disentanglement of image attributes. The result show that, compared with other mainstream unsupervised image editing methods, our method can achieve precise image editing at multiple scales, and the measurement of disentanglement between each attribute has also reached the best.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In order to solve the problem of semantic entanglement in generated image latent space of the StyleGAN2 network, we propose an unsupervised generated image editing method based on a multi-scale hierarchical disentanglement network structure. In our method, we first combine the mapping layer with the style mapping layer of each resolution branch in the StyleGAN2 network, and utilize the weight matrix eigen decomposition method at each scale independently to achieve the first-level disentanglement of image attributes and obtain the semantic direction vector of the scale. Then, we use Schmidt orthogonal decomposition based on the adjacent scale eigen vector to achieve the second-level disentanglement of image attributes. The result show that, compared with other mainstream unsupervised image editing methods, our method can achieve precise image editing at multiple scales, and the measurement of disentanglement between each attribute has also reached the best.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In order to solve the problem of semantic entanglement in generated image latent space of the StyleGAN2 network, we propose an unsupervised generated image editing method based on a multi-scale hierarchical disentanglement network structure. In our method, we first combine the mapping layer with the style mapping layer of each resolution branch in the StyleGAN2 network, and utilize the weight matrix eigen decomposition method at each scale independently to achieve the first-level disentanglement of image attributes and obtain the semantic direction vector of the scale. Then, we use Schmidt orthogonal decomposition based on the adjacent scale eigen vector to achieve the second-level disentanglement of image attributes. The result show that, compared with other mainstream unsupervised image editing methods, our method can achieve precise image editing at multiple scales, and the measurement of disentanglement between each attribute has also reached the best.",
"fno": "795200a185",
"keywords": [
"Eigenvalues And Eigenfunctions",
"Image Reconstruction",
"Image Resolution",
"Unsupervised Learning",
"Unsupervised Generated Image Editing Method",
"Generated Image Latent Space",
"Style GAN 2 Network",
"Multiscale Hierarchical Disentanglement Network Structure",
"Style Mapping Layer",
"Weight Matrix Eigen Decomposition Method",
"Image Attributes",
"Adjacent Scale",
"Mainstream Unsupervised Image Editing Methods",
"Second Level Disentanglement",
"First Level Disentanglement",
"Semantic Direction Vector",
"Schmidt Orthogonal Decomposition",
"Image Resolution",
"Semantics",
"Timing",
"Matrix Decomposition",
"Internet Of Things",
"Style GAN 2",
"Unsupervised Methods",
"Image Editing",
"Multi Scale",
"Attribute Disentanglement"
],
"authors": [
{
"affiliation": "School of Electronic Engineering, Xidian University,Xi'an,China",
"fullName": "Jianlong Zhang",
"givenName": "Jianlong",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Electronic Engineering, Xidian University,Xi'an,China",
"fullName": "Xincheng Yu",
"givenName": "Xincheng",
"surname": "Yu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "School of Electronic Engineering, Xidian University,Xi'an,China",
"fullName": "Bin Wang",
"givenName": "Bin",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Xidian University,State Key Laboratory of Integrated Services Networks,Xi'an,China",
"fullName": "Chen Chen",
"givenName": "Chen",
"surname": "Chen",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "smartiot",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-08-01T00:00:00",
"pubType": "proceedings",
"pages": "185-191",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-7952-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "795200a180",
"articleId": "1GvdoL71Cmc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "795200a192",
"articleId": "1GvdoZB8rUk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccp/2011/707/0/05753125",
"title": "Display-aware image editing",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2011/05753125/12OmNzcPAil",
"parentPublication": {
"id": "proceedings/iccp/2011/707/0",
"title": "IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600l1244",
"title": "SemanticStyleGAN: Learning Compositional Generative Priors for Controllable Image Synthesis and Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600l1244/1H1iqwloCOY",
"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/694600h673",
"title": "TransEditor: Transformer-Based Dual-Space GAN for Highly Controllable Facial Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600h673/1H1mrnr7FoQ",
"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/09956297",
"title": "Unsupervised Hierarchical Disentanglement for Video Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2022/09956297/1IHq47SKcEg",
"parentPublication": {
"id": "proceedings/icpr/2022/9062/0",
"title": "2022 26th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/10012505",
"title": "Identity-Aware and Shape-Aware Propagation of Face Editing in Videos",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/10012505/1JNmJJBoNkQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2020/3079/0/307900a725",
"title": "Self-supervised Deformation Modeling for Facial Expression Editing",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a725/1kecITvBymY",
"parentPublication": {
"id": "proceedings/fg/2020/3079/0/",
"title": "2020 15th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2020) (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800f476",
"title": "Nested Scale-Editing for Conditional Image Synthesis",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800f476/1m3ogpqulpe",
"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/019100b823",
"title": "Rethinking Content and Style: Exploring Bias for Unsupervised Disentanglement",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100b823/1yNhJO5tjZ6",
"parentPublication": {
"id": "proceedings/iccvw/2021/0191/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900o4981",
"title": "Anycost GANs for Interactive Image Synthesis and Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900o4981/1yeIo7iTDAA",
"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/450900d670",
"title": "Navigating the GAN Parameter Space for Semantic Image Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900d670/1yeM1iXyYXC",
"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": "1LFLQivG5gI",
"title": "2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)",
"acronym": "trustcom",
"groupId": "10063338",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1LFLTHYyocE",
"doi": "10.1109/TrustCom56396.2022.00206",
"title": "Redactable Blockchain with K-Time Controllable Editing",
"normalizedTitle": "Redactable Blockchain with K-Time Controllable Editing",
"abstract": "Considering the immutability of traditional blockchain restricts the governance and regulation of sensitive data on chain, this paper proposes a redactable blockchain scheme with k-time controllable cheating editing (CCE-RB for short). In the CCE-RB scheme, the regulator requires editors to generate vector commitments, so as to set the number of times each editor’s editing permissions can be used. The editor needs to open each component of the vector commitment successively before each editor prove that he/she has enough number of times of editing. The regulator has the right to revoke the editor’s editing permission when the editor’s editing times are exhausted or cheating editing behavior occurs, thus realizing the revocability of the editor’s editing permission. In a word, CCE-RB achieves regulation of whole editing process by block editability, controllability of editing times and revocability of editing permissions. By comparing and analyzing related schemes, the experiment results show that CCE-RB scheme has good efficiency.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Considering the immutability of traditional blockchain restricts the governance and regulation of sensitive data on chain, this paper proposes a redactable blockchain scheme with k-time controllable cheating editing (CCE-RB for short). In the CCE-RB scheme, the regulator requires editors to generate vector commitments, so as to set the number of times each editor’s editing permissions can be used. The editor needs to open each component of the vector commitment successively before each editor prove that he/she has enough number of times of editing. The regulator has the right to revoke the editor’s editing permission when the editor’s editing times are exhausted or cheating editing behavior occurs, thus realizing the revocability of the editor’s editing permission. In a word, CCE-RB achieves regulation of whole editing process by block editability, controllability of editing times and revocability of editing permissions. By comparing and analyzing related schemes, the experiment results show that CCE-RB scheme has good efficiency.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Considering the immutability of traditional blockchain restricts the governance and regulation of sensitive data on chain, this paper proposes a redactable blockchain scheme with k-time controllable cheating editing (CCE-RB for short). In the CCE-RB scheme, the regulator requires editors to generate vector commitments, so as to set the number of times each editor’s editing permissions can be used. The editor needs to open each component of the vector commitment successively before each editor prove that he/she has enough number of times of editing. The regulator has the right to revoke the editor’s editing permission when the editor’s editing times are exhausted or cheating editing behavior occurs, thus realizing the revocability of the editor’s editing permission. In a word, CCE-RB achieves regulation of whole editing process by block editability, controllability of editing times and revocability of editing permissions. By comparing and analyzing related schemes, the experiment results show that CCE-RB scheme has good efficiency.",
"fno": "942500b455",
"keywords": [
"Blockchains",
"Cryptocurrencies",
"Block Editability",
"CCE RB Scheme",
"Editing Behavior",
"Editing Permissions",
"Editing Process",
"Editing Times",
"Editor",
"K Time Controllable Cheating Editing",
"Redactable Blockchain Scheme",
"Vector Commitment",
"Hash Functions",
"Privacy",
"Regulators",
"Process Control",
"Controllability",
"Regulation",
"Blockchains",
"Redactable Blockchain",
"Chameleon Hash",
"Vector Commitment",
"Regulation"
],
"authors": [
{
"affiliation": "Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China",
"fullName": "Yong Li",
"givenName": "Yong",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Beijing Jiaotong University,School of Electronic and Information Engineering,Beijing,China",
"fullName": "Zhenghao Zhang",
"givenName": "Zhenghao",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Linklogis,Shenzhen,China",
"fullName": "Xi Chen",
"givenName": "Xi",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Linklogis,Shenzhen,China",
"fullName": "Ruxian Li",
"givenName": "Ruxian",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Linklogis,Shenzhen,China",
"fullName": "Liang Zhang",
"givenName": "Liang",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "trustcom",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1455-1461",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-9425-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "942500b447",
"articleId": "1LFLRj6NsKQ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "942500b462",
"articleId": "1LFMfsK9jVe",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/trustcom/2021/1658/0/165800b202",
"title": "Redactable Blockchain based on Unforgeable Signatures for Supporting Fast Verification",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2021/165800b202/1BBzhDV8TF6",
"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/cbfd/2021/1227/0/122700a334",
"title": "Research on Problems in Financial Legal Supervision of Blockchain in China from the Perspective of Internet",
"doi": null,
"abstractUrl": "/proceedings-article/cbfd/2021/122700a334/1CJfMGOWt44",
"parentPublication": {
"id": "proceedings/cbfd/2021/1227/0",
"title": "2021 International Conference on Computer, Blockchain and Financial Development (CBFD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600h673",
"title": "TransEditor: Transformer-Based Dual-Space GAN for Highly Controllable Facial Editing",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600h673/1H1mrnr7FoQ",
"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/cc/5555/01/09989344",
"title": "DSE-RB: A Privacy-preserving Dynamic Searchable Encryption Framework on Redactable Blockchain",
"doi": null,
"abstractUrl": "/journal/cc/5555/01/09989344/1J7RKczkuuQ",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/5555/01/09994615",
"title": "VRBC: A Verifiable Redactable Blockchain with Efficient Query and Integrity Auditing",
"doi": null,
"abstractUrl": "/journal/tc/5555/01/09994615/1Jgwdy67fzy",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2022/9425/0/942500a945",
"title": "CDEdit: Redactable Blockchain with Cross-audit and Diversity Editing",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2022/942500a945/1LFLSvjLA6A",
"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": "trans/tq/5555/01/10082897",
"title": "Secure Redactable Blockchain With Dynamic Support",
"doi": null,
"abstractUrl": "/journal/tq/5555/01/10082897/1LRbZvNCKiI",
"parentPublication": {
"id": "trans/tq",
"title": "IEEE Transactions on Dependable and Secure Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/cc/2023/01/09507330",
"title": "Online/Offline Rewritable Blockchain With Auditable Outsourced Computation",
"doi": null,
"abstractUrl": "/journal/cc/2023/01/09507330/1vNflO8gRUs",
"parentPublication": {
"id": "trans/cc",
"title": "IEEE Transactions on Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxwWosk",
"title": "2015 3rd International Conference on Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence (ACIT-CSI)",
"acronym": "acit-csi",
"groupId": "1810566",
"volume": "0",
"displayVolume": "0",
"year": "2015",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAgoV8n",
"doi": "10.1109/ACIT-CSI.2015.50",
"title": "Synchronization Method for Improving Temporal Harmony of Music and Video Clips",
"normalizedTitle": "Synchronization Method for Improving Temporal Harmony of Music and Video Clips",
"abstract": "This paper focuses on temporal harmony of music and video clips. The method for producing a synchronized audiovisual material is proposed. Change points of the direction of the moving object are decided as synchronization points of video clips. The moving area of an object is extracted in order to detect the change points. Only the motion vectors in the area are used. The start point that an object begins to move is considered. Beats are used as synchronization points of a music clip. Playback speed of a video clip is changed to meet synchronization points of music and video clips. The proposed method is experimentally evaluated. Evaluation results show that the proposed method is effective in improving of harmony in specific media data. It is also shown that the start point synchronization influences temporal harmony and general harmony.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper focuses on temporal harmony of music and video clips. The method for producing a synchronized audiovisual material is proposed. Change points of the direction of the moving object are decided as synchronization points of video clips. The moving area of an object is extracted in order to detect the change points. Only the motion vectors in the area are used. The start point that an object begins to move is considered. Beats are used as synchronization points of a music clip. Playback speed of a video clip is changed to meet synchronization points of music and video clips. The proposed method is experimentally evaluated. Evaluation results show that the proposed method is effective in improving of harmony in specific media data. It is also shown that the start point synchronization influences temporal harmony and general harmony.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper focuses on temporal harmony of music and video clips. The method for producing a synchronized audiovisual material is proposed. Change points of the direction of the moving object are decided as synchronization points of video clips. The moving area of an object is extracted in order to detect the change points. Only the motion vectors in the area are used. The start point that an object begins to move is considered. Beats are used as synchronization points of a music clip. Playback speed of a video clip is changed to meet synchronization points of music and video clips. The proposed method is experimentally evaluated. Evaluation results show that the proposed method is effective in improving of harmony in specific media data. It is also shown that the start point synchronization influences temporal harmony and general harmony.",
"fno": "9642a236",
"keywords": [
"Synchronization",
"Motion Pictures",
"Delays",
"Semantics",
"Frequency Conversion",
"Time Frequency Analysis",
"Kansei",
"Synchronization",
"Music",
"Videos",
"Harmony",
"Temporal Harmony"
],
"authors": [
{
"affiliation": null,
"fullName": "Hayato Kumagai",
"givenName": "Hayato",
"surname": "Kumagai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Teruhisa Hochin",
"givenName": "Teruhisa",
"surname": "Hochin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Hiroki Nomiya",
"givenName": "Hiroki",
"surname": "Nomiya",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "acit-csi",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2015-07-01T00:00:00",
"pubType": "proceedings",
"pages": "236-241",
"year": "2015",
"issn": null,
"isbn": "978-1-4673-9642-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "9642a229",
"articleId": "12OmNBQkx2a",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "9642a242",
"articleId": "12OmNxwENyP",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icme/2011/348/0/06011912",
"title": "Motion synthesis for synchronizing with streaming music by segment-based search on metadata motion graphs",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06011912/12OmNAoUTkt",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2008/3381/0/3381a567",
"title": "Automatic Transition Detection of Segmented Motion Clips Using PCA-based GMM Method",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2008/3381a567/12OmNBpVPWM",
"parentPublication": {
"id": "proceedings/cw/2008/3381/0",
"title": "2008 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2010/4088/0/4088a253",
"title": "Towards the Usage of Harmony of Audio and Video Clips in Cross-Media Retrieval System Based on Impression",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2010/4088a253/12OmNBv2CeZ",
"parentPublication": {
"id": "proceedings/snpd/2010/4088/0",
"title": "2010 11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sasow/2013/5086/0/5086a095",
"title": "The Challenge of Decentralised Synchronisation in Interactive Music Systems",
"doi": null,
"abstractUrl": "/proceedings-article/sasow/2013/5086a095/12OmNqJ8teC",
"parentPublication": {
"id": "proceedings/sasow/2013/5086/0",
"title": "2013 IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2013/5048/0/5048a582",
"title": "User-centric Affective Video Tagging from MEG and Peripheral Physiological Responses",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2013/5048a582/12OmNrkjVpA",
"parentPublication": {
"id": "proceedings/acii/2013/5048/0",
"title": "2013 Humaine Association Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit-iucc-dasc-picom/2015/0154/0/07363117",
"title": "Remote Temporal Couplers for Multiple Content Synchronization",
"doi": null,
"abstractUrl": "/proceedings-article/cit-iucc-dasc-picom/2015/07363117/12OmNwBT1jU",
"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/icassp/2009/2353/0/04959995",
"title": "A robust harmony structure modeling scheme for classical music opus identification",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2009/04959995/12OmNzaQogG",
"parentPublication": {
"id": "proceedings/icassp/2009/2353/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2017/5504/0/08022772",
"title": "Retrieval and synchronized playback methods considering temporal harmony of music and video clips",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2017/08022772/12OmNzn394s",
"parentPublication": {
"id": "proceedings/snpd/2017/5504/0",
"title": "2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csii/2018/7875/0/787501a114",
"title": "Synchronizing Method of Music and Movie Clips Considering Temporal Harmony",
"doi": null,
"abstractUrl": "/proceedings-article/csii/2018/787501a114/13xI8AOXccZ",
"parentPublication": {
"id": "proceedings/csii/2018/7875/0",
"title": "2018 5th International Conference on Computational Science/Intelligence and Applied Informatics (CSII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aiccsa/2018/9120/0/08612829",
"title": "Automatic Classification of Reciters of Quranic Audio Clips",
"doi": null,
"abstractUrl": "/proceedings-article/aiccsa/2018/08612829/17D45Xbl4NW",
"parentPublication": {
"id": "proceedings/aiccsa/2018/9120/0",
"title": "2018 IEEE/ACS 15th International Conference on Computer Systems and Applications (AICCSA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy7h3cf",
"title": "2008 21st International Conference on VLSI Design",
"acronym": "vlsid",
"groupId": "1000799",
"volume": "0",
"displayVolume": "0",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBOlldQ",
"doi": "10.1109/VLSI.2008.103",
"title": "Watermarking Video Clips with Workload Information for DVS",
"normalizedTitle": "Watermarking Video Clips with Workload Information for DVS",
"abstract": "We present a lightweight scheme for watermarking or annotating video clips with information describing the workload that would be incurred while decoding the clip. This information can be used at run time to scale the oper- ating voltage/frequency of the processor on which the video clip is to be decoded. Our main contribution is a fast, low-cost bitstream analysis technique for estimating the de- coding workload of a video clip. Using this technique the workload information can be inserted into a clip while it is being downloaded onto a battery-powered portable device from a desktop computer or a server, for later playback. In contrast to control-theoretic feedback techniques that have been traditionally used for predicting video decoding work- load at runtime for dynamic voltage/frequency scaling, we show that our scheme performs better in terms of energy savings and has significantly lower buffer requirements.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a lightweight scheme for watermarking or annotating video clips with information describing the workload that would be incurred while decoding the clip. This information can be used at run time to scale the oper- ating voltage/frequency of the processor on which the video clip is to be decoded. Our main contribution is a fast, low-cost bitstream analysis technique for estimating the de- coding workload of a video clip. Using this technique the workload information can be inserted into a clip while it is being downloaded onto a battery-powered portable device from a desktop computer or a server, for later playback. In contrast to control-theoretic feedback techniques that have been traditionally used for predicting video decoding work- load at runtime for dynamic voltage/frequency scaling, we show that our scheme performs better in terms of energy savings and has significantly lower buffer requirements.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a lightweight scheme for watermarking or annotating video clips with information describing the workload that would be incurred while decoding the clip. This information can be used at run time to scale the oper- ating voltage/frequency of the processor on which the video clip is to be decoded. Our main contribution is a fast, low-cost bitstream analysis technique for estimating the de- coding workload of a video clip. Using this technique the workload information can be inserted into a clip while it is being downloaded onto a battery-powered portable device from a desktop computer or a server, for later playback. In contrast to control-theoretic feedback techniques that have been traditionally used for predicting video decoding work- load at runtime for dynamic voltage/frequency scaling, we show that our scheme performs better in terms of energy savings and has significantly lower buffer requirements.",
"fno": "30830712",
"keywords": [],
"authors": [
{
"affiliation": null,
"fullName": "Yicheng Huang",
"givenName": "Yicheng",
"surname": "Huang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Samarjit Chakraborty",
"givenName": "Samarjit",
"surname": "Chakraborty",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ye Wang",
"givenName": "Ye",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vlsid",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-01-01T00:00:00",
"pubType": "proceedings",
"pages": "712-717",
"year": "2008",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "30830706",
"articleId": "12OmNz5s0IX",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "30830718",
"articleId": "12OmNzayNej",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/acit-csi/2015/9642/0/9642a236",
"title": "Synchronization Method for Improving Temporal Harmony of Music and Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/acit-csi/2015/9642a236/12OmNAgoV8n",
"parentPublication": {
"id": "proceedings/acit-csi/2015/9642/0",
"title": "2015 3rd International Conference on Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence (ACIT-CSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismse/2004/2217/0/22170186",
"title": "Detecting Tactics Patterns for Archiving Tennis Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/ismse/2004/22170186/12OmNBtCCBd",
"parentPublication": {
"id": "proceedings/ismse/2004/2217/0",
"title": "Multimedia Software Engineering, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/4/3336g759",
"title": "Mining Similarities for Clustering Web Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g759/12OmNC0guvR",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2005/9385/0/01577303",
"title": "Resolution enhancement for video clips: tight frame approach",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2005/01577303/12OmNyRg4FE",
"parentPublication": {
"id": "proceedings/avss/2005/9385/0",
"title": "IEEE Conference on Advanced Video and Signal Based Surveillance, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2010/7029/0/05543795",
"title": "3D structure estimation from monocular video clips",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2010/05543795/12OmNyjtNH7",
"parentPublication": {
"id": "proceedings/cvprw/2010/7029/0",
"title": "2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111868",
"title": "Video Snapshots: Creating High-Quality Images from Video Clips",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111868/13rRUIM2VBF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2019/9214/0/921400a156",
"title": "Deep Key Clips-Video Feature Fusion Framework for Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2019/921400a156/1cJ0zPaaKvm",
"parentPublication": {
"id": "proceedings/icmew/2019/9214/0",
"title": "2019 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300g231",
"title": "SCSampler: Sampling Salient Clips From Video for Efficient Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300g231/1hVlCgl296E",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900h563",
"title": "Beyond Short Clips: End-to-End Video-Level Learning with Collaborative Memories",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900h563/1yeJTb2n3YA",
"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/iccst/2021/4254/0/425400a444",
"title": "Text Based Video Retrieval among Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/iccst/2021/425400a444/1ziPeZ8y0hi",
"parentPublication": {
"id": "proceedings/iccst/2021/4254/0",
"title": "2021 International Conference on Culture-oriented Science & Technology (ICCST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1lgopc2L9Ha",
"title": "Computer Science and Software Engineering, International Conference on",
"acronym": "csse",
"groupId": "1002553",
"volume": "4",
"displayVolume": "4",
"year": "2008",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNC0guvR",
"doi": "10.1109/CSSE.2008.392",
"title": "Mining Similarities for Clustering Web Video Clips",
"normalizedTitle": "Mining Similarities for Clustering Web Video Clips",
"abstract": "With the widespread use of online video application, the amount of online video clips becomes huge. Web video search engines can help users to locate video clips they are interested in. However, most video search engines return similar or near-duplicate videos together in the result lists, which is inconvenient for users to browse. This paper proposes a novel approach to cluster similar web searched videos based on video visual similarities mining. The visual information is extracted for each video clip at first, then the video clips are clustered according to the pair-wise similarities among them. To evaluate the effectiveness of the proposed method, experiments are conducted on YouTube video search results.",
"abstracts": [
{
"abstractType": "Regular",
"content": "With the widespread use of online video application, the amount of online video clips becomes huge. Web video search engines can help users to locate video clips they are interested in. However, most video search engines return similar or near-duplicate videos together in the result lists, which is inconvenient for users to browse. This paper proposes a novel approach to cluster similar web searched videos based on video visual similarities mining. The visual information is extracted for each video clip at first, then the video clips are clustered according to the pair-wise similarities among them. To evaluate the effectiveness of the proposed method, experiments are conducted on YouTube video search results.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "With the widespread use of online video application, the amount of online video clips becomes huge. Web video search engines can help users to locate video clips they are interested in. However, most video search engines return similar or near-duplicate videos together in the result lists, which is inconvenient for users to browse. This paper proposes a novel approach to cluster similar web searched videos based on video visual similarities mining. The visual information is extracted for each video clip at first, then the video clips are clustered according to the pair-wise similarities among them. To evaluate the effectiveness of the proposed method, experiments are conducted on YouTube video search results.",
"fno": "3336g759",
"keywords": [
"Data Mining",
"Clustering",
"Multimedia Application",
"Video Processing",
"Affinity Propagation",
"Web Video Search"
],
"authors": [
{
"affiliation": null,
"fullName": "Shouqun Liu",
"givenName": "Shouqun",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ming Zhu",
"givenName": "Ming",
"surname": "Zhu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Quan Zheng",
"givenName": "Quan",
"surname": "Zheng",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "csse",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2008-12-01T00:00:00",
"pubType": "proceedings",
"pages": "759-762",
"year": "2008",
"issn": null,
"isbn": "978-0-7695-3336-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3336g755",
"articleId": "12OmNy2JsZn",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3336g763",
"articleId": "12OmNyiUBq0",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ism/2008/3454/0/3454a497",
"title": "LeeDeo: Web-Crawled Academic Video Search Engine",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2008/3454a497/12OmNBCHMKm",
"parentPublication": {
"id": "proceedings/ism/2008/3454/0",
"title": "2008 Tenth IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iciss/2015/8611/0/07370972",
"title": "A System for Retrieving Object Trajectories in Video Clips Captured by Static Cameras",
"doi": null,
"abstractUrl": "/proceedings-article/iciss/2015/07370972/12OmNvjgWvx",
"parentPublication": {
"id": "proceedings/iciss/2015/8611/0",
"title": "2015 2nd International Conference on Information Science and Security (ICISS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdcs/2018/6871/0/687101b618",
"title": "Investigating the Impact of Advertisement Banners and Clips on Video QoE",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2018/687101b618/12OmNwIHoE8",
"parentPublication": {
"id": "proceedings/icdcs/2018/6871/0",
"title": "2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2009/3890/0/3890a505",
"title": "A Context-Based Whole Video Retrieval System with Dynamic Video Stream Analysis Mechanisms",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2009/3890a505/12OmNx4gUvY",
"parentPublication": {
"id": "proceedings/ism/2009/3890/0",
"title": "2009 11th IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isecs/2008/3258/0/3258a203",
"title": "Automatic Video Summarization by Affinity Propagation Clustering and Semantic Content Mining",
"doi": null,
"abstractUrl": "/proceedings-article/isecs/2008/3258a203/12OmNxETadm",
"parentPublication": {
"id": "proceedings/isecs/2008/3258/0",
"title": "Electronic Commerce and Security, International Symposium",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cimca/2008/3514/0/3514b223",
"title": "Fast Search Algorithm for Short Video Clips from Large Video Database Using a Novel Histogram Feature",
"doi": null,
"abstractUrl": "/proceedings-article/cimca/2008/3514b223/12OmNxwnctg",
"parentPublication": {
"id": "proceedings/cimca/2008/3514/0",
"title": "2008 International Conference on Computational Intelligence for Modelling Control & Automation (CIMCA 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2008/2339/0/04562955",
"title": "A walk through the web's video clips",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2008/04562955/12OmNy87QuE",
"parentPublication": {
"id": "proceedings/cvprw/2008/2339/0",
"title": "2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2005/9385/0/01577303",
"title": "Resolution enhancement for video clips: tight frame approach",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2005/01577303/12OmNyRg4FE",
"parentPublication": {
"id": "proceedings/avss/2005/9385/0",
"title": "IEEE Conference on Advanced Video and Signal Based Surveillance, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2003/2105/4/210540042",
"title": "A Video Event Detection and Mining Framework",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2003/210540042/12OmNzmtWC5",
"parentPublication": {
"id": "proceedings/cvprw/2003/2105/4",
"title": "2003 Conference on Computer Vision and Pattern Recognition Workshop - Volume 4",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/it/2014/02/mit2014020022",
"title": "Building Better Search Engines by Measuring Search Quality",
"doi": null,
"abstractUrl": "/magazine/it/2014/02/mit2014020022/13rRUy3gn9B",
"parentPublication": {
"id": "mags/it",
"title": "IT Professional",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwJPMY7",
"title": "IEEE Conference on Advanced Video and Signal Based Surveillance, 2005.",
"acronym": "avss",
"groupId": "1001307",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyRg4FE",
"doi": "10.1109/AVSS.2005.1577303",
"title": "Resolution enhancement for video clips: tight frame approach",
"normalizedTitle": "Resolution enhancement for video clips: tight frame approach",
"abstract": "Video clip consists of frames, and each frame can be considered as a transformed picture of the reference frame. In this paper, we briefly discuss a framelet method for high-resolution image reconstruction to enhance the resolution of video clips. The detailed discussion can be found in R.H. Chan et al. (2005). Experiments on an actual video clip show that our method can provide information that are not discernable from the given video clip.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Video clip consists of frames, and each frame can be considered as a transformed picture of the reference frame. In this paper, we briefly discuss a framelet method for high-resolution image reconstruction to enhance the resolution of video clips. The detailed discussion can be found in R.H. Chan et al. (2005). Experiments on an actual video clip show that our method can provide information that are not discernable from the given video clip.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Video clip consists of frames, and each frame can be considered as a transformed picture of the reference frame. In this paper, we briefly discuss a framelet method for high-resolution image reconstruction to enhance the resolution of video clips. The detailed discussion can be found in R.H. Chan et al. (2005). Experiments on an actual video clip show that our method can provide information that are not discernable from the given video clip.",
"fno": "01577303",
"keywords": [
"High Resolution Image Reconstruction",
"Resolution Enhancement",
"Video Clips",
"Tight Frame Approach"
],
"authors": [
{
"affiliation": "Dept. of Math., Chinese Univ. of Hong Kong, Shatin, China",
"fullName": "R.H. Chan",
"givenName": "R.H.",
"surname": "Chan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zuowei Shen",
"givenName": null,
"surname": "Zuowei Shen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Tao Xia",
"givenName": null,
"surname": "Tao Xia",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "avss",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-09-01T00:00:00",
"pubType": "proceedings",
"pages": "406-410",
"year": "2005",
"issn": null,
"isbn": "0-7803-9385-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01577302",
"articleId": "12OmNyfdOPy",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01577318",
"articleId": "12OmNrJiD04",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cgi/2004/2171/0/21710553",
"title": "Surface Denoising Using a Tight Frame",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2004/21710553/12OmNB1eJxm",
"parentPublication": {
"id": "proceedings/cgi/2004/2171/0",
"title": "Proceedings. Computer Graphics International",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssiai/2002/1537/0/15370193",
"title": "Super-Resolution Enhancement of Native Digital Video Versus Digitized NTSC Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/ssiai/2002/15370193/12OmNBqMDil",
"parentPublication": {
"id": "proceedings/ssiai/2002/1537/0",
"title": "Image Analysis and Interpretation, IEEE Southwest Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2012/2216/0/06460532",
"title": "Joint multi-frame super-resolution and matting",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2012/06460532/12OmNqIQS6f",
"parentPublication": {
"id": "proceedings/icpr/2012/2216/0",
"title": "2012 21st International Conference on Pattern Recognition (ICPR 2012)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1995/2431/4/00479905",
"title": "Improved definition video frame enhancement",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1995/00479905/12OmNqzu6Rf",
"parentPublication": {
"id": "proceedings/icassp/1995/2431/4",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icacc/2012/4723/0/4723a114",
"title": "An Improved Color Video Super-Resolution Using Kernel Regression and Fuzzy Enhancement",
"doi": null,
"abstractUrl": "/proceedings-article/icacc/2012/4723a114/12OmNxiKrX8",
"parentPublication": {
"id": "proceedings/icacc/2012/4723/0",
"title": "2012 International Conference on Advances in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1997/8183/3/81833062",
"title": "Bayesian estimation of subpixel-resolution motion fields and high-resolution video stills",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1997/81833062/12OmNyKa5Vo",
"parentPublication": {
"id": "proceedings/icip/1997/8183/3",
"title": "Proceedings of International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2011/0844/0/06027346",
"title": "Resolution enhancement of ROI from surveillance video using Bernstein interpolation",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2011/06027346/12OmNya72pP",
"parentPublication": {
"id": "proceedings/avss/2011/0844/0",
"title": "2011 8th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2005/9331/0/01521623",
"title": "Neighborhood issue in single-frame image super-resolution",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2005/01521623/12OmNzTH0H1",
"parentPublication": {
"id": "proceedings/icme/2005/9331/0",
"title": "2005 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111868",
"title": "Video Snapshots: Creating High-Quality Images from Video Clips",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111868/13rRUIM2VBF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000g626",
"title": "Frame-Recurrent Video Super-Resolution",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000g626/17D45WrVgbu",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNBNM940",
"title": "XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)",
"acronym": "sibgrapi",
"groupId": "1000131",
"volume": "0",
"displayVolume": "0",
"year": "2007",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzTH0Kx",
"doi": "10.1109/SIBGRAPI.2007.35",
"title": "Bipartite graph matching for video clip localization",
"normalizedTitle": "Bipartite graph matching for video clip localization",
"abstract": "Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the maximum cardinality matching of a bipartite graph to measure video clip similarity with a target video stream which has not been prep recessed. We show that our approach locates edited video clips, but it does not deal with insertion and removal of frames/shots, allowing only changes in the temporal order of frames/shots. All experiments performed in this work have achieved 100% of precision for two different video datasets. And according to those experiments, our method can achieve a global recall rate of 90%.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the maximum cardinality matching of a bipartite graph to measure video clip similarity with a target video stream which has not been prep recessed. We show that our approach locates edited video clips, but it does not deal with insertion and removal of frames/shots, allowing only changes in the temporal order of frames/shots. All experiments performed in this work have achieved 100% of precision for two different video datasets. And according to those experiments, our method can achieve a global recall rate of 90%.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the maximum cardinality matching of a bipartite graph to measure video clip similarity with a target video stream which has not been prep recessed. We show that our approach locates edited video clips, but it does not deal with insertion and removal of frames/shots, allowing only changes in the temporal order of frames/shots. All experiments performed in this work have achieved 100% of precision for two different video datasets. And according to those experiments, our method can achieve a global recall rate of 90%.",
"fno": "29960129",
"keywords": [
"Graph Theory",
"Image Matching",
"Video Streaming",
"Bipartite Graph Matching",
"Video Clip Localization",
"Video Stream",
"Maximum Cardinality Matching",
"Bipartite Graph",
"Streaming Media",
"Video Sharing",
"TV Broadcasting",
"Video Compression",
"Information Retrieval",
"Image Segmentation",
"Internet",
"Multimedia Communication",
"Distortion Measurement"
],
"authors": [
{
"affiliation": "Pontificia Universidade Catolica de Minas Gerais, Brazil",
"fullName": "Zenilton Kleber G. do Patrocinio Jr.",
"givenName": "Zenilton Kleber G. do",
"surname": "Patrocinio",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pontificia Universidade Catolica de Minas Gerais, Brazil",
"fullName": "Silvio Jamil F. Guimaraes",
"givenName": "Silvio Jamil F.",
"surname": "Guimaraes",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Pontificia Universidade Catolica de Minas Gerais, Brazil",
"fullName": "Hugo Bastos de Paula",
"givenName": "Hugo Bastos",
"surname": "de Paula",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sibgrapi",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2007-10-01T00:00:00",
"pubType": "proceedings",
"pages": "129-138",
"year": "2007",
"issn": "1530-1834",
"isbn": "0-7695-2996-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "29960027",
"articleId": "12OmNz4SOz6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "29960037",
"articleId": "12OmNBhZ4mA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2010/4109/0/4109c456",
"title": "Cell Tracking in Video Microscopy Using Bipartite Graph Matching",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109c456/12OmNAObbzn",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/3/01326601",
"title": "Detection of TV commercials",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326601/12OmNBSjJ0l",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/3",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmlc/2003/7865/5/01260057",
"title": "An approach to generating two-level video abstraction",
"doi": null,
"abstractUrl": "/proceedings-article/icmlc/2003/01260057/12OmNCcKQPO",
"parentPublication": {
"id": "proceedings/icmlc/2003/7865/1",
"title": "Proceedings of the 2003 International Conference on Machine Learning and Cybernetics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iacc/2017/1560/0/07976877",
"title": "Video Skimming for Lecture Video Sequences Using Histogram Based Low Level Features",
"doi": null,
"abstractUrl": "/proceedings-article/iacc/2017/07976877/12OmNqyUUye",
"parentPublication": {
"id": "proceedings/iacc/2017/1560/0",
"title": "2017 IEEE 7th International Advance Computing Conference (IACC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761142",
"title": "An approach for video cut detection using bipartite graph matching as dissimilarity distance",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761142/12OmNwDSdt6",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2008/3454/0/04741154",
"title": "A Rotation and Translation Invariant Algorithm for Cut Detection Using Bipartite Graph Matching",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2008/04741154/12OmNx2QUDW",
"parentPublication": {
"id": "proceedings/ism/2008/3454/0",
"title": "2008 Tenth IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2003/7965/1/7965317",
"title": "Video clip retrieval by maximal matching and optimal matching in graph theory",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2003/7965317/12OmNxFJXRr",
"parentPublication": {
"id": "proceedings/icme/2003/7965/1",
"title": "2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mmedia/2010/4068/0/4068a155",
"title": "Browsing Sport Content through an Interactive H.264 Streaming Session",
"doi": null,
"abstractUrl": "/proceedings-article/mmedia/2010/4068a155/12OmNyKrHiT",
"parentPublication": {
"id": "proceedings/mmedia/2010/4068/0",
"title": "Advances in Multimedia, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2020/6553/0/09093510",
"title": "Video Person Re-Identification using Learned Clip Similarity Aggregation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2020/09093510/1jPbrINhY3e",
"parentPublication": {
"id": "proceedings/wacv/2020/6553/0",
"title": "2020 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a146",
"title": "Learning Bipartite Graph Matching for Robust Visual Localization",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a146/1pysy3NAjaU",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNqHItAn",
"title": "2017 IEEE Third International Conference on Multimedia Big Data (BigMM)",
"acronym": "bigmm",
"groupId": "1808144",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzwZ6vM",
"doi": "10.1109/BigMM.2017.19",
"title": "Unsupervised Video Summaries Using Multiple Features and Image Quality",
"normalizedTitle": "Unsupervised Video Summaries Using Multiple Features and Image Quality",
"abstract": "It is important to generate both interesting and representative video summary for massive videos. This work proposes a new method to generate dynamic video summary using multiple features and image quality without human's involvement in the whole procedure. Specifically, we first split a video into several video clips. Second, a set of features including visual attention, exposure of light, saturation, hue, rule of thirds, contrast and directionality is computed and the qualities of video clips are also estimated. Then, the importance of each video clip is obtained based on these features and the estimated quality. Finally, based on the importance value, we sort clip values in descending order and select an optimal subset to generate video summary. Experimental results demonstrate that the proposed method enables to generate high-quality video summary.",
"abstracts": [
{
"abstractType": "Regular",
"content": "It is important to generate both interesting and representative video summary for massive videos. This work proposes a new method to generate dynamic video summary using multiple features and image quality without human's involvement in the whole procedure. Specifically, we first split a video into several video clips. Second, a set of features including visual attention, exposure of light, saturation, hue, rule of thirds, contrast and directionality is computed and the qualities of video clips are also estimated. Then, the importance of each video clip is obtained based on these features and the estimated quality. Finally, based on the importance value, we sort clip values in descending order and select an optimal subset to generate video summary. Experimental results demonstrate that the proposed method enables to generate high-quality video summary.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "It is important to generate both interesting and representative video summary for massive videos. This work proposes a new method to generate dynamic video summary using multiple features and image quality without human's involvement in the whole procedure. Specifically, we first split a video into several video clips. Second, a set of features including visual attention, exposure of light, saturation, hue, rule of thirds, contrast and directionality is computed and the qualities of video clips are also estimated. Then, the importance of each video clip is obtained based on these features and the estimated quality. Finally, based on the importance value, we sort clip values in descending order and select an optimal subset to generate video summary. Experimental results demonstrate that the proposed method enables to generate high-quality video summary.",
"fno": "07966729",
"keywords": [
"Video Signal Processing",
"Unsupervised Video Summaries",
"Image Quality",
"Representative Video Summary",
"Dynamic Video Summary",
"Visual Attention",
"Exposure Of Light",
"Saturation",
"Hue",
"Rule Of Thirds",
"Contrast",
"Directionality",
"Image Quality",
"Visualization",
"Feature Extraction",
"Image Segmentation",
"Image Color Analysis",
"Streaming Media",
"Heuristic Algorithms",
"Video Summary",
"Video Split",
"Multiple Features",
"Image Quality",
"Subset Selection"
],
"authors": [
{
"affiliation": null,
"fullName": "Tongling Hu",
"givenName": "Tongling",
"surname": "Hu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Zechao Li",
"givenName": "Zechao",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Weiyang Su",
"givenName": "Weiyang",
"surname": "Su",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Xing Mu",
"givenName": "Xing",
"surname": "Mu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jinhui Tang",
"givenName": "Jinhui",
"surname": "Tang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "bigmm",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-04-01T00:00:00",
"pubType": "proceedings",
"pages": "117-120",
"year": "2017",
"issn": null,
"isbn": "978-1-5090-6549-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07966728",
"articleId": "12OmNxy4MXT",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07966730",
"articleId": "12OmNxFaLDD",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icdcs/2015/7214/0/7214a780",
"title": "Improve Quality of Experience for Mobile Instant Video Clip Sharing",
"doi": null,
"abstractUrl": "/proceedings-article/icdcs/2015/7214a780/12OmNAOsMJX",
"parentPublication": {
"id": "proceedings/icdcs/2015/7214/0",
"title": "2015 IEEE 35th International Conference on Distributed Computing Systems (ICDCS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2015/6026/1/07163094",
"title": "Spontaneous facial expression analysis based on temperature changes and head motions",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2015/07163094/12OmNC2fGuw",
"parentPublication": {
"id": "proceedings/fg/2015/6026/5",
"title": "2015 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cit/2009/3836/1/3836a134",
"title": "A Video Retrieval Algorithm Based on Affective Features",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2009/3836a134/12OmNqC2v5w",
"parentPublication": {
"id": "proceedings/cit/2009/3836/1",
"title": "2009 Ninth IEEE International Conference on Computer and Information Technology. CIT 2009",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2011/348/0/06012080",
"title": "Example-based video remixing for home videos",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06012080/12OmNyrqznD",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2007/2996/0/29960129",
"title": "Bipartite graph matching for video clip localization",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2007/29960129/12OmNzTH0Kx",
"parentPublication": {
"id": "proceedings/sibgrapi/2007/2996/0",
"title": "XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111868",
"title": "Video Snapshots: Creating High-Quality Images from Video Clips",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111868/13rRUIM2VBF",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigmm/2018/5321/0/08499188",
"title": "Unsupervised Video Summarization Based on Consistent Clip Generation",
"doi": null,
"abstractUrl": "/proceedings-article/bigmm/2018/08499188/17D45XDIXTl",
"parentPublication": {
"id": "proceedings/bigmm/2018/5321/0",
"title": "2018 IEEE Fourth International Conference on Multimedia Big Data (BigMM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600a949",
"title": "Efficient Video Instance Segmentation via Tracklet Query and Proposal",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600a949/1H1kPG3AQM0",
"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/icvrv/2017/2636/0/263600a041",
"title": "A Novel Unsupervised Method for Temporal Segmentation of Videos",
"doi": null,
"abstractUrl": "/proceedings-article/icvrv/2017/263600a041/1ap5xqrduEg",
"parentPublication": {
"id": "proceedings/icvrv/2017/2636/0",
"title": "2017 International Conference on Virtual Reality and Visualization (ICVRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2019/9214/0/921400a156",
"title": "Deep Key Clips-Video Feature Fusion Framework for Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2019/921400a156/1cJ0zPaaKvm",
"parentPublication": {
"id": "proceedings/icmew/2019/9214/0",
"title": "2019 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__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": "1hVlCgl296E",
"doi": "10.1109/ICCV.2019.00633",
"title": "SCSampler: Sampling Salient Clips From Video for Efficient Action Recognition",
"normalizedTitle": "SCSampler: Sampling Salient Clips From Video for Efficient Action Recognition",
"abstract": "While many action recognition datasets consist of collections of brief, trimmed videos each containing a relevant action, videos in the real-world (e.g., on YouTube) exhibit very different properties: they are often several minutes long, where brief relevant clips are often interleaved with segments of extended duration containing little change. Applying densely an action recognition system to every temporal clip within such videos is prohibitively expensive. Furthermore, as we show in our experiments, this results in suboptimal recognition accuracy as informative predictions from relevant clips are outnumbered by meaningless classification outputs over long uninformative sections of the video. In this paper we introduce a lightweight ``clip-sampling'' model that can efficiently identify the most salient temporal clips within a long video. We demonstrate that the computational cost of action recognition on untrimmed videos can be dramatically reduced by invoking recognition only on these most salient clips. Furthermore, we show that this yields significant gains in recognition accuracy compared to analysis of all clips or randomly selected clips. On Sports1M, our clip sampling scheme elevates the accuracy of an already state-of-the-art action classifier by 7% and reduces by more than 15 times its computational cost.",
"abstracts": [
{
"abstractType": "Regular",
"content": "While many action recognition datasets consist of collections of brief, trimmed videos each containing a relevant action, videos in the real-world (e.g., on YouTube) exhibit very different properties: they are often several minutes long, where brief relevant clips are often interleaved with segments of extended duration containing little change. Applying densely an action recognition system to every temporal clip within such videos is prohibitively expensive. Furthermore, as we show in our experiments, this results in suboptimal recognition accuracy as informative predictions from relevant clips are outnumbered by meaningless classification outputs over long uninformative sections of the video. In this paper we introduce a lightweight ``clip-sampling'' model that can efficiently identify the most salient temporal clips within a long video. We demonstrate that the computational cost of action recognition on untrimmed videos can be dramatically reduced by invoking recognition only on these most salient clips. Furthermore, we show that this yields significant gains in recognition accuracy compared to analysis of all clips or randomly selected clips. On Sports1M, our clip sampling scheme elevates the accuracy of an already state-of-the-art action classifier by 7% and reduces by more than 15 times its computational cost.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "While many action recognition datasets consist of collections of brief, trimmed videos each containing a relevant action, videos in the real-world (e.g., on YouTube) exhibit very different properties: they are often several minutes long, where brief relevant clips are often interleaved with segments of extended duration containing little change. Applying densely an action recognition system to every temporal clip within such videos is prohibitively expensive. Furthermore, as we show in our experiments, this results in suboptimal recognition accuracy as informative predictions from relevant clips are outnumbered by meaningless classification outputs over long uninformative sections of the video. In this paper we introduce a lightweight ``clip-sampling'' model that can efficiently identify the most salient temporal clips within a long video. We demonstrate that the computational cost of action recognition on untrimmed videos can be dramatically reduced by invoking recognition only on these most salient clips. Furthermore, we show that this yields significant gains in recognition accuracy compared to analysis of all clips or randomly selected clips. On Sports1M, our clip sampling scheme elevates the accuracy of an already state-of-the-art action classifier by 7% and reduces by more than 15 times its computational cost.",
"fno": "480300g231",
"keywords": [
"Computer Vision",
"Feature Extraction",
"Image Classification",
"Image Motion Analysis",
"Learning Artificial Intelligence",
"Video Signal Processing",
"Sampling Salient Clips",
"Action Recognition",
"Action Recognition Datasets",
"Trimmed Videos",
"Relevant Action",
"Brief Relevant Clips",
"Temporal Clip",
"Suboptimal Recognition Accuracy",
"Long Uninformative Sections",
"Lightweight Clip Sampling Model",
"Salient Temporal Clips",
"Untrimmed Videos",
"Randomly Selected Clips",
"Clip Sampling Scheme",
"Action Classifier",
"Computational Modeling",
"Training",
"Proposals",
"Computational Efficiency",
"Face Recognition",
"Runtime",
"Task Analysis"
],
"authors": [
{
"affiliation": "Facebook",
"fullName": "Bruno Korbar",
"givenName": "Bruno",
"surname": "Korbar",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Facebook Research",
"fullName": "Du Tran",
"givenName": "Du",
"surname": "Tran",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Facebook AI Research",
"fullName": "Lorenzo Torresani",
"givenName": "Lorenzo",
"surname": "Torresani",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-10-01T00:00:00",
"pubType": "proceedings",
"pages": "6231-6241",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-4803-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "480300g221",
"articleId": "1hVl7RoAvao",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "480300g242",
"articleId": "1hVlJHC3jkQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/csse/2008/3336/4/3336g759",
"title": "Mining Similarities for Clustering Web Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g759/12OmNC0guvR",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2011/348/0/06012080",
"title": "Example-based video remixing for home videos",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2011/06012080/12OmNyrqznD",
"parentPublication": {
"id": "proceedings/icme/2011/348/0",
"title": "2011 IEEE International Conference on Multimedia and Expo",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600n3588",
"title": "TubeR: Tubelet Transformer for Video Action Detection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600n3588/1H1lPpG9w08",
"parentPublication": {
"id": "proceedings/cvpr/2022/6946/0",
"title": "2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2019/9214/0/921400a156",
"title": "Deep Key Clips-Video Feature Fusion Framework for Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2019/921400a156/1cJ0zPaaKvm",
"parentPublication": {
"id": "proceedings/icmew/2019/9214/0",
"title": "2019 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300i667",
"title": "HACS: Human Action Clips and Segments Dataset for Recognition and Temporal Localization",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300i667/1hVlKKv67Re",
"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/502300b533",
"title": "Enhancing Temporal Action Localization with Transfer Learning from Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2019/502300b533/1i5mq8ROeY0",
"parentPublication": {
"id": "proceedings/iccvw/2019/5023/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800k0454",
"title": "Listen to Look: Action Recognition by Previewing Audio",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800k0454/1m3nmafvpwA",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700d028",
"title": "Temporal Stochastic Softmax for 3D CNNs: An Application in Facial Expression Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700d028/1uqGNFckl1K",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900h563",
"title": "Beyond Short Clips: End-to-End Video-Level Learning with Collaborative Memories",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900h563/1yeJTb2n3YA",
"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": "1yeHGyRsuys",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1yeJTb2n3YA",
"doi": "10.1109/CVPR46437.2021.00748",
"title": "Beyond Short Clips: End-to-End Video-Level Learning with Collaborative Memories",
"normalizedTitle": "Beyond Short Clips: End-to-End Video-Level Learning with Collaborative Memories",
"abstract": "The standard way of training video models entails sampling at each iteration a single clip from a video and optimizing the clip prediction with respect to the video-level label. We argue that a single clip may not have enough temporal coverage to exhibit the label to recognize, since video datasets are often weakly labeled with categorical information but without dense temporal annotations. Furthermore, optimizing the model over brief clips impedes its ability to learn long-term temporal dependencies. To overcome these limitations, we introduce a collaborative memory mechanism that encodes information across multiple sampled clips of a video at each training iteration. This enables the learning of long-range dependencies beyond a single clip. We explore different design choices for the collaborative memory to ease the optimization difficulties. Our proposed framework is end-to-end trainable and significantly improves the accuracy of video classification at a negligible computational overhead. Through extensive experiments, we demonstrate that our framework generalizes to different video architectures and tasks, outperforming the state of the art on both action recognition (e.g., Kinetics-400 & 700, Charades, Something-Something-V1) and action detection (e.g., AVA v2.1 & v2.2).",
"abstracts": [
{
"abstractType": "Regular",
"content": "The standard way of training video models entails sampling at each iteration a single clip from a video and optimizing the clip prediction with respect to the video-level label. We argue that a single clip may not have enough temporal coverage to exhibit the label to recognize, since video datasets are often weakly labeled with categorical information but without dense temporal annotations. Furthermore, optimizing the model over brief clips impedes its ability to learn long-term temporal dependencies. To overcome these limitations, we introduce a collaborative memory mechanism that encodes information across multiple sampled clips of a video at each training iteration. This enables the learning of long-range dependencies beyond a single clip. We explore different design choices for the collaborative memory to ease the optimization difficulties. Our proposed framework is end-to-end trainable and significantly improves the accuracy of video classification at a negligible computational overhead. Through extensive experiments, we demonstrate that our framework generalizes to different video architectures and tasks, outperforming the state of the art on both action recognition (e.g., Kinetics-400 & 700, Charades, Something-Something-V1) and action detection (e.g., AVA v2.1 & v2.2).",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The standard way of training video models entails sampling at each iteration a single clip from a video and optimizing the clip prediction with respect to the video-level label. We argue that a single clip may not have enough temporal coverage to exhibit the label to recognize, since video datasets are often weakly labeled with categorical information but without dense temporal annotations. Furthermore, optimizing the model over brief clips impedes its ability to learn long-term temporal dependencies. To overcome these limitations, we introduce a collaborative memory mechanism that encodes information across multiple sampled clips of a video at each training iteration. This enables the learning of long-range dependencies beyond a single clip. We explore different design choices for the collaborative memory to ease the optimization difficulties. Our proposed framework is end-to-end trainable and significantly improves the accuracy of video classification at a negligible computational overhead. Through extensive experiments, we demonstrate that our framework generalizes to different video architectures and tasks, outperforming the state of the art on both action recognition (e.g., Kinetics-400 & 700, Charades, Something-Something-V1) and action detection (e.g., AVA v2.1 & v2.2).",
"fno": "450900h563",
"keywords": [
"Groupware",
"Image Classification",
"Image Motion Analysis",
"Image Sampling",
"Iterative Methods",
"Learning Artificial Intelligence",
"Storage Management",
"Video Coding",
"Action Recognition",
"Single Clip Sampling",
"Single Clip Iteration",
"Beyond Short Clips",
"End To End Video Level Learning",
"Training Video Models",
"Video Architectures",
"Video Classification",
"Collaborative Memory Mechanism",
"Long Term Temporal Dependencies",
"Video Datasets",
"Video Level Label",
"Clip Prediction",
"Training",
"Computer Vision",
"Collaboration",
"Computer Architecture",
"Predictive Models",
"Fasteners",
"Pattern Recognition"
],
"authors": [
{
"affiliation": "University of Maryland",
"fullName": "Xitong Yang",
"givenName": "Xitong",
"surname": "Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Facebook AI",
"fullName": "Haoqi Fan",
"givenName": "Haoqi",
"surname": "Fan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Facebook AI",
"fullName": "Lorenzo Torresani",
"givenName": "Lorenzo",
"surname": "Torresani",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Maryland",
"fullName": "Larry Davis",
"givenName": "Larry",
"surname": "Davis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Facebook AI",
"fullName": "Heng Wang",
"givenName": "Heng",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-06-01T00:00:00",
"pubType": "proceedings",
"pages": "7563-7572",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-4509-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "450900h552",
"articleId": "1yeIBzQqQEM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "450900h573",
"articleId": "1yeL839CVHO",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/acit-csi/2015/9642/0/9642a236",
"title": "Synchronization Method for Improving Temporal Harmony of Music and Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/acit-csi/2015/9642a236/12OmNAgoV8n",
"parentPublication": {
"id": "proceedings/acit-csi/2015/9642/0",
"title": "2015 3rd International Conference on Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence (ACIT-CSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlsid/2008/3083/0/30830712",
"title": "Watermarking Video Clips with Workload Information for DVS",
"doi": null,
"abstractUrl": "/proceedings-article/vlsid/2008/30830712/12OmNBOlldQ",
"parentPublication": {
"id": "proceedings/vlsid/2008/3083/0",
"title": "2008 21st International Conference on VLSI Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismse/2004/2217/0/22170186",
"title": "Detecting Tactics Patterns for Archiving Tennis Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/ismse/2004/22170186/12OmNBtCCBd",
"parentPublication": {
"id": "proceedings/ismse/2004/2217/0",
"title": "Multimedia Software Engineering, International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/4/3336g759",
"title": "Mining Similarities for Clustering Web Video Clips",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336g759/12OmNC0guvR",
"parentPublication": {
"id": "csse/2008/3336/4",
"title": "Computer Science and Software Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cimca/2008/3514/0/3514b223",
"title": "Fast Search Algorithm for Short Video Clips from Large Video Database Using a Novel Histogram Feature",
"doi": null,
"abstractUrl": "/proceedings-article/cimca/2008/3514b223/12OmNxwnctg",
"parentPublication": {
"id": "proceedings/cimca/2008/3514/0",
"title": "2008 International Conference on Computational Intelligence for Modelling Control & Automation (CIMCA 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2005/9385/0/01577303",
"title": "Resolution enhancement for video clips: tight frame approach",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2005/01577303/12OmNyRg4FE",
"parentPublication": {
"id": "proceedings/avss/2005/9385/0",
"title": "IEEE Conference on Advanced Video and Signal Based Surveillance, 2005.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2004/2128/3/212830866",
"title": "Fast and Robust Search Method for Short Video Clips from Large Video Collection",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2004/212830866/12OmNynJMQt",
"parentPublication": {
"id": "proceedings/icpr/2004/2128/3",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2019/9214/0/921400a156",
"title": "Deep Key Clips-Video Feature Fusion Framework for Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2019/921400a156/1cJ0zPaaKvm",
"parentPublication": {
"id": "proceedings/icmew/2019/9214/0",
"title": "2019 IEEE International Conference on Multimedia & Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2019/4803/0/480300g231",
"title": "SCSampler: Sampling Salient Clips From Video for Efficient Action Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300g231/1hVlCgl296E",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900e729",
"title": "3D CNNs with Adaptive Temporal Feature Resolutions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900e729/1yeIizFbTs4",
"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": "1ziP833pXeE",
"title": "2021 International Conference on Culture-oriented Science & Technology (ICCST)",
"acronym": "iccst",
"groupId": "1838984",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1ziPeZ8y0hi",
"doi": "10.1109/ICCST53801.2021.00099",
"title": "Text Based Video Retrieval among Video Clips",
"normalizedTitle": "Text Based Video Retrieval among Video Clips",
"abstract": "In recent years, the popularity of intelligent camera equipment has increased year by year, which has brought the number of videos growing rapidly. It is of practical significance to establish a high-quality video library for the reference of creators. In this paper we describe a video clip retrieval software, which can provide the corresponding video clips according to the needs of video creators such as directors and scriptwriters. The retrieval system is built around the traditional text based image retrieval (i.e. TBIR) method, and on the basis of which many improvements have been made, so that the retrieval speed and accuracy reach a high standard. From the practical experience, it is a successful attempt to apply TBIR to video retrieval.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In recent years, the popularity of intelligent camera equipment has increased year by year, which has brought the number of videos growing rapidly. It is of practical significance to establish a high-quality video library for the reference of creators. In this paper we describe a video clip retrieval software, which can provide the corresponding video clips according to the needs of video creators such as directors and scriptwriters. The retrieval system is built around the traditional text based image retrieval (i.e. TBIR) method, and on the basis of which many improvements have been made, so that the retrieval speed and accuracy reach a high standard. From the practical experience, it is a successful attempt to apply TBIR to video retrieval.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In recent years, the popularity of intelligent camera equipment has increased year by year, which has brought the number of videos growing rapidly. It is of practical significance to establish a high-quality video library for the reference of creators. In this paper we describe a video clip retrieval software, which can provide the corresponding video clips according to the needs of video creators such as directors and scriptwriters. The retrieval system is built around the traditional text based image retrieval (i.e. TBIR) method, and on the basis of which many improvements have been made, so that the retrieval speed and accuracy reach a high standard. From the practical experience, it is a successful attempt to apply TBIR to video retrieval.",
"fno": "425400a444",
"keywords": [
"Content Based Retrieval",
"Image Retrieval",
"Text Analysis",
"Video Retrieval",
"Video Signal Processing",
"High Quality Video Library",
"Video Clip Retrieval Software",
"Corresponding Video Clips",
"Video Creators",
"Traditional Text Based Image Retrieval",
"Retrieval Speed",
"Video Retrieval",
"Intelligent Camera Equipment",
"Image Retrieval",
"Cameras",
"Software",
"Libraries",
"Standards",
"Videos",
"Video Retrieval",
"Machine Learning",
"Image Retrieval"
],
"authors": [
{
"affiliation": "University of Science and Technology Beijing,Beijing,China",
"fullName": "Chi Zhang",
"givenName": "Chi",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Beijing Engineering Research Center of Digital Content,Beijing,China",
"fullName": "Guixuan Zhang",
"givenName": "Guixuan",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Beijing Engineering Research Center of Digital Content,Beijing,China",
"fullName": "Shuwu Zhang",
"givenName": "Shuwu",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccst",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-11-01T00:00:00",
"pubType": "proceedings",
"pages": "444-447",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-4254-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "425400a440",
"articleId": "1ziPdT2wnzG",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "425400a448",
"articleId": "1ziPaHLiYJG",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/2000/0750/1/00905548",
"title": "Video retrieval based on dynamics of color flows",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2000/00905548/12OmNvnOwpT",
"parentPublication": {
"id": "proceedings/icpr/2000/0750/1",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2009/4420/0/05459258",
"title": "Storyboard sketches for Content Based Video Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2009/05459258/12OmNwoxSct",
"parentPublication": {
"id": "proceedings/iccv/2009/4420/0",
"title": "2009 IEEE 12th International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ams/2009/3648/0/3648a353",
"title": "Hidden Markov Model for Content-Based Video Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/ams/2009/3648a353/12OmNwp74L9",
"parentPublication": {
"id": "proceedings/ams/2009/3648/0",
"title": "Asia International Conference on Modelling & Simulation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ism/2008/3454/0/3454a625",
"title": "Semantic Event Retrieval from Surveillance Video Databases",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2008/3454a625/12OmNzC5SGD",
"parentPublication": {
"id": "proceedings/ism/2008/3454/0",
"title": "2008 Tenth IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2013/03/ttp2013030716",
"title": "Tag Completion for Image Retrieval",
"doi": null,
"abstractUrl": "/journal/tp/2013/03/ttp2013030716/13rRUxC0Sx3",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2022/8563/0/09859629",
"title": "Spatial-Temporal Alignment via Optimal Transport for Video-Text Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2022/09859629/1G9Egg5e2By",
"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/694600q6146",
"title": "Bridging Video-text Retrieval with Multiple Choice Questions",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600q6146/1H1njMDShfq",
"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/icdew/2019/0890/0/089000a209",
"title": "Semantic Parsing and Attentive Feature-Temporal Pooling Network for Video-Based Person Image Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icdew/2019/089000a209/1bhJ7I6Z3A4",
"parentPublication": {
"id": "proceedings/icdew/2019/0890/0",
"title": "2019 IEEE 35th International Conference on Data Engineering Workshops (ICDEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icme/2020/1331/0/09102760",
"title": "A Novel Convolutional Architecture For Video-Text Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/icme/2020/09102760/1kwrcYX5m4E",
"parentPublication": {
"id": "proceedings/icme/2020/1331/0",
"title": "2020 IEEE International Conference on Multimedia and Expo (ICME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800k0635",
"title": "Fine-Grained Video-Text Retrieval With Hierarchical Graph Reasoning",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800k0635/1m3nCIF1KOA",
"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": "12OmNyqRndY",
"title": "Pattern Recognition, International Conference on",
"acronym": "icpr",
"groupId": "1000545",
"volume": "1",
"displayVolume": "1",
"year": "2000",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNweTvQW",
"doi": "10.1109/ICPR.2000.905643",
"title": "Affine-Invariant Curve Normalization for Shape-Based Retrieval",
"normalizedTitle": "Affine-Invariant Curve Normalization for Shape-Based Retrieval",
"abstract": "A novel method for two-dimensional curve normalization with respect to affine transformations is presented in this paper, allowing an affine-invariant curve representation to be obtained without any actual loss of information on the original curve. It can be applied as a pre-processing step to any shape representation, classification, recognition or retrieval technique, since it effectively decouples the problem of affine-invariant description from feature extraction and pattern matching. Curves estimated from object contours are first modeled by cubic B-splines and then normalized in several steps in order to eliminate translation, scaling, skew, starting point, rotation and reflection transformations, based on a combination of curve features including moments and Fourier descriptors.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A novel method for two-dimensional curve normalization with respect to affine transformations is presented in this paper, allowing an affine-invariant curve representation to be obtained without any actual loss of information on the original curve. It can be applied as a pre-processing step to any shape representation, classification, recognition or retrieval technique, since it effectively decouples the problem of affine-invariant description from feature extraction and pattern matching. Curves estimated from object contours are first modeled by cubic B-splines and then normalized in several steps in order to eliminate translation, scaling, skew, starting point, rotation and reflection transformations, based on a combination of curve features including moments and Fourier descriptors.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A novel method for two-dimensional curve normalization with respect to affine transformations is presented in this paper, allowing an affine-invariant curve representation to be obtained without any actual loss of information on the original curve. It can be applied as a pre-processing step to any shape representation, classification, recognition or retrieval technique, since it effectively decouples the problem of affine-invariant description from feature extraction and pattern matching. Curves estimated from object contours are first modeled by cubic B-splines and then normalized in several steps in order to eliminate translation, scaling, skew, starting point, rotation and reflection transformations, based on a combination of curve features including moments and Fourier descriptors.",
"fno": "07505015",
"keywords": [
"Curve Normalization",
"Affine Invariant Shape Representation",
"Content Based Image Retrieval"
],
"authors": [
{
"affiliation": "National Technical University of Athens",
"fullName": "Yannis Avrithis",
"givenName": "Yannis",
"surname": "Avrithis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Technical University of Athens",
"fullName": "Yiannis Xirouhakis",
"givenName": "Yiannis",
"surname": "Xirouhakis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "National Technical University of Athens",
"fullName": "Stefanos Kollias",
"givenName": "Stefanos",
"surname": "Kollias",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2000-09-01T00:00:00",
"pubType": "proceedings",
"pages": "5015",
"year": "2000",
"issn": null,
"isbn": "0-7695-0750-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07505011",
"articleId": "12OmNwCsdCF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07505019",
"articleId": "12OmNAlNiNJ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyaXPP0",
"title": "Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)",
"acronym": "cad-cg",
"groupId": "1001488",
"volume": "0",
"displayVolume": "0",
"year": "2005",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzTH12O",
"doi": "10.1109/CAD-CG.2005.83",
"title": "The curve-structure invariant moments for shape analysis and recognition",
"normalizedTitle": "The curve-structure invariant moments for shape analysis and recognition",
"abstract": "This correspondence addresses the problem of rotation, scale, and translation invariant recognition of images. Object shape comparability is a challenging problem in the field of pattern recognition and computer vision. The method based on the geometric moment invariants is the typical method in these applications. This paper introduces curve structure moment invariants based on the geometric moment invariants from transforming the density in geometric moments into a new density. The difference in the shapes is increased by using the curve structure moment invariants. Therefore, this method can be used in object shape analysis. To support our new theory , an algorithm for object shape analysis is designed and experiments based on square transform are conducted. Experiments give an encouraging high recognition rate by using the curve structure moment invariants.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This correspondence addresses the problem of rotation, scale, and translation invariant recognition of images. Object shape comparability is a challenging problem in the field of pattern recognition and computer vision. The method based on the geometric moment invariants is the typical method in these applications. This paper introduces curve structure moment invariants based on the geometric moment invariants from transforming the density in geometric moments into a new density. The difference in the shapes is increased by using the curve structure moment invariants. Therefore, this method can be used in object shape analysis. To support our new theory , an algorithm for object shape analysis is designed and experiments based on square transform are conducted. Experiments give an encouraging high recognition rate by using the curve structure moment invariants.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This correspondence addresses the problem of rotation, scale, and translation invariant recognition of images. Object shape comparability is a challenging problem in the field of pattern recognition and computer vision. The method based on the geometric moment invariants is the typical method in these applications. This paper introduces curve structure moment invariants based on the geometric moment invariants from transforming the density in geometric moments into a new density. The difference in the shapes is increased by using the curve structure moment invariants. Therefore, this method can be used in object shape analysis. To support our new theory , an algorithm for object shape analysis is designed and experiments based on square transform are conducted. Experiments give an encouraging high recognition rate by using the curve structure moment invariants.",
"fno": "24730163",
"keywords": [
"Shape Analysis",
"Curve Moments",
"Curve Structure Moment Invariants",
"Hu Moment Invariants"
],
"authors": [
{
"affiliation": "Institute of Computing Technology Chinese Academy of Science, China",
"fullName": "Zongmin Li",
"givenName": "Zongmin",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institute of Computing Technology Chinese Academy of Science, China",
"fullName": "Yujie Liu",
"givenName": "Yujie",
"surname": "Liu",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Institute of Computing Technology Chinese Academy of Science, China",
"fullName": "Hua Li",
"givenName": "Hua",
"surname": "Li",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University Of Petroleum, Shandong ,China",
"fullName": "Jan Zhang",
"givenName": "Jan",
"surname": "Zhang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cad-cg",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2005-12-01T00:00:00",
"pubType": "proceedings",
"pages": "163-167",
"year": "2005",
"issn": null,
"isbn": "0-7695-2473-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "24730157",
"articleId": "12OmNrMZpGu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "24730168",
"articleId": "12OmNylsZX1",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ism/2009/3890/0/3890a318",
"title": "Scale Invariants of Radial Tchebichef Moments for Shape-Based Image Retrieval",
"doi": null,
"abstractUrl": "/proceedings-article/ism/2009/3890a318/12OmNAnuTAJ",
"parentPublication": {
"id": "proceedings/ism/2009/3890/0",
"title": "2009 11th IEEE International Symposium on Multimedia",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccta/2007/2770/0/27700676",
"title": "Image Watermarking Using Krawtchouk Moments",
"doi": null,
"abstractUrl": "/proceedings-article/iccta/2007/27700676/12OmNC8MsKu",
"parentPublication": {
"id": "proceedings/iccta/2007/2770/0",
"title": "International Conference on Computing: Theory and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2004/2127/0/21270217",
"title": "Affine Invariant Multiscale Wavelet-Based Shape Matching Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2004/21270217/12OmNx57HRc",
"parentPublication": {
"id": "proceedings/crv/2004/2127/0",
"title": "First Canadian Conference on Computer and Robot Vision, 2004. Proceedings.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cisp/2008/3119/2/3119b801",
"title": "Shape Feature Extraction of High Resolution Remote Sensing Image Based on SUSAN and Moment Invariant",
"doi": null,
"abstractUrl": "/proceedings-article/cisp/2008/3119b801/12OmNxR5UNu",
"parentPublication": {
"id": "proceedings/cisp/2008/3119/3",
"title": "Image and Signal Processing, Congress on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cadgraphics/2011/4497/0/4497a425",
"title": "A Kind of Shape-Color Moment Invariants",
"doi": null,
"abstractUrl": "/proceedings-article/cadgraphics/2011/4497a425/12OmNxXUhWJ",
"parentPublication": {
"id": "proceedings/cadgraphics/2011/4497/0",
"title": "Computer-Aided Design and Computer Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icrccs/2009/3927/0/3927a168",
"title": "A Robust Binary Image Watermarking Based on Wavelet Domain and Krawtchouk Moments",
"doi": null,
"abstractUrl": "/proceedings-article/icrccs/2009/3927a168/12OmNyQpgPf",
"parentPublication": {
"id": "proceedings/icrccs/2009/3927/0",
"title": "Research Challenges in Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/elmar/2006/4403/0/04127480",
"title": "Assessment of Region-Based Moment Invariants for Object Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/elmar/2006/04127480/12OmNznkJQv",
"parentPublication": {
"id": "proceedings/elmar/2006/4403/0",
"title": "International Symposium ELMAR",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1995/11/i1106",
"title": "Complete Sets of Complex Zernike Moment Invariants and the Role of the Pseudoinvariants",
"doi": null,
"abstractUrl": "/journal/tp/1995/11/i1106/13rRUwdrdLJ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1998/08/i0819",
"title": "n-Dimensional Moment Invariants and Conceptual Mathematical Theory of Recognition n-Dimensional Solids",
"doi": null,
"abstractUrl": "/journal/tp/1998/08/i0819/13rRUxlgxXo",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAo45Ck",
"title": "Proceedings 10th International Conference on Pattern Recognition",
"acronym": "icpr",
"groupId": "1000545",
"volume": "1",
"displayVolume": "1",
"year": "1990",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzkMlT2",
"doi": "10.1109/ICPR.1990.118227",
"title": "Planar curve segmentation for recognition of partially occluded shapes",
"normalizedTitle": "Planar curve segmentation for recognition of partially occluded shapes",
"abstract": "2D shape boundary segmentation is required as a fundamental and important stage in the recognition process of partially occluded objects. The authors introduce a segmentation approach which is invariant to similarity transformation and in which partial occlusion has only marginal influence on the segmentation of the visible part. The basic concept is to transform the curve into another curve which intersects itself. Points of intersection of the new curve are retransformed to the original curve and serve as endpoints of segments. Properties of the transform are discussed, and conditions for the existence of intersection points are given. Simulation results, showing substantial immunity to noise, are presented, and advantages of the proposed method over conventional approaches relying on singular points of the curvature are discussed.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "2D shape boundary segmentation is required as a fundamental and important stage in the recognition process of partially occluded objects. The authors introduce a segmentation approach which is invariant to similarity transformation and in which partial occlusion has only marginal influence on the segmentation of the visible part. The basic concept is to transform the curve into another curve which intersects itself. Points of intersection of the new curve are retransformed to the original curve and serve as endpoints of segments. Properties of the transform are discussed, and conditions for the existence of intersection points are given. Simulation results, showing substantial immunity to noise, are presented, and advantages of the proposed method over conventional approaches relying on singular points of the curvature are discussed.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "2D shape boundary segmentation is required as a fundamental and important stage in the recognition process of partially occluded objects. The authors introduce a segmentation approach which is invariant to similarity transformation and in which partial occlusion has only marginal influence on the segmentation of the visible part. The basic concept is to transform the curve into another curve which intersects itself. Points of intersection of the new curve are retransformed to the original curve and serve as endpoints of segments. Properties of the transform are discussed, and conditions for the existence of intersection points are given. Simulation results, showing substantial immunity to noise, are presented, and advantages of the proposed method over conventional approaches relying on singular points of the curvature are discussed.",
"fno": "00118227",
"keywords": [
"Pattern Recognition",
"Picture Processing",
"Planar Curve Segmentation",
"Shape Recognition",
"Object Recognition",
"Intersection Points",
"Segment Endpoints",
"Noise Immunity",
"Partially Occluded Shapes",
"2 D Shape Boundary Segmentation",
"Shape",
"Noise Shaping",
"Computer Vision",
"Smoothing Methods",
"Geometry"
],
"authors": [
{
"affiliation": "Dept. of Electr. Eng., Technion, Haifa, Israel",
"fullName": "N. Katzir",
"givenName": "N.",
"surname": "Katzir",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electr. Eng., Technion, Haifa, Israel",
"fullName": "M. Lindebaum",
"givenName": "M.",
"surname": "Lindebaum",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Electr. Eng., Technion, Haifa, Israel",
"fullName": "M. Porat",
"givenName": "M.",
"surname": "Porat",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1990-01-01T00:00:00",
"pubType": "proceedings",
"pages": "842,843,844,845,846",
"year": "1990",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00118226",
"articleId": "12OmNxEBz4j",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00118228",
"articleId": "12OmNB7LvBj",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/isspit/2006/9753/0/04042288",
"title": "Concave and Convex Area on Planar Curve for Shape Defect Detection and Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/isspit/2006/04042288/12OmNAZfxI8",
"parentPublication": {
"id": "proceedings/isspit/2006/9753/0",
"title": "2006 IEEE International Symposium on Signal Processing and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/1991/0003/0/00150901",
"title": "Optimal local spline approximation of planar shape",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/1991/00150901/12OmNvAAtwS",
"parentPublication": {
"id": "proceedings/icassp/1991/0003/0",
"title": "Acoustics, Speech, and Signal Processing, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icip/1994/6952/1/00413400",
"title": "On planar curve representation",
"doi": null,
"abstractUrl": "/proceedings-article/icip/1994/00413400/12OmNviZlA1",
"parentPublication": {
"id": "proceedings/icip/1994/6952/3",
"title": "Proceedings of 1st International Conference on Image Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1988/0878/0/00028173",
"title": "Partial matching of two dimensional shapes using random coding",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028173/12OmNvmowON",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/1990/2057/0/00139633",
"title": "A new transform for curve detection",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/1990/00139633/12OmNvpw7eb",
"parentPublication": {
"id": "proceedings/iccv/1990/2057/0",
"title": "Proceedings Third International Conference on Computer Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscid/2008/3311/2/3311b283",
"title": "Constrained Free Form Deformation Driven by Sectional Outline Curve",
"doi": null,
"abstractUrl": "/proceedings-article/iscid/2008/3311b283/12OmNwMFMm6",
"parentPublication": {
"id": "proceedings/iscid/2008/3311/2",
"title": "2008 International Symposium on Computational Intelligence and Design",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ssst/1991/2190/0/00138519",
"title": "Representation of a curved boundary",
"doi": null,
"abstractUrl": "/proceedings-article/ssst/1991/00138519/12OmNyPQ4Oe",
"parentPublication": {
"id": "proceedings/ssst/1991/2190/0",
"title": "The Twenty-Third Southeastern Symposium on System Theory",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/2/01326310",
"title": "Semiparametric skew-symmetric modeling of planar shapes",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326310/12OmNzVoBtQ",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/2",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1991/2148/0/00139802",
"title": "On the representation of occluded shapes",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1991/00139802/12OmNzvz6Nu",
"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": "trans/tp/1994/05/i0513",
"title": "Curve Segmentation Under Partial Occlusion",
"doi": null,
"abstractUrl": "/journal/tp/1994/05/i0513/13rRUxBrGhQ",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzcxZeB",
"title": "Games and Virtual Worlds for Serious Applications, Conference in",
"acronym": "vs-games",
"groupId": "1002788",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqyDjtb",
"doi": "10.1109/VS-GAMES.2011.38",
"title": "The Importance of Eye Gaze and Head Pose to Estimating Levels of Attention",
"normalizedTitle": "The Importance of Eye Gaze and Head Pose to Estimating Levels of Attention",
"abstract": "This paper explores, from a theoretical and technical point of view, the role of head rotation and eye gaze directionality to the human perception of attention from non-verbal cues. We have annotated two different versions of the same dataset, in order to correlate the above parameters with the degree people have considered people in the dataset pay attention to a hypothetical task they have in front of them. Based on our findings, we investigate the role of eye gaze directionality in relation to head rotations and, based on previous studies, we developed an algorithm for estimating attention levels from head pose, eye gaze and facial feature spatial locations. With the help of our AI system and people's annotation, we have made a first attempt towards quantifying the role of each cue to the overall estimation of attention. One of the important properties of the technical part of this work is that all systems we used were non-intrusive and did not demand any personal training or calibration phase, constituting themselves ideal for Game playing. Knowing the behavioral state of a player can be of vital importance for adapting the game design during interaction, or building personal profiles, leading to appropriate game features aiming at maximizing player satisfaction.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper explores, from a theoretical and technical point of view, the role of head rotation and eye gaze directionality to the human perception of attention from non-verbal cues. We have annotated two different versions of the same dataset, in order to correlate the above parameters with the degree people have considered people in the dataset pay attention to a hypothetical task they have in front of them. Based on our findings, we investigate the role of eye gaze directionality in relation to head rotations and, based on previous studies, we developed an algorithm for estimating attention levels from head pose, eye gaze and facial feature spatial locations. With the help of our AI system and people's annotation, we have made a first attempt towards quantifying the role of each cue to the overall estimation of attention. One of the important properties of the technical part of this work is that all systems we used were non-intrusive and did not demand any personal training or calibration phase, constituting themselves ideal for Game playing. Knowing the behavioral state of a player can be of vital importance for adapting the game design during interaction, or building personal profiles, leading to appropriate game features aiming at maximizing player satisfaction.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper explores, from a theoretical and technical point of view, the role of head rotation and eye gaze directionality to the human perception of attention from non-verbal cues. We have annotated two different versions of the same dataset, in order to correlate the above parameters with the degree people have considered people in the dataset pay attention to a hypothetical task they have in front of them. Based on our findings, we investigate the role of eye gaze directionality in relation to head rotations and, based on previous studies, we developed an algorithm for estimating attention levels from head pose, eye gaze and facial feature spatial locations. With the help of our AI system and people's annotation, we have made a first attempt towards quantifying the role of each cue to the overall estimation of attention. One of the important properties of the technical part of this work is that all systems we used were non-intrusive and did not demand any personal training or calibration phase, constituting themselves ideal for Game playing. Knowing the behavioral state of a player can be of vital importance for adapting the game design during interaction, or building personal profiles, leading to appropriate game features aiming at maximizing player satisfaction.",
"fno": "4419a186",
"keywords": [
"Head Pose Estimation",
"Eye Gaze Estimation",
"User Attention Estimation",
"User Modelling"
],
"authors": [
{
"affiliation": null,
"fullName": "Stylianos Asteriadis",
"givenName": "Stylianos",
"surname": "Asteriadis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kostas Karpouzis",
"givenName": "Kostas",
"surname": "Karpouzis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Stefanos Kollias",
"givenName": "Stefanos",
"surname": "Kollias",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vs-games",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-05-01T00:00:00",
"pubType": "proceedings",
"pages": "186-191",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4419-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4419a184",
"articleId": "12OmNBqv2gN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4419a192",
"articleId": "12OmNvy25bc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fg/2018/2335/0/233501a789",
"title": "Human Computer Interaction with Head Pose, Eye Gaze and Body Gestures",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2018/233501a789/12OmNASILS4",
"parentPublication": {
"id": "proceedings/fg/2018/2335/0",
"title": "2018 13th IEEE International Conference on Automatic Face & Gesture Recognition (FG 2018)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icinis/2010/4249/0/4249a048",
"title": "Implementation and Optimization of the Eye Gaze Tracking System Based on DM642",
"doi": null,
"abstractUrl": "/proceedings-article/icinis/2010/4249a048/12OmNs4S8I4",
"parentPublication": {
"id": "proceedings/icinis/2010/4249/0",
"title": "Intelligent Networks and Intelligent Systems, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2017/1032/0/1032b003",
"title": "Real Time Eye Gaze Tracking with 3D Deformable Eye-Face Model",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032b003/12OmNwNeYAV",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130271",
"title": "Robust validation of Visual Focus of Attention using adaptive fusion of head and eye gaze patterns",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130271/12OmNwlZtZF",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109d870",
"title": "Visual Gaze Estimation by Joint Head and Eye Information",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109d870/12OmNyRg4Cq",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnc/2009/3736/1/3736a342",
"title": "The Role of Trait Anxiety in the Interaction between Eye Gaze and Facial Expressions",
"doi": null,
"abstractUrl": "/proceedings-article/icnc/2009/3736a342/12OmNzAohXt",
"parentPublication": {
"id": "proceedings/icnc/2009/3736/4",
"title": "2009 Fifth International Conference on Natural Computation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ihmsc/2010/4151/1/4151a300",
"title": "A Novel Simple 2D Model of Eye Gaze Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/ihmsc/2010/4151a300/12OmNzQR1nK",
"parentPublication": {
"id": "proceedings/ihmsc/2010/4151/1",
"title": "Intelligent Human-Machine Systems and Cybernetics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2022/5325/0/532500a082",
"title": "Real-time Gaze Tracking with Head-eye Coordination for Head-mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2022/532500a082/1JrQQ8dsLKM",
"parentPublication": {
"id": "proceedings/ismar/2022/5325/0",
"title": "2022 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2021/4057/0/405700a554",
"title": "Estimating Gaze From Head and Hand Pose and Scene Images for Open-Ended Exploration in VR Environments",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2021/405700a554/1tnY5akLwvS",
"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"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwErpGQ",
"title": "2010 Conference on Visual Media Production",
"acronym": "cvmp",
"groupId": "1003129",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxFaLtB",
"doi": "10.1109/CVMP.2010.28",
"title": "Prominence Driven Character Animation",
"normalizedTitle": "Prominence Driven Character Animation",
"abstract": "This paper details the development of a fully automated system for character animation implemented in Autodesk Maya. The system uses prioritised speech events to algorithmically generate head, body, arms and leg movements alongside eyeblinks, eyebrow movements and lip-synching. In addition, gaze tracking is also generated automatically relative to the definition of focus objects- contextually important objects in the character’s worldview. The plugin uses an animation profile to store the relevant controllers and movements for a specific character, allowing any character to run with the system. Once a profile has been created, an audio file can be loaded and animated with a single button click. The average time to animate is between 2-3 minutes for 1 minute of speech, and the plugin can be used either as a first pass system for high quality work or as part of a batch animation workflow for larger amounts of content as exemplified in television and online dissemination channels.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper details the development of a fully automated system for character animation implemented in Autodesk Maya. The system uses prioritised speech events to algorithmically generate head, body, arms and leg movements alongside eyeblinks, eyebrow movements and lip-synching. In addition, gaze tracking is also generated automatically relative to the definition of focus objects- contextually important objects in the character’s worldview. The plugin uses an animation profile to store the relevant controllers and movements for a specific character, allowing any character to run with the system. Once a profile has been created, an audio file can be loaded and animated with a single button click. The average time to animate is between 2-3 minutes for 1 minute of speech, and the plugin can be used either as a first pass system for high quality work or as part of a batch animation workflow for larger amounts of content as exemplified in television and online dissemination channels.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper details the development of a fully automated system for character animation implemented in Autodesk Maya. The system uses prioritised speech events to algorithmically generate head, body, arms and leg movements alongside eyeblinks, eyebrow movements and lip-synching. In addition, gaze tracking is also generated automatically relative to the definition of focus objects- contextually important objects in the character’s worldview. The plugin uses an animation profile to store the relevant controllers and movements for a specific character, allowing any character to run with the system. Once a profile has been created, an audio file can be loaded and animated with a single button click. The average time to animate is between 2-3 minutes for 1 minute of speech, and the plugin can be used either as a first pass system for high quality work or as part of a batch animation workflow for larger amounts of content as exemplified in television and online dissemination channels.",
"fno": "4268a171",
"keywords": [
"Animation",
"Prominence Speech Analysis"
],
"authors": [
{
"affiliation": null,
"fullName": "Charlie Cullen",
"givenName": "Charlie",
"surname": "Cullen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Paula McGloin",
"givenName": "Paula",
"surname": "McGloin",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Anna Deegan",
"givenName": "Anna",
"surname": "Deegan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Evin McCarthy",
"givenName": "Evin",
"surname": "McCarthy",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvmp",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-11-01T00:00:00",
"pubType": "proceedings",
"pages": "171-178",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4268-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4268a161",
"articleId": "12OmNrkT7zc",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4268a179",
"articleId": "12OmNz4Bdn6",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/culture-computing/2011/4546/0/4546a121",
"title": "Thai Speech-Driven Facial Animation",
"doi": null,
"abstractUrl": "/proceedings-article/culture-computing/2011/4546a121/12OmNARiM0A",
"parentPublication": {
"id": "proceedings/culture-computing/2011/4546/0",
"title": "International Conference on Culture and Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2010/4215/0/4215a046",
"title": "Building Hand Motion-Based Character Animation: The Case of Puppetry",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2010/4215a046/12OmNAle6A0",
"parentPublication": {
"id": "proceedings/cw/2010/4215/0",
"title": "2010 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dmdcm/2011/4413/0/4413a086",
"title": "A Review of Dynamic Motion Control Considering Physics for Real Time Animation Character",
"doi": null,
"abstractUrl": "/proceedings-article/dmdcm/2011/4413a086/12OmNBJeyHe",
"parentPublication": {
"id": "proceedings/dmdcm/2011/4413/0",
"title": "Digital Media and Digital Content Management, Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2004/2177/0/21770841",
"title": "Control of Motion in Character Animation",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2004/21770841/12OmNCfSqGT",
"parentPublication": {
"id": "proceedings/iv/2004/2177/0",
"title": "Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ichit/2008/3328/0/3328a222",
"title": "Character Animation Tool ?Biped Hand Selector?",
"doi": null,
"abstractUrl": "/proceedings-article/ichit/2008/3328a222/12OmNrkT7y9",
"parentPublication": {
"id": "proceedings/ichit/2008/3328/0",
"title": "2008 International Conference on Convergence and Hybrid Information Technology (ICHIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icicta/2015/7644/0/7644a797",
"title": "Research on Vertex Deformation Algorithms of Character Animation Model",
"doi": null,
"abstractUrl": "/proceedings-article/icicta/2015/7644a797/12OmNx76TT1",
"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/isuvr/2010/4124/0/4124a012",
"title": "Physics-Based Character Animation for AR Applications",
"doi": null,
"abstractUrl": "/proceedings-article/isuvr/2010/4124a012/12OmNzzP5BN",
"parentPublication": {
"id": "proceedings/isuvr/2010/4124/0",
"title": "International Symposium on Ubiquitous Virtual Reality",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111915",
"title": "A Statistical Quality Model for Data-Driven Speech Animation",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111915/13rRUIIVlkf",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/netcit/2022/9273/0/927300a622",
"title": "Fast Adaptive Character Animation Synthesis Algorithm Based on Depth Image Sequence",
"doi": null,
"abstractUrl": "/proceedings-article/netcit/2022/927300a622/1LSPS1Pu7YY",
"parentPublication": {
"id": "proceedings/netcit/2022/9273/0",
"title": "2022 2nd International Conference on Networking, Communications and Information Technology (NetCIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090677",
"title": "PoseMMR: A Collaborative Mixed Reality Authoring Tool for Character Animation",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090677/1jIxxM75R4I",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "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": "1H1lUSkaTeg",
"doi": "10.1109/CVPR52688.2022.01976",
"title": "Speech Driven Tongue Animation",
"normalizedTitle": "Speech Driven Tongue Animation",
"abstract": "Advances in speech driven animation techniques allow the creation of convincing animations for virtual characters solely from audio data. Many existing approaches focus on facial and lip motion and they often do not provide realistic animation of the inner mouth. This paper addresses the problem of speech-driven inner mouth animation. Obtaining performance capture data of the tongue and jaw from video alone is difficult because the inner mouth is only partially observable during speech. In this work, we introduce a large-scale speech and mocap dataset that focuses on capturing tongue, jaw, and lip motion. This dataset enables research using data-driven techniques to generate realistic inner mouth animation from speech. We then propose a deep-learning based method for accurate and generalizable speech to tongue and jaw animation, and evaluate several encoder-decoder network architectures and audio feature encoders. We find that recent self-supervised deep learning based audio feature encoders are robust, generalize well to unseen speakers and content, and work best for our task. To demonstrate the practical application of our approach, we show animations on high-quality parametric 3D face models driven by the landmarks generated from our speech-to-tongue animation method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Advances in speech driven animation techniques allow the creation of convincing animations for virtual characters solely from audio data. Many existing approaches focus on facial and lip motion and they often do not provide realistic animation of the inner mouth. This paper addresses the problem of speech-driven inner mouth animation. Obtaining performance capture data of the tongue and jaw from video alone is difficult because the inner mouth is only partially observable during speech. In this work, we introduce a large-scale speech and mocap dataset that focuses on capturing tongue, jaw, and lip motion. This dataset enables research using data-driven techniques to generate realistic inner mouth animation from speech. We then propose a deep-learning based method for accurate and generalizable speech to tongue and jaw animation, and evaluate several encoder-decoder network architectures and audio feature encoders. We find that recent self-supervised deep learning based audio feature encoders are robust, generalize well to unseen speakers and content, and work best for our task. To demonstrate the practical application of our approach, we show animations on high-quality parametric 3D face models driven by the landmarks generated from our speech-to-tongue animation method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Advances in speech driven animation techniques allow the creation of convincing animations for virtual characters solely from audio data. Many existing approaches focus on facial and lip motion and they often do not provide realistic animation of the inner mouth. This paper addresses the problem of speech-driven inner mouth animation. Obtaining performance capture data of the tongue and jaw from video alone is difficult because the inner mouth is only partially observable during speech. In this work, we introduce a large-scale speech and mocap dataset that focuses on capturing tongue, jaw, and lip motion. This dataset enables research using data-driven techniques to generate realistic inner mouth animation from speech. We then propose a deep-learning based method for accurate and generalizable speech to tongue and jaw animation, and evaluate several encoder-decoder network architectures and audio feature encoders. We find that recent self-supervised deep learning based audio feature encoders are robust, generalize well to unseen speakers and content, and work best for our task. To demonstrate the practical application of our approach, we show animations on high-quality parametric 3D face models driven by the landmarks generated from our speech-to-tongue animation method.",
"fno": "694600u0374",
"keywords": [
"Audio Signal Processing",
"Computer Animation",
"Face Recognition",
"Image Motion Analysis",
"Learning Artificial Intelligence",
"Speech Driven Tongue",
"Speech Driven Animation Techniques",
"Animations",
"Audio Data",
"Lip Motion",
"Realistic Animation",
"Speech Driven Inner Mouth Animation",
"Performance Capture Data",
"Jaw",
"Large Scale Speech",
"Capturing Tongue",
"Data Driven Techniques",
"Realistic Inner Mouth Animation",
"Deep Learning Based Method",
"Accurate Speech",
"Generalizable Speech",
"Audio Feature Encoders",
"Speech To Tongue Animation Method",
"Solid Modeling",
"Tongue",
"Three Dimensional Displays",
"Lips",
"Face Recognition",
"Mouth",
"Speech Recognition"
],
"authors": [
{
"affiliation": "Carnegic Mellon University",
"fullName": "Salvador Medina",
"givenName": "Salvador",
"surname": "Medina",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Epic Games",
"fullName": "Denis Tome",
"givenName": "Denis",
"surname": "Tome",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Epic Games",
"fullName": "Carsten Stoll",
"givenName": "Carsten",
"surname": "Stoll",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Haskins Laboratories",
"fullName": "Mark Tiede",
"givenName": "Mark",
"surname": "Tiede",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Queens University",
"fullName": "Kevin Munhall",
"givenName": "Kevin",
"surname": "Munhall",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Carnegic Mellon University",
"fullName": "Alex Hauptmann",
"givenName": "Alex",
"surname": "Hauptmann",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Epic Games",
"fullName": "Iain Matthews",
"givenName": "Iain",
"surname": "Matthews",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "20374-20384",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6946-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1H1lUPghfd6",
"name": "pcvpr202269460-09879616s1-mm_694600u0374.zip",
"size": "2.41 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202269460-09879616s1-mm_694600u0374.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "694600u0363",
"articleId": "1H1hyvbri7e",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "694600u0385",
"articleId": "1H0N9SVAntK",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bibm/2016/1611/0/07822762",
"title": "A fast and precise speech-triggered tongue animation system by combining parameterized model and anatomical model",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2016/07822762/12OmNC1Y5r1",
"parentPublication": {
"id": "proceedings/bibm/2016/1611/0",
"title": "2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dasc/2009/3929/0/3929a413",
"title": "Automatic Segmentation in Tongue Image by Mouth Location and Active Appearance Model",
"doi": null,
"abstractUrl": "/proceedings-article/dasc/2009/3929a413/12OmNqHItCG",
"parentPublication": {
"id": "proceedings/dasc/2009/3929/0",
"title": "Dependable, Autonomic and Secure Computing, IEEE International Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscv/2017/4062/0/08054956",
"title": "Amazigh audiovisual speech recognition system design",
"doi": null,
"abstractUrl": "/proceedings-article/iscv/2017/08054956/12OmNvlxJqz",
"parentPublication": {
"id": "proceedings/iscv/2017/4062/0",
"title": "2017 Intelligent Systems and Computer Vision (ISCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2017/6647/0/07892238",
"title": "Acoustic VR in the mouth: A real-time speech-driven visual tongue system",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2017/07892238/12OmNvmowOB",
"parentPublication": {
"id": "proceedings/vr/2017/6647/0",
"title": "2017 IEEE Virtual Reality (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iih-msp/2008/3278/0/3278a113",
"title": "An Approach to Speech Driven Animation",
"doi": null,
"abstractUrl": "/proceedings-article/iih-msp/2008/3278a113/12OmNvw2TcQ",
"parentPublication": {
"id": "proceedings/iih-msp/2008/3278/0",
"title": "2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icci/2006/0475/1/04216400",
"title": "GA-Based Speaking Mouth Correlative Speech Feature Abstraction",
"doi": null,
"abstractUrl": "/proceedings-article/icci/2006/04216400/12OmNwDACBQ",
"parentPublication": {
"id": "proceedings/icci/2006/0475/1",
"title": "Cognitive Informatics, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ca/1994/6240/0/00324008",
"title": "Modeling and animating the human tongue during speech production",
"doi": null,
"abstractUrl": "/proceedings-article/ca/1994/00324008/12OmNzcPAMk",
"parentPublication": {
"id": "proceedings/ca/1994/6240/0",
"title": "Proceedings of Computer Animation '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2015/10/mco2015100054",
"title": "Toward Silent-Speech Control of Consumer Wearables",
"doi": null,
"abstractUrl": "/magazine/co/2015/10/mco2015100054/13rRUILLkqO",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2005/03/v0341",
"title": "Creating Speech-Synchronized Animation",
"doi": null,
"abstractUrl": "/journal/tg/2005/03/v0341/13rRUxE04tq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2023/4544/0/10042520",
"title": "Casual chatter or speaking up? Adjusting articulatory effort in generation of speech and animation for conversational characters",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2023/10042520/1KOv20cA4SY",
"parentPublication": {
"id": "proceedings/fg/2023/4544/0",
"title": "2023 IEEE 17th International Conference on Automatic Face and Gesture Recognition (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzBOhWW",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"acronym": "vv",
"groupId": "1000808",
"volume": "0",
"displayVolume": "0",
"year": "2004",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqOwQKv",
"doi": "10.1109/SVVG.2004.7",
"title": "Interactive Volume Manipulation with Selective Rendering for Improved Visualization",
"normalizedTitle": "Interactive Volume Manipulation with Selective Rendering for Improved Visualization",
"abstract": "In this paper, we describe a methodology that will allow a viewer to select \"geometrical\" components of a volume and both manipulate these components and/or \"highlight\" them. A considerable number of volumetric datasets are now available and can be obtained from imaging techniques such as magnetic resonance imaging (MRI), cryogenic slicing, CT, or laser scans. In order to be able to better visualize these models, it is often required to repose them, e.g., remove occlusion, or to highlight various components. However, it may be still desirable to keep the rest of the volume present (and not to just cut it away) to maintain a focus+context view of the data. The methodology we propose allows the user to select regions of the data based upon the shape of the volumetric model. Once selected, the regions can be moved or highlighted via an alternate rendering. Some examples of alternate renderings include selective compression (higher resolution data is used to render the selected region), selective juxtaposition (replacing that selected component with data from another dataset), or selective transfer function determination. Both the selection and the rendering are done interactively to maximize their effectiveness. We show examples of the approach using a variety of volumetric datasets.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we describe a methodology that will allow a viewer to select \"geometrical\" components of a volume and both manipulate these components and/or \"highlight\" them. A considerable number of volumetric datasets are now available and can be obtained from imaging techniques such as magnetic resonance imaging (MRI), cryogenic slicing, CT, or laser scans. In order to be able to better visualize these models, it is often required to repose them, e.g., remove occlusion, or to highlight various components. However, it may be still desirable to keep the rest of the volume present (and not to just cut it away) to maintain a focus+context view of the data. The methodology we propose allows the user to select regions of the data based upon the shape of the volumetric model. Once selected, the regions can be moved or highlighted via an alternate rendering. Some examples of alternate renderings include selective compression (higher resolution data is used to render the selected region), selective juxtaposition (replacing that selected component with data from another dataset), or selective transfer function determination. Both the selection and the rendering are done interactively to maximize their effectiveness. We show examples of the approach using a variety of volumetric datasets.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we describe a methodology that will allow a viewer to select \"geometrical\" components of a volume and both manipulate these components and/or \"highlight\" them. A considerable number of volumetric datasets are now available and can be obtained from imaging techniques such as magnetic resonance imaging (MRI), cryogenic slicing, CT, or laser scans. In order to be able to better visualize these models, it is often required to repose them, e.g., remove occlusion, or to highlight various components. However, it may be still desirable to keep the rest of the volume present (and not to just cut it away) to maintain a focus+context view of the data. The methodology we propose allows the user to select regions of the data based upon the shape of the volumetric model. Once selected, the regions can be moved or highlighted via an alternate rendering. Some examples of alternate renderings include selective compression (higher resolution data is used to render the selected region), selective juxtaposition (replacing that selected component with data from another dataset), or selective transfer function determination. Both the selection and the rendering are done interactively to maximize their effectiveness. We show examples of the approach using a variety of volumetric datasets.",
"fno": "87810095",
"keywords": [
"Improved Visualization",
"Volume Manipulation",
"IK Inverse Kinematics Skeleton",
"Selective Rendering",
"Modeling",
"Animation"
],
"authors": [
{
"affiliation": "Rutgers, The State University of New Jersey, Piscataway, NJ",
"fullName": "Vikas Singh",
"givenName": "Vikas",
"surname": "Singh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Rutgers, The State University of New Jersey, Piscataway, NJ",
"fullName": "Deborah Silver",
"givenName": "Deborah",
"surname": "Silver",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2004-10-01T00:00:00",
"pubType": "proceedings",
"pages": "95-102",
"year": "2004",
"issn": null,
"isbn": "0-7803-8781-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "87810087",
"articleId": "12OmNwD1q0p",
"__typename": "AdjacentArticleType"
},
"next": null,
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ieee-vis/2002/7498/0/7498kniss",
"title": "Interactive Translucent Volume Rendering and Procedural Modeling",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498kniss/12OmNB0X8rO",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2002/7498/0/7498bergner",
"title": "Interactive Spectral Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2002/7498bergner/12OmNqEjhXN",
"parentPublication": {
"id": "proceedings/ieee-vis/2002/7498/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660085",
"title": "VolumeShop: An Interactive System for Direct Volume Illustration",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660085/12OmNwIpNlJ",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/paciia/2008/3490/1/3490a243",
"title": "Selective SVM Ensembles Based on Modified BPSO",
"doi": null,
"abstractUrl": "/proceedings-article/paciia/2008/3490a243/12OmNx4yvzM",
"parentPublication": {
"id": "proceedings/paciia/2008/3490/1",
"title": "Pacific-Asia Workshop on Computational Intelligence and Industrial Application, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2005/2766/0/27660038",
"title": "Scale-Invariant Volume Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2005/27660038/12OmNxb5hu0",
"parentPublication": {
"id": "proceedings/ieee-vis/2005/2766/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vv/2002/7641/0/76410065",
"title": "Shape Retaining Chain Linked Model for Real-Time Volume Haptic Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vv/2002/76410065/12OmNyGbIf6",
"parentPublication": {
"id": "proceedings/vv/2002/7641/0",
"title": "Volume Visualization and Graphics, IEEE Symposium on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ieee-vis/2001/7200/0/7200kniss",
"title": "Interactive Volume Rendering Using Multi-Dimensional Transfer Functions and Direct Manipulation Widgets",
"doi": null,
"abstractUrl": "/proceedings-article/ieee-vis/2001/7200kniss/12OmNz61dAW",
"parentPublication": {
"id": "proceedings/ieee-vis/2001/7200/0",
"title": "Visualization Conference, IEEE",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2002/03/v0270",
"title": "Multidimensional Transfer Functions for Interactive Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2002/03/v0270/13rRUB7a1fG",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061579",
"title": "Interactive Volume Rendering of Functional Representations in Quantum Chemistry",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061579/13rRUwgQpDq",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2004/01/v0029",
"title": "Selective Refinement Queries for Volume Visualization of Unstructured Tetrahedral Meshes",
"doi": null,
"abstractUrl": "/journal/tg/2004/01/v0029/13rRUyY28Yi",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyRg4ls",
"title": "Mobile Business, International Conference on",
"acronym": "icmb",
"groupId": "1001205",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBNM8PT",
"doi": "10.1109/ICMB.2011.35",
"title": "Analysis of Mobile Social Games from the Viewpoint of Gamenics Theory",
"normalizedTitle": "Analysis of Mobile Social Games from the Viewpoint of Gamenics Theory",
"abstract": "The mobile Internet business is entering a new era in Japan with the emergence of revenue being generated from mobile social games. Users using high-speed mobile Internet with flat-rate data services have acceptance of micro-payment and increased payment acceptance in mobile social games. This has been impacting mobile business and the game business in Japan for the last 12 months. Given the hype surrounding mobile social games, the author attempts to identify mobile social extensions of Gamenics theory. Observation of mobile social game design has revealed that most of the design guidelines follow Gamenics theory. The mobile-specific uniqueness resides in the extension of the 4th rule of Gamenics theory. The author presents new design rules from this viewpoint of augmenting Gamenics theory for practices of mobile social game.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The mobile Internet business is entering a new era in Japan with the emergence of revenue being generated from mobile social games. Users using high-speed mobile Internet with flat-rate data services have acceptance of micro-payment and increased payment acceptance in mobile social games. This has been impacting mobile business and the game business in Japan for the last 12 months. Given the hype surrounding mobile social games, the author attempts to identify mobile social extensions of Gamenics theory. Observation of mobile social game design has revealed that most of the design guidelines follow Gamenics theory. The mobile-specific uniqueness resides in the extension of the 4th rule of Gamenics theory. The author presents new design rules from this viewpoint of augmenting Gamenics theory for practices of mobile social game.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The mobile Internet business is entering a new era in Japan with the emergence of revenue being generated from mobile social games. Users using high-speed mobile Internet with flat-rate data services have acceptance of micro-payment and increased payment acceptance in mobile social games. This has been impacting mobile business and the game business in Japan for the last 12 months. Given the hype surrounding mobile social games, the author attempts to identify mobile social extensions of Gamenics theory. Observation of mobile social game design has revealed that most of the design guidelines follow Gamenics theory. The mobile-specific uniqueness resides in the extension of the 4th rule of Gamenics theory. The author presents new design rules from this viewpoint of augmenting Gamenics theory for practices of mobile social game.",
"fno": "4434a001",
"keywords": [
"Gamenics Theory",
"Mobile Social Game",
"Game Design"
],
"authors": [
{
"affiliation": null,
"fullName": "Toshihiko Yamakami",
"givenName": "Toshihiko",
"surname": "Yamakami",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icmb",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1-5",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4434-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4434z017",
"articleId": "12OmNyLiuGf",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4434a006",
"articleId": "12OmNzC5SWH",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/uic-atc/2012/4843/0/4843a792",
"title": "From User Experience to Social Experience: A New Perspective for Mobile Social Game Design",
"doi": null,
"abstractUrl": "/proceedings-article/uic-atc/2012/4843a792/12OmNA2cYD3",
"parentPublication": {
"id": "proceedings/uic-atc/2012/4843/0",
"title": "Ubiquitous, Autonomic and Trusted Computing, Symposia and Workshops on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2012/4652/0/4652a352",
"title": "From Gamenics to Servicenics: Lessons Learned in Mobile Social Games in Japan toward Service Engineering",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2012/4652a352/12OmNBSjJ7I",
"parentPublication": {
"id": "proceedings/waina/2012/4652/0",
"title": "2012 26th International Conference on Advanced Information Networking and Applications Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/digitel/2010/3993/0/3993a031",
"title": "TeMPS: A Conceptual Framework for Pervasive and Social Games",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2010/3993a031/12OmNrFkeVQ",
"parentPublication": {
"id": "proceedings/digitel/2010/3993/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2012/4779/0/4779a372",
"title": "General Pattern Discovery for Social Game on Facebook",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2012/4779a372/12OmNwDSdq2",
"parentPublication": {
"id": "proceedings/nbis/2012/4779/0",
"title": "2012 15th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2011/4458/0/4458a413",
"title": "Time Management in Mobile Social Game Design: Lessons from Mobile Social Games in Japan",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2011/4458a413/12OmNwwd2N6",
"parentPublication": {
"id": "proceedings/nbis/2011/4458/0",
"title": "2011 14th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cse/2009/3823/4/3823f205",
"title": "Mathematical Modeling of Social Games",
"doi": null,
"abstractUrl": "/proceedings-article/cse/2009/3823f205/12OmNxG1yAY",
"parentPublication": {
"id": "proceedings/cse/2009/3823/2",
"title": "2009 International Conference on Computational Science and Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/waina/2012/4652/0/4652b270",
"title": "It is not a Game, Not Even Social: New Service Engineering Paradigms from Lessons Learned in Mobile Social Games in Japan",
"doi": null,
"abstractUrl": "/proceedings-article/waina/2012/4652b270/12OmNxwncrQ",
"parentPublication": {
"id": "proceedings/waina/2012/4652/0",
"title": "2012 26th International Conference on Advanced Information Networking and Applications Workshops",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgc/2013/5114/0/5114a266",
"title": "Cross-Culture Analysis of Mobile Social Games: Toward Design Guidelines of Lessons Learned from Globalized Mobile Social Games",
"doi": null,
"abstractUrl": "/proceedings-article/cgc/2013/5114a266/12OmNyoiZdV",
"parentPublication": {
"id": "proceedings/cgc/2013/5114/0",
"title": "2013 International Conference on Cloud and Green Computing (CGC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2011/4458/0/4458a168",
"title": "A 3-Stage Transition Model of the Architecture of Mobile Social Games: Lessons from Mobile Social Games in Japan",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2011/4458a168/12OmNyxFKjH",
"parentPublication": {
"id": "proceedings/nbis/2011/4458/0",
"title": "2011 14th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nbis/2012/4779/0/4779a221",
"title": "Mobile Social Game Design from the Perspective of Persuasive Technology",
"doi": null,
"abstractUrl": "/proceedings-article/nbis/2012/4779a221/12OmNz61dal",
"parentPublication": {
"id": "proceedings/nbis/2012/4779/0",
"title": "2012 15th International Conference on Network-Based Information Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzahck3",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"acronym": "digitel",
"groupId": "1002024",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx6Pizm",
"doi": "10.1109/DIGITEL.2012.17",
"title": "Applying a Grammatical Structure to Practice Game Design on Non-Computer Games",
"normalizedTitle": "Applying a Grammatical Structure to Practice Game Design on Non-Computer Games",
"abstract": "In this paper, we propose a pedagogical approach based on the sentence grammar to teach an introductory game design course. Different from the conventional game design courses concentrated on developing computer games, we advocate exercising non-computer games. In our approach, we elucidate the importance of understanding the core idea of a game by executing the game analysis to extract an identical sentence of the game on the first stage. This notion is then progressively brought to other stages of the course. In the second stage, an exercise on activity games is introduced to exploit the students' ability in conceiving the game interaction in a face-to-face multiplayer environment. This interactive experience obtained is then transferred to the third stage to develop board games. The grammatical approach is introduced to interpret the idea of core sentence to help developing their board game projects. We illustrate specific examples of each stage and the progress made by students. A final evaluation on their projects is reported.",
"abstracts": [
{
"abstractType": "Regular",
"content": "In this paper, we propose a pedagogical approach based on the sentence grammar to teach an introductory game design course. Different from the conventional game design courses concentrated on developing computer games, we advocate exercising non-computer games. In our approach, we elucidate the importance of understanding the core idea of a game by executing the game analysis to extract an identical sentence of the game on the first stage. This notion is then progressively brought to other stages of the course. In the second stage, an exercise on activity games is introduced to exploit the students' ability in conceiving the game interaction in a face-to-face multiplayer environment. This interactive experience obtained is then transferred to the third stage to develop board games. The grammatical approach is introduced to interpret the idea of core sentence to help developing their board game projects. We illustrate specific examples of each stage and the progress made by students. A final evaluation on their projects is reported.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "In this paper, we propose a pedagogical approach based on the sentence grammar to teach an introductory game design course. Different from the conventional game design courses concentrated on developing computer games, we advocate exercising non-computer games. In our approach, we elucidate the importance of understanding the core idea of a game by executing the game analysis to extract an identical sentence of the game on the first stage. This notion is then progressively brought to other stages of the course. In the second stage, an exercise on activity games is introduced to exploit the students' ability in conceiving the game interaction in a face-to-face multiplayer environment. This interactive experience obtained is then transferred to the third stage to develop board games. The grammatical approach is introduced to interpret the idea of core sentence to help developing their board game projects. We illustrate specific examples of each stage and the progress made by students. A final evaluation on their projects is reported.",
"fno": "4663a057",
"keywords": [
"Game Design",
"Non Computer Games",
"Board Game",
"Game Education"
],
"authors": [
{
"affiliation": null,
"fullName": "Ke-Chen Pong",
"givenName": "Ke-Chen",
"surname": "Pong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ming-Hsin Tsai",
"givenName": "Ming-Hsin",
"surname": "Tsai",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Shuo-Hsiu Hsu",
"givenName": "Shuo-Hsiu",
"surname": "Hsu",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "digitel",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-03-01T00:00:00",
"pubType": "proceedings",
"pages": "57-61",
"year": "2012",
"issn": null,
"isbn": "978-0-7695-4663-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4663a052",
"articleId": "12OmNxE2mHN",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4663a062",
"articleId": "12OmNxEBz7R",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/digitel/2010/3993/0/3993a191",
"title": "Managing the Development of Digital Educational Games",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2010/3993a191/12OmNqFJhHV",
"parentPublication": {
"id": "proceedings/digitel/2010/3993/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgames/2011/1451/0/06000328",
"title": "Sensing game play. Exploring computer game play in a game café and a mass LAN party",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2011/06000328/12OmNqGiu6J",
"parentPublication": {
"id": "proceedings/cgames/2011/1451/0",
"title": "2011 16th International Conference on Computer Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/passat-socialcom/2011/1931/0/06113100",
"title": "The Life Game: Cognitive Strategies for Repeated Stochastic Games",
"doi": null,
"abstractUrl": "/proceedings-article/passat-socialcom/2011/06113100/12OmNqIhFPp",
"parentPublication": {
"id": "proceedings/passat-socialcom/2011/1931/0",
"title": "2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust (PASSAT) / 2011 IEEE Third Int'l Conference on Social Computing (SocialCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2011/4467/0/4467a120",
"title": "Let the Game Do the Talking: The Influence of Explicitness and Game Behavior on Comprehension in an Educational Computer Game",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2011/4467a120/12OmNrAv3Dh",
"parentPublication": {
"id": "proceedings/cw/2011/4467/0",
"title": "2011 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2012/4702/0/4702a218",
"title": "Designing Educational Games by Combining Other Game Designs",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2012/4702a218/12OmNwHQB8q",
"parentPublication": {
"id": "proceedings/icalt/2012/4702/0",
"title": "Advanced Learning Technologies, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgames/2011/1451/0/06000361",
"title": "A study of how different game play aspects can affect the popularity of role-playing video games",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2011/06000361/12OmNxFsmm2",
"parentPublication": {
"id": "proceedings/cgames/2011/1451/0",
"title": "2011 16th International Conference on Computer Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgames/2011/1451/0/06000353",
"title": "Can game-based therapies be trusted? Is game-based education effective? A systematic review of the Serious Games for health and education",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2011/06000353/12OmNxwENyR",
"parentPublication": {
"id": "proceedings/cgames/2011/1451/0",
"title": "2011 16th International Conference on Computer Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dese/2011/4593/0/4593a431",
"title": "Game Content Model: An Ontology for Documenting Serious Game Design",
"doi": null,
"abstractUrl": "/proceedings-article/dese/2011/4593a431/12OmNzDNttK",
"parentPublication": {
"id": "proceedings/dese/2011/4593/0",
"title": "2011 Developments in E-systems Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csse/2008/3336/5/3336i091",
"title": "Study on the Design of the Mechanism of Thematic Games In Game-Based Networked Learning Community",
"doi": null,
"abstractUrl": "/proceedings-article/csse/2008/3336i091/12OmNzmclzH",
"parentPublication": {
"id": "proceedings/csse/2008/3336/5",
"title": "2008 International Conference on Computer Science and Software Engineering (CSSE 2008)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itng/2010/3984/0/3984b119",
"title": "Designing Computer Games to Teach Algorithms",
"doi": null,
"abstractUrl": "/proceedings-article/itng/2010/3984b119/12OmNzt0Isj",
"parentPublication": {
"id": "proceedings/itng/2010/3984/0",
"title": "Information Technology: New Generations, Third International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyS6RMG",
"title": "2016 IEEE/ACM Joint Conference on Digital Libraries (JCDL)",
"acronym": "jcdl",
"groupId": "1804605",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxGja4m",
"doi": "",
"title": "Games for crowdsourcing mobile content: An analysis of contribution patterns",
"normalizedTitle": "Games for crowdsourcing mobile content: An analysis of contribution patterns",
"abstract": "Crowdsourcing of mobile content through games is becoming a major way of populating information-rich online environments. A current research gap is that actual usage patterns of crowdsourcing games has been inadequately investigated. We address this gap by comparing content creation patterns in a game for crowdsourcing mobile content against a non-game version. Results show distinct differences in the types and distribution of content created.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Crowdsourcing of mobile content through games is becoming a major way of populating information-rich online environments. A current research gap is that actual usage patterns of crowdsourcing games has been inadequately investigated. We address this gap by comparing content creation patterns in a game for crowdsourcing mobile content against a non-game version. Results show distinct differences in the types and distribution of content created.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Crowdsourcing of mobile content through games is becoming a major way of populating information-rich online environments. A current research gap is that actual usage patterns of crowdsourcing games has been inadequately investigated. We address this gap by comparing content creation patterns in a game for crowdsourcing mobile content against a non-game version. Results show distinct differences in the types and distribution of content created.",
"fno": "07559608",
"keywords": [
"Games",
"Crowdsourcing",
"Mobile Communication",
"Positron Emission Tomography",
"Entertainment Industry",
"Social Network Services",
"Big Data",
"Content Analysis",
"Crowdsourcing Games",
"Mobile Content"
],
"authors": [
{
"affiliation": "Wee Kim Wee School of Communication and Information, Nanyang Technological University",
"fullName": "Dion Hoe-Lian Goh",
"givenName": "Dion Hoe-Lian",
"surname": "Goh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wee Kim Wee School of Communication and Information, Nanyang Technological University",
"fullName": "Ei Pa Pa Pe-Than",
"givenName": "Ei Pa Pa",
"surname": "Pe-Than",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Wee Kim Wee School of Communication and Information, Nanyang Technological University",
"fullName": "Chei Sian Lee",
"givenName": "Chei Sian",
"surname": "Lee",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "jcdl",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-06-01T00:00:00",
"pubType": "proceedings",
"pages": "249-250",
"year": "2016",
"issn": null,
"isbn": "978-1-4503-4229-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07559607",
"articleId": "12OmNrAMEKJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07559609",
"articleId": "12OmNyeECAx",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/csi-se/2015/7040/0/7040a030",
"title": "Making Hard Fun in Crowdsourced Model Checking -- Balancing Crowd Engagement and Efficiency to Maximize Output in Proof by Games",
"doi": null,
"abstractUrl": "/proceedings-article/csi-se/2015/7040a030/12OmNBqMDir",
"parentPublication": {
"id": "proceedings/csi-se/2015/7040/0",
"title": "2015 IEEE/ACM 2nd International Workshop on CrowdSourcing in Software Engineering (CSI-SE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2013/5261/0/06684915",
"title": "Adding social elements to game-based learning - An exploration",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2013/06684915/12OmNsbY6Uu",
"parentPublication": {
"id": "proceedings/fie/2013/5261/0",
"title": "2013 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icmew/2014/4717/0/06890535",
"title": "Image annotation via social diffusion analysis with common interests",
"doi": null,
"abstractUrl": "/proceedings-article/icmew/2014/06890535/12OmNxvO01K",
"parentPublication": {
"id": "proceedings/icmew/2014/4717/0",
"title": "2014 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isme/2010/4132/1/4132a089",
"title": "The Innovation Business Model of Blogs: Crowdsourcing on Web Content Producing",
"doi": null,
"abstractUrl": "/proceedings-article/isme/2010/4132a089/12OmNyKa5Tt",
"parentPublication": {
"id": "isme/2010/4132/1",
"title": "Information Science and Management Engineering, International Conference of",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscc/2016/0679/0/07543718",
"title": "Investigating the effect of User Generated Content in pervasive games",
"doi": null,
"abstractUrl": "/proceedings-article/iscc/2016/07543718/12OmNzEmFHz",
"parentPublication": {
"id": "proceedings/iscc/2016/0679/0",
"title": "2016 IEEE Symposium on Computers and Communication (ISCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2014/4435/0/4435a193",
"title": "Evaluating a Row-Store Data Model for Full-Content DICOM Management",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2014/4435a193/12OmNzVGcFm",
"parentPublication": {
"id": "proceedings/cbms/2014/4435/0",
"title": "2014 IEEE 27th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2017/03/07458199",
"title": "Game Factors Influencing Players to Continue Playing Online Pets",
"doi": null,
"abstractUrl": "/journal/ci/2017/03/07458199/13rRUwx1xJW",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ic/2012/05/mic2012050010",
"title": "Leveraging Online Populations for Crowdsourcing",
"doi": null,
"abstractUrl": "/magazine/ic/2012/05/mic2012050010/13rRUxcsYQD",
"parentPublication": {
"id": "mags/ic",
"title": "IEEE Internet Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/2021/04/09069271",
"title": "Enhancing the Quality in Crowdsourcing E-Markets Through Team Formation Games",
"doi": null,
"abstractUrl": "/magazine/ex/2021/04/09069271/1j4Gv7YKBy0",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icde/2020/2903/0/09101878",
"title": "Task Allocation in Dependency-aware Spatial Crowdsourcing",
"doi": null,
"abstractUrl": "/proceedings-article/icde/2020/09101878/1kaMCAbny6c",
"parentPublication": {
"id": "proceedings/icde/2020/2903/0",
"title": "2020 IEEE 36th International Conference on Data Engineering (ICDE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzcxYU6",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"acronym": "digitel",
"groupId": "1002024",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNyY4rt3",
"doi": "10.1109/DIGITEL.2010.55",
"title": "Toward a Framework for the Analysis and Design of Educational Games",
"normalizedTitle": "Toward a Framework for the Analysis and Design of Educational Games",
"abstract": "We describe and illustrate the beginnings of a general framework for the design and analysis of educational games. Our students have used it to analyze existing educational games and to create prototype educational games. The framework is built on existing components: a method for precisely specifying educational objectives, a framework for relating a game’s mechanics, dynamics, and aesthetics, and principles for instructional design grounded in empirical research in the learning sciences. The power of the framework comes from the components themselves, as well as from considering these components in concert and making connections between them. The framework coordinates the many levels at which an educational game must succeed in order to be effective. We illustrate the framework by using it to analyze Zombie Division and to generate some redesign ideas for this game.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We describe and illustrate the beginnings of a general framework for the design and analysis of educational games. Our students have used it to analyze existing educational games and to create prototype educational games. The framework is built on existing components: a method for precisely specifying educational objectives, a framework for relating a game’s mechanics, dynamics, and aesthetics, and principles for instructional design grounded in empirical research in the learning sciences. The power of the framework comes from the components themselves, as well as from considering these components in concert and making connections between them. The framework coordinates the many levels at which an educational game must succeed in order to be effective. We illustrate the framework by using it to analyze Zombie Division and to generate some redesign ideas for this game.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We describe and illustrate the beginnings of a general framework for the design and analysis of educational games. Our students have used it to analyze existing educational games and to create prototype educational games. The framework is built on existing components: a method for precisely specifying educational objectives, a framework for relating a game’s mechanics, dynamics, and aesthetics, and principles for instructional design grounded in empirical research in the learning sciences. The power of the framework comes from the components themselves, as well as from considering these components in concert and making connections between them. The framework coordinates the many levels at which an educational game must succeed in order to be effective. We illustrate the framework by using it to analyze Zombie Division and to generate some redesign ideas for this game.",
"fno": "3993a069",
"keywords": [
"Educational Games",
"Game Design",
"Game Analysis",
"MDA",
"Learning Principles",
"Blooms Revised Taxonomy"
],
"authors": [
{
"affiliation": null,
"fullName": "Vincent Aleven",
"givenName": "Vincent",
"surname": "Aleven",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Eben Myers",
"givenName": "Eben",
"surname": "Myers",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Matthew Easterday",
"givenName": "Matthew",
"surname": "Easterday",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Amy Ogan",
"givenName": "Amy",
"surname": "Ogan",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "digitel",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-04-01T00:00:00",
"pubType": "proceedings",
"pages": "69-76",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-3993-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3993a061",
"articleId": "12OmNvJXeB3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3993a077",
"articleId": "12OmNzxyiFA",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/digitel/2012/4663/0/4663a120",
"title": "Brief Guidelines for Educational Adventure Games Creation (EAGC)",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2012/4663a120/12OmNBSjJ1t",
"parentPublication": {
"id": "proceedings/digitel/2012/4663/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2011/4467/0/4467a120",
"title": "Let the Game Do the Talking: The Influence of Explicitness and Game Behavior on Comprehension in an Educational Computer Game",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2011/4467a120/12OmNrAv3Dh",
"parentPublication": {
"id": "proceedings/cw/2011/4467/0",
"title": "2011 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/digitel/2008/3409/0/3409a135",
"title": "Micro Adaptive, Non-invasive Knowledge Assessment in Educational Games",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2008/3409a135/12OmNvStcFB",
"parentPublication": {
"id": "proceedings/digitel/2008/3409/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2015/7334/0/7334a147",
"title": "Towards a Service-Oriented Architecture Framework for Educational Serious Games",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2015/7334a147/12OmNvjgWlH",
"parentPublication": {
"id": "proceedings/icalt/2015/7334/0",
"title": "2015 IEEE 15th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2005/9077/0/01612004",
"title": "Work in progress - a study on educational computer games for e-learning based on activity theory",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2005/01612004/12OmNwFicVx",
"parentPublication": {
"id": "proceedings/fie/2005/9077/0",
"title": "35th Annual Frontiers in Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2008/3381/0/3381a397",
"title": "The Eduventure II. An Approach to Educational Game Design",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2008/3381a397/12OmNxHJ9uO",
"parentPublication": {
"id": "proceedings/cw/2008/3381/0",
"title": "2008 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2012/11/ttg2012111956",
"title": "Toward Visualization for Games: Theory, Design Space, and Patterns",
"doi": null,
"abstractUrl": "/journal/tg/2012/11/ttg2012111956/13rRUxBJhFu",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2019/3485/0/348500a103",
"title": "PlayEduc: A Conceptual Framework for the Development of Digital Educational Games",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2019/348500a103/1cYi6izOLCM",
"parentPublication": {
"id": "proceedings/icalt/2019/3485/2161-377X",
"title": "2019 IEEE 19th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2021/06/09556564",
"title": "A Taxonomy-Driven Model for Designing Educational Games in Visualization",
"doi": null,
"abstractUrl": "/magazine/cg/2021/06/09556564/1xlw4DK3GXC",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637224",
"title": "Mirror Mirror On The Wall - What Are Cybersecurity Educational Games Offering Overall: A Research Study and Gap Analysis",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637224/1zuvIIjsCti",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxH9X7y",
"title": "Information Technology: New Generations, Third International Conference on",
"acronym": "itng",
"groupId": "1001685",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNzt0Isj",
"doi": "10.1109/ITNG.2010.78",
"title": "Designing Computer Games to Teach Algorithms",
"normalizedTitle": "Designing Computer Games to Teach Algorithms",
"abstract": "Data structures and algorithms are important foundation topics in computer science education. However, they are often complex and hard to understand. Therefore, we introduce a new learning strategy that benefits from computer games’ popularity and engagement to help students understand algorithms better by designing computer games that visualize algorithms. To teach an algorithm, an educational computer game, namely an algorithm game, must have a game-play that simulates the behavior of the visualized algorithm and graphics depict the features of its data structure.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Data structures and algorithms are important foundation topics in computer science education. However, they are often complex and hard to understand. Therefore, we introduce a new learning strategy that benefits from computer games’ popularity and engagement to help students understand algorithms better by designing computer games that visualize algorithms. To teach an algorithm, an educational computer game, namely an algorithm game, must have a game-play that simulates the behavior of the visualized algorithm and graphics depict the features of its data structure.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Data structures and algorithms are important foundation topics in computer science education. However, they are often complex and hard to understand. Therefore, we introduce a new learning strategy that benefits from computer games’ popularity and engagement to help students understand algorithms better by designing computer games that visualize algorithms. To teach an algorithm, an educational computer game, namely an algorithm game, must have a game-play that simulates the behavior of the visualized algorithm and graphics depict the features of its data structure.",
"fno": "3984b119",
"keywords": [
"Algorithm Learning",
"Algorithm Visualization",
"Computer Science Education",
"Educational Games",
"Game Design"
],
"authors": [
{
"affiliation": null,
"fullName": "Sahar S. Shabanah",
"givenName": "Sahar S.",
"surname": "Shabanah",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Jim X. Chen",
"givenName": "Jim X.",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Harry Wechsler",
"givenName": "Harry",
"surname": "Wechsler",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Daniel Carr",
"givenName": "Daniel",
"surname": "Carr",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Edward Wegman",
"givenName": "Edward",
"surname": "Wegman",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "itng",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-04-01T00:00:00",
"pubType": "proceedings",
"pages": "1119-1126",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-3984-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "3984b113",
"articleId": "12OmNzcxZhV",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "3984b127",
"articleId": "12OmNqI04TI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cgiv/2007/2928/0/29280109",
"title": "Designing a Computer Game to Teach Einstein?s Theory of Relativity",
"doi": null,
"abstractUrl": "/proceedings-article/cgiv/2007/29280109/12OmNBubOSk",
"parentPublication": {
"id": "proceedings/cgiv/2007/2928/0",
"title": "Computer Graphics, Imaging and Visualisation (CGIV 2007)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgames/2011/1451/0/06000328",
"title": "Sensing game play. Exploring computer game play in a game café and a mass LAN party",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2011/06000328/12OmNqGiu6J",
"parentPublication": {
"id": "proceedings/cgames/2011/1451/0",
"title": "2011 16th International Conference on Computer Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cw/2011/4467/0/4467a120",
"title": "Let the Game Do the Talking: The Influence of Explicitness and Game Behavior on Comprehension in an Educational Computer Game",
"doi": null,
"abstractUrl": "/proceedings-article/cw/2011/4467a120/12OmNrAv3Dh",
"parentPublication": {
"id": "proceedings/cw/2011/4467/0",
"title": "2011 International Conference on Cyberworlds",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/etcs/2009/3557/3/3557e971",
"title": "Strategies for Designing Educational Computer Game",
"doi": null,
"abstractUrl": "/proceedings-article/etcs/2009/3557e971/12OmNvSbBB0",
"parentPublication": {
"id": "proceedings/etcs/2009/3557/3",
"title": "Education Technology and Computer Science, International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2005/9077/0/01612004",
"title": "Work in progress - a study on educational computer games for e-learning based on activity theory",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2005/01612004/12OmNwFicVx",
"parentPublication": {
"id": "proceedings/fie/2005/9077/0",
"title": "35th Annual Frontiers in Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2012/4702/0/4702a218",
"title": "Designing Educational Games by Combining Other Game Designs",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2012/4702a218/12OmNwHQB8q",
"parentPublication": {
"id": "proceedings/icalt/2012/4702/0",
"title": "Advanced Learning Technologies, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2012/4702/0/4702a682",
"title": "Co-designing Social Games with Children to Support Non Formal Learning",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2012/4702a682/12OmNwt5sfV",
"parentPublication": {
"id": "proceedings/icalt/2012/4702/0",
"title": "Advanced Learning Technologies, IEEE International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/digitel/2012/4663/0/4663a057",
"title": "Applying a Grammatical Structure to Practice Game Design on Non-Computer Games",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2012/4663a057/12OmNx6Pizm",
"parentPublication": {
"id": "proceedings/digitel/2012/4663/0",
"title": "Digital Game and Intelligent Toy Enhanced Learning, IEEE International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/jcdl/2014/5569/0/06970235",
"title": "Exploring relationships among video games",
"doi": null,
"abstractUrl": "/proceedings-article/jcdl/2014/06970235/12OmNxGj9Tq",
"parentPublication": {
"id": "proceedings/jcdl/2014/5569/0",
"title": "2014 IEEE/ACM Joint Conference on Digital Libraries (JCDL)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/digitel/2007/2801/0/04148848",
"title": "Framework for Bloom's Knowledge Placement in Computer Games",
"doi": null,
"abstractUrl": "/proceedings-article/digitel/2007/04148848/12OmNxH9Xdv",
"parentPublication": {
"id": "proceedings/digitel/2007/2801/0",
"title": "2007 IEEE International Workshop on Digital Games and Intelligent Toys-based Education",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1cJ7haJo31C",
"title": "2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)",
"acronym": "icse-companion",
"groupId": "1002125",
"volume": "0",
"displayVolume": "0",
"year": "2019",
"__typename": "ProceedingType"
},
"article": {
"id": "1cJ7lufKWzu",
"doi": "10.1109/ICSE-Companion.2019.00025",
"title": "Developing Games That Capture and Engage Users",
"normalizedTitle": "Developing Games That Capture and Engage Users",
"abstract": "Developing games that can capture and engage users is not an easy process. The game industry, a multi-billion industry, is composed of many companies delivering a variety of games and adopting many different business and software development models. One trend that started to appear within the industry in recent years is the use of data to guide the design process and provide insights on different aspects of production, including software development, usability, monetization, and marketing, to mention a few. In this technical briefing, I will concentrate on the role of data in the game software development process and how data can be used to derive design and development insights. I will use case studies of collaborative work we have accomplished with different game companies as examples to demonstrate the utility of the approach.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Developing games that can capture and engage users is not an easy process. The game industry, a multi-billion industry, is composed of many companies delivering a variety of games and adopting many different business and software development models. One trend that started to appear within the industry in recent years is the use of data to guide the design process and provide insights on different aspects of production, including software development, usability, monetization, and marketing, to mention a few. In this technical briefing, I will concentrate on the role of data in the game software development process and how data can be used to derive design and development insights. I will use case studies of collaborative work we have accomplished with different game companies as examples to demonstrate the utility of the approach.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Developing games that can capture and engage users is not an easy process. The game industry, a multi-billion industry, is composed of many companies delivering a variety of games and adopting many different business and software development models. One trend that started to appear within the industry in recent years is the use of data to guide the design process and provide insights on different aspects of production, including software development, usability, monetization, and marketing, to mention a few. In this technical briefing, I will concentrate on the role of data in the game software development process and how data can be used to derive design and development insights. I will use case studies of collaborative work we have accomplished with different game companies as examples to demonstrate the utility of the approach.",
"fno": "176400a009",
"keywords": [
"Computer Games",
"Human Factors",
"Software Engineering",
"Game Industry",
"Design Process",
"Game Software Development Process",
"Game Companies",
"Software Usability",
"Monetization",
"Marketing",
"Games",
"Companies",
"Data Visualization",
"Industries",
"Telemetry",
"Software",
"Poles And Towers",
"Game Development",
"Game Analytics",
"Data Driven Game Design"
],
"authors": [
{
"affiliation": "Northeastern University",
"fullName": "Magy Seif El-Nasr",
"givenName": "Magy",
"surname": "Seif El-Nasr",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icse-companion",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2019-05-01T00:00:00",
"pubType": "proceedings",
"pages": "9-10",
"year": "2019",
"issn": null,
"isbn": "978-1-7281-1764-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "176400a004",
"articleId": "1cJ7hdx6yD6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "176400a011",
"articleId": "1cJ7mVkXNwQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vs-games/2010/6331/0/05460127",
"title": "Attentional Cueing in Serious Games",
"doi": null,
"abstractUrl": "/proceedings-article/vs-games/2010/05460127/12OmNArthcf",
"parentPublication": {
"id": "proceedings/vs-games/2010/6331/0",
"title": "2010 2nd International Conference on Games and Virtual Worlds for Serious Applications (VS-GAMES 2010)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2014/8065/0/8065a061",
"title": "Reconfigurable Games: Games that Change with the Environment",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2014/8065a061/12OmNxH9Xd3",
"parentPublication": {
"id": "proceedings/sbgames/2014/8065/0",
"title": "2014 Brazilian Symposium on Computer Games and Digital Entertainment (SBGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/models/2015/6908/0/07338274",
"title": "An automated model based testing approach for platform games",
"doi": null,
"abstractUrl": "/proceedings-article/models/2015/07338274/12OmNyOq4Ut",
"parentPublication": {
"id": "proceedings/models/2015/6908/0",
"title": "2015 ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems (MODELS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2014/3922/0/07044292",
"title": "Designing a blended learning curriculum in the development of video games",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2014/07044292/12OmNzUPpyJ",
"parentPublication": {
"id": "proceedings/fie/2014/3922/0",
"title": "2014 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dsaa/2016/5206/0/07796952",
"title": "Using Players' Gameplay Action-Decision Profiles to Prescribe Training: Reducing Training Costs with Serious Games Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/dsaa/2016/07796952/12OmNzsrwht",
"parentPublication": {
"id": "proceedings/dsaa/2016/5206/0",
"title": "2016 IEEE 3rd International Conference on Data Science and Advanced Analytics (DSAA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ci/2016/03/07008477",
"title": "Specialization of a UCT-Based General Game Playing Program to Single-Player Games",
"doi": null,
"abstractUrl": "/journal/ci/2016/03/07008477/13rRUB7a1ir",
"parentPublication": {
"id": "trans/ci",
"title": "IEEE Transactions on Computational Intelligence and AI in Games",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/asew/2021/3583/0/358300a073",
"title": "Rebuilding games at runtime",
"doi": null,
"abstractUrl": "/proceedings-article/asew/2021/358300a073/1AqwpclrC4U",
"parentPublication": {
"id": "proceedings/asew/2021/3583/0",
"title": "2021 36th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/imet/2022/7016/0/09929595",
"title": "A NEAT Approach to Wave Generation in Tower Defense Games",
"doi": null,
"abstractUrl": "/proceedings-article/imet/2022/09929595/1HYuQVXowvK",
"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/iccst/2021/4254/0/425400a364",
"title": "The Effect of Game as a Service on Future Game Industry Based on Users View",
"doi": null,
"abstractUrl": "/proceedings-article/iccst/2021/425400a364/1ziPj4vfbDG",
"parentPublication": {
"id": "proceedings/iccst/2021/4254/0",
"title": "2021 International Conference on Culture-oriented Science & Technology (ICCST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2021/0189/0/018900a069",
"title": "Games by End-Users: Analyzing Development Environments",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2021/018900a069/1zusnjhkrAc",
"parentPublication": {
"id": "proceedings/sbgames/2021/0189/0",
"title": "2021 20th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1zusn3PkfAs",
"title": "2021 20th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"acronym": "sbgames",
"groupId": "1800056",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1zusnjhkrAc",
"doi": "10.1109/SBGames54170.2021.00018",
"title": "Games by End-Users: Analyzing Development Environments",
"normalizedTitle": "Games by End-Users: Analyzing Development Environments",
"abstract": "Digital games are increasingly present in people's lives, especially in younger people's lives. At times, users want to do more than just play games produced by specialized companies, but would also like to customize them or create and play their own games and share them with their friends. Enabling users with no programming knowledge to develop their games raises several challenges, that range from game design to technical aspects. In this paper, our goal was to investigate the following research question “What strategies and constructs do game engines use to allow users with no previous knowledge of programming to create games?”. To do so, we used the Semiotic Inspection Method to analyze two game engines aimed mainly at this audience - GDevelop and Stencyl. As a result, we have identified the main strategies and constructs used in the tools to support game programming by end-users.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Digital games are increasingly present in people's lives, especially in younger people's lives. At times, users want to do more than just play games produced by specialized companies, but would also like to customize them or create and play their own games and share them with their friends. Enabling users with no programming knowledge to develop their games raises several challenges, that range from game design to technical aspects. In this paper, our goal was to investigate the following research question “What strategies and constructs do game engines use to allow users with no previous knowledge of programming to create games?”. To do so, we used the Semiotic Inspection Method to analyze two game engines aimed mainly at this audience - GDevelop and Stencyl. As a result, we have identified the main strategies and constructs used in the tools to support game programming by end-users.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Digital games are increasingly present in people's lives, especially in younger people's lives. At times, users want to do more than just play games produced by specialized companies, but would also like to customize them or create and play their own games and share them with their friends. Enabling users with no programming knowledge to develop their games raises several challenges, that range from game design to technical aspects. In this paper, our goal was to investigate the following research question “What strategies and constructs do game engines use to allow users with no previous knowledge of programming to create games?”. To do so, we used the Semiotic Inspection Method to analyze two game engines aimed mainly at this audience - GDevelop and Stencyl. As a result, we have identified the main strategies and constructs used in the tools to support game programming by end-users.",
"fno": "018900a069",
"keywords": [
"Computer Games",
"User Interfaces",
"Game Engines",
"Game Programming",
"Digital Games",
"Younger People",
"Game Design",
"End Users",
"G Develop",
"Stencyl",
"Entertainment Industry",
"Games",
"Companies",
"Programming",
"Inspection",
"Semiotics",
"Engines",
"End User Programming",
"Games",
"Scientific SIM"
],
"authors": [
{
"affiliation": "Universidade Federal de Minas Gerais,Department of Computer Science,Belo Horizonte,Brazil",
"fullName": "Joana Gabriela Ribeiro de Souza",
"givenName": "Joana Gabriela Ribeiro",
"surname": "de Souza",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Universidade Federal de Minas Gerais,Department of Computer Science,Belo Horizonte,Brazil",
"fullName": "Raquel Oliveira Prates",
"givenName": "Raquel Oliveira",
"surname": "Prates",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "sbgames",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-10-01T00:00:00",
"pubType": "proceedings",
"pages": "69-78",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-0189-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "018900a059",
"articleId": "1zuspxdwRy0",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "018900a079",
"articleId": "1zusnqGBq2A",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icalt/2014/4038/0/4038a662",
"title": "A Survey of Frameworks and Game Engines for Serious Game Development",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2014/4038a662/12OmNxxNbRP",
"parentPublication": {
"id": "proceedings/icalt/2014/4038/0",
"title": "2014 IEEE 14th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2015/8454/0/07344071",
"title": "The issues of adopting simulation games in software engineering classes",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2015/07344071/12OmNzJbQYP",
"parentPublication": {
"id": "proceedings/fie/2015/8454/0",
"title": "2015 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vlhcc/2016/0252/0/07739676",
"title": "A perspective on blending programming environments and games: Beyond points, badges, and leaderboards",
"doi": null,
"abstractUrl": "/proceedings-article/vlhcc/2016/07739676/12OmNzxyiDG",
"parentPublication": {
"id": "proceedings/vlhcc/2016/0252/0",
"title": "2016 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2018/9605/0/960500a081",
"title": "Do Not Puzzle the Puzzle Player: When Communicability Issues Influence Playability",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2018/960500a081/17D45Wuc39G",
"parentPublication": {
"id": "proceedings/sbgames/2018/9605/0",
"title": "2018 17th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iisa/2018/8161/0/08633689",
"title": "Evaluating 3D Serious Games on Cultural Education",
"doi": null,
"abstractUrl": "/proceedings-article/iisa/2018/08633689/17D45XoXP4H",
"parentPublication": {
"id": "proceedings/iisa/2018/8161/0",
"title": "2018 9th International Conference on Information, Intelligence, Systems and Applications (IISA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2018/9605/0/960500a021",
"title": "A Survey on Game Analytics in Massive Multiplayer Online Games",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2018/960500a021/17D45Xtvp7T",
"parentPublication": {
"id": "proceedings/sbgames/2018/9605/0",
"title": "2018 17th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/svr/2020/9231/0/923100a296",
"title": "Game Over: death representations in Virtual Reality Environments",
"doi": null,
"abstractUrl": "/proceedings-article/svr/2020/923100a296/1oZBAQAUCNa",
"parentPublication": {
"id": "proceedings/svr/2020/9231/0",
"title": "2020 22nd Symposium on Virtual and Augmented Reality (SVR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2021/4121/0/412100a319",
"title": "Analysing Games for Health through Users' Opinion Mining",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2021/412100a319/1vb8Y0rIdiw",
"parentPublication": {
"id": "proceedings/cbms/2021/4121/0",
"title": "2021 IEEE 34th International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icis-fall/2021/7679/0/09627376",
"title": "An Overview of Cooking Video Games and Testing Considerations",
"doi": null,
"abstractUrl": "/proceedings-article/icis-fall/2021/09627376/1z7dRzNOpnG",
"parentPublication": {
"id": "proceedings/icis-fall/2021/7679/0",
"title": "2021 IEEE/ACIS 20th International Fall Conference on Computer and Information Science (ICIS Fall)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sbgames/2021/0189/0/018900a059",
"title": "GEnEbook: A Game Engine to Provide Electronic Gamebooks for Adventure Games",
"doi": null,
"abstractUrl": "/proceedings-article/sbgames/2021/018900a059/1zuspxdwRy0",
"parentPublication": {
"id": "proceedings/sbgames/2021/0189/0",
"title": "2021 20th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNrJiCCK",
"title": "2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission",
"acronym": "3dimpvt",
"groupId": "1800494",
"volume": "0",
"displayVolume": "0",
"year": "2011",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAkWvhH",
"doi": "10.1109/3DIMPVT.2011.22",
"title": "A Feature-Preserved Canonical Form for Non-rigid 3D Meshes",
"normalizedTitle": "A Feature-Preserved Canonical Form for Non-rigid 3D Meshes",
"abstract": "Measuring the dissimilarity between non-rigid objects is a challenging problem in 3D shape retrieval. One potential solution is to construct the models' 3D canonical forms (i.e., isometry-invariant representations in 3D Euclidean space) on which any rigid shape matching algorithm can be applied. However, existing methods, which are typically based on embedding procedures, result in greatly distorted canonical forms, and thus could not provide satisfactory performance to distinguish non-rigid models. In this paper, we present a feature-preserved canonical form for non-rigid 3D meshes. The basic idea is to naturally deform original models against corresponding initial canonical forms calculated by Multidimensional Scaling (MDS). Specifically, objects are first segmented into near-rigid subparts, and then, through properly-designed rotations and translations, original subparts are transformed into poses that correspond well with their positions and directions on MDS canonical forms. Final results are obtained by solving some nonlinear minimization problems for optimal alignments and smoothing boundaries between subparts. Experiments on a widely utilized non-rigid 3D shape benchmark not only verify the advantages of our algorithm against existing approaches, but also demonstrate that, with the help of the proposed canonical form, we can obtain significantly better retrieval accuracy compared to the state-of-the-art.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Measuring the dissimilarity between non-rigid objects is a challenging problem in 3D shape retrieval. One potential solution is to construct the models' 3D canonical forms (i.e., isometry-invariant representations in 3D Euclidean space) on which any rigid shape matching algorithm can be applied. However, existing methods, which are typically based on embedding procedures, result in greatly distorted canonical forms, and thus could not provide satisfactory performance to distinguish non-rigid models. In this paper, we present a feature-preserved canonical form for non-rigid 3D meshes. The basic idea is to naturally deform original models against corresponding initial canonical forms calculated by Multidimensional Scaling (MDS). Specifically, objects are first segmented into near-rigid subparts, and then, through properly-designed rotations and translations, original subparts are transformed into poses that correspond well with their positions and directions on MDS canonical forms. Final results are obtained by solving some nonlinear minimization problems for optimal alignments and smoothing boundaries between subparts. Experiments on a widely utilized non-rigid 3D shape benchmark not only verify the advantages of our algorithm against existing approaches, but also demonstrate that, with the help of the proposed canonical form, we can obtain significantly better retrieval accuracy compared to the state-of-the-art.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Measuring the dissimilarity between non-rigid objects is a challenging problem in 3D shape retrieval. One potential solution is to construct the models' 3D canonical forms (i.e., isometry-invariant representations in 3D Euclidean space) on which any rigid shape matching algorithm can be applied. However, existing methods, which are typically based on embedding procedures, result in greatly distorted canonical forms, and thus could not provide satisfactory performance to distinguish non-rigid models. In this paper, we present a feature-preserved canonical form for non-rigid 3D meshes. The basic idea is to naturally deform original models against corresponding initial canonical forms calculated by Multidimensional Scaling (MDS). Specifically, objects are first segmented into near-rigid subparts, and then, through properly-designed rotations and translations, original subparts are transformed into poses that correspond well with their positions and directions on MDS canonical forms. Final results are obtained by solving some nonlinear minimization problems for optimal alignments and smoothing boundaries between subparts. Experiments on a widely utilized non-rigid 3D shape benchmark not only verify the advantages of our algorithm against existing approaches, but also demonstrate that, with the help of the proposed canonical form, we can obtain significantly better retrieval accuracy compared to the state-of-the-art.",
"fno": "4369a116",
"keywords": [
"Canonical Form",
"Non Rigid",
"3 D Shape Retrieval"
],
"authors": [
{
"affiliation": null,
"fullName": "Zhouhui Lian",
"givenName": "Zhouhui",
"surname": "Lian",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Afzal Godil",
"givenName": "Afzal",
"surname": "Godil",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "3dimpvt",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-05-01T00:00:00",
"pubType": "proceedings",
"pages": "116-123",
"year": "2011",
"issn": null,
"isbn": "978-0-7695-4369-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4369a108",
"articleId": "12OmNrY3LD5",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4369a124",
"articleId": "12OmNBtCCLr",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ismvl/1999/0161/0/01610092",
"title": "Evaluation of m-Valued Fixed Polarity Generalizations of Reed-Muller Canonical Form",
"doi": null,
"abstractUrl": "/proceedings-article/ismvl/1999/01610092/12OmNqJHFr4",
"parentPublication": {
"id": "proceedings/ismvl/1999/0161/0",
"title": "Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/1995/7119/0/71190040",
"title": "Knowledge Reuse through the Application of the Object Knowledge Canonical Form",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/1995/71190040/12OmNqJHFt1",
"parentPublication": {
"id": "proceedings/compsac/1995/7119/0",
"title": "Proceedings Nineteenth Annual International Computer Software and Applications Conference (COMPSAC'95)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2010/4271/0/4271a241",
"title": "Non-rigid Face Tracking Using Short Track-Life Features",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2010/4271a241/12OmNvHGryH",
"parentPublication": {
"id": "proceedings/dicta/2010/4271/0",
"title": "2010 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2010/4271/0/4271a058",
"title": "Adaptive Non-rigid Object Tracking by Fusing Visual and Motional Descriptors",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2010/4271a058/12OmNwDj1ax",
"parentPublication": {
"id": "proceedings/dicta/2010/4271/0",
"title": "2010 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vsr/1995/7122/0/71220045",
"title": "A canonical framework for sequences of images",
"doi": null,
"abstractUrl": "/proceedings-article/vsr/1995/71220045/12OmNx19k0r",
"parentPublication": {
"id": "proceedings/vsr/1995/7122/0",
"title": "Representation of Visual Scenes, IEEE Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1999/0149/1/01491192",
"title": "Toward Recovering Shape and Motion of 3D Curves from Multi-View Image Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1999/01491192/12OmNxXCGIc",
"parentPublication": {
"id": "proceedings/cvpr/1999/0149/2",
"title": "Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109a197",
"title": "Estimation of Non-rigid Surface Deformation Using Developable Surface Model",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109a197/12OmNy6qfPR",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2012/4873/0/4873a254",
"title": "Pinhole-to-Projection Pyramid Subtraction for Reconstructing Non-rigid Objects from Range Images",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2012/4873a254/12OmNyvGymV",
"parentPublication": {
"id": "proceedings/3dimpvt/2012/4873/0",
"title": "2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/uksim/2010/4016/0/4016a462",
"title": "Error Analysis of the Complex Kronecker Canonical Form",
"doi": null,
"abstractUrl": "/proceedings-article/uksim/2010/4016a462/12OmNzE54Gf",
"parentPublication": {
"id": "proceedings/uksim/2010/4016/0",
"title": "Computer Modeling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tc/1975/06/01672868",
"title": "Reed?Muller Canonical Forms in Multivalued Logic",
"doi": null,
"abstractUrl": "/journal/tc/1975/06/01672868/13rRUxASual",
"parentPublication": {
"id": "trans/tc",
"title": "IEEE Transactions on Computers",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNvjgWMe",
"title": "Computer Vision, IEEE International Conference on",
"acronym": "iccv",
"groupId": "1000149",
"volume": "0",
"displayVolume": "0",
"year": "1995",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxQOjFW",
"doi": "10.1109/ICCV.1995.466833",
"title": "Rigidity checking of 3D point correspondences under perspective projection",
"normalizedTitle": "Rigidity checking of 3D point correspondences under perspective projection",
"abstract": "An algorithm is described which rapidly verifies the potential rigidity of three dimensional point correspondences from a pair of three dimensional views under perspective projection. The output of the algorithm is a simple yes or no answer to the question \"Could these corresponding points from two views be the projection of a rigid configuration?\" Potential applications include 3D object recognition from a single previous view and correspondence matching for stereo or motion over widely separated views. Rigidity checking verifies point correspondences by using 3D recovery equations as a matching condition. The proposed algorithm improves upon other methods that fall under this approach because it works with as few as six corresponding points under full perspective projection, handles correspondences from widely separated views, makes full use of the disparity of the correspondences, and is integrated with a linear algorithm for 3D recovery due to Kontsevich (1991). Results are given for experiments with synthetic and real image data. A complete implementation of this algorithm is being made publicly available.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An algorithm is described which rapidly verifies the potential rigidity of three dimensional point correspondences from a pair of three dimensional views under perspective projection. The output of the algorithm is a simple yes or no answer to the question \"Could these corresponding points from two views be the projection of a rigid configuration?\" Potential applications include 3D object recognition from a single previous view and correspondence matching for stereo or motion over widely separated views. Rigidity checking verifies point correspondences by using 3D recovery equations as a matching condition. The proposed algorithm improves upon other methods that fall under this approach because it works with as few as six corresponding points under full perspective projection, handles correspondences from widely separated views, makes full use of the disparity of the correspondences, and is integrated with a linear algorithm for 3D recovery due to Kontsevich (1991). Results are given for experiments with synthetic and real image data. A complete implementation of this algorithm is being made publicly available.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An algorithm is described which rapidly verifies the potential rigidity of three dimensional point correspondences from a pair of three dimensional views under perspective projection. The output of the algorithm is a simple yes or no answer to the question \"Could these corresponding points from two views be the projection of a rigid configuration?\" Potential applications include 3D object recognition from a single previous view and correspondence matching for stereo or motion over widely separated views. Rigidity checking verifies point correspondences by using 3D recovery equations as a matching condition. The proposed algorithm improves upon other methods that fall under this approach because it works with as few as six corresponding points under full perspective projection, handles correspondences from widely separated views, makes full use of the disparity of the correspondences, and is integrated with a linear algorithm for 3D recovery due to Kontsevich (1991). Results are given for experiments with synthetic and real image data. A complete implementation of this algorithm is being made publicly available.",
"fno": "70420945",
"keywords": [
"Object Recognition Motion Estimation Stereo Image Processing Image Sequences Rigidity Checking 3 D Point Correspondences Perspective Projection Three Dimensional Point Correspondences Three Dimensional Views 3 D Object Recognition Correspondence Matching Stereo Image Image Motion 3 D Recovery Equations Linear Algorithm Real Image Data Synthetic Data"
],
"authors": [
{
"affiliation": "Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",
"fullName": "D.P. McReynolds",
"givenName": "D.P.",
"surname": "McReynolds",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",
"fullName": "D.G. Lowe",
"givenName": "D.G.",
"surname": "Lowe",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccv",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1995-06-01T00:00:00",
"pubType": "proceedings",
"pages": "945",
"year": "1995",
"issn": null,
"isbn": "0-8186-7042-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "70420938",
"articleId": "12OmNz5JC8Q",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "70420951",
"articleId": "12OmNy5zsuC",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwnH4Ql",
"title": "Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "1",
"displayVolume": "0",
"year": "1999",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNxXCGIc",
"doi": "10.1109/CVPR.1999.786938",
"title": "Toward Recovering Shape and Motion of 3D Curves from Multi-View Image Sequences",
"normalizedTitle": "Toward Recovering Shape and Motion of 3D Curves from Multi-View Image Sequences",
"abstract": "We introduce a framework for recovering the 3D shape and motion of unknown, arbitrarily-moving curves from two or more image sequences acquired simultaneously from distinct points in space. We use this framework to (1) identify ambiguities in the multi-view recovery of (rigid or non-rigid) 3D motion for arbitrary curves, and (2) identify a novel spatio-temporal constraint that couples the problems of 3D shape and 3D motion recovery in the multi-view case. We show that this constraint leads to a simple hypothesize-and-test algorithm for estimating 3D curve shape and motion simultaneously. Experiments performed with synthetic data suggest that, in addition to recovering 3D curve motion, our approach yields shape estimates of higher accuracy than those obtained when stereo analysis alone is applied to a multi-view sequence.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We introduce a framework for recovering the 3D shape and motion of unknown, arbitrarily-moving curves from two or more image sequences acquired simultaneously from distinct points in space. We use this framework to (1) identify ambiguities in the multi-view recovery of (rigid or non-rigid) 3D motion for arbitrary curves, and (2) identify a novel spatio-temporal constraint that couples the problems of 3D shape and 3D motion recovery in the multi-view case. We show that this constraint leads to a simple hypothesize-and-test algorithm for estimating 3D curve shape and motion simultaneously. Experiments performed with synthetic data suggest that, in addition to recovering 3D curve motion, our approach yields shape estimates of higher accuracy than those obtained when stereo analysis alone is applied to a multi-view sequence.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We introduce a framework for recovering the 3D shape and motion of unknown, arbitrarily-moving curves from two or more image sequences acquired simultaneously from distinct points in space. We use this framework to (1) identify ambiguities in the multi-view recovery of (rigid or non-rigid) 3D motion for arbitrary curves, and (2) identify a novel spatio-temporal constraint that couples the problems of 3D shape and 3D motion recovery in the multi-view case. We show that this constraint leads to a simple hypothesize-and-test algorithm for estimating 3D curve shape and motion simultaneously. Experiments performed with synthetic data suggest that, in addition to recovering 3D curve motion, our approach yields shape estimates of higher accuracy than those obtained when stereo analysis alone is applied to a multi-view sequence.",
"fno": "01491192",
"keywords": [
"Stereo Motion",
"Multi View",
"Curves",
"3 D Shape Recovery",
"3 D Motion Recovery",
"Non Rigid Motion",
"Normal Flow"
],
"authors": [
{
"affiliation": "University of Rochester",
"fullName": "Rodrigo L. Carceroni",
"givenName": "Rodrigo L.",
"surname": "Carceroni",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Rochester",
"fullName": "Kiriakos N. Kutulakos",
"givenName": "Kiriakos N.",
"surname": "Kutulakos",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1999-06-01T00:00:00",
"pubType": "proceedings",
"pages": "1192",
"year": "1999",
"issn": "1063-6919",
"isbn": "0-7695-0149-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "01491185",
"articleId": "12OmNzaQo8E",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "01491200",
"articleId": "12OmNyS6Ryb",
"__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": "12OmNzayNGw",
"doi": "10.1109/CVPR.2011.5995557",
"title": "Matching 2D image lines to 3D models: Two improvements and a new algorithm",
"normalizedTitle": "Matching 2D image lines to 3D models: Two improvements and a new algorithm",
"abstract": "We revisit the problem of matching a set of lines in the 2D image to a set of corresponding lines in the 3D model for the following reasons. (a) Existing algorithms that treat lines as infinitely long contain a flaw, namely, the solutions found are not invariant with respect to the choice of the coordinate frame. The source of this flaw is in the way lines are represented. We propose a frame-independent representation for sets of infinite lines that removes the non-invariance flaw. (b) Algorithms for finding the best rigid transform are nonlinear optimizations that are sensitive to initialization and may result in unreliable and expensive solutions. We present a new recipe for initialization that exploits the 3D geometry of the problem and is applicable to all algorithms that perform the matching in the 3D scene. Experiments show that with this initialization all algorithms find the best transform. (c) We present a new efficient matching algorithm that is significantly faster than existing alternatives, since it does not require explicit evaluation of the cost function and its derivatives.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We revisit the problem of matching a set of lines in the 2D image to a set of corresponding lines in the 3D model for the following reasons. (a) Existing algorithms that treat lines as infinitely long contain a flaw, namely, the solutions found are not invariant with respect to the choice of the coordinate frame. The source of this flaw is in the way lines are represented. We propose a frame-independent representation for sets of infinite lines that removes the non-invariance flaw. (b) Algorithms for finding the best rigid transform are nonlinear optimizations that are sensitive to initialization and may result in unreliable and expensive solutions. We present a new recipe for initialization that exploits the 3D geometry of the problem and is applicable to all algorithms that perform the matching in the 3D scene. Experiments show that with this initialization all algorithms find the best transform. (c) We present a new efficient matching algorithm that is significantly faster than existing alternatives, since it does not require explicit evaluation of the cost function and its derivatives.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We revisit the problem of matching a set of lines in the 2D image to a set of corresponding lines in the 3D model for the following reasons. (a) Existing algorithms that treat lines as infinitely long contain a flaw, namely, the solutions found are not invariant with respect to the choice of the coordinate frame. The source of this flaw is in the way lines are represented. We propose a frame-independent representation for sets of infinite lines that removes the non-invariance flaw. (b) Algorithms for finding the best rigid transform are nonlinear optimizations that are sensitive to initialization and may result in unreliable and expensive solutions. We present a new recipe for initialization that exploits the 3D geometry of the problem and is applicable to all algorithms that perform the matching in the 3D scene. Experiments show that with this initialization all algorithms find the best transform. (c) We present a new efficient matching algorithm that is significantly faster than existing alternatives, since it does not require explicit evaluation of the cost function and its derivatives.",
"fno": "05995557",
"keywords": [
"3 D Scene",
"2 D Image Line Matching",
"3 D Models",
"Frame Independent Representation",
"Rigid Transform",
"Nonlinear Optimizations",
"3 D Geometry"
],
"authors": [
{
"affiliation": "Office of Naval Res., Arlington, VA, USA",
"fullName": "B. Kamgar-Parsi",
"givenName": "B.",
"surname": "Kamgar-Parsi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Naval Res. Lab., Navy Center for Appl. Res. in AI, Washington, DC, USA",
"fullName": "B. Kamgar-Parsi",
"givenName": "B.",
"surname": "Kamgar-Parsi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2011-06-01T00:00:00",
"pubType": "proceedings",
"pages": "2425-2432",
"year": "2011",
"issn": null,
"isbn": "978-1-4577-0394-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05995556",
"articleId": "12OmNBE7MnF",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05995558",
"articleId": "12OmNrJRPh2",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/aici/2009/3816/3/3816c099",
"title": "2D Line Matching Using Geometric and Intensity Data",
"doi": null,
"abstractUrl": "/proceedings-article/aici/2009/3816c099/12OmNAYoKtL",
"parentPublication": {
"id": "proceedings/aici/2009/3816/3",
"title": "2009 International Conference on Artificial Intelligence and Computational Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icsc/2011/4492/0/4492a419",
"title": "Sill Image Object Categorization Using 2D Objects Models",
"doi": null,
"abstractUrl": "/proceedings-article/icsc/2011/4492a419/12OmNrIrPrU",
"parentPublication": {
"id": "proceedings/icsc/2011/4492/0",
"title": "2011 IEEE Fifth International Conference on Semantic Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109d963",
"title": "Real-Time 3D Face and Facial Action Tracking Using Extended 2D+3D AAMs",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109d963/12OmNroijel",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dicta/2011/4588/0/4588a152",
"title": "3D Model-Based Sematic Labeling of 2D Objects",
"doi": null,
"abstractUrl": "/proceedings-article/dicta/2011/4588a152/12OmNxFaLlX",
"parentPublication": {
"id": "proceedings/dicta/2011/4588/0",
"title": "2011 International Conference on Digital Image Computing: Techniques and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dimpvt/2012/4873/0/4873a403",
"title": "A Repeatable and Efficient Canonical Reference for Surface Matching",
"doi": null,
"abstractUrl": "/proceedings-article/3dimpvt/2012/4873a403/12OmNyKrH5d",
"parentPublication": {
"id": "proceedings/3dimpvt/2012/4873/0",
"title": "2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2010/4109/0/4109b225",
"title": "Automatic Asymmetric 3D-2D Face Recognition",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2010/4109b225/12OmNyqzM2o",
"parentPublication": {
"id": "proceedings/icpr/2010/4109/0",
"title": "Pattern Recognition, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2000/0580/0/05800169",
"title": "A Robust Model-Based Approach for 3D Head Tracking in Video Sequences",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2000/05800169/12OmNz5apAB",
"parentPublication": {
"id": "proceedings/fg/2000/0580/0",
"title": "Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/01/ttp2009010180",
"title": "2D Shape Matching by Contour Flexibility",
"doi": null,
"abstractUrl": "/journal/tp/2009/01/ttp2009010180/13rRUxBJhnN",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2009/03/ttp2009030492",
"title": "Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion Handling",
"doi": null,
"abstractUrl": "/journal/tp/2009/03/ttp2009030492/13rRUxBJhnO",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccsmt/2021/2063/0/206300a429",
"title": "A Fast and Efficient Lines Matching Method via Multi-depth-layer Strategy",
"doi": null,
"abstractUrl": "/proceedings-article/iccsmt/2021/206300a429/1E2w7cmtTyM",
"parentPublication": {
"id": "proceedings/iccsmt/2021/2063/0",
"title": "2021 2nd International Conference on Computer Science and Management Technology (ICCSMT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNxWcH0Q",
"title": "Pattern Recognition, International Conference on",
"acronym": "icpr",
"groupId": "1000545",
"volume": "3",
"displayVolume": "3",
"year": "2000",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvB9FxN",
"doi": "10.1109/ICPR.2000.903644",
"title": "Pose Estimation of a 2-D Articulated Object from Its Silhouette Using a GA",
"normalizedTitle": "Pose Estimation of a 2-D Articulated Object from Its Silhouette Using a GA",
"abstract": "This paper proposes a model-based method for estimating the pose of a two-dimensional (2-D) articulated object from a single silhouette image using a genetic algorithm (GA). In this study, a human body viewed sideways is treated as a 2-D articulated object. The model of the articulated object is given as a stick one. Its pose is represented in 2-D position of the main stick and angles of all sticks connected at joints. The parameter space for representing the pose of the stick model is very large. Therefore, we limit the search space to the range in which the stick model does not protrude from the silhouette. For the search space limitation, the region of position and angle of the stick perfectly included in the silhouette is obtained for each stick in advance. The pose of the stick model is evaluated in the sum of the proximity measure from each pixel in the silhouette to the stick model. Experiments with synthetic silhouettes by a human figure design tool show that the proposed method can estimate various poses and that it can be applied to several human figures with a single stick model.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper proposes a model-based method for estimating the pose of a two-dimensional (2-D) articulated object from a single silhouette image using a genetic algorithm (GA). In this study, a human body viewed sideways is treated as a 2-D articulated object. The model of the articulated object is given as a stick one. Its pose is represented in 2-D position of the main stick and angles of all sticks connected at joints. The parameter space for representing the pose of the stick model is very large. Therefore, we limit the search space to the range in which the stick model does not protrude from the silhouette. For the search space limitation, the region of position and angle of the stick perfectly included in the silhouette is obtained for each stick in advance. The pose of the stick model is evaluated in the sum of the proximity measure from each pixel in the silhouette to the stick model. Experiments with synthetic silhouettes by a human figure design tool show that the proposed method can estimate various poses and that it can be applied to several human figures with a single stick model.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper proposes a model-based method for estimating the pose of a two-dimensional (2-D) articulated object from a single silhouette image using a genetic algorithm (GA). In this study, a human body viewed sideways is treated as a 2-D articulated object. The model of the articulated object is given as a stick one. Its pose is represented in 2-D position of the main stick and angles of all sticks connected at joints. The parameter space for representing the pose of the stick model is very large. Therefore, we limit the search space to the range in which the stick model does not protrude from the silhouette. For the search space limitation, the region of position and angle of the stick perfectly included in the silhouette is obtained for each stick in advance. The pose of the stick model is evaluated in the sum of the proximity measure from each pixel in the silhouette to the stick model. Experiments with synthetic silhouettes by a human figure design tool show that the proposed method can estimate various poses and that it can be applied to several human figures with a single stick model.",
"fno": "07503717",
"keywords": [],
"authors": [
{
"affiliation": null,
"fullName": "Kenji Shoji",
"givenName": "Kenji",
"surname": "Shoji",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Atsushi Mito",
"givenName": "Atsushi",
"surname": "Mito",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Fubito Toyama",
"givenName": "Fubito",
"surname": "Toyama",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": false,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2000-09-01T00:00:00",
"pubType": "proceedings",
"pages": "3717",
"year": "2000",
"issn": null,
"isbn": "0-7695-0750-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07503713",
"articleId": "12OmNBhHt8n",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07503722",
"articleId": "12OmNwE9OTf",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNAolGQA",
"title": "2016 IEEE Applied Imagery Pattern Recognition Workshop (AIPR)",
"acronym": "aipr",
"groupId": "1000046",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx4Q6IA",
"doi": "10.1109/AIPR.2016.8010592",
"title": "Vehicle-pedestrian dynamic interaction through tractography of relative movements and articulated pedestrian pose estimation",
"normalizedTitle": "Vehicle-pedestrian dynamic interaction through tractography of relative movements and articulated pedestrian pose estimation",
"abstract": "To design robust Pre-Collision Systems (PCS) we must develop new techniques that will allow a better understanding of the vehicle-pedestrian dynamic relationship, and which can predict pedestrian future movements. This paper focuses on the potential-conflict situations where a collision may happen if no avoidance action is taken from driver or pedestrian. We have used 1000 15-second videos to find vehicle-pedestrian relative dynamic trajectories and pose of pedestrians. Adaptive structural local appearance model and particle filter methods have been implemented to track the pedestrians. We have obtained accurate tractography results for over 82% of the videos. For pose estimation, we have used flexible mixture model for capturing cooccurrence between pedestrian body segments. Based on existing single-frame human pose estimation model, we have implemented Kalman filtering with other new techniques to make stable stickfigure videos of the pedestrian dynamic motion. These tractography and pose estimation data were used as features to train a neural network for classifying 'potential conflict' and 'no potential conflict' situations. The training of the network achieved 91.2% true label accuracy, and 8.8% false level accuracy. Finally, the trained network was used to assess the probability of collision over time for the 15 seconds videos which generates a spike when there is a 'potential conflict' situation. The paper enables new analysis on potential-conflict pedestrian cases with 2D tractography data and stick-figure pose representation of pedestrians, which provides significant insight on the vehiclepedestrian dynamics that are critical for safe autonomous driving and transportation safety innovations.",
"abstracts": [
{
"abstractType": "Regular",
"content": "To design robust Pre-Collision Systems (PCS) we must develop new techniques that will allow a better understanding of the vehicle-pedestrian dynamic relationship, and which can predict pedestrian future movements. This paper focuses on the potential-conflict situations where a collision may happen if no avoidance action is taken from driver or pedestrian. We have used 1000 15-second videos to find vehicle-pedestrian relative dynamic trajectories and pose of pedestrians. Adaptive structural local appearance model and particle filter methods have been implemented to track the pedestrians. We have obtained accurate tractography results for over 82% of the videos. For pose estimation, we have used flexible mixture model for capturing cooccurrence between pedestrian body segments. Based on existing single-frame human pose estimation model, we have implemented Kalman filtering with other new techniques to make stable stickfigure videos of the pedestrian dynamic motion. These tractography and pose estimation data were used as features to train a neural network for classifying 'potential conflict' and 'no potential conflict' situations. The training of the network achieved 91.2% true label accuracy, and 8.8% false level accuracy. Finally, the trained network was used to assess the probability of collision over time for the 15 seconds videos which generates a spike when there is a 'potential conflict' situation. The paper enables new analysis on potential-conflict pedestrian cases with 2D tractography data and stick-figure pose representation of pedestrians, which provides significant insight on the vehiclepedestrian dynamics that are critical for safe autonomous driving and transportation safety innovations.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "To design robust Pre-Collision Systems (PCS) we must develop new techniques that will allow a better understanding of the vehicle-pedestrian dynamic relationship, and which can predict pedestrian future movements. This paper focuses on the potential-conflict situations where a collision may happen if no avoidance action is taken from driver or pedestrian. We have used 1000 15-second videos to find vehicle-pedestrian relative dynamic trajectories and pose of pedestrians. Adaptive structural local appearance model and particle filter methods have been implemented to track the pedestrians. We have obtained accurate tractography results for over 82% of the videos. For pose estimation, we have used flexible mixture model for capturing cooccurrence between pedestrian body segments. Based on existing single-frame human pose estimation model, we have implemented Kalman filtering with other new techniques to make stable stickfigure videos of the pedestrian dynamic motion. These tractography and pose estimation data were used as features to train a neural network for classifying 'potential conflict' and 'no potential conflict' situations. The training of the network achieved 91.2% true label accuracy, and 8.8% false level accuracy. Finally, the trained network was used to assess the probability of collision over time for the 15 seconds videos which generates a spike when there is a 'potential conflict' situation. The paper enables new analysis on potential-conflict pedestrian cases with 2D tractography data and stick-figure pose representation of pedestrians, which provides significant insight on the vehiclepedestrian dynamics that are critical for safe autonomous driving and transportation safety innovations.",
"fno": "08010592",
"keywords": [
"Videos",
"Vehicle Dynamics",
"Pose Estimation",
"Legged Locomotion",
"Histograms",
"Adaptive Equalizers",
"Image Color Analysis",
"Pre Collision System",
"Pose Estimation",
"Transportation Safety"
],
"authors": [
{
"affiliation": "Indiana University-Purdue University Indianapolis, Indianapolis, IN 46202",
"fullName": "Rifat Mueid",
"givenName": "Rifat",
"surname": "Mueid",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Indiana University-Purdue University Indianapolis, Indianapolis, IN 46202",
"fullName": "Lauren Christopher",
"givenName": "Lauren",
"surname": "Christopher",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Indiana University-Purdue University Indianapolis, Indianapolis, IN 46202",
"fullName": "Renran Tian",
"givenName": "Renran",
"surname": "Tian",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "aipr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-6",
"year": "2016",
"issn": "2332-5615",
"isbn": "978-1-5090-3284-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "08010591",
"articleId": "12OmNyGbI5g",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08010593",
"articleId": "12OmNBigFxw",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/csci/2016/5510/0/07881513",
"title": "Estimating Distracted Pedestrian from Deviated Walking Considering Consumption of Working Memory",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2016/07881513/12OmNwGZNKW",
"parentPublication": {
"id": "proceedings/csci/2016/5510/0",
"title": "2016 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2011/0063/0/06130236",
"title": "Analyzing pedestrian behavior in crowds for automatic detection of congestions",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2011/06130236/12OmNwswfZ2",
"parentPublication": {
"id": "proceedings/iccvw/2011/0063/0",
"title": "2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mass/2014/6036/0/6036a663",
"title": "Towards City-Scale Smartphone Sensing of Potentially Unsafe Pedestrian Movements",
"doi": null,
"abstractUrl": "/proceedings-article/mass/2014/6036a663/12OmNyoiZ8a",
"parentPublication": {
"id": "proceedings/mass/2014/6036/0",
"title": "2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apscc/2009/5338/0/05394118",
"title": "Parameters analysis for an intersection bus-pedestrian collision warning system",
"doi": null,
"abstractUrl": "/proceedings-article/apscc/2009/05394118/12OmNzUxO9D",
"parentPublication": {
"id": "proceedings/apscc/2009/5338/0",
"title": "2009 IEEE Asia-Pacific Services Computing Conference (APSCC 2009)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000f275",
"title": "Encoding Crowd Interaction with Deep Neural Network for Pedestrian Trajectory Prediction",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000f275/17D45W2WyzF",
"parentPublication": {
"id": "proceedings/cvpr/2018/6420/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2018/6420/0/642000c119",
"title": "Attention-Aware Compositional Network for Person Re-identification",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2018/642000c119/17D45Wda7fj",
"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/ds-rt/2022/9799/0/09932038",
"title": "A Pedestrian Movement Model for 3D Visualization in a Driving Simulation Environment",
"doi": null,
"abstractUrl": "/proceedings-article/ds-rt/2022/09932038/1HWPYmJdHpu",
"parentPublication": {
"id": "proceedings/ds-rt/2022/9799/0",
"title": "2022 IEEE/ACM 26th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/avss/2019/0990/0/08909859",
"title": "Constraining Relative Camera Pose Estimation with Pedestrian Detector-Based Correspondence Filters",
"doi": null,
"abstractUrl": "/proceedings-article/avss/2019/08909859/1febLNO1bQ4",
"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"
},
{
"id": "proceedings/icoin/2020/4199/0/09016444",
"title": "A Study on Vehicle-Pedestrian Communication System Using Warning Ranges of Mobile Objects",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2020/09016444/1hQqTyqOCk0",
"parentPublication": {
"id": "proceedings/icoin/2020/4199/0",
"title": "2020 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09411958",
"title": "Semantic Segmentation for Pedestrian Detection from Motion in Temporal Domain",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09411958/1tmikqLe1Ms",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "17D45VtKirA",
"title": "2018 15th Conference on Computer and Robot Vision (CRV)",
"acronym": "crv",
"groupId": "1001794",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "17D45XeKgrf",
"doi": "10.1109/CRV.2018.00051",
"title": "HyperStackNet: A Hyper Stacked Hourglass Deep Convolutional Neural Network Architecture for Joint Player and Stick Pose Estimation in Hockey",
"normalizedTitle": "HyperStackNet: A Hyper Stacked Hourglass Deep Convolutional Neural Network Architecture for Joint Player and Stick Pose Estimation in Hockey",
"abstract": "Human pose estimation in ice hockey is one of the biggest challenges in computer vision-driven sports analytics, with a variety of difficulties such as bulky hockey wear, color similarity between ice rink and player jersey and the presence of additional sports equipment used by the players such as hockey sticks. As such, deep neural network architectures typically used for sports including baseball, soccer, and track and field perform poorly when applied to hockey. Inspired by the idea that the position of the hockey sticks can not only be useful for improving hockey player pose estimation but also can be used for assessing a player's performance, a novel HyperStackNet architecture has been designed and implemented for joint player and stick pose estimation. In addition to improving player pose estimation, the HyperStackNet architecture enables improved transfer learning from pre-trained stacked hourglass networks trained on a different domain. Experimental results demonstrate that when the HyperStackNet is trained to detect 18 different joint positions on a hockey player (including the hockey stick) the accuracy is 98.8% on the test dataset, thus demonstrating its efficacy for handling complex joint player and stick pose estimation from video.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Human pose estimation in ice hockey is one of the biggest challenges in computer vision-driven sports analytics, with a variety of difficulties such as bulky hockey wear, color similarity between ice rink and player jersey and the presence of additional sports equipment used by the players such as hockey sticks. As such, deep neural network architectures typically used for sports including baseball, soccer, and track and field perform poorly when applied to hockey. Inspired by the idea that the position of the hockey sticks can not only be useful for improving hockey player pose estimation but also can be used for assessing a player's performance, a novel HyperStackNet architecture has been designed and implemented for joint player and stick pose estimation. In addition to improving player pose estimation, the HyperStackNet architecture enables improved transfer learning from pre-trained stacked hourglass networks trained on a different domain. Experimental results demonstrate that when the HyperStackNet is trained to detect 18 different joint positions on a hockey player (including the hockey stick) the accuracy is 98.8% on the test dataset, thus demonstrating its efficacy for handling complex joint player and stick pose estimation from video.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Human pose estimation in ice hockey is one of the biggest challenges in computer vision-driven sports analytics, with a variety of difficulties such as bulky hockey wear, color similarity between ice rink and player jersey and the presence of additional sports equipment used by the players such as hockey sticks. As such, deep neural network architectures typically used for sports including baseball, soccer, and track and field perform poorly when applied to hockey. Inspired by the idea that the position of the hockey sticks can not only be useful for improving hockey player pose estimation but also can be used for assessing a player's performance, a novel HyperStackNet architecture has been designed and implemented for joint player and stick pose estimation. In addition to improving player pose estimation, the HyperStackNet architecture enables improved transfer learning from pre-trained stacked hourglass networks trained on a different domain. Experimental results demonstrate that when the HyperStackNet is trained to detect 18 different joint positions on a hockey player (including the hockey stick) the accuracy is 98.8% on the test dataset, thus demonstrating its efficacy for handling complex joint player and stick pose estimation from video.",
"fno": "648101a313",
"keywords": [
"Computer Vision",
"Convolutional Neural Nets",
"Learning Artificial Intelligence",
"Pose Estimation",
"Sport",
"Video Signal Processing",
"Hyper Stacked Hourglass Deep Convolutional Neural Network Architecture",
"Ice Hockey",
"Computer Vision Driven Sports Analytics",
"Bulky Hockey Wear",
"Ice Rink",
"Player Jersey",
"Hockey Stick",
"Deep Neural Network Architectures",
"Hockey Player",
"Hourglass Networks",
"Sports Equipment",
"Hockey Players",
"Hyper Stack Net Architecture",
"Stick Pose Estimation",
"Sports",
"Pose Estimation",
"Computer Architecture",
"Heating Systems",
"Ice",
"Neural Networks",
"Hidden Markov Models",
"Ice Hockey",
"Pose Estimation",
"Deep Networks",
"Joint Position",
"Hockey Stick",
"Video Analytics",
"Computer Vision",
"Neural Networks"
],
"authors": [
{
"affiliation": null,
"fullName": "Helmut Neher",
"givenName": "Helmut",
"surname": "Neher",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Kanav Vats",
"givenName": "Kanav",
"surname": "Vats",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Alexander Wong",
"givenName": "Alexander",
"surname": "Wong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "David A. Clausi",
"givenName": "David A.",
"surname": "Clausi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "crv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-05-01T00:00:00",
"pubType": "proceedings",
"pages": "313-320",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-6481-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "648101a305",
"articleId": "17D45WgziQU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "648101a321",
"articleId": "17D45X2fUFz",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cvprw/2017/0733/0/0733a085",
"title": "Hockey Action Recognition via Integrated Stacked Hourglass Network",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733a085/12OmNAoDieU",
"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/cvprw/2017/0733/0/0733a147",
"title": "Classification of Puck Possession Events in Ice Hockey",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2017/0733a147/12OmNC943E6",
"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/crv/2011/4362/0/4362a032",
"title": "Using Line and Ellipse Features for Rectification of Broadcast Hockey Video",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2011/4362a032/12OmNviZlGI",
"parentPublication": {
"id": "proceedings/crv/2011/4362/0",
"title": "2011 Canadian Conference on Computer and Robot Vision",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/crv/2005/2319/0/23190152",
"title": "Analysis of Player Actions in Selected Hockey Game Situations",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2005/23190152/12OmNxw5Bj7",
"parentPublication": {
"id": "proceedings/crv/2005/2319/0",
"title": "The 2nd Canadian Conference on Computer and Robot Vision (CRV'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2019/1975/0/197500b636",
"title": "Keep Your Eye on the Puck: Automatic Hockey Videography",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2019/197500b636/18j8MxlOXTy",
"parentPublication": {
"id": "proceedings/wacv/2019/1975/0",
"title": "2019 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2022/8739/0/873900d450",
"title": "Ice hockey player identification via transformers and weakly supervised learning",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2022/873900d450/1G560PDMJMs",
"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/crv/2019/1838/0/183800a181",
"title": "Two-Stream Action Recognition in Ice Hockey using Player Pose Sequences and Optical Flows",
"doi": null,
"abstractUrl": "/proceedings-article/crv/2019/183800a181/1cMGuTEHiNi",
"parentPublication": {
"id": "proceedings/crv/2019/1838/0",
"title": "2019 16th Conference on Computer and Robot Vision (CRV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600c543",
"title": "Temporal Hockey Action Recognition via Pose and Optical Flows",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600c543/1iTvvkvDzwY",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2020/9360/0/09150721",
"title": "A System for Acquisition and Modelling of Ice-Hockey Stick Shape Deformation from Player Shot Videos",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2020/09150721/1lPHm2gPlv2",
"parentPublication": {
"id": "proceedings/cvprw/2020/9360/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2021/4899/0/489900e515",
"title": "Detecting and Matching Related Objects with One Proposal Multiple Predictions",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2021/489900e515/1yq2w8BOlos",
"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": "1B12DGrwoyQ",
"title": "2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)",
"acronym": "wacv",
"groupId": "1000040",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1B13x0kn2I8",
"doi": "10.1109/WACV51458.2022.00170",
"title": "Transfer Learning for Pose Estimation of Illustrated Characters",
"normalizedTitle": "Transfer Learning for Pose Estimation of Illustrated Characters",
"abstract": "Human pose information is a critical component in many downstream image processing tasks, such as activity recognition and motion tracking. Likewise, a pose estimator for the illustrated character domain would provide a valuable prior for assistive content creation tasks, such as reference pose retrieval and automatic character animation. But while modern data-driven techniques have substantially improved pose estimation performance on natural images, little work has been done for illustrations. In our work, we bridge this domain gap by efficiently transfer-learning from both domain-specific and task-specific source models. Additionally, we upgrade and expand an existing illustrated pose estimation dataset, and introduce two new datasets for classification and segmentation subtasks. We then apply the resultant state-of-the-art character pose estimator to solve the novel task of pose-guided illustration retrieval. All data, models, and code will be made publicly available.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Human pose information is a critical component in many downstream image processing tasks, such as activity recognition and motion tracking. Likewise, a pose estimator for the illustrated character domain would provide a valuable prior for assistive content creation tasks, such as reference pose retrieval and automatic character animation. But while modern data-driven techniques have substantially improved pose estimation performance on natural images, little work has been done for illustrations. In our work, we bridge this domain gap by efficiently transfer-learning from both domain-specific and task-specific source models. Additionally, we upgrade and expand an existing illustrated pose estimation dataset, and introduce two new datasets for classification and segmentation subtasks. We then apply the resultant state-of-the-art character pose estimator to solve the novel task of pose-guided illustration retrieval. All data, models, and code will be made publicly available.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Human pose information is a critical component in many downstream image processing tasks, such as activity recognition and motion tracking. Likewise, a pose estimator for the illustrated character domain would provide a valuable prior for assistive content creation tasks, such as reference pose retrieval and automatic character animation. But while modern data-driven techniques have substantially improved pose estimation performance on natural images, little work has been done for illustrations. In our work, we bridge this domain gap by efficiently transfer-learning from both domain-specific and task-specific source models. Additionally, we upgrade and expand an existing illustrated pose estimation dataset, and introduce two new datasets for classification and segmentation subtasks. We then apply the resultant state-of-the-art character pose estimator to solve the novel task of pose-guided illustration retrieval. All data, models, and code will be made publicly available.",
"fno": "091500b638",
"keywords": [
"Computer Animation",
"Learning Artificial Intelligence",
"Pose Estimation",
"Transfer Learning",
"Illustrated Characters",
"Critical Component",
"Downstream Image Processing Tasks",
"Activity Recognition",
"Motion Tracking",
"Illustrated Character Domain",
"Assistive Content Creation Tasks",
"Automatic Character Animation",
"Modern Data Driven Techniques",
"Estimation Performance",
"Natural Images",
"Illustrations",
"Domain Gap",
"Transfer Learning",
"Domain Specific",
"Task Specific Source Models",
"Existing Illustrated Pose Estimation Dataset",
"Resultant State Of The Art Character",
"Pose Guided Illustration Retrieval",
"Bridges",
"Image Segmentation",
"Computer Vision",
"Codes",
"Tracking",
"Pose Estimation",
"Transfer Learning",
"Transfer",
"Few Shot",
"Semi And Un Supervised Learning Datasets",
"Evaluation And Comparison Of Vision Algorithms",
"Deep Learning",
"Image Video Indexing And Retrieval"
],
"authors": [
{
"affiliation": "University of Maryland,College Park",
"fullName": "Shuhong Chen",
"givenName": "Shuhong",
"surname": "Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Maryland,College Park",
"fullName": "Matthias Zwicker",
"givenName": "Matthias",
"surname": "Zwicker",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "wacv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-01-01T00:00:00",
"pubType": "proceedings",
"pages": "1638-1647",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-0915-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1B13wX5YeSA",
"name": "pwacv202209150-09706984s1-mm_091500b638.zip",
"size": "2.22 MB",
"location": "https://www.computer.org/csdl/api/v1/extra/pwacv202209150-09706984s1-mm_091500b638.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "091500b628",
"articleId": "1B12XiU3wiY",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "091500b648",
"articleId": "1B13KtzkSGc",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccv/2017/1032/0/1032e373",
"title": "Active Learning for Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2017/1032e373/12OmNAIMO6b",
"parentPublication": {
"id": "proceedings/iccv/2017/1032/0",
"title": "2017 IEEE International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2016/8851/0/8851d063",
"title": "Personalizing Human Video Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2016/8851d063/12OmNARiM3C",
"parentPublication": {
"id": "proceedings/cvpr/2016/8851/0",
"title": "2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccv/2021/2812/0/281200l1720",
"title": "Online Knowledge Distillation for Efficient Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200l1720/1BmFmqUmBEI",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccp/2022/5851/0/09887660",
"title": "HiddenPose: Non-Line-of-Sight 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccp/2022/09887660/1GZiyY97Q3u",
"parentPublication": {
"id": "proceedings/iccp/2022/5851/0",
"title": "2022 IEEE International Conference on Computational Photography (ICCP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600l1007",
"title": "PoseTriplet: Co-evolving 3D Human Pose Estimation, Imitation, and Hallucination under Self-supervision",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600l1007/1H0KyyEtDHy",
"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/694600n3065",
"title": "AdaptPose: Cross-Dataset Adaptation for 3D Human Pose Estimation by Learnable Motion Generation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600n3065/1H1hGEJB9hm",
"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/hdis/2022/9144/0/09991696",
"title": "Human Pose Estimation for Boxing Based on Model Transfer Learning",
"doi": null,
"abstractUrl": "/proceedings-article/hdis/2022/09991696/1JwPWjvwGw8",
"parentPublication": {
"id": "proceedings/hdis/2022/9144/0",
"title": "2022 International Conference on High Performance Big Data and Intelligent Systems (HDIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800n3155",
"title": "Deformation-Aware Unpaired Image Translation for Pose Estimation on Laboratory Animals",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800n3155/1m3novzQpqw",
"parentPublication": {
"id": "proceedings/cvpr/2020/7168/0",
"title": "2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2021/0477/0/047700b858",
"title": "Pretraining boosts out-of-domain robustness for pose estimation",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2021/047700b858/1uqGl1PC6fC",
"parentPublication": {
"id": "proceedings/wacv/2021/0477/0",
"title": "2021 IEEE Winter Conference on Applications of Computer Vision (WACV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900i571",
"title": "PoseAug: A Differentiable Pose Augmentation Framework for 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900i571/1yeKofrFGZa",
"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": "1yeHGyRsuys",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1yeLkLEshDa",
"doi": "10.1109/CVPR46437.2021.00708",
"title": "SimPoE: Simulated Character Control for 3D Human Pose Estimation",
"normalizedTitle": "SimPoE: Simulated Character Control for 3D Human Pose Estimation",
"abstract": "Accurate estimation of 3D human motion from monocular video requires modeling both kinematics (body motion without physical forces) and dynamics (motion with physical forces). To demonstrate this, we present SimPoE, a Simulation-based approach for 3D human Pose Estimation, which integrates image-based kinematic inference and physics-based dynamics modeling. SimPoE learns a policy that takes as input the current-frame pose estimate and the next image frame to control a physically-simulated character to output the next-frame pose estimate. The policy contains a learnable kinematic pose refinement unit that uses 2D keypoints to iteratively refine its kinematic pose estimate of the next frame. Based on this refined kinematic pose, the policy learns to compute dynamics-based control (e.g., joint torques) of the character to advance the current-frame pose estimate to the pose estimate of the next frame. This design couples the kinematic pose refinement unit with the dynamics-based control generation unit, which are learned jointly with reinforcement learning to achieve accurate and physically-plausible pose estimation. Furthermore, we propose a meta-control mechanism that dynamically adjusts the character’s dynamics parameters based on the character state to attain more accurate pose estimates. Experiments on large-scale motion datasets demonstrate that our approach establishes the new state of the art in pose accuracy while ensuring physical plausibility.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Accurate estimation of 3D human motion from monocular video requires modeling both kinematics (body motion without physical forces) and dynamics (motion with physical forces). To demonstrate this, we present SimPoE, a Simulation-based approach for 3D human Pose Estimation, which integrates image-based kinematic inference and physics-based dynamics modeling. SimPoE learns a policy that takes as input the current-frame pose estimate and the next image frame to control a physically-simulated character to output the next-frame pose estimate. The policy contains a learnable kinematic pose refinement unit that uses 2D keypoints to iteratively refine its kinematic pose estimate of the next frame. Based on this refined kinematic pose, the policy learns to compute dynamics-based control (e.g., joint torques) of the character to advance the current-frame pose estimate to the pose estimate of the next frame. This design couples the kinematic pose refinement unit with the dynamics-based control generation unit, which are learned jointly with reinforcement learning to achieve accurate and physically-plausible pose estimation. Furthermore, we propose a meta-control mechanism that dynamically adjusts the character’s dynamics parameters based on the character state to attain more accurate pose estimates. Experiments on large-scale motion datasets demonstrate that our approach establishes the new state of the art in pose accuracy while ensuring physical plausibility.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Accurate estimation of 3D human motion from monocular video requires modeling both kinematics (body motion without physical forces) and dynamics (motion with physical forces). To demonstrate this, we present SimPoE, a Simulation-based approach for 3D human Pose Estimation, which integrates image-based kinematic inference and physics-based dynamics modeling. SimPoE learns a policy that takes as input the current-frame pose estimate and the next image frame to control a physically-simulated character to output the next-frame pose estimate. The policy contains a learnable kinematic pose refinement unit that uses 2D keypoints to iteratively refine its kinematic pose estimate of the next frame. Based on this refined kinematic pose, the policy learns to compute dynamics-based control (e.g., joint torques) of the character to advance the current-frame pose estimate to the pose estimate of the next frame. This design couples the kinematic pose refinement unit with the dynamics-based control generation unit, which are learned jointly with reinforcement learning to achieve accurate and physically-plausible pose estimation. Furthermore, we propose a meta-control mechanism that dynamically adjusts the character’s dynamics parameters based on the character state to attain more accurate pose estimates. Experiments on large-scale motion datasets demonstrate that our approach establishes the new state of the art in pose accuracy while ensuring physical plausibility.",
"fno": "450900h155",
"keywords": [
"Computer Vision",
"Image Motion Analysis",
"Learning Artificial Intelligence",
"Pose Estimation",
"Robot Dynamics",
"Physical Forces",
"Sim Po E",
"Simulation Based Approach",
"3 D Human Pose Estimation",
"Image Based Kinematic Inference",
"Physics Based Dynamics",
"Current Frame",
"Image Frame",
"Next Frame Pose Estimate",
"Learnable Kinematic Pose Refinement Unit",
"Kinematic Pose Estimate",
"Dynamics Based Control Generation Unit",
"Accurate Pose Estimates",
"Physical Plausibility",
"Simulated Character Control",
"3 D Human Motion",
"Body Motion",
"Solid Modeling",
"Computer Vision",
"Three Dimensional Displays",
"Pose Estimation",
"Dynamics",
"Kinematics",
"Reinforcement Learning"
],
"authors": [
{
"affiliation": "Carnegie Mellon University",
"fullName": "Ye Yuan",
"givenName": "Ye",
"surname": "Yuan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Facebook Reality Labs",
"fullName": "Shih-En Wei",
"givenName": "Shih-En",
"surname": "Wei",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Facebook Reality Labs",
"fullName": "Tomas Simon",
"givenName": "Tomas",
"surname": "Simon",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Carnegie Mellon University",
"fullName": "Kris Kitani",
"givenName": "Kris",
"surname": "Kitani",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Facebook Reality Labs",
"fullName": "Jason Saragih",
"givenName": "Jason",
"surname": "Saragih",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-06-01T00:00:00",
"pubType": "proceedings",
"pages": "7155-7165",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-4509-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [
{
"id": "1yeLkIHEBRC",
"name": "pcvpr202145090-09578708s1-mm_450900h155.zip",
"size": "183 kB",
"location": "https://www.computer.org/csdl/api/v1/extra/pcvpr202145090-09578708s1-mm_450900h155.zip",
"__typename": "WebExtraType"
}
],
"adjacentArticles": {
"previous": {
"fno": "450900h146",
"articleId": "1yeJkvFrmq4",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "450900h166",
"articleId": "1yeKEJyn60w",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2018/3365/0/08447556",
"title": "Cascaded 3D Full-Body Pose Regression from Single Depth Image at 100 FPS",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2018/08447556/13bd1fdV4lW",
"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/iccv/2021/2812/0/281200l1199",
"title": "Hierarchical Kinematic Probability Distributions for 3D Human Shape and Pose Estimation from Images in the Wild",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200l1199/1BmFCtHSJNe",
"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/281200n3013",
"title": "Encoder-decoder with Multi-level Attention for 3D Human Shape and Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2021/281200n3013/1BmKXsiz5vy",
"parentPublication": {
"id": "proceedings/iccv/2021/2812/0",
"title": "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/wacv/2023/9346/0/934600f714",
"title": "Kinematic-aware Hierarchical Attention Network for Human Pose Estimation in Videos",
"doi": null,
"abstractUrl": "/proceedings-article/wacv/2023/934600f714/1L8qtOIQmY0",
"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/iccv/2019/4803/0/480300c282",
"title": "Resolving 3D Human Pose Ambiguities With 3D Scene Constraints",
"doi": null,
"abstractUrl": "/proceedings-article/iccv/2019/480300c282/1hVlg3qjlHq",
"parentPublication": {
"id": "proceedings/iccv/2019/4803/0",
"title": "2019 IEEE/CVF International Conference on Computer Vision (ICCV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2019/2506/0/250600b695",
"title": "DHP19: Dynamic Vision Sensor 3D Human Pose Dataset",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2019/250600b695/1iTvsZi6WKA",
"parentPublication": {
"id": "proceedings/cvprw/2019/2506/0",
"title": "2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09411956",
"title": "Occlusion-tolerant and personalized 3D human pose estimation in RGB images",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09411956/1tmiO8HrsWI",
"parentPublication": {
"id": "proceedings/icpr/2021/8808/0",
"title": "2020 25th International Conference on Pattern Recognition (ICPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2021/8808/0/09412126",
"title": "PEAN: 3D Hand Pose Estimation Adversarial Network",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2021/09412126/1tmizxbU8Cs",
"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/450900i571",
"title": "PoseAug: A Differentiable Pose Augmentation Framework for 3D Human Pose Estimation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900i571/1yeKofrFGZa",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/2022/12/09653865",
"title": "Orientation Keypoints for 6D Human Pose Estimation",
"doi": null,
"abstractUrl": "/journal/tp/2022/12/09653865/1znIQ3gVCeI",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__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": "13bd1sx4ZsZ",
"doi": "10.1109/VR.2018.8446142",
"title": "Phase-Aligned Foveated Rendering for Virtual Reality Headsets",
"normalizedTitle": "Phase-Aligned Foveated Rendering for Virtual Reality Headsets",
"abstract": "We propose a novel method of foveated rendering for virtual reality, targeting head-mounted displays with large fields of view or high pixel densities. Our foveation method removes motion-induced flicker in the periphery by aligning the rendered pixel grid to the virtual scene content during rasterization and upsampling. This method dramatically reduces detectability of motion artifacts in the periphery without complex interpolation or anti-aliasing algorithms.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose a novel method of foveated rendering for virtual reality, targeting head-mounted displays with large fields of view or high pixel densities. Our foveation method removes motion-induced flicker in the periphery by aligning the rendered pixel grid to the virtual scene content during rasterization and upsampling. This method dramatically reduces detectability of motion artifacts in the periphery without complex interpolation or anti-aliasing algorithms.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose a novel method of foveated rendering for virtual reality, targeting head-mounted displays with large fields of view or high pixel densities. Our foveation method removes motion-induced flicker in the periphery by aligning the rendered pixel grid to the virtual scene content during rasterization and upsampling. This method dramatically reduces detectability of motion artifacts in the periphery without complex interpolation or anti-aliasing algorithms.",
"fno": "08446142",
"keywords": [
"Antialiasing",
"Helmet Mounted Displays",
"Rendering Computer Graphics",
"Virtual Reality",
"High Pixel Densities",
"Motion Induced Flicker",
"Periphery",
"Rendered Pixel Grid",
"Virtual Scene Content",
"Motion Artifacts",
"Phase Aligned Foveated Rendering",
"Virtual Reality Headsets",
"Head Mounted Displays",
"Rendering Computer Graphics",
"Headphones",
"Graphics Processing Units",
"Three Dimensional Displays",
"Virtual Reality",
"Head Mounted Displays",
"Head",
"H 5 1 Information Interfaces And Presentation Multimedia Information Systems Artificial",
"Augmented",
"And Virtual Realities"
],
"authors": [
{
"affiliation": "Google Inc",
"fullName": "Eric Turner",
"givenName": "Eric",
"surname": "Turner",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Google Inc",
"fullName": "Haomiao Jiang",
"givenName": "Haomiao",
"surname": "Jiang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Google Inc",
"fullName": "Damien Saint-Macary",
"givenName": "Damien",
"surname": "Saint-Macary",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Google Inc",
"fullName": "Behnam Bastani",
"givenName": "Behnam",
"surname": "Bastani",
"__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": "08446279",
"articleId": "13bd1eSlyu2",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "08446141",
"articleId": "13bd1tl2omi",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vr/2022/9617/0/961700a756",
"title": "Rectangular Mapping-based Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2022/961700a756/1CJcj9wHjH2",
"parentPublication": {
"id": "proceedings/vr/2022/9617/0",
"title": "2022 IEEE on Conference Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2023/01/09903564",
"title": "FoVolNet: Fast Volume Rendering using Foveated Deep Neural Networks",
"doi": null,
"abstractUrl": "/journal/tg/2023/01/09903564/1GZombIreEg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/11/09873853",
"title": "Foveated Stochastic Lightcuts",
"doi": null,
"abstractUrl": "/journal/tg/2022/11/09873853/1GjwMIuxYUE",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2023/4815/0/481500a471",
"title": "Locomotion-aware Foveated Rendering",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2023/481500a471/1MNgzzb0RWg",
"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/2021/08/09007492",
"title": "3D-Kernel Foveated Rendering for Light Fields",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09007492/1hJKlSvNgo8",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2020/05/09005240",
"title": "Eye-dominance-guided Foveated Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2020/05/09005240/1hzNcOce8OQ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2020/8508/0/850800a001",
"title": "Foveated Instant Radiosity",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2020/850800a001/1pysxhw4Bqw",
"parentPublication": {
"id": "proceedings/ismar/2020/8508/0",
"title": "2020 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/11/09523836",
"title": "Foveated Photon Mapping",
"doi": null,
"abstractUrl": "/journal/tg/2021/11/09523836/1wpquR1qr1S",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2021/0158/0/015800a001",
"title": "Perception-Driven Hybrid Foveated Depth of Field Rendering for Head-Mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2021/015800a001/1yeCURkWXpS",
"parentPublication": {
"id": "proceedings/ismar/2021/0158/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2021/0158/0/015800a413",
"title": "Selective Foveated Ray Tracing for Head-Mounted Displays",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2021/015800a413/1yeD8bFOZos",
"parentPublication": {
"id": "proceedings/ismar/2021/0158/0",
"title": "2021 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNz2TCu6",
"title": "Computer Graphics International Conference",
"acronym": "cgi",
"groupId": "1000132",
"volume": "0",
"displayVolume": "0",
"year": "2003",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNx76TKO",
"doi": "10.1109/CGI.2003.1214465",
"title": "A Real-Time Refraction Renderer for Volume Objects Using a Polygon-Rendering Scheme",
"normalizedTitle": "A Real-Time Refraction Renderer for Volume Objects Using a Polygon-Rendering Scheme",
"abstract": "This paper proposes the per Vertex Ray Tracing (pVRT) method for real-time refraction rendering and discusses its algorithm, hardware implementation, and results. Our algorithm is based on single-pass rendering with a pre-processing phase to calculate the destinations of rays passing through transparent volume objects. In the pre-processing process, the direction and position of a ray?s destination, which is the point at which a ray, after passing through a transparent object, intersects with an image frame, are calculated for each object independently, and objects made from refractive materials are rendered by using the computed addresses in the image buffer where the non-transparent objects are rendered. This method will be implemented entirely in hardware, and a performance evaluation based on software simulation showed an average calculation speed of 458,907 polygon/sec. (241,530 vertex/ sec) in the pre-processing process.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This paper proposes the per Vertex Ray Tracing (pVRT) method for real-time refraction rendering and discusses its algorithm, hardware implementation, and results. Our algorithm is based on single-pass rendering with a pre-processing phase to calculate the destinations of rays passing through transparent volume objects. In the pre-processing process, the direction and position of a ray?s destination, which is the point at which a ray, after passing through a transparent object, intersects with an image frame, are calculated for each object independently, and objects made from refractive materials are rendered by using the computed addresses in the image buffer where the non-transparent objects are rendered. This method will be implemented entirely in hardware, and a performance evaluation based on software simulation showed an average calculation speed of 458,907 polygon/sec. (241,530 vertex/ sec) in the pre-processing process.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This paper proposes the per Vertex Ray Tracing (pVRT) method for real-time refraction rendering and discusses its algorithm, hardware implementation, and results. Our algorithm is based on single-pass rendering with a pre-processing phase to calculate the destinations of rays passing through transparent volume objects. In the pre-processing process, the direction and position of a ray?s destination, which is the point at which a ray, after passing through a transparent object, intersects with an image frame, are calculated for each object independently, and objects made from refractive materials are rendered by using the computed addresses in the image buffer where the non-transparent objects are rendered. This method will be implemented entirely in hardware, and a performance evaluation based on software simulation showed an average calculation speed of 458,907 polygon/sec. (241,530 vertex/ sec) in the pre-processing process.",
"fno": "19460190",
"keywords": [
"Graphics Hardware",
"Real Time Refraction Mapping",
"Ray Tracing",
"Polygon Rendering"
],
"authors": [
{
"affiliation": "NEC Electronics Corporation, Japan",
"fullName": "Eisaku Ohbuchi",
"givenName": "Eisaku",
"surname": "Ohbuchi",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cgi",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2003-07-01T00:00:00",
"pubType": "proceedings",
"pages": "190",
"year": "2003",
"issn": "1530-1052",
"isbn": "0-7695-1946-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "19460184",
"articleId": "12OmNBU1jGu",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "19460196",
"articleId": "12OmNyKrHh5",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/shpcc/1994/5680/0/00296651",
"title": "Load balancing of parallel volume rendering with scattered decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/shpcc/1994/00296651/12OmNAQJzPJ",
"parentPublication": {
"id": "proceedings/shpcc/1994/5680/0",
"title": "Proceedings of IEEE Scalable High Performance Computing Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/visual/1994/6627/0/00346341",
"title": "A distributed, parallel, interactive volume rendering package",
"doi": null,
"abstractUrl": "/proceedings-article/visual/1994/00346341/12OmNBqdrb7",
"parentPublication": {
"id": "proceedings/visual/1994/6627/0",
"title": "Proceedings Visualization '94",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icig/2007/2929/0/29290997",
"title": "Interactive Two-sided Refraction for Dynamic Object on GPU",
"doi": null,
"abstractUrl": "/proceedings-article/icig/2007/29290997/12OmNC3Xhcr",
"parentPublication": {
"id": "proceedings/icig/2007/2929/0",
"title": "Image and Graphics, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cgames/2011/1451/0/06000333",
"title": "Texture mapping volumes using GPU-based polygon-assisted raycasting",
"doi": null,
"abstractUrl": "/proceedings-article/cgames/2011/06000333/12OmNC8dg9S",
"parentPublication": {
"id": "proceedings/cgames/2011/1451/0",
"title": "2011 16th International Conference on Computer Games (CGAMES)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/sibgrapi/2005/2389/0/23890273",
"title": "High-Quality Hardware-Based Ray-Casting Volume Rendering Using Partial Pre-Integration",
"doi": null,
"abstractUrl": "/proceedings-article/sibgrapi/2005/23890273/12OmNzRZpZy",
"parentPublication": {
"id": "proceedings/sibgrapi/2005/2389/0",
"title": "XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/rt/2008/2741/0/04634629",
"title": "A lighting model for fast rendering of forest ecosystems",
"doi": null,
"abstractUrl": "/proceedings-article/rt/2008/04634629/12OmNzdoMBB",
"parentPublication": {
"id": "proceedings/rt/2008/2741/0",
"title": "Symposium on Interactive Ray Tracing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2007/01/v0046",
"title": "Interactive Approximate Rendering of Reflections, Refractions, and Caustics",
"doi": null,
"abstractUrl": "/journal/tg/2007/01/v0046/13rRUxBJhmJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2018/01/08017622",
"title": "Interactive Dynamic Volume Illumination with Refraction and Caustics",
"doi": null,
"abstractUrl": "/journal/tg/2018/01/08017622/13rRUyfKIHU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/1996/05/mcg1996050021",
"title": "It's Really Not a Rendering Bug, You See ...",
"doi": null,
"abstractUrl": "/magazine/cg/1996/05/mcg1996050021/13rRUyuegjb",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vr/2020/5608/0/09089460",
"title": "Accelerated Stereo Rendering with Hybrid Reprojection-Based Rasterization and Adaptive Ray-Tracing",
"doi": null,
"abstractUrl": "/proceedings-article/vr/2020/09089460/1jIxdmr8R32",
"parentPublication": {
"id": "proceedings/vr/2020/5608/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces (VR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1qyxi3OgORy",
"title": "2020 International Conference on 3D Vision (3DV)",
"acronym": "3dv",
"groupId": "1800494",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1qyxorGJH8c",
"doi": "10.1109/3DV50981.2020.00127",
"title": "TRANSPR: Transparency Ray-Accumulating Neural 3D Scene Point Renderer",
"normalizedTitle": "TRANSPR: Transparency Ray-Accumulating Neural 3D Scene Point Renderer",
"abstract": "We propose and evaluate a neural point-based graphics method that can model semi-transparent scene parts. Similarly to its predecessor pipeline, ours uses point clouds to model proxy geometry, and augments each point with a neural descriptor. Additionally, a learnable transparency value is introduced in our approach for each point. Our neural rendering procedure consists of two steps. Firstly, the point cloud is rasterized using ray marching into a multi-channel image. This is followed by the neural rendering step that “translates” the rasterized image into an RGB output using a learnable convolutional network. New scenes can be modeled using gradient-based optimization of neural descriptors and of the rendering network.We show that novel views of semi-transparent point cloud scenes can be generated after training with our approach. Our experiments demonstrate the benefit of introducing semi-transparency into the neural point-based modeling for a range of scenes with semi-transparent parts. The project materials and the code are available at http://saic-violet.github.io/transpr.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We propose and evaluate a neural point-based graphics method that can model semi-transparent scene parts. Similarly to its predecessor pipeline, ours uses point clouds to model proxy geometry, and augments each point with a neural descriptor. Additionally, a learnable transparency value is introduced in our approach for each point. Our neural rendering procedure consists of two steps. Firstly, the point cloud is rasterized using ray marching into a multi-channel image. This is followed by the neural rendering step that “translates” the rasterized image into an RGB output using a learnable convolutional network. New scenes can be modeled using gradient-based optimization of neural descriptors and of the rendering network.We show that novel views of semi-transparent point cloud scenes can be generated after training with our approach. Our experiments demonstrate the benefit of introducing semi-transparency into the neural point-based modeling for a range of scenes with semi-transparent parts. The project materials and the code are available at http://saic-violet.github.io/transpr.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We propose and evaluate a neural point-based graphics method that can model semi-transparent scene parts. Similarly to its predecessor pipeline, ours uses point clouds to model proxy geometry, and augments each point with a neural descriptor. Additionally, a learnable transparency value is introduced in our approach for each point. Our neural rendering procedure consists of two steps. Firstly, the point cloud is rasterized using ray marching into a multi-channel image. This is followed by the neural rendering step that “translates” the rasterized image into an RGB output using a learnable convolutional network. New scenes can be modeled using gradient-based optimization of neural descriptors and of the rendering network.We show that novel views of semi-transparent point cloud scenes can be generated after training with our approach. Our experiments demonstrate the benefit of introducing semi-transparency into the neural point-based modeling for a range of scenes with semi-transparent parts. The project materials and the code are available at http://saic-violet.github.io/transpr.",
"fno": "812800b167",
"keywords": [
"Computational Geometry",
"Convolutional Neural Nets",
"Gradient Methods",
"Image Segmentation",
"Learning Artificial Intelligence",
"Optimisation",
"Rendering Computer Graphics",
"Solid Modelling",
"Transparency Ray Accumulating Neural 3 D Scene Point Renderer",
"Neural Point Based Graphics Method",
"Semitransparent Scene Parts",
"Neural Descriptor",
"Ray Marching",
"Neural Rendering Step",
"Learnable Convolutional Network",
"Semitransparent Point Cloud Scenes",
"Model Proxy Geometry",
"Multichannel Image",
"Gradient Based Optimization",
"Rendering Computer Graphics",
"Three Dimensional Displays",
"Graphics",
"Cameras",
"Pipelines",
"Image Resolution",
"Computational Modeling",
"Computer Vision",
"Neural Rendering",
"Point Based Rendering",
"Point Cloud",
"Photogrammetry"
],
"authors": [
{
"affiliation": "Samsung AI Center,Moscow,Russia",
"fullName": "Maria Kolos",
"givenName": "Maria",
"surname": "Kolos",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Samsung AI Center,Moscow,Russia",
"fullName": "Artem Sevastopolsky",
"givenName": "Artem",
"surname": "Sevastopolsky",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Samsung AI Center,Moscow,Russia",
"fullName": "Victor Lempitsky",
"givenName": "Victor",
"surname": "Lempitsky",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "3dv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-11-01T00:00:00",
"pubType": "proceedings",
"pages": "1167-1175",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-8128-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "812800b157",
"articleId": "1qyxjeVoO7S",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "812800b176",
"articleId": "1qyxjD7QrGU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/cgi/2003/1946/0/19460190",
"title": "A Real-Time Refraction Renderer for Volume Objects Using a Polygon-Rendering Scheme",
"doi": null,
"abstractUrl": "/proceedings-article/cgi/2003/19460190/12OmNx76TKO",
"parentPublication": {
"id": "proceedings/cgi/2003/1946/0",
"title": "Computer Graphics International Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ismar/2014/6184/0/06948431",
"title": "WeARHand: Head-worn, RGB-D camera-based, bare-hand user interface with visually enhanced depth perception",
"doi": null,
"abstractUrl": "/proceedings-article/ismar/2014/06948431/12OmNx76TS3",
"parentPublication": {
"id": "proceedings/ismar/2014/6184/0",
"title": "2014 IEEE International Symposium on Mixed and Augmented Reality (ISMAR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2009/06/ttg2009061283",
"title": "Perception-Based Transparency Optimization for Direct Volume Rendering",
"doi": null,
"abstractUrl": "/journal/tg/2009/06/ttg2009061283/13rRUwIF69f",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/07/07244244",
"title": "Enhancing Light Fields through Ray-Space Stitching",
"doi": null,
"abstractUrl": "/journal/tg/2016/07/07244244/13rRUx0xPn1",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2013/05/ttg2013050838",
"title": "Smart Transparency for Illustrative Visualization of Complex Flow Surfaces",
"doi": null,
"abstractUrl": "/journal/tg/2013/05/ttg2013050838/13rRUxC0SvU",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2022/6946/0/694600f428",
"title": "Point-NeRF: Point-based Neural Radiance Fields",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2022/694600f428/1H1mrGLgvra",
"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/3dv/2022/5670/0/567000a104",
"title": "Efficient Human Pose Estimation via 3D Event Point Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2022/567000a104/1KYswqRo9eE",
"parentPublication": {
"id": "proceedings/3dv/2022/5670/0",
"title": "2022 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/3dv/2022/5670/0/567000a242",
"title": "MonoNHR: Monocular Neural Human Renderer",
"doi": null,
"abstractUrl": "/proceedings-article/3dv/2022/567000a242/1KYsx7s4siQ",
"parentPublication": {
"id": "proceedings/3dv/2022/5670/0",
"title": "2022 International Conference on 3D Vision (3DV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800f416",
"title": "Neural Voxel Renderer: Learning an Accurate and Controllable Rendering Tool",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800f416/1m3nYbnokEM",
"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/716800h827",
"title": "Neural Point Cloud Rendering via Multi-Plane Projection",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800h827/1m3nmJqUK8o",
"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": "12OmNrNh0uF",
"title": "2012 Ninth Conference on Computer and Robot Vision",
"acronym": "crv",
"groupId": "1001794",
"volume": "0",
"displayVolume": "0",
"year": "2012",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNAkniXB",
"doi": "10.1109/CRV.2012.52",
"title": "Robust Horizon Detection Using Segmentation for UAV Applications",
"normalizedTitle": "Robust Horizon Detection Using Segmentation for UAV Applications",
"abstract": "A critical step in navigation of unmanned aerial vehicles is the detection of the horizon line. This information can be used for adjusting flight parameters as well as obstacle avoidance. In this paper, a fast and robust technique for precise detection of the horizon path is proposed. The method is based on existence of a unique light field that occurs in imagery where the horizon is viewed. This light field exists in different scenes including sea-sky, soil-sky, and forest-sky horizon lines. Our proposed approach employs segmentation of the scene and subsequent analysis of the image segments for extraction of the mentioned field and thus the horizon path. Through various experiments carried out on our own dataset and that of another previously published paper, we illustrate the significance and accuracy of this technique for various types of terrains from water to ground, and even snow-covered ground. Finally, it is shown that robust performance and accuracy, speed, and extraction of the path as curves (as opposed to a straight line which is resulted from many other approaches) are the benefits of our method.",
"abstracts": [
{
"abstractType": "Regular",
"content": "A critical step in navigation of unmanned aerial vehicles is the detection of the horizon line. This information can be used for adjusting flight parameters as well as obstacle avoidance. In this paper, a fast and robust technique for precise detection of the horizon path is proposed. The method is based on existence of a unique light field that occurs in imagery where the horizon is viewed. This light field exists in different scenes including sea-sky, soil-sky, and forest-sky horizon lines. Our proposed approach employs segmentation of the scene and subsequent analysis of the image segments for extraction of the mentioned field and thus the horizon path. Through various experiments carried out on our own dataset and that of another previously published paper, we illustrate the significance and accuracy of this technique for various types of terrains from water to ground, and even snow-covered ground. Finally, it is shown that robust performance and accuracy, speed, and extraction of the path as curves (as opposed to a straight line which is resulted from many other approaches) are the benefits of our method.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A critical step in navigation of unmanned aerial vehicles is the detection of the horizon line. This information can be used for adjusting flight parameters as well as obstacle avoidance. In this paper, a fast and robust technique for precise detection of the horizon path is proposed. The method is based on existence of a unique light field that occurs in imagery where the horizon is viewed. This light field exists in different scenes including sea-sky, soil-sky, and forest-sky horizon lines. Our proposed approach employs segmentation of the scene and subsequent analysis of the image segments for extraction of the mentioned field and thus the horizon path. Through various experiments carried out on our own dataset and that of another previously published paper, we illustrate the significance and accuracy of this technique for various types of terrains from water to ground, and even snow-covered ground. Finally, it is shown that robust performance and accuracy, speed, and extraction of the path as curves (as opposed to a straight line which is resulted from many other approaches) are the benefits of our method.",
"fno": "4683a346",
"keywords": [
"Robot Vision",
"Autonomous Aerial Vehicles",
"Collision Avoidance",
"Feature Extraction",
"Image Segmentation",
"Object Detection",
"Snow Covered Ground",
"UAV Applications",
"Robust Horizon Detection",
"Unmanned Aerial Vehicles",
"Flight Parameters Adjustment",
"Obstacle Avoidance",
"Horizon Path Detection",
"Light Field",
"Sea Sky Horizon Lines",
"Soil Sky Horizon Lines",
"Forest Sky Horizon Lines",
"Image Segmentation",
"Field Extraction",
"Dataset",
"Robustness",
"Clustering Algorithms",
"Image Color Analysis",
"Navigation",
"Image Segmentation",
"Object Segmentation",
"Image Edge Detection",
"K Means",
"Unmanned Aerial Vehicles",
"Horizon",
"Clustering"
],
"authors": [
{
"affiliation": "Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada",
"fullName": "S. A. Etemad",
"givenName": "S. A.",
"surname": "Etemad",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Sch. of Inf. Technol., Carleton Univ., Ottawa, ON, Canada",
"fullName": "A. Whitehead",
"givenName": "A.",
"surname": "Whitehead",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, ON, Canada",
"fullName": "Nasim Sepehri Boroujeni",
"givenName": "Nasim Sepehri",
"surname": "Boroujeni",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "crv",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2012-05-01T00:00:00",
"pubType": "proceedings",
"pages": "346-352",
"year": "2012",
"issn": null,
"isbn": "978-0-7695-4683-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4683a338",
"articleId": "12OmNzRqdIg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4683a353",
"articleId": "12OmNBqMDqM",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/sc/1988/0882/0/00044637",
"title": "The fast Fourier transform and sparse matrix computations: a study of two applications on the Horizon supercomputer",
"doi": null,
"abstractUrl": "/proceedings-article/sc/1988/00044637/12OmNBc1uwA",
"parentPublication": {
"id": "proceedings/sc/1988/0882/0",
"title": "SC Conference",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isda/2008/3382/1/3382a133",
"title": "Heuristics for Dynamic Lot-Sizing with Plan Setup Cost in a Rolling Horizon Environment",
"doi": null,
"abstractUrl": "/proceedings-article/isda/2008/3382a133/12OmNqOOrL6",
"parentPublication": {
"id": "proceedings/isda/2008/3382/1",
"title": "Intelligent Systems Design and Applications, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdc/2000/6638/1/00912751",
"title": "Robust finite horizon MPC without terminal constraints",
"doi": null,
"abstractUrl": "/proceedings-article/cdc/2000/00912751/12OmNrYlmJY",
"parentPublication": {
"id": "proceedings/cdc/2000/6638/1",
"title": "Proceedings of the 39th IEEE Conference on Decision and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cdc/2000/6638/5/00914716",
"title": "Relaxing the optimality condition in receding horizon control",
"doi": null,
"abstractUrl": "/proceedings-article/cdc/2000/00914716/12OmNwHQB73",
"parentPublication": {
"id": "proceedings/cdc/2000/6638/5",
"title": "Proceedings of the 39th IEEE Conference on Decision and Control",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/pads/1996/7539/0/75390170",
"title": "Discrete-Event Simulation and the Event Horizon Part 2: Event List Management",
"doi": null,
"abstractUrl": "/proceedings-article/pads/1996/75390170/12OmNxR5UKT",
"parentPublication": {
"id": "proceedings/pads/1996/7539/0",
"title": "Proceedings of Symposium on Parallel and Distributed Tools",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isms/2012/4668/0/4668a588",
"title": "Centralized Receding Horizon Coverage Control for Mobile Sensory Networks",
"doi": null,
"abstractUrl": "/proceedings-article/isms/2012/4668a588/12OmNyRxFo7",
"parentPublication": {
"id": "proceedings/isms/2012/4668/0",
"title": "Intelligent Systems, Modelling and Simulation, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/dexa/2013/2138/0/5070a053",
"title": "Instability in Search Engine Results: Lessons Learned in the Context of Horizon Scanning Applications",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2013/5070a053/12OmNz5JBTP",
"parentPublication": {
"id": "proceedings/dexa/2013/2138/0",
"title": "2013 24th International Workshop on Database and Expert Systems Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iscst/2005/2387/0/01553330",
"title": "Constrained search for a moving target",
"doi": null,
"abstractUrl": "/proceedings-article/iscst/2005/01553330/12OmNzG4guz",
"parentPublication": {
"id": "proceedings/iscst/2005/2387/0",
"title": "2005 International Symposium on Collaborative Technologies and Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00220045",
"title": "Map-based localization using the panoramic horizon",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220045/12OmNzYwc8Y",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/1998/01/v0082",
"title": "Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications",
"doi": null,
"abstractUrl": "/journal/tg/1998/01/v0082/13rRUx0geuY",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNwt5shy",
"title": "Shape Modeling International (SMI 2010)",
"acronym": "smi",
"groupId": "1000664",
"volume": "0",
"displayVolume": "0",
"year": "2010",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNqGA5gl",
"doi": "10.1109/SMI.2010.12",
"title": "A New Algorithm for the Computation of the Minkowski Difference of Convex Polyhedra",
"normalizedTitle": "A New Algorithm for the Computation of the Minkowski Difference of Convex Polyhedra",
"abstract": "We present a new algorithm, based on the concept of contributing vertices, for the exact and efficient computation of the Minkowski difference of convex polyhedra. First, we extend the concept of contributing vertices for the Minkowski difference case. Then, we generate a Minkowski difference facets superset by exploiting the information provided by the computed contributing vertices. Finally, we compute the Minkowski difference polyhedron through the trimming of the generated superset. We compared our Contributing Vertices-based Minkowski Difference (CVMD) algorithm to a Nef polyhedra-based approach using Minkowski addition, complement, transposition, and union operations. The performance benchmark shows that our CVMD algorithm outperforms the indirect Nef polyhedra-based approach. All our implementations use exact number types, produce exact results, and are based on CGAL, the Computational Geometry Algorithms Library.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a new algorithm, based on the concept of contributing vertices, for the exact and efficient computation of the Minkowski difference of convex polyhedra. First, we extend the concept of contributing vertices for the Minkowski difference case. Then, we generate a Minkowski difference facets superset by exploiting the information provided by the computed contributing vertices. Finally, we compute the Minkowski difference polyhedron through the trimming of the generated superset. We compared our Contributing Vertices-based Minkowski Difference (CVMD) algorithm to a Nef polyhedra-based approach using Minkowski addition, complement, transposition, and union operations. The performance benchmark shows that our CVMD algorithm outperforms the indirect Nef polyhedra-based approach. All our implementations use exact number types, produce exact results, and are based on CGAL, the Computational Geometry Algorithms Library.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a new algorithm, based on the concept of contributing vertices, for the exact and efficient computation of the Minkowski difference of convex polyhedra. First, we extend the concept of contributing vertices for the Minkowski difference case. Then, we generate a Minkowski difference facets superset by exploiting the information provided by the computed contributing vertices. Finally, we compute the Minkowski difference polyhedron through the trimming of the generated superset. We compared our Contributing Vertices-based Minkowski Difference (CVMD) algorithm to a Nef polyhedra-based approach using Minkowski addition, complement, transposition, and union operations. The performance benchmark shows that our CVMD algorithm outperforms the indirect Nef polyhedra-based approach. All our implementations use exact number types, produce exact results, and are based on CGAL, the Computational Geometry Algorithms Library.",
"fno": "05521463",
"keywords": [
"Computational Geometry",
"Convex Polyhedra",
"Contributing Vertices Based Minkowski Difference Algorithm",
"Nef Polyhedra Based Approach",
"CVMD Algorithm",
"Computational Geometry Algorithm Library",
"Computer Aided Manufacturing",
"Difference Equations",
"Shape",
"Laboratories",
"Reflection",
"Computational Geometry",
"Libraries",
"Application Software",
"Robot Motion",
"Motion Planning",
"Contributing Vertices",
"Minkowski Difference",
"Minkowski Sum",
"Nef Polyhedra"
],
"authors": [
{
"affiliation": null,
"fullName": "Hichem Barki",
"givenName": "Hichem",
"surname": "Barki",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Florence Denis",
"givenName": "Florence",
"surname": "Denis",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Florent Dupont",
"givenName": "Florent",
"surname": "Dupont",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "smi",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-06-01T00:00:00",
"pubType": "proceedings",
"pages": "206-210",
"year": "2010",
"issn": null,
"isbn": "978-1-4244-7259-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "05521462",
"articleId": "12OmNywxlVm",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "05521464",
"articleId": "12OmNroijly",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/gmp/2000/0562/0/05620123",
"title": "Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions",
"doi": null,
"abstractUrl": "/proceedings-article/gmp/2000/05620123/12OmNAKcNJm",
"parentPublication": {
"id": "proceedings/gmp/2000/0562/0",
"title": "Geometric Modeling and Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1992/2910/0/00201550",
"title": "Recognition of polyhedra by a mechanical theorem proving method",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201550/12OmNAlvI9i",
"parentPublication": {
"id": "proceedings/icpr/1992/2910/0",
"title": "1992 11th IAPR International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/gmap/2000/0562/0/00838244",
"title": "Distance computation between non-convex polyhedra at short range based on discrete Voronoi regions",
"doi": null,
"abstractUrl": "/proceedings-article/gmap/2000/00838244/12OmNBtUdG8",
"parentPublication": {
"id": "proceedings/gmap/2000/0562/0",
"title": "Proceedings Geometric Modeling and Processing 2000. Theory and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hpdc/1994/6395/0/00340256",
"title": "Distributed computation of electromagnetic scattering problems using finite-difference time-domain decompositions",
"doi": null,
"abstractUrl": "/proceedings-article/hpdc/1994/00340256/12OmNvTTcdY",
"parentPublication": {
"id": "proceedings/hpdc/1994/6395/0",
"title": "Proceedings of 3rd IEEE International Symposium on High Performance Distributed Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1995/6935/0/69350073",
"title": "Beyond convexity: scanning 'non-convex polyhedra'",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1995/69350073/12OmNwwd2SS",
"parentPublication": {
"id": "proceedings/hicss/1995/6935/0",
"title": "28th Hawaii International Conference on System Sciences (HICSS'95)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ace/2010/4058/0/4058a134",
"title": "Energy-Aware Network-on-Chip Architecture Using Perfect Difference Network",
"doi": null,
"abstractUrl": "/proceedings-article/ace/2010/4058a134/12OmNx6xHrR",
"parentPublication": {
"id": "proceedings/ace/2010/4058/0",
"title": "Advances in Computer Engineering, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isecs/2009/3643/2/3643b085",
"title": "Motion Detection Based on Temporal Difference Method and Optical Flow field",
"doi": null,
"abstractUrl": "/proceedings-article/isecs/2009/3643b085/12OmNxA3YWY",
"parentPublication": {
"id": null,
"title": null,
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/focs/1993/4370/0/0366835",
"title": "The union of convex polyhedra in three dimensions",
"doi": null,
"abstractUrl": "/proceedings-article/focs/1993/0366835/12OmNzahc4S",
"parentPublication": {
"id": "proceedings/focs/1993/4370/0",
"title": "Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icassp/2004/8484/2/01326275",
"title": "Recursive least squares solution to source tracking using time difference of arrival",
"doi": null,
"abstractUrl": "/proceedings-article/icassp/2004/01326275/12OmNzlUKcb",
"parentPublication": {
"id": "proceedings/icassp/2004/8484/2",
"title": "2004 IEEE International Conference on Acoustics, Speech, and Signal Processing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09018075",
"title": "A Review of Methods to Compute Minkowski Operations for Geometric Overlap Detection",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09018075/1hN4BWmOXCg",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNzahbRb",
"title": "Proceedings. 1991 IEEE International Conference on Robotics and Automation",
"acronym": "robot",
"groupId": "1000639",
"volume": "0",
"displayVolume": "0",
"year": "1991",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNrJAdTi",
"doi": "10.1109/ROBOT.1991.131703",
"title": "Collision avoidance of mobile robots in non-stationary environments",
"normalizedTitle": "Collision avoidance of mobile robots in non-stationary environments",
"abstract": "A control strategy for real-time collision avoidance of a mobile robot in an environment containing moving obstacles is proposed. Objects, including the robot, are modelled as convex polyhedra. Collision avoidance is guaranteed if the minimum distance between the robot and the objects is nonzero. A nominal trajectory is assumed to be known from offline planning. The main idea is to change the velocity along the nominal trajectory so that collisions are avoided. Consistency with the nominal plan is desirable. The process is formulated as an optimization problem and a close to optimal solution is obtained.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "A control strategy for real-time collision avoidance of a mobile robot in an environment containing moving obstacles is proposed. Objects, including the robot, are modelled as convex polyhedra. Collision avoidance is guaranteed if the minimum distance between the robot and the objects is nonzero. A nominal trajectory is assumed to be known from offline planning. The main idea is to change the velocity along the nominal trajectory so that collisions are avoided. Consistency with the nominal plan is desirable. The process is formulated as an optimization problem and a close to optimal solution is obtained.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "A control strategy for real-time collision avoidance of a mobile robot in an environment containing moving obstacles is proposed. Objects, including the robot, are modelled as convex polyhedra. Collision avoidance is guaranteed if the minimum distance between the robot and the objects is nonzero. A nominal trajectory is assumed to be known from offline planning. The main idea is to change the velocity along the nominal trajectory so that collisions are avoided. Consistency with the nominal plan is desirable. The process is formulated as an optimization problem and a close to optimal solution is obtained.",
"fno": "00131703",
"keywords": [
"Computational Geometry",
"Mobile Robots",
"Optimisation",
"Planning Artificial Intelligence",
"Position Control",
"Nonstationary Environments",
"Computational Geometry",
"Mobile Robots",
"Real Time Collision Avoidance",
"Convex Polyhedra",
"Offline Planning",
"Nominal Trajectory",
"Optimization",
"Collision Avoidance",
"Mobile Robots",
"Orbital Robotics",
"Intelligent Robots",
"Trajectory",
"Shape",
"NASA",
"Intelligent Systems",
"Space Exploration",
"Control Systems"
],
"authors": [
{
"affiliation": "NASA, Rennsselaer Polytech. Inst., Troy, NY, USA",
"fullName": "K.J. Kyriakopoulos",
"givenName": "K.J.",
"surname": "Kyriakopoulos",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "NASA, Rennsselaer Polytech. Inst., Troy, NY, USA",
"fullName": "G.N. Saridis",
"givenName": "G.N.",
"surname": "Saridis",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "robot",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1991-01-01T00:00:00",
"pubType": "proceedings",
"pages": "904,905,906,907,908,909",
"year": "1991",
"issn": null,
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00131702",
"articleId": "12OmNzTH0Pg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00131704",
"articleId": "12OmNBzAcjm",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iciicii/2016/3575/0/3575a232",
"title": "Research of Automatic Collision Avoidance Based on Ship Maneuvering",
"doi": null,
"abstractUrl": "/proceedings-article/iciicii/2016/3575a232/12OmNsbGvDR",
"parentPublication": {
"id": "proceedings/iciicii/2016/3575/0",
"title": "2016 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00220253",
"title": "A fast, on-line collision avoidance method for a kinematically redundant manipulator based on reflex control",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220253/12OmNwDSdiI",
"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/71082510",
"title": "Fuzzy collision avoidance for industrial robots",
"doi": null,
"abstractUrl": "/proceedings-article/iros/1995/71082510/12OmNwswg58",
"parentPublication": {
"id": "proceedings/iros/1995/7108/2",
"title": "Intelligent Robots and Systems, IEEE/RSJ International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1991/2163/0/00131661",
"title": "Collision avoidance for two SCARA robots",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1991/00131661/12OmNyq0zMW",
"parentPublication": {
"id": "proceedings/robot/1991/2163/0",
"title": "Proceedings. 1991 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iros/1995/7108/2/71082027",
"title": "Action observation in collision-free motion planning for mobile robots",
"doi": null,
"abstractUrl": "/proceedings-article/iros/1995/71082027/12OmNyyO8Nv",
"parentPublication": {
"id": "proceedings/iros/1995/7108/2",
"title": "Intelligent Robots and Systems, IEEE/RSJ International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00220263",
"title": "An integrated collision prediction and avoidance scheme for mobile robots in non-stationary environments",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220263/12OmNzWOBgc",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/robot/1992/2720/0/00220127",
"title": "A collision-avoidance robot mounting LDM stereo vision",
"doi": null,
"abstractUrl": "/proceedings-article/robot/1992/00220127/12OmNzmclxB",
"parentPublication": {
"id": "proceedings/robot/1992/2720/0",
"title": "Proceedings 1992 IEEE International Conference on Robotics and Automation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/compsac/2018/2666/1/266601a204",
"title": "Runtime Verification of Robots Collision Avoidance Case Study",
"doi": null,
"abstractUrl": "/proceedings-article/compsac/2018/266601a204/144U9bDR7WW",
"parentPublication": {
"id": "proceedings/compsac/2018/2666/2",
"title": "2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icaice/2021/2186/0/218600a035",
"title": "An Gradient-based Continuous-Time Trajectory Optimization method for Real-Time Collision Avoidance on collaborative robot",
"doi": null,
"abstractUrl": "/proceedings-article/icaice/2021/218600a035/1Et4vu3H7gI",
"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/ictai/2020/9228/0/922800a532",
"title": "Multi-Robot Collision Avoidance with Map-based Deep Reinforcement Learning",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2020/922800a532/1pP3uTsDzQQ",
"parentPublication": {
"id": "proceedings/ictai/2020/9228/0",
"title": "2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNy9Prj1",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"acronym": "iccvw",
"groupId": "1800041",
"volume": "0",
"displayVolume": "0",
"year": "2017",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNwDSdpd",
"doi": "10.1109/ICCVW.2017.92",
"title": "Lightweight Monocular Obstacle Avoidance by Salient Feature Fusion",
"normalizedTitle": "Lightweight Monocular Obstacle Avoidance by Salient Feature Fusion",
"abstract": "We present a monocular obstacle avoidance method based on a novel image feature map built by fusing robust saliency features, to be used in embedded systems on lightweight autonomous vehicles. The fused salient features are a textural-directional Harris based feature map and a relative focus feature map. We present the generation of the fused salient map, along with its application for obstacle avoidance. Evaluations are performed from a saliency point of view, and for the assessment of the method's applicability for obstacle avoidance in simulated environments. The presented results support the usability of the method in embedded systems on lightweight unmanned vehicles.",
"abstracts": [
{
"abstractType": "Regular",
"content": "We present a monocular obstacle avoidance method based on a novel image feature map built by fusing robust saliency features, to be used in embedded systems on lightweight autonomous vehicles. The fused salient features are a textural-directional Harris based feature map and a relative focus feature map. We present the generation of the fused salient map, along with its application for obstacle avoidance. Evaluations are performed from a saliency point of view, and for the assessment of the method's applicability for obstacle avoidance in simulated environments. The presented results support the usability of the method in embedded systems on lightweight unmanned vehicles.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "We present a monocular obstacle avoidance method based on a novel image feature map built by fusing robust saliency features, to be used in embedded systems on lightweight autonomous vehicles. The fused salient features are a textural-directional Harris based feature map and a relative focus feature map. We present the generation of the fused salient map, along with its application for obstacle avoidance. Evaluations are performed from a saliency point of view, and for the assessment of the method's applicability for obstacle avoidance in simulated environments. The presented results support the usability of the method in embedded systems on lightweight unmanned vehicles.",
"fno": "1034a734",
"keywords": [
"Feature Extraction",
"Collision Avoidance",
"Image Edge Detection",
"Visualization",
"Training",
"Navigation",
"Sensors"
],
"authors": [
{
"affiliation": null,
"fullName": "Andrea Manno-Kovacs",
"givenName": "Andrea",
"surname": "Manno-Kovacs",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Levente Kovács",
"givenName": "Levente",
"surname": "Kovács",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "iccvw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2017-10-01T00:00:00",
"pubType": "proceedings",
"pages": "734-741",
"year": "2017",
"issn": "2473-9944",
"isbn": "978-1-5386-1034-3",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "1034a725",
"articleId": "12OmNzt0Itg",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "1034a742",
"articleId": "12OmNvy256Q",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/irc/2017/6724/0/07926547",
"title": "A Hybrid Obstacle Avoidance Method: Follow the Gap with Dynamic Window Approach",
"doi": null,
"abstractUrl": "/proceedings-article/irc/2017/07926547/12OmNAXxXdZ",
"parentPublication": {
"id": "proceedings/irc/2017/6724/0",
"title": "2017 First IEEE International Conference on Robotic Computing (IRC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2017/3876/0/387601a574",
"title": "Optical Flow Based Obstacle Avoidance for Multi-rotor Aerial Vehicles",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2017/387601a574/12OmNAtK4n2",
"parentPublication": {
"id": "proceedings/ictai/2017/3876/0",
"title": "2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2016/1437/0/1437a877",
"title": "Visual Monocular Obstacle Avoidance for Small Unmanned Vehicles",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2016/1437a877/12OmNvoFjVm",
"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/sbr-lars-r/2016/3656/0/07783494",
"title": "Vision-Based Obstacle Avoidance Using Deep Learning",
"doi": null,
"abstractUrl": "/proceedings-article/sbr-lars-r/2016/07783494/12OmNwcl7EC",
"parentPublication": {
"id": "proceedings/sbr-lars-r/2016/3656/0",
"title": "2016 XIII Latin-American Robotics Symposium and IV Brazilian Robotics Symposium (LARS/SBR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acit/2018/0385/0/08672681",
"title": "Obstacle Avoidance for Ultrasonic Unmanned Aerial Vehicle Monitoring Using Android Application",
"doi": null,
"abstractUrl": "/proceedings-article/acit/2018/08672681/18IpmfjVhKg",
"parentPublication": {
"id": "proceedings/acit/2018/0385/0",
"title": "2018 International Arab Conference on Information Technology (ACIT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/percom-workshops/2019/9151/0/08730764",
"title": "Simulation in Real Conditions of Navigation and Obstacle Avoidance with PX4/Gazebo Platform",
"doi": null,
"abstractUrl": "/proceedings-article/percom-workshops/2019/08730764/1aDSK7HQgxi",
"parentPublication": {
"id": "proceedings/percom-workshops/2019/9151/0",
"title": "2019 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoias/2019/2662/0/266200a166",
"title": "Quadcopter Obstacle Avoidance and Path Planning Using Flood Fill Method",
"doi": null,
"abstractUrl": "/proceedings-article/icoias/2019/266200a166/1c8PaQGr1vO",
"parentPublication": {
"id": "proceedings/icoias/2019/2662/0",
"title": "2019 2nd International Conference on Intelligent Autonomous Systems (ICoIAS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icctec/2017/5784/0/578400b200",
"title": "Research on Autonomous Obstacle Avoidance Flight Path Planning of Rotating Wing UAV",
"doi": null,
"abstractUrl": "/proceedings-article/icctec/2017/578400b200/1cks8UnHQS4",
"parentPublication": {
"id": "proceedings/icctec/2017/5784/0",
"title": "2017 International Conference on Computer Technology, Electronics and Communication (ICCTEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ecie/2021/1869/0/186900a357",
"title": "Research on Obstacle Avoidance Control Method of Multi-UAV Based on Model Predictive Control",
"doi": null,
"abstractUrl": "/proceedings-article/ecie/2021/186900a357/1sXnWYpurmw",
"parentPublication": {
"id": "proceedings/ecie/2021/1869/0",
"title": "2021 International Conference on Electronics, Circuits and Information Engineering (ECIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cds/2021/0428/0/042800a012",
"title": "Development of Obstacle Avoidance for Autonomous Vehicles and an Optimization Scheme for the Artificial Potential Field Method",
"doi": null,
"abstractUrl": "/proceedings-article/cds/2021/042800a012/1uZxAisQpC8",
"parentPublication": {
"id": "proceedings/cds/2021/0428/0",
"title": "2021 2nd International Conference on Computing and Data Science (CDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNC3FG42",
"title": "1989 IEEE Computer Society Conference on Computer Vision and Pattern Recognition",
"acronym": "cvpr",
"groupId": "1000147",
"volume": "0",
"displayVolume": "0",
"year": "1989",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNz2kqgo",
"doi": "10.1109/CVPR.1989.37845",
"title": "The optimal implementation of morphological operations on neighborhood connected array processors",
"normalizedTitle": "The optimal implementation of morphological operations on neighborhood connected array processors",
"abstract": "Neighborhood-connected array processors can implement Minkowski addition and Minkowski subtraction operations with structuring elements larger than the neighborhood size by breaking the operation into a sequence of successive neighborhood operations. The author provides a complete solution to the problem of decomposing convex polygons into subsets of the 3*3 neighborhood set. With the help of the Freeman chain code notation, it is proved that all convex polygons have neighborhood decompositions. Based on this result, an efficient algorithm is developed which can find an optimal decomposition for any convex polygon. The decomposition produced by the algorithm can be used to determine the most efficient implementation of a morphological operation with convex polygonal structuring elements as a sequence of successive neighborhood operations. Therefore, the algorithm is applicable to neighborhood-connected array processors, or any machine structure that can quickly perform 3*3 neighborhood operations.<>",
"abstracts": [
{
"abstractType": "Regular",
"content": "Neighborhood-connected array processors can implement Minkowski addition and Minkowski subtraction operations with structuring elements larger than the neighborhood size by breaking the operation into a sequence of successive neighborhood operations. The author provides a complete solution to the problem of decomposing convex polygons into subsets of the 3*3 neighborhood set. With the help of the Freeman chain code notation, it is proved that all convex polygons have neighborhood decompositions. Based on this result, an efficient algorithm is developed which can find an optimal decomposition for any convex polygon. The decomposition produced by the algorithm can be used to determine the most efficient implementation of a morphological operation with convex polygonal structuring elements as a sequence of successive neighborhood operations. Therefore, the algorithm is applicable to neighborhood-connected array processors, or any machine structure that can quickly perform 3*3 neighborhood operations.<>",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Neighborhood-connected array processors can implement Minkowski addition and Minkowski subtraction operations with structuring elements larger than the neighborhood size by breaking the operation into a sequence of successive neighborhood operations. The author provides a complete solution to the problem of decomposing convex polygons into subsets of the 3*3 neighborhood set. With the help of the Freeman chain code notation, it is proved that all convex polygons have neighborhood decompositions. Based on this result, an efficient algorithm is developed which can find an optimal decomposition for any convex polygon. The decomposition produced by the algorithm can be used to determine the most efficient implementation of a morphological operation with convex polygonal structuring elements as a sequence of successive neighborhood operations. Therefore, the algorithm is applicable to neighborhood-connected array processors, or any machine structure that can quickly perform 3*3 neighborhood operations.",
"fno": "00037845",
"keywords": [
"Codes",
"Computerised Picture Processing",
"Set Theory",
"Computerised Picture Processing",
"Morphology",
"Set Theory",
"Neighborhood Connected Array Processors",
"Minkowski Addition",
"Minkowski Subtraction",
"Convex Polygons",
"Freeman Chain Code",
"Decompositions",
"Morphological Operations",
"Shape",
"Image Sequence Analysis",
"Mathematics",
"Computer Science",
"Educational Institutions",
"Morphology",
"Image Analysis",
"Logic",
"Arithmetic"
],
"authors": [
{
"affiliation": "Dept. of Math. & Comput. Sci., Classboro State Coll., NJ, USA",
"fullName": "Xu Jianning",
"givenName": null,
"surname": "Xu Jianning",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "cvpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "1989-01-01T00:00:00",
"pubType": "proceedings",
"pages": "166,167,168,169,170,171",
"year": "1989",
"issn": "1063-6919",
"isbn": null,
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "00037844",
"articleId": "12OmNAHEpzJ",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "00037846",
"articleId": "12OmNyjLoRI",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/icpr/1992/2920/0/00201976",
"title": "Basis decomposition of morphological operations",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1992/00201976/12OmNAkWvtg",
"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/cvpr/1992/2855/0/00223134",
"title": "Morphological structuring function decomposition",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1992/00223134/12OmNBSSVkb",
"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/cit/2008/2357/0/04594700",
"title": "Learning graph neighborhood topological order for image and manifold morphological processing",
"doi": null,
"abstractUrl": "/proceedings-article/cit/2008/04594700/12OmNrnJ6Uj",
"parentPublication": {
"id": "proceedings/cit/2008/2357/0",
"title": "2008 8th IEEE International Conference on Computer and Information Technology",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/delta/2002/1453/0/14530309",
"title": "FPGA-Based Implementation of Variable Sized Structuring Elements for 2D Binary Morphological Operations",
"doi": null,
"abstractUrl": "/proceedings-article/delta/2002/14530309/12OmNvo67Ay",
"parentPublication": {
"id": "proceedings/delta/2002/1453/0",
"title": "Proceedings First IEEE International Workshop on Electronic Design, Test and Applications '2002",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/2008/2174/0/04761623",
"title": "Spatially-variant morphological operations on binary images based on the polar distance transform",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/2008/04761623/12OmNx6PiAe",
"parentPublication": {
"id": "proceedings/icpr/2008/2174/0",
"title": "ICPR 2008 19th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icpr/1988/0878/0/00028465",
"title": "An algorithm for a generalized distance transformation based on Minkowski operations",
"doi": null,
"abstractUrl": "/proceedings-article/icpr/1988/00028465/12OmNy2rS0t",
"parentPublication": {
"id": "proceedings/icpr/1988/0878/0",
"title": "9th International Conference on Pattern Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/hicss/1994/5090/1/00323147",
"title": "Speeding-up mathematical morphology computations with special-purpose array processors",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/1994/00323147/12OmNzayNDv",
"parentPublication": {
"id": "proceedings/hicss/1994/5090/1",
"title": "Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1991/02/i0153",
"title": "Decomposition of Convex Polygonal Morphological Structuring Elements into Neighborhood Subsets",
"doi": null,
"abstractUrl": "/journal/tp/1991/02/i0153/13rRUxBa5sD",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1994/06/i0581",
"title": "Algorithms for the Decomposition of Gray-Scale Morphological Operations",
"doi": null,
"abstractUrl": "/journal/tp/1994/06/i0581/13rRUxCitKe",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tp/1994/03/i0304",
"title": "Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors",
"doi": null,
"abstractUrl": "/journal/tp/1994/03/i0304/13rRUxlgy4F",
"parentPublication": {
"id": "trans/tp",
"title": "IEEE Transactions on Pattern Analysis & Machine Intelligence",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": null,
"article": {
"id": "12OmNzC5ToH",
"doi": "10.1109/ISDEA.2010.152",
"title": "New Initialization Method of Basic Probability Assignment and Application in Cross-Country Environment Perception",
"normalizedTitle": "New Initialization Method of Basic Probability Assignment and Application in Cross-Country Environment Perception",
"abstract": "Autonomous navigation in cross-country environments presents many new challenges including obstacle perception for Unmanned Ground Vehicle. This paper proposes new method that is suitable for distributing Basic Probability Assignment (BPA), based on which D-S theory of evidence is employed to integrate sensors information and recognize the obstacle. Firstly, select the experiment formula, then by using the fuzzy interpolation we obtain the subordinate to each event in identification framework, secondly, assume the subordinate be equal to correlation coefficient in the formula, which means each feature evidence corresponding to every element. The last step is to extract feature evidence and calculate the Basic Probability Assignment based on the above, and the current obstacle is identified by applying Dempster's combination rules. The test results show the validity of this new method and its application in cross-country environment perception.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Autonomous navigation in cross-country environments presents many new challenges including obstacle perception for Unmanned Ground Vehicle. This paper proposes new method that is suitable for distributing Basic Probability Assignment (BPA), based on which D-S theory of evidence is employed to integrate sensors information and recognize the obstacle. Firstly, select the experiment formula, then by using the fuzzy interpolation we obtain the subordinate to each event in identification framework, secondly, assume the subordinate be equal to correlation coefficient in the formula, which means each feature evidence corresponding to every element. The last step is to extract feature evidence and calculate the Basic Probability Assignment based on the above, and the current obstacle is identified by applying Dempster's combination rules. The test results show the validity of this new method and its application in cross-country environment perception.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Autonomous navigation in cross-country environments presents many new challenges including obstacle perception for Unmanned Ground Vehicle. This paper proposes new method that is suitable for distributing Basic Probability Assignment (BPA), based on which D-S theory of evidence is employed to integrate sensors information and recognize the obstacle. Firstly, select the experiment formula, then by using the fuzzy interpolation we obtain the subordinate to each event in identification framework, secondly, assume the subordinate be equal to correlation coefficient in the formula, which means each feature evidence corresponding to every element. The last step is to extract feature evidence and calculate the Basic Probability Assignment based on the above, and the current obstacle is identified by applying Dempster's combination rules. The test results show the validity of this new method and its application in cross-country environment perception.",
"fno": "4212a997",
"keywords": [
"Uncertainty Handling",
"Collision Avoidance",
"Feature Extraction",
"Fuzzy Set Theory",
"Interpolation",
"Mobile Robots",
"Object Recognition",
"Probability",
"Sensor Fusion",
"Dempster Combination Rules",
"Basic Probability Assignment",
"Cross Country Environment Perception",
"Autonomous Navigation",
"Obstacle Perception",
"Unmanned Ground Vehicle",
"D S Evidence Theory",
"Sensor Information Integration",
"Obstacle Recognition",
"Fuzzy Interpolation",
"Feature Extraction",
"Image Color Analysis",
"Sensors",
"Correlation",
"Feature Extraction",
"Image Edge Detection",
"Uncertainty",
"Educational Institutions",
"Basic Probability Assignment",
"Unmanned Ground Vehicle",
"Environment Perception",
"D S Theory Of Evidence"
],
"authors": [],
"idPrefix": "isdea",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2010-10-01T00:00:00",
"pubType": "proceedings",
"pages": "997-1001",
"year": "2010",
"issn": null,
"isbn": "978-0-7695-4212-6",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4212a993",
"articleId": "12OmNC0y5Ge",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4212b002",
"articleId": "12OmNx76TBF",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/ecbi/2009/3661/0/3661a475",
"title": "An Improved Algorithm for Dempster-Shafer Theory of Evidence",
"doi": null,
"abstractUrl": "/proceedings-article/ecbi/2009/3661a475/12OmNB836Sy",
"parentPublication": {
"id": "proceedings/ecbi/2009/3661/0",
"title": "Electronic Commerce and Business Intelligence, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/1988/0862/0/00196324",
"title": "An operational perception system for cross-country navigation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/1988/00196324/12OmNvAAtps",
"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/fskd/2009/3735/5/3735e463",
"title": "Stereo Vision Based Obstacle Avoidance Path-Planning for Cross-Country Intelligent Vehicle",
"doi": null,
"abstractUrl": "/proceedings-article/fskd/2009/3735e463/12OmNxiKs5R",
"parentPublication": {
"id": "proceedings/fskd/2009/3735/5",
"title": "Fuzzy Systems and Knowledge Discovery, Fourth International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/ex/1991/04/x4016",
"title": "Autonomous Cross-Country Navigation: An Integrated Perception and Planning System",
"doi": null,
"abstractUrl": "/magazine/ex/1991/04/x4016/13rRUy3gn9d",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyen1y0",
"title": "2016 IEEE Frontiers in Education Conference (FIE)",
"acronym": "fie",
"groupId": "1000297",
"volume": "0",
"displayVolume": "0",
"year": "2016",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNBB0bXJ",
"doi": "10.1109/FIE.2016.7757409",
"title": "Can Computational Thinking help me? A quantitative study of its effects on education",
"normalizedTitle": "Can Computational Thinking help me? A quantitative study of its effects on education",
"abstract": "Some researchers consider that the benefits of Computational Thinking (CT) in education are unclear, and therefore a quantitative study to understand the effects of CT skills in the basic levels of formal education is needed. The present study aims to analyze the effects of CT on the academic performance of students in high school. We seek to answer the following research questions: (RQ1) Can CT increase the problem-solving skills of students in high school? (RQ2) Is CT related to the performance of students in high school? (RQ3) Can CT improve the performance of students in high school? We conducted an analysis between two groups of students with similar profiles belonging to the same population, where the factor CT proficiency is the only feature that distinguishes both groups. The results show that there is a moderate correlation between the performance of evaluated students and their skills of CT developed by computer programming. In addition, we found that students proficient in computer programming have superior performance up to 10.2% in ENEM (National Exam of High School) assessment compared to those with little or no experience level and even better performance 21% in the WASI test problem-solving in students on attending high school.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Some researchers consider that the benefits of Computational Thinking (CT) in education are unclear, and therefore a quantitative study to understand the effects of CT skills in the basic levels of formal education is needed. The present study aims to analyze the effects of CT on the academic performance of students in high school. We seek to answer the following research questions: (RQ1) Can CT increase the problem-solving skills of students in high school? (RQ2) Is CT related to the performance of students in high school? (RQ3) Can CT improve the performance of students in high school? We conducted an analysis between two groups of students with similar profiles belonging to the same population, where the factor CT proficiency is the only feature that distinguishes both groups. The results show that there is a moderate correlation between the performance of evaluated students and their skills of CT developed by computer programming. In addition, we found that students proficient in computer programming have superior performance up to 10.2% in ENEM (National Exam of High School) assessment compared to those with little or no experience level and even better performance 21% in the WASI test problem-solving in students on attending high school.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Some researchers consider that the benefits of Computational Thinking (CT) in education are unclear, and therefore a quantitative study to understand the effects of CT skills in the basic levels of formal education is needed. The present study aims to analyze the effects of CT on the academic performance of students in high school. We seek to answer the following research questions: (RQ1) Can CT increase the problem-solving skills of students in high school? (RQ2) Is CT related to the performance of students in high school? (RQ3) Can CT improve the performance of students in high school? We conducted an analysis between two groups of students with similar profiles belonging to the same population, where the factor CT proficiency is the only feature that distinguishes both groups. The results show that there is a moderate correlation between the performance of evaluated students and their skills of CT developed by computer programming. In addition, we found that students proficient in computer programming have superior performance up to 10.2% in ENEM (National Exam of High School) assessment compared to those with little or no experience level and even better performance 21% in the WASI test problem-solving in students on attending high school.",
"fno": "07757409",
"keywords": [
"Education",
"Problem Solving",
"Programming Profession",
"Computers",
"Mathematics",
"Sociology"
],
"authors": [
{
"affiliation": "Federal University of Campina Grande, Software Practices Laboratory - SPLab, Paraíba, Brazil 58429-900",
"fullName": "Rivanilson S. Rodrigues",
"givenName": "Rivanilson S.",
"surname": "Rodrigues",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Federal University of Campina Grande, Software Practices Laboratory - SPLab, Paraíba, Brazil 58429-900",
"fullName": "Wilkerson L. Andrade",
"givenName": "Wilkerson L.",
"surname": "Andrade",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Federal University of Campina Grande, Distributed Systems Laboratory - LSD, Paraíba, Brazil 58429-900",
"fullName": "Livia M. R. Sampaio Campos",
"givenName": "Livia M. R. Sampaio",
"surname": "Campos",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "fie",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2016",
"issn": null,
"isbn": "978-1-5090-1790-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "07757408",
"articleId": "12OmNCgrD4i",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "07757410",
"articleId": "12OmNCdk2Ew",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fie/2017/5920/0/08190652",
"title": "Exploring computational thinking assessment in introductory programming courses",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2017/08190652/12OmNB7cjhr",
"parentPublication": {
"id": "proceedings/fie/2017/5920/0",
"title": "2017 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2015/8454/0/07344063",
"title": "DISSECT: Exploring the relationship between computational thinking and English literature in K-12 curricula",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2015/07344063/12OmNqHItuP",
"parentPublication": {
"id": "proceedings/fie/2015/8454/0",
"title": "2015 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2013/5261/0/06684812",
"title": "A longitudinal study of the effects of a high school robotics and computational thinking class on academic achievement (WIP)",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2013/06684812/12OmNrYlmTE",
"parentPublication": {
"id": "proceedings/fie/2013/5261/0",
"title": "2013 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2015/8454/0/07344238",
"title": "GK-12 DISSECT: Incorporating computational thinking with K-12 science without computer access",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2015/07344238/12OmNxTVU1Q",
"parentPublication": {
"id": "proceedings/fie/2015/8454/0",
"title": "2015 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2017/5920/0/08190655",
"title": "Computational thinking in mathematics education: A joint approach to encourage problem-solving ability",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2017/08190655/12OmNy7yEdl",
"parentPublication": {
"id": "proceedings/fie/2017/5920/0",
"title": "2017 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2022/6244/0/09962686",
"title": "A Framework for teaching programming in High School through Educational Robotics",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2022/09962686/1IHnSzmQEJq",
"parentPublication": {
"id": "proceedings/fie/2022/6244/0",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2019/1746/0/09028384",
"title": "Analyzing the Effect of Computational Thinking on Mathematics through Educational Robotics",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2019/09028384/1iffbxwNZXG",
"parentPublication": {
"id": "proceedings/fie/2019/1746/0",
"title": "2019 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2019/1746/0/09028431",
"title": "Examining the Effects of STEM PBL on Students’ Divergent Thinking Attitudes Related to Creative Problem Solving",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2019/09028431/1iffl3kHTR6",
"parentPublication": {
"id": "proceedings/fie/2019/1746/0",
"title": "2019 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2020/6090/0/09155816",
"title": "Engaging Estonian primary school children in computational thinking through adaptive educational games: A qualitative study",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2020/09155816/1m1j7qXWVGg",
"parentPublication": {
"id": "proceedings/icalt/2020/6090/0",
"title": "2020 IEEE 20th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/eitt/2020/9171/0/917100a250",
"title": "The Research of Programming Teaching in Primary School on the Cultivation of Computational Thinking",
"doi": null,
"abstractUrl": "/proceedings-article/eitt/2020/917100a250/1qyxqC4nN1S",
"parentPublication": {
"id": "proceedings/eitt/2020/9171/0",
"title": "2020 Ninth International Conference of Educational Innovation through Technology (EITT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNyugz5g",
"title": "2018 IEEE 11th International Conference on Software Testing, Verification and Validation (ICST)",
"acronym": "icst",
"groupId": "1001832",
"volume": "0",
"displayVolume": "0",
"year": "2018",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNvT2oNd",
"doi": "10.1109/ICST.2018.00018",
"title": "Testing Cloud Applications under Cloud-Uncertainty Performance Effects",
"normalizedTitle": "Testing Cloud Applications under Cloud-Uncertainty Performance Effects",
"abstract": "The paradigm shift of deploying applications to the cloud has introduced both opportunities and challenges. Although clouds use elasticity to scale resource usage at runtime to help meet an application's performance requirements, developers are still challenged by unpredictable performance, little control of execution environment, and differences among cloud service providers, all while being charged for their cloud usages. Application performance stability is particularly affected by multi-tenancy in which the hardware is shared among varying applications and virtual machines. Developers porting their applications need to meet performance requirements, but testing on the cloud under the effects of performance uncertainty is difficult and expensive, due to high cloud usage costs. This paper presents a first approach to testing an application with typical inputs for how its performance will be affected by performance uncertainty, without incurring undue costs of brute force testing in the cloud. We specify cloud uncertainty testing criteria, design a test-based strategy to characterize the black box cloud's performance distributions using these testing criteria, and support execution of tests to characterize the resource usage and cloud baseline performance of the application to be deployed. Importantly, we developed a smart test oracle that estimates the application's performance with certain confidence levels using the above characterization test results and determines whether it will meet its performance requirements. We evaluated our testing approach on both the Chameleon cloud and Amazon web services; results indicate that this testing strategy shows promise as a cost-effective approach to test for performance effects of cloud uncertainty when porting an application to the cloud.",
"abstracts": [
{
"abstractType": "Regular",
"content": "The paradigm shift of deploying applications to the cloud has introduced both opportunities and challenges. Although clouds use elasticity to scale resource usage at runtime to help meet an application's performance requirements, developers are still challenged by unpredictable performance, little control of execution environment, and differences among cloud service providers, all while being charged for their cloud usages. Application performance stability is particularly affected by multi-tenancy in which the hardware is shared among varying applications and virtual machines. Developers porting their applications need to meet performance requirements, but testing on the cloud under the effects of performance uncertainty is difficult and expensive, due to high cloud usage costs. This paper presents a first approach to testing an application with typical inputs for how its performance will be affected by performance uncertainty, without incurring undue costs of brute force testing in the cloud. We specify cloud uncertainty testing criteria, design a test-based strategy to characterize the black box cloud's performance distributions using these testing criteria, and support execution of tests to characterize the resource usage and cloud baseline performance of the application to be deployed. Importantly, we developed a smart test oracle that estimates the application's performance with certain confidence levels using the above characterization test results and determines whether it will meet its performance requirements. We evaluated our testing approach on both the Chameleon cloud and Amazon web services; results indicate that this testing strategy shows promise as a cost-effective approach to test for performance effects of cloud uncertainty when porting an application to the cloud.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "The paradigm shift of deploying applications to the cloud has introduced both opportunities and challenges. Although clouds use elasticity to scale resource usage at runtime to help meet an application's performance requirements, developers are still challenged by unpredictable performance, little control of execution environment, and differences among cloud service providers, all while being charged for their cloud usages. Application performance stability is particularly affected by multi-tenancy in which the hardware is shared among varying applications and virtual machines. Developers porting their applications need to meet performance requirements, but testing on the cloud under the effects of performance uncertainty is difficult and expensive, due to high cloud usage costs. This paper presents a first approach to testing an application with typical inputs for how its performance will be affected by performance uncertainty, without incurring undue costs of brute force testing in the cloud. We specify cloud uncertainty testing criteria, design a test-based strategy to characterize the black box cloud's performance distributions using these testing criteria, and support execution of tests to characterize the resource usage and cloud baseline performance of the application to be deployed. Importantly, we developed a smart test oracle that estimates the application's performance with certain confidence levels using the above characterization test results and determines whether it will meet its performance requirements. We evaluated our testing approach on both the Chameleon cloud and Amazon web services; results indicate that this testing strategy shows promise as a cost-effective approach to test for performance effects of cloud uncertainty when porting an application to the cloud.",
"fno": "501201a081",
"keywords": [
"Cloud Computing",
"Program Testing",
"Resource Allocation",
"Virtual Machines",
"Web Services",
"Cloud Applications Testing",
"Amazon Web Services",
"Virtual Machines",
"Cost Effective Approach",
"Testing Strategy",
"Chameleon Cloud",
"Smart Test Oracle",
"Cloud Baseline Performance",
"Black Box Cloud",
"Cloud Uncertainty Testing Criteria",
"Performance Uncertainty",
"Application Performance Stability",
"Cloud Usages",
"Cloud Service Providers",
"Performance Requirements",
"Resource Usage",
"Cloud Uncertainty Performance Effects",
"Cloud Computing",
"Testing",
"Uncertainty",
"Reliability",
"Sociology",
"Statistics",
"Cloud Applications",
"Software Testing On Cloud",
"Cloud Performance Uncertainty",
"Bootstrapping"
],
"authors": [
{
"affiliation": null,
"fullName": "Wei Wang",
"givenName": "Wei",
"surname": "Wang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Ningjing Tian",
"givenName": "Ningjing",
"surname": "Tian",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sunzhou Huang",
"givenName": "Sunzhou",
"surname": "Huang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Sen He",
"givenName": "Sen",
"surname": "He",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Abhijeet Srivastava",
"givenName": "Abhijeet",
"surname": "Srivastava",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Mary Lou Soffa",
"givenName": "Mary Lou",
"surname": "Soffa",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Lori Pollock",
"givenName": "Lori",
"surname": "Pollock",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icst",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2018-04-01T00:00:00",
"pubType": "proceedings",
"pages": "81-92",
"year": "2018",
"issn": null,
"isbn": "978-1-5386-5012-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "501201a070",
"articleId": "12OmNwEJ12n",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "501201a093",
"articleId": "12OmNyugyYf",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/dexa/2017/1051/0/1051a127",
"title": "Quantifying Uncertainty for Preemptive Resource Provisioning in the Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/dexa/2017/1051a127/12OmNALUowx",
"parentPublication": {
"id": "proceedings/dexa/2017/1051/0",
"title": "2017 28th International Workshop on Database and Expert Systems Applications (DEXA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itcs/2010/4074/0/4074a118",
"title": "A New Method for Reliability Evaluation Based on Cloud Model",
"doi": null,
"abstractUrl": "/proceedings-article/itcs/2010/4074a118/12OmNANTAwJ",
"parentPublication": {
"id": "proceedings/itcs/2010/4074/0",
"title": "Information Technology and Computer Science, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/trustcom/2012/4745/0/4745a109",
"title": "Fusion of Opinions under Uncertainty and Conflict -- Application to Trust Assessment for Cloud Marketplaces",
"doi": null,
"abstractUrl": "/proceedings-article/trustcom/2012/4745a109/12OmNAS9zK0",
"parentPublication": {
"id": "proceedings/trustcom/2012/4745/0",
"title": "2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloud/2016/2619/0/2619a577",
"title": "Uncertainty-Aware Real-Time Workflow Scheduling in the Cloud",
"doi": null,
"abstractUrl": "/proceedings-article/cloud/2016/2619a577/12OmNAYGloJ",
"parentPublication": {
"id": "proceedings/cloud/2016/2619/0",
"title": "2016 IEEE 9th International Conference on Cloud Computing (CLOUD)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cloudcom/2015/9560/0/9560a131",
"title": "Governing Elastic IoT Cloud Systems under Uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/cloudcom/2015/9560a131/12OmNCdk2xq",
"parentPublication": {
"id": "proceedings/cloudcom/2015/9560/0",
"title": "2015 IEEE 7th International Conference on Cloud Computing Technology and Science (CloudCom)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ipdpsw/2018/5555/0/555501a666",
"title": "WA-RRNS: Reliable Data Storage System Based on Multi-cloud",
"doi": null,
"abstractUrl": "/proceedings-article/ipdpsw/2018/555501a666/12OmNz2C1Dg",
"parentPublication": {
"id": "proceedings/ipdpsw/2018/5555/0",
"title": "2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cd/2016/03/mcd2016030050",
"title": "Managing Uncertainty in Autonomic Cloud Elasticity Controllers",
"doi": null,
"abstractUrl": "/magazine/cd/2016/03/mcd2016030050/13rRUyekIZm",
"parentPublication": {
"id": "mags/cd",
"title": "IEEE Cloud Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/issre/2018/8321/0/832100a036",
"title": "Online Model-Based Testing under Uncertainty",
"doi": null,
"abstractUrl": "/proceedings-article/issre/2018/832100a036/17D45Wuc34C",
"parentPublication": {
"id": "proceedings/issre/2018/8321/0",
"title": "2018 IEEE 29th International Symposium on Software Reliability Engineering (ISSRE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2021/0337/0/033700a666",
"title": "Performance Testing for Cloud Computing with Dependent Data Bootstrapping",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2021/033700a666/1AjTjS3L9M4",
"parentPublication": {
"id": "proceedings/ase/2021/0337/0",
"title": "2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/nca/2020/8326/0/09306707",
"title": "Uncertainty Driven Workflow Scheduling Using Unreliable Cloud Resources",
"doi": null,
"abstractUrl": "/proceedings-article/nca/2020/09306707/1q8YjPMAOZO",
"parentPublication": {
"id": "proceedings/nca/2020/8326/0",
"title": "2020 IEEE 19th International Symposium on Network Computing and Applications (NCA)",
"__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": "12OmNxdDFDY",
"doi": "10.1109/ICTAI.2016.0124",
"title": "Effects of Emotional Visual Scenes on the Ability to Decode Emotional Melodies",
"normalizedTitle": "Effects of Emotional Visual Scenes on the Ability to Decode Emotional Melodies",
"abstract": "An effective change in Human Computer Interaction requires to account of how communication practices are transformed in different contexts, how users sense the interaction with a machine, and an efficient machine sensitivity in interpreting users' communicative signals, and activities. To this aims, the present paper investigates on whether and how positive and negative visual scenes may alter listeners' ability to decode emotional melodies. Emotional tunes were played alone and with, either positive, or negative, or neutral emotional scenes. Afterword, subjects (8 groups, each of 38 subjects, equally balanced by gender) were asked to decode the emotional feeling aroused by melodies ascribing them either emotional valences (positive, negative, I don't know) or emotional labels (happy, sad, fear, anger, another emotion, I don't know). It was found that dimensional emotional features rather than emotional labels strongly affect cognitive judgements of emotional melodies. Musical emotional information is most effectively retained when the task is to assign labels rather than valence values to melodies. In addition, significant misperception effects are observed when happy or positively judged melodies are concurrently played with negative scenes.",
"abstracts": [
{
"abstractType": "Regular",
"content": "An effective change in Human Computer Interaction requires to account of how communication practices are transformed in different contexts, how users sense the interaction with a machine, and an efficient machine sensitivity in interpreting users' communicative signals, and activities. To this aims, the present paper investigates on whether and how positive and negative visual scenes may alter listeners' ability to decode emotional melodies. Emotional tunes were played alone and with, either positive, or negative, or neutral emotional scenes. Afterword, subjects (8 groups, each of 38 subjects, equally balanced by gender) were asked to decode the emotional feeling aroused by melodies ascribing them either emotional valences (positive, negative, I don't know) or emotional labels (happy, sad, fear, anger, another emotion, I don't know). It was found that dimensional emotional features rather than emotional labels strongly affect cognitive judgements of emotional melodies. Musical emotional information is most effectively retained when the task is to assign labels rather than valence values to melodies. In addition, significant misperception effects are observed when happy or positively judged melodies are concurrently played with negative scenes.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "An effective change in Human Computer Interaction requires to account of how communication practices are transformed in different contexts, how users sense the interaction with a machine, and an efficient machine sensitivity in interpreting users' communicative signals, and activities. To this aims, the present paper investigates on whether and how positive and negative visual scenes may alter listeners' ability to decode emotional melodies. Emotional tunes were played alone and with, either positive, or negative, or neutral emotional scenes. Afterword, subjects (8 groups, each of 38 subjects, equally balanced by gender) were asked to decode the emotional feeling aroused by melodies ascribing them either emotional valences (positive, negative, I don't know) or emotional labels (happy, sad, fear, anger, another emotion, I don't know). It was found that dimensional emotional features rather than emotional labels strongly affect cognitive judgements of emotional melodies. Musical emotional information is most effectively retained when the task is to assign labels rather than valence values to melodies. In addition, significant misperception effects are observed when happy or positively judged melodies are concurrently played with negative scenes.",
"fno": "4459a791",
"keywords": [
"Music",
"Visualization",
"Context",
"Standards",
"Psychology",
"Aging",
"Sociology",
"Composite Multimodal Signals",
"Emotional Dimensions",
"Emotional Labels",
"Congruent And Incongruent Context",
"Positive",
"Negative",
"And Neutral Visual Scenes",
"Emotional Communicative Effectiveness",
"Musical Expressions Of Emotions"
],
"authors": [
{
"affiliation": null,
"fullName": "Anna Esposito",
"givenName": "Anna",
"surname": "Esposito",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Antonietta M. Esposito",
"givenName": "Antonietta M.",
"surname": "Esposito",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Marilena Esposito",
"givenName": "Marilena",
"surname": "Esposito",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Maria Teresa Riviello",
"givenName": "Maria Teresa",
"surname": "Riviello",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Alessandro Vinciarelli",
"givenName": "Alessandro",
"surname": "Vinciarelli",
"__typename": "ArticleAuthorType"
},
{
"affiliation": null,
"fullName": "Nikolaos Bourbakis",
"givenName": "Nikolaos",
"surname": "Bourbakis",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "ictai",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2016-11-01T00:00:00",
"pubType": "proceedings",
"pages": "791-798",
"year": "2016",
"issn": "2375-0197",
"isbn": "978-1-5090-4459-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "4459a784",
"articleId": "12OmNBtl1G3",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "4459a799",
"articleId": "12OmNrFTr8a",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fg/2008/2153/0/04813317",
"title": "Emotional contagion for unseen bodily expressions: Evidence from facial EMG",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2008/04813317/12OmNAmmuOV",
"parentPublication": {
"id": "proceedings/fg/2008/2153/0",
"title": "2008 8th IEEE International Conference on Automatic Face & Gesture Recognition",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2015/9953/0/07344569",
"title": "Emotional signaling in a social dilemma: An automatic analysis",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2015/07344569/12OmNxFsmqG",
"parentPublication": {
"id": "proceedings/acii/2015/9953/0",
"title": "2015 International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2015/9953/0/07344629",
"title": "Linking volitional preferences for emotional information to social difficulties: A game approach using the microsoft kinect",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2015/07344629/12OmNyOq50G",
"parentPublication": {
"id": "proceedings/acii/2015/9953/0",
"title": "2015 International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2020/02/08114206",
"title": "Singing Robots: How Embodiment Affects Emotional Responses to Non-Linguistic Utterances",
"doi": null,
"abstractUrl": "/journal/ta/2020/02/08114206/13rRUwh80t1",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2014/04/06849440",
"title": "CREMA-D: Crowd-Sourced Emotional Multimodal Actors Dataset",
"doi": null,
"abstractUrl": "/journal/ta/2014/04/06849440/13rRUzphDwg",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icdsba/2018/8431/0/843100a263",
"title": "A Cognitive Study of Tibetan Lhasa Speech Emotional Rhythm Based on Emotional Rhythm and Emotional Lexical Meaning",
"doi": null,
"abstractUrl": "/proceedings-article/icdsba/2018/843100a263/17D45VWpMAa",
"parentPublication": {
"id": "proceedings/icdsba/2018/8431/0",
"title": "2018 2nd International Conference on Data Science and Business Analytics (ICDSBA)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2022/8402/0/840200a848",
"title": "Comparing Physiological and Emotional Effects of Happy and Sad Virtual Environments Experienced in Video and Virtual Reality",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2022/840200a848/1CJdhFm4Ez6",
"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/fg/2020/3079/0/307900a492",
"title": "Seniors’ ability to decode differently aged facial emotional expressions",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a492/1kecIDiclEs",
"parentPublication": {
"id": "proceedings/fg/2020/3079/0/",
"title": "2020 15th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2020) (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/03/09200685",
"title": "Enhancement of Movement Intention Detection Using EEG Signals Responsive to Emotional Music Stimulus",
"doi": null,
"abstractUrl": "/journal/ta/2022/03/09200685/1ndVcP6texO",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2021/0191/0/019100c168",
"title": "Emotional Features of Interactions with Empathic Agents",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2021/019100c168/1yNiET1pvl6",
"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": "1A9X06PlzG0",
"title": "2021 IEEE International Conference on Big Knowledge (ICBK)",
"acronym": "icbk",
"groupId": "1821544",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1A9X97BijW8",
"doi": "10.1109/ICKG52313.2021.00010",
"title": "Combining Deductive and Statistical Explanations in the FRANK Query Answering System",
"normalizedTitle": "Combining Deductive and Statistical Explanations in the FRANK Query Answering System",
"abstract": "Both symbolic and sub-symbolic AI have their limi-tations, but their combination can be more than the sum of their parts. For instance, statistical machine learning has been hugely successful at classification and decision-making tasks, but not so good at deliberative systematic reasoning nor at explanation. We argue that by combining symbolic and sub-symbolic reasoning into hybrid systems, the whole will be more than the sum of its parts. To illustrate the potential of hybrid AI system, we describe the FRANK query answering system. FRANK infers new knowledge from the diverse and immense knowledge sources on the Web, using a combination of both deductive and statistical reasoning. This enables it to make predictions. For instance, to answer the question “Which country in Europe will have the highest GDP growth rate by 2032?”, it (i) decomposes Europe into its constituent countries, (ii) then for each country uses regression over their previous GDP growth rates to extrapolate each to 2032 and (iii) then returns the country which is predicted to then have the maximum value. The decompositions are explained deductively and the regressions by a prediction model that can be rendered graphically. This explanation of FRANK's reasoning merges deduction and statistics. In this paper, we highlight recent work on FRANK that focus on leveraging hybrid AI to tackle question answering with emphasis on explainability of the inference process and its inferred answers. We aim for whole system reasoning; that is, we are automating the choices of knowledge sources and the planning that constructs the inference process from the facts found in these knowledge sources. We intend that these ‘engineering’ choices are also explained to the user.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Both symbolic and sub-symbolic AI have their limi-tations, but their combination can be more than the sum of their parts. For instance, statistical machine learning has been hugely successful at classification and decision-making tasks, but not so good at deliberative systematic reasoning nor at explanation. We argue that by combining symbolic and sub-symbolic reasoning into hybrid systems, the whole will be more than the sum of its parts. To illustrate the potential of hybrid AI system, we describe the FRANK query answering system. FRANK infers new knowledge from the diverse and immense knowledge sources on the Web, using a combination of both deductive and statistical reasoning. This enables it to make predictions. For instance, to answer the question “Which country in Europe will have the highest GDP growth rate by 2032?”, it (i) decomposes Europe into its constituent countries, (ii) then for each country uses regression over their previous GDP growth rates to extrapolate each to 2032 and (iii) then returns the country which is predicted to then have the maximum value. The decompositions are explained deductively and the regressions by a prediction model that can be rendered graphically. This explanation of FRANK's reasoning merges deduction and statistics. In this paper, we highlight recent work on FRANK that focus on leveraging hybrid AI to tackle question answering with emphasis on explainability of the inference process and its inferred answers. We aim for whole system reasoning; that is, we are automating the choices of knowledge sources and the planning that constructs the inference process from the facts found in these knowledge sources. We intend that these ‘engineering’ choices are also explained to the user.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Both symbolic and sub-symbolic AI have their limi-tations, but their combination can be more than the sum of their parts. For instance, statistical machine learning has been hugely successful at classification and decision-making tasks, but not so good at deliberative systematic reasoning nor at explanation. We argue that by combining symbolic and sub-symbolic reasoning into hybrid systems, the whole will be more than the sum of its parts. To illustrate the potential of hybrid AI system, we describe the FRANK query answering system. FRANK infers new knowledge from the diverse and immense knowledge sources on the Web, using a combination of both deductive and statistical reasoning. This enables it to make predictions. For instance, to answer the question “Which country in Europe will have the highest GDP growth rate by 2032?”, it (i) decomposes Europe into its constituent countries, (ii) then for each country uses regression over their previous GDP growth rates to extrapolate each to 2032 and (iii) then returns the country which is predicted to then have the maximum value. The decompositions are explained deductively and the regressions by a prediction model that can be rendered graphically. This explanation of FRANK's reasoning merges deduction and statistics. In this paper, we highlight recent work on FRANK that focus on leveraging hybrid AI to tackle question answering with emphasis on explainability of the inference process and its inferred answers. We aim for whole system reasoning; that is, we are automating the choices of knowledge sources and the planning that constructs the inference process from the facts found in these knowledge sources. We intend that these ‘engineering’ choices are also explained to the user.",
"fno": "385800a001",
"keywords": [
"Decision Making",
"Economic Indicators",
"Inference Mechanisms",
"Learning Artificial Intelligence",
"Pattern Classification",
"Query Processing",
"Question Answering Information Retrieval",
"Deductive Explanations",
"Statistical Explanations",
"FRANK Query Answering System",
"Sub Symbolic AI",
"Statistical Machine Learning",
"Decision Making Tasks",
"Deliberative Systematic Reasoning",
"Sub Symbolic Reasoning",
"Hybrid Systems",
"Hybrid AI System",
"Diverse Knowledge Sources",
"Immense Knowledge Sources",
"Deductive Reasoning",
"Statistical Reasoning",
"Highest GDP Growth Rate",
"Constituent Countries",
"Previous GDP Growth Rates",
"Statistics",
"Inference Process",
"Inferred Answers",
"System Reasoning",
"Uncertainty",
"Systematics",
"Statistical Analysis",
"Economic Indicators",
"Sociology",
"Europe",
"User Interfaces",
"Query Answering",
"Explainability",
"Whole System Reasoning",
"Hybrid Systems",
"Meta Level Reasoning"
],
"authors": [
{
"affiliation": "University of Edinburgh,School of Informatics,Edinburgh,UK,EH8 9AB",
"fullName": "Alan Bundy",
"givenName": "Alan",
"surname": "Bundy",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Edinburgh,School of Informatics,Edinburgh,UK,EH8 9AB",
"fullName": "Kwabena Nuamah",
"givenName": "Kwabena",
"surname": "Nuamah",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icbk",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1-6",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-3858-2",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "385800z020",
"articleId": "1A9X0nbgKis",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "385800a007",
"articleId": "1A9X2ljBRfy",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "mags/ex/2000/06/x6051",
"title": "AI at IBM Research",
"doi": null,
"abstractUrl": "/magazine/ex/2000/06/x6051/13rRUxASuIx",
"parentPublication": {
"id": "mags/ex",
"title": "IEEE Intelligent Systems",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/snpd/2019/1651/0/08935719",
"title": "Empirical Analysis of RMB Price Discovery Effects Between China Sovereign CDS spread, offshore RMB and Global Financial Market Variables: Comparative analysis of China, Japan and South Korea",
"doi": null,
"abstractUrl": "/proceedings-article/snpd/2019/08935719/1fThbozJS4E",
"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/icedeg/2020/5882/0/09096765",
"title": "Tech for Hire: Data Science-Related Jobs Signal Economic Growth",
"doi": null,
"abstractUrl": "/proceedings-article/icedeg/2020/09096765/1l6SxHv6AfK",
"parentPublication": {
"id": "proceedings/icedeg/2020/5882/0",
"title": "2020 Seventh International Conference on eDemocracy & eGovernment (ICEDEG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2021/4509/0/450900k0638",
"title": "ACRE: Abstract Causal REasoning Beyond Covariation",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2021/450900k0638/1yeIbqfckvu",
"parentPublication": {
"id": "proceedings/cvpr/2021/4509/0",
"title": "2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1tV97eNEfqE",
"title": "2020 2nd International Conference on Economic Management and Model Engineering (ICEMME)",
"acronym": "icemme",
"groupId": "1835284",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1tV99XK6efm",
"doi": "10.1109/ICEMME51517.2020.00178",
"title": "Analysis on the Impact of Human Psychological on Economic Irrational Exuberance",
"normalizedTitle": "Analysis on the Impact of Human Psychological on Economic Irrational Exuberance",
"abstract": "\"Irrational Exuberance\" is a concept put forward by Fed Chairman Alan Greenspan on the US stock market bubble in 1996. There are many \"Irrational Exuberance\" in the world economy's history, which is the embodiment of the bubble economy. However, the existing economic theories cannot entirely explain why \"Irrational Exuberance\" occurs and why \"Irrational Exuberance\" leads to an economic crisis. Therefore, it is essential to find a new interpretation method. In the past economic theories, the impact of human psychological activities on the economy was often underestimated. This is why this research contains many of the latest knowledge and discoveries about the impact of human psychology on the economy. So far, the main reason for human mental activity is believed to be related to individual self-cognition and feedback. Besides, feedback to information, lack of experience, environmental impact, etc. affect the changes in human psychological activities. Since it is found that individual psychological changes impact group psychological changes, the hypothesis of psychological activity communication is proposed, including \"bounded rationality,\" systematic cognitive bias, the influence of mass media, confidence multiplier hypothesis, and group unconsciousness.",
"abstracts": [
{
"abstractType": "Regular",
"content": "\"Irrational Exuberance\" is a concept put forward by Fed Chairman Alan Greenspan on the US stock market bubble in 1996. There are many \"Irrational Exuberance\" in the world economy's history, which is the embodiment of the bubble economy. However, the existing economic theories cannot entirely explain why \"Irrational Exuberance\" occurs and why \"Irrational Exuberance\" leads to an economic crisis. Therefore, it is essential to find a new interpretation method. In the past economic theories, the impact of human psychological activities on the economy was often underestimated. This is why this research contains many of the latest knowledge and discoveries about the impact of human psychology on the economy. So far, the main reason for human mental activity is believed to be related to individual self-cognition and feedback. Besides, feedback to information, lack of experience, environmental impact, etc. affect the changes in human psychological activities. Since it is found that individual psychological changes impact group psychological changes, the hypothesis of psychological activity communication is proposed, including \"bounded rationality,\" systematic cognitive bias, the influence of mass media, confidence multiplier hypothesis, and group unconsciousness.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "\"Irrational Exuberance\" is a concept put forward by Fed Chairman Alan Greenspan on the US stock market bubble in 1996. There are many \"Irrational Exuberance\" in the world economy's history, which is the embodiment of the bubble economy. However, the existing economic theories cannot entirely explain why \"Irrational Exuberance\" occurs and why \"Irrational Exuberance\" leads to an economic crisis. Therefore, it is essential to find a new interpretation method. In the past economic theories, the impact of human psychological activities on the economy was often underestimated. This is why this research contains many of the latest knowledge and discoveries about the impact of human psychology on the economy. So far, the main reason for human mental activity is believed to be related to individual self-cognition and feedback. Besides, feedback to information, lack of experience, environmental impact, etc. affect the changes in human psychological activities. Since it is found that individual psychological changes impact group psychological changes, the hypothesis of psychological activity communication is proposed, including \"bounded rationality,\" systematic cognitive bias, the influence of mass media, confidence multiplier hypothesis, and group unconsciousness.",
"fno": "914400a871",
"keywords": [
"Cognition",
"Decision Making",
"Economics",
"Psychology",
"Stock Markets",
"Economic Irrational Exuberance",
"Fed Chairman Alan Greenspan",
"US Stock Market Bubble",
"World Economy",
"Bubble Economy",
"Economic Crisis",
"Human Psychological Activities",
"Human Mental Activity",
"Psychological Activity Communication",
"Economics",
"Systematics",
"Statistical Analysis",
"Sociology",
"Psychology",
"Media",
"Depression",
"Economic Bubble",
"Economic Crisis",
"Group Mental Activity",
"Cognitive Psychology",
"Mass Media Theory",
"Analytical Psychology"
],
"authors": [
{
"affiliation": "University of Nebraska Omaha,Omaha,USA",
"fullName": "Zhongyue Lin",
"givenName": "Zhongyue",
"surname": "Lin",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icemme",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-11-01T00:00:00",
"pubType": "proceedings",
"pages": "871-876",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-9144-7",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "914400a866",
"articleId": "1tV9pD1sXcs",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "914400a877",
"articleId": "1tV9nJEkFws",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iciw/2008/3163/0/3163a552",
"title": "User Psychological Problems in a Wiki-Based Knowledge Sharing Portal",
"doi": null,
"abstractUrl": "/proceedings-article/iciw/2008/3163a552/12OmNqBKU4Y",
"parentPublication": {
"id": "proceedings/iciw/2008/3163/0",
"title": "Internet and Web Applications and Services, International Conference on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2015/9953/0/07344622",
"title": "Towards an affective interface for assessment of psychological distress",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2015/07344622/12OmNrJAdSl",
"parentPublication": {
"id": "proceedings/acii/2015/9953/0",
"title": "2015 International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2016/09/07331666",
"title": "Psychological Parameters for Crowd Simulation: From Audiences to Mobs",
"doi": null,
"abstractUrl": "/journal/tg/2016/09/07331666/13rRUNvya9o",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iiai-aai/2021/2420/0/242000a243",
"title": "Impact of Differences in Physical, Social and Psychological Factors on Nursing Care Expectations",
"doi": null,
"abstractUrl": "/proceedings-article/iiai-aai/2021/242000a243/1Eb2ANP1hUA",
"parentPublication": {
"id": "proceedings/iiai-aai/2021/2420/0",
"title": "2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acii/2022/5908/0/09953849",
"title": "Speech Behavioral Markers Align on Symptom Factors in Psychological Distress",
"doi": null,
"abstractUrl": "/proceedings-article/acii/2022/09953849/1IAK0iLtHHy",
"parentPublication": {
"id": "proceedings/acii/2022/5908/0",
"title": "2022 10th International Conference on Affective Computing and Intelligent Interaction (ACII)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/isaiee/2022/6357/0/635700a649",
"title": "Student Psychological Prediction and Analysis System based on Improved Apriori Algorithm",
"doi": null,
"abstractUrl": "/proceedings-article/isaiee/2022/635700a649/1LRkW8xeLO8",
"parentPublication": {
"id": "proceedings/isaiee/2022/6357/0",
"title": "2022 International Symposium on Advances in Informatics, Electronics and Education (ISAIEE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlcss/2022/5493/0/549300a233",
"title": "Study on The Psychological Stress Biofeedback Training System Based on Multiple Physiological Parameters",
"doi": null,
"abstractUrl": "/proceedings-article/mlcss/2022/549300a233/1LSOWLLdui4",
"parentPublication": {
"id": "proceedings/mlcss/2022/5493/0",
"title": "2022 International Conference on Machine Learning, Computer Systems and Security (MLCSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fg/2020/3079/0/307900a214",
"title": "Automatic Detection of Self-Adaptors for Psychological Distress",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2020/307900a214/1kecI2z8ccU",
"parentPublication": {
"id": "proceedings/fg/2020/3079/0/",
"title": "2020 15th IEEE International Conference on Automatic Face and Gesture Recognition (FG 2020) (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icphds/2020/8571/0/857100a149",
"title": "Investigation on Hypertension and its co-morbidity in China and Research on the Correlation between Psychological Control Source and Anxiety/Depression Status",
"doi": null,
"abstractUrl": "/proceedings-article/icphds/2020/857100a149/1rxhqtQwQeI",
"parentPublication": {
"id": "proceedings/icphds/2020/8571/0",
"title": "2020 International Conference on Public Health and Data Science (ICPHDS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/5555/01/09506822",
"title": "Looking At The Body: Automatic Analysis of Body Gestures and Self-Adaptors in Psychological Distress",
"doi": null,
"abstractUrl": "/journal/ta/5555/01/09506822/1vNfgXlqzfO",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1taF3TXPH7G",
"title": "2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)",
"acronym": "csde",
"groupId": "1837144",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1taFaN8qRri",
"doi": "10.1109/CSDE50874.2020.9411636",
"title": "Statistical Analysis and Predictive Modelling of Air Pollutants Using Advanced Machine Learning Approaches",
"normalizedTitle": "Statistical Analysis and Predictive Modelling of Air Pollutants Using Advanced Machine Learning Approaches",
"abstract": "Air quality forecasting is important as it provides early warning of air pollutants, which could be harmful to human health and the environment. This study presents a statistical analysis and prediction of various air pollutants (such as PM<sub>10</sub>, CO, SO<sub>2</sub>, NO<sub>2</sub> and O<sub>3</sub>) and the air pollution index (API) in Labuan, Malaysia using advanced machine learning approaches. The exponential triple smoothing (ETS) and seasonal autoregressive integrated moving average (SARIMA) forecasting methods were used in the study. Air pollutants and API data from 2000 to 2018 were analyzed and tested with these forecasting models. The ETS model with 68% confidence interval (CI) fitted well for all air pollutants except SO<sub>2</sub>, which was best fitted by the 95% CI model. The SARIMA (1, 1, 1)(0, 1, 1)12 model was found to be the most appropriate for forecasting different air pollutants and API in Labuan. The ETS model was more suitable for forecasting CO and SO<sub>2</sub> and the SARIMA (1, 1, 1)(0, 1, 1)12 model was more suitable for forecasting PMio, NO<sub>2</sub>, O<sub>3</sub> and API. The ETS model predicts that the annual concentrations of CO and SO<sub>2</sub> in 2030 would be about 0 ± 0.81 ppm and 0 ± 0.002 ppm, respectively, at 68% CI. The SARIMA (1, 1, 1)(0, 1, 1)i<sub>2</sub> model predicts that the annual concentrations of PMio, NO<sub>2</sub> and O<sub>3</sub> in 2030 would be about 38.7 ± 14.8 pg/m<sup>3</sup>, 0 ± 0.006 ppm and 0.01 ± 0.008 ppm, respectively, and API value of about 44 ± 15 in Labuan.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Air quality forecasting is important as it provides early warning of air pollutants, which could be harmful to human health and the environment. This study presents a statistical analysis and prediction of various air pollutants (such as PM<sub>10</sub>, CO, SO<sub>2</sub>, NO<sub>2</sub> and O<sub>3</sub>) and the air pollution index (API) in Labuan, Malaysia using advanced machine learning approaches. The exponential triple smoothing (ETS) and seasonal autoregressive integrated moving average (SARIMA) forecasting methods were used in the study. Air pollutants and API data from 2000 to 2018 were analyzed and tested with these forecasting models. The ETS model with 68% confidence interval (CI) fitted well for all air pollutants except SO<sub>2</sub>, which was best fitted by the 95% CI model. The SARIMA (1, 1, 1)(0, 1, 1)12 model was found to be the most appropriate for forecasting different air pollutants and API in Labuan. The ETS model was more suitable for forecasting CO and SO<sub>2</sub> and the SARIMA (1, 1, 1)(0, 1, 1)12 model was more suitable for forecasting PMio, NO<sub>2</sub>, O<sub>3</sub> and API. The ETS model predicts that the annual concentrations of CO and SO<sub>2</sub> in 2030 would be about 0 ± 0.81 ppm and 0 ± 0.002 ppm, respectively, at 68% CI. The SARIMA (1, 1, 1)(0, 1, 1)i<sub>2</sub> model predicts that the annual concentrations of PMio, NO<sub>2</sub> and O<sub>3</sub> in 2030 would be about 38.7 ± 14.8 pg/m<sup>3</sup>, 0 ± 0.006 ppm and 0.01 ± 0.008 ppm, respectively, and API value of about 44 ± 15 in Labuan.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Air quality forecasting is important as it provides early warning of air pollutants, which could be harmful to human health and the environment. This study presents a statistical analysis and prediction of various air pollutants (such as PM10, CO, SO2, NO2 and O3) and the air pollution index (API) in Labuan, Malaysia using advanced machine learning approaches. The exponential triple smoothing (ETS) and seasonal autoregressive integrated moving average (SARIMA) forecasting methods were used in the study. Air pollutants and API data from 2000 to 2018 were analyzed and tested with these forecasting models. The ETS model with 68% confidence interval (CI) fitted well for all air pollutants except SO2, which was best fitted by the 95% CI model. The SARIMA (1, 1, 1)(0, 1, 1)12 model was found to be the most appropriate for forecasting different air pollutants and API in Labuan. The ETS model was more suitable for forecasting CO and SO2 and the SARIMA (1, 1, 1)(0, 1, 1)12 model was more suitable for forecasting PMio, NO2, O3 and API. The ETS model predicts that the annual concentrations of CO and SO2 in 2030 would be about 0 ± 0.81 ppm and 0 ± 0.002 ppm, respectively, at 68% CI. The SARIMA (1, 1, 1)(0, 1, 1)i2 model predicts that the annual concentrations of PMio, NO2 and O3 in 2030 would be about 38.7 ± 14.8 pg/m3, 0 ± 0.006 ppm and 0.01 ± 0.008 ppm, respectively, and API value of about 44 ± 15 in Labuan.",
"fno": "09411636",
"keywords": [
"Air Pollution",
"Atmospheric Composition",
"Autoregressive Moving Average Processes",
"Learning Artificial Intelligence",
"Statistical Analysis",
"Time Series",
"API",
"Advanced Machine Learning Approaches",
"Seasonal Autoregressive Integrated Moving Average Forecasting Methods",
"Forecasting Models",
"ETS Model",
"CI Model",
"Air Pollutants",
"Statistical Analysis",
"Air Quality Forecasting",
"Air Pollution Index",
"CO",
"SO Sub 2 Sub",
"NO Sub 2 Sub",
"O Sub 3 Sub",
"Analytical Models",
"Smoothing Methods",
"Statistical Analysis",
"Atmospheric Modeling",
"Computational Modeling",
"Machine Learning",
"Predictive Models",
"Air Pollutants",
"Air Pollution Index API",
"Exponential Triple Smoothing ETS",
"Forecast",
"Seasonal Autoregressive Integrated Moving Average SARIMA"
],
"authors": [
{
"affiliation": "Universiti Brunei Darussalam,Faculty of Integrated Technologies,Gadong,Brunei Darussalam",
"fullName": "Wan Yun Hong",
"givenName": "Wan Yun",
"surname": "Hong",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "PAPRSB Institute of Health Sciences Universiti Brunei Darussalam,Gadong,Brunei Darussalam",
"fullName": "David Koh",
"givenName": "David",
"surname": "Koh",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Universiti Kebangsaan Malaysia,Faculty of Science and Technology,Department of Earth Sciences and Environment,Bangi,Selangor,Malaysia",
"fullName": "Anis Asma Ahmad Mohtar",
"givenName": "Anis Asma Ahmad",
"surname": "Mohtar",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Universiti Kebangsaan Malaysia,Faculty of Science and Technology,Department of Earth Sciences and Environment,Bangi,Selangor,Malaysia",
"fullName": "Mohd Talib Latif",
"givenName": "Mohd Talib",
"surname": "Latif",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "csde",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-12-01T00:00:00",
"pubType": "proceedings",
"pages": "1-6",
"year": "2020",
"issn": null,
"isbn": "978-1-6654-1974-1",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09411592",
"articleId": "1taF8brBuEM",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09411525",
"articleId": "1taFaTuZieY",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/bigdataservice/2016/2251/0/2251a182",
"title": "Air Quality Simulations Using Big Data Programming Models",
"doi": null,
"abstractUrl": "/proceedings-article/bigdataservice/2016/2251a182/12OmNviZlHC",
"parentPublication": {
"id": "proceedings/bigdataservice/2016/2251/0",
"title": "2016 IEEE Second International Conference on Big Data Computing Service and Applications (BigDataService)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2017/2715/0/08258500",
"title": "Machine learning and air quality modeling",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2017/08258500/17D45WaTkhR",
"parentPublication": {
"id": "proceedings/big-data/2017/2715/0",
"title": "2017 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/itme/2018/7744/0/774400a275",
"title": "Relationship Between Air Pollutants and Outpatient Visits for Respiratory Diseases in Hangzhou",
"doi": null,
"abstractUrl": "/proceedings-article/itme/2018/774400a275/17D45XeKgvP",
"parentPublication": {
"id": "proceedings/itme/2018/7744/0",
"title": "2018 9th International Conference on Information Technology in Medicine and Education (ITME)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/bd/2018/04/07970191",
"title": "pg-Causality: Identifying Spatiotemporal Causal Pathways for Air Pollutants with Urban Big Data",
"doi": null,
"abstractUrl": "/journal/bd/2018/04/07970191/17D45Xq6dD1",
"parentPublication": {
"id": "trans/bd",
"title": "IEEE Transactions on Big Data",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/mlke/2022/9567/0/956700a001",
"title": "Air Quality Prediction Based on Machine Learning",
"doi": null,
"abstractUrl": "/proceedings-article/mlke/2022/956700a001/1CY7TyVCXMk",
"parentPublication": {
"id": "proceedings/mlke/2022/9567/0",
"title": "2022 International Conference on Machine Learning and Knowledge Engineering (MLKE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2022/6603/0/660300a069",
"title": "Multilayer Meta-Learning Approach to Forecasting Air Pollutants",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2022/660300a069/1GvdMinpknS",
"parentPublication": {
"id": "proceedings/iri/2022/6603/0",
"title": "2022 IEEE 23rd International Conference on Information Reuse and Integration for Data Science (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/faiml/2022/7364/0/736400a151",
"title": "Statistical Analysis of Connected and Autonomous Vehicles (CAVs) Effects on the Environment in Terms of Pollutants and Fuel Consumption",
"doi": null,
"abstractUrl": "/proceedings-article/faiml/2022/736400a151/1IUEPzjuLvy",
"parentPublication": {
"id": "proceedings/faiml/2022/7364/0",
"title": "2022 International Conference on Frontiers of Artificial Intelligence and Machine Learning (FAIML)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icoin/2019/8350/0/08718193",
"title": "Low Cost Fine-Grained Air Quality Monitoring System Using LoRa WAN",
"doi": null,
"abstractUrl": "/proceedings-article/icoin/2019/08718193/1aIS0OOAO1W",
"parentPublication": {
"id": "proceedings/icoin/2019/8350/0",
"title": "2019 International Conference on Information Networking (ICOIN)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bigdataservice/2019/0059/0/005900a151",
"title": "Real Time Attention Based Bidirectional Long Short-Term Memory Networks for Air Pollution Forecasting",
"doi": null,
"abstractUrl": "/proceedings-article/bigdataservice/2019/005900a151/1dDLVaGqRoc",
"parentPublication": {
"id": "proceedings/bigdataservice/2019/0059/0",
"title": "2019 IEEE Fifth International Conference on Big Data Computing Service and Applications (BigDataService)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ithings-greencom-cpscom-smartdata/2019/2980/0/298000a967",
"title": "Evaluation of Precalibrated Electrochemical Gas Sensors for Air Quality Monitoring Systems",
"doi": null,
"abstractUrl": "/proceedings-article/ithings-greencom-cpscom-smartdata/2019/298000a967/1ehBHAmX1fi",
"parentPublication": {
"id": "proceedings/ithings-greencom-cpscom-smartdata/2019/2980/0",
"title": "2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"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": "1tmiyi6FVAc",
"doi": "10.1109/ICPR48806.2021.9411966",
"title": "A Bayesian Deep CNN Framework for Reconstructing k-t-Undersampled Resting-fMRI",
"normalizedTitle": "A Bayesian Deep CNN Framework for Reconstructing k-t-Undersampled Resting-fMRI",
"abstract": "Undersampled reconstruction in resting functional magnetic resonance imaging (R-fMRI) holds the potential to enable higher spatial resolution in brain R-fMRI without increasing scan duration. We propose a novel approach to reconstruct kt undersampled R-fMRI relying on a deep convolutional neural network (CNN) framework. The architecture of our CNN framework comprises a novel scheme for R-fMRI reconstruction that jointly learns two multilayer CNN components for (i) explicitly filling in missing k-space data, using acquired data in frequency-temporal neighborhoods, and (ii) image quality enhancement in the spatiotemporal domain. The architecture sandwiches the Fourier transformation from the frequency domain to the spatial domain between the two aforementioned CNN components, during, both, CNN learning and inference. We propose four methods within our framework, including a Bayesian CNN that produces uncertainty maps indicating the per-voxel (and per-timepoint) confidence in the blood oxygenation level dependent (BOLD) time-series reconstruction. Results on brain R-fMRI show that our CNN framework improves over the state of the art, quantitatively and qualitatively, in terms of the connectivity maps for three cerebral functional networks.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Undersampled reconstruction in resting functional magnetic resonance imaging (R-fMRI) holds the potential to enable higher spatial resolution in brain R-fMRI without increasing scan duration. We propose a novel approach to reconstruct kt undersampled R-fMRI relying on a deep convolutional neural network (CNN) framework. The architecture of our CNN framework comprises a novel scheme for R-fMRI reconstruction that jointly learns two multilayer CNN components for (i) explicitly filling in missing k-space data, using acquired data in frequency-temporal neighborhoods, and (ii) image quality enhancement in the spatiotemporal domain. The architecture sandwiches the Fourier transformation from the frequency domain to the spatial domain between the two aforementioned CNN components, during, both, CNN learning and inference. We propose four methods within our framework, including a Bayesian CNN that produces uncertainty maps indicating the per-voxel (and per-timepoint) confidence in the blood oxygenation level dependent (BOLD) time-series reconstruction. Results on brain R-fMRI show that our CNN framework improves over the state of the art, quantitatively and qualitatively, in terms of the connectivity maps for three cerebral functional networks.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Undersampled reconstruction in resting functional magnetic resonance imaging (R-fMRI) holds the potential to enable higher spatial resolution in brain R-fMRI without increasing scan duration. We propose a novel approach to reconstruct kt undersampled R-fMRI relying on a deep convolutional neural network (CNN) framework. The architecture of our CNN framework comprises a novel scheme for R-fMRI reconstruction that jointly learns two multilayer CNN components for (i) explicitly filling in missing k-space data, using acquired data in frequency-temporal neighborhoods, and (ii) image quality enhancement in the spatiotemporal domain. The architecture sandwiches the Fourier transformation from the frequency domain to the spatial domain between the two aforementioned CNN components, during, both, CNN learning and inference. We propose four methods within our framework, including a Bayesian CNN that produces uncertainty maps indicating the per-voxel (and per-timepoint) confidence in the blood oxygenation level dependent (BOLD) time-series reconstruction. Results on brain R-fMRI show that our CNN framework improves over the state of the art, quantitatively and qualitatively, in terms of the connectivity maps for three cerebral functional networks.",
"fno": "09411966",
"keywords": [
"Biomedical MRI",
"Blood",
"Brain",
"Image Reconstruction",
"Image Resolution",
"Learning Artificial Intelligence",
"Medical Image Processing",
"Neural Nets",
"Neurophysiology",
"Higher Spatial Resolution",
"Scan Duration",
"Kt Undersampled R F MRI",
"Deep Convolutional Neural Network Framework",
"R F MRI Reconstruction",
"Multilayer CNN Components",
"Missing K Space Data",
"Frequency Temporal Neighborhoods",
"Image Quality Enhancement",
"Spatiotemporal Domain",
"Architecture Sandwiches",
"Frequency Domain",
"Spatial Domain",
"Aforementioned CNN Components",
"Inference",
"Bayesian CNN",
"Blood Oxygenation Level Dependent Time Series Reconstruction",
"Brain R F MRI Show",
"Cerebral Functional Networks",
"Bayesian Deep CNN Framework",
"K T Undersampled Resting F MRI",
"Undersampled Reconstruction",
"Functional Magnetic Resonance Imaging",
"Uncertainty",
"Frequency Domain Analysis",
"Memory Management",
"Nonhomogeneous Media",
"Bayes Methods",
"Spatiotemporal Phenomena",
"Pattern Recognition",
"R F MRI Reconstruction",
"K T Undersampling",
"Deep Convolutional Neural Network",
"K Space Filling",
"Image Quality Enhancement",
"Bayesian Modeling",
"Uncertainty"
],
"authors": [
{
"affiliation": "Electrical Engineering, IIT Bombay",
"fullName": "Karan Taneja",
"givenName": "Karan",
"surname": "Taneja",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Electrical Engineering, IIT Bombay",
"fullName": "Prachi H. Kulkarni",
"givenName": "Prachi H.",
"surname": "Kulkarni",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Electrical Engineering, IIT Bombay",
"fullName": "S. N. Merchant",
"givenName": "S. N.",
"surname": "Merchant",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Computer Science and Engineering, IIT Bombay",
"fullName": "Suyash P. Awate",
"givenName": "Suyash P.",
"surname": "Awate",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icpr",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-01-01T00:00:00",
"pubType": "proceedings",
"pages": "8492-8499",
"year": "2021",
"issn": "1051-4651",
"isbn": "978-1-7281-8808-9",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09411952",
"articleId": "1tmhtZPkuMU",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09412720",
"articleId": "1tmk2f27U6A",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccvw/2017/1034/0/1034d056",
"title": "Continuous Gesture Recognition with Hand-Oriented Spatiotemporal Feature",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034d056/12OmNCeaPUg",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccvw/2017/1034/0/1034a518",
"title": "HSCNN: CNN-Based Hyperspectral Image Recovery from Spectrally Undersampled Projections",
"doi": null,
"abstractUrl": "/proceedings-article/iccvw/2017/1034a518/12OmNyUnEFQ",
"parentPublication": {
"id": "proceedings/iccvw/2017/1034/0",
"title": "2017 IEEE International Conference on Computer Vision Workshop (ICCVW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2011/01/ttg2011010026",
"title": "Virtualized Traffic: Reconstructing Traffic Flows from Discrete Spatiotemporal Data",
"doi": null,
"abstractUrl": "/journal/tg/2011/01/ttg2011010026/13rRUwIF6dJ",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvprw/2018/6100/0/610000c066",
"title": "Relating Deep Neural Network Representations to EEG-fMRI Spatiotemporal Dynamics in a Perceptual Decision-Making Task",
"doi": null,
"abstractUrl": "/proceedings-article/cvprw/2018/610000c066/17D45VTRoCX",
"parentPublication": {
"id": "proceedings/cvprw/2018/6100/0",
"title": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/5555/01/09889219",
"title": "Learning Reliable Gradients From Undersampled Circular Light Field for 3D Reconstruction",
"doi": null,
"abstractUrl": "/journal/tg/5555/01/09889219/1GDryH066Lm",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ictai/2022/9744/0/974400b082",
"title": "Deep Spatio-Temporal Method for ADHD Classification Using Resting-State fMRI",
"doi": null,
"abstractUrl": "/proceedings-article/ictai/2022/974400b082/1MrG6YmpXHi",
"parentPublication": {
"id": "proceedings/ictai/2022/9744/0",
"title": "2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/02/08976084",
"title": "Depression Level Prediction Using Deep Spatiotemporal Features and Multilayer Bi-LTSM",
"doi": null,
"abstractUrl": "/journal/ta/2022/02/08976084/1h0VOXTspe8",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/big-data/2019/0858/0/09006340",
"title": "Toward Filament Segmentation Using Deep Neural Networks",
"doi": null,
"abstractUrl": "/proceedings-article/big-data/2019/09006340/1hJss6oYR5m",
"parentPublication": {
"id": "proceedings/big-data/2019/0858/0",
"title": "2019 IEEE International Conference on Big Data (Big Data)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cvpr/2020/7168/0/716800e725",
"title": "A Spatiotemporal Volumetric Interpolation Network for 4D Dynamic Medical Image",
"doi": null,
"abstractUrl": "/proceedings-article/cvpr/2020/716800e725/1m3o6jEDHEY",
"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/bibm/2020/6215/0/09313444",
"title": "Reconstructing Temporal Dynamics of fMRI Time Series via Encoded Contextual Information",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2020/09313444/1qmg0snpieI",
"parentPublication": {
"id": "proceedings/bibm/2020/6215/0",
"title": "2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1uCicNLKjCw",
"title": "2021 2nd International Conference on Big Data and Informatization Education (ICBDIE)",
"acronym": "icbdie",
"groupId": "1837384",
"volume": "0",
"displayVolume": "0",
"year": "2021",
"__typename": "ProceedingType"
},
"article": {
"id": "1uCitLdni9i",
"doi": "10.1109/ICBDIE52740.2021.00129",
"title": "Is Problematic Internet use a risk factor for bipolar disorder—Evidence from Meta-Analysis",
"normalizedTitle": "Is Problematic Internet use a risk factor for bipolar disorder—Evidence from Meta-Analysis",
"abstract": "Objective: Nowadays, bipolar disorder is becoming one of the psychological problems of great concern, and Internet use is becoming more and more popular. Besides, a number of studies have shown a potential link between the two. However, current research has not reached a consistent conclusion about the relation of two aspects and whether problematic Internet use is one of the risk factors of bipolar disorder. Therefore this is the first study aimed to explore whether problematic Internet use is a risk factor of bipolar disorder.Methods: Our meta-analysis followed the guidelines recommended in the PRISMA statement. Two authors independently searched the related studies by means of electronic database (Web of science, ScienceDirect, PubMed, EBSCO, China National Knowledge Infrastructure and WANFANG DATA) using key terms ‘Bipolar disorder’ and ‘problematic internet use’. All chosen articles must match the eligibility standard in this research. Furthermore, our registration number at PROSPERO is: CRD42020175658. The authors used the Jadad Scale to assess the quality of these articles. I<sup>2</sup> statistic and H test assessed the heterogeneity. The results were displayed by the Forest plots graphically. Potential bias was assessed by Funnel plot and Begg’s test. Prevalence rate was meta-analysed. Fixed-effects models were adopted to calculate summary odds ratio (OR) as well as 95% confidence interval (CI).Results: In total, 3 studies were included with 9142 subjects. And we didn't put any special restrictions on the subjects. Overall, problematic Internet use is a risk factor for bipolar disorder. There was no significant heterogenity among researches selected (Summary OR = 3.184, 95% CI: 1.505–6.736, Pheterogeneity >0.05, I<sup>2</sup>= 13.023%). Publication bias was not found across articles.Conclusion: Our meta-analysis based upon 9142 participants indicates that problematic Internet use is a risk factor of bipolar disorder and it should attract enough attention. However, since this is a completely new field, our results will be more accurate if there are more studies in the future.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Objective: Nowadays, bipolar disorder is becoming one of the psychological problems of great concern, and Internet use is becoming more and more popular. Besides, a number of studies have shown a potential link between the two. However, current research has not reached a consistent conclusion about the relation of two aspects and whether problematic Internet use is one of the risk factors of bipolar disorder. Therefore this is the first study aimed to explore whether problematic Internet use is a risk factor of bipolar disorder.Methods: Our meta-analysis followed the guidelines recommended in the PRISMA statement. Two authors independently searched the related studies by means of electronic database (Web of science, ScienceDirect, PubMed, EBSCO, China National Knowledge Infrastructure and WANFANG DATA) using key terms ‘Bipolar disorder’ and ‘problematic internet use’. All chosen articles must match the eligibility standard in this research. Furthermore, our registration number at PROSPERO is: CRD42020175658. The authors used the Jadad Scale to assess the quality of these articles. I<sup>2</sup> statistic and H test assessed the heterogeneity. The results were displayed by the Forest plots graphically. Potential bias was assessed by Funnel plot and Begg’s test. Prevalence rate was meta-analysed. Fixed-effects models were adopted to calculate summary odds ratio (OR) as well as 95% confidence interval (CI).Results: In total, 3 studies were included with 9142 subjects. And we didn't put any special restrictions on the subjects. Overall, problematic Internet use is a risk factor for bipolar disorder. There was no significant heterogenity among researches selected (Summary OR = 3.184, 95% CI: 1.505–6.736, Pheterogeneity >0.05, I<sup>2</sup>= 13.023%). Publication bias was not found across articles.Conclusion: Our meta-analysis based upon 9142 participants indicates that problematic Internet use is a risk factor of bipolar disorder and it should attract enough attention. However, since this is a completely new field, our results will be more accurate if there are more studies in the future.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Objective: Nowadays, bipolar disorder is becoming one of the psychological problems of great concern, and Internet use is becoming more and more popular. Besides, a number of studies have shown a potential link between the two. However, current research has not reached a consistent conclusion about the relation of two aspects and whether problematic Internet use is one of the risk factors of bipolar disorder. Therefore this is the first study aimed to explore whether problematic Internet use is a risk factor of bipolar disorder.Methods: Our meta-analysis followed the guidelines recommended in the PRISMA statement. Two authors independently searched the related studies by means of electronic database (Web of science, ScienceDirect, PubMed, EBSCO, China National Knowledge Infrastructure and WANFANG DATA) using key terms ‘Bipolar disorder’ and ‘problematic internet use’. All chosen articles must match the eligibility standard in this research. Furthermore, our registration number at PROSPERO is: CRD42020175658. The authors used the Jadad Scale to assess the quality of these articles. I2 statistic and H test assessed the heterogeneity. The results were displayed by the Forest plots graphically. Potential bias was assessed by Funnel plot and Begg’s test. Prevalence rate was meta-analysed. Fixed-effects models were adopted to calculate summary odds ratio (OR) as well as 95% confidence interval (CI).Results: In total, 3 studies were included with 9142 subjects. And we didn't put any special restrictions on the subjects. Overall, problematic Internet use is a risk factor for bipolar disorder. There was no significant heterogenity among researches selected (Summary OR = 3.184, 95% CI: 1.505–6.736, Pheterogeneity >0.05, I2= 13.023%). Publication bias was not found across articles.Conclusion: Our meta-analysis based upon 9142 participants indicates that problematic Internet use is a risk factor of bipolar disorder and it should attract enough attention. However, since this is a completely new field, our results will be more accurate if there are more studies in the future.",
"fno": "387000a540",
"keywords": [
"Graph Theory",
"Human Factors",
"Internet",
"Medical Disorders",
"Psychology",
"Risk Management",
"Statistical Testing",
"Risk Factor",
"Meta Analysis",
"Bipolar Disorder",
"Problematic Internet Use",
"Jadad Scale",
"Statistic Test",
"Forest Plots Graph",
"Knowledge Engineering",
"Databases",
"Sociology",
"Psychology",
"Search Problems",
"Internet",
"Reliability",
"Problematic Internet",
"Risk Factor",
"Bipolar Disorder",
"Meta Analysis"
],
"authors": [
{
"affiliation": "Nanchang University,School of Public Administration,Nanchang,China",
"fullName": "Xinyi Pan",
"givenName": "Xinyi",
"surname": "Pan",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Nanchang University,School of Public Administration,Nanchang,China",
"fullName": "Ruochen Wang",
"givenName": "Ruochen",
"surname": "Wang",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "icbdie",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2021-04-01T00:00:00",
"pubType": "proceedings",
"pages": "540-544",
"year": "2021",
"issn": null,
"isbn": "978-1-6654-3870-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "387000a536",
"articleId": "1uCixqtxHPO",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "387000a545",
"articleId": "1uCitSHL2WQ",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/fg/2013/5545/0/06553789",
"title": "Automatic behavior descriptors for psychological disorder analysis",
"doi": null,
"abstractUrl": "/proceedings-article/fg/2013/06553789/12OmNwMob8L",
"parentPublication": {
"id": "proceedings/fg/2013/5545/0",
"title": "2013 10th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/acit-csi/2015/9642/0/9642a305",
"title": "Fuzzy Logic Controller Applied to Brain Emotional Learning Based Model of Bipolar Disorder II",
"doi": null,
"abstractUrl": "/proceedings-article/acit-csi/2015/9642a305/12OmNzSyCfs",
"parentPublication": {
"id": "proceedings/acit-csi/2015/9642/0",
"title": "2015 3rd International Conference on Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence (ACIT-CSI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/bibm/2018/5488/0/08621255",
"title": "Forecasting depressive relapse in Bipolar Disorder from clinical data",
"doi": null,
"abstractUrl": "/proceedings-article/bibm/2018/08621255/17D45XeKgna",
"parentPublication": {
"id": "proceedings/bibm/2018/5488/0",
"title": "2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2022/04/09835028",
"title": "A Multimodal Approach for Mania Level Prediction in Bipolar Disorder",
"doi": null,
"abstractUrl": "/journal/ta/2022/04/09835028/1FbOwYwgbjW",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/aciiw/2019/3891/0/08925023",
"title": "Audio Visual Multimodal Classification of Bipolar Disorder Episodes",
"doi": null,
"abstractUrl": "/proceedings-article/aciiw/2019/08925023/1fHFatdsDJK",
"parentPublication": {
"id": "proceedings/aciiw/2019/3891/0",
"title": "2019 8th International Conference on Affective Computing and Intelligent Interaction Workshops and Demos (ACIIW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vrw/2020/6532/0/09090455",
"title": "Embodiment for the Difference: A VR Experience of Bipolar Disorder",
"doi": null,
"abstractUrl": "/proceedings-article/vrw/2020/09090455/1jIxj5Aaz3G",
"parentPublication": {
"id": "proceedings/vrw/2020/6532/0",
"title": "2020 IEEE Conference on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tb/2021/06/09072573",
"title": "SNP Data Science for Classification of Bipolar Disorder I and Bipolar Disorder II",
"doi": null,
"abstractUrl": "/journal/tb/2021/06/09072573/1jbiLLMJd9C",
"parentPublication": {
"id": "trans/tb",
"title": "IEEE/ACM Transactions on Computational Biology and Bioinformatics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/cbms/2020/9429/0/942900a388",
"title": "An m-Health Application for Remote Monitoring of People with Bipolar Disorder through Digital Phenotyping and Smartphone Dependency",
"doi": null,
"abstractUrl": "/proceedings-article/cbms/2020/942900a388/1mLMh8xW0uY",
"parentPublication": {
"id": "proceedings/cbms/2020/9429/0",
"title": "2020 IEEE 33rd International Symposium on Computer-Based Medical Systems (CBMS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/ta/2023/01/09309062",
"title": "A Multi-Modal Stacked Ensemble Model for Bipolar Disorder Classification",
"doi": null,
"abstractUrl": "/journal/ta/2023/01/09309062/1pQE4THcCZO",
"parentPublication": {
"id": "trans/ta",
"title": "IEEE Transactions on Affective Computing",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iri/2021/3875/0/387500a228",
"title": "LiBRA: A Linguistic Bipolar Disorder Recognition Approach",
"doi": null,
"abstractUrl": "/proceedings-article/iri/2021/387500a228/1yBG7Nk1zYk",
"parentPublication": {
"id": "proceedings/iri/2021/3875/0",
"title": "2021 IEEE 22nd International Conference on Information Reuse and Integration for Data Science (IRI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "12OmNASraww",
"title": "2009 IEEE Pacific Visualization Symposium",
"acronym": "pacificvis",
"groupId": "1001657",
"volume": "0",
"displayVolume": "0",
"year": "2009",
"__typename": "ProceedingType"
},
"article": {
"id": "12OmNybfr7N",
"doi": "10.1109/PACIFICVIS.2009.4906837",
"title": "Toward effective insight management in visual analytics systems",
"normalizedTitle": "Toward effective insight management in visual analytics systems",
"abstract": "Although significant progress has been made toward effective insight discovery in visual sense making approaches, there is a lack of effective and efficient approaches to manage the large amounts of insights discovered. In this paper, we propose a systematic approach to leverage this problem around the concept of facts. Facts refer to patterns, relationships, or anomalies extracted from data under analysis. They are the direct products of visual exploration and permit construction of insights together with user's mental model and evaluation. Different from the mental model, the type of facts that can be discovered from data is predictable and application-independent. Thus it is possible to develop a general Fact Management Framework (FMF) to allow visualization users to effectively and efficiently annotate, browse, retrieve, associate, and exchange facts. Since facts are essential components of insights, it will be feasible to extend FMF to effective insight management in a variety of visual analytics approaches. Toward this goal, we first construct a fact taxonomy that categorizes various facts in multidimensional data and captures their essential attributes through extensive literature survey and user studies. We then propose a conceptual framework of fact management based upon this fact taxonomy. A concrete scenario of visual sense making on real data sets illustrates how this FMF will work.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Although significant progress has been made toward effective insight discovery in visual sense making approaches, there is a lack of effective and efficient approaches to manage the large amounts of insights discovered. In this paper, we propose a systematic approach to leverage this problem around the concept of facts. Facts refer to patterns, relationships, or anomalies extracted from data under analysis. They are the direct products of visual exploration and permit construction of insights together with user's mental model and evaluation. Different from the mental model, the type of facts that can be discovered from data is predictable and application-independent. Thus it is possible to develop a general Fact Management Framework (FMF) to allow visualization users to effectively and efficiently annotate, browse, retrieve, associate, and exchange facts. Since facts are essential components of insights, it will be feasible to extend FMF to effective insight management in a variety of visual analytics approaches. Toward this goal, we first construct a fact taxonomy that categorizes various facts in multidimensional data and captures their essential attributes through extensive literature survey and user studies. We then propose a conceptual framework of fact management based upon this fact taxonomy. A concrete scenario of visual sense making on real data sets illustrates how this FMF will work.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Although significant progress has been made toward effective insight discovery in visual sense making approaches, there is a lack of effective and efficient approaches to manage the large amounts of insights discovered. In this paper, we propose a systematic approach to leverage this problem around the concept of facts. Facts refer to patterns, relationships, or anomalies extracted from data under analysis. They are the direct products of visual exploration and permit construction of insights together with user's mental model and evaluation. Different from the mental model, the type of facts that can be discovered from data is predictable and application-independent. Thus it is possible to develop a general Fact Management Framework (FMF) to allow visualization users to effectively and efficiently annotate, browse, retrieve, associate, and exchange facts. Since facts are essential components of insights, it will be feasible to extend FMF to effective insight management in a variety of visual analytics approaches. Toward this goal, we first construct a fact taxonomy that categorizes various facts in multidimensional data and captures their essential attributes through extensive literature survey and user studies. We then propose a conceptual framework of fact management based upon this fact taxonomy. A concrete scenario of visual sense making on real data sets illustrates how this FMF will work.",
"fno": "04906837",
"keywords": [],
"authors": [
{
"affiliation": "Department of Computer Science, UNC Charlotte, USA",
"fullName": "Yang Chen",
"givenName": null,
"surname": "Yang Chen",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, UNC Charlotte, USA",
"fullName": "Jing Yang",
"givenName": null,
"surname": "Jing Yang",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Department of Computer Science, UNC Charlotte, USA",
"fullName": "William Ribarsky",
"givenName": "William",
"surname": "Ribarsky",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "pacificvis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2009-04-01T00:00:00",
"pubType": "proceedings",
"pages": "49-56",
"year": "2009",
"issn": null,
"isbn": "978-1-4244-4404-5",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "04906836",
"articleId": "12OmNviHKhq",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "04906838",
"articleId": "12OmNqyUUCN",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/vast/2015/9783/0/07347648",
"title": "Visual analytics for detecting communication patterns",
"doi": null,
"abstractUrl": "/proceedings-article/vast/2015/07347648/12OmNrnJ6WY",
"parentPublication": {
"id": "proceedings/vast/2015/9783/0",
"title": "2015 IEEE Conference on Visual Analytics Science and Technology (VAST)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iv/2013/5049/0/5049a227",
"title": "Toward Visual Analytics of Unlinked Documents by Textual Analysis and Network Visualization",
"doi": null,
"abstractUrl": "/proceedings-article/iv/2013/5049a227/12OmNxecRV0",
"parentPublication": {
"id": "proceedings/iv/2013/5049/0",
"title": "2013 17th International Conference on Information Visualisation",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/02/mcg2009020014",
"title": "Defining Insight for Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2009/02/mcg2009020014/13rRUwh80JN",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2006/06/v1511",
"title": "An Insight-Based Longitudinal Study of Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2006/06/v1511/13rRUxBJhvl",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/co/2013/07/mco2013070030",
"title": "Visual Analytics Support for Intelligence Analysis",
"doi": null,
"abstractUrl": "/magazine/co/2013/07/mco2013070030/13rRUxD9h0P",
"parentPublication": {
"id": "mags/co",
"title": "Computer",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2009/02/mcg2009020084",
"title": "Demystifying Visual Analytics",
"doi": null,
"abstractUrl": "/magazine/cg/2009/02/mcg2009020084/13rRUy3gn3z",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2015/03/06908006",
"title": "Personal Visualization and Personal Visual Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2015/03/06908006/13rRUyYBlgA",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2014/12/06876049",
"title": "Progressive Visual Analytics: User-Driven Visual Exploration of In-Progress Analytics",
"doi": null,
"abstractUrl": "/journal/tg/2014/12/06876049/13rRUyogGAd",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/beliv/2022/9629/0/962900a047",
"title": "How Personality and Visual Channels Affect Insight Generation",
"doi": null,
"abstractUrl": "/proceedings-article/beliv/2022/962900a047/1J6hRsejysE",
"parentPublication": {
"id": "proceedings/beliv/2022/9629/0",
"title": "2022 IEEE Evaluation and Beyond - Methodological Approaches for Visualization (BELIV)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2022/12/09511808",
"title": "VisInReport: Complementing Visual Discourse Analytics Through Personalized Insight Reports",
"doi": null,
"abstractUrl": "/journal/tg/2022/12/09511808/1vYRHccYKDS",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1qRNrlo577W",
"title": "2020 IEEE Visualization Conference (VIS)",
"acronym": "vis",
"groupId": "1001944",
"volume": "0",
"displayVolume": "0",
"year": "2020",
"__typename": "ProceedingType"
},
"article": {
"id": "1qROmjyLLmE",
"doi": "10.1109/VIS47514.2020.00041",
"title": "Characterizing Automated Data Insights",
"normalizedTitle": "Characterizing Automated Data Insights",
"abstract": "Many researchers have explored tools that aim to recommend data insights to users. These tools automatically communicate a rich diversity of data insights and offer such insights for many different purposes. However, there is a lack of structured understanding concerning what researchers of these tools mean by \"insight\" and what tasks in the analysis workflow these tools aim to support. We conducted a systematic review of existing systems that seek to recommend data insights. Grounded in the review, we propose 12 types of automated insights and four purposes of automating insights. We further discuss the design opportunities emerged from our analysis.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Many researchers have explored tools that aim to recommend data insights to users. These tools automatically communicate a rich diversity of data insights and offer such insights for many different purposes. However, there is a lack of structured understanding concerning what researchers of these tools mean by \"insight\" and what tasks in the analysis workflow these tools aim to support. We conducted a systematic review of existing systems that seek to recommend data insights. Grounded in the review, we propose 12 types of automated insights and four purposes of automating insights. We further discuss the design opportunities emerged from our analysis.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Many researchers have explored tools that aim to recommend data insights to users. These tools automatically communicate a rich diversity of data insights and offer such insights for many different purposes. However, there is a lack of structured understanding concerning what researchers of these tools mean by \"insight\" and what tasks in the analysis workflow these tools aim to support. We conducted a systematic review of existing systems that seek to recommend data insights. Grounded in the review, we propose 12 types of automated insights and four purposes of automating insights. We further discuss the design opportunities emerged from our analysis.",
"fno": "801400a171",
"keywords": [
"Data Analysis",
"Automated Data Insights",
"Analysis Workflow",
"Systematics",
"Automation",
"Conferences",
"Data Visualization",
"Tools",
"Task Analysis",
"Human Centered Computing",
"Visualization",
"Visualization Theory",
"Concepts And Paradigms"
],
"authors": [
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Po-Ming Law",
"givenName": "Po-Ming",
"surname": "Law",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "Alex Endert",
"givenName": "Alex",
"surname": "Endert",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Georgia Institute of Technology",
"fullName": "John Stasko",
"givenName": "John",
"surname": "Stasko",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "vis",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2020-10-01T00:00:00",
"pubType": "proceedings",
"pages": "171-175",
"year": "2020",
"issn": null,
"isbn": "978-1-7281-8014-4",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "801400a166",
"articleId": "1qROlgPEUow",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "801400a176",
"articleId": "1qROcCF5NiU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/hicss/2016/5670/0/5670b830",
"title": "The Use of Social Media Tools in the Product Life Cycle Phases: A Systematic Literature Review",
"doi": null,
"abstractUrl": "/proceedings-article/hicss/2016/5670b830/12OmNBlXsbf",
"parentPublication": {
"id": "proceedings/hicss/2016/5670/0",
"title": "2016 49th Hawaii International Conference on System Sciences (HICSS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ast/2012/1821/0/06228988",
"title": "Benefits and limitations of automated software testing: Systematic literature review and practitioner survey",
"doi": null,
"abstractUrl": "/proceedings-article/ast/2012/06228988/12OmNwMFMiC",
"parentPublication": {
"id": "proceedings/ast/2012/1821/0",
"title": "Automation of Software Test, Second International Workshop on",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icalt/2018/6049/0/604901a227",
"title": "Improving Blended Learning in Higher Education Through the Synergy between Learning Design and Learning Analytics",
"doi": null,
"abstractUrl": "/proceedings-article/icalt/2018/604901a227/12OmNxUv6iC",
"parentPublication": {
"id": "proceedings/icalt/2018/6049/0",
"title": "2018 IEEE 18th International Conference on Advanced Learning Technologies (ICALT)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/se4science/2018/5748/0/574801a020",
"title": "(Automated) Literature Analysis - Threats and Experiences",
"doi": null,
"abstractUrl": "/proceedings-article/se4science/2018/574801a020/13bd1fHrlS6",
"parentPublication": {
"id": "proceedings/se4science/2018/5748/0",
"title": "2018 IEEE/ACM 13th International Workshop on Software Engineering for Science (SE4Science)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cg/2015/04/mcg2015040028",
"title": "Characterizing Visualization Insights from Quantified Selfers' Personal Data Presentations",
"doi": null,
"abstractUrl": "/magazine/cg/2015/04/mcg2015040028/13rRUxCRFQl",
"parentPublication": {
"id": "mags/cg",
"title": "IEEE Computer Graphics and Applications",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/re/2019/3912/0/391200a187",
"title": "Automated Recommendation of Software Refactorings Based on Feature Requests",
"doi": null,
"abstractUrl": "/proceedings-article/re/2019/391200a187/1fHls74HLnG",
"parentPublication": {
"id": "proceedings/re/2019/3912/0",
"title": "2019 IEEE 27th International Requirements Engineering Conference (RE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/cs/2020/05/09171933",
"title": "Hands-on with IBM Visual Insights",
"doi": null,
"abstractUrl": "/magazine/cs/2020/05/09171933/1mrN3IXA1ji",
"parentPublication": {
"id": "mags/cs",
"title": "Computing in Science & Engineering",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/ase/2020/6768/0/676800a919",
"title": "Automated Third-Party Library Detection for Android Applications: Are We There Yet?",
"doi": null,
"abstractUrl": "/proceedings-article/ase/2020/676800a919/1pP3JDAnYYw",
"parentPublication": {
"id": "proceedings/ase/2020/6768/0",
"title": "2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/vis/2020/8014/0/801400a181",
"title": "What are Data Insights to Professional Visualization Users?",
"doi": null,
"abstractUrl": "/proceedings-article/vis/2020/801400a181/1qRO9q8X6dq",
"parentPublication": {
"id": "proceedings/vis/2020/8014/0",
"title": "2020 IEEE Visualization Conference (VIS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/apsec/2020/9553/0/955300a071",
"title": "Understanding the Non-Repairability Factors of Automated Program Repair Techniques",
"doi": null,
"abstractUrl": "/proceedings-article/apsec/2020/955300a071/1rCgEuLqk5q",
"parentPublication": {
"id": "proceedings/apsec/2020/9553/0",
"title": "2020 27th Asia-Pacific Software Engineering Conference (APSEC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1EygwcmhW36",
"title": "2022 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)",
"acronym": "euros&pw",
"groupId": "1820965",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1EygBdtMThm",
"doi": "10.1109/EuroSPW55150.2022.00059",
"title": "Automatic Challenge Generation for Hands-on Cybersecurity Training",
"normalizedTitle": "Automatic Challenge Generation for Hands-on Cybersecurity Training",
"abstract": "Just reading the news is enough to understand how critical cybersecurity and cybersecurity-education have become. Many job positions remain unfilled due to a shortage of a skilled workforce, and universities have opened courses on cybersecurity-related topics to keep up with market demands. In turn, educators are reshaping their educational material and activities to cover both the standard theory of the field and the practice. However, organizing hands-on cybersecurity training is laborious and time consuming. We present Chad, a tool we developed to support instructors in the development and deployment of practical cybersecurity exercises. Chad, an open-source project written in Python, allows teachers to generate multiple different instances of an exercise, guaranteeing that they all share the same difficulty and require the same knowledge to be solved. Our tool also supports the testing of generated exercises, and their deployment, by leveraging technologies like Docker, Wireguard and iptables. Chad has been integrated with Github classroom and field-tested, during a.y. 2021/2022, in the context of a university course on binary analysis. However, its adoption is not limited to such topics or formal education. Indeed, the Github repository contains examples of reversing-engineering challenges for Linux and Windows, and a simple web challenge.",
"abstracts": [
{
"abstractType": "Regular",
"content": "Just reading the news is enough to understand how critical cybersecurity and cybersecurity-education have become. Many job positions remain unfilled due to a shortage of a skilled workforce, and universities have opened courses on cybersecurity-related topics to keep up with market demands. In turn, educators are reshaping their educational material and activities to cover both the standard theory of the field and the practice. However, organizing hands-on cybersecurity training is laborious and time consuming. We present Chad, a tool we developed to support instructors in the development and deployment of practical cybersecurity exercises. Chad, an open-source project written in Python, allows teachers to generate multiple different instances of an exercise, guaranteeing that they all share the same difficulty and require the same knowledge to be solved. Our tool also supports the testing of generated exercises, and their deployment, by leveraging technologies like Docker, Wireguard and iptables. Chad has been integrated with Github classroom and field-tested, during a.y. 2021/2022, in the context of a university course on binary analysis. However, its adoption is not limited to such topics or formal education. Indeed, the Github repository contains examples of reversing-engineering challenges for Linux and Windows, and a simple web challenge.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "Just reading the news is enough to understand how critical cybersecurity and cybersecurity-education have become. Many job positions remain unfilled due to a shortage of a skilled workforce, and universities have opened courses on cybersecurity-related topics to keep up with market demands. In turn, educators are reshaping their educational material and activities to cover both the standard theory of the field and the practice. However, organizing hands-on cybersecurity training is laborious and time consuming. We present Chad, a tool we developed to support instructors in the development and deployment of practical cybersecurity exercises. Chad, an open-source project written in Python, allows teachers to generate multiple different instances of an exercise, guaranteeing that they all share the same difficulty and require the same knowledge to be solved. Our tool also supports the testing of generated exercises, and their deployment, by leveraging technologies like Docker, Wireguard and iptables. Chad has been integrated with Github classroom and field-tested, during a.y. 2021/2022, in the context of a university course on binary analysis. However, its adoption is not limited to such topics or formal education. Indeed, the Github repository contains examples of reversing-engineering challenges for Linux and Windows, and a simple web challenge.",
"fno": "956000a496",
"keywords": [
"Computer Science Education",
"Educational Courses",
"Security Of Data",
"Automatic Challenge Generation",
"Hands On Cybersecurity Training",
"Cybersecurity Education",
"Skilled Workforce",
"Cybersecurity Related Topics",
"Educational Material",
"Chad",
"Practical Cybersecurity Exercises",
"Open Source Project",
"University Course",
"Formal Education",
"Github Classroom",
"Training",
"Linux",
"Writing",
"Virtual Private Networks",
"Computer Security",
"Computer Crime",
"Standards",
"Cybersecurity Education",
"Capture The Flag",
"Hands On Activities"
],
"authors": [
{
"affiliation": "AlgoWATT,Italy",
"fullName": "Matteo Benzi",
"givenName": "Matteo",
"surname": "Benzi",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Genoa,DIBRIS,Italy",
"fullName": "Giovanni Lagorio",
"givenName": "Giovanni",
"surname": "Lagorio",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "University of Genoa,DIBRIS,Italy",
"fullName": "Marina Ribaudo",
"givenName": "Marina",
"surname": "Ribaudo",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "euros&pw",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-06-01T00:00:00",
"pubType": "proceedings",
"pages": "496-503",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-9560-8",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "956000a486",
"articleId": "1EygAWzwfV6",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "956000a504",
"articleId": "1Eygz0D90gU",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/inciscos/2017/2644/0/2644a253",
"title": "A Comprehensive Cybersecurity Audit Model to Improve Cybersecurity Assurance: The CyberSecurity Audit Model (CSAM)",
"doi": null,
"abstractUrl": "/proceedings-article/inciscos/2017/2644a253/12OmNxGj9Yz",
"parentPublication": {
"id": "proceedings/inciscos/2017/2644/0",
"title": "2017 International Conference on Information Systems and Computer Science (INCISCOS)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/iccac/2015/9566/0/5636a302",
"title": "Teaching and Training Cybersecurity as a Cloud Service",
"doi": null,
"abstractUrl": "/proceedings-article/iccac/2015/5636a302/12OmNy3Agsm",
"parentPublication": {
"id": "proceedings/iccac/2015/9566/0",
"title": "2015 International Conference on Cloud and Autonomic Computing (ICCAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2017/03/msp2017030090",
"title": "Cybersecurity Education and Assessment in EDURange",
"doi": null,
"abstractUrl": "/magazine/sp/2017/03/msp2017030090/13rRUILtJk6",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/lt/2015/04/07089256",
"title": "Teaching Cybersecurity Using the Cloud",
"doi": null,
"abstractUrl": "/journal/lt/2015/04/07089256/13rRUxBrGcD",
"parentPublication": {
"id": "trans/lt",
"title": "IEEE Transactions on Learning Technologies",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "mags/sp/2018/02/msp2018020091",
"title": "Individualizing Cybersecurity Lab Exercises with Labtainers",
"doi": null,
"abstractUrl": "/magazine/sp/2018/02/msp2018020091/13rRUxC0SCq",
"parentPublication": {
"id": "mags/sp",
"title": "IEEE Security & Privacy",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/csci/2021/5841/0/584100a716",
"title": "Developing Cybersecurity Workforce: Introducing CyberSec Labs for Industry Standard Cybersecurity Training",
"doi": null,
"abstractUrl": "/proceedings-article/csci/2021/584100a716/1EpLyipUapW",
"parentPublication": {
"id": "proceedings/csci/2021/5841/0",
"title": "2021 International Conference on Computational Science and Computational Intelligence (CSCI)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2022/6244/0/09962663",
"title": "Designing Adaptive Cybersecurity Hands-on Training",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2022/09962663/1IHomR3XhLy",
"parentPublication": {
"id": "proceedings/fie/2022/6244/0",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09018081",
"title": "Conceptual Model of Visual Analytics for Hands-on Cybersecurity Training",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09018081/1hN4BNhncqc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637052",
"title": "Toolset for Collecting Shell Commands and Its Application in Hands-on Cybersecurity Training",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637052/1zuwpRwAnFS",
"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/09637252",
"title": "Reinforcing Cybersecurity Hands-on Training With Adaptive Learning",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637252/1zuwqAepmPS",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
{
"proceeding": {
"id": "1IHnB5FtCQ8",
"title": "2022 IEEE Frontiers in Education Conference (FIE)",
"acronym": "fie",
"groupId": "1000297",
"volume": "0",
"displayVolume": "0",
"year": "2022",
"__typename": "ProceedingType"
},
"article": {
"id": "1IHomR3XhLy",
"doi": "10.1109/FIE56618.2022.9962663",
"title": "Designing Adaptive Cybersecurity Hands-on Training",
"normalizedTitle": "Designing Adaptive Cybersecurity Hands-on Training",
"abstract": "This Research To Practice Full Paper presents an instructor guide and a tool to improve the creation of cybersecurity hands-on training with adaptive learning support. Adaptive learning uses students' performance and skills to assign suitable tasks to improve their learning experience. While it is well-established in many domains, it is rarely used in operating systems, networking, and cybersecurity. In this paper, we improve and present how to ease the creation and optimization process of adaptive hands-on training by instructors. To the best of our knowledge, this paper is one of the first works investigating the process of creating cybersecurity training with adaptive learning. The training uses metrics such as pre-training assessment and performance during the previous tasks in training to assign suitable tasks for each student. With the help of the developed tool, we demonstrate how metrics settings influence the students' transitions between training tasks. The instructors can easily visualize students' transitions throughout the training. This approach helps the instructors adapt the metrics to predict students' transitions between tasks for each training session. The results from performed simulations show that our tool might increase the efficiency of the adaptive training and students' experience even more. Using the experience from the simulations and past training sessions, we propose the design process for the whole creation of adaptive training. This design process is general enough to be adopted by other domains such as operating systems and networking that may use adaptive learning techniques for their hands-on assignments. We have released the tool and all the software components under an open-source license, so other instructors can freely use and adopt them.",
"abstracts": [
{
"abstractType": "Regular",
"content": "This Research To Practice Full Paper presents an instructor guide and a tool to improve the creation of cybersecurity hands-on training with adaptive learning support. Adaptive learning uses students' performance and skills to assign suitable tasks to improve their learning experience. While it is well-established in many domains, it is rarely used in operating systems, networking, and cybersecurity. In this paper, we improve and present how to ease the creation and optimization process of adaptive hands-on training by instructors. To the best of our knowledge, this paper is one of the first works investigating the process of creating cybersecurity training with adaptive learning. The training uses metrics such as pre-training assessment and performance during the previous tasks in training to assign suitable tasks for each student. With the help of the developed tool, we demonstrate how metrics settings influence the students' transitions between training tasks. The instructors can easily visualize students' transitions throughout the training. This approach helps the instructors adapt the metrics to predict students' transitions between tasks for each training session. The results from performed simulations show that our tool might increase the efficiency of the adaptive training and students' experience even more. Using the experience from the simulations and past training sessions, we propose the design process for the whole creation of adaptive training. This design process is general enough to be adopted by other domains such as operating systems and networking that may use adaptive learning techniques for their hands-on assignments. We have released the tool and all the software components under an open-source license, so other instructors can freely use and adopt them.",
"__typename": "ArticleAbstractType"
}
],
"normalizedAbstract": "This Research To Practice Full Paper presents an instructor guide and a tool to improve the creation of cybersecurity hands-on training with adaptive learning support. Adaptive learning uses students' performance and skills to assign suitable tasks to improve their learning experience. While it is well-established in many domains, it is rarely used in operating systems, networking, and cybersecurity. In this paper, we improve and present how to ease the creation and optimization process of adaptive hands-on training by instructors. To the best of our knowledge, this paper is one of the first works investigating the process of creating cybersecurity training with adaptive learning. The training uses metrics such as pre-training assessment and performance during the previous tasks in training to assign suitable tasks for each student. With the help of the developed tool, we demonstrate how metrics settings influence the students' transitions between training tasks. The instructors can easily visualize students' transitions throughout the training. This approach helps the instructors adapt the metrics to predict students' transitions between tasks for each training session. The results from performed simulations show that our tool might increase the efficiency of the adaptive training and students' experience even more. Using the experience from the simulations and past training sessions, we propose the design process for the whole creation of adaptive training. This design process is general enough to be adopted by other domains such as operating systems and networking that may use adaptive learning techniques for their hands-on assignments. We have released the tool and all the software components under an open-source license, so other instructors can freely use and adopt them.",
"fno": "09962663",
"keywords": [
"Computer Aided Instruction",
"Computer Science Education",
"Data Visualisation",
"Learning Artificial Intelligence",
"Public Domain Software",
"Security Of Data",
"Teaching",
"Adaptive Cybersecurity Hands On Training Design",
"Adaptive Learning Support",
"Hands On Assignment",
"Instructors",
"Learning Experience",
"Open Source License",
"Operating Systems",
"Pretraining Assessment",
"Student Experience",
"Training Session",
"Training",
"Measurement",
"Adaptive Learning",
"Adaptation Models",
"Visualization",
"Operating Systems",
"Task Analysis",
"Adaptive Learning",
"Cybersecurity",
"Evaluation",
"Tool",
"Tutor Authoring",
"Tutor Model"
],
"authors": [
{
"affiliation": "Masaryk University,Brno,Czech Republic",
"fullName": "Pavel Seda",
"givenName": "Pavel",
"surname": "Seda",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Masaryk University,Brno,Czech Republic",
"fullName": "Jan Vykopal",
"givenName": "Jan",
"surname": "Vykopal",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Masaryk University,Brno,Czech Republic",
"fullName": "Pavel Čeleda",
"givenName": "Pavel",
"surname": "Čeleda",
"__typename": "ArticleAuthorType"
},
{
"affiliation": "Masaryk University,Brno,Czech Republic",
"fullName": "Igor Ignác",
"givenName": "Igor",
"surname": "Ignác",
"__typename": "ArticleAuthorType"
}
],
"idPrefix": "fie",
"isOpenAccess": false,
"showRecommendedArticles": true,
"showBuyMe": true,
"hasPdf": true,
"pubDate": "2022-10-01T00:00:00",
"pubType": "proceedings",
"pages": "1-8",
"year": "2022",
"issn": null,
"isbn": "978-1-6654-6244-0",
"notes": null,
"notesType": null,
"__typename": "ArticleType"
},
"webExtras": [],
"adjacentArticles": {
"previous": {
"fno": "09962713",
"articleId": "1IHo39h14Ck",
"__typename": "AdjacentArticleType"
},
"next": {
"fno": "09962418",
"articleId": "1IHnH6eQDUk",
"__typename": "AdjacentArticleType"
},
"__typename": "AdjacentArticlesType"
},
"recommendedArticles": [
{
"id": "proceedings/iccac/2015/9566/0/5636a302",
"title": "Teaching and Training Cybersecurity as a Cloud Service",
"doi": null,
"abstractUrl": "/proceedings-article/iccac/2015/5636a302/12OmNy3Agsm",
"parentPublication": {
"id": "proceedings/iccac/2015/9566/0",
"title": "2015 International Conference on Cloud and Autonomic Computing (ICCAC)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2018/1174/0/08658855",
"title": "Improving student learning performance in a virtual hands-on lab system in cybersecurity education",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2018/08658855/18j9fcveLoQ",
"parentPublication": {
"id": "proceedings/fie/2018/1174/0",
"title": "2018 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euros&pw/2022/9560/0/956000a496",
"title": "Automatic Challenge Generation for Hands-on Cybersecurity Training",
"doi": null,
"abstractUrl": "/proceedings-article/euros&pw/2022/956000a496/1EygBdtMThm",
"parentPublication": {
"id": "proceedings/euros&pw/2022/9560/0",
"title": "2022 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euros&pw/2022/9560/0/956000a454",
"title": "The Importance of the Job Role in Social Media Cybersecurity Training",
"doi": null,
"abstractUrl": "/proceedings-article/euros&pw/2022/956000a454/1EygFt1cLF6",
"parentPublication": {
"id": "proceedings/euros&pw/2022/9560/0",
"title": "2022 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/euros&pw/2019/3026/0/302600a067",
"title": "Realistic Cybersecurity Training via Scenario Progression Management",
"doi": null,
"abstractUrl": "/proceedings-article/euros&pw/2019/302600a067/1cJ7c3yDnQ4",
"parentPublication": {
"id": "proceedings/euros&pw/2019/3026/0",
"title": "2019 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/icnp/2019/2700/0/08888060",
"title": "Powering Hands-on Cybersecurity Practices with Cloud Computing",
"doi": null,
"abstractUrl": "/proceedings-article/icnp/2019/08888060/1ezRKpZSmQg",
"parentPublication": {
"id": "proceedings/icnp/2019/2700/0",
"title": "2019 IEEE 27th International Conference on Network Protocols (ICNP)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "trans/tg/2021/08/09018081",
"title": "Conceptual Model of Visual Analytics for Hands-on Cybersecurity Training",
"doi": null,
"abstractUrl": "/journal/tg/2021/08/09018081/1hN4BNhncqc",
"parentPublication": {
"id": "trans/tg",
"title": "IEEE Transactions on Visualization & Computer Graphics",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
},
{
"id": "proceedings/fie/2021/3851/0/09637180",
"title": "Scalable Learning Environments for Teaching Cybersecurity Hands-on",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637180/1zuvOmgSO6Q",
"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/09637052",
"title": "Toolset for Collecting Shell Commands and Its Application in Hands-on Cybersecurity Training",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637052/1zuwpRwAnFS",
"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/09637252",
"title": "Reinforcing Cybersecurity Hands-on Training With Adaptive Learning",
"doi": null,
"abstractUrl": "/proceedings-article/fie/2021/09637252/1zuwqAepmPS",
"parentPublication": {
"id": "proceedings/fie/2021/3851/0",
"title": "2021 IEEE Frontiers in Education Conference (FIE)",
"__typename": "ParentPublication"
},
"__typename": "RecommendedArticleType"
}
],
"articleVideos": []
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.