检索结果-内蒙古大学图书馆

Supporting visual queries on medium-sized node–link diagrams

Information Visualization 1997年第1期4卷 49-58页

作者： Ware, Colin Bobrow, Robert Data Visualization Research Laboratory Center for Coastal and Ocean Mapping University of New Hampshire Durham NH United States BBN Technologies Inc. Cambridge MA United States

For reasons of clarity, a typical node–link diagram statically displayed on paper or a computer screen contains fewer than 30 nodes. However, many problems would benefit if far more complex information could be diagrammed. Following Munzner et al., we suggest that with interactive diagrams this may be possible. We describe an interactive technique whereby a subset of a larger network diagram is highlighted by being set into oscillatory motion when a node is selected with a mouse. The subset is determined by a breadth first search of the underlying graph starting from the selected node. This technique is designed to support visual queries on moderately large node-link diagrams containing up to a few thousand nodes. An experimental evaluation was carried out with networks having 32, 100, 320, 1000, and 3200 nodes respectively, and with four highlighting techniques: static highlighting, motion highlighting, static+motion highlighting, and none. The results show that the interactive highlighting methods support rapid visual queries of nodes in close topological proximity to one another, even for the largest diagrams tested. Without highlighting, error rates were high even for the smallest network that was evaluated. motion highlighting and static highlighting were equally effective. A second experiment was carried out to evaluate methods for showing two subsets of a larger network simultaneously in such a way that both are clearly distinct. The specific task was to determine if the two subsets had nodes in common. The results showed that this task could be performed rapidly and with few errors if one subset was highlighted using motion and the other was highlighted using a static technique. We discuss the implications for information visualization. © 2005, SAGE Publications. All rights reserved.

关键词： Graph visualization interactive animation motion coding

来源：评论

学校读者我要写书评

暂无评论

USE OF RECURSIVE BINARY NESTING FOR coding MOVING IMAGE SEQUENCES

引用

ELECTRONICS LETTERS 1989年第5期25卷 362-363页

作者： CORDELL, PJ CLARKE, RJ Dept. of Electr. & Electron. Eng. Heriot-Watt Univ. Edinburgh UK

Recursive binary nesting (RBN) is a quadtree-based interpolation technique originally developed for still picture coding, which the authors have modified efficiently to code moving sequences. When the basic technique is used for motion coding, visually disturbing effects occur. The causes of these are identified and the algorithm modified to remove them.

关键词： coding moving image sequences computerised picture processing data compression encoding motion coding quadtree-based interpolation technique recursive binary nesting video signals videotelephony visually disturbing effects removal picture encoding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：