Abstract: Recognizing and controlling vocal registers during
singing is a difficult task for beginner vocalist. It requires among
others identifying which part of natural resonators is being used
when a sound propagates through the body. Thus, an application
has been designed allowing for sound recording, automatic vocal
register recognition (VRR), and a graphical user interface providing
real-time visualization of the signal and recognition results. Six
spectral features are determined for each time frame and passed to the
support vector machine classifier yielding a binary decision on the
head or chest register assignment of the segment. The classification
training and testing data have been recorded by ten professional
female singers (soprano, aged 19-29) performing sounds for both
chest and head register. The classification accuracy exceeded 93%
in each of various validation schemes. Apart from a hard two-class
clustering, the support vector classifier returns also information on
the distance between particular feature vector and the discrimination
hyperplane in a feature space. Such an information reflects the level
of certainty of the vocal register classification in a fuzzy way. Thus,
the designed recognition and training application is able to assess and
visualize the continuous trend in singing in a user-friendly graphical
mode providing an easy way to control the vocal emission.
Abstract: This paper presents a real-time visualization technique
and filtering of classified LiDAR point clouds. The visualization is
capable of displaying filtered information organized in layers by the
classification attribute saved within LiDAR datasets. We explain the
used data structure and data management, which enables real-time
presentation of layered LiDAR data. Real-time visualization is
achieved with LOD optimization based on the distance from the
observer without loss of quality. The filtering process is done in two
steps and is entirely executed on the GPU and implemented using
programmable shaders.
Abstract: This paper presents a visualized computer aided case tool for non-expert, called Visual Time, for representing and reasoning about incomplete and uncertain temporal information. It is both expressive and versatile, allowing logical conjunctions and disjunctions of both absolute and relative temporal relations, such as “Before”, “Meets”, “Overlaps”, “Starts”, “During”, and “Finishes”, etc. In terms of a visualized framework, Visual Time provides a user-friendly environment for describing scenarios with rich temporal structure in natural language, which can be formatted as structured temporal phrases and modeled in terms of Temporal Relationship Diagrams (TRD). A TRD can be automatically and visually transformed into a corresponding Time Graph, supported by automatic consistency checker that derives a verdict to confirm if a given scenario is temporally consistent or inconsistent.
Abstract: In today-s world, the efficient utilization of wood
resources comes more and more to the mind of forest owners. It is a
very complex challenge to ensure an efficient harvest of the wood
resources. This is one of the scopes the project “Virtual Forest II"
addresses. Its core is a database with data about forests containing
approximately 260 million trees located in North Rhine-Westphalia
(NRW). Based on this data, tree growth simulations and wood
mobilization simulations can be conducted. This paper focuses on the
latter. It describes a discrete-event-simulation with an attached 3-D
real time visualization which simulates timber harvest using trees
from the database with different crop resources. This simulation can
be displayed in 3-D to show the progress of the wood crop. All the
data gathered during the simulation is presented as a detailed
summary afterwards. This summary includes cost-benefit
calculations and can be compared to those of previous runs to
optimize the financial outcome of the timber harvest by exchanging
crop resources or modifying their parameters.
Abstract: We present a visualization technique for radial drawing of trees consisting of two slightly different algorithms. Both of them make use of node-link diagrams for visual encoding. This visualization creates clear drawings without edge crossing. One of the algorithms is suitable for real-time visualization of large trees, as it requires minimal recalculation of the layout if leaves are inserted or removed from the tree; while the other algorithm makes better utilization of the drawing space. The algorithms are very similar and follow almost the same procedure but with different parameters. Both algorithms assign angular coordinates for all nodes which are then converted into 2D Cartesian coordinates for visualization. We present both algorithms and discuss how they compare to each other.