Stewart Burn

dblp:04/8408 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Artificial intelligence and machine learning · 1Security and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 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 graphics and multimedia
1 paper
Image and video processing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image segmentation
0.112011
Superpixels via pseudo-Boolean optimization · ICCV 2011
Image and video processing › image segmentation
superpixel segmentation
0.112011
Superpixels via pseudo-Boolean optimization · ICCV 2011
Mathematical optimization › integer programming
pseudo-boolean optimization
0.112011
Superpixels via pseudo-Boolean optimization · ICCV 2011

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

pseudo-boolean optimization · 0.2
YearPublicationVenuePosition
2011 Superpixels via pseudo-Boolean optimization
abstract
We propose an algorithm for creating superpixels. The major step in our algorithm is simply minimizing two pseudo-Boolean functions. The processing time of our algorithm on images of moderate size is only half a second. Experiments on a benchmark dataset show that our method produces superpixels of comparable quality with existing algorithms. Last but not least, the speed of our algorithm is independent of the number of superpixels, which is usually the bottle-neck for the traditional algorithms of superpixel creation.
Yuhang Zhang 0001, Richard I. Hartley, John Mashford, Stewart Burn
ICCV4
2009 An Approach to Leak Detection in Pipe Networks Using Analysis of Monitored Pressure Values by Support Vector Machine
abstract
This paper presents a method of mining the data obtained by a collection of pressure sensors monitoring a pipe network to obtain information about the location and size of leaks in the network. This inverse engineering problem is effected by support vector machines (SVMs) which act as pattern recognisers. In this study the SVMs are trained and tested on data obtained from the EPANET hydraulic modelling system. Performance assessment of the SVM showed that leak size and location are both predicted with a reasonable degree of accuracy. The information obtained from this SVM analysis would be invaluable to water authorities in overcoming the ongoing problem of leak detection.
John Mashford, Dhammika De Silva, Donavan Marney, Stewart Burn
NSS4