TY - CHAP
T1 - A Canonical Form for Testing Boolean Function Properties
T2 - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Y1 - 2011
A1 - Dana Dachman-Soled
A1 - Servedio, Rocco A.
ED - Goldberg, Leslie Ann
ED - Jansen, Klaus
ED - Ravi, R.
ED - Rolim, José D. P.
KW - Algorithm Analysis and Problem Complexity
KW - Boolean functions
KW - Computation by Abstract Devices
KW - Computer Communication Networks
KW - Computer Graphics
KW - Data structures
KW - Discrete Mathematics in Computer Science
KW - property testing
AB - In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the edges queried are the complete graph over the selected vertices. We define a similar-in-spirit canonical form for Boolean function testing algorithms, and show that under some mild conditions property testers for Boolean functions can be transformed into this canonical form. Our first main result shows, roughly speaking, that every “nice” family of Boolean functions that has low noise sensitivity and is testable by an “independent tester,” has a canonical testing algorithm. Our second main result is similar but holds instead for families of Boolean functions that are closed under ID-negative minors. Taken together, these two results cover almost all of the constant-query Boolean function testing algorithms that we know of in the literature, and show that all of these testing algorithms can be automatically converted into a canonical form.
JA - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-642-22934-3, 978-3-642-22935-0
UR - http://link.springer.com/chapter/10.1007/978-3-642-22935-0_39
ER -
TY - MGZN
T1 - Graph Analytics-Lessons Learned and Challenges Ahead
Y1 - 2011
A1 - Wong,Pak Chung
A1 - Chen,Chaomei
A1 - Gorg,Carsten
A1 - Shneiderman, Ben
A1 - Stasko,John
A1 - Thomas,Jim
KW - citation analysis
KW - citespace
KW - Computer Graphics
KW - document analysis
KW - graphics and multimedia
KW - greengrid
KW - jigsaw system
KW - modeling
KW - power grid analysis
KW - semantic substrates
KW - simulation
KW - social networks
KW - text analysis
KW - Visualization
AB - Graph analytics is one of the most influential and important R&D topics in the visual analytics community. Researchers with diverse backgrounds from information visualization, human-computer interaction, computer graphics, graph drawing, and data mining have pursued graph analytics from scientific, technical, and social approaches. These studies have addressed both distinct and common challenges. Past successes and mistakes can provide valuable lessons for revising the research agenda. In this article, six researchers from four academic and research institutes identify graph analytics' fundamental challenges and present both insightful lessons learned from their experience and good practices in graph analytics research. The goal is to critically assess those lessons and shed light on how they can stimulate research and draw attention to grand challenges for graph analytics. The article also establishes principles that could lead to measurable standards and criteria for research.
JA - IEEE Computer Graphics and Applications
VL - 31
SN - 0272-1716
CP - 5
ER -
TY - CHAP
T1 - Graph Drawing for Security Visualization
T2 - Graph Drawing
Y1 - 2009
A1 - Tamassia, Roberto
A1 - Palazzi, Bernardo
A1 - Charalampos Papamanthou
ED - Tollis, Ioannis G.
ED - Patrignani, Maurizio
KW - Algorithm Analysis and Problem Complexity
KW - Computer Graphics
KW - Data structures
KW - Discrete Mathematics in Computer Science
AB - With the number of devices connected to the internet growing rapidly and software systems being increasingly deployed on the web, security and privacy have become crucial properties for networks and applications. Due the complexity and subtlety of cryptographic methods and protocols, software architects and developers often fail to incorporate security principles in their designs and implementations. Also, most users have minimal understanding of security threats. While several tools for developers, system administrators and security analysts are available, these tools typically provide information in the form of textual logs or tables, which are cumbersome to analyze. Thus, in recent years, the field of security visualization has emerged to provide novel ways to display security-related information so that it is easier to understand. In this work, we give a preliminary survey of approaches to the visualization of computer security concepts that use graph drawing techniques.
JA - Graph Drawing
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-642-00218-2, 978-3-642-00219-9
UR - http://link.springer.com/chapter/10.1007/978-3-642-00219-9_2
ER -
TY - JOUR
T1 - Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison
JF - IEEE Transactions on Visualization and Computer Graphics
Y1 - 2009
A1 - Wang,T. D
A1 - Plaisant, Catherine
A1 - Shneiderman, Ben
A1 - Spring, Neil
A1 - Roseman,D.
A1 - Marchand,G.
A1 - Mukherjee,V.
A1 - Smith,M.
KW - Aggregates
KW - Collaborative work
KW - Computational Biology
KW - Computer Graphics
KW - Data analysis
KW - data visualisation
KW - Data visualization
KW - Databases, Factual
KW - Displays
KW - Event detection
KW - Filters
KW - Heparin
KW - History
KW - Human computer interaction
KW - Human-computer interaction
KW - HUMANS
KW - Information Visualization
KW - Interaction design
KW - interactive visualization technique
KW - Medical Records Systems, Computerized
KW - Pattern Recognition, Automated
KW - Performance analysis
KW - Springs
KW - temporal categorical data visualization
KW - temporal categorical searching
KW - temporal ordering
KW - temporal summaries
KW - Thrombocytopenia
KW - Time factors
AB - When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.
VL - 15
SN - 1077-2626
CP - 6
M3 - 10.1109/TVCG.2009.187
ER -
TY - JOUR
T1 - Interactive Entity Resolution in Relational Data: A Visual Analytic Tool and Its Evaluation
JF - IEEE Transactions on Visualization and Computer Graphics
Y1 - 2008
A1 - Kang,Hyunmo
A1 - Getoor, Lise
A1 - Shneiderman, Ben
A1 - Bilgic,M.
A1 - Licamele,L.
KW - algorithms
KW - Computer Graphics
KW - D-Dupe
KW - data visualisation
KW - database management systems
KW - Databases, Factual
KW - graphical user interface
KW - Graphical user interfaces
KW - human-centered computing
KW - Image Interpretation, Computer-Assisted
KW - Information Storage and Retrieval
KW - Information Visualization
KW - interactive entity resolution
KW - relational context visualization
KW - Relational databases
KW - relational entity resolution algorithm
KW - User interfaces
KW - user-centered design
KW - User-Computer Interface
KW - visual analytic tool
AB - Databases often contain uncertain and imprecise references to real-world entities. Entity resolution, the process of reconciling multiple references to underlying real-world entities, is an important data cleaning process required before accurate visualization or analysis of the data is possible. In many cases, in addition to noisy data describing entities, there is data describing the relationships among the entities. This relational data is important during the entity resolution process; it is useful both for the algorithms which determine likely database references to be resolved and for visual analytic tools which support the entity resolution process. In this paper, we introduce a novel user interface, D-Dupe, for interactive entity resolution in relational data. D-Dupe effectively combines relational entity resolution algorithms with a novel network visualization that enables users to make use of an entity's relational context for making resolution decisions. Since resolution decisions often are interdependent, D-Dupe facilitates understanding this complex process through animations which highlight combined inferences and a history mechanism which allows users to inspect chains of resolution decisions. An empirical study with 12 users confirmed the benefits of the relational context visualization on the performance of entity resolution tasks in relational data in terms of time as well as users' confidence and satisfaction.
VL - 14
SN - 1077-2626
CP - 5
M3 - 10.1109/TVCG.2008.55
ER -
TY - BOOK
T1 - Shape Analysis and Structuring
Y1 - 2008
A1 - De Floriani, Leila
A1 - Spagnuolo,Michela
KW - Computer Graphics
KW - Computer vision
KW - Computers / Computer Graphics
KW - Computers / Image Processing
KW - Geometrical models
KW - Geometry
KW - Geometry, Analytic
KW - Image analysis
KW - IMAGE PROCESSING
KW - Mathematics / Functional Analysis
KW - Mathematics / Geometry / General
KW - Mathematics / Graphic Methods
KW - Mathematics / Mathematical Analysis
KW - shapes
KW - Technology & Engineering / Engineering (General)
KW - Visualization
AB - With a lot of recent developments in the field, this much-needed book has come at just the right time. It covers a variety of topics related to preserving and enhancing shape information at a geometric level. The contributors also cover subjects that are relevant to effectively capturing the structure of a shape by identifying relevant shape components and their mutual relationships.
PB - Springer
SN - 9783540332640
ER -
TY - CHAP
T1 - On the Cost of Persistence and Authentication in Skip Lists
T2 - Experimental Algorithms
Y1 - 2007
A1 - Goodrich, Michael T.
A1 - Charalampos Papamanthou
A1 - Tamassia, Roberto
ED - Demetrescu, Camil
KW - Algorithm Analysis and Problem Complexity
KW - algorithms
KW - Computer Graphics
KW - Data structures
KW - Discrete Mathematics in Computer Science
KW - Numeric Computing
AB - We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical study confirms the efficiency of authenticated skip lists and offers guidelines for incorporating them in various applications.
JA - Experimental Algorithms
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-540-72844-3, 978-3-540-72845-0
UR - http://link.springer.com/chapter/10.1007/978-3-540-72845-0_8
ER -
TY - CHAP
T1 - Parameterized st-Orientations of Graphs: Algorithms and Experiments
T2 - Graph Drawing
Y1 - 2007
A1 - Charalampos Papamanthou
A1 - Tollis, Ioannis G.
ED - Kaufmann, Michael
ED - Wagner, Dorothea
KW - Algorithm Analysis and Problem Complexity
KW - Computer Graphics
KW - Data structures
KW - Discrete Mathematics in Computer Science
AB - st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the past to compute an st-orientation of a biconnected graph. However, as indicated in [1], the computation of more than one st-orientation is very important for many applications in multiple research areas, such as this of Graph Drawing. In this paper we show how to compute such orientations with certain (parameterized) characteristics in the final st-oriented graph, such as the length of the longest path. Apart from Graph Drawing, this work applies in other areas such as Network Routing and in tackling difficult problems such as Graph Coloring and Longest Path. We present primary approaches to the problem of computing longest path parameterized st-orientations of graphs, an analytical presentation (together with proof of correctness) of a new O(mlog5 n) (O(mlogn) for planar graphs) time algorithm that computes such orientations (and which was used in [1]) and extensive computational results that reveal the robustness of the algorithm.
JA - Graph Drawing
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-540-70903-9, 978-3-540-70904-6
UR - http://link.springer.com/chapter/10.1007/978-3-540-70904-6_22
ER -
TY - CHAP
T1 - Applications of Parameterized st-Orientations in Graph Drawing Algorithms
T2 - Graph Drawing
Y1 - 2006
A1 - Charalampos Papamanthou
A1 - Tollis, Ioannis G.
ED - Healy, Patrick
ED - Nikolov, Nikola S.
KW - Algorithm Analysis and Problem Complexity
KW - Computer Graphics
KW - Data structures
KW - Discrete Mathematics in Computer Science
AB - Many graph drawing algorithms use st-numberings (st-orien-tations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a directed graph with no cycles, one single source s and one single sink t. As there exist exponentially many st-numberings that correspond to a certain undirected graph G, using different st-numberings in various graph drawing algorithms can result in aesthetically different drawings with different area bounds. In this paper, we present results concerning new algorithms for parameterized st-orientations, their impact on graph drawing algorithms and especially in visibility representations.
JA - Graph Drawing
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-540-31425-7, 978-3-540-31667-1
UR - http://link.springer.com/chapter/10.1007/11618058_32
ER -
TY - JOUR
T1 - Balancing Systematic and Flexible Exploration of Social Networks
JF - IEEE Transactions on Visualization and Computer Graphics
Y1 - 2006
A1 - Perer,A.
A1 - Shneiderman, Ben
KW - Aggregates
KW - algorithms
KW - attribute ranking
KW - Cluster Analysis
KW - Computer Graphics
KW - Computer simulation
KW - Coordinate measuring machines
KW - coordinated views
KW - Data analysis
KW - data visualisation
KW - Data visualization
KW - exploratory data analysis
KW - Filters
KW - Gain measurement
KW - graph theory
KW - Graphical user interfaces
KW - Information Storage and Retrieval
KW - interactive graph visualization
KW - matrix algebra
KW - matrix overview
KW - Models, Biological
KW - Navigation
KW - network visualization
KW - Pattern analysis
KW - Population Dynamics
KW - Social Behavior
KW - social network analysis
KW - Social network services
KW - social networks
KW - social sciences computing
KW - Social Support
KW - SocialAction
KW - software
KW - statistical analysis
KW - statistical methods
KW - User-Computer Interface
AB - Social network analysis (SNA) has emerged as a powerful method for understanding the importance of relationships in networks. However, interactive exploration of networks is currently challenging because: (1) it is difficult to find patterns and comprehend the structure of networks with many nodes and links, and (2) current systems are often a medley of statistical methods and overwhelming visual output which leaves many analysts uncertain about how to explore in an orderly manner. This results in exploration that is largely opportunistic. Our contributions are techniques to help structural analysts understand social networks more effectively. We present SocialAction, a system that uses attribute ranking and coordinated views to help users systematically examine numerous SNA measures. Users can (1) flexibly iterate through visualizations of measures to gain an overview, filter nodes, and find outliers, (2) aggregate networks using link structure, find cohesive subgroups, and focus on communities of interest, and (3) untangle networks by viewing different link types separately, or find patterns across different link types using a matrix overview. For each operation, a stable node layout is maintained in the network visualization so users can make comparisons. SocialAction offers analysts a strategy beyond opportunism, as it provides systematic, yet flexible, techniques for exploring social networks
VL - 12
SN - 1077-2626
CP - 5
M3 - 10.1109/TVCG.2006.122
ER -
TY - CHAP
T1 - 3D Visualization of Semantic Metadata Models and Ontologies
T2 - Graph Drawing
Y1 - 2005
A1 - Charalampos Papamanthou
A1 - Tollis, Ioannis G.
A1 - Doerr, Martin
ED - Pach, János
KW - Algorithm Analysis and Problem Complexity
KW - Computer Graphics
KW - Data structures
KW - Discrete Mathematics in Computer Science
AB - We propose an algorithm for the 3D visualization of general ontology models used in many applications, such as semantic web, entity-relationship diagrams and other database models. The visualization places entities in the 3D space. Previous techniques produce drawings that are 2-dimensional, which are often complicated and hard to comprehend. Our technique uses the third dimension almost exclusively for the display of the isa relationships (links) while the property relationships (links) are placed on some layer (plane). Thus the semantic difference between isa links and property links, which should be as vertical or as horizontal as possible respectively, is emphasized. Special reference is made on a certain model, the CIDOC Conceptual Reference Model.
JA - Graph Drawing
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-540-24528-5, 978-3-540-31843-9
UR - http://link.springer.com/chapter/10.1007/978-3-540-31843-9_38
ER -
TY - CONF
T1 - Show Me! Guidelines for producing recorded demonstrations
T2 - 2005 IEEE Symposium on Visual Languages and Human-Centric Computing
Y1 - 2005
A1 - Plaisant, Catherine
A1 - Shneiderman, Ben
KW - animation
KW - auditory cues
KW - Computer aided instruction
KW - Computer animation
KW - Computer Graphics
KW - Computer interfaces
KW - computer literacy
KW - content guidelines
KW - documentation
KW - Government
KW - Graphical user interfaces
KW - Guidelines
KW - Laboratories
KW - narration
KW - recorded demonstrations
KW - screen capture animation
KW - technical guidelines
KW - usability
KW - User interfaces
KW - visual appeal
KW - visual cues
AB - Although recorded demonstrations (screen capture animations with narration) have become a popular form of instruction for user interfaces, little work has been done to describe guidelines for their design. Based on our experience in several projects, we offer a starting set of guidelines for the design of visually appealing and cognitively effective recorded demonstrations. Technical guidelines encourage users to keep file sizes small, strive for universal usability, and ensure user control etc. and provide tips to achieve those goals. Content guidelines include: create short demonstrations that focus on tasks, highlight each step with auditory and visual cues, synchronize narration and animation carefully, and create demonstrations with a clear beginning, middle, and end.
JA - 2005 IEEE Symposium on Visual Languages and Human-Centric Computing
PB - IEEE
SN - 0-7695-2443-5
M3 - 10.1109/VLHCC.2005.57
ER -
TY - JOUR
T1 - An information theoretic criterion for evaluating the quality of 3-D reconstructions from video
JF - Image Processing, IEEE Transactions on
Y1 - 2004
A1 - Roy-Chowdhury, A.K.
A1 - Chellapa, Rama
KW - 3D reconstruction
KW - algorithms
KW - Artificial intelligence
KW - Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing
KW - Computer Graphics
KW - Computer-Assisted;Imaging
KW - Computer-Assisted;Software Validation;Subtraction Technique;Video Recording;
KW - Image Enhancement
KW - Image Interpretation
KW - Image reconstruction
KW - Image sequences
KW - information theoretic criterion
KW - Mutual information
KW - NOISE
KW - noise distribution
KW - optical flow equations
KW - second order moments
KW - statistical analysis
KW - Three-Dimensional;Information Storage and Retrieval;Information Theory;Movement;Pattern Recognition
KW - Video sequences
KW - video signal processing
AB - Even though numerous algorithms exist for estimating the three-dimensional (3-D) structure of a scene from its video, the solutions obtained are often of unacceptable quality. To overcome some of the deficiencies, many application systems rely on processing more data than necessary, thus raising the question: how is the accuracy of the solution related to the amount of data processed by the algorithm? Can we automatically recognize situations where the quality of the data is so bad that even a large number of additional observations will not yield the desired solution? Previous efforts to answer this question have used statistical measures like second order moments. They are useful if the estimate of the structure is unbiased and the higher order statistical effects are negligible, which is often not the case. This paper introduces an alternative information-theoretic criterion for evaluating the quality of a 3-D reconstruction. The accuracy of the reconstruction is judged by considering the change in mutual information (MI) (termed as the incremental MI) between a scene and its reconstructions. An example of 3-D reconstruction from a video sequence using optical flow equations and known noise distribution is considered and it is shown how the MI can be computed from first principles. We present simulations on both synthetic and real data to demonstrate the effectiveness of the proposed criterion.
VL - 13
SN - 1057-7149
CP - 7
M3 - 10.1109/TIP.2004.827240
ER -
TY - CHAP
T1 - An MCMC-Based Particle Filter for Tracking Multiple Interacting Targets
T2 - Computer Vision - ECCV 2004
Y1 - 2004
A1 - Zia Khan
A1 - Balch, Tucker
A1 - Dellaert, Frank
ED - Pajdla, Tomás
ED - Matas, Jiří
KW - Artificial Intelligence (incl. Robotics)
KW - Computer Graphics
KW - Image Processing and Computer Vision
KW - pattern recognition
AB - We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or behavior of other targets. Such interactions cause problems for traditional approaches to the data association problem. In response, we developed a joint tracker that includes a more sophisticated motion model to maintain the identity of targets throughout an interaction, drastically reducing tracker failures. The paper presents two main contributions: (1) we show how a Markov random field (MRF) motion prior, built on the fly at each time step, can substantially improve tracking when targets interact, and (2) we show how this can be done efficiently using Markov chain Monte Carlo (MCMC) sampling. We prove that incorporating an MRF to model interactions is equivalent to adding an additional interaction factor to the importance weights in a joint particle filter. Since a joint particle filter suffers from exponential complexity in the number of tracked targets, we replace the traditional importance sampling step in the particle filter with an MCMC sampling step. The resulting filter deals efficiently and effectively with complicated interactions when targets approach each other. We present both qualitative and quantitative results to substantiate the claims made in the paper, including a large scale experiment on a video-sequence of over 10,000 frames in length.
JA - Computer Vision - ECCV 2004
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-540-21981-1, 978-3-540-24673-2
UR - http://link.springer.com/chapter/10.1007/978-3-540-24673-2_23
ER -
TY - JOUR
T1 - Visual tracking and recognition using appearance-adaptive models in particle filters
JF - IEEE Transactions on Image Processing
Y1 - 2004
A1 - Zhou,Shaohua Kevin
A1 - Chellapa, Rama
A1 - Moghaddam, B.
KW - adaptive filters
KW - adaptive noise variance
KW - algorithms
KW - appearance-adaptive model
KW - Artificial intelligence
KW - Cluster Analysis
KW - Computer Graphics
KW - Computer simulation
KW - Feedback
KW - Filtering
KW - first-order linear predictor
KW - hidden feature removal
KW - HUMANS
KW - Image Enhancement
KW - Image Interpretation, Computer-Assisted
KW - image recognition
KW - Information Storage and Retrieval
KW - Kinematics
KW - Laboratories
KW - Male
KW - Models, Biological
KW - Models, Statistical
KW - MOTION
KW - Movement
KW - Noise robustness
KW - Numerical Analysis, Computer-Assisted
KW - occlusion analysis
KW - Particle filters
KW - Particle tracking
KW - Pattern Recognition, Automated
KW - Predictive models
KW - Reproducibility of results
KW - robust statistics
KW - Sensitivity and Specificity
KW - Signal Processing, Computer-Assisted
KW - State estimation
KW - statistical analysis
KW - Subtraction Technique
KW - tracking
KW - Training data
KW - visual recognition
KW - visual tracking
AB - We present an approach that incorporates appearance-adaptive models in a particle filter to realize robust visual tracking and recognition algorithms. Tracking needs modeling interframe motion and appearance changes, whereas recognition needs modeling appearance changes between frames and gallery images. In conventional tracking algorithms, the appearance model is either fixed or rapidly changing, and the motion model is simply a random walk with fixed noise variance. Also, the number of particles is typically fixed. All these factors make the visual tracker unstable. To stabilize the tracker, we propose the following modifications: an observation model arising from an adaptive appearance model, an adaptive velocity motion model with adaptive noise variance, and an adaptive number of particles. The adaptive-velocity model is derived using a first-order linear predictor based on the appearance difference between the incoming observation and the previous particle configuration. Occlusion analysis is implemented using robust statistics. Experimental results on tracking visual objects in long outdoor and indoor video sequences demonstrate the effectiveness and robustness of our tracking algorithm. We then perform simultaneous tracking and recognition by embedding them in a particle filter. For recognition purposes, we model the appearance changes between frames and gallery images by constructing the intra- and extrapersonal spaces. Accurate recognition is achieved when confronted by pose and view variations.
VL - 13
SN - 1057-7149
CP - 11
M3 - 10.1109/TIP.2004.836152
ER -
TY - JOUR
T1 - The virtual microscope
JF - IEEE Transactions on Information Technology in Biomedicine
Y1 - 2003
A1 - Catalyurek,U.
A1 - Beynon,M. D
A1 - Chang,Chialin
A1 - Kurc, T.
A1 - Sussman, Alan
A1 - Saltz, J.
KW - biomedical optical imaging
KW - client software
KW - client/server architecture
KW - Computer architecture
KW - Computer Graphics
KW - computer platforms
KW - Computer simulation
KW - Concurrent computing
KW - configured data server
KW - data server software
KW - database management systems
KW - database software
KW - Database systems
KW - digital slide images
KW - digital telepathology
KW - diseases
KW - emulation
KW - Environment
KW - Equipment Design
KW - Equipment Failure Analysis
KW - high power light microscope
KW - Image databases
KW - Image Enhancement
KW - Image Interpretation, Computer-Assisted
KW - Image retrieval
KW - Information retrieval
KW - Information Storage and Retrieval
KW - java
KW - local disks
KW - microscope image data
KW - Microscopy
KW - multiple clients
KW - optical microscopy
KW - PACS
KW - software
KW - Software design
KW - software system
KW - Software systems
KW - Systems Integration
KW - Telepathology
KW - User-Computer Interface
KW - virtual microscope design
KW - Virtual reality
KW - Workstations
AB - We present the design and implementation of the virtual microscope, a software system employing a client/server architecture to provide a realistic emulation of a high power light microscope. The system provides a form of completely digital telepathology, allowing simultaneous access to archived digital slide images by multiple clients. The main problem the system targets is storing and processing the extremely large quantities of data required to represent a collection of slides. The virtual microscope client software runs on the end user's PC or workstation, while database software for storing, retrieving and processing the microscope image data runs on a parallel computer or on a set of workstations at one or more potentially remote sites. We have designed and implemented two versions of the data server software. One implementation is a customization of a database system framework that is optimized for a tightly coupled parallel machine with attached local disks. The second implementation is component-based, and has been designed to accommodate access to and processing of data in a distributed, heterogeneous environment. We also have developed caching client software, implemented in Java, to achieve good response time and portability across different computer platforms. The performance results presented show that the Virtual Microscope systems scales well, so that many clients can be adequately serviced by an appropriately configured data server.
VL - 7
SN - 1089-7771
CP - 4
M3 - 10.1109/TITB.2004.823952
ER -
TY - JOUR
T1 - Why not make interfaces better than 3D reality?
JF - IEEE Computer Graphics and Applications
Y1 - 2003
A1 - Shneiderman, Ben
KW - 3D interfaces
KW - 3D reality
KW - Atmosphere
KW - Avatars
KW - Cities and towns
KW - Collaboration
KW - Computer displays
KW - Computer Graphics
KW - error prevention
KW - history keeping
KW - information exploration
KW - Information Visualization
KW - movements
KW - Navigation
KW - occlusion
KW - overviews
KW - programming-by-demonstration
KW - rapid situation awareness
KW - Testing
KW - usability
KW - user action feedback
KW - User interfaces
KW - Virtual reality
KW - Visualization
AB - Many constrained interfaces are designed to be simpler than the real world by restricting movement, limiting interface actions, and keeping interface objects in a plane. However, the strong utility of pure 3D interfaces for medical, architectural, product design, and scientific visualization means that interface design for pure 3D remains an important challenge. An intriguing possibility is that enhanced 3D interfaces might offer simpler navigation, more compelling functionality, safer movements, and less occlusion, than 3D reality, especially for information exploration and visualization tasks. Such features can enable superhuman capabilities such as faster-than-light teleportation, flying through objects, and X-ray vision. Enhanced 3D interfaces might have supernatural tools such as magic wands for instantly shrinking, enlarging, duplicating, or sending objects and enchanted environments that provide error prevention, history keeping, and programming-by-demonstration. Playful game designers and creative application developers have already pushed the technology further than those who seek merely to mimic reality. Advanced designs are marked by their support of rapid situation awareness through effective overviews, reduced numbers of actions to accomplish tasks; and prompt, meaningful feedback for user actions. This article reviews these clever enhanced 3D-design features and encourages approaches that facilitate user tasks rather than mimic reality.
VL - 23
SN - 0272-1716
CP - 6
M3 - 10.1109/MCG.2003.1242376
ER -
TY - BOOK
T1 - Readings in Information Visualization: Using Vision to Think
Y1 - 1999
A1 - Card,Stuart K.
A1 - Mackinlay,Jock D.
A1 - Shneiderman, Ben
KW - Computer Graphics
KW - Computers / Computer Engineering
KW - Computers / Computer Graphics
KW - Computers / Computer Graphics / General
KW - Computers / Computer Science
KW - Computers / General
KW - Computers / Information Technology
KW - Computers / Information Theory
KW - Computers / Intelligence (AI) & Semantics
KW - Computers / Social Aspects / Human-Computer Interaction
KW - IMAGE PROCESSING
KW - Information display systems
KW - Information Visualization
KW - Psychology / General
KW - Visualization
AB - This groundbreaking book defines the emerging field of information visualization and offers the first-ever collection of the classic papers of the discipline, with introductions and analytical discussions of each topic and paper. The authors' intention is to present papers that focus on the use of visualization to discover relationships, using interactive graphics to amplify thought. This book is intended for research professionals in academia and industry; new graduate students and professors who want to begin work in this burgeoning field; professionals involved in financial data analysis, statistics, and information design; scientific data managers; and professionals involved in medical, bioinformatics, and other areas.* Full-color reproduction throughout* Author power team - an exciting and timely collaboration between the field's pioneering, most-respected names* The only book on Information Visualization with the depth necessary for use as a text or as a reference for the information professional* Text includes the classic source papers as well as a collection of cutting edge work
PB - Morgan Kaufmann
SN - 9781558605336
ER -
TY - BOOK
T1 - Image Analysis and Processing: 8th International Conference, Iciap '95, San Remo, Italy, September 13-15, 1995 : Proceedings
Y1 - 1995
A1 - Braccini,Carlo
A1 - De Floriani, Leila
A1 - Vernazza,Gianni
KW - Artificial intelligence
KW - COMPUTER AIDED DESIGN
KW - Computer Graphics
KW - Computer science
KW - Computer vision
KW - Computers / CAD-CAM
KW - Computers / Computer Graphics
KW - Computers / Computer Science
KW - Computers / Computer Vision & Pattern Recognition
KW - Computers / Image Processing
KW - Computers / Intelligence (AI) & Semantics
KW - Computers / Optical Data Processing
KW - Computers / Software Development & Engineering / General
KW - Electronic books
KW - IMAGE PROCESSING
KW - Image processing/ Congresses
KW - Imaging systems
KW - Optical data processing
KW - Optical pattern recognition
KW - software engineering
AB - This book presents the proceedings of the 8th International Conference on Image Analysis and Processing, ICIAP '95, held in Sanremo, Italy in September 1995 under the sponsorship of the International Association of Pattern Recognition IAPR.The volume presents 108 papers selected from more than 180 submissions together with six invited contributions. The papers are written by a total of 265 contributing authors and give a comprehensive state-of-the-art report on all current issues of image analysis and processing. Theoretical aspects are addressed as well as systems design and advanced applications, particularly in medical imaging.
PB - Springer
SN - 9783540602989
ER -
TY - JOUR
T1 - Image-browser taxonomy and guidelines for designers
JF - IEEE Software
Y1 - 1995
A1 - Plaisant, Catherine
A1 - Carr,D.
A1 - Shneiderman, Ben
KW - analysis
KW - Computer Graphics
KW - design
KW - designer guidelines
KW - Equations
KW - Europe
KW - Evaluation
KW - Formal specifications
KW - Graphical user interfaces
KW - Guidelines
KW - IMAGE PROCESSING
KW - image-browser taxonomy
KW - informal specification technique
KW - Laboratories
KW - large image browsing
KW - Layout
KW - Road transportation
KW - selected image exploration
KW - SHAPE
KW - Software design
KW - task taxonomy
KW - Taxonomy
KW - tools
KW - two-dimensional browsing
KW - user interface management systems
KW - visual databases
AB - In many applications users must browse large images. Most designers merely use two one-dimensional scroll bars or ad hoc designs for two-dimensional scroll bars. However, the complexity of two-dimensional browsing suggests that more careful analysis, design, and evaluation might lead to significant improvements. Our exploration of existing 2D browsers has led us to identify many features and a wide variety of tasks performed with the browsers. We introduce an informal specification technique to describe 2D browsers and a task taxonomy, suggest design features and guidelines, and assess existing strategies. We focus on the tools to explore a selected image and so do not cover techniques to browse a series of images or to browse large-image databases
VL - 12
SN - 0740-7459
CP - 2
M3 - 10.1109/52.368260
ER -
TY - CONF
T1 - Tree-maps: a space-filling approach to the visualization of hierarchical information structures
T2 - , IEEE Conference on Visualization, 1991. Visualization '91, Proceedings
Y1 - 1991
A1 - Johnson,B.
A1 - Shneiderman, Ben
KW - Computer displays
KW - Computer Graphics
KW - Computer science
KW - Data analysis
KW - display space
KW - Educational institutions
KW - Feedback
KW - hierarchical information structures
KW - HUMANS
KW - Laboratories
KW - Libraries
KW - Marine vehicles
KW - rectangular region
KW - semantic information
KW - space-filling approach
KW - tree-map visualization technique
KW - trees (mathematics)
KW - Two dimensional displays
KW - Visualization
AB - A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children
JA - , IEEE Conference on Visualization, 1991. Visualization '91, Proceedings
PB - IEEE
SN - 0-8186-2245-8
M3 - 10.1109/VISUAL.1991.175815
ER -