Interactive browsing of multimedia content in 3D space

Eduard Kuric

Abstract. The bachelor project describes existing interactive 3D user interfaces, visualization techniques and methods for manipulating and browsing of multimedia content in 3D space and discusses these solutions for purpose of possible improvment. This project includes survey of methods of organization data in 3D space and available support libraries for developers, too. The result of project is an application Vilcacora for browsing of multimedia content with a support of physical environment and simulation of real actions.

View to the desktop, loaded images were moved, rotated, resized by user interaction.
View to scene of picture overview. In the background is desktop with levitating pictures.

Interactive manipulation with 3D graphs

Martin Ľudvík

Abstract. The objective of this project is to analyze current situation in domain of graph visualization and manipulation in 3D space. It is finding alternative approaches to such a manipulation and tries to demonstrate them using simply system, as well.

Nodes placement using cone selection cursor.
Deleting node’s children using a cylinder selection cursor.
Helper lines that project nodes onto selection planes.

Constraints in Force-directed Graph Visualization

Jakub Ukrop

Abstract. Presented thesis deals with graph drawing methods based on spring embedder. The aim of this thesis is providing the summary of existing force-directed algorithms and designing a system for three-dimensional graph visualization. The system will provide automatic and manual constraining possibilities, in order to produce various specific graph layouts (e.g. walls, spheres, cylinders etc). In addition, it will demonstrate the possibilities of graph or subgraph modifications by means of the insertion and manipulation of additional (dummy) nodes.

Application of restrictions by entities.
Restriction by cube.
Example of restriction usage on better visualization of chosen node set.

Visual data mining in software

Bc. Filip Komorovský

Abstract. The main task of visual data mining in software is to speed up the process of obtaining information from software projects. The more complex the software project is, the more time is needed for new engineers to fully understand its structure, so they can start to implement additional features. That is why there is a demand for tools which could help programmers and software engineers understand these new projects in shortest possible time, so they could start to work on it effectively.

In this work we analyzed existing approaches for software visualization and visual data mining. A new way of software visualization is proposed, which enables interactive data mining from software projects. Visualization works with software systems developed in C# programming language. Proposed tool creates a model which is then used for interactive visual data mining. This model is represented by graph structures visualized in 3D space. Visualization is interactively driven by user requirements. The result of this thesis is a tool developed for software engineers, designated for visual and interactive data mining in software projects.

A visualization of an existing software system implemented in C#
Showing only classes sorted by number of methods

Reaction time evaluation with a car driver assistance system

Adam Valent, Filip Štiglic

Abstract. The aim of this project is a coope ration of two works. The first one is an assistance system for the driver, which detects and recognizes road traffic signs with a camera mounted in a moving vehicle and alerts the driver afterwards. The second work provides an experimental simulation environment, which allows evaluating the current level of driver’s awareness by monitoring the driver’s reactions. The goal of this project is to compare reaction response times of the driver with the assistance system turned on and off. Both works are in the last phase of implementation, which will be followed with an extensive testing on humans.

System architecture

Assistance system architecture


The detection part is responsible for detecting the areas with the candidates for traffic signs in a specific frame captured by camera. The process of detection is consisting of several steps. In the first step we use a color segmentation in which the colors specific for traffic signs are segmented to distinguish the colors of the traffic sign from the color of the environment. In the next step Canny edge detector is used to detect edges and in the last step Hough transformation is used to detect individual shapes.

Since the results of the detection part are the areas with the candidates of known shape and color, the detection part will be also used as a pre-classifier for the classification part. For this reason we decided to create a model of traffic sign groups of specific color and shape.

Classification part

The classification part is responsible for the classification of the areas with the candidates obtained from the detection part by comparing them with the template signs stored in the database. In order to be able to compare the area with the template sign from the database it is necessary to use a method, which will be fast enough, effective and invariant to the changes of scale, rotation and various lightning condition.

We decided to use the novel method introduced in 2006 – SURF [3] (speeded up robust features) which is a performant scale and rotation invariant interest point detector and descriptor. It approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be computed and compared much faster.

Simulation enviroment




Hand Tracking and Gesture Recognition Using Echo State Neural Networks

Peter Fillo

Abstract. Tracking an object in a video sequence is a complex problem which presents one of the fundamental task of image processing. One of the many use cases is controlling using hand gestures in Human-Computer Interaction. This paper introduces real-time hand recognition and tracking in video sequence with a classification of performed hand gestures. Hand recognition is based on foreground segmentation and skin region detection. Attributes of hand movements are being recorded and used as an input to a echo state neural network which performs hand gesture classification. Work presents proposed tracking algorithm and first results of gesture recognition.

Echo state neural networks

