Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 8 de 8
Filter
Add more filters










Database
Language
Publication year range
1.
IEEE Trans Vis Comput Graph ; 28(7): 2682-2696, 2022 07.
Article in English | MEDLINE | ID: mdl-33201819

ABSTRACT

We present a multi-level area balancing technique for laying out clustered graphs to facilitate a comprehensive understanding of the complex relationships that exist in various fields, such as life sciences and sociology. Clustered graphs are often used to model relationships that are accompanied by attribute-based grouping information. Such information is essential for robust data analysis, such as for the study of biological taxonomies or educational backgrounds. Hence, the ability to smartly arrange textual labels and packing graphs within a certain screen space is therefore desired to successfully convey the attribute data . Here we propose to hierarchically partition the input screen space using Voronoi tessellations in multiple levels of detail. In our method, the position of textual labels is guided by the blending of constrained forces and the forces derived from centroidal Voronoi cells. The proposed algorithm considers three main factors: (1) area balancing, (2) schematized space partitioning, and (3) hairball management. We primarily focus on area balancing, which aims to allocate a uniform area for each textual label in the diagram. We achieve this by first untangling a general graph to a clustered graph through textual label duplication, and then coupling with spanning-tree-like visual integration. We illustrate the feasibility of our approach with examples and then evaluate our method by comparing it with well-known conventional approaches and collecting feedback from domain experts.


Subject(s)
Algorithms , Computer Graphics
2.
IEEE Trans Vis Comput Graph ; 28(4): 1848-1861, 2022 Apr.
Article in English | MEDLINE | ID: mdl-32986554

ABSTRACT

In this article, we present an algorithm capable of mixed labeling of 2D and 3D objects. In mixed labeling, the given objects are labeled with both internal labels placed (at least partially) over the objects and external labels placed in the space around the objects and connected with the labeled objects with straight-line leaders. The proposed algorithm determines the position and type of each label based on the user-specified ambiguity threshold and eliminates overlaps between the labels, as well as between the internal labels and the straight-line leaders of external labels. The algorithm is a screen-space technique; it operates in an image where the 2D objects or projected 3D objects are encoded. In other words, we can use the algorithm whenever we can render the objects to an image, which makes the algorithm fit for use in many domains. The algorithm operates in real-time, giving the results immediately. Finally, we present results from an expert evaluation, in which a professional illustrator has evaluated the label layouts produced with the proposed algorithm.

3.
Front Big Data ; 4: 802452, 2021.
Article in English | MEDLINE | ID: mdl-34901846
4.
Comput Graph Forum ; 39(3): 619-646, 2020 Jun.
Article in English | MEDLINE | ID: mdl-33041405

ABSTRACT

Transit maps are designed to present information for using public transportation systems, such as urban railways. Creating a transit map is a time-consuming process, which requires iterative information selection, layout design, and usability validation, and thus maps cannot easily be customised or updated frequently. To improve this, scientists investigate fully- or semi-automatic techniques in order to produce high quality transit maps using computers and further examine their corresponding usability. Nonetheless, the quality gap between manually-drawn maps and machine-generated maps is still large. To elaborate the current research status, this state-of-the-art report provides an overview of the transit map generation process, primarily from Design, Machine, and Human perspectives. A systematic categorisation is introduced to describe the design pipeline, and an extensive analysis of perspectives is conducted to support the proposed taxonomy. We conclude this survey with a discussion on the current research status, open challenges, and future directions.

5.
BMC Bioinformatics ; 20(1): 187, 2019 Apr 15.
Article in English | MEDLINE | ID: mdl-30991966

ABSTRACT

BACKGROUND: Biological pathways represent chains of molecular interactions in biological systems that jointly form complex dynamic networks. The network structure changes from the significance of biological experiments and layout algorithms often sacrifice low-level details to maintain high-level information, which complicates the entire image to large biochemical systems such as human metabolic pathways. RESULTS: Our work is inspired by concepts from urban planning since we create a visual hierarchy of biological pathways, which is analogous to city blocks and grid-like road networks in an urban area. We automatize the manual drawing process of biologists by first partitioning the map domain into multiple sub-blocks, and then building the corresponding pathways by routing edges schematically, to maintain the global and local context simultaneously. Our system incorporates constrained floor-planning and network-flow algorithms to optimize the layout of sub-blocks and to distribute the edge density along the map domain. We have developed the approach in close collaboration with domain experts and present their feedback on the pathway diagrams based on selected use cases. CONCLUSIONS: We present a new approach for computing biological pathway maps that untangles visual clutter by decomposing large networks into semantic sub-networks and bundling long edges to create space for presenting relationships systematically.


Subject(s)
Computational Biology/methods , Metabolic Networks and Pathways , Models, Biological , Algorithms , Humans , Maps as Topic
6.
IEEE Trans Vis Comput Graph ; 25(1): 977-986, 2019 Jan.
Article in English | MEDLINE | ID: mdl-30130195

