Scatter graphs (e.g. SPIRE Galaxies, Bead, VR-VIBE) are a popular medium for visualising spatial-semantic structures derived from abstract information spaces. For small spaces (i.e. less than one hundred nodes), such ...
详细信息
ISBN:
(纸本)0819439800
Scatter graphs (e.g. SPIRE Galaxies, Bead, VR-VIBE) are a popular medium for visualising spatial-semantic structures derived from abstract information spaces. For small spaces (i.e. less than one hundred nodes), such graphs can be an effective means of reducing high-dimensional information into two or three spatial dimensions. As dimensionality increases, representing the thematic diversity of documents using spatial proximity alone becomes less and less effective. This paper reports an experiment designed to determine whether, for larger spaces, benefits are to be gained from adding visual links between document nodes as an additional means of representing the most important semantic relationships. Two well known algorithms, minimum spanning trees (MST) and pathfinder associative networks (PFNET), were tested against both a scatter graph visualisation, derived from factor analysis, and a traditional list-based hypertext interface. It was hypothesised that visual links would facilitate users' comprehension of the information space with corresponding gains in information seeking performance. Navigation performance and user impressions were analysed across a range of different search tasks. Results indicate both significant performance gains and more positive user feedback for MST and PFNET visualisations over scatter graphs. Performance on all visualisations was generally poorer and never better than that achieved on the text list interface, although the magnitude of these differences was found to be highly task dependent.
作者:
Knight, CMunro, MUniv Durham
Dept Comp Sci Res Inst Software Evolut Visualisat Res Grp Durham DH1 3LE England
visualisation is an important weapon in the management and control of the vast flood of data now generated. In order to be effective and useful it is important that such visualisations are designed to accommodate the ...
详细信息
ISBN:
(纸本)0819439800
visualisation is an important weapon in the management and control of the vast flood of data now generated. In order to be effective and useful it is important that such visualisations are designed to accommodate the variabilities of the tasks to which they will be put, and for the data they will be expected to be able to display. Such a view necessarily means that not all visualisations are always applicable. To this end, work has been done on visualising software and systems with the aim of creating intelligence amplifying tools that aid, rather than try to replace the user and his intuition and domain knowledge.
BLUI (Body Language User Interface) is a virtual reality program that allows drawing and sculpting in 3D space using a gestural interface. In this paper, we describe BLUI's use as an interface for annotation, disp...
详细信息
ISBN:
(纸本)0819439800
BLUI (Body Language User Interface) is a virtual reality program that allows drawing and sculpting in 3D space using a gestural interface. In this paper, we describe BLUI's use as an interface for annotation, display, and explanation in a variety of scientific visualizations. BLUI can display data from Digital Elevation Models. Three-dimensional forms can be positioned and modified, and general navigation can be performed. New lines, surfaces, and point clouds can be drawn and edited. For visualization playback, a line can be chosen along which a virtual camera will fly. Starting and ending positions on this line can be selected. In addition, a "look at" line with start and end positions can be similarly chosen. A time-scale can then be established for the animation, at which point the user can display the scene from the viewpoint of a virtual camera flying along the first line and looking either straight ahead or at a point moving along the second line.
This paper presents a model for constructing complex visualisation instances by describing them as a set of smaller interconnected modules. The module-relationship structure of the model allows users to explore a give...
详细信息
ISBN:
(纸本)0819439800
This paper presents a model for constructing complex visualisation instances by describing them as a set of smaller interconnected modules. The module-relationship structure of the model allows users to explore a given visualisation instance a piece at a time, and then to relate modules to one another to explore the data more deeply. This is known as compositional visualisation. Each module is a visualisation in itself and represents some aspect or view of the data. When a number of such smaller visualisation views are considered conjunctively the result is a broader view of the data that includes the aspects provided by each module. Compositional visualisation is one technique for dealing with data that is too large or complex to visualise using a single visualisation. The model first decomposes data into a collection of simpler data modules. The data modules are then mapped to simple visualisation modules. The visualisation modules are combined to form larger visualisation instances. However, the decomposition of data is not necessarily equivalent to the composition of visualisation, thus a visualisation may give a false impression of data if poorly constructed. The reasons for this and ways to overcome it are presented.
As computer and network intrusions become more and more of a concern, the need for better capabilities to assist in the detection and analysis of intrusions also increases. System administrators typically rely on log ...
详细信息
ISBN:
(纸本)0819439800
As computer and network intrusions become more and more of a concern, the need for better capabilities to assist in the detection and analysis of intrusions also increases. System administrators typically rely on log files to analyze usage and detect misuse. However, as a consequence of the amount of data collected by each machine, multiplied by the tens or hundreds of machines under the system administrator's auspices, the entirety of the data available is neither collected nor analyzed. This is compounded by the need to analyze network traffic data as well. We propose a methodology for analyzing network and computer log information visually based on the analysis of the behavior of the users. Each user's behavior is the key to determining their intent and overriding activity, whether they attempt to hide their actions or not. Proficient hackers will attempt to hide their ultimate activities, which hinders the reliability of log file analysis. visually analyzing the user's behavior, however, is much more adaptable and difficult to counteract.
Volume rendering requires the use of gradient information used as surface normal information, for application of lighting models. However, for interactive applications on-the-fly calculation of gradients is too slow. ...
详细信息
ISBN:
(纸本)0819439800
Volume rendering requires the use of gradient information used as surface normal information, for application of lighting models. However, for interactive applications on-the-fly calculation of gradients is too slow. The common solution to this problem is to quantize gradients of trivariate scalar fields and pre-compute a look-up table prior to the application of a volume rendering method. A number of techniques have been proposed for the quantization of normal vectors, but few have been applied to or adapted for the purpose of volume rendering. We describe an new data-dependent method to quantize gradients using an even number of vectors in a table. The quantization scheme we use is based on a tessellation of the unit sphere. This tessellation represents an "optimally" distributed set of unit normal vectors. Staring with a random tessellation, we optimize the size and distribution of the tiles (on the unit sphere) with a simulated annealing approach.
visualization techniques are very useful when exploring large amount of information especially when dealing with data flow. A pixel-oriented visualization technique based on the CGR algorithm (Chaos Game Representatio...
详细信息
ISBN:
(纸本)0819439800
visualization techniques are very useful when exploring large amount of information especially when dealing with data flow. A pixel-oriented visualization technique based on the CGR algorithm (Chaos Game Representation) has been designed to help recognize type of flowing data on the fly. The CGR method -originally developed for the analysis of genomic sequences -and modified here to allow for coding bit sequences- is an algorithm that produces images where pixels dynamically display current frequencies of small groups of bits in the observed sequence. Qualitative and quantitative expressions of order, regularity, structure and complexity of sequences are perceptible from CGR images that consequently may be used for classification or identification purposes. The method has been applied to a wide range of files including texts of different languages (genomic sequences among others), images with different formats, and data or software of various origins. It is observed that CGR images are file-specific and may be consequently used as data signatures. Not only type of files can be easily identified, but subclasses of data (such as language - and eventually origin- for text), are also decipherable.
This paper presents a novel method for visualizing the results of an image search. Current approaches to visualizing WWW image searches rank results in a linear list and present them as a sorted thumbnail grid. The me...
详细信息
ISBN:
(纸本)0819439800
This paper presents a novel method for visualizing the results of an image search. Current approaches to visualizing WWW image searches rank results in a linear list and present them as a sorted thumbnail grid. The method outlined in this paper visually clusters images based on the user's search terms. To accomplish this, a flexible image retrieval method which incorporates a combination of content-based and textual image matching is used. A new information visualization is used to display the search results. In our model multiple types of partitioning and querying can occur concurrently, thereby creating a multi-dimensional display of image properties. The display groups similar images, enabling users to quickly scan for the most relevant images. This visualization allows users to exploit the location of images as their guide to what an image contains and use thumbnails to preview potentially relevant images. Through the identification of relevant images users can locate relevant areas in the visualization. It is then possible for users to focus their attention on one area of the visualization using a zooming function. The user's interaction with the system is explored using new evaluation metrics based on Information Foraging theory.
We present an octree-based approach for isosurface extraction from large volumetric scalar-valued data. Given scattered points with associated function values, we impose an octree structure of relatively low resolutio...
详细信息
ISBN:
(纸本)0819439800
We present an octree-based approach for isosurface extraction from large volumetric scalar-valued data. Given scattered points with associated function values, we impose an octree structure of relatively low resolution. Octree construction is controlled by original data resolution and cell-specific error values. For each cell in the octree, we compute an average function value and additional statistical data for the original points inside the cell. Once a specific isovalue is specified, we adjust the initial octree by expanding its leaves based on a comparison of the statistics with the isovalue. We tetrahedrize the centers of the octree's cells to determine tetrahedral meshes decomposing the entire spatial domain of the data, including a possibly specified region of interest (ROI). Extracted isosurfaces are crack-free inside an ROI, but cracks can appear at the boundary of an ROI. The initial isosurface is an approximation of the exact one, but its quality suffices for a viewer to identify an ROI where more accuracy is desirable. In the refinement process, we refine affected octree nodes and update the triangulation locally to produce better isosurface representations. This adaptive and user-driven refinement provides a means for interactive dataexploration via real-time and local isosurface extraction.
Unstructured grid discretizations have become increasingly popular for computational modeling of engineering problems involving complex geometries. However, the use of 3-d unstructured grids complicates the visualizat...
详细信息
ISBN:
(纸本)0819439800
Unstructured grid discretizations have become increasingly popular for computational modeling of engineering problems involving complex geometries. However, the use of 3-d unstructured grids complicates the visualization task, since the resulting data sets are irregular both geometrically and topologically. The need to store and access additional information about the structure of the grid can lead to visualization algorithms which incur considerable memory and computational overhead. These issues become critical with large data sets. In this paper, we present a layer data organization technique for data from 3-d aerodynamics simulations using unstructured grids. This type of simulations typically model air flow surrounding an aircraft body, and the grid resolutions are very fine near the aircraft body. Scientists are usually interested in visualizing the flow pattern near the wing, sometimes very close to the wing surface. We have design an efficient way to generate the layer representation, and experimented it with different visualization methods, from isosurface rendering, volume rendering to texture-based vector-field visualization. We found that the layer representation facilitates interactive exploration and helps scientists to quickly find regions of interest.
暂无评论