Skip to main content

Research Repository

Advanced Search

All Outputs (127)

Interactive Video Asset Retrieval Using Sketched Queries (2014)
Presentation / Conference Contribution
James, S., & Collomosse, J. (2014, November). Interactive Video Asset Retrieval Using Sketched Queries. Presented at CVMP '14: 11th European Conference on Visual Media Production, London

We present a new algorithm for searching video repositories using free-hand sketches. Our queries express both appearance (color, shape) and motion attributes, as well as semantic properties (object labels) enabling hybrid queries to be specified. Un... Read More about Interactive Video Asset Retrieval Using Sketched Queries.

On the intersection of tolerance and cocomparability graphs (2014)
Journal Article
Mertzios, G., & Zaks, S. (2016). On the intersection of tolerance and cocomparability graphs. Discrete Applied Mathematics, 199, 46-88. https://doi.org/10.1016/j.dam.2014.10.025

Tolerance graphs have been extensively studied since their introduction, due to their interesting structure and their numerous applications, as they generalize both interval and permutation graphs in a natural way. It has been conjectured by Golumbic... Read More about On the intersection of tolerance and cocomparability graphs.

Face-Based Automatic Personality Perception (2014)
Presentation / Conference Contribution
Al Moubayed, N., Vazquez-Alvarez, Y., McKay, A., & Vinciarelli, A. (2014, November). Face-Based Automatic Personality Perception. Presented at 22nd ACM international conference on Multimedia - MM '14, Orlando, Florida, USA

Automatic Personality Perception is the task of automatically predicting the personality traits people attribute to others. This work presents experiments where such a task is performed by mapping facial appearance into the Big-Five personality trait... Read More about Face-Based Automatic Personality Perception.

Robust and Skew-resistant Parallel Joins in Shared-Nothing Systems (2014)
Presentation / Conference Contribution
Cheng, L., Kotoulas, S., Ward, T., & Theodoropoulos, G. (2014, November). Robust and Skew-resistant Parallel Joins in Shared-Nothing Systems. Presented at 23rd ACM International Conference on Conference on Information and Knowledge Management - CIKM '14, Shanghai, China

The performance of joins in parallel database management systems is critical for data intensive operations such as querying. Since data skew is common in many applications, poorly engineered join operations result in load imbalance and performance bo... Read More about Robust and Skew-resistant Parallel Joins in Shared-Nothing Systems.

Computing in Matrix Groups Without Memory (2014)
Journal Article
Cameron, P., Fairbairn, B., & Gadouleau, M. (2014). Computing in Matrix Groups Without Memory. Chicago journal of theoretical computer science, 2014(8), 1-16. https://doi.org/10.4086/cjtcs.2014.008

Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve updates o... Read More about Computing in Matrix Groups Without Memory.

Computing in Permutation Groups Without Memory (2014)
Journal Article
Cameron, P., Fairbairn, B., & Gadouleau, M. (2014). Computing in Permutation Groups Without Memory. Chicago journal of theoretical computer science, 2014(7), 1-20. https://doi.org/10.4086/cjtcs.2014.007

Memoryless computation is a modern technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve up... Read More about Computing in Permutation Groups Without Memory.

A Photogrammetric Approach for Real-time 3D Localization and Tracking of Pedestrians in Monocular Infrared Imagery (2014)
Presentation / Conference Contribution
Kundegorski, M., & Breckon, T. (2014, October). A Photogrammetric Approach for Real-time 3D Localization and Tracking of Pedestrians in Monocular Infrared Imagery. Presented at Proc. SPIE Optics and Photonics for Counterterrorism, Crime Fighting and Defence

Target tracking within conventional video imagery poses a significant challenge that is increasingly being addressed via complex algorithmic solutions. The complexity of this problem can be fundamentally attributed to the ambiguity associated with ac... Read More about A Photogrammetric Approach for Real-time 3D Localization and Tracking of Pedestrians in Monocular Infrared Imagery.

3D Object Classification in Baggage Computed Tomography Imagery using Randomised Clustering Forests (2014)
Presentation / Conference Contribution
Mouton, A., Breckon, T., Flitton, G., & Megherbi, N. (2014, October). 3D Object Classification in Baggage Computed Tomography Imagery using Randomised Clustering Forests. Presented at Proc. International Conference on Image Processing

We investigate the feasibility of a codebook approach for the automated classification of threats in pre-segmented 3D baggage Computed Tomography (CT) security imagery. We compare the performance of five codebook models, using various combinations of... Read More about 3D Object Classification in Baggage Computed Tomography Imagery using Randomised Clustering Forests.

Quantitative High Dynamic Range Beam Proling for Fluorescence Microscopy (2014)
Journal Article
Mitchell, T., Saunter, C., O'Nions, W., Girkin, J., & Love, G. (2014). Quantitative High Dynamic Range Beam Proling for Fluorescence Microscopy. Review of Scientific Instruments, 85(10), Article 103713. https://doi.org/10.1063/1.4899208

