2,215 research outputs found

    Statistical/Geometric Techniques for Object Representation and Recognition

    Get PDF
    Object modeling and recognition are key areas of research in computer vision and graphics with wide range of applications. Though research in these areas is not new, traditionally most of it has focused on analyzing problems under controlled environments. The challenges posed by real life applications demand for more general and robust solutions. The wide variety of objects with large intra-class variability makes the task very challenging. The difficulty in modeling and matching objects also vary depending on the input modality. In addition, the easy availability of sensors and storage have resulted in tremendous increase in the amount of data that needs to be processed which requires efficient algorithms suitable for large-size databases. In this dissertation, we address some of the challenges involved in modeling and matching of objects in realistic scenarios. Object matching in images require accounting for large variability in the appearance due to changes in illumination and view point. Any real world object is characterized by its underlying shape and albedo, which unlike the image intensity are insensitive to changes in illumination conditions. We propose a stochastic filtering framework for estimating object albedo from a single intensity image by formulating the albedo estimation as an image estimation problem. We also show how this albedo estimate can be used for illumination insensitive object matching and for more accurate shape recovery from a single image using standard shape from shading formulation. We start with the simpler problem where the pose of the object is known and only the illumination varies. We then extend the proposed approach to handle unknown pose in addition to illumination variations. We also use the estimated albedo maps for another important application, which is recognizing faces across age progression. Many approaches which address the problem of modeling and recognizing objects from images assume that the underlying objects are of diffused texture. But most real world objects exhibit a combination of diffused and specular properties. We propose an approach for separating the diffused and specular reflectance from a given color image so that the algorithms proposed for objects of diffused texture become applicable to a much wider range of real world objects. Representing and matching the 2D and 3D geometry of objects is also an integral part of object matching with applications in gesture recognition, activity classification, trademark and logo recognition, etc. The challenge in matching 2D/3D shapes lies in accounting for the different rigid and non-rigid deformations, large intra-class variability, noise and outliers. In addition, since shapes are usually represented as a collection of landmark points, the shape matching algorithm also has to deal with the challenges of missing or unknown correspondence across these data points. We propose an efficient shape indexing approach where the different feature vectors representing the shape are mapped to a hash table. For a query shape, we show how the similar shapes in the database can be efficiently retrieved without the need for establishing correspondence making the algorithm extremely fast and scalable. We also propose an approach for matching and registration of 3D point cloud data across unknown or missing correspondence using an implicit surface representation. Finally, we discuss possible future directions of this research

    Advancement and applications of the template matching approach to indexing electron backscatter patterns

    Get PDF
    Electron backscatter diffraction is a well-established characterisation technique used to determine the orientation and crystal phase of a crystalline material. A pattern is formed by dynamical interaction of elections with the crystal lattice, which can be understood and simulated by using Bloch wave theory. The conventional method of indexing a diffraction pattern is to use a Hough transform to convert the lines of the pattern to points that are easily accessible to a computer. As the bands of the pattern are direct projections of the crystal planes, the interplanar angles can then be computed and compared to a look up table to determine phase and orientation. This method works well for most examples, however, is not well suited to more complex unit cells, due to the fact it ignores more subtle features of the patterns. This thesis proposes a refined template matching approach which uses efficient pattern matching algorithms, such as those used in the field of computer vision, for phase determination and orientation analysis. This thesis introduces the method and demonstrates its efficacy, as well as introducing advanced methods for pseudosymmetry analysis and phase mapping. A new metric for phase confidence is also proposed and the refined method is shown to be able to correctly determine phases and pseudosymmetric orientations. Finally, preliminary work on a direct electron detector stage is presented. Work on the development, testing the pattern centre reliability, modulation transfer and an example map is shown.Open Acces

    The ArgoNeuT Detector in the NuMI Low-Energy beam line at Fermilab

    Get PDF
    The ArgoNeuT liquid argon time projection chamber has collected thousands of neutrino and antineutrino events during an extended run period in the NuMI beam-line at Fermilab. This paper focuses on the main aspects of the detector layout and related technical features, including the cryogenic equipment, time projection chamber, read-out electronics, and off-line data treatment. The detector commissioning phase, physics run, and first neutrino event displays are also reported. The characterization of the main working parameters of the detector during data-taking, the ionization electron drift velocity and lifetime in liquid argon, as obtained from through-going muon data complete the present report.Comment: 43 pages, 27 figures, 5 tables - update referenc

    Effective Method of Image Retrieval Using Markov Random Field with Hough Transform

    Get PDF
    The emergence of multimedia technology and the rapidly expanding image collections on the database have attracted significant research efforts in providing tools for effective retrieval and management of visual data. The need to find a desired image from a large collection. Image retrieval is the field of study concerned with searching and retrieving digital image from a collection of database .In real images, regions are often homogenous; neighboring pixels usually have similar properties (shape, color, texture) Markov Random Field (MRF) is a probabilistic model which captures such contextual constraints. Hough Transform method is used for detecting lines in binary images. Spatially extended patterns are transformed to produce compact features in a parameter space. The main advantages of using the HT is, it treats each edge point independently this means that the parallel processing of all points is possible which is suitable for real-time applications

    Linear Features in Photogrammetry

    Get PDF
    This research addresses the task of including points as well as linear features in photogrammetric applications. Straight lines in object space can be utilized to perform aerial triangulation. Irregular linear features (natural lines) in object space can be utilized to perform single photo resection and automatic relative orientation. When working with primitives, it is important to develop appropriate representations in image and object space. These representations must accommodate for the perspective projection relating the two spaces. There are various options for representing linear features in the above applications. These options have been explored, and an optimal representation has been chosen. An aerial triangulation technique that utilizes points and straight lines for frame and linear array scanners has been implemented. For this task, the MSAT (Multi Sensor Aerial Triangulation) software, developed at the Ohio State University, has been extended to handle straight lines. The MSAT software accommodates for frame and linear array scanners. In this research, natural lines were utilized to perform single photo resection and automatic relative orientation. In single photo resection, the problem is approached with no knowledge of the correspondence of natural lines between image space and object space. In automatic relative orientation, the problem is approached without knowledge of conjugate linear features in the overlap of the stereopair. The matching problem and the appropriate parameters are determined by use of the modified generalized Hough transform. These techniques were tested using simulated and real data sets for frame imagery
    • …
    corecore