Environmental monitoring applications present a challenge to current background subtraction algorithms that analyze the temporal variability of pixel intensities, due to the comple...
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
We investigate the automated reconstruction of piecewise smooth 3D curves, using subdivision curves as a simple but flexible curve representation. This representation allows taggin...
Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this pa...
We describe an automatic method for building optimal 3D statistical shape models from sets of training shapes. Although shape models show considerable promise as a basis for segmen...
Rhodri H. Davies, Carole J. Twining, Timothy F. Co...