Modern developmental biology relies on optically-sectioning uorescence microscope techniques to produce non-destructive in-vivo images of developing specimens at high resolution in three dimensions. As optimal performance of these techniques is relia... Read More about Quantitative High Dynamic Range Beam Proling for Fluorescence Microscopy.

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (2014)
Journal Article
Broersma, H., Fiala, J., Golovach, P., Kaiser, T., Paulusma, D., & Proskurowski, A. (2015). Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. Journal of Graph Theory, 79(4), 282-299. https://doi.org/10.1002/jgt.21832

We prove that for all inline image an interval graph is inline image-Hamilton-connected if and only if its scattering number is at most k. This complements a previously known fact that an interval graph has a nonnegative scattering number if and only... Read More about Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.

Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width (2014)
Journal Article
Bordewich, M., & Kang, R. (2014). Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width. Electronic Journal of Combinatorics, 21(4), Article 19

Motivated by the `subgraphs world' view of the ferromagnetic Ising model, we analyse the mixing times of Glauber dynamics based on subset expansion expressions for classes of graph, hypergraph and matroid polynomials. With a canonical paths argument,... Read More about Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width.

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (2014)
Journal Article
Mertzios, G., & Spirakis, P. (2016). Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. Algorithmica, 74(1), 385-414. https://doi.org/10.1007/s00453-014-9949-6

The 3-coloring problem is well known to be NP-complete. It is also well known that it remains NP-complete when the input is restricted to graphs with diameter 4. Moreover, assuming the Exponential Time Hypothesis (ETH), 3-coloring cannot be solved in... Read More about Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs.

Cross-layer optimisation for topology design of wireless multicast networks via network coding (2014)
Presentation / Conference Contribution
Vien, Q. T., Tu, W., Nguyen, H. X., & Trestian, R. (2014, September). Cross-layer optimisation for topology design of wireless multicast networks via network coding. Presented at Proceedings Conference on Local Computer Networks LCN, Edmonton, Canada

One of the main challenges towards reliable multicast transmissions over wireless networks is the dynamics of the wireless links (e.g. wireless errors, fading, interference, collisions, etc.) that can cause retransmissions overhead over the limited a... Read More about Cross-layer optimisation for topology design of wireless multicast networks via network coding.

A multi-rate multi-channel multicast algorithm in wireless mesh networks (2014)
Presentation / Conference Contribution
Tu, W. (2014, September). A multi-rate multi-channel multicast algorithm in wireless mesh networks. Presented at Proceedings Conference on Local Computer Networks LCN, Edmonton, Canada

Devices in wireless mesh networks can operate on multiple channels and automatically adjust their transmission rates for the occupied channels. This paper shows how to improve performance-guaranteed multicasting transmission coverage for wireless mul... Read More about A multi-rate multi-channel multicast algorithm in wireless mesh networks.

Oracle Tractability of Skew Bisubmodular Functions (2014)
Journal Article
Huber, A., & Krokhin, A. (2014). Oracle Tractability of Skew Bisubmodular Functions. SIAM Journal on Discrete Mathematics, 28(4), 1828-1837. https://doi.org/10.1137/130936038

In this paper we consider skew bisubmodular functions as recently introduced by the authors and Powell. We construct a convex extension of a skew bisubmodular function which we call Lovász extension in correspondence to the submodular case. We use th... Read More about Oracle Tractability of Skew Bisubmodular Functions.

The Critical Role of Profiles in Social E-Learning Design (2014)
Presentation / Conference Contribution
Shi, L., Cristea, A. I., & Hadzidedic, S. (2014, October). The Critical Role of Profiles in Social E-Learning Design. Presented at 15th Annual Conference on Information Technology Education (SIGITE), Atlanta, Georgia, US

Evidence points to the fact that the integration of Social Networking Sites (SNS) features, into e-learning environments has been highly accepted by students, because of its benefits of improving the learning experience. Yet, not enough attention has... Read More about The Critical Role of Profiles in Social E-Learning Design.

A steganalytic algorithm for 3D polygonal meshes (2014)
Presentation / Conference Contribution
Yang, Y., Pintus, R., Rushmeier, H., & Ivrissimtzis, I. (2014, October). A steganalytic algorithm for 3D polygonal meshes. Presented at 2014 IEEE International Conference on Image Processing (ICIP), Paris, France

We propose a steganalytic algorithm for watermarks embedded by Cho et al.'s mean-based algorithm [1]. The main observation is that while in a clean model the means of Cho et al.'s normalized histogram bins are expected to follow a Gaussian distributi... Read More about A steganalytic algorithm for 3D polygonal meshes.

Closing complexity gaps for coloring problems on H-free graphs (2014)
Journal Article
Golovach, P., Paulusma, D., & Song, J. (2014). Closing complexity gaps for coloring problems on H-free graphs. Information and Computation, 237, 204-214. https://doi.org/10.1016/j.ic.2014.02.004

If a graph G contains no subgraph isomorphic to some graph H , then G is called H -free. A coloring of a graph G=(V,E) is a mapping c:V→{1,2,…} such that no two adjacent vertices have the same color, i.e., c(u)≠c(v) if uv∈E; if |c(V)|⩽k then c is a k... Read More about Closing complexity gaps for coloring problems on H-free graphs.