• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 162
  • 58
  • 24
  • 14
  • 11
  • 6
  • 4
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 347
  • 347
  • 105
  • 99
  • 59
  • 59
  • 46
  • 40
  • 35
  • 32
  • 26
  • 26
  • 25
  • 25
  • 25
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

A probabilistic integrated object recognition and tracking framework for video sequences

Amezquita Gómez, Nicolás 04 December 2009 (has links)
Recognition and tracking of multiple objects in video sequences is one of the main challenges in computer vision that currently deserves a lot of attention from researchers. Almost all the reported approaches are very application-dependent and there is a lack of a general methodology for dynamic object recognition and tracking that can be instantiated in particular cases. In this thesis, the work is oriented towards the definition and development of such a methodology which integrates object recognition and tracking from a general perspective using a probabilistic framework called PIORT (probabilistic integrated object recognition and tracking framework). It include some modules for which a variety of techniques and methods can be applied. Some of them are well-known but other methods have been designed, implemented and tested during the development of this thesis.The first step in the proposed framework is a static recognition module that provides class probabilities for each pixel of the image from a set of local features. These probabilities are updated dynamically and supplied to a tracking decision module capable of handling full and partial occlusions. The two specific methods presented use RGB colour features and differ in the classifier implemented: one is a Bayesian method based on maximum likelihood and the other one is based on a neural network. The experimental results obtained have shown that, on one hand, the neural net based approach performs similarly and sometimes better than the Bayesian approach when they are integrated within the tracking framework. And on the other hand, our PIORT methods have achieved better results when compared to other published tracking methods. All these methods have been tested experimentally in several test video sequences taken with still and moving cameras and including full and partial occlusions of the tracked object in indoor and outdoor scenarios in a variety of cases with different levels of task complexity. This allowed the evaluation of the general methodology and the alternative methods that compose these modules.A Probabilistic Integrated Object Recognition and Tracking Framework for Video Sequences / El reconocimiento y seguimiento de múltiples objetos en secuencias de vídeo es uno de los principales desafíos en visión por ordenador que actualmente merece mucha atención de los investigadores. Casi todos los enfoques reportados son muy dependientes de la aplicación y hay carencia de una metodología general para el reconocimiento y seguimiento dinámico de objetos, que pueda ser instanciada en casos particulares. En esta tesis, el trabajo esta orientado hacia la definición y desarrollo de tal metodología, la cual integra reconocimiento y seguimiento de objetos desde una perspectiva general usando un marco probabilístico de trabajo llamado PIORT (Probabilistic Integrated Object Recognition and Tracking). Este incluye algunos módulos para los que se puede aplicar una variedad de técnicas y métodos. Algunos de ellos son bien conocidos, pero otros métodos han sido diseñados, implementados y probados durante el desarrollo de esta tesis.El primer paso en el marco de trabajo propuesto es un módulo estático de reconocimiento que provee probabilidades de clase para cada píxel de la imagen desde un conjunto de características locales. Estas probabilidades son actualizadas dinámicamente y suministradas a un modulo decisión de seguimiento capaz de manejar oclusiones parciales o totales. Se presenta dos métodos específicos usando características de color RGB pero diferentes en la implementación del clasificador: uno es un método Bayesiano basado en la máxima verosimilitud y el otro método está basado en una red neuronal. Los resultados experimentales obtenidos han mostrado que, por una parte, el enfoque basado en la red neuronal funciona similarmente y algunas veces mejor que el enfoque bayesiano cuando son integrados dentro del marco probabilístico de seguimiento. Por otra parte, nuestro método PIORT ha alcanzado mejores resultados comparando con otros métodos de seguimiento publicados. Todos estos métodos han sido probados experimentalmente en varias secuencias de vídeo tomadas con cámaras fijas y móviles incluyendo oclusiones parciales y totales del objeto a seguir, en ambientes interiores y exteriores, en diferentes tareas y niveles de complejidad. Esto ha permitido evaluar tanto la metodología general como los métodos alternativos que componen sus módulos.