ABSTRACT

Labeling is intrinsically important for exploring and understanding complex environments and models in a variety of domains. We present a method for interactive labeling of crowded 3D scenes containing very many instances of objects spanning multiple scales in size. In contrast to previous labeling methods, we target cases where many instances of dozens of types are present and where the hierarchical structure of the objects in the scene presents an opportunity to choose the most suitable level for each placed label. Our solution builds on and goes beyond labeling techniques in medical 3D visualization, cartography, and biological illustrations from books and prints. In contrast to these techniques, the main characteristics of our new technique are: 1) a novel way of labeling objects as part of a bigger structure when appropriate, 2) visual clutter reduction by labeling only representative instances for each type of an object, and a strategy of selecting those. The appropriate level of label is chosen by analyzing the scene's depth buffer and the scene objects' hierarchy tree. We address the topic of communicating the parent-children relationship between labels by employing visual hierarchy concepts adapted from graphic design. Selecting representative instances considers several criteria tailored to the character of the data and is combined with a greedy optimization approach. We demonstrate the usage of our method with models from mesoscale biology where these two characteristics-multi-scale and multi-instance-are abundant, along with the fact that these scenes are extraordinarily dense.

7.
IEEE Trans Vis Comput Graph ; 22(1): 945-54, 2016 Jan.
Article in English | MEDLINE | ID: mdl-26529738

ABSTRACT

Scalar topology in the form of Morse theory has provided computational tools that analyze and visualize data from scientific and engineering tasks. Contracting isocontours to single points encapsulates variations in isocontour connectivity in the Reeb graph. For multivariate data, isocontours generalize to fibers-inverse images of points in the range, and this area is therefore known as fiber topology. However, fiber topology is less fully developed than Morse theory, and current efforts rely on manual visualizations. This paper presents how to accelerate and semi-automate this task through an interface for visualizing fiber singularities of multivariate functions R³ → R². This interface exploits existing conventions of fiber topology, but also introduces a 3D view based on the extension of Reeb graphs to Reeb spaces. Using the Joint Contour Net, a quantized approximation of the Reeb space, this accelerates topological visualization and permits online perturbation to reduce or remove degeneracies in functions under study. Validation of the interface is performed by assessing whether the interface supports the mathematical workflow both of experts and of less experienced mathematicians.


Subject(s)
Computer Graphics , Image Processing, Computer-Assisted/methods , Algorithms , Humans , Research Design , Surface Properties , User-Computer Interface
8.
Food Microbiol ; 27(4): 460-7, 2010 Jun.
Article in English | MEDLINE | ID: mdl-20417394

ABSTRACT

Isolation and identification of the autochthonous starter from a naturally fermented meat allows control of the fermentation process and promises microbiological safety for this specialty. Thus the purpose of this study was to identify the lactic acid bacteria and coagulase-negative cocci present in a traditional Taiwanese naturally fermented ham (TNFH) and to study the microbial dynamics at different ripening stages; the approach was a combination of conventional microbiological cultivation, polymerase chain reaction-denaturing gradient gel electrophoresis and DNA sequencing. In total, twelve different strains of lactic acid bacteria and three Staphylococcus strains were identified in the TNFH samples, whereas only 5 dominant strains were observed in the TNFH samples when the DGGE as a culture-independent method was applied. The bacterial ecology on the surface of the samples was mainly characterized by the stable presence of Lactobacillus sakei and Staphylococcus saprophyticus; nonetheless Leuconostoc mesenteroides and Carnobacterium divergens were the most abundant bacteria found in the final product. These results are also agreed with the findings of the culture-independent method. In addition, Microbacterium spp., Carnobacterium spp., Enterobacter spp., Brochothrix spp., Enterococcus spp., and Bacillus spp. were also present at the beginning of the ripening, but few bacteria were found at the center of the TNFH samples during the early ripening stages. However, after 30 days of ripening, the microbial ecology at the center of the TNFH samples paralleled that of the surface. Finally, as far as we have been able to determine, our report is the first to investigate the microbiological dynamics in fermented meat products using combination of cultivation, the Harrison disc method, DGGE and DNA sequencing as the culture-dependent method. Our report is also the first to show the presence of Staphylococcus arlettae in a fermented sausage and ham product.


Subject(s)
DNA, Bacterial/analysis , Lactobacillaceae/growth & development , Meat Products/microbiology , Staphylococcus/growth & development , Animals , Base Sequence , Colony Count, Microbial , Culture Media , Electrophoresis, Gel, Pulsed-Field , Fermentation , Food Microbiology , Humans , Lactobacillaceae/isolation & purification , Polymerase Chain Reaction , Population Dynamics , Staphylococcus/isolation & purification , Swine , Taiwan
SELECTION OF CITATIONS
SEARCH DETAIL
...