• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 255
  • 64
  • 23
  • 15
  • 10
  • 6
  • 6
  • 4
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 469
  • 469
  • 118
  • 105
  • 90
  • 89
  • 89
  • 89
  • 76
  • 66
  • 66
  • 61
  • 55
  • 55
  • 54
  • 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.
1

Pattern recognition analysis of in vivo magnetic resonance spectra

Tate, Anne Rosemary January 1996 (has links)
No description available.
2

Advanced process monitoring and control using principal and independent component analysis

Li, Rui Fa January 2003 (has links)
No description available.
3

A note on difference spectra for fast extraction of global image information

Van Wyk, BJ, Van Wyk, MA, Van den Bergh, F 01 June 2007 (has links)
The concept of an Image Difference Spectrum, a novel tool for the extraction of global image information, is introduced. It is shown that Image Difference Spectra are fast alternatives to granulometric curves, also referred to as pattern spectra. Image Difference Spectra are computationally easy to implement and are suitable for real-time applications.
4

Classification multi-modèles des images dans les bases hétérogènes / Multi-model image classification in heterogeneous databases

Kachouri, Rostom 29 June 2010 (has links)
La reconnaissance d'images est un domaine de recherche qui a été largement étudié par la communauté scientifique. Les travaux proposés dans ce cadre s'adressent principalement aux diverses applications des systèmes de vision par ordinateur et à la catégorisation des images issues de plusieurs sources. Dans cette thèse, on s'intéresse particulièrement aux systèmes de reconnaissance d'images par le contenu dans les bases hétérogènes. Les images dans ce type de bases appartiennent à différents concepts et représentent un contenu hétérogène. Pour ce faire, une large description permettant d'assurer une représentation fiable est souvent requise. Cependant, les caractéristiques extraites ne sont pas nécessairement toutes appropriées pour la discrimination des différentes classes d'images qui existent dans une base donnée d'images. D'où, la nécessité de sélection des caractéristiques pertinentes selon le contenu de chaque base. Dans ce travail, une méthode originale de sélection adaptative est proposée. Cette méthode permet de considérer uniquement les caractéristiques qui sont jugées comme les mieux adaptées au contenu de la base d'image utilisée. Par ailleurs, les caractéristiques sélectionnées ne disposent pas généralement des mêmes performances. En conséquence, l'utilisation d'un algorithme de classification, qui s'adapte aux pouvoirs discriminants des différentes caractéristiques sélectionnées par rapport au contenu de la base d'images utilisée, est vivement recommandée. Dans ce contexte, l'approche d'apprentissage par noyaux multiples est étudiée et une amélioration des méthodes de pondération des noyaux est présentée. Cette approche s'avère incapable de décrire les relations non-linéaires des différents types de description. Ainsi, nous proposons une nouvelle méthode de classification hiérarchique multi-modèles permettant d'assurer une combinaison plus flexible des caractéristiques multiples. D'après les expérimentations réalisées, cette nouvelle méthode de classification assure des taux de reconnaissance très intéressants. Enfin, les performances de la méthode proposée sont mises en évidence à travers une comparaison avec un ensemble d'approches cité dans la littérature récente du domaine. / Image recognition is widely studied by the scientific community. The proposed research in this field is addressed to various applications of computer vision systems and multiple source image categorization. This PhD dissertation deals particularly with content based image recognition systems in heterogeneous databases. Images in this kind of databases belong to different concepts and represent a heterogeneous content. In this case and to ensure a reliable representation, a broad description is often required. However, the extracted features are not necessarily always suitable for the considered image database. Hence, the need of selecting relevant features based on the content of each database. In this work, an adaptive selection method is proposed. It considers only the most adapted features according to the used image database content. Moreover, selected features do not have generally the same performance degrees. Consequently, a specific classification algorithm which considers the discrimination powers of the different selected features is strongly recommended. In this context, the multiple kernel learning approach is studied and an improved kernel weighting method is presented. It proved that this approach is unable to describe the nonlinear relationships of different description kinds. Thus, we propose a new hierarchical multi-model classification method able to ensure a more flexible combination of multiple features. Experimental results confirm the effectiveness and the robustness of this new classification approach. In addition, the proposed method is very competitive in comparison with a set of approaches cited in the recent literature.
5

Selection, Analysis and Implementationof Image-based Feature Extraction Approaches for a Heterogenous, Modular and FPGA-based Architecture for Camera-based Driver Assistance Systems

Mühlfellner, Peter January 2011 (has links)
We propose a scalable and fexible hardware architecture for the extraction of image features, used in conjunction with an attentional cascade classifier for appearance-based object detection. Individual feature processors calculate feature-values in parallel, using parameter-sets and image data that is distributed via BRAM buffers. This approach can provide high utilization- and throughput-rates for a cascade classifier. Unlike previous hardware implementations, we are able to flexibly assign feature processors to either work on a single- or multiple image windows in parallel, depending on the complexity of the current cascade stage. The core of the architecture was implemented in the form of a streaming based FPGA design, and validated in simulation, synthesis, as well as via the use of a Logic Analyser for the verification of the on-chip functionality. For the given implementation, we focused on the design of Haar-like feature processors, but feature processors for a variety of heterogenous feature types, such as Gabor-like features, can also be accomodated by the proposed hardware architecture.
6

