Outputs (7)

Evaluating Gaussian Grasp Maps for Generative Grasping Models (2022)
Conference Proceeding
Prew, W., Breckon, T., Bordewich, M., & Beierholm, U. (2022). Evaluating Gaussian Grasp Maps for Generative Grasping Models.

Generalising robotic grasping to previously unseen objects is a key task in general robotic manipulation. The current method for training many antipodal generative grasping models rely on a binary ground truth grasp map generated from the centre thir... Read More about Evaluating Gaussian Grasp Maps for Generative Grasping Models.

Autoencoders Without Reconstruction for Textural Anomaly Detection (2021)
Conference Proceeding
Adey, P., Akcay, S., Bordewich, M., & Breckon, T. (2021). Autoencoders Without Reconstruction for Textural Anomaly Detection. . https://doi.org/10.1109/ijcnn52387.2021.9533804

Automatic anomaly detection in natural textures is a key component within quality control for a range of high-speed, high-yield manufacturing industries that rely on camera-based visual inspection techniques. Targeting anomaly detection through the u... Read More about Autoencoders Without Reconstruction for Textural Anomaly Detection.

Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss (2021)
Conference Proceeding
Prew, W., Breckon, T., Bordewich, M., & Beierholm, U. (2021). Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss. . https://doi.org/10.1109/icpr48806.2021.9413197

In this paper we introduce two methods of improving real-time object grasping performance from monocular colour images in an end-to-end CNN architecture. The first is the addition of an auxiliary task during model training (multi-task learning). Our... Read More about Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss.

On the approximation complexity hierarchy. (2011)
Conference Proceeding
Bordewich, M. (2011). On the approximation complexity hierarchy. In K. Jansen, & R. Solis-Oba (Eds.), 8th International Workshop on International Workshop on Approximation and Online Algorithms, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers. https://doi.org/10.1007/978-3-642-18318-8_4

This paper presents an extension of Ladner’s Theorem to the approximation complexity hierarchy. In 1975 Ladner proved that if P≠NP, then there exists an incomplete problem A which is neither in P nor NP-complete. Here we show that if RP≠NP, then ther... Read More about On the approximation complexity hierarchy..

Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. (2010)
Conference Proceeding
Bordewich, M., & Mihaescu, R. (2010). Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. In V. Moulton, & M. Singh (Eds.), Algorithms in Bioinformatics: 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010. Proceedings (250-261). https://doi.org/10.1007/978-3-642-15294-8_21

Distance based phylogenetic methods attempt to reconstruct an accurate phylogenetic tree relating a given set of taxa from an estimated matrix of pair-wise distances between taxa. This paper examines two distance based algorithms (GreedyBME and FastM... Read More about Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution..

Stopping times, metrics and approximate counting (2006)
Conference Proceeding
Bordewich, M., Dyer, M., & Karpinski, M. (2006). Stopping times, metrics and approximate counting. In M. Bugliesi, B. Preneel, V. Sassone, & I. Wegener (Eds.), Automata, languages and programming : 33rd International Colloquium, ICALP 2006, 10-14 July 2006, Venice, Italy ; proceedings, part I (108-119). https://doi.org/10.1007/11786986_11

In this paper we examine the importance of the choice of metric in path coupling, and its relationship to stopping time analysis. We give strong evidence that stopping time analysis is no more powerful than standard path coupling. In particular, we p... Read More about Stopping times, metrics and approximate counting.

Path coupling using stopping times (2005)
Conference Proceeding
Bordewich, M., Dyer, M., & Karpinski, M. (2005). Path coupling using stopping times. In M. Liśkiewicz, & R. Reischuk (Eds.), Fundamentals of computation theory : 15th International Symposium, FCT 2005, 17-20 August 2005, Lübeck, Germany ; proceedings (19-31). https://doi.org/10.1007/11537311_3

We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree... Read More about Path coupling using stopping times.