Browsing by Author "Pflüger, Hermann"

Now showing 1 - 3 of 3

Open Access
An interface to view collections of visual art
(2023) Pflüger, Hermann; Viehhauser, Gabriel; Tumanov, Rostislav
Art experts prefer being able to look at the individual images they are working on in the course of their research. However, if one were to look at digitally accessible images in the field of visual art, one would be dealing with billions of images; no one can handle visually examining such huge numbers of images one at a time. Therefore, art experts need special tools to examine and describe artworks in the context of other artworks. We used our experience from previous projects and interviews with members of the target group (art historians, curators, art dealers, and artists) to identify the central issues these experts encounter when working with large image collections and to determine the functionality and properties a system must offer to support their work. The results led to the customized interface LadeCA.View, which is now used in several projects. LadeCA.View enables experts to describe an exhibition or a collection of visual art in such a way that a user can obtain an overview of the intention, content, and structures of the exhibition or collection within a short period of time without looking at each image individually. LadeCA.View can also be used as an interface to probe more deeply into a collection or exhibition. In this paper we show the functions and visualizations of the interface and explain the design decisions. Furthermore, we outline LadeCA.View’s scope of applicability using three case studies
Open Access
A method for describing, analyzing, and exploring visual art collections
(2024) Pflüger, Hermann
Visual art collections are more than just sets of images. Behind a collection or an exhibition are the curator’s concept and the specific characteristics of the collection. A controlled vocabulary that takes into account the concept and the specific characteristics of a collection requires individual terms/concepts, and specific relationships between the concepts of the vocabulary. Furthermore, the granularity of a controlled vocabulary should be adapted to a particular concept of the collection, i.e., for some areas, the number of terms/concepts should be very high and specific; for other areas, concepts should be summarized to keep the complexity of the collection low and thus facilitate the handling and presentation of the collection. A LadeCA vocabulary is an extended controlled vocabulary that is particularly suitable for collections of works of art. LadeCA enables a user to describe, analyze, and explore art collections. LadeCA is also suitable for comparing the contents of different collections or different parts of a collection. The general concepts of a controlled vocabulary/thesaurus, their terms, and defined semantic relations between them can be automatically adopted in a LadeCA vocabulary so that the vocabulary only needs to be adapted for the current collection. The process of creating a LadeCA vocabulary for art collections is supported by three interactive interfaces that ensure that the intention behind a collection is taken into account, and that the creation effort is kept low. This article explains the process of creating LadeCA vocabularies for art collections and describes the initial experiences and results.
Open Access
Untersuchung von Eindeutigen Büchi Automaten
(2011) Pflüger, Hermann
Im Gegensatz zu Automaten über endlichen Wörtern haben deterministische Büchi Automaten nicht die selbe Ausdrucksstärke wie nichtdeterministische Büchi Automaten. Für nichtdeterministische Büchi Automaten sind häufig nur erheblich schlechtere Algorithmen für die verschiedenen Berechnungsprobleme bekannt. Aus diesem Grund sind Einschränkungen von nichtdeterministischen Büchi Automaten interessant, welche immer noch die volle Ausdrucksstärke haben, dabei jedoch ähnlich effiziente Verfahren wie deterministische Büchi Automaten erlauben. Eine solche Einschränkung bilden die stark eindeutigen Büchi Automaten von Carton und Michel. In dieser Arbeit wird ein ähnlicher Automat mit geringerer Komplexität vorgestellt. Eine noch gerinere Komplexität haben die in dieser Arbeit vorgestellten "stark k-eindeutige Büchi Automaten", die zwar nicht eindeutig nach der allgemeinen Definition sind, jedoch ähnliche Eigenschaften wie stark eindeutige Büchi Automaten zeigen, insbesonder bei der Komplementbildung. Weiterhin wird in dieser Arbeit für eine spezielle Sprachklasse ein deterministischer, stark eindeutiger Büchi Automat beschrieben. Für alle diese Automaten wird, ausgehend von der starken Erkennung einer Sprache, eine Konstruktion gezeigt.