Learn More
We propose a new relaxation scheme for graph matching in computer vision. The main distinguishing feature of our approach is that matching is formulated as a process of eliminating unlikely candidates rather than finding the best match directly. Bayesian development leads to a robust algorithm which can be implemented in a fast and efficient manner on a(More)
OBJECTIVE To determine the survival time of Mycobacterium avium subsp paratuberculosis in amitraz-based cattle dip fluid derived from an active dip site in northern New South Wales. PROCEDURE Following inoculation of triplicate 5 L containers with faeces (0.5 g/L) from a clinical case of bovine paratuberculosis, samples collected up to 8 weeks after(More)
We develop a binary relaxation scheme for graph matching in chemical databases. The technique works by iteratively pruning the list of matching possibilities for individual atoms based upon contextual information. Its key features include delayed decision-making, robustness to noise, and fast and eecient neural implementation. We illustrate the utility of(More)
The fluid warming capabilities of the Bair Hugger, Hotline, Standard Ranger and Fluido devices were evaluated in the laboratory with gravity flow via a 14G cannula (1 m head of fluid) and with the fluid bag pressurised to 300 mmHg. The resulting flows (70-450 ml.min(-1)) were recorded. At a room temperature of 22 degrees C, no device warmed the fluid to 37(More)
We read with interest the article by Kallio et al. which investigated the efficacy of applying an external compression device to the eyes of glaucoma patients, in an effort to attenuate block-related changes in intraocular pressure (IOP) [1]. We agree with their conclusion that pre-emptive compression confers negligible clinical benefit. Aberrations of IOP(More)
We describe a technique for matching a single, learned elastic model of the shape of normal chromosomes to chromosomal images. Our model has a hierarchical organisation, with increasingly coarse shape descriptions at higher levels. A problem of finding the model description most likely to have generated an image is reduced to one of matching the locations(More)