3,625 research outputs found

    Cellular automata as a tool for image processing

    Get PDF
    An overview is given on the use of cellular automata for image processing. We first consider the number of patterns that can exist in a neighbourhood, allowing for invariance to certain transformation. These patterns correspond to possible rules, and several schemes are described for automatically learning an appropriate rule set from training data. Two alternative schemes are given for coping with gray level (rather than binary) images without incurring a huge explosion in the number of possible rules. Finally, examples are provided of training various types of cellular automata with various rule identification schemes to perform several image processing tasks

    Computing global shape measures

    Get PDF
    Global shape measures are a convenient way to describe regions. They are generally simple and efficient to extract, and provide an easy means for high level tasks such as classification as well as helping direct low-level computer vision processes such as segmentation. In this chapter a large selection of global shape measures (some from the standard literature as well as other newer methods) are described and demonstrated

    Reconstruction and Particle Identification for a DIRC System

    Get PDF
    We study the reconstruction and particle identification (PID) problem for Ring Imaging devices providing a good knowledge of the direction of the Cerenkov photons, as the DIRC system, on which we specialize. We advocate first the use of the stereographic projection as a tool allowing a suitable representation of the photon data, as it allows to represent the Cerenkov cone always as a circle. We set up an algorithm able to perform reliably a fit of circle arcs of small angular opening, by minimising a true Chi2 expression. The system we develop for PID relies on this algorithm and on a procedure able to remove background photons with a high efficiency. We thus show that, even when the background is large, it is possible to perform an efficient PID by means of a fit algorithm which finally provides all the circle parameters; these are connected with the charged track direction and its Cerenkov angle. It is shown that background effects can be dealt without spoiling significantly the reconstruction probability distributions.Comment: 67 pages, 23 figure

    Improving shape from shading with interactive Tabu search

    Get PDF
    Optimisation based shape from shading (SFS) is sensitive to initialization: errors in initialization are a significant cause of poor overall shape reconstruction. In this paper, we present a method to help overcome this problem by means of user interaction. There are two key elements in our method. Firstly, we extend SFS to consider a set of initializations, rather than to use a single one. Secondly, we efficiently explore this initialization space using a heuristic search method, tabu search, guided by user evaluation of the reconstruction quality. Reconstruction results on both synthetic and real images demonstrate the effectiveness of our method in providing more desirable shape reconstructions

    Measuring the Accuracy of Object Detectors and Trackers

    Full text link
    The accuracy of object detectors and trackers is most commonly evaluated by the Intersection over Union (IoU) criterion. To date, most approaches are restricted to axis-aligned or oriented boxes and, as a consequence, many datasets are only labeled with boxes. Nevertheless, axis-aligned or oriented boxes cannot accurately capture an object's shape. To address this, a number of densely segmented datasets has started to emerge in both the object detection and the object tracking communities. However, evaluating the accuracy of object detectors and trackers that are restricted to boxes on densely segmented data is not straightforward. To close this gap, we introduce the relative Intersection over Union (rIoU) accuracy measure. The measure normalizes the IoU with the optimal box for the segmentation to generate an accuracy measure that ranges between 0 and 1 and allows a more precise measurement of accuracies. Furthermore, it enables an efficient and easy way to understand scenes and the strengths and weaknesses of an object detection or tracking approach. We display how the new measure can be efficiently calculated and present an easy-to-use evaluation framework. The framework is tested on the DAVIS and the VOT2016 segmentations and has been made available to the community.Comment: 10 pages, 7 Figure
    corecore