Demo Data from SIGIR 2026 / reviewers in the wild / expert
David J. Mulvaney
dblp:91/615
· DBLP profile ↗
9ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5Systems, architecture and hardware · 3Graphics, computer vision, multimedia, augmented reality and games · 2Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1
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 architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 23% High-performance computing · 23% Reconfigurable computing and FPGAs · 23% | |
| Artificial intelligence
1 paper |
Motion planning and robot control · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Motion planning and robot control › path planning
dynamic path planning |
0.1 | 1 | 2007 | Mobile Robot Path Planning in Dynamic Environments · ICRA 2007 |
Robotics › Motion planning and robot control
path planning |
0.1 | 1 | 2007 | Mobile Robot Path Planning in Dynamic Environments · ICRA 2007 |
Hardware accelerators and domain-specific architectures › domain-specific accelerator
compression accelerator |
0.0 | 1 | 2004 | Design and Implementation of a Lossless Parallel High-Speed Data Compression System · IEEE Trans. Parallel Distributed Syst. 2004 |
Reconfigurable computing and FPGAs
FPGA implementation |
0.0 | 1 | 2004 | Design and Implementation of a Lossless Parallel High-Speed Data Compression System · IEEE Trans. Parallel Distributed Syst. 2004 |
Storage systems › data compression
lossless compression |
0.0 | 1 | 2004 | Design and Implementation of a Lossless Parallel High-Speed Data Compression System · IEEE Trans. Parallel Distributed Syst. 2004 |
High-performance computing
parallel compression |
0.0 | 1 | 2004 | Design and Implementation of a Lossless Parallel High-Speed Data Compression System · IEEE Trans. Parallel Distributed Syst. 2004 |
Robotics › Motion planning and robot control › path planning
mobile robot path planning |
0.0 | 1 | 2007 | Mobile Robot Path Planning in Dynamic Environments · ICRA 2007 |
Robotics › Motion planning and robot control
motion planning |
0.0 | 1 | 2007 | Mobile Robot Path Planning in Dynamic Environments · ICRA 2007 |
Parallel and multicore computing
multiprocessor system |
0.0 | 1 | 2004 | Design and Implementation of a Lossless Parallel High-Speed Data Compression System · IEEE Trans. Parallel Distributed Syst. 2004 |
Methods — techniques the papers use, named apart from their topics
genetic algorithm · 0.1parallel compression · 0.0FPGA implementation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Geometrical-based lip-reading using template probabilistic multi-dimension dynamic time warping
Mohd Zamri Ibrahim, David J. Mulvaney |
J. Vis. Commun. Image Represent. | 2 |
| 2012 | Geometry based lip reading system using Multi Dimension Dynamic Time WarpingabstractThis paper describes an automatic lip reading system consisting of two main modules 1) a pre-processing module able to extract lip geometry information from the video sequence and 2) a classification module to identify the visual speech based on dynamic lip movements. The recognition performance of the proposed system has been assessed in the recognition of the English digits 0 to 9 as spoken by the speakers in the video sequences available in the CUAVE database. Extraction of lip geometry features was carried out using a combination of a skin color filter, a border following algorithm and a convex hull approach. The proposed method was compared with the popular `snake' technique and was found to improve lip shape extraction performance for the database studied. Lip geometry features including height, width, ratio, area, perimeter and various combinations of these features were evaluated to determine which performs the best when representing speech in the visual domain in the application of three separate classification methods, namely optical flow, Dynamic Time Warping (DTW) and a new approach termed Multi-Dimensional DTW. Experiments show that the proposed system is capable of a recognition performance of 68% just using lip height, lip width and the ratio of these features demonstrating that the system has the potential to be incorporated in a multimodal speech recognition system for use in noisy environments. Mohd Zamri Ibrahim, David J. Mulvaney |
VCIP | 2 |
| 2007 | Mobile Robot Path Planning in Dynamic EnvironmentsabstractThis paper introduces a genetic algorithm (GA) planner that is able to rapidly determine optimal or near-optimal solutions for mobile robot path planning problems in environments containing moving obstacles. The method restricts the search space to the vertices of the obstacles, obviating the need to search the entire environment as in earlier GA-based approaches. The new approach is able to produce an off-line plan through an environment containing dynamic obstacles, and can also re-calculate the plan on-line to deal with any motion changes encountered. A particularly novel aspect of the work is the incorporation of the selection of robot speed into the GA genes. The results from a number of realistic environments demonstrate that planning changes in robot speed significantly improves the efficiency of movement through the static and moving obstacles. Yang Wang 0010, Ian P. W. Sillitoe, David J. Mulvaney |
ICRA | 3 |
| 2007 | Hardware implementation of a novel genetic algorithm
Zhenhuan Zhu, David J. Mulvaney, Vassilios A. Chouliaras |
Neurocomputing | 2 |
| 2006 | Investigation Of A New Genetic Algorithm Designed For System-On-Chip RealizationabstractThis paper introduces a novel genetic algorithm whose properties have been purposely designed to be suited to hardware implementation. This is distinct from previous hardware designs that have been realized directly from conventional genetic algorithm approaches. To be suitable for hardware implementation, we propose that a genetic algorithm should attempt to both minimize final layout dimensions and reduce execution time while not compromising algorithmic performance. Consequently, the new genetic algorithm specifically aims to keep the requisite silicon area to a minimum by incorporating a monogenetic strategy that retains only the optimum individual, resulting in a dramatic reduction in the memory requirement and obviating the need for crossover circuitry. The results given in this paper demonstrate that new approach improves on a number of existing hardware genetic algorithm implementations in terms of the quality of the solution produced, the calculation time and the hardware component requirements. Zhenhuan Zhu, David J. Mulvaney, Vassilios A. Chouliaras |
IEEE Congress on Evolutionary Computation | 2 |
| 2006 | A Fast Memory-Efficient Incremental Decision Tree Algorithm in its Application to Mobile Robot NavigationabstractIncremental learning is vital in robots that need to adapt rapidly and respond appropriately to new or unexpected events that occur in its vicinity. This paper describes a novel incremental learning method here demonstrated in its reactive navigation of a mobile robot. The approach records acquired feature vectors in a compact statistical representation we term a frequency table that is purposely designed to contain sufficient information for the generation of a conventional C4.5 decision tree. During learning, further feature vectors can be added in an incremental manner to the frequency table which can then be used to generate new decision trees as required. A major advantage compared with previous incremental decision tree approaches that keep feature vectors in the tree itself, is that the frequency table's memory requirement is fixed and known a priori. Experimental results in the practical application of the method to the real-time navigation of a mobile robot through previously uncharted environments show that the calculation time is typically an order of magnitude less than that of an incremental generation of an ITI decision tree Erick A. R. Swere, David J. Mulvaney, Ian P. W. Sillitoe |
IROS | 2 |
| 2004 | Design and Implementation of a Lossless Parallel High-Speed Data Compression SystemabstractLogic density increases have made feasible the implementation of multiprocessor systems able to meet the intensive data processing demands of highly concurrent systems. We describe the research and hardware implementation of a high-performance parallel multicompressor chip. A detailed investigation into the performances of alternative input and output routing strategies for realistic data sets demonstrate that the design of parallel compression devices involves important trade offs that affect compression performance, latency, and throughput. The most promising approach is implemented into FPGA hardware and is shown to provide a scalable compression solution at throughputs able to cope with the demands of modern high-bandwidth applications. Mark Milward, José Luis Núñez, David J. Mulvaney |
IEEE Trans. Parallel Distributed Syst. | 3 |
| 2000 | Implementation of an Intelligent Control System Using Fuzzy ITI
G. H. Shah Hamzei, David J. Mulvaney |
Neural Comput. Appl. | 2 |
| 1998 | Self-organising fuzzy decision trees for robot navigation: An online learning approachabstractProposes a hybrid technique for intelligent robot navigation based on incremental decision trees (ITI-2.8) and incorporating fuzzy logic for flexible control. The robot perception is decomposed into a hierarchy of simpler virtual environments, termed worlds. Training examples generated from the robot's past rewarded experiences are exposed to ITI-2.8 in an incremental manner and online to evolve an array of fuzzy associative memories (FAM), each representing a unique world. That is, generated FAMs, which are structurally nonlinear (in contrast to ordinary FAMs), are engineered online and from inception to store and access fuzzy control rule spaces representing different perceptions. Each decision tree is encoded in one FAM and is local to a certain perception. The fundamental strengths of the algorithm in building online FAMs, is its incremental nature and automatically generating fuzzy training vectors without human intervention. Fuzziness is integrated to provide suitable reasoning in the face of inherent uncertainty in the sensory input data and to merge conflicting behaviours to generate smooth trajectories. Global navigation is achieved by activating a hierarchy of local FAMs. G. H. Shah Hamzei, David J. Mulvaney |
SMC | 2 |