@inproceedings{muller2025_106621,
  title = {Scalable summary based retrieval in P2P networks},
  author = {Müller, Wolfgang and Eisenhardt, Martin and Henrich, Andreas},
  year = {2025},
  pages = {586-593},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066218},
  url = {https://fis.uni-bamberg.de/handle/uniba/106621},
  language = {deu},
  abstract = {Much of the present P2P-IR literature is focused on distributed indexing structures. Within this paper, we present an approach based on the replication of peer data summaries via rumor spreading and multicast in a structured overlay.We will describe Rumorama, a P2P framework for similar-ity queries inspired by GlOSS and CORI and their P2P-adaptation, PlanetP. Rumorama achieves a hierarchization of PlanetP-like summary-based P2P-IR networks. In a Rumorama network, each peer views the network as a small PlanetP network with connections to peers that see other small PlanetP networks. One important aspect is that each peer can choose the size of the PlanetP network it wants to see according to its local processing power and bandwidth. Even in this adaptive environment, Rumorama manages to process a query such that the summary of each peer is considered exactly once in a network without churn. However, the actual number of peers to be contacted for a query is a small fraction of the total number of peers in the network.Within this article, we present the Rumorama base protocol, as well as experiments demonstrating the scalability and viability of the approach under churn.},
  keywords = {P2P, Similarity Search, Distributed IR}
}

@inproceedings{blank2025_106620,
  title = {Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks},
  author = {Blank, Daniel and El Allali, Soufyane and Müller, Wolfgang and Henrich, Andreas},
  year = {2025},
  pages = {143-151},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066207},
  url = {https://fis.uni-bamberg.de/handle/uniba/106620},
  language = {eng},
  abstract = {In this paper we introduce a simple yet experimentally convincing approach in the research field of source selection for content-based similarity search in P2P networks or, more concretely, in summary-based P2P systems. In these systems, summaries are used for data source selection when performing k-NN queries on distributed collections of documents represented by feature vectors.
We introduce a new type of cluster-based summaries for source selection that can efficiently and cheaply be calculated and distributed in P2P networks. For the summaries generation, a very large number of sample points is used. Each peer in the network assigns its indexing data to their corresponding closest sample points and publishes its constructed summary. We evaluate the quality of these summaries when changing the number of sample points used in experiments on real-world image feature data obtained from a large crawl of the flickr web photo community and show that for higher numbers of sample points we achieve a better retrieval performance. Our experiments show that the proposed summaries yield four times better performance with respect to previous methods. Intuitively, there are some disadvantages to this approach due to the large size of the generated summaries. We show experimentally, that these disadvantages can easily be overcome due to the sparse nature of the generated summaries by simple compression techniques.},
  keywords = {P2P, CBIR, Source selection}
}

@inproceedings{muller2025_106613,
  title = {Fast Retrieval of High-Dimensional Feature Vectors in P2P Networks Using Compact Peer Data Summaries},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2025},
  pages = {79–86},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066131},
  url = {https://fis.uni-bamberg.de/handle/uniba/106613},
  language = {deu},
  abstract = {The retrieval facilities of most Peer-to-Peer (P2P) systems are limited to queries based on a unique identifier or a small set of keywords. The techniques used for this purpose are hardly applicable for content-based image retrieval (CBIR) in a P2P network. Furthermore, we will argue that the curse of dimensionality and the high communication overhead prevent the adaptation of multidimensional search trees or fast sequential scan techniques for P2P CBIR. In the present paper we will propose two compact data representations which can be distributed in a P2P network and used as the basis for a source selection. This allows to communicate only with a small fraction of all peers during query processing without deteriorating the result quality significantly. We will also present experimental results confirming our approach.},
  keywords = {Algorithms, Performance}
}

@inproceedings{muller2025_106380,
  title = {Aspects of Adaptivity in P2P Information Retrieval},
  author = {Müller, Wolfgang and Henrich, Andreas and Eisenhardt, Martin},
  year = {2025},
  pages = {164-178},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1063804},
  url = {https://fis.uni-bamberg.de/handle/uniba/106380},
  language = {eng},
  abstract = {Peer-to-Peer networks are comprised of multiple independently administered computers (peers) that cooperate via a common protocol in order to achieve a goal common to the peers. Helping the user find relevant information in a P2P network is the subject of the field of Peer-to-Peer IR.
In order to be successful, a P2P-IR system needs to be adaptive in several respects. It has to adapt both to the user and to its environment. Within this article we detail the motivations and challenges of P2P-IR, as well as the ways in which P2P-IR systems adapt and where improvement is needed in order to achieve adaptive multimedia retrieval.},
  keywords = {P2P Information Retrieval}
}

@inproceedings{elallali2025_106376,
  title = {Image Data Source Selection Using Gaussian Mixture Models},
  author = {El Allali, Soufyane and Blank, Daniel and Müller, Wolfgang and Henrich, Andreas},
  year = {2025},
  pages = {170-181},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1063764},
  url = {https://fis.uni-bamberg.de/handle/uniba/106376},
  language = {eng},
  abstract = {In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. In literature, a variety of approaches exist. One of which is data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted.
In this paper we use a Gaussian mixture model to generate peer summaries using the peers’ local data. We compare this method to other local unsupervised clustering methods for generating peer summaries and show that a Gaussian mixture model is promising when it comes to locally generated summaries for peers without the need for a distributed summary computation that needs coordination between peers.},
  keywords = {Image Data, Source Selection, Gaussian Mixture Models}
}

@inproceedings{eisenhardt2025_106883,
  title = {Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas and Blank, Daniel and El Allali, Soufyane},
  year = {2025},
  pages = {1-6},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068839},
  url = {https://fis.uni-bamberg.de/handle/uniba/106883},
  language = {deu},
  abstract = {In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. One way to address it is using data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. There are two main contributions of this paper. We extend earlier work, adding a data source selection method for high-dimensional vector data, comparing different peer ranking schemes. More importantly, we present a method that uses progressive stepwise data exchange between peers to better each peer's summary and therefore improve the system's performance.},
  keywords = {Efficient Image Retrieval, Peer-to-Peer Networks}
}