The echo state neural networks (ESN) can solve many problems based on time context. ESN networks are the special type of recurrent neural networks (RNN), but the randomly initialized hidden layer contains a high number of neurons, called dynamic reservoir (DR).

Training ESN

The training of ESN networks consist of following steps, outlined by [6]:

  1. Initialization an untrained ESN which has the echo state property.
  2. Sample network training dynamics
  3. Compute output weights

Hand tracking algorithm and implementation

Gesture recognition and experiments



Library for graph visualization in 3D space

Peter Kajan

Abstract. The presented thesis deals with the visualization of large graphs. Chosen dynamic graph layout algorithms are analyzed in this paper. Algorithms computed on GPU are also mentioned and one of them is analyzed. Further, this paper deals with rendering optimization using scene graph. The goal of this thesis was to design and implement system able to visualize large graphs in 3D space using one of the analyzed layout algorithms and one of the scene graphs. The system has been tested on the set of graphs with known and unknown shape. It achieves “nice”drawings of graphs up to 5000 vertices in satisfying period of time. Results are presented at the end of this paper.

Enslyon (2682 nodes).
Veolia (639 nodes).
Graph illustrating small world (100 nodes).
Graph illustrating sending mail between people during year.

Visualizing graph structures using soap bubbles

Bc. Ľuboš Ukrop

Abstract. Lots of information has structural character with some kind of relations. This type of information could naturally be represented by the graphs. A common way to enhance human understanding of graph is to visualize it. Many studies have already been devoted to this area, with most of them following conventional graph drawing techniques. In this thesis we present an experimental algorithm based on the springembedder technique, which tries to visualize graph structures using realistically rendered 3D soap bubble clusters. For its demonstration, a simple interactive visualization system was implemented. The process of system and algorithm development along with capabilities and issues connected with its use is discussed in detail.

Visualization of chosen graphs from Rome set.
Visualization without space restrictions.
Visualization with active space restrictions.
Visualization of software artifact graph.

Visualization of program execution in 3D environment

Bc. Ivan Ruttkay-Nedecký

Abstract. Program execution consists of many abstract processes. In order to understand the whole program, one has to understand these processes first. A good imagination is required. Here visualization takes its part. This work discusses visualization of program execution in 3D environment, which should help to understand algorithms contained in programs. The work describes monitoring of program execution as a sequence of events – method execution, setting a field, a class instance construction etc. Extraction of relevant information for visualization is described. Then the work deals with visualization of these events. It looks for a way, how to visualize program elements (class, instance, method, field) and relations between them (class and its instances, fields and methods) effectively. The work deals with visualization of program execution as a control flow and data flow animation.

Animation in created system.

Entities closer to the camera have their full description. Others have only their name.

Software development in 3D space

Bc. Martin Ludvík

Abstract. Software development and maintenance is very expensive, and the issues related to the  intellectual understanding associated with the development of new programs are growing at a fast pace. Previous research has shown, that using 3D software visualizations in this field can lead to several advantages. Yhis project’s goal is to analyze current situation in domain of software visualization and visual programming. It deals with various graphics representations of software and corresponding interaction techniques as well. It is finding alternative approaches to software development using visualization and interaction in 3D space.

Program structure.
Rectangle class.

Representation of programs in graphs and their execution

Bc. Michal Kottman

Abstract. This work concentrates on the problematics of visual programming and visual programming languages as a means for the creation, editing and execution of visual programs. It lists several advantages and disadvantages of this approach. It provides necessary definitions and states the classification of visual programming languages and their paradigms. It also explains several means of formal visual language specification. Existing visual environments and languages are analyzed and their distinguishing traits are explained. It then addresses the representation of programs with the means of graphs and the creation of such graphs. A new notation for representing software based on hypergraphs is presented. A new visual language is specified based on presented notation, together with it’s syntax and execution model. Finally, a visual programming environment for the specified language is presented. It enables the user to create, modify and run programs based on the specified language.

Import of existing code to Vilie.
Detail of log function.
Selected functions from LuaDist project.

Data visualization using sky metaphor

Bc. Martin Jakubéci

Abstract. The basis of every visualization is data, which can have different forms. Interesting are more complicated structures like common graphs, their generalization in form of hypergraphs and multidimensional data. Hypergraphs have big possibilities, but are not used very often. They could be used for representation of complicated relations, for example ontologies using topic maps. Important aspects of visualization are interaction and clustering of large data. Data visualization can use different metaphors. This approach should make the data more familiar to user by visualization using known images. This diploma thesis brings a new approach to 3D visualization of hypergraphs and multidimensional data using sky metaphor.

A visualization of an existing software system using nebulae visualization of hypergraph representation
Visualization of multi-dimenstional data