8,321 research outputs found

    A smart environment for biometric capture

    No full text
    The development of large scale biometric systems require experiments to be performed on large amounts of data. Existing capture systems are designed for fixed experiments and are not easily scalable. In this scenario even the addition of extra data is difficult. We developed a prototype biometric tunnel for the capture of non-contact biometrics. It is self contained and autonomous. Such a configuration is ideal for building access or deployment in secure environments. The tunnel captures cropped images of the subject's face and performs a 3D reconstruction of the person's motion which is used to extract gait information. Interaction between the various parts of the system is performed via the use of an agent framework. The design of this system is a trade-off between parallel and serial processing due to various hardware bottlenecks. When tested on a small population the extracted features have been shown to be potent for recognition. We currently achieve a moderate throughput of approximate 15 subjects an hour and hope to improve this in the future as the prototype becomes more complete

    Superstrings with Intrinsic Torsion

    Get PDF
    We systematically analyse the necessary and sufficient conditions for the preservation of supersymmetry for bosonic geometries of the form R^{1,9-d} \times M_d, in the common NS-NS sector of type II string theory and also type I/heterotic string theory. The results are phrased in terms of the intrinsic torsion of G-structures and provide a comprehensive classification of static supersymmetric backgrounds in these theories. Generalised calibrations naturally appear since the geometries always admit NS or type I/heterotic fivebranes wrapping calibrated cycles. Some new solutions are presented. In particular we find d=6 examples with a fibred structure which preserve N=1,2,3 supersymmetry in type II and include compact type I/heterotic geometries.Comment: 58 pages, LaTeX; v2: New section on solutions including an example with N=3 supersymmetry and discussion of heterotic compactifications. Details on conventions and references added. v3: added an explicit example of non-integrable product structure in Appendix C; some typos fixe

    The 2-79 keV X-ray Spectrum of the Circinus Galaxy with NuSTAR, XMM-Newton and Chandra: a Fully Compton-Thick AGN

    Get PDF
    The Circinus galaxy is one of the nearest obscured AGN, making it an ideal target for detailed study. Combining archival Chandra and XMM-Newton data with new NuSTAR observations, we model the 2-79 keV spectrum to constrain the primary AGN continuum and to derive physical parameters for the obscuring material. Chandra's high angular resolution allows a separation of nuclear and off-nuclear galactic emission. In the off-nuclear diffuse emission we find signatures of strong cold reflection, including high equivalent-width neutral Fe lines. This Compton-scattered off-nuclear emission amounts to 18% of the nuclear flux in the Fe line region, but becomes comparable to the nuclear emission above 30 keV. The new analysis no longer supports a prominent transmitted AGN component in the observed band. We find that the nuclear spectrum is consistent with Compton-scattering by an optically-thick torus, where the intrinsic spectrum is a powerlaw of photon index Γ=2.22.4\Gamma = 2.2-2.4, the torus has an equatorial column density of NH=(610)×1024N_{\rm H} = (6-10)\times10^{24}cm2^{-2} and the intrinsic AGN 2102-10 keV luminosity is (2.35.1)×1042(2.3-5.1)\times 10^{42} erg/s. These values place Circinus along the same relations as unobscured AGN in accretion rate-vs-Γ\Gamma and LXL_X-vs-LIRL_{IR} phase space. NuSTAR's high sensitivity and low background allow us to study the short time-scale variability of Circinus at X-ray energies above 10 keV for the first time. The lack of detected variability favors a Compton-thick absorber, in line with the the spectral fitting results.Comment: Accepted for publication in Ap

    Using Points at Infinity for Parameter Decoupling in Camera Calibration

    Full text link

    Biometric fusion methods for adaptive face recognition in computer vision

    Get PDF
    PhD ThesisFace recognition is a biometric method that uses different techniques to identify the individuals based on the facial information received from digital image data. The system of face recognition is widely used for security purposes, which has challenging problems. The solutions to some of the most important challenges are proposed in this study. The aim of this thesis is to investigate face recognition across pose problem based on the image parameters of camera calibration. In this thesis, three novel methods have been derived to address the challenges of face recognition and offer solutions to infer the camera parameters from images using a geomtric approach based on perspective projection. The following techniques were used: camera calibration CMT and Face Quadtree Decomposition (FQD), in order to develop the face camera measurement technique (FCMT) for human facial recognition. Facial information from a feature extraction and identity-matching algorithm has been created. The success and efficacy of the proposed algorithm are analysed in terms of robustness to noise, the accuracy of distance measurement, and face recognition. To overcome the intrinsic and extrinsic parameters of camera calibration parameters, a novel technique has been developed based on perspective projection, which uses different geometrical shapes to calibrate the camera. The parameters used in novel measurement technique CMT that enables the system to infer the real distance for regular and irregular objects from the 2-D images. The proposed system of CMT feeds into FQD to measure the distance between the facial points. Quadtree decomposition enhances the representation of edges and other singularities along curves of the face, and thus improves directional features from face detection across face pose. The proposed FCMT system is the new combination of CMT and FQD to recognise the faces in the various pose. The theoretical foundation of the proposed solutions has been thoroughly developed and discussed in detail. The results show that the proposed algorithms outperform existing algorithms in face recognition, with a 2.5% improvement in main error recognition rate compared with recent studies

    The Visual Social Distancing Problem

    Get PDF
    One of the main and most effective measures to contain the recent viral outbreak is the maintenance of the so-called Social Distancing (SD). To comply with this constraint, workplaces, public institutions, transports and schools will likely adopt restrictions over the minimum inter-personal distance between people. Given this actual scenario, it is crucial to massively measure the compliance to such physical constraint in our life, in order to figure out the reasons of the possible breaks of such distance limitations, and understand if this implies a possible threat given the scene context. All of this, complying with privacy policies and making the measurement acceptable. To this end, we introduce the Visual Social Distancing (VSD) problem, defined as the automatic estimation of the inter-personal distance from an image, and the characterization of the related people aggregations. VSD is pivotal for a non-invasive analysis to whether people comply with the SD restriction, and to provide statistics about the level of safety of specific areas whenever this constraint is violated. We then discuss how VSD relates with previous literature in Social Signal Processing and indicate which existing Computer Vision methods can be used to manage such problem. We conclude with future challenges related to the effectiveness of VSD systems, ethical implications and future application scenarios.Comment: 9 pages, 5 figures. All the authors equally contributed to this manuscript and they are listed by alphabetical order. Under submissio

    Field Geometric Calibration Method for Line Structured Light Sensor Using Single Circular Target

    Get PDF

    A Camera Self-Calibration Method Based on Plane Lattice and Orthogonality

    Get PDF
     The calibration using orthogonal line is one of the basic approaches of camera calibration, but it requires the orthogonal line be accurately detected, which makes results of error increases. This paper propose a novel camera self-calibration technique using plane lattices and virtual orthogonal line. The rigorous analytical relations among the feature point coordinates of the plane lattice, the corresponding image point coordinate, intrinsic parameters, relative pose are induced according to homography matrix of the central projection. Let a slope of non-parallel and non-orthogonal virtual line in the lattice plane, and the slope of its orthonormal line can be calculated. In at least three photographs taken, vanishing points can be solved in two groups of orthogonal directions by using the homography matrix, so the camera intrinsic parameters are linearly figured out. This method has both simple principle and convenient pattern manufacture, and does not involve image matching, besides having no requirement concerning camera motion. Simulation experiments and real data show that this algorithm is feasible, and provides a higher accuracy and robustness

    Towards A Self-calibrating Video Camera Network For Content Analysis And Forensics

    Get PDF
    Due to growing security concerns, video surveillance and monitoring has received an immense attention from both federal agencies and private firms. The main concern is that a single camera, even if allowed to rotate or translate, is not sufficient to cover a large area for video surveillance. A more general solution with wide range of applications is to allow the deployed cameras to have a non-overlapping field of view (FoV) and to, if possible, allow these cameras to move freely in 3D space. This thesis addresses the issue of how cameras in such a network can be calibrated and how the network as a whole can be calibrated, such that each camera as a unit in the network is aware of its orientation with respect to all the other cameras in the network. Different types of cameras might be present in a multiple camera network and novel techniques are presented for efficient calibration of these cameras. Specifically: (i) For a stationary camera, we derive new constraints on the Image of the Absolute Conic (IAC). These new constraints are shown to be intrinsic to IAC; (ii) For a scene where object shadows are cast on a ground plane, we track the shadows on the ground plane cast by at least two unknown stationary points, and utilize the tracked shadow positions to compute the horizon line and hence compute the camera intrinsic and extrinsic parameters; (iii) A novel solution to a scenario where a camera is observing pedestrians is presented. The uniqueness of formulation lies in recognizing two harmonic homologies present in the geometry obtained by observing pedestrians; (iv) For a freely moving camera, a novel practical method is proposed for its self-calibration which even allows it to change its internal parameters by zooming; and (v) due to the increased application of the pan-tilt-zoom (PTZ) cameras, a technique is presented that uses only two images to estimate five camera parameters. For an automatically configurable multi-camera network, having non-overlapping field of view and possibly containing moving cameras, a practical framework is proposed that determines the geometry of such a dynamic camera network. It is shown that only one automatically computed vanishing point and a line lying on any plane orthogonal to the vertical direction is sufficient to infer the geometry of a dynamic network. Our method generalizes previous work which considers restricted camera motions. Using minimal assumptions, we are able to successfully demonstrate promising results on synthetic as well as on real data. Applications to path modeling, GPS coordinate estimation, and configuring mixed-reality environment are explored
    corecore