@inproceedings{hub2025_106877,
  title = {Picadomo : Faceted Image Browsing for Mobile Devices},
  author = {Hub, Adrian and Blank, Daniel and Henrich, Andreas and Müller, Wolfgang},
  year = {2025},
  pages = {249-254},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068773},
  url = {https://fis.uni-bamberg.de/handle/uniba/106877},
  language = {eng},
  abstract = {Picadomo combines content-based image retrieval and faceted search on mobile devices. It is designed for finding images with desired visual properties, tags or other known metadata. Due to the limitations of mobile devices such as small screen sizes and low processing power, we had to carefully select the features that come in use (dominant color, GPS data, tags, etc.). With Picadomo the user can pick visualized facets directly via touch screen, while using very little screen size for the facet browsing navigation. We present our architecture, the facets used for image browsing, our new control concept and user experiments.},
  keywords = {Picadomo}
}

@inproceedings{muller2025_106875,
  title = {VisualFlamenco : Dependable, Interactive Image Browsing Based on Visual Properties},
  author = {Müller, Wolfgang and Zech, Markus and Henrich, Andreas and Blank, Daniel},
  year = {2025},
  pages = {568-575},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068751},
  url = {https://fis.uni-bamberg.de/handle/uniba/106875},
  language = {eng},
  abstract = {Faceted search as a method for exploratory search is a search interface technique for Boolean retrieval that provides a good compromise between the wish to guide the user and the need to give freedom to the user. Both, guidance and freedom are needed in order to enable him (or her) to accomplish his search goal as quickly and efficiently as possible. The search goal can be both, to retrieve a target image (lookup search) or to get an overview of a collection as the basis for accomplishing complex search tasks (exploratory search). VisualFlamenco is about bringing content-based image retrieval and faceted search together. While there is some preexisting work towards faceted search based on automatically extracted metadata, the base innovation of our work is to visualize the meaning of facets and let the user pick visualized facets directly. The main point is this research is to give the user the right expectations about what the system can achieve. We see this as a step towards dependable multimedia search, search interfaces that do not promise more than they can achieve. A mismatch of expectations and possibilities has been denoted by some as one of the main problems in current research about multimedia search. Within this paper we present a visual faceted search tool that seeks to provide dependable image search. We describe its base idea, the features used, as well as user experiments done using the system.},
  keywords = {VisualFlamenco}
}

@inproceedings{muller2025_106897,
  title = {Faster exact histogram intersection on large data collections using inverted VA-files},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2025},
  pages = {455-463},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in computer science},
  urn = {urn:nbn:de:bvb:473-irb-1068976},
  url = {https://fis.uni-bamberg.de/handle/uniba/106897},
  language = {eng},
  abstract = {Most indexing structures for high-dimensional vectors used in multimedia retrieval today rely on determining the importance of each vector component at indexing time in order to create the index. However for Histogram Intersection and other important distance measures this is not possible because the importance of vector components depends on the query. We present an indexing structure inspired by VA-file and Inverted file that does not need to determine the importance at indexing time in order to perform well. Instead, our structure adapts to the importance of vector components at query processing time. Success of this approach is demonstrated in experiments on feature data extracted from a large image collection.},
  keywords = {histogram intersection, large data collections}
}

@article{eisenhardt2025_106989,
  title = {Inhaltsbasierte Suche in P2P-Systemen},
  author = {Eisenhardt, Martin and Henrich, Andreas and Müller, Wolfgang},
  year = {2025},
  pages = {5-15},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1069893},
  url = {https://fis.uni-bamberg.de/handle/uniba/106989},
  language = {deu},
  abstract = {Pcer-to-Peer-Netze ( P2P-Netze) erfreuen sich zunehmender Beliebtheit hei der verteilten und administrationsarmen Verwaltung größerer Dokumentenkollektionen. Ein wichtiges Problem ist dabei die Suche und insbesondere die inhaltsbasierte Suche nach Dokumenten in P2P-Netzen. Der vorliegende Beitrag gibt einen Überblick über entsprechende Ansätze und zeigt interessante Forschungsaspekte auf.},
  keywords = {P2P-Systeme}
}

