Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.最新文献

筛选
英文 中文
Focal points and intuitive 3D controls for human kinematics visualisation 焦点和直观的3D控制人体运动学可视化
M. Krokos, Hai Lin, G. Clapworthy, F. Dong
{"title":"Focal points and intuitive 3D controls for human kinematics visualisation","authors":"M. Krokos, Hai Lin, G. Clapworthy, F. Dong","doi":"10.1109/IV.2003.1217976","DOIUrl":"https://doi.org/10.1109/IV.2003.1217976","url":null,"abstract":"We give a brief overview of a new source of data on human anatomy and kinematics created by the EC-funded project VAKHUM. The motivation was to provide support for education at various levels through animated 3D models and finite element meshes of human joints, while making original high-quality raw data available for industrial users. We outline some identified user demands. We further describe the data types and relevant software components employed for accessing and visualising VAKHUM models. The emphasis is on a novel user interface based on focal points and intuitive 3D controls for viewing anatomy that is appropriately registered with kinematics captured by local e.g. electrogoniometry or global e.g. stereophotogrammetry means. The operating scenario for accessing models in the VAKHUM database is outlined. We close with a summary of the work and pointers to future development.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124142068","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}
引用次数: 0
Visual bracketing for Web search result visualization 用于Web搜索结果可视化的视觉括号
Jonathan C. Roberts, E. Suvanaphen
{"title":"Visual bracketing for Web search result visualization","authors":"Jonathan C. Roberts, E. Suvanaphen","doi":"10.1109/IV.2003.1217989","DOIUrl":"https://doi.org/10.1109/IV.2003.1217989","url":null,"abstract":"We introduce a novel visual bracketing method that provides detail-in-context views where the inner part contains the Focus bracketed by the context information at a lower semantic level. We demonstrate two designs for Web search result visualization that obviate the need to frequently select the next button for viewing multiple search results.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115980675","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}
引用次数: 18
Compact visualisation of multimedia interaction records 多媒体交互记录的紧凑可视化
S. Luz, M. Masoodian
{"title":"Compact visualisation of multimedia interaction records","authors":"S. Luz, M. Masoodian","doi":"10.1109/IV.2003.1218037","DOIUrl":"https://doi.org/10.1109/IV.2003.1218037","url":null,"abstract":"We present an approach to building compact and effective information visualisation interfaces to allow users to browse and access content stored in continuous media. We introduce a content mapping framework, which supports time-based indexing of recordings of computer supported collaborative activity. In order to illustrate the temporal aspect of content mapping, we present HANMER, a system designed to provide fast access to audio-textual meeting recordings on personal digital assistants (PDAs). HANMER embodies techniques that exploit the processing capabilities and functionality of modern PDAs for visualisation and retrieval of multimedia meeting data.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132579062","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}
引用次数: 4
Textured voxels based method for display speed up 基于纹理体素的显示加速方法
Pierre Tellier, Samy Baroud
{"title":"Textured voxels based method for display speed up","authors":"Pierre Tellier, Samy Baroud","doi":"10.1109/IV.2003.1217953","DOIUrl":"https://doi.org/10.1109/IV.2003.1217953","url":null,"abstract":"We present a novel method for the simplification of three-dimensional objects in order to optimise display. This is an incremental method with a specific feature: the processed scenes are simultaneously shown with two degrees of detail - precise and coarse. This allows for the creation of different types of simplification and adapts the geometrical and photometrical representation of the objects and scenes to precision and speed requirements. Voxels and textures are used in this method and it works with all kinds of object modelling. This method is based on the idea that in order to effectively reduce the volume of information to be processed while providing accurate rendering and fast display, we have to concentrate on the less visible pans of objects.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127384078","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}
引用次数: 0
Visual analysis based on algorithmic classification 基于算法分类的可视化分析
J. Johansson, M. Jern, R. Treloar, Mattias Jansson
{"title":"Visual analysis based on algorithmic classification","authors":"J. Johansson, M. Jern, R. Treloar, Mattias Jansson","doi":"10.1109/IV.2003.1217962","DOIUrl":"https://doi.org/10.1109/IV.2003.1217962","url":null,"abstract":"Extracting actionable insight from large high dimensional data sets, and its use for more effective decision-making, has become a pervasive problem across many fields in research and industry. We describe an investigation of the application of tightly coupled statistical and visual analysis techniques to this task. The approach we choose is \"unsupervised learning\" where we investigate the advantages offered by close coupling of the self-organizing map algorithm with new combinations of visualization components and techniques for interactivity.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"314 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133788485","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}
引用次数: 5
Movement as an aid to understanding graphs 帮助理解图形的运动
J. Bovey, P. Rodgers, Florence Benoy
{"title":"Movement as an aid to understanding graphs","authors":"J. Bovey, P. Rodgers, Florence Benoy","doi":"10.1109/IV.2003.1218027","DOIUrl":"https://doi.org/10.1109/IV.2003.1218027","url":null,"abstract":"We describe a graph visualization method that attempts to aid the understanding of graphs by adding continuous local movement to graph diagrams. We include a discussion of some of the many different kinds of potential graph movement and then describe an empirical trial that was conducted to investigate whether one kind of movement helps with a particular graph comprehension task. Although the results of the trial are promising, the degree of benefit afforded by the movement varies between graphs and we include a discussion about graph features which may account for this discrepancy.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114762910","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}
引用次数: 9
CandyTop Interface: a visualization method with positive attention for growing multimedia documents CandyTop界面:一种积极关注多媒体文档增长的可视化方法
Naofumi Yoshida, Jun Miyazaki, Akira Wakita
{"title":"CandyTop Interface: a visualization method with positive attention for growing multimedia documents","authors":"Naofumi Yoshida, Jun Miyazaki, Akira Wakita","doi":"10.1109/IV.2003.1218011","DOIUrl":"https://doi.org/10.1109/IV.2003.1218011","url":null,"abstract":"We present CandyTop Interface, a visualization method with positive attention for growing multimedia documents. Our method is a visualization method for growing documents by allocating changes of multimedia documents according to time line in three-dimensional space. The main feature of our method is to enable provision of positive attention on key changes of multimedia documents by visualizing multimedia documents with priority of changes for multimedia documents. By our method, we can realize multimedia systems providing at-a-glance view for multiple versions of multimedia documents. We discuss the feasibility of our method by applications to visualization for growing documents with collaborative editing in virtual spaces and for multiview video streams of technical meeting.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124750621","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}
引用次数: 4
Applied visual user interface technique in knowledge management 可视化用户界面技术在知识管理中的应用
R. Treloar, M. Jern
{"title":"Applied visual user interface technique in knowledge management","authors":"R. Treloar, M. Jern","doi":"10.1109/IV.2003.1217948","DOIUrl":"https://doi.org/10.1109/IV.2003.1217948","url":null,"abstract":"Extracting actionable insight from large high-dimensional data sets, and its use for more effective decision-making, has become a pervasive problem across many application fields in both research and industry. The objective of our presentation is to report on some investigations of this problem covering both these areas. Taking as the problem domain the area of \"unsupervised learning\", we show that by tightly coupling statistical analysis technique with combinations of visualization components and techniques for interactivity, real-time analysis of multidimensional data can be efficiently made. We give particular attention to the ways in which dynamic visual representations can be used in these contexts to facilitate shared understanding. Our system is implemented and validated in the context of 3D medical imaging knowledge construction, knowledge management and geovisualisation.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128314966","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}
引用次数: 0
A heuristic for k-broadcasting in arbitrary networks 任意网络中k广播的一种启发式算法
Hovhannes A. Harutyunyan, Bin Shao
{"title":"A heuristic for k-broadcasting in arbitrary networks","authors":"Hovhannes A. Harutyunyan, Bin Shao","doi":"10.1109/IV.2003.1217992","DOIUrl":"https://doi.org/10.1109/IV.2003.1217992","url":null,"abstract":"We present a heuristic algorithm for k-broadcasting in an arbitrary network. This heuristic generates optimal k-broadcast time in grid graph when k/spl ges/2. In two-dimensional torus graph, it also generates optimal k-broadcast time when k/spl ges/3, while giving a bound of /spl lfloor/m/2/spl rfloor/+/spl lfloor/n/2/spl rfloor/+1 when k=2, where m and n are the number of rows and columns in the graph. In practice, the new heuristic outperforms best known 1-broadcast algorithm for three different network design models. The new algorithm runs fast. The time complexity of the algorithm is O(R /spl middot/ m), where R represents the rounds of broadcasting, and m stands for the total number of edges in the graph.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128717588","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}
引用次数: 9
Determining candidate binding site locations using conserved features 利用保守特征确定候选结合位点的位置
Gareth Hannaford, C. Maple
{"title":"Determining candidate binding site locations using conserved features","authors":"Gareth Hannaford, C. Maple","doi":"10.1109/IV.2003.1217972","DOIUrl":"https://doi.org/10.1109/IV.2003.1217972","url":null,"abstract":"We present a method for representing important conserved features of a protein directly involved in binding. The conserved features are observed by noticing common atoms in proteins that bind a ligand. A method for constructing a fingerprint based upon the geometric configuration of the atoms in the binding region of the protein is presented. The fingerprint can be applied to other protein structural PDB (protein data bank) files to facilitate identification of the specific binding site the fingerprint represents. The algorithm presented complements software developed at the University of Luton, TMSite, and can be used with the ClustalW alignment tool. By matching one amino acid of the fingerprint onto a new protein, then using it as an anchor and searching for the other corresponding amino acids around it gives a simple method to find possible binding sites. The more points of the fingerprint matched the less likely the match is to be coincidental. Thresholds, both geometrical and biochemical, can be altered to adjust sensitivity of the search. This method will be implemented in TMBoundary, a current software project, as an alternative or complementary search method for binding sites in proteins of known structure.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121293726","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信