Real-time Object Recognition in Sparse Range Images Using Error Surface Embedding

Shang, LIMIN 25 January 2010 (has links)
In this work we address the problem of object recognition and localization from sparse range data. The method is based upon comparing the 7-D error surfaces of objects in various poses, which result from the registration error function between two convolved surfaces. The objects and their pose values are encoded by a small set of feature vectors extracted from the minima of the error surfaces. The problem of object recognition is thus reduced to comparing these feature vectors to find the corresponding error surfaces between the runtime data and a preprocessed database. Specifically, we present a new approach to the problems of pose determination, object recognition and object class recognition. The algorithm has been implemented and tested on both simulated and real data. The experimental results demonstrate the technique to be both effective and efficient, executing at 122 frames per second on standard hardware and with recognition rates exceeding 97% for a database of 60 objects. The performance of the proposed potential well space embedding (PWSE) approach on large size databases was also evaluated on the Princeton Shape Bench- mark containing 1,814 objects. In experiments of object class recognition with the Princeton Shape Benchmark, PWSE is able to provide better classification rates than the previous methods in terms of nearest neighbour classification. In addition, PWSE is shown to (i) operate with very sparse data, e.g., comprising only hundreds of points per image, and (ii) is robust to measurement error and outliers. / Thesis (Ph.D, Electrical & Computer Engineering) -- Queen's University, 2010-01-24 23:07:30.108

Colour object search

Walcott, P. A. January 1998 (has links)
No description available.

Building and updating a library of three-dimensional objects

Jaitly, Rahul January 1997 (has links)
No description available.

The contribution of meaning in forming holistic and segmented based visual representations

Smith, Wendy January 2000 (has links)
No description available.

Acquisition of range data using blurred images

Whitehouse, J. C. January 1986 (has links)
No description available.

Finite elements for image analysis

Karaolani, Persephoni January 1994 (has links)
No description available.

Recognition and Localization of Overlapping Parts from Sparse Data

Grimson, W. Eric L., Lozano-Perez, Tomas 01 June 1985 (has links)
This paper discusses how sparse local measurements of positions and surface normals may be used to identify and locate overlapping objects. The objects are modeled as polyhedra (or polygons) having up to six degreed of positional freedom relative to the sensors. The approach operated by examining all hypotheses about pairings between sensed data and object surfaces and efficiently discarding inconsistent ones by using local constraints on: distances between faces, angles between face normals, and angles (relative to the surface normals) of vectors between sensed points. The method described here is an extension of a method for recognition and localization of non-overlapping parts previously described in [Grimson and Lozano-Perez 84] and [Gaston and Lozano-Perez 84].

Recognizing 3D Ojbects of 2D Images: An Error Analysis

Grimson, W. Eric, Huttenlocher, Daniel P., Alter, T. D. 01 July 1992 (has links)
Many object recognition systems use a small number of pairings of data and model features to compute the 3D transformation from a model coordinate frame into the sensor coordinate system. With perfect image data, these systems work well. With uncertain image data, however, their performance is less clear. We examine the effects of 2D sensor uncertainty on the computation of 3D model transformations. We use this analysis to bound the uncertainty in the transformation parameters, and the uncertainty associated with transforming other model features into the image. We also examine the impact of the such transformation uncertainty on recognition methods.

On the Sensitivity of the Hough Transform for Object Recognition

Grimson, W. Eric L., Huttenlocher, David 01 May 1988 (has links)
A common method for finding an object's pose is the generalized Hough transform, which accumulates evidence for possible coordinate transformations in a parameter space and takes large clusters of similar transformations as evidence of a correct solution. We analyze this approach by deriving theoretical bounds on the set of transformations consistent with each data-model feature pairing, and by deriving bounds on the likelihood of false peaks in the parameter space, as a function of noise, occlusion, and tessellation effects. We argue that blithely applying such methods to complex recognition tasks is a risky proposition, as the probability of false positives can be very high.

Page generated in 0.1178 seconds