Position innerhalb des Seitenbaumes

Start
Institut
Team
Cutura

Rene Cutura

Herr

Wiss. Mitarbeiter
Visualisierungsinstitut der Universität Stuttgart (VISUS)
Arbeitsgruppe Sedlmair

Kontakt

E-Mail

Allmandring 19
70569 Stuttgart
Deutschland

Publikationen

2021
1. Rijken, Gerrit J ; Cutura, Rene ; Heyen, Frank ; Sedlmair, Michael ; Correll, Michael ; Dykes, Jason ; Smit, Noeska: Illegible Semantics: Exploring the Design Space of Metal Logos. In: IEEE VIS alt.VIS Workshop, IEEE VIS alt.VIS Workshop, 2021
  - BibTeX
  - Link
  BibTeX
  @inproceedings{rijken2021altvis, abstract = {The logos of metal bands can be by turns gaudy, uncouth, or nearly illegible. Yet, these logos work: they communicate sophisticated notions of genre and emotional affect. In this paper we use the design considerations of metal logos to explore the space of "illegible semantics": the ways that text can communicate information at the cost of readability, which is not always the most important objective. In this work, drawing on formative visualization theory, professional design expertise, and empirical assessments of a corpus of metal band logos, we describe a design space of metal logos and present a tool through which logo characteristics can be explored through visualization. We investigate ways in which logo designers imbue their text with meaning and consider opportunities and implications for visualization more widely.}, author = {Rijken, Gerrit J and Cutura, Rene and Heyen, Frank and Sedlmair, Michael and Correll, Michael and Dykes, Jason and Smit, Noeska}, booktitle = {IEEE VIS alt.VIS Workshop}, title = {Illegible Semantics: Exploring the Design Space of Metal Logos}, url = {https://arxiv.org/abs/2109.01688}, year = 2021 }
  Link
  https://arxiv.org/abs/2109.01688
2. Morariu, Cristina ; Bibal, Adrien ; Cutura, Rene ; Frenay, Benoit ; Sedlmair, Michael: DumbleDR: Predicting User Preferences of Dimensionality Reduction Projection Quality (Technical Report Nr. arXiv:2105.09275) : arXiv preprint, 2021
  - BibTeX
  - Link
  BibTeX
  @techreport{morariu2021arxiv, abstract = {A plethora of dimensionality reduction techniques have emerged over the past decades, leaving researchers and analysts with a wide variety of choices for reducing their data, all the more so given some techniques come with additional parametrization (e.g. t-SNE, UMAP, etc.). Recent studies are showing that people often use dimensionality reduction as a black-box regardless of the specific properties the method itself preserves. Hence, evaluating and comparing 2D projections is usually qualitatively decided, by setting projections side-by-side and letting human judgment decide which projection is the best. In this work, we propose a quantitative way of evaluating projections, that nonetheless places human perception at the center. We run a comparative study, where we ask people to select 'good' and 'misleading' views between scatterplots of low-level projections of image datasets, simulating the way people usually select projections. We use the study data as labels for a set of quality metrics whose purpose is to discover and quantify what exactly people are looking for when deciding between projections. With this proxy for human judgments, we use it to rank projections on new datasets, explain why they are relevant, and quantify the degree of subjectivity in projections selected.}, author = {Morariu, Cristina and Bibal, Adrien and Cutura, Rene and Frenay, Benoit and Sedlmair, Michael}, institution = {{arXiv} preprint}, number = {arXiv:2105.09275}, title = {DumbleDR: Predicting User Preferences of Dimensionality Reduction Projection Quality}, type = {Technical Report}, url = {https://arxiv.org/abs/2105.09275}, year = 2021 }
  Link
  https://arxiv.org/abs/2105.09275
3. Cutura, Rene ; Angerbauer, Katrin ; Heyen, Frank ; Hube, Natalie ; Sedlmair, Michael: DaRt: Generative Art using Dimensionality Reduction Algorithms. In: 2021 IEEE VIS Arts Program (VISAP), 2021 IEEE VIS Arts Program (VISAP) : IEEE, 2021, S. 59--72
  - BibTeX
  - Link
  BibTeX
  @inproceedings{cutura2021generative, abstract = {Dimensionality Reduction (DR) is a popular technique that is often used in Machine Learning and Visualization communities to analyze high-dimensional data. The approach is empirically proven to be powerful for uncovering previously unseen structures in the data. While observing the results of the intermediate optimization steps of DR algorithms, we coincidently discovered the artistic beauty of the DR process. With enthusiasm for the beauty, we decided to look at DR from a generative art lens rather than their technical application aspects and use DR techniques to create artwork. Particularly, we use the optimization process to generate images, by drawing each intermediate step of the optimization process with some opacity over the previous intermediate result. As another alternative input, we used a neural-network model for face-landmark detection, to apply DR to portraits, while maintaining some facial properties, resulting in abstracted facial avatars. In this work, we provide such a collection of such artwork.}, author = {Cutura, Rene and Angerbauer, Katrin and Heyen, Frank and Hube, Natalie and Sedlmair, Michael}, booktitle = {2021 IEEE VIS Arts Program (VISAP)}, doi = {10.1109/VISAP52981.2021.00013}, organization = {IEEE}, pages = {59--72}, title = {DaRt: Generative Art using Dimensionality Reduction Algorithms}, url = {https://ieeexplore.ieee.org/document/9622987}, year = 2021 }
  Link
  https://ieeexplore.ieee.org/document/9622987
4. Cutura, Rene ; Morariu, Cristina ; Cheng, Zhanglin ; Wang, Yunhai ; Weiskopf, Daniel ; Sedlmair, Michael: Hagrid — Gridify Scatterplots with Hilbert and Gosper Curves. In: The 14th International Symposium on Visual Information Communication and Interaction, The 14th International Symposium on Visual Information Communication and Interaction. Potsdam, Germany : Association for Computing Machinery, 2021 — ISBN 9781450386470, S. 1:1—1:8
  - BibTeX
  - Link
  BibTeX
  @inproceedings{10.1145/3481549.3481569, abstract = { A common enhancement of scatterplots represents points as small multiples, glyphs, or thumbnail images. As this encoding often results in overlaps, a general strategy is to alter the position of the data points, for instance, to a grid-like structure. Previous approaches rely on solving expensive optimization problems or on dividing the space that alter the global structure of the scatterplot. To find a good balance between efficiency and neighborhood and layout preservation, we propose Hagrid, a technique that uses space-filling curves (SFCs) to “gridify” a scatterplot without employing expensive collision detection and handling mechanisms. Using SFCs ensures that the points are plotted close to their original position, retaining approximately the same global structure. The resulting scatterplot is mapped onto a rectangular or hexagonal grid, using Hilbert and Gosper curves. We discuss and evaluate the theoretic runtime of our approach and quantitatively compare our approach to three state-of-the-art gridifying approaches, DGrid, Small multiples with gaps SMWG, and CorrelatedMultiples CMDS, in an evaluation comprising 339 scatterplots. Here, we compute several quality measures for neighborhood preservation together with an analysis of the actual runtimes. The main results show that, compared to the best other technique, Hagrid is faster by a factor of four, while achieving similar or even better quality of the gridified layout. Due to its computational efficiency, our approach also allows novel applications of gridifying approaches in interactive settings, such as removing local overlap upon hovering over a scatterplot.}, address = {New York, NY, USA}, articleno = {1}, author = {Cutura, Rene and Morariu, Cristina and Cheng, Zhanglin and Wang, Yunhai and Weiskopf, Daniel and Sedlmair, Michael}, booktitle = {The 14th International Symposium on Visual Information Communication and Interaction}, doi = {10.1145/3481549.3481569}, isbn = {9781450386470}, location = {Potsdam, Germany}, numpages = {8}, pages = {1:1—1:8}, publisher = {Association for Computing Machinery}, series = {VINCI 2021}, title = {Hagrid — Gridify Scatterplots with Hilbert and Gosper Curves}, url = {https://doi.org/10.1145/3481549.3481569}, year = 2021 }
  Link
  https://doi.org/10.1145/3481549.3481569
2020
1. Achberger, Alexander ; Cutura, René ; Türksoy, Oguzhan ; Sedlmair, Michael: Caarvida: Visual Analytics for Test Drive Videos. In: Proceedings of the International Conference on Advanced Visual Interfaces, Proceedings of the International Conference on Advanced Visual Interfaces, 2020, S. 1--9
  - BibTeX
  - Link
  BibTeX
  @inproceedings{achberger2020caarvida, abstract = {We report on an interdisciplinary visual analytics project wherein automotive engineers analyze test drive videos. These videos are annotated with navigation-specific augmented reality (AR) con�tent, and the engineers need to identify issues and evaluate the behavior of the underlying AR navigation system. With the increas�ing amount of video data, traditional analysis approaches can no longer be conducted in an acceptable timeframe. To address this issue, we collaboratively developed Caarvida, a visual analytics tool that helps engineers to accomplish their tasks faster and handle an increased number of videos. Caarvida combines automatic video analysis with interactive and visual user interfaces. We conducted two case studies which show that Caarvida successfully supports domain experts and speeds up their task completion time.}, author = {Achberger, Alexander and Cutura, René and Türksoy, Oguzhan and Sedlmair, Michael}, booktitle = {Proceedings of the International Conference on Advanced Visual Interfaces}, doi = {10.1145/3399715.3399862}, pages = {1--9}, title = {Caarvida: Visual Analytics for Test Drive Videos}, url = {https://doi.org/10.1145/3399715.3399862}, year = 2020 }
  Link
  https://doi.org/10.1145/3399715.3399862

Rene Cutura

Kontakt

Publikationen

2021

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

Link

2020

BibTeX

Link

Zielgruppe

Formalia

Services

Organisation

Rene Cutura

Kontakt

Publikationen

2021

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

Link

2020

BibTeX

Link

So erreichen Sie uns

Zielgruppe

Formalia

Services

Organisation