Image inpainting is a fundamental problem in image processing and has many applications [1] and [2], motivated by the recent tight frame based method on image restoration in either the image or the domain transformation. In this work, we present an inpainting model based on tixotrop non-Newtonian ‡uids [3] for damaged wavelet coe¢cients. The advantage of this model is to make a bene…t from the smoothing model and correct the lying out of the contours by putting them more clearly. Experimental results using our model show that better inpainting quality can be achieved with much less computing time.
{"title":"A Wavelet Inpainting by a Tixotrop Model","authors":"M. Hadji, M. Maouni, F. Z. Nouri","doi":"10.1109/IV.2010.96","DOIUrl":"https://doi.org/10.1109/IV.2010.96","url":null,"abstract":"Image inpainting is a fundamental problem in image processing and has many applications [1] and [2], motivated by the recent tight frame based method on image restoration in either the image or the domain transformation. In this work, we present an inpainting model based on tixotrop non-Newtonian ‡uids [3] for damaged wavelet coe¢cients. The advantage of this model is to make a bene…t from the smoothing model and correct the lying out of the contours by putting them more clearly. Experimental results using our model show that better inpainting quality can be achieved with much less computing time.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132467764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we present an approach to automatic generation of GUI for browsing of RDF data based on observation of existing forms and their adaptation to available RDF graphs. The objective of such an approach is the rapid prototyping of forms and their associated queries by exploiting the vast amount examples that is already available from the Web, and trying to automate those steps requiring human intervention (form template extraction, query specification) for customizing found examples to developer’s specific needs.
{"title":"Semi-automatic Generation of GUIs for RDF Browsing","authors":"M. Pazienza, N. Scarpato, A. Stellato","doi":"10.1109/IV.2010.47","DOIUrl":"https://doi.org/10.1109/IV.2010.47","url":null,"abstract":"In this paper we present an approach to automatic generation of GUI for browsing of RDF data based on observation of existing forms and their adaptation to available RDF graphs. The objective of such an approach is the rapid prototyping of forms and their associated queries by exploiting the vast amount examples that is already available from the Web, and trying to automate those steps requiring human intervention (form template extraction, query specification) for customizing found examples to developer’s specific needs.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114490852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Presented in this paper is a novel real-time virtual reality game developed to enable two participants to play table tennis immersively with each other’s avatar in a shared virtual environment. It uses a wireless hybrid inertial and ultrasonic tracking system to provide the positions and orientations of both the head (view point) and hand (racket) of each player, as well as two large rear-projection stereoscopic screens to provide a view-dependent 3D display of the game environment. Additionally, a physics-based ball animation model is designed for the game, which includes fast detection of the ball colliding with table, net and quick moving rackets. The system is shown to offer some unique features and form a good platform for development of other immersive games for multiple players.
{"title":"Real-Time Immersive Table Tennis Game for Two Players with Motion Tracking","authors":"Ying Li, L. Shark, S. Hobbs, James Ingham","doi":"10.1109/IV.2010.97","DOIUrl":"https://doi.org/10.1109/IV.2010.97","url":null,"abstract":"Presented in this paper is a novel real-time virtual reality game developed to enable two participants to play table tennis immersively with each other’s avatar in a shared virtual environment. It uses a wireless hybrid inertial and ultrasonic tracking system to provide the positions and orientations of both the head (view point) and hand (racket) of each player, as well as two large rear-projection stereoscopic screens to provide a view-dependent 3D display of the game environment. Additionally, a physics-based ball animation model is designed for the game, which includes fast detection of the ball colliding with table, net and quick moving rackets. The system is shown to offer some unique features and form a good platform for development of other immersive games for multiple players.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116584616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Rusu, D. Stoica, Edward Burns, Benjamin Hample, Kevin McGarry, Robert Russell
The analysis of large sums of soccer statistics can be extremely difficult if the data is not presented graphically. As a result, we developed an application, titled Soccer Scoop, which provides two separate visualizations that can aid a soccer team manager. With our application, a team manager can compare two players on different teams, analyze a particular player before signing them to a contract, measure the performance of a particular player at different positions, generate practice exercises, and determine if a particular player plays better on the road or at home. The visualizations used in our application apply information visualization techniques, such as glyphs, modified star plots, details on demand, color, and gestalt principles.
{"title":"Dynamic Visualizations for Soccer Statistical Analysis","authors":"A. Rusu, D. Stoica, Edward Burns, Benjamin Hample, Kevin McGarry, Robert Russell","doi":"10.1109/IV.2010.39","DOIUrl":"https://doi.org/10.1109/IV.2010.39","url":null,"abstract":"The analysis of large sums of soccer statistics can be extremely difficult if the data is not presented graphically. As a result, we developed an application, titled Soccer Scoop, which provides two separate visualizations that can aid a soccer team manager. With our application, a team manager can compare two players on different teams, analyze a particular player before signing them to a contract, measure the performance of a particular player at different positions, generate practice exercises, and determine if a particular player plays better on the road or at home. The visualizations used in our application apply information visualization techniques, such as glyphs, modified star plots, details on demand, color, and gestalt principles.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125550739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Bobox project is a parallelization framework based on the idea of putting together a number of simple components to create a data processing, non-linear pipeline. The structure (the model) of the pipeline a directed graph, but with several specific properties. In order to display the pipeline in a debugger application that is a part of the framework, we have adapted some of the graph drawing algorithms to leverage the specific properties and challenges found in Bobox model visualization.
{"title":"Bobox Model Visualization","authors":"J. Dokulil, J. Katreniaková","doi":"10.1109/IV.2010.79","DOIUrl":"https://doi.org/10.1109/IV.2010.79","url":null,"abstract":"The Bobox project is a parallelization framework based on the idea of putting together a number of simple components to create a data processing, non-linear pipeline. The structure (the model) of the pipeline a directed graph, but with several specific properties. In order to display the pipeline in a debugger application that is a part of the framework, we have adapted some of the graph drawing algorithms to leverage the specific properties and challenges found in Bobox model visualization.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129061402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xinyu Lin, N. McFarlane, Youbing Zhao, G. Clapworthy, F. Dong, A. Redaelli
While there has been significant progress in the treatment of ischemic heart failure, it remains a significant health and economic problem worldwide. In this paper, we present the challenges of modelling ischemic heart failure and introduce a user-friendly software system that will be a sub-set of the Virtual Pathological Heart environment which is currently being developed under the FP7 VPH2 project. This will provide patient-specific computational modelling and simulation of the human heart to assist the cardiologist and the cardiac surgeon in defining the severity and extent of disease in patients with post-ischemic Left Ventricular Dysfunction. The proposed system will provide visualisation tools for surgical assessment and planning: the registration and display of necrotic and hypo-kinetic regions; simulated surgical restoration (cutting and patching); and finally post-operative functional prediction (volume, shape and mitral valve regurgitation).
{"title":"Visualisation of Left Ventricular Dysfunction in the Virtual Pathological Heart","authors":"Xinyu Lin, N. McFarlane, Youbing Zhao, G. Clapworthy, F. Dong, A. Redaelli","doi":"10.1109/IV.2010.92","DOIUrl":"https://doi.org/10.1109/IV.2010.92","url":null,"abstract":"While there has been significant progress in the treatment of ischemic heart failure, it remains a significant health and economic problem worldwide. In this paper, we present the challenges of modelling ischemic heart failure and introduce a user-friendly software system that will be a sub-set of the Virtual Pathological Heart environment which is currently being developed under the FP7 VPH2 project. This will provide patient-specific computational modelling and simulation of the human heart to assist the cardiologist and the cardiac surgeon in defining the severity and extent of disease in patients with post-ischemic Left Ventricular Dysfunction. The proposed system will provide visualisation tools for surgical assessment and planning: the registration and display of necrotic and hypo-kinetic regions; simulated surgical restoration (cutting and patching); and finally post-operative functional prediction (volume, shape and mitral valve regurgitation).","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128309853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Facility location and vehicle routing are amongst the most important logistic decisions in today’s organizations. These aspects are intertwined and, in some cases, should be addressed in an integrated way (giving rise to the location-routing approach). A decision support tool that can make easier the visualization (and editing) of information regarding these problems is becoming increasingly important as: it enables to further understand the problem at hand; and, at the same time, it fosters better communication of the decisions in a way easier to understand by the general public. This paper presents some concepts for information visualization on the problems arisen by the aforementioned decisions, which have been incorporated in a decision support tool and tested using usability evaluation methods.
{"title":"Information Visualization in Facility Location and Vehicle Routing Decisions","authors":"R. Lopes, B. Santos, Paulo Dias, Carlos Ferreira","doi":"10.1109/IV.2010.25","DOIUrl":"https://doi.org/10.1109/IV.2010.25","url":null,"abstract":"Facility location and vehicle routing are amongst the most important logistic decisions in today’s organizations. These aspects are intertwined and, in some cases, should be addressed in an integrated way (giving rise to the location-routing approach). A decision support tool that can make easier the visualization (and editing) of information regarding these problems is becoming increasingly important as: it enables to further understand the problem at hand; and, at the same time, it fosters better communication of the decisions in a way easier to understand by the general public. This paper presents some concepts for information visualization on the problems arisen by the aforementioned decisions, which have been incorporated in a decision support tool and tested using usability evaluation methods.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128597852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hamiltonian cycles play an important role in graph theory and data mining applications. Two Hamiltonian cycles that don’t have an edge in common are known as edge-disjoint Hamiltonian cycles (EDHCs). EDHCs are useful in computer networks. They have found applications in improving network capacity, fault-tolerance and collusion resistant mining algorithms. This paper extends previous work on collusion resistance capability of data mining algorithms. We first propose a new trust model for network computers. We then use this model as a basis to improve the collusion resistance capability of data mining algorithms. We use a performance metric to quantify the improvement.
{"title":"Trust Enabled Secure Multiparty Computation","authors":"Renren Dong, Ray Kresman","doi":"10.1109/IV.2010.95","DOIUrl":"https://doi.org/10.1109/IV.2010.95","url":null,"abstract":"Hamiltonian cycles play an important role in graph theory and data mining applications. Two Hamiltonian cycles that don’t have an edge in common are known as edge-disjoint Hamiltonian cycles (EDHCs). EDHCs are useful in computer networks. They have found applications in improving network capacity, fault-tolerance and collusion resistant mining algorithms. This paper extends previous work on collusion resistance capability of data mining algorithms. We first propose a new trust model for network computers. We then use this model as a basis to improve the collusion resistance capability of data mining algorithms. We use a performance metric to quantify the improvement.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128608381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Information visualisation techniques have sometimes been slow to diffuse into more widespread public use. Recent advances in cloud computing have opened up opportunities to bring information visualisation to the masses in ways previously not possible. Liquid diagrams are a suite of information visualisation gadgets written in Flex, which visualise live data contained in Google Docs spreadsheets through the Google Visualization API. Users can interactively configure the visualisation and any changes in the online spreadsheet data are reflected immediately in the display. In contrast to other solutions, liquid diagrams gadgets specifically support the printing and export of both vector (SVG) and raster (PNG) graphics versions of the visualisations, allowing users to construct and export high-quality diagrams for inclusion into other works. The suite of visualisation gadgets currently available includes: area charts, bar charts, heat maps (choropleths), line charts, pie charts, treemaps, and parallel coordinates plots. Star plots and voronoi treemaps are coming soon.
{"title":"Liquid Diagrams: Information Visualisation Gadgets","authors":"K. Andrews, Martin Lessacher","doi":"10.1109/IV.2010.100","DOIUrl":"https://doi.org/10.1109/IV.2010.100","url":null,"abstract":"Information visualisation techniques have sometimes been slow to diffuse into more widespread public use. Recent advances in cloud computing have opened up opportunities to bring information visualisation to the masses in ways previously not possible. Liquid diagrams are a suite of information visualisation gadgets written in Flex, which visualise live data contained in Google Docs spreadsheets through the Google Visualization API. Users can interactively configure the visualisation and any changes in the online spreadsheet data are reflected immediately in the display. In contrast to other solutions, liquid diagrams gadgets specifically support the printing and export of both vector (SVG) and raster (PNG) graphics versions of the visualisations, allowing users to construct and export high-quality diagrams for inclusion into other works. The suite of visualisation gadgets currently available includes: area charts, bar charts, heat maps (choropleths), line charts, pie charts, treemaps, and parallel coordinates plots. Star plots and voronoi treemaps are coming soon.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120922159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiangrong Zhang, F. Dong, G. Clapworthy, Youbing Zhao, L. Jiao
Clustering algorithms have been popularly applied in tissue segmentation in MRI. However, traditional clustering algorithms could not take advantage of some prior knowledge of data even when it does exist. In this paper, we propose a new approach to tissue segmentation of 3D brain MRI using semi-supervised spectral clustering. Spectral clustering algorithm is more powerful than traditional clustering algorithms since it models the voxel-to-voxel relationship as opposed to voxel-to-cluster relationships. In the semi-supervised spectral clustering, two types of instance-level constraints: must-link and cannot-link as background prior knowledge are incorporated into spectral clustering, and the self-tuning parameter is applied to avoid the selection of the scaling parameter of spectral clustering. The semi-supervised spectral clustering is an effective tissue segmentation method because of its advantages in (1) better discovery of real data structure since there is no cluster shape restriction, (2) high quality segmentation results as it can obtain the global optimal solutions in the relaxed continuous domain by eigen-decomposition and combines the pairwise constraints information. Experimental results on simulated and real MRI data demonstrate its effectiveness.
{"title":"Semi-supervised Tissue Segmentation of 3D Brain MR Images","authors":"Xiangrong Zhang, F. Dong, G. Clapworthy, Youbing Zhao, L. Jiao","doi":"10.1109/IV.2010.90","DOIUrl":"https://doi.org/10.1109/IV.2010.90","url":null,"abstract":"Clustering algorithms have been popularly applied in tissue segmentation in MRI. However, traditional clustering algorithms could not take advantage of some prior knowledge of data even when it does exist. In this paper, we propose a new approach to tissue segmentation of 3D brain MRI using semi-supervised spectral clustering. Spectral clustering algorithm is more powerful than traditional clustering algorithms since it models the voxel-to-voxel relationship as opposed to voxel-to-cluster relationships. In the semi-supervised spectral clustering, two types of instance-level constraints: must-link and cannot-link as background prior knowledge are incorporated into spectral clustering, and the self-tuning parameter is applied to avoid the selection of the scaling parameter of spectral clustering. The semi-supervised spectral clustering is an effective tissue segmentation method because of its advantages in (1) better discovery of real data structure since there is no cluster shape restriction, (2) high quality segmentation results as it can obtain the global optimal solutions in the relaxed continuous domain by eigen-decomposition and combines the pairwise constraints information. Experimental results on simulated and real MRI data demonstrate its effectiveness.","PeriodicalId":328464,"journal":{"name":"2010 14th International Conference Information Visualisation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126404471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：