Optimisation tools for enhancing signature verification

Ng, Su Gnee January 2000 (has links)
No description available.
7

Relational Database for Visual Data Management

Lord, Dale 10 1900 (has links)
ITC/USA 2005 Conference Proceedings / The Forty-First Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2005 / Riviera Hotel & Convention Center, Las Vegas, Nevada / Often it is necessary to retrieve segments of video with certain characteristics, or features, from a large archive of footage. This paper discusses how image processing algorithms can be used to automatically create a relational database, which indexes the video archive. This feature extraction can be performed either upon acquisition or in post processing. The database can then be queried to quickly locate and recover video segments with certain specified key features
8

Wavelet based analysis of circuit breaker operation

Ren, Zhifang Jennifer 30 September 2004 (has links)
Circuit breaker is an important interrupting device in power system network. It usually has a lifetime about 20 to 40 years. During breaker's service time, maintenance and inspection are imperative duties to achieve its reliable operation. To automate the diagnostic practice for circuit breaker operation and reduce the utility company's workload, Wavelet based analysis software of circuit breaker operation is developed here. Combined with circuit breaker monitoring system, the analysis software processes the original circuit breaker information, speeds up the analysis time and provides stable and consistent evaluation for the circuit breaker operation.
9

Facilitation of visual pattern recognition by extraction of relevant features from microscopic traffic data

Fields, Matthew James 10 October 2008 (has links)
An experimental approach to traffic flow analysis is presented in which methodology from pattern recognition is applied to a specific dataset to examine its utility in determining traffic patterns. The selected dataset for this work, taken from a 1985 study by JHK and Associates (traffic research) for the Federal Highway Administration, covers an hour long time period over a quarter mile section and includes nine different identifying features for traffic at any given time. The initial step is to select the most pertinent of these features as a target for extraction and local storage during the experiment. The tools created for this approach, a two-level hierarchical group of operators, are used to extract features from the dataset to create a feature space; this is done to minimize the experimental set to a matrix of desirable attributes from the vehicles on the roadway. The application is to identify if this data can be readily parsed into four distinct traffic states; in this case, the state of a vehicle is defined by its velocity and acceleration at a selected timestamp. A three-dimensional plot is used, with color as the third dimension and seen from a top-down perspective, to initially identify vehicle states in a section of roadway over a selected section of time. This is followed by applying k-means clustering, in this case with k=4 to match the four distinct traffic states, to the feature space to examine its viability in determining the states of vehicles in a time section. The method's accuracy is viewed through silhouette plots. Finally, a group of experiments run through a decision-tree architecture is compared to the kmeans clustering approach. Each decision-tree format uses sets of predefined values for velocity and acceleration to parse the data into the four states; modifications are made to acceleration and deceleration values to examine different results. The three-dimensional plots provide a visual example of congested traffic for use in performing visual comparisons of the clustering results. The silhouette plot results of the k-means experiments show inaccuracy for certain clusters; on the other hand, the decision-tree work shows promise for future work.
10

Facilitation of visual pattern recognition by extraction of relevant features from microscopic traffic data

Fields, Matthew James 15 May 2009 (has links)
An experimental approach to traffic flow analysis is presented in which methodology from pattern recognition is applied to a specific dataset to examine its utility in determining traffic patterns. The selected dataset for this work, taken from a 1985 study by JHK and Associates (traffic research) for the Federal Highway Administration, covers an hour long time period over a quarter mile section and includes nine different identifying features for traffic at any given time. The initial step is to select the most pertinent of these features as a target for extraction and local storage during the experiment. The tools created for this approach, a two-level hierarchical group of operators, are used to extract features from the dataset to create a feature space; this is done to minimize the experimental set to a matrix of desirable attributes from the vehicles on the roadway. The application is to identify if this data can be readily parsed into four distinct traffic states; in this case, the state of a vehicle is defined by its velocity and acceleration at a selected timestamp. A three-dimensional plot is used, with color as the third dimension and seen from a top-down perspective, to initially identify vehicle states in a section of roadway over a selected section of time. This is followed by applying k-means clustering, in this case with k=4 to match the four distinct traffic states, to the feature space to examine its viability in determining the states of vehicles in a time section. The method’s accuracy is viewed through silhouette plots. Finally, a group of experiments run through a decision-tree architecture is compared to the kmeans clustering approach. Each decision-tree format uses sets of predefined values for velocity and acceleration to parse the data into the four states; modifications are made to acceleration and deceleration values to examine different results. The three-dimensional plots provide a visual example of congested traffic for use in performing visual comparisons of the clustering results. The silhouette plot results of the k-means experiments show inaccuracy for certain clusters; on the other hand, the decision-tree work shows promise for future work.

Page generated in 0.1258 seconds