Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

William Plant

dblp:09/7463 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 6 · 4 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval › multimedia browsing
image browsing
0.112012
Interactive exploration of large remote image databases · ACM Multimedia 2012
User interface design and tools
interactive visualization
0.112012
Interactive exploration of large remote image databases · ACM Multimedia 2012

Methods — techniques the papers use, named apart from their topics

mapping-based visualization · 0.3image pyramid · 0.3
YearPublicationVenuePosition
2015 Interactive browsing of image collections on mobile devices
Gerald Schaefer, Matthew Tallyn, Daniel Felton, William Plant, David Edmundson
Multim. Tools Appl.4
2013 Exploring mapping-based visualisations of large remote image databases
abstract
Image database visualisations, in particular mapping-based visualisations, provide an interesting approach to accessing image repositories as they are able to overcome some of the drawbacks associated with retrieval based approaches. However, making a mapping-based approach work efficiently on large remote image databases, has yet to be explored. In this paper, we present Web-Based Images Browser (WBIB), a novel system that efficiently employs image pyramids to reduce bandwidth requirements so that users can interactively explore large remote image databases.
William Plant, Gerald Schaefer
VINCI1
2013 The Mosaic Test: measuring the effectiveness of colour-based image retrieval
William Plant, Joanna Lumsden, Ian T. Nabney
Multim. Tools Appl.1
2012 Interactive exploration of large remote image databases
abstract
Mapping-based visualisations of image databases are well suited to users wanting to survey the overall content of a collection. Given the large amount of image data contained within such visualisations, however, this approach has yet to be applied to large image databases stored remotely. In this technical demonstration, we showcase our Web-Based Images Browser (WBIB). Our novel system makes use of image pyramids so that users can interactively explore mapping-based visualisations of large remote image databases.
William Plant, Gerald Schaefer
ACM Multimedia1
2012 Intuitive mobile image browsing on a hexagonal lattice
abstract
Following miniaturisation of cameras and their integration into mobile devices such as smartphones combined with the intensive use of the latter, it is likely that in the near future the majority of digital images will be captured using such devices rather than using dedicated cameras. Since many users decide to keep their photos on their mobile devices, effective methods for managing these image collections are required. Common image browsers prove to be only of limited use, especially for large image sets [1].
Gerald Schaefer, Matthew Tallyn, Daniel Felton, David Edmundson, William Plant
VCIP5
2010 Image retrieval on the Honeycomb Image Browser
abstract
Efficient and effective approaches of dealing with the vast amount of visual information available nowadays are highly sought after. This is particularly the case for image collections, both personal and commercial. Due to the magnitude of these ever expanding image repositories, annotation of all images images is infeasible, and search in such an image collection therefore becomes inherently difficult. Although content-based image retrieval techniques have shown much potential, such approaches also suffer from various problems making it difficult to adopt them in practice. In this paper, we follow a different approach, namely that of browsing image databases for image retrieval. In our Honeycomb Image Browser, large image databases are visualised on a hexagonal lattice with image thumbnails occupying hexagons. Arranged in a space filling manner, visually similar images are located close together enabling large image datasets to be navigated in a hierarchical manner. Various browsing tools are incorporated to allow for interactive exploration of the database. Experimental results confirm that our approach affords efficient image retrieval.
William Plant, Gerald Schaefer
ICIP1
2009 Visualising image databases
abstract
In this paper we explore different ways in which large collections of images can be visualised. We discuss the three principle visualisation techniques employed for this purpose, namely dimensionality reduced mappings, clustering-based visualisations and graph-based representations. Mapping-based techniques try to present the relationships between images described by high-dimensional features in a low-dimensional visualisation space. Clustered visualisations group similar images based on content, metadata or time stamp information, while in graph-based approaches links between images are exploited to arrive at an intuitive display of the dataset. We highlight advantages and disadvantages of the various approaches and emphasise the need for a benchmark which allows objective evaluation of these systems.
William Plant, Gerald Schaefer
MMSP1
2008 An overview of Genetic Algorithms in simulation soccer
abstract
This paper discusses the use of genetic algorithms and genetic programming within the simulation soccer domain. Genetic algorithms (GAs) are based on the Darwinian theory of evolution and provide techniques to execute an effective search on a large range of potential solutions to a specific problem. Genetic Programming (GP) uses GA concepts to evolve a computer program. We show how GAs and GP have been applied to the challenging real-time and noisy domain of RoboCup simulation soccer. Among others, genetic approaches can be used to find appropriate actions for a soccer agent during a game, to improve different aspects of team strategy as well as to strengthen the ability of a player or a team in training exercises.
William Plant, Gerald Schaefer, Tomoharu Nakashima
IEEE Congress on Evolutionary Computation1