Neill D. F. Campbell

Neill D. F. Campbell

Auto-generated profile, based on publicly available information

Neill D. F. Campbell

University of Bath

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 August 2015 in Computer Graphics Forum
Verified
Journal Article
Open access
PDF file
DTDaniyar Turmukhambetov
Daniyar Turmukhambetov
NCNeill D.F. Campbell
Neill D.F. Campbell
DGDan B Goldman
Dan B Goldman
JKJan Kautz
Jan Kautz
We present an interactive system for composing realistic images of an object under arbitrary pose and appearance specified by sketching. Our system draws inspiration from a traditional illustration workflow: The user first sketches rough ‘masses’ of the object, as ellipses, to define an initial abstract pose that can then be refined with more detailed contours as desired. The system is made robust to partial or inaccurate sketches using a reduced‐dimensionality model of pose space learnt from a labelled collection of photos. Throughout the composition process, interactive visual feedback is provided to guide the user. Finally, the user's partial or complete sketch, complemented with appearance requirements, is used to constrain the automatic synthesis of a novel, high‐quality, realistic image.

3 August 2023 in Physics in Medicine & Biology
Verified
Journal Article
Open access
MDM A G Duff
M A G Duff
ISI J A Simpson
I J A Simpson
MEM J Ehrhardt
M J Ehrhardt
NCN D F Campbell
N D F Campbell
Objective. This paper investigates how generative models, trained on ground-truth images, can be used as priors for inverse problems, penalizing reconstructions far from images the generator can produce. The aim is that learned regularization will provide complex data-driven priors to inverse problems while still retaining the control and insight of a variational regularization method. Moreover, unsupervised learning, without paired training data, allows the learned regularizer to remain flexible to changes in the forward problem such as noise level, sampling pattern or coil sensitivities in MRI. Approach. We utilize variational autoencoders that generate not only an image but also a covariance uncertainty matrix for each image. The covariance can model changing uncertainty dependencies caused by structure in the image, such as edges or objects, and provides a new distance metric from the manifold of learned images. Main results. We evaluate these novel generative regularizers on retrospectively sub-sampled real-valued MRI measurements from the fastMRI dataset. We compare our proposed learned regularization against other unlearned regularization approaches and unsupervised and supervised deep learning methods. Significance. Our results show that the proposed method is competitive with other state-of-the-art methods and behaves consistently with changing sampling patterns and noise levels.

7 April 2016 in Computational Visual Media
Verified
Journal Article
Open access
PDF file
DBDaniel Beale
Daniel Beale
YYYong-Liang Yang
Yong-Liang Yang
NCNeill Campbell
Neill Campbell
DCDarren Cosker
Darren Cosker
PHPeter Hall
Peter Hall
Quadrics are a compact mathematical formulation for a range of primitive surfaces. A problem arises when there are not enough data points to compute the model but knowledge of the shape is available. This paper presents a method for fitting a quadric with a Bayesian prior. We use a matrix normal prior in order to favour ellipsoids when fitting to ambiguous data. The results show the algorithm copes well when there are few points in the point cloud, competing with contemporary techniques in the area.

4 February 2021 in Remote Sensing
Verified
Journal Article
Open access
PDF file
Milto MiltiadouMilto Miltiadou
Milto Miltiadou
NCNeill D. F. Campbell
Neill D. F. Campbell
DCDarren Cosker
Darren Cosker
MGMichael G. Grant
Michael G. Grant
In this paper, we investigate the performance of six data structures for managing voxelised full-waveform airborne LiDAR data during 3D polygonal model creation. While full-waveform LiDAR data has been available for over a decade, extraction of peak points is the most widely used approach of interpreting them. The increased information stored within the waveform data makes interpretation and handling difficult. It is, therefore, important to research which data structures are more appropriate for storing and interpreting the data. In this paper, we investigate the performance of six data structures while voxelising and interpreting full-waveform LiDAR data for 3D polygonal model creation. The data structures are tested in terms of time efficiency and memory consumption during run-time and are the following: (1) 1D-Array that guarantees coherent memory allocation, (2) Voxel Hashing, which uses a hash table for storing the intensity values (3) Octree (4) Integral Volumes that allows finding the sum of any cuboid area in constant time, (5) Octree Max/Min, which is an upgraded octree and (6) Integral Octree, which is proposed here and it is an attempt to combine the benefits of octrees and Integral Volumes. In this paper, it is shown that Integral Volumes is the more time efficient data structure but it requires the most memory allocation. Furthermore, 1D-Array and Integral Volumes require the allocation of coherent space in memory including the empty voxels, while Voxel Hashing and the octree related data structures do not require to allocate memory for empty voxels. These data structures, therefore, and as shown in the test conducted, allocate less memory. To sum up, there is a need to investigate how the LiDAR data are stored in memory. Each tested data structure has different benefits and downsides; therefore, each application should be examined individually.

1 January 2026 in Medical Engineering & Physics
Verified
Journal Article
Open access
APAllen Paul
Allen Paul
GGGeorge Grammatopoulos
George Grammatopoulos
ARAdwaye Rambojun
Adwaye Rambojun
NCNeill D F Campbell
Neill D F Campbell
Richie Harinderjit Singh GillRichie Harinderjit Singh Gill
Richie Harinderjit Singh Gill
TSTony Shardlow
Tony Shardlow
Dysplasia is a recognized risk factor for osteoarthritis (OA) of the hip, early diagnosis of dysplasia is important to provide opportunities for surgical interventions aimed at reducing the risk of hip OA. We have developed a pipeline for semi-automated classification of dysplasia using 3D surface models obtained from volumetric CT scans of patients' hips and a minimal set of four clinically annotated landmarks on the acetabular rim (the most proximal, distal, anterior and posterior aspects), combining the framework of the Gaussian process latent variable model with diffeomorphism to create a statistical shape model (SSM), which we termed the Gaussian process diffeomorphic SSM (GPDSSM). We used 192 CT scans, 100 for model training and 92 for testing. The GPDSSM effectively distinguishes dysplastic samples from controls while also highlighting regions of the underlying surface that show dysplastic variations. As well as improving classification accuracy compared to angle-based methods (AUC 96.2% vs 91.2%), the GPDSSM can save time for clinicians by removing the need to manually measure angles and interpreting 2D scans for possible markers of dysplasia.

26 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
JGJoseph Goodier
Joseph Goodier
NCNeill D. F. Campbell
Neill D. F. Campbell
Out-of-Distribution detection between dataset pairs has been extensively explored with generative models. We show that likelihood-based Out-of-Distribution detection can be extended to diffusion models by leveraging the fact that they, like other likelihood-based generative models, are dramatically affected by the input sample complexity. Currently, all Out-of-Distribution detection methods with Diffusion Models are reconstruction-based. We propose a new likelihood ratio for Out-of-Distribution detection with Deep Denoising Diffusion Models, which we call the Complexity Corrected Likelihood Ratio. Our likelihood ratio is constructed using Evidence Lower-Bound evaluations from an individual model at various noising levels. We present results that are comparable to state-of-the-art Out-of-Distribution detection methods with generative models.