Guy L. Scott

Learn More
In this paper we describe an algorithm that operates on the distances between features in the two related images and delivers a set of correspondences between them. The algorithm maximizes the inner product of two matrices, one of which is the desired 'pairing matrix' and the other a 'proximity matrix' with elements exp (-rij2/2 sigma 2), where rij is the(More)
We describe a widely applicable method of grouping or clustering image features (such as points, lines, corners, flow vectors and the like). It takes as input a "proximity matrix" H a square, symmetric matrix of dimension N (where N is the number of features). The element i,j of H is an initial estimate of the "proximity" between the ith and yth features.(More)
In this paper I introduce a new way of generating and describing shapes which was largely inspired by reading D'Arcy Thompson's classic "On Growth and Form" [1]. There are suggestive parallels between my system and "coupled oscillation" models of handwriting [2] and locomotion [3]. Like many others the system involves a mapping from a space of "implicit(More)
La remoci6n de conos de plata de los d ientes tratados endodont icamente es algunas veces complicada por numerosos factores. El uso del excavador ultrasonico s61o y e n combinaci6n con otros dispositivos para la remocibn de conos de plata ofrece las siguientes ventajas: 1. Conservaci6n de la estructura remanente del diente. 2. Evita el tratamiento(More)
We describe a form of damped wave process which appears to have considerable promise in early vision analysis. We demonstrate in particular its use in eliciting a version of the Symmetry Set the locus of centres of circles bitangent to a curve. The wave process is a method of implementing the "Symmetry Transform" of an image, which we define and discuss(More)
A relaxation algorithm for the computation of optic flow at edge elements (edgels) is presented. Flow is estimated only at intensity edges of the image. Edge elements, extracted from an intensity image, are used as the basis for the algorithm. A matching strength or weight surface is computed around each edgel and neighbourhood support obtained to enhance(More)
A highly efficient means of describing curves, surfaces or other configurations in space (or space-time) is to express the position vector as a sum of functions defined over some some interval in a space of one or more "implicit variables". The most familiar forms of these basis functions are the polynomial, trigonometric and superquadric. There seems no(More)
This paper describes a simple, fast and robust method of obtaining a depth field from a large number of (closely spaced) views of a scene. The method "synthetic aperture depth-from-focus" involves superimposing images in such a way as to obtain a synthetic "blurred" image similar to that which would be obtained by a single camera with a very large aperture(More)
Hildreth described a method of extracting the normal component of optic flow along a moving closed contour. She also described an algorithm based on gradient descent of recovering the smoothest full flow field consistent with the normal flow. Her iterative method is somewhat slow. It also leaves open the question of what, if anything, we are going to say(More)
  • 1