Demo Data from EDBT 2026 / reviewers in the wild / expert
Lyndsey C. Pickup
dblp:71/3364
· DBLP profile ↗
5ranked-venue papers
5as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorApplied, interdisciplinary, general and emerging 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.
| Artificial intelligence
3 papers |
Video understanding and tracking · 70% Probabilistic and Bayesian machine learning · 30% | |
| Computer graphics and multimedia
2 papers |
Image and video processing · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Video understanding and tracking
motion analysis |
0.2 | 1 | 2014 | Seeing the Arrow of Time · CVPR 2014 |
Computer vision › Video understanding and tracking
video analytics |
0.2 | 1 | 2014 | Seeing the Arrow of Time · CVPR 2014 |
Image and video processing › super-resolution
image super-resolution |
0.1 | 2 | 2006 | Bayesian Image Super-resolution, Continued · NIPS 2006 A Sampled Texture Prior for Image Super-Resolution · NIPS 2003 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference |
0.1 | 1 | 2006 | Bayesian Image Super-resolution, Continued · NIPS 2006 |
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
marginalization |
0.1 | 1 | 2006 | Bayesian Image Super-resolution, Continued · NIPS 2006 |
Image and video processing › super-resolution
multi-frame super-resolution |
0.1 | 1 | 2006 | Bayesian Image Super-resolution, Continued · NIPS 2006 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › prior distribution
image prior |
0.0 | 1 | 2003 | A Sampled Texture Prior for Image Super-Resolution · NIPS 2003 |
Image and video processing › super-resolution › image super-resolution
example-based super-resolution |
0.0 | 1 | 2003 | A Sampled Texture Prior for Image Super-Resolution · NIPS 2003 |
Methods — techniques the papers use, named apart from their topics
video classification · 0.2machine learning · 0.2registration parameter estimation · 0.1bayesian marginalization · 0.1sampled texture prior · 0.1maximum a posteriori estimation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Seeing the Arrow of TimeabstractWe explore whether we can observe Time's Arrow in a temporal sequence - is it possible to tell whether a video is running forwards or backwards? We investigate this somewhat philosophical question using computer vision and machine learning techniques. We explore three methods by which we might detect Time's Arrow in video sequences, based on distinct ways in which motion in video sequences might be asymmetric in time. We demonstrate good video forwards/backwards classification results on a selection of YouTube video clips, and on natively-captured sequences (with no temporally-dependent video compression), and examine what motions the models have learned that help discriminate forwards from backwards time. Lyndsey C. Pickup, Donglai Wei 0001, Changshui Zhang, Andrew Zisserman, Bernhard Schölkopf, William T. Freeman |
CVPR | 1 |
| 2009 | Bayesian Methods for Image Super-ResolutionabstractWe present a novel method of Bayesian image super-resolution in which marginalization is carried out over latent parameters such as geometric and photometric registration and the image point-spread function. Related Bayesian super-resolution approaches marginalize over the high-resolution image, necessitating the use of an unfavourable image prior, whereas our method allows for more realistic image prior distributions, and reduces the dimension of the integral considerably, removing the main computational bottleneck of algorithms such as Tipping and Bishop's Bayesian image super-resolution. We show results on real and synthetic datasets to illustrate the efficacy of our method. Lyndsey C. Pickup, David P. Capel, Stephen J. Roberts, Andrew Zisserman |
Comput. J. | 1 |
| 2006 | Optimizing and Learning for Super-resolutionabstractIn multiple-image super-resolution, a high resolution image is estimated from a number of lower-resolution images. This involves computing the parameters of a generative imaging model (such as geometric and photometric registration, and blur) and obtaining a MAP estimate by minimizing a cost function including an appropriate prior. We consider the quite general geometric registration situation modelled by a plane projective transformation, and make two novel contributions: (i) in previous approaches the MAP estimate has been obtained by first computing and fixing the registration, and then computing the super-resolution image with this registration. We demonstrate that superior estimates are obtained by optimizing over both the registration and image; (ii) the parameters of the edge preserving prior are learnt automatically from the data, rather than being set by trial and error. We show examples on a number of real sequences including multiple stills, digital video, and DVDs of movies. 1 Lyndsey C. Pickup, Stephen J. Roberts, Andrew Zisserman |
BMVC | 1 |
| 2006 | Bayesian Image Super-resolution, ContinuedabstractThis paper develops a multi-frame image super-resolution approach from a Bayesian view-point by marginalizing over the unknown registration parameters relating the set of input low-resolution views. In Tipping and Bishop’s Bayesian image super-resolution approach [16], the marginalization was over the super- resolution image, necessitating the use of an unfavorable image prior. By inte- grating over the registration parameters rather than the high-resolution image, our method allows for more realistic prior distributions, and also reduces the dimen- sion of the integral considerably, removing the main computational bottleneck of the other algorithm. In addition to the motion model used by Tipping and Bishop, illumination components are introduced into the generative model, allowing us to handle changes in lighting as well as motion. We show results on real and synthetic datasets to illustrate the efficacy of this approach. Lyndsey C. Pickup, David P. Capel, Stephen J. Roberts, Andrew Zisserman |
NIPS | 1 |
| 2003 | A Sampled Texture Prior for Image Super-ResolutionabstractSuper-resolution aims to produce a high-resolution image from a set of one or more low-resolution images by recovering or inventing plausible high-frequency image content. Typical approaches try to reconstruct a high-resolution image using the sub-pixel displacements of several low- resolution images, usually regularized by a generic smoothness prior over the high-resolution image space. Other methods use training data to learn low-to-high-resolution matches, and have been highly successful even in the single-input-image case. Here we present a domain-specific im- age prior in the form of a p.d.f. based upon sampled images, and show that for certain types of super-resolution problems, this sample-based prior gives a significant improvement over other common multiple-image super-resolution techniques. Lyndsey C. Pickup, Stephen J. Roberts, Andrew Zisserman |
NIPS | 1 |