@inproceedings{muller2025_106994,
  title = {Comparing the performance of two CBIRS indexing schemes},
  author = {Müller, Wolfgang and Robbert, Günter and Henrich, Andreas},
  year = {2025},
  pages = {9-20},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  issn = {0277-786X},
  urn = {urn:nbn:de:bvb:473-irb-1069946},
  url = {https://fis.uni-bamberg.de/handle/uniba/106994},
  language = {eng},
  abstract = {Content based image retrieval (CBIR) as it is known today has to deal with a number of challenges. Quickly summarized, the main challenges are firstly, to bridge the semantic gap between high-level concepts and low-level features using feedback, secondly to provide performance under adverse conditions. High-dimensional spaces, as well as a demanding machine learning task make the right way of indexing an important issue.
When indexing multimedia data, most groups opt for extraction of high-dimensional feature vectors from the data, followed by dimensionality reduction like PCA (Principal Components Analysis) or LSI (Latent Semantic Indexing). The resulting vectors are indexed using spatial indexing structures such as kd-trees or R-trees, for example.
Other projects, such as MARS and Viper propose the adaptation of text indexing techniques, notably the inverted file. Here, the Viper system is the most direct adaptation of text retrieval techniques to quantized vectors. However, while the Viper query engine provides decent performance together with impressive user-feedback behavior, as well as the possibility for easy integration of long-term learning algorithms, and support for potentially infinite feature vectors, there has been no comparison of vector-based methods and inverted-file-based methods under similar conditions.
In this publication, we compare a CBIR query engine that uses inverted files (Bothrops, a rewrite of the Viper query engine based on a relational database), and a CBIR query engine based on LSD (Local Split Decision) trees for spatial indexing using the same feature sets.
The Benchathlon initiative works on providing a set of images and ground truth for simulating image queries by example and corresponding user feedback. ·when performing the Benchathlon benchmark on a CBIR system (the System Under Test, SUT), a benchmarking harness connects over internet to the SUT, performing a number of queries using an agreed-upon protocol, the multimedia retrieval markup language (MRML). Using this bench-mark one can measure the quality of retrieval, as well as the overall (speed) performance of the benchmarked system.
Our Benchmarks will draw on the Benchathlon's work for documenting the retrieval performance of both inverted file-based and LSD tree based techniques. However, in addition to these results, we will present statistics, that can be obtained only inside the system under test. These statistics will include the number of complex mathematical operations, as well as the amount of data that has to be read from disk during operation of a query.},
  keywords = {CBIRS indexing schemes}
}

@inproceedings{muller2025_107002,
  title = {Efficient content-based P2P image retrieval using peer content descriptions},
  author = {Müller, Wolfgang and Eisenhardt, Martin and Henrich, Andreas},
  year = {2025},
  pages = {57-68},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1070021},
  url = {https://fis.uni-bamberg.de/handle/uniba/107002},
  language = {eng},
  abstract = {Peer-to-peer (P2P) networks are overlay networks that connect independent computers (also called nodes or peers). In contrast to client/server solutions, all nodes offer and request services from other peers in a P2P network. P2P networks are very attractive in that they harness the computing power of many common desktop machines and necessitate little administrative overhead. While the resulting computing power is impressive, efficiently looking up data still is the major challenge in P2P networks. Current work comprises fast lookup of one-dimensional values (Distributed Hash Tables, DHT) and retrieval of texts using few keywords. However, the lookup of multimedia data in P2P networks is still attacked by very few groups. In this paper, we present experiments with efficient Content Based Image Retrieval in a P2P environment, thus a P2P-CBIR system. The challenge in such systems is to limit the number of messages sent, and to maximize the usefulness of each peer contacted in the query process. We achieve this by distributing peer data summaries over the network. Obviously, the data summaries have to be compact in order to limit the communication overhead. We propose an CBIR scheme based on a compact peer data summary.
This peer data summary relies on cluster frequencies. To obtain the compact representation of a peer's collection, a. global clustering of the data is efficiently calculated in a distributed manner. After that, each peer publishes how many of its images fall into each cluster. These cluster frequencies are then used by the querying peer to contact only those peers that have the largest number of images present in one cluster given by the query. In our paper we further detail the various challenges that have to be met by the designers of such a P2P- CBIR, and we present experiments with varying degree of data replication (duplicates of images) , as well as quality of clustering within the network.},
  keywords = {P2P}
}

@inproceedings{muller2023_92263,
  title = {Parameters in P2P-IR},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2023},
  pages = {4-11},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {GI-Edition : Proceedings},
  urn = {urn:nbn:de:bvb:473-irb-922630},
  url = {https://fis.uni-bamberg.de/handle/uniba/92263},
  language = {eng},
  abstract = {P2P Information Retrieval (P2P-IR) is a challenging and potentially very useful area of research. Its goal is to enable powerful, efficient, massively distributed IR. A large fraction of current research is focused on efficiency. However, we feel that P2P-IR needs to address the complicated combination of indexing structure and networking issues.},
  keywords = {Parameter}
}

@inproceedings{eisenhardt2023_92268,
  title = {Spektrale Bloom-Filter für Peer-to-Peer Information Retrieval},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas},
  year = {2023},
  pages = {44-48},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-922689},
  url = {https://fis.uni-bamberg.de/handle/uniba/92268},
  language = {deu},
  abstract = {Spektrale Bloomfilter können als Zusammenfassung von Peer-Daten in verteiltem P2P-Retrieval verwendet werden. Dies ermöglicht eine messbar bessere Auswahl derjenigen Peers, an die eine Anfrage gestellt wird, und somit auch eine höhere Effizienz der Anfragebearbeitung. Experimentelle Daten belegen diese Verbesserung des Retrievals in P2P-Netzen.},
  keywords = {Spektrale Bloom-Filter}
}

@inproceedings{elallali2023_92293,
  title = {Untersuchung des Einflusses verschiedener Bild- Features und Distanzmaße im inhaltsbasierten P2P Information Retrieval},
  author = {El Allali, Soufyane and Blank, Daniel and Eisenhardt, Martin and Henrich, Andreas and Müller, Wolfgang},
  year = {2023},
  pages = {382-396},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-922937},
  url = {https://fis.uni-bamberg.de/handle/uniba/92293},
  language = {deu},
  abstract = {Gegenstand der vorliegenden Arbeit ist die feature-basierte Ähnlichkeitssuche in Bilddatenbeständen, die in einem P2P-Netz verteilt sind. Wir untersuchen dabei die Eignung verschiedener Featuresätze und Distanzmaße für die Nutzung in diesem Szenario. Hierzu beziehen wir uns primär auf PlanetP-artige P2P-Netze und vergleichen die in Abhängigkeit von der Anzahl der kontaktierten Peers erreichten Ergebnisse zunächst mit einem zentralen System mit gleichem Featuresatz und Distanzmaß. Ferner vergleichen wir unser System mit einer Erweiterung, die Indexdaten im P2P-Netz transferiert, sowie mit der Implementierung einer auf CANs basierenden verteilten Indexstruktur. Schließlich evaluieren wir das System auch mittels Relevanzbeurteilungen, die von Testnutzern gegeben wurden. Die Ergebnisse zeigen deutlich die unterschiedliche Eignung verschiedener Featuresätze und Distanzmaße für unser P2P-Szenario auf.},
  keywords = {Information Retrieval}
}

@article{sieberer2017_40480,
  title = {Aiming Higher : The Consequences of Progressive Ambition among MPs in European Parliaments},
  author = {Sieberer, Ulrich and Müller, Wolfgang},
  year = {2017},
  journal = {European political science review : EPSR ; a journal of the European Consortium for Political Research},
  volume = {9},
  number = {1},
  pages = {27-50},
  publisher = {Cambridge Univ. Press},
  address = {Cambridge},
  issn = {1755-7739},
  doi = {10.1017/S1755773915000260},
  url = {https://fis.uni-bamberg.de/handle/uniba/40480},
  language = {eng}
}

@inproceedings{hub2009_18766,
  title = {Picadomo : Faceted Image Browsing for Mobile Devices},
  author = {Hub, Adrian and Blank, Daniel and Henrich, Andreas and Müller, Wolfgang},
  year = {2009},
  booktitle = {2009 Seventh International Workshop on Content-Based Multimedia Indexing},
  pages = {249-254},
  publisher = {IEEE},
  address = {Piscataway, NJ},
  doi = {10.1109/CBMI.2009.34},
  url = {https://fis.uni-bamberg.de/handle/uniba/18766},
  language = {eng},
  abstract = {Picadomo combines content-based image retrieval and faceted search on mobile devices. It is designed for finding images with desired visual properties, tags or other known metadata. Due to the limitations of mobile devices such as small screen sizes and low processing power, we had to carefully select the features that come in use (dominant color, GPS data, tags, etc.). With Picadomo the user can pick visualized facets directly via touch screen, while using very little screen size for the facet browsing navigation. We present our architecture, the facets used for image browsing, our new control concept and user experiments.},
  keywords = {Picadomo}
}

@inproceedings{blank2008_17551,
  title = {Designing Benchmarks for the Evaluation of Peer-to- Peer Information Retrieval Systems},
  author = {Blank, Daniel and Müller, Wolfgang and Henrich, Andreas},
  year = {2008},
  booktitle = {LWA 2008 : Workshop-Woche: Lernen, Wissen \& Adaptivität ; Würzburg, 6.-8. Oktober 2008},
  pages = {57 - 64},
  address = {Würzburg},
  series = {University of Würzburg, Germany / Department of Computer Science: Technical Report},
  url = {https://fis.uni-bamberg.de/handle/uniba/17551},
  language = {eng}
}

@inproceedings{elallali2008_17555,
  title = {Image Data Source Selection Using Gaussian Mixture Models},
  author = {El Allali, Soufyane and Blank, Daniel and Müller, Wolfgang and Henrich, Andreas},
  year = {2008},
  booktitle = {Adaptive multimedial retrieval: retrieval, user, and semantics : 5th International Workshop, AMR 2007, Paris, France, July 5 - 6, 2007 ; revised selected papers},
  pages = {170-181},
  publisher = {Springer},
  address = {Berlin u.a.},
  isbn = {978-3-540-79859-0},
  doi = {10.1007/978-3-540-79860-6\_14},
  url = {https://fis.uni-bamberg.de/handle/uniba/17555},
  language = {eng},
  abstract = {In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. In literature, a variety of approaches exist. One of which is data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted.
In this paper we use a Gaussian mixture model to generate peer summaries using the peers’ local data. We compare this method to other local unsupervised clustering methods for generating peer summaries and show that a Gaussian mixture model is promising when it comes to locally generated summaries for peers without the need for a distributed summary computation that needs coordination between peers.},
  keywords = {Image Data, Source Selection, Gaussian Mixture Models}
}

@inproceedings{muller2008_17554,
  title = {VisualFlamenco : Dependable, Interactive Image Browsing Based on Visual Properties},
  author = {Müller, Wolfgang and Zech, Markus and Henrich, Andreas and Blank, Daniel},
  year = {2008},
  booktitle = {Proceedings: 2008 International Workshop on Content-Based Multimedia Indexing : CBMI 2008 ; London, United Kingdom, 18 - 20 June 2008},
  pages = {568-575},
  publisher = {IEEE},
  address = {Piscataway, NJ},
  doi = {10.1109/CBMI.2008.4564998},
  url = {https://fis.uni-bamberg.de/handle/uniba/17554},
  language = {eng},
  abstract = {Faceted search as a method for exploratory search is a search interface technique for Boolean retrieval that provides a good compromise between the wish to guide the user and the need to give freedom to the user. Both, guidance and freedom are needed in order to enable him (or her) to accomplish his search goal as quickly and efficiently as possible. The search goal can be both, to retrieve a target image (lookup search) or to get an overview of a collection as the basis for accomplishing complex search tasks (exploratory search). VisualFlamenco is about bringing content-based image retrieval and faceted search together. While there is some preexisting work towards faceted search based on automatically extracted metadata, the base innovation of our work is to visualize the meaning of facets and let the user pick visualized facets directly. The main point is this research is to give the user the right expectations about what the system can achieve. We see this as a step towards dependable multimedia search, search interfaces that do not promise more than they can achieve. A mismatch of expectations and possibilities has been denoted by some as one of the main problems in current research about multimedia search. Within this paper we present a visual faceted search tool that seeks to provide dependable image search. We describe its base idea, the features used, as well as user experiments done using the system.},
  keywords = {VisualFlamenco}
}

@article{muller2008_16360,
  title = {Comparison of Image Similarity Queries in P2P Systems},
  author = {Müller, Wolfgang and Boykin, P. O. and Sarshar, N. and Roychowdhury, V. P.},
  year = {2008},
  journal = {Computer communications},
  volume = {31},
  number = {2, 5 February 2008 = Special Issue: Foundation of Peer-to-Peer Computing},
  pages = {375 - 386},
  issn = {0140-3664},
  url = {https://fis.uni-bamberg.de/handle/uniba/16360},
  language = {deu}
}

@inproceedings{muller2007_16358,
  title = {Comparison of Image Similarity Queries in P2P Systems},
  author = {Müller, Wolfgang and Boykin, P. O. and Sarshar, N. and Roychowdhury, V. P.},
  year = {2007},
  booktitle = {International Conference on Peer-to-Peer Computing <7,  2007, Galway>: Proceedings},
  pages = {98 - 105},
  address = {Los Alamitos, Calif. u.a.},
  url = {https://fis.uni-bamberg.de/handle/uniba/16358},
  language = {eng}
}

@inproceedings{blank2007_16361,
  title = {Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks},
  author = {Blank, Daniel and El Allali, Soufyane and Müller, Wolfgang and Henrich, Andreas},
  year = {2007},
  booktitle = {MIR '07 : Proceedings of the international workshop on Workshop on multimedia information retrieval},
  pages = {143-151},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-59593-778-0},
  doi = {10.1145/1290082.1290104},
  url = {https://fis.uni-bamberg.de/handle/uniba/16361},
  language = {eng},
  abstract = {In this paper we introduce a simple yet experimentally convincing approach in the research field of source selection for content-based similarity search in P2P networks or, more concretely, in summary-based P2P systems. In these systems, summaries are used for data source selection when performing k-NN queries on distributed collections of documents represented by feature vectors.
We introduce a new type of cluster-based summaries for source selection that can efficiently and cheaply be calculated and distributed in P2P networks. For the summaries generation, a very large number of sample points is used. Each peer in the network assigns its indexing data to their corresponding closest sample points and publishes its constructed summary. We evaluate the quality of these summaries when changing the number of sample points used in experiments on real-world image feature data obtained from a large crawl of the flickr web photo community and show that for higher numbers of sample points we achieve a better retrieval performance. Our experiments show that the proposed summaries yield four times better performance with respect to previous methods. Intuitively, there are some disadvantages to this approach due to the large size of the generated summaries. We show experimentally, that these disadvantages can easily be overcome due to the sparse nature of the generated summaries by simple compression techniques.},
  keywords = {P2P, CBIR, Source selection}
}

@inproceedings{elallali2007_16364,
  title = {Untersuchung des Einflusses verschiedener Bild- Features und Distanzmaße im inhaltsbasierten P2P Information Retrieval},
  author = {El Allali, Soufyane and Blank, Daniel and Eisenhardt, Martin and Henrich, Andreas and Müller, Wolfgang},
  year = {2007},
  booktitle = {Datenbanksysteme in Business, Technologie und Web (BTW) : 12. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS) ; 07. - 09.03.2007 in Aachen},
  pages = {382 - 396},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  isbn = {978-3-88579-197-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/16364},
  language = {deu},
  abstract = {Gegenstand der vorliegenden Arbeit ist die feature-basierte Ähnlichkeitssuche in Bilddatenbeständen, die in einem P2P-Netz verteilt sind. Wir untersuchen dabei die Eignung verschiedener Featuresätze und Distanzmaße für die Nutzung in diesem Szenario. Hierzu beziehen wir uns primär auf PlanetP-artige P2P-Netze und vergleichen die in Abhängigkeit von der Anzahl der kontaktierten Peers erreichten Ergebnisse zunächst mit einem zentralen System mit gleichem Featuresatz und Distanzmaß. Ferner vergleichen wir unser System mit einer Erweiterung, die Indexdaten im P2P-Netz transferiert, sowie mit der Implementierung einer auf CANs basierenden verteilten Indexstruktur. Schließlich evaluieren wir das System auch mittels Relevanzbeurteilungen, die von Testnutzern gegeben wurden. Die Ergebnisse zeigen deutlich die unterschiedliche Eignung verschiedener Featuresätze und Distanzmaße für unser P2P-Szenario auf.},
  keywords = {Information Retrieval}
}

@inproceedings{muller2007_14573,
  title = {Aspects of Adaptivity in P2P Information Retrieval},
  author = {Müller, Wolfgang and Henrich, Andreas and Eisenhardt, Martin},
  year = {2007},
  booktitle = {Adaptive Multimedia Retrieval:User, Context, and Feedback : 4th International Workshop, AMR 2006, Geneva, Switzerland, July, 27-28, 2006 ; Revised Selected Papers},
  pages = {164-178},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  isbn = {978-3-540-71544-3},
  doi = {10.1007/978-3-540-71545-0\_13},
  url = {https://fis.uni-bamberg.de/handle/uniba/14573},
  language = {eng},
  abstract = {Peer-to-Peer networks are comprised of multiple independently administered computers (peers) that cooperate via a common protocol in order to achieve a goal common to the peers. Helping the user find relevant information in a P2P network is the subject of the field of Peer-to-Peer IR.
In order to be successful, a P2P-IR system needs to be adaptive in several respects. It has to adapt both to the user and to its environment. Within this article we detail the motivations and challenges of P2P-IR, as well as the ways in which P2P-IR systems adapt and where improvement is needed in order to achieve adaptive multimedia retrieval.},
  keywords = {P2P Information Retrieval}
}

@inproceedings{eisenhardt2006_16359,
  title = {Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas and Blank, Daniel and El Allali, Soufyane},
  year = {2006},
  booktitle = {Proceedings : ISM 2006, Eighth IEEE International Symposium on Multimedia : 11 - 13 December 2006, San Diego, CA},
  pages = {823-830},
  publisher = {IEEE},
  address = {Los Alamitos, Calif.},
  doi = {10.1109/ISM.2006.47},
  url = {https://fis.uni-bamberg.de/handle/uniba/16359},
  language = {deu},
  abstract = {In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. One way to address it is using data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. There are two main contributions of this paper. We extend earlier work, adding a data source selection method for high-dimensional vector data, comparing different peer ranking schemes. More importantly, we present a method that uses progressive stepwise data exchange between peers to better each peer's summary and therefore improve the system's performance.},
  keywords = {Efficient Image Retrieval, Peer-to-Peer Networks}
}

@inproceedings{muller2006_14818,
  title = {Parameters in P2P-IR},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2006},
  booktitle = {Informatik 2006: Informatik für Menschen ; Beiträge der 36. Jahrestagung der Gesellschaft für Informatik e.V. (GI) ; 2. bis 6. Oktober 2006 in Dresden},
  pages = {4-11},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  series = {GI-Edition : Proceedings},
  isbn = {978-3-88579-187},
  url = {https://fis.uni-bamberg.de/handle/uniba/14818},
  language = {eng},
  abstract = {P2P Information Retrieval (P2P-IR) is a challenging and potentially very useful area of research. Its goal is to enable powerful, efficient, massively distributed IR. A large fraction of current research is focused on efficiency. However, we feel that P2P-IR needs to address the complicated combination of indexing structure and networking issues.},
  keywords = {Parameter}
}

@article{muller2006_14618,
  title = {Anonymität und Sicherheit in Peer-to-Peer-Systemen},
  author = {Müller, Wolfgang},
  year = {2006},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {6},
  number = {16 = Themenschwerpunkt: Security \& Privacy},
  pages = {15-25},
  issn = {1618-2162},
  url = {https://fis.uni-bamberg.de/handle/uniba/14618},
  language = {deu}
}

@inproceedings{muller2005_14614,
  title = {Robustes, skalierbares GlOSS in P2P-Netzen mit Rumorama},
  author = {Müller, Wolfgang and Eisenhardt, Martin},
  year = {2005},
  booktitle = {WebDB Meets IR : proceedings ; Workshop des GI- Arbeitskreises "Web und Datenbanken" und der GI-Fachgruppe "Information Retrieval" im Rahmen der 11. GI-Fachtagung für Datenbanksysteme in Business, Technologie und Web (BTW 2005), Karlsruhe, 1. März 2005},
  pages = {45 - 54},
  address = {Karlsruhe},
  url = {https://fis.uni-bamberg.de/handle/uniba/14614},
  language = {deu}
}

@inproceedings{teynor2005_14567,
  title = {Compressed Domain Image Retrieval Using JPEG2000 and Gaussian Mixture Models},
  author = {Teynor, Alexandra and Müller, Wolfgang and Kowarschick, Wolfgang},
  year = {2005},
  booktitle = {Visual information and information systems : 8th international conference, VISUAL 2005, Amsterdam, The Netherlands, July 5, 2005 ;  revised selected papers},
  pages = {132 - 142},
  address = {Berlin},
  url = {https://fis.uni-bamberg.de/handle/uniba/14567},
  language = {eng}
}

@article{eisenhardt2005_14569,
  title = {Inhaltsbasierte Suche in P2P-Systemen},
  author = {Eisenhardt, Martin and Henrich, Andreas and Müller, Wolfgang},
  year = {2005},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {5},
  number = {12 = Themenschwerpunkt: Web-Suche und Web-Caching},
  pages = {5-15},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1618-2162},
  url = {https://fis.uni-bamberg.de/handle/uniba/14569},
  language = {deu},
  abstract = {Pcer-to-Peer-Netze ( P2P-Netze) erfreuen sich zunehmender Beliebtheit hei der verteilten und administrationsarmen Verwaltung größerer Dokumentenkollektionen. Ein wichtiges Problem ist dabei die Suche und insbesondere die inhaltsbasierte Suche nach Dokumenten in P2P-Netzen. Der vorliegende Beitrag gibt einen Überblick über entsprechende Ansätze und zeigt interessante Forschungsaspekte auf.},
  keywords = {P2P-Systeme}
}

@inproceedings{muller2005_14571,
  title = {Scalable summary based retrieval in P2P networks},
  author = {Müller, Wolfgang and Eisenhardt, Martin and Henrich, Andreas},
  year = {2005},
  booktitle = {CIKM '05 : Proceedings of the 14th ACM international conference on Information and knowledge management},
  pages = {586-593},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-59593-140-5},
  doi = {10.1145/1099554.1099706},
  url = {https://fis.uni-bamberg.de/handle/uniba/14571},
  language = {deu},
  abstract = {Much of the present P2P-IR literature is focused on distributed indexing structures. Within this paper, we present an approach based on the replication of peer data summaries via rumor spreading and multicast in a structured overlay.We will describe Rumorama, a P2P framework for similar-ity queries inspired by GlOSS and CORI and their P2P-adaptation, PlanetP. Rumorama achieves a hierarchization of PlanetP-like summary-based P2P-IR networks. In a Rumorama network, each peer views the network as a small PlanetP network with connections to peers that see other small PlanetP networks. One important aspect is that each peer can choose the size of the PlanetP network it wants to see according to its local processing power and bandwidth. Even in this adaptive environment, Rumorama manages to process a query such that the summary of each peer is considered exactly once in a network without churn. However, the actual number of peers to be contacted for a query is a small fraction of the total number of peers in the network.Within this article, we present the Rumorama base protocol, as well as experiments demonstrating the scalability and viability of the approach under churn.},
  keywords = {P2P, Similarity Search, Distributed IR}
}

@inproceedings{muller2004_14663,
  title = {Reducing I/O Cost of Similarity Queries by Processing Several at a Time},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2004},
  booktitle = {Proceedings MDDE '04, 4th International Workshop on Multimedia Data and Document Engineering, Washington, DC, USA, July 2nd 2004. IEEE Computer Society 2004},
  url = {https://fis.uni-bamberg.de/handle/uniba/14663},
  language = {eng}
}

@inproceedings{muller2004_14609,
  title = {Efficient content-based P2P image retrieval using peer content descriptions},
  author = {Müller, Wolfgang and Eisenhardt, Martin and Henrich, Andreas},
  year = {2004},
  booktitle = {Internet Imaging V : Proceedings of Electronic Imaging, Science and Technology 2004},
  pages = {57-68},
  publisher = {SPIE},
  address = {Bellingham, Wash., USA},
  series = {SPIE Proceedings},
  isbn = {0-8194-5207-6},
  issn = {0277-786X},
  doi = {10.1117/12.531184},
  url = {https://fis.uni-bamberg.de/handle/uniba/14609},
  language = {eng},
  abstract = {Peer-to-peer (P2P) networks are overlay networks that connect independent computers (also called nodes or peers). In contrast to client/server solutions, all nodes offer and request services from other peers in a P2P network. P2P networks are very attractive in that they harness the computing power of many common desktop machines and necessitate little administrative overhead. While the resulting computing power is impressive, efficiently looking up data still is the major challenge in P2P networks. Current work comprises fast lookup of one-dimensional values (Distributed Hash Tables, DHT) and retrieval of texts using few keywords. However, the lookup of multimedia data in P2P networks is still attacked by very few groups. In this paper, we present experiments with efficient Content Based Image Retrieval in a P2P environment, thus a P2P-CBIR system. The challenge in such systems is to limit the number of messages sent, and to maximize the usefulness of each peer contacted in the query process. We achieve this by distributing peer data summaries over the network. Obviously, the data summaries have to be compact in order to limit the communication overhead. We propose an CBIR scheme based on a compact peer data summary.
This peer data summary relies on cluster frequencies. To obtain the compact representation of a peer's collection, a. global clustering of the data is efficiently calculated in a distributed manner. After that, each peer publishes how many of its images fall into each cluster. These cluster frequencies are then used by the querying peer to contact only those peers that have the largest number of images present in one cluster given by the query. In our paper we further detail the various challenges that have to be met by the designers of such a P2P- CBIR, and we present experiments with varying degree of data replication (duplicates of images) , as well as quality of clustering within the network.},
  keywords = {P2P}
}

@inproceedings{muller2004_12774,
  title = {Faster exact histogram intersection on large data collections using inverted VA-files},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2004},
  booktitle = {Image and video retrieval : third International Conference, CIVR 2004, Dublin, Ireland, July 21 - 23, 2004 ; proceedings},
  pages = {455-463},
  publisher = {Springer},
  address = {Berlin},
  series = {Lecture notes in computer science},
  isbn = {978-3-540-22539-3},
  doi = {10.1007/978-3-540-27814-6\_54},
  url = {https://fis.uni-bamberg.de/handle/uniba/12774},
  language = {eng},
  abstract = {Most indexing structures for high-dimensional vectors used in multimedia retrieval today rely on determining the importance of each vector component at indexing time in order to create the index. However for Histogram Intersection and other important distance measures this is not possible because the importance of vector components depends on the query. We present an indexing structure inspired by VA-file and Inverted file that does not need to determine the importance at indexing time in order to perform well. Instead, our structure adapts to the importance of vector components at query processing time. Success of this approach is demonstrated in experiments on feature data extracted from a large image collection.},
  keywords = {histogram intersection, large data collections}
}

@inproceedings{eisenhardt2004_12728,
  title = {Spektrale Bloom-Filter für Peer-to-Peer Information Retrieval},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas},
  year = {2004},
  booktitle = {Informatik 2004 : Informatik verbindet ; Beiträge der 34. Jahrestagung der Gesellschaft für Informatik e.V. (GI) ; Ulm, 20. -  24. September 2004},
  pages = {44 - 48},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  isbn = {3-88579-380-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/12728},
  language = {deu},
  abstract = {Spektrale Bloomfilter können als Zusammenfassung von Peer-Daten in verteiltem P2P-Retrieval verwendet werden. Dies ermöglicht eine messbar bessere Auswahl derjenigen Peers, an die eine Anfrage gestellt wird, und somit auch eine höhere Effizienz der Anfragebearbeitung. Experimentelle Daten belegen diese Verbesserung des Retrievals in P2P-Netzen.},
  keywords = {Spektrale Bloom-Filter}
}

@inproceedings{muller2003_14659,
  title = {Fast Retrieval of High-Dimensional Feature Vectors in P2P Networks Using Compact Peer Data Summaries},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2003},
  booktitle = {MIR '03 : Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval},
  pages = {79–86},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-58113-778-1},
  doi = {10.1145/973264.973278},
  url = {https://fis.uni-bamberg.de/handle/uniba/14659},
  language = {deu},
  abstract = {The retrieval facilities of most Peer-to-Peer (P2P) systems are limited to queries based on a unique identifier or a small set of keywords. The techniques used for this purpose are hardly applicable for content-based image retrieval (CBIR) in a P2P network. Furthermore, we will argue that the curse of dimensionality and the high communication overhead prevent the adaptation of multidimensional search trees or fast sequential scan techniques for P2P CBIR. In the present paper we will propose two compact data representations which can be distributed in a P2P network and used as the basis for a source selection. This allows to communicate only with a small fraction of all peers during query processing without deteriorating the result quality significantly. We will also present experimental results confirming our approach.},
  keywords = {Algorithms, Performance}
}

@incollection{marchandmaillet2003_14638,
  title = {Was leisten automatische inhaltsbasierte Bildsuchsysteme?},
  author = {Marchand-Maillet, Stéphane and Lasri, Nadia and Müller,  Henning and Müller, Wolfgang and Pun, Thierry},
  year = {2003},
  booktitle = {Suchbilder : visuelle Kultur zwischen Algorithmen und Archiven; im Verbund mit dem Symposion "Suchbilder. Schritte zu einem Bildarchiv Filmischer Topoi" entstanden (6. bis 8. Februar 2001 in den Kunst- Werken Berlin)},
  pages = {86-98},
  publisher = {Kulturverlag Kadmos},
  address = {Berlin},
  isbn = {978-3-931659-35-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/14638},
  language = {deu}
}

@inproceedings{muller2003_14612,
  title = {Comparing the performance of two CBIRS indexing schemes},
  author = {Müller, Wolfgang and Robbert, Günter and Henrich, Andreas},
  year = {2003},
  booktitle = {Internet Imaging IV : Proceedings of Electronic Imaging, Science and Technology 2003},
  pages = {9-20},
  publisher = {SPIE},
  address = {Bellingham, Wash., USA},
  series = {SPIE Proceedings},
  isbn = {0-8194-4818-4},
  issn = {0277-786X},
  doi = {10.1117/12.473372},
  url = {https://fis.uni-bamberg.de/handle/uniba/14612},
  language = {eng},
  abstract = {Content based image retrieval (CBIR) as it is known today has to deal with a number of challenges. Quickly summarized, the main challenges are firstly, to bridge the semantic gap between high-level concepts and low-level features using feedback, secondly to provide performance under adverse conditions. High-dimensional spaces, as well as a demanding machine learning task make the right way of indexing an important issue.
When indexing multimedia data, most groups opt for extraction of high-dimensional feature vectors from the data, followed by dimensionality reduction like PCA (Principal Components Analysis) or LSI (Latent Semantic Indexing). The resulting vectors are indexed using spatial indexing structures such as kd-trees or R-trees, for example.
Other projects, such as MARS and Viper propose the adaptation of text indexing techniques, notably the inverted file. Here, the Viper system is the most direct adaptation of text retrieval techniques to quantized vectors. However, while the Viper query engine provides decent performance together with impressive user-feedback behavior, as well as the possibility for easy integration of long-term learning algorithms, and support for potentially infinite feature vectors, there has been no comparison of vector-based methods and inverted-file-based methods under similar conditions.
In this publication, we compare a CBIR query engine that uses inverted files (Bothrops, a rewrite of the Viper query engine based on a relational database), and a CBIR query engine based on LSD (Local Split Decision) trees for spatial indexing using the same feature sets.
The Benchathlon initiative works on providing a set of images and ground truth for simulating image queries by example and corresponding user feedback. ·when performing the Benchathlon benchmark on a CBIR system (the System Under Test, SUT), a benchmarking harness connects over internet to the SUT, performing a number of queries using an agreed-upon protocol, the multimedia retrieval markup language (MRML). Using this bench-mark one can measure the quality of retrieval, as well as the overall (speed) performance of the benchmarked system.
Our Benchmarks will draw on the Benchathlon's work for documenting the retrieval performance of both inverted file-based and LSD tree based techniques. However, in addition to these results, we will present statistics, that can be obtained only inside the system under test. These statistics will include the number of complex mathematical operations, as well as the amount of data that has to be read from disk during operation of a query.},
  keywords = {CBIRS indexing schemes}
}

@inproceedings{muller2003_14613,
  title = {Privacy of Ideas in P2P Networks},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2003},
  booktitle = {PET2003 Dresden, Germany ; Workshop on Privacy Enhancing Technologies, Hotel Elbflorenz Dresden, Germany, 26 - 28 March 2003 / Program / Wednesday, March 26 / Rump session / works in progress (part one)},
  url = {https://fis.uni-bamberg.de/handle/uniba/14613},
  language = {deu}
}

@inproceedings{muller2003_14608,
  title = {A framework for benchmarking in CBIR},
  author = {Müller,  Henning and Müller, Wolfgang and Marchand-Maillet, Stéphane and Squire, David McG. and Pun, Thierry},
  year = {2003},
  volume = {21},
  number = {1 = Special Issue: Best Papers of the ACM Multimedia 2001 Workshop on Multimedia Information Retrieval},
  pages = {55 - 73},
  issn = {1380-7501},
  url = {https://fis.uni-bamberg.de/handle/uniba/14608},
  language = {eng}
}

@book{eisenhardt2003_14605,
  title = {Classifying Documents by Distributed P2P Clustering},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas},
  year = {2003},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/14605},
  language = {eng}
}

@article{muller2002_14604,
  title = {Bildersuchbaukasten - Das GNU Image Finding Tool via Plug-ins erweitern},
  author = {Müller, Wolfgang},
  year = {2002},
  journal = {C't : Magazin für Computer-Technik},
  number = {17},
  pages = {190},
  issn = {0724-8679},
  url = {https://fis.uni-bamberg.de/handle/uniba/14604},
  language = {deu}
}

@inproceedings{muller2001_14630,
  title = {A Web-Based Evaluation System for Content-Based Image Retrieval},
  author = {Müller,  Henning and Müller, Wolfgang and Marchand-Maillet, Stéphane and Squire, David McG. and Pun, Thierry},
  year = {2001},
  booktitle = {Proceedings of ACM Multimedia 2001 workshops},
  address = {New York,  NY,},
  url = {https://fis.uni-bamberg.de/handle/uniba/14630},
  language = {eng}
}

@incollection{squire2001_14634,
  title = {Design and Evaluation of a Content-based Image Retrieval System},
  author = {Squire, David McG. and Müller,  Henning and Müller, Wolfgang and Marchand-Maillet, Stéphane and Pun, Thierry},
  year = {2001},
  booktitle = {Design and management of multimedia information systems : opportunities and challenges},
  address = {Hershey u.a.},
  isbn = {9781930708006},
  url = {https://fis.uni-bamberg.de/handle/uniba/14634},
  language = {eng}
}

@inproceedings{muller2001_14590,
  title = {Automated benchmarking in content-based image retrieval},
  author = {Müller,  Henning and Müller, Wolfgang and Marchand-Maillet, Stéphane and McG.Squire, David and Pun, Thierry},
  year = {2001},
  booktitle = {2001 IEEE International Conference on Multimedia and Expo, ICME 2001 : 22 - 25 August 2001, Tokyo, Japan ; Theme: Recent advances in multimedia world},
  address = {Piscataway, NJ},
  url = {https://fis.uni-bamberg.de/handle/uniba/14590},
  language = {deu}
}

@book{muller2001_14589,
  title = {Automated benchmarking in content-based image retrieval},
  author = {Müller,  Henning and Müller, Wolfgang and Marchand-Maillet, Stéphane and McG.Squire, David and Pun, Thierry},
  year = {2001},
  address = {Geneve},
  series = {Technical report vision},
  isbn = {0-7695-1198-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/14589},
  language = {deu}
}

@article{muller2001_14594,
  title = {Evaluating Image Browsers Using Structured Annotation},
  author = {Müller, Wolfgang and Marchand-Maillet, Stéphane and Müller, Henning and McG.Squire, David and Pun, Thierry},
  year = {2001},
  journal = {Journal of the American Society for Information Science and Technology : JASIST},
  volume = {52},
  number = {11},
  pages = {961 - 968},
  issn = {1532-2882},
  url = {https://fis.uni-bamberg.de/handle/uniba/14594},
  language = {eng}
}

@article{muller2001_14595,
  title = {Performance evaluation in content-based image retrieval: overview and proposals},
  author = {Müller,  Henning and Müller, Wolfgang and Squire, David McG. and Marchand-Maillet, Stéphane and Pun, Thierry},
  year = {2001},
  journal = {Pattern recognition letters : an official publ. of the International Association for Pattern Recognition},
  volume = {22},
  number = {5},
  pages = {593 - 601},
  issn = {0167-8655},
  url = {https://fis.uni-bamberg.de/handle/uniba/14595},
  language = {eng}
}

