41 resultados para camera allocation
em CentAUR: Central Archive University of Reading - UK
Resumo:
The paper reports an interactive tool for calibrating a camera, suitable for use in outdoor scenes. The motivation for the tool was the need to obtain an approximate calibration for images taken with no explicit calibration data. Such images are frequently presented to research laboratories, especially in surveillance applications, with a request to demonstrate algorithms. The method decomposes the calibration parameters into intuitively simple components, and relies on the operator interactively adjusting the parameter settings to achieve a visually acceptable agreement between a rectilinear calibration model and his own perception of the scene. Using the tool, we have been able to calibrate images of unknown scenes, taken with unknown cameras, in a matter of minutes. The standard of calibration has proved to be sufficient for model-based pose recovery and tracking of vehicles.
Resumo:
A novel Swarm Intelligence method for best-fit search, Stochastic Diffusion Search, is presented capable of rapid location of the optimal solution in the search space. Population based search mechanisms employed by Swarm Intelligence methods can suffer lack of convergence resulting in ill defined stopping criteria and loss of the best solution. Conversely, as a result of its resource allocation mechanism, the solutions SDS discovers enjoy excellent stability.
Resumo:
Several pixel-based people counting methods have been developed over the years. Among these the product of scale-weighted pixel sums and a linear correlation coefficient is a popular people counting approach. However most approaches have paid little attention to resolving the true background and instead take all foreground pixels into account. With large crowds moving at varying speeds and with the presence of other moving objects such as vehicles this approach is prone to problems. In this paper we present a method which concentrates on determining the true-foreground, i.e. human-image pixels only. To do this we have proposed, implemented and comparatively evaluated a human detection layer to make people counting more robust in the presence of noise and lack of empty background sequences. We show the effect of combining human detection with a pixel-map based algorithm to i) count only human-classified pixels and ii) prevent foreground pixels belonging to humans from being absorbed into the background model. We evaluate the performance of this approach on the PETS 2009 dataset using various configurations of the proposed methods. Our evaluation demonstrates that the basic benchmark method we implemented can achieve an accuracy of up to 87% on sequence ¿S1.L1 13-57 View 001¿ and our proposed approach can achieve up to 82% on sequence ¿S1.L3 14-33 View 001¿ where the crowd stops and the benchmark accuracy falls to 64%.
Resumo:
Garment information tracking is required for clean room garment management. In this paper, we present a camera-based robust system with implementation of Optical Character Reconition (OCR) techniques to fulfill garment label recognition. In the system, a camera is used for image capturing; an adaptive thresholding algorithm is employed to generate binary images; Connected Component Labelling (CCL) is then adopted for object detection in the binary image as a part of finding the ROI (Region of Interest); Artificial Neural Networks (ANNs) with the BP (Back Propagation) learning algorithm are used for digit recognition; and finally the system is verified by a system database. The system has been tested. The results show that it is capable of coping with variance of lighting, digit twisting, background complexity, and font orientations. The system performance with association to the digit recognition rate has met the design requirement. It has achieved real-time and error-free garment information tracking during the testing.
Resumo:
The populations of many species are structured such that mating is not random and occurs between members of local patches. When patches are founded by a single female and all matings occur between siblings, brothers may compete with each other for matings with their sisters. This local mate competition (LMC) selects for a female-biased sex ratio, especially in species where females have control over offspring sex, as in the parasitic Hymenoptera. Two factors are predicted to decrease the degree of female bias: (1) an increase in the number of foundress females in the patch and (2) an increase in the fraction of individuals mating after dispersal from the natal patch. Pollinating fig wasps are well known as classic examples of species where all matings occur in the local patch. We studied non-pollinating fig wasps, which are more diverse than the pollinating fig wasps and also provide natural experimental groups of species with different male morphologies that are linked to different mating structures. In this group of wasps, species with wingless males mate in the local patch (i.e. the fig fruit) while winged male species mate after dispersal. Species with both kinds of male have a mixture of local and non-local mating. Data from 44 species show that sex ratios (defined as the proportion of males) are in accordance with theoretical predictions: wingless male species < wing-dimorphic male species < winged male species. These results are also supported by a formal comparative analysis that controls for phylogeny. The foundress number is difficult to estimate directly for non-pollinating fig wasps but a robust indirect method leads to the prediction that foundress number, and hence sex ratio, should increase with the proportion of patches occupied in a crop. This result is supported strongly across 19 species with wingless males, but not across 8 species with winged males. The mean sex ratios for species with winged males are not significantly different from 0.5, and the absence of the correlation observed across species with wingless males may reflect weak selection to adjust the sex ratio in species whose population mating structure tends not to be subdivided. The same relationship is also predicted to occur within species if individual females adjust their sex ratios facultatively. This final prediction was not supported by data from a wingless male species, a male wing-dimorphic species or a winged male species.
Resumo:
The host choice and sex allocation decisions of a foraging female parasitoid will have an enormous influence on the life-history characteristics of her offspring. The pteromalid Pachycrepoideus vindemiae is a generalist idiobiont pupal parasitoid of many species of cyclorrhaphous Diptera. Wasps reared in Musca domestica were larger, had higher attack rates and greater male mating success than those reared in Drosophila melanogaster. In no-choice situations, naive female R vindemiae took significantly less time to accept hosts conspecific with their natal host. Parasitoids that emerged from M. domestica pupae spent similar amounts of time ovipositing in both D. melanogaster and M. domestica. Those parasitoids that had emerged from D. melanogaster spent significantly longer attacking M. domestica pupae. The host choice behaviour of female P. vindemiae was influenced by an interaction between natal host and experience. Female R vindemiae reared in M. domestica only showed a preference among hosts when allowed to gain experience attacking M. domestica, preferentially attacking that species. Similarly, female parasitoids reared on D. melanogaster only showed a preference among hosts when allowed to gain experience attacking D. melanogaster, again preferentially attacking that species. Wasp natal host also influenced sex allocation behaviour. While wasps from both hosts oviposited more females in the larger host, M. domestica, wasps that emerged from M. domestica had significantly more male-biased offspring sex ratios. These results indicate the importance of learning and natal host size in determining R vindemiae attack rates. mating success, host preference and sex allocation behaviour, all critical components of parasitoid fitness.
Resumo:
Calibrated cameras are an extremely useful resource for computer vision scenarios. Typically, cameras are calibrated through calibration targets, measurements of the observed scene, or self-calibrated through features matched between cameras with overlapping fields of view. This paper considers an approach to camera calibration based on observations of a pedestrian and compares the resulting calibration to a commonly used approach requiring that measurements be made of the scene.
Resumo:
The Stochastic Diffusion Search (SDS) was developed as a solution to the best-fit search problem. Thus, as a special case it is capable of solving the transform invariant pattern recognition problem. SDS is efficient and, although inherently probabilistic, produces very reliable solutions in widely ranging search conditions. However, to date a systematic formal investigation of its properties has not been carried out. This thesis addresses this problem. The thesis reports results pertaining to the global convergence of SDS as well as characterising its time complexity. However, the main emphasis of the work, reports on the resource allocation aspect of the Stochastic Diffusion Search operations. The thesis introduces a novel model of the algorithm, generalising an Ehrenfest Urn Model from statistical physics. This approach makes it possible to obtain a thorough characterisation of the response of the algorithm in terms of the parameters describing the search conditions in case of a unique best-fit pattern in the search space. This model is further generalised in order to account for different search conditions: two solutions in the search space and search for a unique solution in a noisy search space. Also an approximate solution in the case of two alternative solutions is proposed and compared with predictions of the extended Ehrenfest Urn model. The analysis performed enabled a quantitative characterisation of the Stochastic Diffusion Search in terms of exploration and exploitation of the search space. It appeared that SDS is biased towards the latter mode of operation. This novel perspective on the Stochastic Diffusion Search lead to an investigation of extensions of the standard SDS, which would strike a different balance between these two modes of search space processing. Thus, two novel algorithms were derived from the standard Stochastic Diffusion Search, ‘context-free’ and ‘context-sensitive’ SDS, and their properties were analysed with respect to resource allocation. It appeared that they shared some of the desired features of their predecessor but also possessed some properties not present in the classic SDS. The theory developed in the thesis was illustrated throughout with carefully chosen simulations of a best-fit search for a string pattern, a simple but representative domain, enabling careful control of search conditions.